Volume-1 Issue-6

  • Version
  • Download 56
  • File Size 4.00 KB
  • Create Date August 31, 2017
  • Download

  Download Abstract Book

S. No

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

Page No.



Gaurav Jaswal, Rajan Parmar, Amit Kaul

Paper Title:

QRS Detection Using Wavelet Transform

Abstract:    The  paper has  been  inspired  by  the  need  to  find  an  efficient method  for QRS detection which is simple and has good accuracy and less computation time. Our heart acts as the representative of the physiological changes of our body. Electrocardiography (ECG) is the electrical signature of the heart and thus one of the important indicators of our pathological condition. In this paper the Discrete Wavelet Transform is used to detect QRS complex. The DWT approach is found to be better and more accurate than the other common methods when evaluated on MIT/BIH ECG database and the database borrowed from NIT Jalandhar.

  Mean square error, QRS, DWT, ECG 


1.        A.Bayes de Luna (2007): “Basic Electrocardiography”, Blackwell Futura, Chapter 2, pp. 4-5.
2.        Paul S Addison (2005): “Wavelet transform and the ECG: a review”, Institute of Physics Publishing, pp. 155-195.

3.        Robi Polikar, Rowan University, College of Engineering, “The Wavelet Tutorial”, hosted by University Web Server, http://users.rowan,edu/~polikar/WAVELETS/WTpart1.html, October 2004.

4.        B. Saritha, V. Sukanya, Y. Narasimha Murthy(2008):“ECG Signal Analysis Using Wavelet Trsnsforms”, Bulg. J. Phys. 35, pp. 68-77.

5.        Senhadji L, Carrault G, Bellanger J J and Passariello G (1995): “Comparing wavelet transforms for recognizing cardiac patterns”, IEEE Trans. Med. Biol., pp. 13 167-73.

6.        Sahambi J S, Tandon S M and Bhatt R K P(1977a): “Using wavelet transforms for ECG characterization: an on-line digital signal processing   system”, IEEE Eng. Med. Biol., pp. 16 77– 83.

7.        Sahambi J S, Tandon S M and Bhatt R K P(1997b):“Quantitative analysis of errors due to power-line interference and base-line drift in  detection of onsets and offsets in ECG using wavelets”, Med.  Biol. Eng. Comput, pp. 35747–51.

8.        Sahambi J S, Tandon S M and Bhatt R K P, (1998): “Wavelet base ST-segment analysis”, Med. Biol. Eng. Comput., pp. 36568-72.

9.        Sivannarayana N and Reddy D C (1999) :“Biorthogonal wavelet transforms for ECG parameters estimation”, Med. Eng. Phys., pp. 21 167- 74.

10.     K¨ ohler B U, Hennig C and Orglmeister R(2002) :“The principles of software QRS   detection”, IEEE, Eng. Med. Biol., pp. 21 42–57.

11.     Li C, Zheng C and Tai C(1995)“Detection of ECG characteristic points using wavelet transforms”, IEEE Trans. Biomed. Eng., pp. 42 21–8.

12.     Shyu L-Y, Wu Y-H and Hu W(2004) “Using wavelet transform and fuzzy neural network for VPC detection from the Holter ECG”, IEEE Trans. Biomed. Eng. pp. 51 1269–73.

13.     Martinez J P, Almeida R, Olmos S, Rocha A P and Laguna P(2004) “A wavelet-based ECG delineator: evaluation on standard data bases” IEEE Transaction, Biomedical.Engineering, pp. 51 570–81.

14.     Kadambe S,Murray R and Boudreaux-Bartels G F(1994) “Wavelet transform-based QRS complex detector”, IEEE Trans. Biomed. Engineering,  pp. 46 838–48.

15.     Romero Legarreta I, Addison P S, ReedMJ, Grubb N R, Clegg G R, Robertson C E and Watson J N (1999): “Continuous wavelet transform modulus maxima analysis of the electrocardiogram: beat-to-beat characterization and beat-to-beat measurement” Int. J.   Wavelets, Multiresolution Inf. Process, pp. 3 19–42.

16.     Park K L, Lee K J and Yoon H R(1998): “Application of a wavelet adaptive filter  to minimise distortion of the ST- segment”, Med. Biol.  Eng. Comput, pp. 36 581–6.

17.     Park K L, Khil M J, Lee B C, Jeong K S, Lee K J and Yoon H R(2001):“ Design  of a wavelet interpolation filter for enhancement of the ST- segment”,  Med. Biol. Eng. Comput., pp. 39 1–6.

18.     Inoue H and Miyazaki A (1998)“A noise reduction method for ECG signals  using the dyadic wavelet transform”, IEICE Trans. Fundam. vol E81A, pp.  1001–7.

19.     Tikkanen P E(1998) :“Nonlinear wavelet and wavelet packet denoising of electrocardiogram signal”, Biol. Cybernetics, pp. 80 259–67.

20.     Nikoliaev N, Gotchev A, Egiazarian K and Nikolov Z(1998.) “Suppression of electromyogram interference on the electrocardiogram by transform domain denoising”, Med.
Biol. Eng. Comput., pp. 39 649–55.

21.     Sternickel K(2002): “Automatic pattern recognition in ECG time series”, Comput. Methods Prog. Biomed, pp. 68 109–15.

22.     Sternickel K(2002) :“Automatic pattern recognition in ECG time series”, Comput. Methods Prog. Biomed, pp. 68 109–15.

23.     M.A Khayer and M.A Haque (2004):“ECG peak detection using wavelet transform”, 3rd International Conference on Electrical & Computer Engineering, pp. 28-30.

24.     B. Ghaffari, H. Golbayani, M. Ghasemi(2008) “A new mathematical based QRS detector using continuous wavelet transform”, Science  Direct,Computers and Electrical Engineering 34,pp. 81-91.

25.     Yuliyan Velchev, Ognian Boumbaro(2008):“Wavelet transform based ECG characteristic points detector”, International Scientific Conference Computer Science,

26.     G. Umamaheswara Reddy, M. Muralidhar, S.Varadarajan(2009): “ECG De-Noising using improved thresholding based on Wavelet  transforms”,International Journal of Computer Science and Network Security, Vol. 9 No. 9.

27.     K.P Soman, K.I Ramachandran(2004):“Insight into wavelets: From theory to Practice”, Prentice-Hall of India Pvt. Ltd





Vinay.G.R, B.Yogesha, G N Reddy

Paper Title:

Integration of Wireless Hart Into DCS For Asset Monitor Applications

Abstract:   With new firmware upgrade of wireless adapter, wireless HART is ready to redefine process monitoring, preventive maintenance and asset management. It enables users to quickly and easily gain the benefits of wireless technology while maintaining compatibility with the existing HART devices and tools. Wireless HART is designed with strict timing requirements and to be highly reliable and interoperable while being easy to install and operate. This new firmware upgrade was done to strike a proper balance between, simplicity, battery-life and guaranteed real-time wireless communication. In this paper, we present the test suite developed to exercise the wireless HART devices. We discuss the architecture of the test suite, the reliability of the mesh network after firmware upgrade of the wireless adapter and integration of wireless HART into DCS.

   integration, asset management, interoperability


1.        M.A.M. Vieira, D.C. da Silva Jr., C.N. Coelho Jr., and J.M. da Mata., “Survey on wireless sensor network devices,”in Emerging Technologies and Factory Automation (ETFA’03), 2003.
2.        Jianping Song, Song Han, A.K. Mok, Deji Chen, M.Lucas, M. Lucas, M. Nixon, and W. Pratt, “WirelessHART: Applying wireless technology in real time industrial process control,” Real-Time and Embedded Technology and Applications Symposium, RTAS’08. IEEE, pp.337-386, April 2008.

3.        Dick Caro, wireless Networks for Industrial Automation, ISA Press, 2004.

4.        Jr. Edgar H. Callaway and Edgar H. Callaway, wireless Sensor Networks: Architectures and Protocols, CRC Press, August 2003.





Ashima Yadav

Paper Title:

Performance Analysis in Cooperative Communication

Abstract:    In this paper, we have developed a framework for resource allocation in a multi user cooperative wireless network. We have considered centralized and decentralized node-relay assignment with the objective of maximizing the sum throughput. We present an efficient polynomial time centralized assignment algorithm to achieve this objective, and also investigate efficient decentralized schemes that do not require a central authority to perform the allocation. We present a novel message passing based assignment scheme which converges to the optimal value, and present an adapted scheme based on distributed auction theory. We also present a simple sub-optimal greedy assignment strategy and provide empirical data to support its practical significance.

   We present an efficient polynomial time centralized assignment algorithm to achieve this objective,


1.        E.C.vander Meulen, “Threeterminal communication channels,” Advancesin Applied Probability, vol.3,pp.120-154,1971.
2.        T.M. Cover and A.A.G. Gamal, “Capacity theorems for therelay channel”, IEEE Trans. Info Theory,vol.25,no.5,pp.572-584,1979.

3.        A. Sendonaris, E. Erkip, and B. Aazhang, “Usercooperationdiversity- partI,II”,IEEETransactionsonCommunications,vol.51,pp.1927-1948,2003.

4.        J.N. Laneman, D.N.C. Tse, and G.W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,”IEEE Transaction son Information Theory,vol.50,pp.3062-3080,2004.

5.        J.N. Laneman and G.W. Wornell, “Distributed space-time- coded protocols for exploiting cooperative diversity in wireless networks,”IEEETransactionsonInformationTheory,vol.49,pp.2415-2425,2003.

6.        A. Nosratinia, T.E. Hunter and A. Hedayat, “Cooperative communication in wireless networks”, IEEE Communication Magazine, October 2004.

7.        T.Ngand W.Yu, “Joint optimization of relay strategies and resource allocations in cooperative cellular networks”, IEEE Journal on Selected Areasin Communications, vol25, no.2, pp.328-339, 2007.

8.        B.Wang, Z.Han, and K.J.R.Liu, “Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Buyer / Seller Game”, in Proc. IEEEINFOCOM, Anchorage,AK,May2007.





Pushkar Venkatesh Kulkarni, N. K. Chapkhhane

Paper Title:

Development and testing of PTFE based Composite Bearing Material for Turbine Pump

Abstract:    In Vertical submerged turbine pumps the long shafts are supported at intervals by transmission bearings. The radial load acting on shaft is taken care by the intermediate bearings. These transmission bearings are lubricated by the flowing liquid through pump. During starting as water level is below line shaft bearing it requires prepublication before start.  Selection of the bearing material becomes critical in situations where we don’t have pre lubrication water available. Also remote start and stop is difficult. In this scenario pump runs dry during initial start. Our aim is to develop bearing which will take care of dry running. When pumped water is sea water / raw water containing sand/abrasive particles then line shaft sleeve bearing should withstand against wear. To cater the problems in conventional bearings and to find the appropriate bearing material focus is given on latest trends & Tribological developments in the world. Different PTFE based composite bearing. In this study, composite materials were comparatively investigated under actual load and sliding velocities by using in a Pump. The influence of inorganic fillers MoS2, on the wear of the glass & bronze fabric reinforced epoxy composites under dry & wet running conditions has been checked. Bronze filled PTFE bearing are found excellent and will serve as an alternative to conventional bearings.

   PTFE, Composite bearings, fillers, Vertical turbine pump. 


1.       A. J. Stepanoff, John Wiley and Sons “Centrifugal and Axial flow pumps” - Theory, Design & Application - 2nd edition 1957.
2.       Stephen Lazarkiewicz and Adam T. Troskolanski, Pergamon Press Ltd. - “Impeller pumps” - 1st edition 1965.

3.       Val S. Lobanoff and Robert R. Ross, Gulf publishing Company - “Centrifugal Pumps design and application” - 2nd editions 1995.

4.       Robert L. Fusaro & team from NASA - “Self lubricated Polymer Composite and Polymer transfer film lubrication” - 1st edition 1990

5.       B. Suresha & Team - Journals of Minerals & Material Characterization & Engineering USA “The role of fillers on Friction and Slide Wear Characteristics in Composite System”

6.       Yanchun Han & team – “Micro friction studies of filled PPS / PTFE composite blends”

7.       Mr. Seiji Yamajo and Mr. Fumitaka Kikkaw - "Development and Application of PTFE Compound Bearings" dynamic positioning conference, by - 1st edition 2004

8.       Yunxia Wang and Fengyuan Yan - "Tribological properties of transfer films of PTFE-based composites" named paper published in science direct 1-st edition 2006

9.       H.Bongers  - “The dynamics of rubber bearings” 1st edition 2000

10.     Augusto E. Barton Martinelli  - “Rubber bearings for precision positioning systems” by - 1st edition 2005

11.     Keith Laskey, PhD, Thordon Bearings,  “Non-metallic pump bearings” by 1st edition 2008

12.     J. Bijwe, - “Wear failures of reinforced polymers, in: Failure Analysis and Prevention” by vol. 11, ASM Handbook, ASM International, OH, USA, 2002

13.     K. Friedrich - “Wear models for multiphase materials and synergistic effects in polymeric hybrid composite, in: Advances in Composite Tribology, Composites Materials” 1993

14.     K. Friedrich, J. Mater. - “Fretting fatigue failure of polyester resin and its glass fiber mat composites”, Sci. 21 (1986) 1700-1706.

15.     P. Rehbein, J. Wallaschek,- “Friction and wear behavior of polymer/ steel and alumina/alumina under high frequency fretting conditions, Wear” 216 (1998) 97-105.

16.     J. Bijwe, S.K. Sharma - “Wear studies on solid lubricated polyimide composite, in: Proc. of the LAWPSP Sym”., IIT Mumbai

17.     Kirloskar Brothers Limited - “Rotodynamic Pumps” Published in 2001

18.     web: http://pump-magazine.com

19.     American standard for vertical turbine pumps – “ANSI B58.1-1971 (AWWA-E-101-71)”

20.     American Petroleum Institute “ API 610 – ISO 13709: 2009 (E)





Dilip Vishwakarma, Deepak Chopra

Paper Title:

An Efficient Attack Detection System for Mobile Ad-hoc Network

Abstract:   A mobile ad hoc network (MANET) is a wireless network that does not rely on any fixed infrastructure (i.e., routing facilities, such as wired networks and access points), and whose nodes must coordinate among themselves to determine connectivity and routing. The traditional way of protecting networks is not directly applicable to MANETs. Many conventional security solutions are ineffective and inefficient for the highly dynamic and resource-constrained environments where MANET use might be expected. Since prevention techniques are never enough, intrusion detection systems (IDSs), which monitor system activities and detect intrusions, are generally used to complement other security mechanisms. How to detect intrusions effectively and efficiently on this highly dynamic, distributed and resource-constrained environment is a challenging research problem. In this paper, we investigate the use of evolutionary computation techniques for synthesizing intrusion detection programs on MANETs. We evolve programs to detect the following attacks against MANETs: dropping attacks and power consumption attack. The proposed system is a novel architecture that uses knowledge-based intrusion detection techniques to detect the attacks that an adversary can perform against the routing fabric of mobile ad hoc networks. Moreover, the system is designed to take countermeasures to minimize the effectiveness of an attack and keep the performance of the network within acceptable limits. The novelty of the system lies in the usage of timed finite state machines that enable the real-time detection of attacks. Our system does not introduce any changes to the underlying routing protocol and operates as an intermediate component between the network traffic and the routing protocol. The system was developed and tested to operate in AODV-enabled networks. Our experimental results compare with normal AODV, under attack AODV and the results is more efficient than existing works



1.        Zeyad M. Alfawaer and Saleem Al_zoubi, “A proposed Security subsystem for Ad Hoc Wireless Networks”, IEEE 2009 International Forum on Computer Science-Technology and Applications, pp 253-256.
2.        Matthew Tan Creti, Matthew Beaman, Saurabh Bagchi, Zhiyuan Li, Yung-Hsiang Lu, “Multigrade Security Monitoring for Ad-Hoc Wireless Networks”, 978-1-4244-5113-5/09, IEEE 2009, pp 342-352.

3.        Wenchao Huang, Yan Xiong, Depin Chen, “DAAODV: A Secure Ad-hoc Routing Protocol based on Direct Anonymous Attestation”, IEEE 2009 International Conference on Computational Science and Engineering, pp 809-816.

4.        Wenjuan Li and Lingdi Ping and  Xuezeng Pan, “Use Trust Management Module to Achieve Effective Security Mechanisms in Cloud Environment” IEEE 2010 International Conference on Electronics and Information Engineering (ICEIE 2010).

5.        Haider Abbas, Christer Magnusson, Louise Yngstrom and Ahmed Hemani, “A Structured Approach for Internalizing Externalities Caused by IT Security Mechanisms”, IEEE 2010 Second International Workshop on Education Technology and Computer Science.

6.        Wei Ren, Yoohwan Kim, Ju-Yeon Jo, Mei Yang3 and Yingtao Jiang, “IdSRF: ID-based Secure Routing Framework for Wireless Ad-Hoc Networks”, IEEE International Conference on Information Technology (ITNG'07).

7.        Anand Patwardhan and Michaela Iorga, “Secure Routing and Intrusion Detection in Ad Hoc Networks”, Proceedings of the 3rd IEEE Int’l Conf. on Pervasive Computing and Communications (PerCom 2005).

8.        A.H Azni, Azreen Azman, Madihah Mohd Saudi, AH Fauzi, DNF Awang Iskandar, “Analysis of Packets Abnormalities in Wireless Sensor Network”, IEEE 2009 Fifth International Conference on MEMS NANO, and Smart Systems, pp 259-264.

9.        Cuirong Wang, Shuxin Cai and Rui Li, “AODVsec: A Multipath Routing Protocol in Ad-Hoc Networks for Improving Security”, IEEE 2009 International Conference on Multimedia Information Networking and Security, pp 401-404.

10.     A Nagaraju and B.Eswar, “Performance of Dominating Sets in AODV Routing protocol for MANETs”, IEEE 2009 First International Conference on Networks & Communications, pp 166-170.

11.     Sheng Cao and Yong Chen, “AN Intelligent MANet Routing Method MEC”, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp 831-834.

12.     WANG Xiao-bo,YANG Yu-liang, AN Jian-wei, “Multi-Metric Routing Decisions in VANET”, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp 551-556.





S. Ravi Chandra Kishore, K.V. Ramana Rao

Paper Title:

Implementation of carry-save adders in FPGA

Abstract:    The addition operations can be optimized through a special purpose carry propagation logic in most of the FPGAs. The delay is same for small size operands and this redundant adders require more hardware resources than carry propagate adders. Therefore, carry-save adders are not usually implemented on FPGA devices, although they are very useful in ASIC implementations. In this paper we have showed that it is possible to implement redundant adders with a hardware cost close to that of a carry propagate adder. Redundant adders are clearly faster for 16 bits and bigger word lengths and have an area requirement similar to carry propagate adders. Among all the redundant adders studied, the 4:2 compressor is the fastest one, presents the best exploitation of the logic resources within FPGA slices and the easiest way to adapt classical algorithms to efficiently fit FPGA resources. This design aimed to be implemented in Spartan-3E FPGA. The CSA architecture uses 1215 LUT’s out of available 3840  and 96 IO blocks and the average fan-out of non clock nets is 4.73 and the peak memory usage is 148 MB.

   ASIC, redundant adders, FPGA.


1.        J.-L. Beuchat and J.-M. Muller, “Automatic generation of modular mul-tipliers for fpga applications,” IEEE Transactions on Computers, vol. 57, no. 12, pp. 1600–1613, December 2008.
2.        J. Detrey, F. de Dinechin, and X. Pujol, “Return of the hardware floating-point elementary function,” in Proceedings of the 18th IEEE Symposium on Computer Arithmetic (Montpellier, France), Kornerup and Muller, Eds. Los Alamitos, CA: IEEE Computer Society Press, June 2007, pp. 161–168.

3.        H. Eberle, G. N., S. Shantz, V. G upta, L. Rarick, and S. Sundaram, “A public-key cryptographic processor for RSA and ECC,” in Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors (ASAP2004), September 2004.

4.        H. R. Ismail, R.C., “High performance complex number multiplier using booth-wallace algorithm,” in IEEE International Conference on Semiconductor Electronics ICSE, November 2006.

5.        K. Manochehri and S. Pourmozafari, “Modified radix-2 montgomery modular multiplication to make it faster and simpler,” in IEEE International Conference on Information Technology: Coding and Computing, ITCC 2005 , April 2005.

6.        M.D.ErcegovacandT.Lang, Digital Arithmetic. Morgan Kaufmann Publishers, 2004.





Prashant, Nidhi Sharma

Paper Title:

An Introduction to Component – Oriented Software Technology

Abstract:    Modern software systems are increasingly required to be open and distributed. Such systems are open not only in terms of network connections and interoperability support for heterogeneous hardware and software platforms, but, above all, in terms of evolving and changing requirements. Although object-oriented technology offers some relief, to a large extent the languages, methods and tools fail to address the needs of open systems because they do not escape from traditional models of software development that assume system requirements to be closed and stable. In this paper we have discussed that open systems requirements can only be adequately addressed by adopting a component oriented as opposed to a purely object-oriented software development approach, by shifting emphasis away from programming and towards generalized software composition.

   Component, Object, Composition, Static.


1.        Pierre America, “A Parallel Object-Oriented Language with Inheritance and Subtyping,” Proceedings OOPSLA/ECOOP, ACM SIGPLAN Notices, vol. 25, pp. 161–168.
2.        Gilad Bracha, ‘‘The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance,’’ Ph.D. thesis, Dept. of Computer Science, University of Utah, March 1992.

3.        Kim B. Bruce and Giuseppe Longo, “A Modest Model of Records, Inheritance, and Bounded Quantification” in Information and Computation, vol. 87, 196–240.

4.        Luca Cardelli, “Obliq: A Language with Distributed Scope,” preliminary draft.

5.        Eduardo Casais, ‘‘An Incremental Class Reorganization Approach,’’ ed. O. Lehrmann Madsen, Lecture Notes in Computer Science, vol. 615, Springer-Verlag, Utrecht, pp. 114–132.

6.        William Cook, Walter Hill and Peter Canning, ‘‘Inheritance is not Subtyping,’’ Proceedings POPL ’, San Francisco, pp. 125–135.

7.        Mariangiola Dezani-Ciancaglini, Ugo de’Liguoro, Adolfo Piperno, “Fully Abstract Semantics for Concurrent Lambda-calculus,” in Proceedings TACS ’94, Lecture Notes in Computer Science, vol. 789, Springer-Verlag,, pp. 16–35.

8.        Uffe Engberg and M. Nielsen, ‘‘A Calculus of Communicating Systems with Label Passing,’’ DAIMI PB-208, University of Aarhus.

9.        Kathleen Fisher and John C. Mitchell, “Notes on Typed Object-Oriented Programming,” in Proceedings TACS, Lecture Notes in Computer Science, vol. 789, Springer-Verlag, Utrecht, pp. 844– 885.

10.     Erich Gamma, Richard Helm, Ralph E. Johnson and John Vlissides, “Design Patterns: Abstraction and Reuse of Object-Oriented Design,” Proceedings ECOOP, Lecture Notes in Computer Science, Springer-Verlag, vol. 707, pp. 406–431.

11.     Joseph A. Goguen, “Reusing and Interconnecting Software Components,” in IEEE Computer, pp. 16–27.

12.     Adele Goldberg and Kenneth S. Rubin, Succeeding with Objects: Decision Frameworks for Project Management, Addison-Wesley.

13.     Carl A. Gunter and John C. Mitchell, Theoretical Aspects of Object-Oriented Programming, MIT Press, Cambridge, Mass.

14.     Robert Harper and Mark Lillibridge, “A Type-Theoretic Approach to Higher-Order Modules with Sharing,” in Proceedings POPL , ACM Press, pp. 123–137.

15.     Matthew Hennessy, “A Fully Abstract Denotational Model for Higher-Order Processes,” in Information and Computation, vol. 112(1), pp. 55–95,

16.     Andreas Hense, “Polymorphic Type Inference for Object-Oriented Programming Languages,” Dissertation, Saarbrücken, Pirrot.

17.     John Hogg, “Islands: Aliasing Protection in Object-Oriented Languages,” in Proceedings OOPSLA, ACM SIGPLAN Notices, vol. 26, no. 11, pp. 271–285.

18.     Kohei Honda and Mario Tokoro, ‘‘An Object Calculus for Asynchronous Communication,’’ Proceedings ECOOP ’91, ed. P. America, Lecture Notes in Computer Science, vol. 512, Springer-Verlag, Geneva, July, pp. 133– 147.

19.     Paul Hudak, Simon Peyton Jones and Philip Wadler (eds), ‘‘Report on the Programming Language Haskell A Non-Strict, Purely Functional Language (Version 1.2),’’ ACM SIGPLAN Notices, vol. 27, no. 5.

20.     IEEE Software, Software Reuse, vol. 11, no. 5.

21.     Ralph E. Johnson and Brian Foote, ‘‘Designing Reusable Classes,’’ Journal of Object-Oriented Programming, vol. 1, no. 2, pp. 22–35.

22.     Ralph E. Johnson, “Documenting Frameworks using Patterns,” Proceedings OOPSLA ’, ACM SIGPLAN Notices, vol. 27, no. 10,, pp. 63–76.

23.     Neil D. Jones, “Static Semantics, Types, and Binding Time Analysis,” Theoretical Computer Science, vol. 90,, pp. 95–118.

24.     Dennis G. Kafura and Keung Hae Lee, ‘‘Inheritance in Actor Based Concurrent Object-Oriented Languages,’’ Proceedings ECOOP , ed. S. Cook, Cambridge University Press, Nottingham, pp. 131–145.

25.     Gregor Kiczales, Jim des Rivières and Daniel G. Bobrow, The Art of the Metaobject Protocol, MIT Press, Cambridge, Mass.

26.     John Lamping, ‘‘Typing the Specialization Interface,’’ Proceedings OOPSLa, ACM SIGPLAN Notices, vol. 28, no. 10, pp. 201–214.

27.     Xavier Leroy, “Manifest Types, Modules, and Separate Compilation,” in Proceedings POPL’ACM Press, pp. 109–122.

28.     Satoshi Matsuoka and Akinori Yonezawa, ‘‘Analysis of Inheritance Anomaly in Object-Oriented Concurrent Programming Languages,’’ Research Directions in Concurrent Object-Oriented Programming, ed. G. Agha, P. Wegner and A. Yonezawa, MIT Press, Cambridge, Mass. pp. 107–150.

29.     M.D. McIlroy, ‘‘Mass Produced Software Components,’’ Software Engineering, ed. P. Naur and B. Randell, NATO Science Committee, pp. 138–150.

30.     Bertrand Meyer, Object-Oriented Software Construction, Prentice Hall, Englewood Cliffs, NJ,.

31.     Robin Milner, Communication and Concurrency, Prentice Hall, Englewood Cliffs, NJ,.

32.     Robin Milner, ‘‘The Polyadic pi Calculus: a tutorial,’’ ECS-LFCS-91-180, Computer Science Dept., University of  Edinburgh.

33.     Robin Milner, Joachim Parrow and David Walker, ‘‘A Calculus of Mobile Processes, Part I/II,’’ Information and Computation, vol. 100, pp. 1–77.

34.     Robin Milner, Mads Tofte and Robert Harper, The Definition of Standard ML, MIT Press, Cambridge, Mass..

35.     Peter D. Mosses, “Denotational Semantics,” in ed. J. van Leuwen, Handbook of Theoretical Computer Science,vol. B, Elsevier, Amsterdam, pp. 575–631.

36.     Next Computer, Inc. and SunSoft, Inc., OpenStep Specification,

37.     Oscar Nierstrasz, ‘‘Towards an Object Calculus,’’ Proceedings of the ECOOP ’ Workshop on Object-Based Concurrent Computing, ed. M. Tokoro, O. Nierstrasz, P. Wegner, Lecture Notes in Computer Science, vol. 612, Springer-Verlag, pp. 1–20,.

38.     Oscar Nierstrasz, Simon Gibbs and Dennis Tsichritzis, ‘‘Component-Oriented Software Development,’’ Communications of the ACM, vol. 35,  pp. 160–165.

39.     Oscar Nierstrasz, ‘‘Composing Active Objects,’’ Research Directions in Concurrent Object-Oriented Programming, ed. G. Agha, P. Wegner and A. Yonezawa, MIT Press, Cambridge, Mass.,pp. 151–171.

40.     Michael Papathomas and Oscar Nierstrasz, ‘‘Supporting Software Reuse in Concurrent Object- Oriented Languages: Exploring the Language Design Space,’’ Object Composition, ed. D. Tsichritzis, Centre Universitaire d’Informatique, University of Geneva,, pp. 189–204.

41.     Alan Snyder, ‘‘Encapsulation and Inheritance in Object-Oriented Programming Languages,’’ Proceedings OOPSLA , ACM SIGPLAN Notices, vol. 21, pp. 38–45.

42.     Dennis Tsichritzis, ‘‘Object-Oriented Development for Open Systems,’’ Information Processing (Proceedings IFIP), North-Holland, San Francisco, pp. 1033–1040.

43.     Jon Udell, “Componentware,” in Byte, vol. 19, pp. 46–56.





Anjana Bhardwaj, Manish, A. K. Arora

Paper Title:

A Comparison of the SOFM with LVQ, SOFM without LVQ and Statistical Technique

Abstract:    The shapes and firing rates of MUAP’s (motor unit action potentials) in an EMG (electromyographic) signal provide an important source of information for the diagnosis of neuromuscular disorders. In order to extract this information from EMG signals recorded at low to moderate force levels, it is required: i) to identify the MUAP’s composing the EMG signal, ii) to classify MUAP’s with similar shape. For the classification of MUAP’s two different pattern recognition techniques are presented: i) An artificial neural network (ANN) technique based on unsupervised learning, using a modified version of the self-organizing feature maps (SOFM) algorithm and learning vector quantization (LVQ), and ii) A statistical pattern recognition technique based on Euclidean distance.  A total of 521 MUAP’s obtained from 2 normal subjects, 4 subjects suffering from myopathy, and 5 subjects suffering from motor neuron disease were analyzed. The success rate for the ANN technique was 97.6%, the success rate for SOFM technique was 94.8%, and for statistical technique it was 95.3%. So SOFM technique along with LVQ is batter technology than the SOFM without LVQ technique and Statistical technique.

   Artificial Neural Network, Electromyography, learning vector quantization, Motor unit Action Potentials, Self-organizing feature maps.


1.        E. Stalberg, S. Andreassen, B. Falck, H. Lang, A. Rosenfalck, and W.Trojaborg, “Quantitative analysis of individual motor unit potentials: A proposition for standardized terminology and criteria for measurement,” J. Clin. Neurophysiol., vol. 3, no. 4, pp. 313–348, 1986.
2.        L. J. Dorfman and K. C. McGill, “AAEE minimonograph #29: Automatic quantitative electromyography,” Muscle and Nerve, vol. 11, pp. 804–818, 1988.

3.        R. S. LeFever and C. J. DeLuca, “A procedure for decomposing the myoelectric signal into its constituent action potentials: I. Technique, theory and implementation,” IEEE Trans. Biomed. Eng., vol. BME-29,pp. 149–157, Mar. 1982.

4.        “A procedure for decomposing the myoelectric signal into its constituent action potentials: II. Execution and test for accuracy,” IEEE Trans. Biomed. Eng., vol. BME-29, pp. 158–164, Mar. 1982.

5.        E. Stalberg, B. Falck, M. Sonoo, S. Stalberg, and M. Astrom, “Multi- MUP EMG analysis—A two year experience in daily clinical work,” Electroencelography and Clinical Neurophysiology 97. Amsterdam, the Netherlands: Elsevier Science, 1995, pp. 145–154.

6.        P. Guihenec, J. Calamel, C. Doncarli, D. Gitton, and C. Michel, “Automatic detection and pattern recognition of signal motor unit potentials in needle EMG,” Computer-Aided Electromyography—Progress in Clinical Neurophysiology, vol. 10, J. E. Desmedt, Ed. Amsterdam,the Netherlands: Elsevier Science, 1983, pp. 73–127.

7.        S. Andreassen, “Methods for computer-aided measurement of motor unit parameters,” in Proc. The London Symp., R. J. Ellington et al., Eds., 1987, EEG suppl. 39, pp. 13–20.

8.        C.S. Pattichis, C.N. Schizas, and L.T. Mittleton, “Neural network models in EMG diagnosis,” IEEE Trans. Biomed. Eng., vol. 42, pp. 486–496, May 1995.

9.        S. Haykin, Neural Networks—A Comprehensive Foundation. New York: Macmillan College., 1994.

10.     B. Kroesse and P. Van der Smagt, An Introduction to Neural Networks. Amsterdam, the Netherlands: Univ. Amsterdam Press, 1993.

11.     T. Kohonen, “The self-organizing map,” Proc. IEEE, vol. 78, pp. 1464–1480, Sept. 1990.

12.     R. P. Lippmann, “An introduction to computing with neural nets,” IEEE Acoust., Speech, Signal Processing, Mag., vol. 4, pp. 4–22, Apr. 1987.

13.     C. N. Schizas, C. S. Pattichis, and C. A. Bonsett, “Medical diagnostic systems: A case for neural networks,” Technol., Health Care, vol. 2, pp.1–18, 1994.





Bashar Sarayreh, Ammar Mardawi, Rakan Dmour

Paper Title:

Comparative Study: The Nonaka Model of Knowledge Management

Abstract:    Knowledge Management went through a major transition from straightforward models which focused on the dichotomy of tacit and explicit knowledge to sophisticated frameworks which included specific processes. In this paper we outline the emergence of knowledge management as a distinct academic discipline to locate Nonaka’s work. Our immediate objective is to provide a comprehensive comparison of the most noteworthy discussions and criticism of the Nonaka model for Knowledge Management before and after the year 2000. Finally, we close by considering a series of key examples of the Nonaka model as deployed in industry. Up to the year 2000 or thereabouts, it was augured the model was rather simplistic and the desire to codify everything was not possible. Much of the critique of Nonaka following 2000 focused on the seeming subjectiveness of his vision of knowledge and the inadequacy of the SECI structure in a time of radically different communication technologies [5][6][11]. Finally, we show that most of published case studies on the idea of converting tacit knowledge to explicit in the ICT sector are out of date[1][3]. We conclude that knowledge management, conversion, and codifying requires further research and development to take in consideration the tacit origins of knowledge and the rapidly changing methods of communication.

   Knowledge Management, Nonaka’s Model, knowledge codifying, SECI model


1.       Nonaka, Ikujiro; Takeuchi, Hirotaka (1995). The knowledge creating company: how Japanese companies create the dynamics of innovation. New York: Oxford University Press.
2.       Nonaka I, Krogh G (2009). Tacit Knowledge and Knowledge Conversion:Controversy and Advancement in Organizational Knowledge Creation Theory, Organization Science Vol. 20, No. 3, May–June 2009, pp. 635–652

3.       Aghdasi, M and Ghanbar, T (2010) Knowledge creation in an operational setting: A case study in an auto manufacturing firm in African Journal of Business Management Vol. 5(19), pp. 7828-7835

4.       McCormick, J. (2007). 5 Big Companies That Got Knowledge Management Right. CIO Insight. Published 5th of October, 2007.

5.       Essers, J. and Schreinemakers, J. (1997); Nonaka's Subjectivist Conception of Knowledge in Corporate Knowledge Program, Knowledge Organization, Vol. 24, No. 1, 1997, p24-32.

6.       Bereiter, C. (2002). Education and mind in the knowledge age, Mahwah, NJ; London: Lawrence Erlbaum Associates.

7.       Essers, J. and Schreinemakers, J. (1997). Nonaka's subjectivist conception of knowledge in corporate knowledge management. Knowledge Organization, 24, 1, 24-32.

8.       Gourlay, Stephen (2003), "The SECI model of knowledge creation: some empirical shortcomings", 4th European Conference on Knowledge Management, Oxford, England, 18-19 Sep 2003.

9.       Gourlay, S. N. (2006) Conceptualizing knowledge creation: a critique of Nonaka's theory,Journal of Management Studies 43(7), 1415-1436.

10.     Gourlay, S. N. (2006) towards conceptual clarity concerning 'tacit knowledge': a review of empirical studies, Knowledge Management Research and Practice 4(1), 60-69.

11.     Jorna, R. (1998). Managing knowledge. Semiotic Review of Books, 9, 2,

12.     Nonaka I (1991). The knowledge creating company. Harv. Bus. Rev., 96-104.

13.     Nonaka I (1994). "A dynamic theory of organizational knowledge creation". Organ. Sci., 5: 14-37.

14.     Nonaka I, Konno N (1998). The concept of building a foundation for knowledge creation. Calif. Manage. Rev., 40(3): 40-54.

15.     Nonaka I, Ichijo K (2007). Knowledge Creation and Management: New Challenges for Managers, Oxford University press (Ed.).





Riju Bhattacharya, Kamal K. Mehta

Paper Title:

Using Comfort Related Data of Indian Railways   for Fault Finding On Track: A Case Study with  Multiple Profile

Abstract:    Derailment has always been one of the major concerns for railway. It is a unique challenge for railways to ensure that wheels stay on the rail. Railway technologies have advanced significantly in recent years and safety levels are high compared with the early days and also compared with other transport modes. Derailments however, unfortunately, still frequently occur. The issue of comfort in respect to vibration has become a common question to the railways since vibration plays a major role for ride comfort and ability to perform desk activities. Several factors influence vibration discomfort in relation to passenger activities, e.g. seat design, seated posture, use of backrest, etc. To avoid derailments, railway collect comfort related data from multiple profile trains (i.e. Express, Superfast, passenger’s trains etc) for finding the damage among thousands of tracks when trains travel from one station to another station. In this study we analyzed the received data on the basis of ENV12299 standard and using Visual Studio 6.0. MS Access database is used to store the report data. The frequency variations observed during the experiment relate only to the cause of losing lateral control at wheel and rail interface.

   Railway, Derailment mechanisms, Vibrations, Lateral control


1.       R. Narayanamoorthy, V.K.Goel, V.H.Saran, “Vibration Measurement – A Tool for Evaluating Activity Confort In Trains”.
2.       Griffin, M. J., 2003. Handbook of Human Vibration, Academic Press.

3.       SUZUKI, H., 1998. Research trends on riding comfort evaluation in Japan. Proceedings of the Institution of Mechanical Engineers Part F - Journal of Rail and Rapid Transit, 212(1), pp. 61-72.

4.       ENV12299; 1999: Railway applications: Ride comfort for passengers – Measurements and evaluation.

5.       Huimin Wu and Nicholas Wilson, Handbook of Railway Vehicle Dynamics

6.       On the Influence of Rail Vehicle Parameters on the Derailment Process and its Consequences, Dan Brabie, Licentiate Thesis

7.       Instrumented Wheel set System Results Verified the High Speed Safety Standards, US Department of Transportation, Federal Railroad Administration, NOVEMBER 2000

8.       Nadal, M.J., Locomotives a Vapeur, Collection Encyclopedie Scientifique, Biblioteque de Mecanique Appliquee et Genie, Vol. 186, Paris, 1908.

9.       Blader, F.B., A Review of Literature and Methodologies in the Study of Derailments Caused by Excessive Forces at the Wheel/Rail Interface, Association of American Railroads Report R-717, December 1990.

10.     CEN (1999): Railway applications – Ride comfort for passengers – Measurements and evaluation (ENV 12299). Brussels: CEN.





Misam Abidi, Mangulkar Madhuri. N.

Paper Title:

Review on Shear Wall for Soft Story High-Rise Buildings

Abstract:   Severe  structural  damage  suffered  by  several  modern  buildings  during  recent earthquakes  illustrates  the  importance  of  avoiding  sudden  changes  in  lateral  stiffness  and strength.  Recent  earthquakes  that  occurred  have  shown  that  a  large  number  of  existing reinforced  concrete  buildings  are  vulnerable  to  damage  or  even  collapse  during  a  strong earthquake. While damage and collapse due to soft story are most often observed in buildings, they can also   be developed in other types of structures.  The lower level containing the concrete columns behaved as a soft story in that the columns were unable to provide adequate shear resistance during the earthquake. So, in this paper  highlights the importance  for immediate measures to prevent the indiscriminate use of soft first story in buildings, which are designed without regard to the increased displacement, ductility and force demands in the first story and this paper argues the importance of  novel design approach which has an advantage of interaction between rigid frames and  shear  walls. A  combination  of  the  two  structural  components  leads  to  a  highly  efficient system, in which the shear wall resists the majority of the lateral loads in the lower portion  of  the  building,  and  the  frame  supports  the  majority  of  the  lateral  loads  in  the  upper portion  of  the  building

   High rise buildings, RC frame linear behavior of shear wall, Soft Story /Weak Story.


1.       Nevzat Kirac, Mizam Dogan, Hakan Ozbasaran. “Failure of weak-storey during earthquakes”.  Engineering Failure Analysis 2011, 18;572–581
2.       Khan F.R. and Sbarounis.J.A, “Interaction of shear walls and frames. Journal of the Struct.Div”, ASCE, 90(3).1964, 285-335.

3.       Marie-Jose  Nollet  and  Bryan  Stafford Smith. “Behavior of curtailed wall – frame structures”. Journal of Structural Engineering, October 1993, Vol. 119, No.10; 2835-54.

4.       Frank Lam,Helmut G. L. Prion,z and Ming He. “Lateral resistance of wood shear walls with large sheathing panels”. Journal of structural engineering, December 1997, Vol.123, No. 12; 1667-73

5.       Jaswant N. Arlekar,  Sudhir K. Jain  and C.V.R. Murty. “Seismic response of RC frames buildings with soft first storeys”. Proceedings of the CBRI Golden Jubilee Conference on Natural Hazards in Urban Habitat, 1997, New Delhi

6.       Y. K. Wen and S.-H. Song. “Structural Reliability / Redundancy under Earthquakes” .Journal of Structural Engineering, January 1, 2003, Vol. 129, No. 1; 1- 56–67.

7.       Rahul RANA,Limin JIN and Atila ZEKIOGLU. “Pushover analysis of a 19 story concrete shear wall Building”. 13th World Conference on Earthquake Engineering. Vancouver, B.C., Canada August 1-6, 2004; 133

8.       Qiuhong Zhao,Abolhassan Astaneh-Asl . “Cyclic behavior of traditional and innovative composite shear walls”. Journal of Structural Engineering, February 1, 2004, Vol. 130, No.2; 2-271–284.

9.       Han-Seon Lee, Dong-Woo Ko. “Seismic response characteristics of high-rise RC wall buildings having different irregularities in lower stories”. Journal of Structural Engineering, February 1, 2004, Vol. 130, No.2; 2-271–284

10.     O.Esmaili,S.Epackachi,M.Samadzad,S.R.Mirghaderi. “Study of structural RC shears wall system in a 56-story RC tall building”. The 14thWorld Conference on Earthquake Engineering, Beijing, China. October 12-17, 2008.

11.     M. Ashraf, Z.A. Siddiqi, M.A.Javed. “Configuration of a multistory building subjected to lateral forces”. Asian journal of civil engineering (building and housing), (2008),vol. 9, no. 5; 525-537.

12.     Shahabodin.Zaregarizi. “Comparative investigation on using shear wall and infill to improve seismic performance of existing buildings”. The 14th World Conference on Earthquake Engineering, Beijing, China. October 12-17, 2008.

13.     Anshuman. S, Dipendu Bhunia, Bhavin Ramjiyani.“Solution of shear wall location in multi­storey building” .International journal of civil and structural engineering, 2011, Vol.02, no 02; 493-506

14.     R. S. Malik, S. K. Madan, V. K. Sehgal. “Effect of height on seismic response of reinforced cement concrete framed buildings with curtailed shear wall”. Journal of Engineering and Technology, Jan-Jun 2011, Vol. 01, Issue 1; 43-46

15.     S.V.Venkatesh,H.Sharada bai, “Effect of internal & external shear wall on performance of building frame subjected to lateral load”. International Journal of Earth Sciences and Engineering, October 2011, Vol. 04, No 06; 571-576.





Rintu S Abraham, Veena S

Paper Title:

Active Noise Control Using IIR Adaptive Filter

Abstract:    Noise control is essential from the point of view of health, conversation and communication. Traditionally reduced noise levels are achieved by means of passive absorbers like foam, perforated boards etc. But due to their size and weight, the passive absorbers are not suitable for mobile vehicles like aircrafts, helicopters and cars at low frequencies (50-500 Hz). This calls for an alternative technology,  ACTIVE NOISE CONTROL (ANC). Generally, algorithms based on adaptive FIR structure with number of coefficients ranging up to hundreds are used in active noise control and this increases the computational burden on the processor. Compared to FIR filters, in this project IIR filters are used that can model a physical system efficiently with less number of coefficients due to its inherent pole-zero structure. The poles of an IIR filter make it possible to obtain well-matched characteristics with a lower-order structure, thus requiring fewer arithmetic operations.



1.        S.V Narasimhan and S. Veena,“Signal processing principles and implementation,’’ Alpha     Science International, 15-Jun-2005.
2.        S.M. Kuo, D.R. Morgan,“Active Noise Control Systems, Algorithms and DSP  Implementations,” Wiley, New York, 1996.

3.        Paulo S.R.Diniz,“Adaptive Filtering, Algorithms and Practical Implementation,” Springer, 02-Jul-2008.

4.        S.M.Kuo and Dipa Vijayan, “A secondary path modeling technique for active noise      control,” IEEE Trans. Speech and Audio processing, vol.5, No.4, 1997.

5.        B.Farhang-Boroujeny, Adaptive Filters Theory   and Applications, John Wiely 1999.

6.        John .R. Treichler, C. Richard Johnson Jr., Michael G. Larimore,”Theory and Design of Adaptive Filters,” Prentice Hall, New Delhi, 2000.

7.        S.C.Douglas and M.Rupp,”On Bias Remova and Unitnorm Constraints in Equation Error Adaptive IRR Adaptive Filters,” IEEE Asilomar conf. on signals, systems and computers, vol.2,1196.

8.        Dunne, B.E.;Williamson, G.A,”QR Based Iterative Unbiased Equation Error Filtering, Acoustics, Speech, and Signal Processing,”IEEE ICASSP. 2001, Vol. 6, 2001.





Suyog K.Dahule, M.A.Gaikwad

Paper Title:

Design & Simulation of Round Robin Arbiter for NoC Architecture

Abstract:    NOC means network on chip is a new method for on chip communication to solve a problem that challenges system on chip. Arbiter is used in network on chip when number of input are requested for same output port , the arbiter has generate the grant signal on the basis of that  number of input port getting a priority and the input port transmit a packet to output port. In this paper we have design round robin arbiter for NOC architecture. After design of round robin arbiter we analyze the area and power.

   Network on–Chip, Round Robin  Arbiter.


1.        Yun-Lung Lee, Jer Min Jou and Yen-Yu Chen,a High Speed and  decentralized arbiter Design for NoC[J],350-353
2.        Gao Xiaopeng ,Zhang z,he,Long Xiang ,Round Robin Arbiter for Virtual Channel Router ,IMACS Multiconferences on        “Computational” Engineering in System application”1610-1614

3.        Li-shiuan Peh,William  J.Dally .A.Delay Modeland   Speculative Architecture for Pipe line Router[J],the 7th International Symposium on High Performances Computer Architecture.255-266

4.        Eung S.Shin,Vincent 1.Mooney III  and George f.Riley ,Round Robin arbiter .Arbiter Design  And Generation,ISSS’02

5.        H,J,Chao,C.H.Lam, and E.Oki Broadband Packet Switching Technology,John Wiley & sons Inc,2001.

6.        Chang Wu,Yubai Li,Song Chai  ,Zhongming Yang-Lottery RouterA Customized Abritral Priority NOC Router[J].200S International Conferences on Computer Sciences and Software Engineering 411-414





Zhenxing Luo

Paper Title:

Anti-attack and Channel Aware Target Localization in Wireless Sensor Networks Deployed in Hostile Environments

Abstract:    This paper discusses the attack and communication channel problems of the energy-based target localization method in wireless sensor network. An anti-attack and channel aware (AACA) target localization method is presented to address the attack problem and the problem of communication channel errors at the same time. Particularly, the AACA method proposed in this paper focuses on the Rayleigh fading channel with coherent receiver. Moreover, the AACA method was compared with the weighted average (WA) method under attack and communication channnel errors. Results showed that the root mean square (RMS) errors presented by the AACA method were close to the CRLB. Moreover, the WA method, although not able to provide as good performance as the AACA method, could give results in much shorter time.

   Cramer-Rao lower bound, Target localization, Wireless sensor networks


1.       D. Li, K. D. Wong, Y.H.Hu, and A. N. Sayeed, "Detection, Classification, and Tracking of Targets", IEEE Signal Processing Magazine, vol.19, no. 3, pp. 17-29, Mar. 2002.
2.       Z. X. Luo and T. C. Jannett, “Optimal Threshold for Locating Targets within a Surveillance Region Using a Binary Sensor Network”, in Proceedings of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE 09), Dec. 2009.

3.       Z. X. Luo, “A censoring and quantization scheme for energy-based target localization in wireless sensor networks”, To appear in Journal of Engineering and Technology.

4.       X. Sheng and Y. H. Hu, "Maximum Likelihood Multiple-Source Localization Using Acoustic Energy Measurements with Wireless Sensor Networks", IEEE Transactions on Signal Processing, vol.53, no.1, pp. 44-53, Jan. 2005.

5.       Z. X. Luo and T. C. Jannett, “A Multi-Objective Method to Balance Energy Consumption and Performance for Energy-Based Target Localization in Wireless Sensor Networks”, in Proceedings of the 2012 IEEE Southeastcon, Orlando, FL, Mar. 2012, in press.

6.       Z. X. Luo and T. C. Jannett, “Modeling Sensor Position Uncertainty for Robust Target Localization in Wireless Sensor Networks”, in Proceedings of the 2012 IEEE Radio and Wireless Symposium, Santa Clara, CA, Jan. 2012.

7.       R. X. Niu and P. K. Varshney, “Target Location Estimation in Sensor Networks with Quantized Data”, IEEE Transactions on Signal Processing, vol. 54, pp. 4519-4528, Dec. 2006.

8.       O. Ozdemir, R. X. Niu, and P. K. Varshney, “Channel Aware Target Localization with Quantized Data in Wireless Sensor Networks”, IEEE Transactions on Signal Processing, vol. 57, no. 3, pp. 1190-1202, Mar. 2009.

9.       Z. X. Luo and T. C. Jannett, “Energy-Based Target Localization in Multi-Hop Wireless Sensor Networks”, in Proceedings of the 2012 IEEE Radio and Wireless Symposium, Santa Clara, CA, Jan. 2012.

10.     A.S. Rawat, P. Anand, H. Chen, and P.K. Varshney , "Collaborative Spectrum Sensing in the Presence of Byzantine Attacks in Cognitive Radio Networks", IEEE Transactions on Signal Processing, vol.59, no.2, pp.774-786, Feb. 2011.

11.     S. Marano, V. Matta, and Lang Tong, "Distributed Detection in the Presence of Byzantine Attacks", IEEE Transactions on Signal Processing, vol.57, no.1, pp.16-29, Jan. 2009

12.     Z. X. Luo and T. C. Jannett, “Performance Comparison between Maximum Likelihood and Heuristic Weighted Average Estimation Methods for Energy-Based Target Localization in Wireless Sensor Networks”, in Proceedings of the 2012 IEEE Southeastcon, Orlando, FL, Mar. 2012.

13.     Z. X. Luo, “Robust Energy-based Target Localization in Wireless Sensor Networks in the Presence of Byzantine Attacks”, to appear in International Journal of Innovative Technology and Exploring Engineering.

14.     Z. X. Luo, “Modeling and Multi-objective Optimization for Energy-based Target Localization Using Wireless Sensor Networks”, PhD Dissertation, The University of Alabama at Birmingham, to be submitted.





Priyanka D, B.V.Raghavendra, Subhash P

Paper Title:

Analysis of A Case study on Fuel Leakage in a Pre-Filter Bowl of a Diesel Engine Fuel Feed Pump Using Ansys

Abstract:    Fuel leakage in the pre-filter bowl of a diesel engine feed pump is the common problem in the field. The leakage of fuel is mainly due to the method of assembly and design of the components. Though the threaded fasteners are easy for maintenance and low cost in the assembly of the components, they are not advisable due to its limitation of loosing the threaded fastener under the dynamic loading. A case study has been done in the industry to reduce the rejection of feed pump due to leakage of fuel in pre filter bowl of a diesel engine. In this paper an effort is made to identify the factors which cause the leakage of the fuel.  It is found that due to deformation in the wire clip and filter bowl is causing the major problem. Hence analysis of the existing design is made and suggested the improved design using Finite Element Analysis.

   FEA, Feed Pump, Filter-bowl, Fuel leakage


1.        N.G. Pai, D.P. “Three-dimensional finite element analysis of threaded fastener Loosening due to dynamic shear load” Engineering Failure Analysis 9 (2002) 383-402.
2.        Satoshi Izumi, Takashi Yokoyama, Atsushi Iwasaki, Shinsuke Saka did detailed study on fasteners.

3.        Sotoshi izumi, Takashi Yokoyama, Masatake Kimura, Shinsuke Sakai, “Loosening-resistance evaluation of double-nut tightening method and spring washer by three-dimensional finite element analysis”, Engineering Failure Analysis, Volume 16, issue 5, pages 1510-1519

4.        Cisloiu, M. Lovell, J. Wang “Journal Finite Elements in Analysis and Design”, Volume 44, Issue 8, May 2008, Pages 472-482R.

5.        “Back to Elements- Tetrahedra Vs Hexahedra”  Erke Wang, Thomas Nelson, Rainer Rauch, CAD-FEM GmbH, Munich, Germany

6.        P. Beer, E. Russell Johnston, Jr.,  John T. Dewolf, “Mechanics of Materials”, Ferdinand McGraw-Hill International Edition, 2002

7.        S S Bhavikatti , “Strength of Materials”, Vikas publication house pvt ltd. Third Edition-2008.





Deepak Chopra, Dilip Vishwakarma

Paper Title:

Efficient Frequent Item set Discovery Technique in Uncertain Data

Abstract:   Frequent itemset mining, the task of finding sets of items that frequently occur together in a dataset, has been at the core of the field of data mining for the past sixteen years. In that time, the size of datasets has grown much faster than has the ability of existing algorithms to handle those datasets. Consequently, improvements are needed. In this thesis, we take the classic algorithm for the problem, A Priori, and improve it quite significantly by introducing what we call a vertical sort. We then use the  large dataset, web documents to contrast our performance against several state-of-the-art implementations and demonstrate not only equal efficiency with lower memory usage at all support thresholds, but also the ability to mine support thresholds as yet un-attempted in literature. We also indicate how we believe this work can be extended to achieve yet more impressive results

   Uncertain Databases, Frequent Itemset Mining, Probabilistic Frequent Itemsets.


1.       Toon Calders, Calin Garboni and Bart Goethals, “Approximation of Frequentness Probability of Itemsets in Uncertain Data”, 2010 IEEE International Conference on Data Mining, pp-749-754.
2.       Bin Fu, Eugene Fink and Jaime G. Carbonell, “Analysis of Uncertain Data: Tools for Representation and Processing”, IEEE 2008.

3.       Mohamed Anis Bach Tobji, Boutheina Ben Yaghlane, and Khaled Mellouli, “A New Algorithm for Mining Frequent Itemsets from Evidential Databases”, Proceedings of IPMU'08, pp. 1535{1542.

4.       Biao Qin, Yuni Xia, Sunil Prabhakar and Yicheng Tu, “A Rule-Based Classification  Algorithm for Uncertain Data”, IEEE 2009 International Conference on Data Engineering, pp- 1633-1640.

5.       Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Florian Verhein, Andreas Zuefle, “Probabilistic Frequent Itemset Mining in Uncertain Databases”, 15th ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (KDD'09), Paris, France, 2009.

6.       Gregory Buehrer, Srinivasan Parthasarathy, and Amol Ghoting. Out-ofcore frequent pattern mining on a commodity pc. In KDD ’06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2006, pp 86–95.

7.       Toon Calders. Deducing bounds on the frequency of itemsets. In EDBT Workshop DTDM Database Techniques in Data Mining, 2002.

8.       DPVG06] Nele Dexters, Paul W. Purdom, and Dirk Van Gucht. A probability analysis for candidate-based frequent itemset algorithms. In SAC ’06: Proceedings of the 2006 ACM symposium on Applied computing, New York, NY, USA, 2006. ACM, pp541–545.

9.       Edward Fredkin. Trie memory. Commun. ACM, 3(9):490–499, 1960.

10.     Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-Kuang Chen, and Pradeep Dubey. Cacheconscious frequent pattern mining on a modern processor. In Klemens B¨ohm, Christian S. Jensen, Laura M. Haas, Martin L. Kersten, Per-Ake Larson, and Beng Chin Ooi, editors, VLDB ACM, 2005, pp 577–588.

11.     Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Trans. on Knowl. and Data Eng., 12(3):pp 372–390, 2000.





Monika Agrawal, Pradeep Mishra

Paper Title:

A Modified Approach for Symmetric Key Cryptography Based on Blowfish Algorithm

Abstract:   The principal goal of designing any encryption algorithm is to hide the original message and send the non readable text message to the receiver so that secret message communication can take place over the web. The strength of an encryption algorithm depends on the difficulty of cracking the original message. A number of symmetric key encryption algorithms like DES, TRIPLE DES, AES, BLOWFISH has been developed to provide greater security affects one over the other. Although the existing algorithms have their own merits and demerits but this paper presents a new approach for data encryption based on Blowfish algorithm. The blowfish algorithm is safe against unauthorized attack and runs faster than the popular existing algorithms. With this new approach we are implementing a technique to enhance the security level of blowfish algorithm and to further reduce the time for encryption and decryption.  

   Symmetric Encryption, Asymmetric Encryption, Cryptography, Cipher text, Plain text, Decryption


1.       O.P Verma, Ritu Agarwal, Dhiraj Dafouti and Shobha Tyagi, “Peformance Analysis Of Data Encryption Algorithms”,IEEE Delhi Technological University India, 2011.
2.       Diaa Salama, Abdul. Elminaam, Hatem Mohamed, Abdul Kader and Mohie Mohamed Hadhoud, “Performance Evaluation of Symmetric Encryption Algorithms”, International Journal of Computer Science and Network Security, vol.8 No.12, December 2008.

3.       Ketu File white papers, “Symmetric vs Asymmetric Encryption”, a division of Midwest Research Corporation.

4.       “Data Encryption Standard,” Federal Information Processing Standards Publication No. 46, National Bureau of Standards, January 15, 1977.

5.       Tingyuan Nie and Teng Zhang,“ A Study of DES and Blowfish Encryption Algorithm”, IEEE, 2009.

6.       Aamer Nadeem and Dr M. Younus Javed , “A Performance Comparison of Data Encryption Algorithms”, IEEE, 2005.

7.       Himani Agrawal and Monisha Sharma, “Implementation and analysis of various symmetric cryptosystems”, Indian Journal of Science and Technology Vol. 3 No. 12, December 2010.

8.       Allam Mousa, “Data Encryption Performance Based on Blowfish”, 47th International Symposium ELMAR-2005.08-1 0, June 2005.

9.       Noohul Basheer Zain Ali, and James M Noras “OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM” Malaysian Journal of Computer Science, Vol. 14 No. 1, June 2001.

10.     Russell K. Meyers and Ahmed H. Desoky “An Implementation of the Blowfish Cryptosystem”, IEEE, 2008.





Ankur Kumar Shrivastava, Nitisha Payal, Abhinav Kumar, Amod Tiwari

Paper Title:

Business Contingency Planning: A Road Map to Protect Company from Unforeseen Threats

Abstract:   Unforeseen threats never knock the door before their arrival; they just arrived and destroy everything that comes in the path. Establishing a secure business is not just about supply and demand. It is about the prevention and protection measures that you can put in place against cyber-crime, the consequences of an electronic attack, natural disaster, acts of terrorism and other events that would have a negative impact on your organization. In this paper our major focus on creating an effective and globally accepted business contingency plan, which is applicable on almost all type of business and their processes to handle any crises and smooth operation of their critical functions. This paper also focuses on need of BIA and discusses all the key aspect of BIA model for analysing the impact of an unforeseen threat over a business critical function. In this paper we also try to provide a complete overview of existing business contingency and risk assessment model.     

   BCM (Business Continuity Management), BCP (Business Continuity Plan), BIA (Business Impact Analysis), DRP (Disaster Recovery Plan), Risk Rating, RTP (Risk treatment plan).                                                               


1.       Security fundamentals by Peltier, Thomas R.; Peltier, Justin; Blackley, John.
2.       Survey by Deloitte (Deloitte Touche Tohmatsu India Private Limited (DTTIPL)) in association with The Business Continuity Institute, UK ('The BCI').

3.       http://www.businesslink.gov.uk/bdotg/action/layer. [11th June, 2012, 11:30am].

4.       http://www.bsigroup.com/en/Assessment-and-certification-services/management-systems/Standards-and-Schemes/BS-25999.

5.       http://www.businessdictionary.com/definition/business-continuity-planning-BCP.html.

6.       http://www.contingency-planning-disaster-recovery-guide.co.uk/.

7.       http://www.bplans.com/ask-bplans/648/how-do-i-write-a-contingency-plan.

8.       http://smallbusiness.chron.com/business-contingency-plan-1081.html.

9.       http://www.drj.com/new2dr/w3_006.htm.

10.     http://www.wikihow.com/Create-a-Business-Continuity-Plan.





Aminreza Noghrehabadi, Amin Samimi

Paper Title:

Natural Convection Heat Transfer of Nanofluids Due to Thermophoresis and Brownian Diffusion in a Square enclosure

Abstract:    This paper reports a numerical study on natural convection heat transfer and fluid flow in a square cavity filled with CuO–Water nanofluids. Both upper and lower surfaces are being insulated, whilst a uniform constant temperature field applied in horizontal walls. The governing equations of fluid flow are discretized using a finite volume method with a collocated grid arrangement. The numerical results are reported for the effect of Rayleigh number, solid volume fraction and both presence and absence of thermophoresis and Brownian motion effects. The numerical results show that an improvement in heat transfer rate was registered for the whole range of Rayleigh numbers when Brownian and thermophoresis effects are considered.

   Natural convection; nanofluid; thermophoresis; Brownian motion; cavity


1.       G.D.VahlDavis, “Natural convection of air in a square cavity, a benchmark numerical solution,” Internat. J. Numr. Methods Fluids vol. 3, pp. 249–264, 1962
2.       T. Fusegi, J. M. Hyun, K. Kuwahara, B. Farouk, “A numerical study of three dimensional natural convection in a differentially heated cubical enclosure,” Int. J. Heat MassTransfer vol. 34, pp. 1543–1557, 1991

3.       G. Barakos, E. Mitsoulis, “Natural convection flow in a square cavity revisited: laminar and turbulent models with wall functions,” Internat. J. Numer. Methods Fluids Vol. 18, pp. 695–719, 1994

4.       Md. Jashim Uddin, W. A. Khan, and A. I. Md. Ismail, “Review Article Scaling Group Transformation for MHD Boundary Layer Slip Flow of a Nanofluid over a Convectively Heated Stretching Sheet with Heat Generation,” Mathematical Problems in Engineering, Volume 2012, doi:10.1155/2012/934964

5.       K. Khanafer, K. Vafai, and M. Lightstone, “Buoyancy driven heat transfer enhancement in a two-dimensional enclosure utilizing nanofluids,” International Journal of Heat and Mass Transfer, vol. 46, no. 19, pp. 3639–3653, 2003.

6.       E. Abu–Nada, Z. Masoud, A. Hijazi, “Natural convection heat transfer enhancement in horizontal concentric annuli using nanofluids,” International Communications in Heat and Mass transfer, vol. 35, no. 5, pp. 657– 665, 2008.

7.       M. Shahi, A.H. Mahmoudi, A.H. Raouf, “Entropy generation due to natural convection cooling of a nanofluid,” International Communications in Heat and Mass Transfer, vol. 38, no. 7, pp. 972–983, 2011.

8.       S.M. Aminossadati, B. Ghasemi, “Natural convection of water – CuO nanofluid in a cavity with two pairs of heat source –sink,” International Communications in Heat and Mass Transfer, vol. 38, pp. 672 –678, 2011

9.       Z.T. Yu, W. Wang, X. Xu, L.W. Fan, Y.C. Hu, K.F. Cen, “A numerical investigation of transient natural convection heat transfer of aqueous nanofluids in a differentially heated square cavity, International Communications in Heat and Mass transfer,” vol. 38, no. 5, pp. 585–589, 2011.

10.     H.F. Oztop, E. Abu–Nada, “Numerical study of natural convection in partially heated rectangular enclosure filled with nanofluids,” Int. J. Heat Fluid Flow, Vol. 29, pp. 1326–1336, 2008.

11.     E. Abunada, Z. Masoud, H. F. Oztop, A. Campo, “Effect of nanofluid variable properties on natural convection in enclosures,” International Journal of Thermal Sciences, vol. 49, No. 3, pp. 479-491, 2010.

12.     F. Lai, Y. Yang, “Lattice Boltzmann simulation of natural convection heat transfer of Al2O3/water nanofluids in a square enclosure,” International Journal of Thermal Sciences, vol. 50, pp. 1930–1941, 2011

13.     M. C. Kim, J. S. Hong, C. K. Choi, “The analysis of the onset of Soret–driven convection in nanoparticles suspension,” AIChE Journal, vol. 52, pp. 2333–2339, 2006.

14.     J. A. Weaver, R. Viskanta, “Natural convection due to horizontal temperature and concentration gradients – 2. Species interdiffusion, Soret and Dufour effects,” International Journal of Heat and Mass Transfer, vol. 34, pp. 3121–3133, 1991.

15.     Cheng, C. Y., “Soret and Dufour effects on heat and mass transfer by natural convection from a vertical truncated cone in a fluid–saturated porous medium with variable wall temperature and concentration,” Inter. Comm. Heat Mass Transf., vol. 37, pp. 1031–1035, 2010.

16.     Mustafa, M., Hayat, T., Pop, I., “Stagnation point flow of a nanofluid towards a stretching sheet,” Int. J. Heat and Mass Transfer, vol. 54, pp. 5588–5594, 2011.

17.     Pal, D., Mondal, H., “Effects of Soret Dufour, chemical reaction and thermal radiation on MHD non–Darcy unsteady mixed convective heat and mass transfer over a stretching sheet,” Comm. Nonlinear Sci. Numer. Sim., vol. 16, pp. 1942–1958, 2011.

18.     J. Buongiorno, “Convective transport in nanofluids,” J. Heat Transfer, vol. 128, pp. 240–250, 2006.

19.     A.V. Kuznetsov, D.A. Nield, “Natural convective boundary layer flow of a nanofluid past a vertical plate,” Int. J. Therm. Sci., vol. 49, pp. 243–247, 2010.

20.     P. Cheng, W.J. Minkowycz, “Free convection about a vertical fl at plate embedded in a porous medium with application to heat transfer from a dike,”  J. Geophys. Res., vol. 82, pp. 2040–2044, 1977.

21.     D.A. Nield, A.V. Kuznetsov, “The Cheng–Minkowycz problem for natural convective boundary layer flow in a porous medium saturated by a nanofluid,” Int. J. Heat Mass Transfer, vol. 52, pp. 5792–5795, 2009.

22.     W.A. Khan, I. Pop, “Boundary layer flow of a nanofluid past a stretching sheet,” Int. J. Heat Mass Transfer, vol. 53, pp. 2477–2483, 2010.

23.     O.D. Makinde, A. Aziz, “Boundary layer flow of a nanofluid past a stretching sheet with a convective boundary condition,” Int. J. Therm. Sci., vol. 50, pp. 1326–1332, 2011.

24.     Z. Haddad, E. Abu–Nada, F. Oztop, A. Mataoui, “Natural convection in nanofluids: Are the thermophoresis and Brownian motion effects significant in nanofluid heat transfer enhancement?,” International Journal of Thermal Sciences, Vol. 57, pp. 152–162, 2012.

25.     C.H. Chon, K.D. Kihm, S.P. Lee, S.U.S. Choi, “Empirical correlation finding the role of temperature and particle size for nanofluid (Al2O3) thermal conductivity enhancement,” Appl. Phys. Lett., Vol. 87, no. 15, pp. 153–157, 2005.

26.     H. Angue Minsta, G. Roy, C.T. Nguyen, D. Doucet, “New temperature and conductivity data for water–based nanofluids,” Int. J. Therm . Sci., vol. 48, no. 2, pp. 363–373, 2008.

27.     C.T. Nguyen, F. Desgranges, G. Roy, N. Galanis, T. Mare, S. Boucher, H. Angue Minsta, “Temperature and particle size dependent viscosity data for water based nanofluids– hysteresis phenomenon,” Int. J. Heat Fluid Flow, vol. 28 , pp. 1492–1506, 2007.

28.     K.D. Hagen, Heat Transfer with Applications, pp. 637–638, Prentice–Hall, New Jersey, USA, 1999.

29.     A. Aziz, W.A . Khan, “Natural convective boundary layer flow of a nanofluid past a convectively heated vertical plate,” International Journal of Thermal Sciences, vol. 52, pp. 83–90, 2012.

30.     N. Bachok, A. Ishak , I. Pop, “Unsteady boundary–layer flow and heat transfer of a nanofluid over a permeable stretching/shrinking sheet,” International Journal of Heat and Mass Transfer., Vol. 55, pp. 2102–2109, 2012.

31.     Versteeg, H. K., Malalasekera, W., an Introduction to Computational Fluid Dynamics. The finite Volume Method, Longman, London, 1995.

32.     Patankar, S. V., Numerical heat transfer and fluid flow, New York: McGraw–Hill, 1980.

33.     Rhie, C. M., Chow, W. L., “Numerical study of the turbulent flow past an airfoil with trailing edge separation,” J. of Heat and Fluid Flow, Vol. 16,  pp. 11–15, 1995.

34.     E.B. Ogut, “Natural convection of water–based  nanofluids in an inclined enclosure with a heat source,” International Journal of Thermal Sciences, vol. 48,  no. 11, pp. 2063 –2073, 2009.

35.     E. Abu–Nada, “Rayleigh–Bénard convection in nanofluids: effect of temperature dependent properties,” Int. J. Therm. Sci., vol. 50, pp. 1720–1730, 2011.





Saumen Chakraborty, Bishnu Charan Sarkar

Paper Title:

Dynamics of a Nonlinear Digital Resonator in Free Running and Injection Synchronized Mode: A Simulation Study

Abstract:     The structure of a linear digital resonator (DR) has been modified to realize the digital equivalent of Vander Pol Oscillator and the modified system has been found to exhibit several nonlinear dynamical phenomena like synchronization, quasiperiodicity and chaos. Like its linear counterpart, the nonlinear DR can be implemented using common reliable building blocks and so the proposed system can be used as a chaos generator potentially useful in chaos-based communication systems. The dynamics of the nonlinear digital resonator has been studied through numerical simulation.

    chaos, nonlinear digital resonator, quasiperiodic ,  synchronization, Vanderpol oscillator.


1.       John G. Proakis, Dimitris G. Manolakis; Digital Signal Processing Principles, Algorithms,  and  Applications; Prentice Hall of India Pvt. Ltd., New Delhi, 2004(3rd Ed)
2.       Almudena Suarez , Raymond Quere; Stability Analysis of Nonlinear Microwave Circuits; Artech House, Boston, London, 2003

3.       Robert C. Hilborn, Chaos and Nonlinear Dynamics; Oxford University Press, New Delhi, 2000(2nd Ed)

4.       J Dixon, E Bradley, Z.B. Popovic, Nonlinear time-domain analysis of injection-locked microwave MESFET oscillators; Microwave Theory  and Techniques ,IEEE Transactions on Volume45, Issue7, Page(s): 1050–1057, Jul 1997.





Ankita Bharaktya, S.G.Reddy

Paper Title:

Energy Efficient Query Optimization in Wireless Sensor Networks

Abstract:    A wireless sensor network (WSN) is a wireless network consisting of distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants, at different locations. A WSN Consists of ten to thousand of sensor nodes that communicate through wireless channels for information sharing and cooperative processing. In this our main focus is on base station energy-efficient queries optimization. Different from existing query optimization techniques that consider only query plans for extracting data from sensors at individual nodes, our approach takes into account both of the sensing and communication cost in query plans. When a new query is submitted to the base station, we check whether the new query can be evaluated using the result of currently running queries. If it is possible then we rewrites a new query using currently running queries at the base station without injecting it into the sensor network. Thus optimizing the query processing in Wireless Sensor Network. Simulation results show queries transmitted in merging, rewriting query plans and shows the query plan chosen in our approach consumes significantly less energy than an approach that optimizes on sensing cost only.

   Energy Efficiency, Query Optimization, Query Sharing, Sensor Networks, Wireless Sensor Networks.


1.        Crossbow Technology Inc., http://www.xbow.com.
2.        Sirish Chandrasekaran Michael J. Franklin. Streaming Queries over Streaming Data. IEEE

3.        Madden, S., Franklin, M.: Fjording the stream: architecture for queries over streaming sensor data. In ICDE. (2002)

4.        Goel, A., Estrin, D.: Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In SODA.(2003)

5.        A.Deshpande and S.Madden. MauveDB: supporting model-based user views in database systems. In SIGMOD, pages 73–84, 2006.

6.        S. Das, C. Perkins, and E. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In INFOCOM 2000, pages 3–12. IEEE.

7.        A. Silberstein and J. Yang. Many-to-many   aggregation for sensor networks.ICDE_2007.

8.        X. Yang, H. B. Lim, T. Ozsu, and K.-L. Tan. In-network execution of monitoring queries in sensor networks. In SIDMOD, 2007.

9.        P. Bonnet, J. Gehrke, and P. Seshadri. Towards sensor database systems. In Proceeding of the International Conference on Mobile Data Management, 2001. Perkins, C.: Ad hoc on demand distance vector (aodv) routing. (Internet Draft 1999, http://www.ietf.org/internet-drafts/draft-ietf-manetaodv-04.txt)

10.     Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In SIGCOMM. (1994) 234–244

11.     Xu, Y., Bien, S., Mori, Y., Heidemann, J., Estrin, D.: Topology control protocols to conserve energy in wireless ad hoc networks. In TR6, UCLA/CENS (2003)

12.     Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In MOBICOM. (2001) 70–84

13.     Ye, W., Heidemann, J., Estrin, D.: An energy-efficient MAC protocol for wireless sensor networks. In INFOCOM. (2002) 1567–157610.

14.     Madden, S., Hellerstein, J.: Distributing queries over low-power wireless sensor networks. In SIGMOD. (2002)

15.     Madden, S., Szewczyk, R., Franklin, M., Culler, D.: Supporting aggregate queries over ad-hoc sensor networks. In WMCSA. (2002)





Ajit Kumar Senapati, P.C.Mishra, B.C.Routra, Amitabha Biswas

Paper Title:

An Extensive Literature Review on Lead Time Reduction in Inventory Control

Abstract:    This article provides a comprehensive introduction about the lead time reduction in inventory control research status in relevant fields from a different perspective. First, this paper proposes some key factors which should be considered in the lead time reduction studies; then, from the perspective of study scope, the current literatures are distinguished into four categories on the basis of years i.e. from year 1991 to 2000 is first part, second part is from year 2000 to 2004, third part is from year 2005 to 2008 and final part is from year 2008 to 2012. Literatures in each category are reviewed according to the key factors mentioned. The literature review framework in this paper provides a clear overview of the lead time reduction inventory study field, which can be used as a starting point for further research work.

   crashing cost, Inventory control, Inventory Model, Lead time, Safety stock


1.        Das, C., “Effect of lead time on inventory: a static analysis”, Opl Res. Q, Vol. 26, pp.273-282, 1975
2.        Foote, B., Kebriaei, N. and Kumin, H. “Heuristic policies for inventory ordering problems with long and randomly varying   Lead times”, J.    Opns Mgmt, Vol.7, pp.115-124, 1988

3.        Magson, D. “Stock control when the lead time cannot be considered constant” .J. Opl Res. Soc.Vol.30, 317-322, 1979

4.        Naddor, E.Inventory Systems, Wiley, New York, 1966

5.        Gaither and Norman, Production and Operations Management, sixth edition, The Dryden Press, Orlando, New York. 1994
6.        Silver, E.A., Pyke, D.F. and Peterson, R. Inventory Management and Production Planning and Scheduling. New York.   Wiley, 1998

7.        Harrington, H.J. The complete benchmarking implementation guide: total benchmarking management, New York, McGraw-Hill.1996

8.        Ben-daya, M. and Abdul R. “Inventory models involving lead time as decision variable”, J. Opl Res. Soc, Vol. 45, pp.579-582. 1994

9.        Ouyang, L., Yeh, N. and Wu, K. “Mixture inventory model with backorders and lost sales for variable lead time”, J. Oper.   Res. Soc., Vol.47, pp.829-832. 1996

10.     Hariga, M. and Ben Daya, M. “Some stochastic inventory models with deterministic variable lead time”, European Journal of Operational Research, Vol.113, pp. 42–51, 1999

11.     Ouyang, L., Yeh, N. and Wu, K. “Mixture inventory model with backorders and lost sales for variable lead time”,J. Oper. Res. Soc., Vol.47, pp.829-832. 1996

12.     Porteus, E.L. “Optimal lot sizing, process quality improvement and setup cost reduction”, Operations Research, vol. 34, Pp.137–144, 1986

13.     Rosenblatt, M.J.and Lee, H.L. “Economic production cycles with imperfect production processes”. IIE Transactions, vol.  18, pp.48–55, 1986

14.     Keller, G. and Noori, H. “Impact of investing in quality improvement on the lot size model”, OMEGA International Journal of Management Sciences, vol.15, pp.595–601, 1988

15.     Hwang, H., Kim, D.B.and Kim, Y.D., “Multiproduct economic lot size models with investments costs for setup reduction and quality improvement” ,International Journal of Production Research, vol. 31, pp.691–703, 1993

16.     Hong, J.D., Hayya, J.C, “Joint investment in quality improvement and setup reduction” ,Computers and Operations  Research, vol. 22, pp.567–574, .1995

17.     Ouyang, L.Y. and Chang, H.C., “Impact of investing in quality improvement on (Q, r, L) model involving the imperfect Production process”, Production Planning and Control, vol.11, No. 6, pp. 598–607, 2000

18.     Ouyang, L.Y., Chen, C.K. and Chang, H.C., “Quality improvement, setup cost and lead-time reductions in lot size reorder point models with an imperfect production process” ,Computers and Operations Research, vol. 29,pp. 1701–1717, 2002

19.     Hsiao, Y.C., “A note on integrated single vendor single buyer model with stochastic demand and variable lead time”, Int. J. Production Economics, vol. 114 pp. 294–297, 2008

20.     Hayya, J.C, Harrison, T.P, and He, X.J., “The impact of stochastic lead time reduction on inventory cost under order crossover”, European Journal of Operational Research, vol. 211, pp. 274–281. 2011

21.     Glock.C.H., “Lead time reduction strategies in a single-vendor–single-buyer integrated inventory model with lot size-dependent lead times and stochastic demand”, Int. J. Production Economics’, vol. 136, pp.37–44. 2012

22.     Christensen, W.J., Germain, R.N.,and Birou, L., “Variance vs. average: supply chain lead-time as a predictor of financial performance”, Journal of Supply Chain Management, vol. 12, pp.349–357, 2007

23.     Kim, J. and Benton, W., “Lot size dependent lead times in a Q, R inventory system”, International Journal of Production Research, vol. 33, pp.41–48, 1995

24.     Hariga, M., “A stochastic inventory model with lead-time lot size interaction” , Production Planning and Control, vol. 10,  pp. 434–438., 2000

25.     Pan,J.C.,Hsiao,Y.C. and Lee,C.J., “Inventory models with fixed and variable lead time crashing costs considerations” , Journal of the Operational Research Society,vol. 53,pp. 1048–1053, 2002

26.     Ouyang, L.Y. and Chuang, B.R., “Mixture inventory model involving variable lead time and controllable backorder rate” , computers and industrial engineering,Vol. 40,pp. 339-348, 2001

27.     Ben-Daya, M.and Hariga, M., “Integrated single vendor single buyer model with stochastic demand and variable lead time”, International Journal of Production Economics, Vol. 92, pp.75–80, 2004

28.     Lee, J. and Schwarz, L.B., “Lead time reduction in a (Q, r) inventory system: an agency perspective’, International Journal   of Production Economics, vol.105,pp. 204–212., 2007

29.     Liao, C.J. and Shyu, C.H., “Stochastic inventory model with controllable lead time” ,International Journal    of     System  Science, vol 22, no11, pp.2347–2354, 1991

30.     Moon, I. and Yun, W., “The distribution free job control problem” Computers and Industrial Engineering, vol. 32, pp. 109-  113, 1997

31.     Hariga, M. and Ben Daya, M., “Some stochastic inventory models with deterministic variable lead time” , European Journal of Operational Research, Vol.113, pp. 42–51, 1999

32.     Chen, C.K, Chang, H.C and Ouyang, L.Y., “A Continuous Review Inventory Model with Ordering Cost Dependent on Lead Time” , Information and Management Sciences, Volume 12, Number 3, pp.1-13, 2001

33.     Pan, C.H.J.and Yang, J.S. “A study of an integrated inventory with controllable lead time”, International Journal of Production Research, Vol.40, No. 5, pp.1263–1273. 2002

34.     Banerjee, A., “A joint economic-lot-size model for purchaser and vendor”, Decision Science, vol.17, pp.292-311, 1986

35.     Goyal, S. K., “A joint economic-lot-size model for purchaser and vendor: a comment”, Decision Science, vol.19, pp.236-241, 1988

36.     Ben-daya, M. and Hariga, M., “Lead-time reduction in a stochastic inventory system with learning Consideration”, int. j.  Prod. res., vol. 41, no. 3, pp.571–579. 2003

37.     Lee, W.C., Wu, J.W. and Hou, W.B., “A note on inventory model involving variable lead time with defective units for mixtures of distribution”, Int. J. Production Economics, vol.89, pp.31–44, 2004
38.     Pan, J.C.H , Lo, M.C,and  Hsiao, Y.C., “Optimal reorder point inventory models with variable lead time and backorder discount considerations” ,European Journal of Operational Research,vol. 158 ,pp.488–505, 2004

39.     Yang, G.and Ronald, P.C., “Inventory models with variable lead time and present value” European Journal of Operational Research,vol. 164,pp.358–366, 2005

40.     Zequeira, R.I., Duran, A. and Gutierrez, G., “A mixed inventory model with variable lead time and random back-order rate”, International Journal of Systems Science Vol. 36, No. 6, pp.329–339, 2005

41.     Pan, J.C.H, and Hsiao, Y.C., “Integrated inventory models with controllable lead time and backorder discount considerations”, Int. J. Production Economics, vol.93, pp.387–397. 2005

42.     Chang et al., “Integrated vendor–buyer cooperative inventory models with controllable lead time and ordering cost reduction”, European Journal of Operational Research, vol. 170, pp.481–495, 2006

43.     Hoque, M.A. and Goya, S.K,  “A heuristic solution procedure for an integrated inventory system under controllable lead-  time with equal or unequal sized batch shipments between a vendor and a buyer” , Int. J. Production Economics,vol.102,pp. 217–225,2006

44.     Ouyang, L. Y., Wu, K. S.and Ho, C. H., “An integrated vendor–buyer inventory model with quality improvement and lead  time reduction” ,International Journal of Production Economics, vol.108, No.2, pp.349–358,2007

45.     Chen, K.K and Chang, C.T, “A seasonal demand inventory model with variable lead time and resource constraints”, Applied Mathematical Modeling, vol. 31, pp.2433–2445, 2007

46.     Chandra, C. and Grabis, J., “Inventory management with variable lead-time dependent procurement cost”, Omega, vol. 36, pp.877–887, 2008

47.     Lee.J.Y. And, Schwarz.L.B, “Lead time management in a periodic-review inventory system: A state-dependent base-stock policy”, European Journal of Operational Research, vol.199, pp. 122–129, 2009

48.     Chang, C.T and Lo, T.Y, “On the inventory model with continuous and discrete lead time, backorders and lost sales”, Applied Mathematical Modeling, vol.33, pp. 2196–2206, 2009

49.     Jha.J.K, and Shanker.K, “Two-echelon supply chain inventory model with controllable lead time and service level constrain”, Computers & Industrial Engineering, vol. 57 pp.1096–1104, 2009

50.     Chaharsooghi, S.K and Heydari, J., “LT variance or LT mean reduction in supply chain management: Which one has a higher impact on SC performance?”, Int. J. Production Economics, vol. 124, pp.475–481, 2010

51.     Ryu, S.W.and Lee, K.K., “A stochastic inventory model of dual sourced supply chain with lead-time reduction”, Int J Prod   Econ, vol.82, pp.513–524, 2003





El Sayed M. Saad, Medhat H. Awadalla, Hosam Eldin I. Ali, Rasha F. A. Mostafa

Paper Title:

Object Manipulation Using a Humanoid Robot

Abstract:    Interaction with its environment is a key requisite for a humanoid robot. Especially the ability to recognize and manipulate unknown objects is crucial to successfully work in natural environments. Visual object recognition, however, still remains a challenging problem. To get the robot capable of identifying the geometric shapes and colors of the objects, a vision system is proposed. The paper proposes a natural language understanding system also, where the robot will be able to effectively communicate with human through a dialogue developed in Arabic language. The developed dialogue and a dynamic object model are used for learning the semantic categories and object descriptions. In this paper, a robot will be developed to interact with the users performing some specified actions. Moreover, integration between the proposed vision and natural language understanding systems has been presented. Finally, a voice-based dialogue between the user and robot will be developed. Intensive experiments have been conducted indoor to address the validity of the complete proposed system. The achieved results show that the overall system performance is high compared with the related literature to the theme of this paper.

   Vision System,  Speech system, object category recognition, Object Detection, Color detection, Natural Language Understanding, Ontology, Syntax, knowledge Representation, Semantic Networks, Motion System.


1.        M. Vukobratović, "Humanoid Robotics, Past, Present State, Future", Director Robotics Center,  Mihailo Pupin    Institute, 11000 Belgrade, P.O. Box 15, Serbia,E-mail: vuk@robot.imp.bg.ac.yu,SISY 2006 • 4th Serbian-Hungarian Joint Symposium on Intelligent Systems, pp 13-27.
2.        V. Graefe , R. Bischoff, "Past, Present and Future of Intelligent Robots ",  Intelligent Robots Lab , LRT  6, Bundeswehr University Muenchen, 85577 Neubiberg, Germany,http://www.UniBw-Muenchen.de/campus/LRT6,CIRA  2003, Kobe, pp 1-10.

3.        C.Pasca, "History of Robotics", University of Ottawa, ENRICHMENT MINI-COURSE, Robotics – Intelligent Connection of the Perception to Action,May 5, 2003, pp1-46 .

4.        R. JARVIS,"INTELLIGENT ROBOTICS: PAST, PRESENT AND FUTURE",International Journal of Computer Science and Applications, Vol. 5, No. 3,pp 23 – 35, 2008.

5.        M. Takizawa, Y. Makihara, N. Shimada, J. Miura and Y. Shirai," A Service Robot with Interactive Vision- Object Recognition Using Dialog with User - ", Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan, E-mail: shimada@eng.osaka-u.ac.jp,2003.

6.        H.J.C. Luijten,"Basics of color based computervision implemented in Matlab",TechnischeUniversiteit  Eindhoven, Department Mechanical Engineering, Dynamics and Control Technology Group, Eindhoven, June, 2005, pp 1-24.

7.        E. Menegatti, S. Behnke, C. Zhou," Humanoid soccer robots", Robotics and Autonomous Systems, contents lists available at ScienceDirect, journal homepage: www.elsevier.com/locate/robot, Robotics and Autonomous Systems 57 (2009) 759_760.

8.        J.Sinapov and Al. Stoytchev,"Object Category Recognition by a Humanoid RobotUsing Behavior-Grounded Relational Learning",Developmental Robotics Laboratory, Iowa State University,{jsinapov, alexs}@iastate.edu,2011,pp 1-7.

9.        MathworksMatlab Image Processing function list, http://www.mathworks.com/products/image/functionlist.html, 2012.

10.     H.Holzapfel , D.Neubig, A.Waibel,"A dialogue approach to learning object descriptions and semantic categories", Contents lists available at ScienceDirect, Robotics and Autonomous Systems 56 (2008) 1004_1013.

11.     J. Carbonell, Towards a self-extending parser, in: Annual Meeting of the Association for Computational Linguistics, 1979.

12.     R. Becher, P. Steinhaus, R. Zöllner, R. Dillmann, "Design and implementation of an interactive object modelling system", in: Proceedings of ISR 2006 and Robotik 2006, Düsseldorf, 2006.


14.     P. Tanwar , T. V. Prasad, M. S. Aswal,"Comparative Study of Three Declarative Knowledge Representation Techniques", PoonamTanwar et. al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 07, 2010, 2274-2281.

15.     S. H¨uwel, B. Wrede, and G. Sagerer, "Robust Speech Understanding for Multi-Modal Human-Robot Communication", Faculty of Technology, Applied Computer Science Bielefeld University, 33594 Bielefeld, Germany, 2006.

16.     Al. Ramsay, H. Mansour ," Towards including prosody in a text-to-speech system for modern standard Arabic", Received 13 March 2006; received in revised form 22 June 2007; accepted 22 June   2007 Available online 6 August 2007, Science Direct, Computer Speech and Language 22 (2008)  84–103.





Barun Mazumdar

Paper Title:

A new Compact printed antenna for UMTS, WiMAX, HiPERLAN & WLAN applications

Abstract:    A single layer, single feed, multi frequency, and compact rectangular printed antenna is proposed. L slit is introduced at the right edge of the patch to study the effect of the slit on radiation behavior with respect to a conventional microstrip patch. An extensive analysis of the return loss, radiation pattern and efficiency of the proposed antenna is shown in this paper.  Antenna size has been reduced by 80% when compared to a conventional rectangular microstrip patch.

   compact, multi frequency, slit, patch, printed antenna.


1.       M. Tariqul Islam, M.N. Shakib, N. Misran., and B. Yatim, “ Analysis of L-Probe Fed Slotted Microstrip Patch Antenna,” in Eleventh IEEE International Conference on Communication Systems (IEEE ICCS 2008), Guangzhou, China, November 19-21, 2008, pp. 380-383.
2.       U.Chakraborty, B.Mazumdar, S. K. Chowdhury, and A. K. Bhattacharjee, “A Compact L-slot Microstrip Antenna for Quad band Applications in Wireless Communication,” Global Journal Of Researches in Engineering (F) Volume XII  Issue II Version I Feb,2012.

3.       R. L. Li, B. Pan, T. Wu, J. Laskar, and M. M.Tentzeris “A Triple-Band Low-Profile Planar Antenna for Wireless Applications" December15, 2008, IEEE Explore.

4.       R. K. Gupta "Printed TRI-BAND Monopole Antenna Structures For Wireless Applications" Issue 2, Vol I, Apr 2010.

5.       F. Yang, X. X. Zhang, X. Ye, and Y. Rahmat-Samii, “ Wide-Band Eshaped  Patch Antennas for Wireless Communications,” IEEE Trans. Antennas Propagat., vol. 49, no. 7, pp. 1094-1100, July. 2001.

6.       C.Y Pan, T. S Horng, W. S Chen and C.H Huang, “Dual wideband Printed Monopole Antenna for WLAN/ WiMax     Applications”, IEEE Antenna and Wireless Propagation letters, vol 6, pp 149-151, 2007

7.       B. Mazumdar, A.Kumar “A compact dual band printed antenna for WiMAX & HIPERLAN applications”, IJECCE journal, Vol-3, Issue-3, June 2012.

8.       I.J. Bahl and P. Bhartia, “Microstrip Antennas”, Artech House, Dedham, MA, 1980.

9.       C.A.Balanis, “Advanced Engineering Electromagnetics”, John Wiley & Sons., New York, 1989.

10.     Zeland Software Inc. IE3D: MoM-Based EM Simulator. Web: http://www.zeland.com





Gaurav Dwivedi

Paper Title:

An Ultra Wideband Wide Beam Strip line Fed Taper Slot Antenna for Active Phased Array Jammer

Abstract:    Multi octave bandwidth, wide scanning angle, small interelement spacing and mutual coupling between elements are some of the requirements of Active Phased Array (APA) used for EW Jammer applications. Taper Slot Antenna (TSA) represents a class of antenna elements which is capable enough to meet all these requirements.  Keeping the properties of TSA in mind, a Strip line fed Taper Slot Antenna (TSA) has been designed and fabricated to serve as an Antenna element over a large bandwidth from 6 to 18 GHz for an Active Phased Array (APA). This Antenna Element exhibits some attractive features like wide beam width over a wide bandwidth, Gain for a high ERP, compactness and less mutual coupling. The simulated as well as the measured radiation pattern and VSWR have been presented and discussed in this paper. The Antenna element has been designed and optimized in CST Microwave.

   Taper Slot Antenna (TSA), Beam width, Strip line, Active Phased Array (APA), ECM.


1.        K.S. Yngvesson, D.H. Schaubert, T. Thungren,and J.F. Johansson. “Endfire tapered slot antennas on dielectric substrates”. IEEE TRAN, AP-33:1392–1400, 1985.
2.        I J  Bahl, P. Bhartia, “Microstrip slot antennas,” page 234-235, Artech House, 1982

3.        D. H. Schaubert  and J. Shin, “Parameter study of Tapered Slot antenna array”, IEEE international antennas and propagation, symposium digest, new port beach, CA, June 1995, pp 1376-1379.

4.        R. N. Simons and R. Q. Lee, "Linearly Tapered Slot Antenna Impedance Characteristics," in 1995 IEEE AP-S International Symposium, Vol. 1, Newport Beach, CA, pp. 170-173,1995.

5.        S. N. Prasad and S. Mahapatra, “A novel MIC slotline aerial”, Proc. 9th European Microwave Conference, Brighton, U. K. 1979, pp. 120-124.

6.        P. J. Gibson, “The Vivaldi Aerial”, Proc. 9th European Microwave Conference, Brighton, U.K., 1979, pp. 101-105.

7.        Kai Fong Lee, Wei Chan, “Advances in microstrip and printed antennas,” page 465-466, John Wiley & Sons.

8.        D. H. Schaubert, D.H. Kasturi, “Vivaldi Antenna Arrays for Wide Bandwidth and Electronic Scanning”, Antennas and Propagation, 2007. EuCAP 2007, 11-16 Nov 2007, pp 1376-1379.

9.        Mailloux Robert J., “Phase Array Antenna Handbook,” page 15-16, Artech House, 2005

10.     Dr. U K Revankar, Ms. Priya Suresh and Saurabh Shukla, “Linear Taper Slot Antenna For Broadband Wide Scan angle Active Phased Array”. ISM 2008, 03-06 December 2008, pp 61-63





Alaknanda Mane, S.S.Pimplikar

Paper Title:

Dispute Resolution Process in Construction Sector: Causes and Prevention

Abstract:    Over 200 construction contracts with DRBs start every year, worth over US $7 billion. An estimated 200 disputes are settled each year through the use of DRBs. More importantly, it is often reported that more disputes are avoided by ongoing interaction with the DRB than are actually heard. Increased use of advisory opinions has contributed to the avoidance of disputes. This process is inexpensive, rapid, informal, and is implemented prior to the parties becoming entrenched in adversarial positions. The reported success of advisory opinions is nearly 100%.

   Increased use of advisory opinions has contributed to the avoidance of disputes.


1.        Above mentioned 12 case studies from the website of www.drbf.org.
2.        Abhi Shah and Prof. P.V.Akalkotkar, e- tendering system in government departments and PSUs for project procurement.





Parimal Kumar Giri, Akshaya Kumar Behera

Paper Title:

Power of Network Stochasticity

Abstract:    Network coding protocol that allows intermediate nodes, not only to XORs packets together, but also to broadcast coded packets. The COPE system architecture is implementing between IP and MAC layers, which identifies coding opportunities and benefits from them by forwarding multiple packets in a single transmission using XORs. Our work is based on the theory of network coding, which allows the routers to mix the information content in the packets before forwarding them. Prior work on network coding is mainly theoretical and focuses on multicast traffic.

   Coded packets; Network coding; COPE; Opportunistic listening; Opportunistic coding


1.       R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204–1216, July 2000.
2.       S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, “Xors in the air: practical wireless network coding,” in Proc. ACM SIGCOMM ’06,September 11-15,2006,Pisa,Italy.

3.       S. Katti, D. Katabi, W. Hu, H. Rahul, and M. Medard, “The importance of being opportunistic: practical network coding for wireless environments,” in Proc. October 2005 [Annual Allerton 43rd Conf. on Communication Control and Computing].

4.       P. A. Chou, Y. Wu, and K. Jain,” Practical network coding,” In Proc. of Allerton, Monticello, IL, USA, September 2003.

5.       Y.Wu, P. A. Chou, and S. Y. Kung,” Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast ,” MSR-TR-2004-78.

6.       T. Ho and R. Koetter.,”Online incremental network coding for multiple unicasts,” In DIMACS Working Group on Network Coding, 2005.
7.       D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris,” A high-throughput pathmetric for multi-hop wireless routing,” In ACM MobiCom ’03, San Diego,California, September 2003.
8.       S. Deb, M. Effros, T. Ho, D. R. Karger, R. Koetter, D. S.Lun., M. Medard, and N. Ratnakar,” Network coding for wireless applications: A brief tutorial,” In Proc. of IWWAN,London, UK, May 2005.

9.       Q. Dong, J. Wu, W. Hu, and J. Crowcroft, “Practical network coding in wireless networks,” in Proc. the 13th Annual International Conference on Mobile Computing and Networking (MobiCom ‘07), Sept. 2007.

10.     S. Omiwade, R. Zheng, and C. Hua, “Practical localized network coding in wireless mesh networks,” in Proc. 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON ‘08), June 2008.

11.     P. Chaporkar and A. Proutiere, “Adaptive network coding and scheduling for maximizing throughput in wireless networks,” in Proc. the 13th Annual International Conference on Mobile Computing and Networking (MobiCom ‘07), Sept. 2007.

12.     C. Gkantsidis and P. Rodriguez,” Network coding for large scale content distribution,” In Proc. of INFOCOM, Miami,USA, March 2005.

13.     Fang Zhao, and M. Medard,“On analyzing and improving COPE performance,” Information Theory and Applications Workshop (ITA), 2010.pp. 1-6. ©2010 Institute of Electrical and Electronics Engineers.

14.     S. Sengupta, S. Rayanchu, and S. Banerjee, “An analysis of wireless network coding for unicast sessions: the case for coding-aware routing,”in Proc. IEEE Infocom, May 2007.

15.     C. cheng Chen, E. Seo, H. Kim, and H. Luo,” Self-learning collision avoidance for wireless networks,” In Proceedings of IEEE INFOCOM, 2006.

16.     D. Aguayo, J. Bicket, S. Biswas, G. Judd, and R. Morris, “Link-level measurements from an 802.11b mesh network,” In ACM SIGCOMM, 2004.

17.     D. S. Lun, M. M´ edard, R. Koetter, and M. Effros,” Further results on coding for eliable communication over packet networks,” In IEEE International Symposium on Information Theory, (ISIT 05), 2005.

18.     J. Le, J. Lui, and D. M. Chiu, “How many packets can we encode? – an analysis of practical wireless network coding,” in Proc. IEEE Infocom, April 2008.

19.     D. S. Lun, N. Ratnakar, M. M´edard, R. Koetter, D. R. Karger, T. Ho, and E. Ahmed, “Minimum-cost multicast over coded packet networks,”submitted to IEEE Trans. Inform. Theory.





Raksha Iyer, R. M. Potdar, Neelam Dewangan, Jayant Rajpurohit

Paper Title:

Advancement of Low-cost Medicare System    for the Measurement of Physiological Parameters   of Human Body

Abstract:    This paper represents a design and implementation of a reliable, cheap, low powered non-intrusive and accurate system that can measure many parameters of human body and keep the records of each patient. It gives an idea to make a database of each patient so that whenever the patient comes to the doctor he doesn’t have to keep his record with him manually. Such a device can be handled by non technical personnel also and can be used both in small clinics and big hospitals. This paper is presented with a motto of saving time of both the doctor and patients. As the device can measure the vital signs in a very less time it can save time of doctor and no. of patients can be observed. This paper specifically deals with the signal conditioning and data acquisition of three vital signs: heart rate, body temperature, and weight. The vital signs that have been taken are temperature, heart rate and oxygen in blood,blood pressure and body mass index. The heart rate is measured by Heart beat sensor which works on the principle of light modulation by blood flow through finger at each pulse.To measure the oxygen amount in blood we use pulse oximeter. The pulse oximeter measures the ratio of red to infrared pulsating absorption, which is directly proportional to the oxygen saturation. The temperature is measured by using LM34 which measures the temperature directly in Fahrenheit and does not need external calibrations. And the weight is measured by load cell. Here a simple circuit is designed by using AT89S52 microcontroller as heart of the circuit. The three sensors are connected with microcontroller via signal conditioning equipments. The data is also easily accessible by both the doctor and patient as complete record of output can be generated by using VB as programming language.

   physiological parameter, vital signs of human body, blood Pressure, heart rate, obesity, BMI, oximeter.


1.        Dhvani “Parekh Designing Heart Rate, Blood Pressure and Body Temperature Sensors for Mobile On-Call System” McMaster University,Hamilton, Ontario, Canada,Copyright© April 2010.
2.        Edward Teaw, Guofeng Hou, Michael Gouzman, K. Wendy Tang, Amy Kesluk “A Wireless Health Monitoring System” 0-7803-9303-1/05/$20.00 ©2008 IEEE

3.        S. C. Mukhopadhyay and G. Sen Gupta “Towards the development of an Integrated Sensing System for Health Monitoring” 978-1-4244-1938-8/08/$25.00 C 2008 IEEE.

4.        F Chiarugi1, I Karatzanis1, G Zacharioudakis1, P Meriggi2, F Rizzo2, M Stratakis3, S Louloudakis3, C Biniaris4, M Valentini5,6, M Di Rienzo2, G Parati5,6 “Measurement of Heart Rate and Respiratory Rate Using a Textile-Based Wearable Device in Heart FailurePatients” Computers in Cardiology 2008;35:901−904. ISSN 0276−6574.

5.        M.M.A. Hashem1, Rushdi Shams2, Md. Abdul Kader3, and Md. Abu Sayed4 “Design and Development of a Heart Rate Measuring Device using Fingertip” International Conference on Computer and Communication Engineering (ICCCE 2010), 11-13 May 2010, Kuala Lumpur, Malaysia.

6.        Xiaomei Lin and Zhentao Zhang “Wearable Monitoring System with Physiological Parameter Based on ZigBee” 978-1-4244-7956-6/1 0/$26.00 ©20 10 IEEE.

7.        Physiological Parameters Measurement Based on Wheelchair Embedded Sensors and Advanced Signal Processing Octavian A. Postolache, Senior Member, IEEE, Pedro M. B. Silva Girao, Senior Member, IEEE, Joaquim Mendes, Eduardo C. Pinheiro, and Gabriela Postolache 0018-9456/$26.00 © 2010 IEEE.

8.        Bertrand Massot, Student Member, IEEE, Claudine Gehin, Member, IEEE, Ronald Nocua, Student Member, IEEE,Andre Dittmar, Member, IEEE, and Eric McAdams, Senior Member, IEEE “A wearable, low-power, health-monitoring instrumentation based on a Programmable System-on-ChipTM” 978-1-4244-3296-7/09/$25.00 ©2009 IEEE.

9.        Fei Yu, Arne Bilberg and Egon Stenager “Wireless Medical Sensor Measurements of Fatigue in Patients with Multiple Sclerosis” 978-1-4244-4124-2/10/$25.00 ©2010 IEEE.

10.     Fazlur Rahman†, Arun Kumar†, Noor ShabanaΔ, and Shankar Srinivasan “Design of a Wireless Physiological Parameter Measurement and Monitoring System”.

11.     Dogan Ibrahim  ,Kadri buruncuk, “Heart Rate Measurement From The Finger Using A Low-Cost Microcontroller”

12.     Liao Haiyang Yu Haiqian Wang Han, “Human's Health Monitoring SYSTEM Based on Wireless” 1-4244-1135-1/07/$25.00 ©2007 IEEE.

13.     Genghuang Yang, Shuyan Ren, Yan Bian, Li Zhao, Shigang Cui “Research of Portable Community-Oriented Health Monitoring” 978-1-4244-4713-8/10/$25.00
©2010 IEEE.

14.     Pelegris P., Banitsas K., Orbach T., Marias K. “A Novel Method to Detect Heart Beat Rate Using a Mobile Phone” 978-1-4244-4124-2/10/$25.00 ©2010 IEEE’

15.     Mari Zakrzewski, Arto Kolinummi, and Jukka Vanhala“Contactless and Unobtrusive Measurement of Heart Rate in Home Environment” 1-4244-0033-3/06/$20.00 ©2006 IEEE. 2060.

16.     K. Malhi*, S.C.Mukhopadhyay*, J. Schnepper!, M. Haefke!, and H. Ewald! “A Zigbee Based Wearable Physiological Parameters Monitoring System” 2010 IEEE

17.     Dilpreet Buxi, Julien Penders and Chris van Hoof “Early Results on Wrist Based Heart Rate Monitoring using Mechanical Transducers” 978-1-4244-4124-2/10/$25.00 @2010 IEEE

18.     G. Trindade, M. Carvalho LIGHTWEIGHT PORTABLE SENSORS FOR HEALTH CARE 978-1-4244-6376-3/10/$26.00 ©201O IEEE.

19.     Zimu Li, Guodong Feng, Fenghe Liu, Jia Q Dong, Dr. Ridha Kamoua, Dr. Wendy Tang, Member WIRELESS HEALTH MONITORING SYSTEM, IEEE 978-1-4244-5550-8/10/$26.00 ©2010 IEEE

20.     Jeong A Kim, MD, PhD, Yong-Gyu Park, PhD, Kyung-Hwan Cho, MD, PhD, Myung-Ho Hong, MD, PhD, Hee-Chul Han, MD, PhD, Youn-Seon Choi, MD, PhD,and Dokyung Yoon, MD, PhD “Heart Rate Variability and Obesity Indices Emphasis on the Response to Noise and Standing” JABFP March–April 2005 Vol. 18 No. 2

21.     Keyonia Waters, Christopher Afram, Sharelle Jenkins“The Relationship Between Body Mass Index and Cardiovascular Responses To Racism”.

22.     St. John, “Lifelink”  http://www.stjohn.org.nz/products/lifelink.aspx

23.     ADT, “Neva Alone”, http://www.adtsecurity.co.nz/homesecurity/nevaalone





Anuj Kanchan, Shashank Dwivedi

Paper Title:

Comparison of BER Performance in OFDM Using Different Equalization Techniques

Abstract:    The effects of frequency-selective channel conditions, for example fading caused by multipath propagation, can be considered as constant (flat) over an OFDM sub-channel if the sub-channel is sufficiently narrow-banded (i.e., if the number of sub-channels is sufficiently large). This makes frequency domain equalization possible at the receiver, which is far simpler than the time-domain equalization used in conventional single-carrier modulation. In OFDM, the equalizer only has to multiply each detected sub-carrier (each Fourier coefficient) in each OFDM symbol by a constant complex number, or a rarely changed value. Some of the sub-carriers in some of the OFDM symbols may carry pilot signals for measurement of the channel conditions (i.e., the equalizer gain and phase shift for each sub-carrier). Pilot signals and training symbols (preambles). Here we modelled OFDM system with equalizers. Two different equalizers, namely Zero Forcing (ZF) and Minimum Mean Square Error (MMSE), along with different tapping are used. The modulation with multicarrier is employed, which provides advantages like inter symbol interference (ISI) reduction, high reliability, and better performance in multi-path fading. These equalizers are adopted to remove the ISI generated in the transmitted data under various fading environments. The results show that, with MMSE and ZFE equalizers, the bit error rate (BER) performance is improved. Further, the BER performance of MMSE is superior to ZFE equalizer.

   Orthogonal Frequency Division Multiplexing (OFDM), multipath propagation, fading channel, inter symbol interference (ISI).


1.        Theodore S. Rappport, “Wireles Communications”, 2nd Edition, Prentice Hall of India, 2002.
2.        A John and C Bingham, “Multicarrier modulation for data transmission: An idea whose time has come,”IEEE Commun. May, vol.28, no.5, pp.5-14, may1990.

3.        Zhengdao Wang,”OFDM or single carrier block transmission, “IEEE Trans. On comm., vol.52, no. 3, pp.380-394, mar-2004.

4.        R. van Nee and R. Prasad, OFDM for Wireless Multimedia Communications, Artech House, 1999.

5.        Boumard Sand Mammela A “Channel estimation versus equation in an OFDM WLAN system” in proc. Vehicular Technology Conference, pp 653-657, 2001.

6.        B. Muquet, Zwang, G.B. Giannakos, M.de Courville and P.Duhamel,” Cyclic prefixing or zero padding for wireless multicarrier transmission” IEEE Trans. On Comm., vol.50.no 12, pp.2136-2148, Dec, 2002.

7.        M.X.Chang and Yu T.Su, ” performance analysis of Equalized   OFDM  systems in Rayleigh   fading”IEEE Trans. On wireless comm. Vol. 1 no. …4 pp.721-732, oct-2002

8.        M.Tuchler, Chandra, Singer and R .Koetter i,“Minimum Mean Squared Error equalization using o priori information”, IEEE Trans, on signal process., n vol. 50,no. 3 pp 673-683 mar.2002

9.        John G. Proakis Digital communications,3rd editiontMc Graw Hillpublication,1995 …”

10.     William Stallings, “Wireless Communications And Networks”, 1st Edition, Pearson Education Asia-2002.

11.     IEEE standard 802.11a-1999, adopted by the ISO/IEC and redesignated as ISO/IEC 8802-11:1999/Amd 1:2000(E).
http://standards.ieee.org/getieee802/download/  802.11a-1999.pdf.

12.     John G. Proakis, “Digital Communications”, 4th  Edition, McGraw– Hill Press, 2001.

13.     Lawrence R. Rabiner, Bernard Gold, “Theory and Application of Digital Signal Processing”, Englewood Cliffs, N.J., Prentice-Hall, 1975.

14.     Kunio Takaya, “Digital Signal Processing”, EE 880 class note, University of Saskatchewan, September 2000.

15.     B. Hirosaki, “An Analysis of Automatic Equalizers for Orthogonally Multiplexed QAM Systems”, IEEE Trans. on Commun., Vol. 28, pp. 73-83, January 1980.

16.     I. S. Chow and J. M. Cioffi, “Maximum Likelihood Receiver for Multicarrier Systems”, Proc. IEEE Int. Conf. Commun., Vol. 2, pp. 761-765, Geneva, Switzerland, May 1993.

17.     D. D. Falconer and F. R. Magee, “Adaptive Channel Memory Truncation for Maximum Likelihood Sequence Estimation”, Bell  Syst.Tech. J., Vol. 52, pp. 1541- 1562, November1973.

18.     J. S. Chow and J. M. Cioffi, “A Cost-effective Maximum Likelihood Receiver for Multicarrier Systems”, Proc. IEEE Int. Conf. Commun., Vol 2, pp. 948-952,





Amir Aliabadian, Ali Delavari Ghara

Paper Title:

New Blind Digital Signature Based On Modified Elgamal Signature in Electronic Voting

Abstract:    The electronic election is an electoral system that allows voters to submit their vote with the highest safety and protection coefficient. Such electronic form of election can reduce holding costs and increase the public participation as well. The wide variety of Protocols in the fields of Electronic voting has been introduced, that each of these projects paid attention to how to have the safe and secure elections. Of course each of these projects had problems. With regard to the security and wide range of usage and high efficiency, the requirement for a blind digital signature mechanism seems to be necessary for the future information society. Then there should be embedded a way to eliminate the negative factors of progress. Chvam presented many projects in the field of blind signatures that each of them were provided in order to increase the security. Nowadays the use of the public key encryption systems is highly regarded. This paper presented a new generalized blind signature scheme based on modified Elgamal signature. The new design has an important property that ensures if a message is signed multiple times, the corresponding signatures are different (this property is one of the properties of Elgamal signature). This property in addition to the property of not to be identified of the blind signature is seen in our plan. In this new signature for reaching to our goal we used of number theory and Mathematical integrity techniques. With the blind signature scheme proposed in this paper, one with the use of quality of common Elgamal signature can produces the blind signature. New design in comparison with RSA blind signature scheme has less computational complexity and is faster as well. Our plan which is presented in comparing to the previous blind signatures which were based on the modified Elgamal signature has less computational complexity.

   blind signature, Elgamal signature, Number theory, RSA blind signature


1.        D.Chaum,A FGiat and M.naor, “ untraceable electronic cash “ advanced in cryptology,ceypt0 88,s. Goldwasser (E.d),spring-velage 1982.
2.        D.Chaum,and T.p. Pederson, “ wallet database with observers”, advanced in cryptology-CRYP to 92,(1993) pp 89-105

3.        T.Elgemal “a public-key cryptosystem and signature scheme based on discrete logarithm” IEEE transactions on information theory ,vol IT-31 ,No.4, pp.469-472,1985

4.        J.L. Camenisch,J.M. Piveteao,M.A stadler, “Blind signatures based in the discrete logarithm problem” advanced in Cryptology eurocrypt,94,Perugia,Italy,pp 428-432,1994

5.        A.Fujioka,T.Okamoto,and K,Ohta, “A practical secrete voting scheme for large scale election”, advanced in cryptology AUSCRYPT Y2,(1992) pp 244-251

6.        I,Fan, and C.L.Lei “ low-computation practically blind signature for electronic cash” ,IEICE Transactions on Fundamentals,Vol,E81-A

7.        T.Oktamoto and K.Otha “universal electronic cash”, advanced in Cryptology-CRYPT0’YI,(1992) pp 324-337

8.        William Stalling,” cryptography and network security: principles and peactice”,second edition, prentice Hall,1999





Meysam Chegini, Milad Chegini, Payam Khazael Pour, Bani Rezaei

Paper Title:

Design Analysis and Characterization of a Piezoelectric Actuated Microvalve for Drug Delivery Applications

Abstract:    one of the stumbling blocks for successful miniaturization and commercialization of fully integrated micro fluidic systems was the development of reliable micro valves. In this study, a micro valve is designed and analyzed by employing two analytical software’s namely ANSYS and FLUENT. This work gives also a brief overview of micro valves, actuation mechanisms and focuses on piezoelectric as one type of actuation mechanisms. Applications of the micro valves include flow regulation, on/off switching and sealing of liquids, gases or vacuums. Even though great progress has been made during the last 20 years, there is plenty of room for further improving the performance of existing micro valves. Results showed that maximum displacement is at the forward of the beam and FLUENT software demonstrated the logical response about behavior of fluid passing through channel of the micro valve system

   Micro valve, piezoelectric, analytical analysis, miniaturization


1.        Kwang W Oh et al. “A review of microvalves”. JOURNAL OF MICROMECHANICS AND MICROENGINEERING
2.        J. Casals-Terré et al. “Design, fabrication and characterization of an externally actuated ON/OFF microvalve”. Sensors and Actuators A 147 (2008) 600–606

3.        A. Nisar et al. “MEMS-based micropumps in drug delivery and biomedical applications”. Sensors and Actuators B 130 (2008) 917–942

4.        I Fazal, M C Louwerse et al. “Design, fabrication and characterization of a novel gas micro valve using micro- and fine-machining”. JOURNAL OF MICROMECHANICS AND MICROENGINEERING

5.        Rajesh Duggirala and Amit Lal. “A Hybrid PZT-Silicon Microvalve”. JOURNAL OF MICROELECTROMECHANICAL SYSTEMS, VOL. 14, NO. 3, JUNE 2005

6.        ANSYS, GAMBIT & FLUENT software





S.A.N. Sandeep, P. Malyadri

Paper Title:

ARM-based Embedded Ethernet Interface Design Using DAC System

Abstract:    Now a days we are using many Networked embedded systems for monitoring and control the home or industrial devices. With the scalable networking solution The server enables Web access to distributed measurement/control systems and provides optimization  for educational laboratories, instrumentation, Industrial and home automation. Currently device with microcontroller has been widely used in industrial field. However, a large number of devices don’t have the network interface and the data from them can not be transmitted in network. A design of ARM processor-based embedded Ethernet interface is presented. In the design, an existing SPI serial device can be converted into a network interface peripheral to obtain compatibility with the network. The design mainly consists of SPI communication module, processor module and Ethernet interface module. In the design, embedded real time operating system μC / Linux is transplanted into the microcontroller LM3S8962 and the data can be transmitted between remote SPI serial devices and host computer. After the design is completed, the system is tested and the results show that Ethernet is connected between the host and ARM Cortex and the terminal data can be transmitted via Ethernet.

   ARM processor; interface; Ethernet; SPI, Linux


1.        CHEN Guo-ju, “Design of a monitoring system based on ARM and Ethernet applied to AC motors,” Journal of Nanjing Institute of Technology (Natural Science Edition), Magn. China, vol.7 (2), pp.46- 51, Jun. 2009.YU Cheng-bo, LIU Jie, and TAO Hong-yan, “Research On remote monitor technology of equipment,” Information and Control, Magn. China,  vol.31(3), pp.236-240, June 2002.
2.        YU Cheng-bo, LIU Jie, and TAO Hong-yan, “Research on remote monitor technology of equipment,” Information and Control, Magn. China, vol.31 (3), pp.236-240, June 2002.

3.        LIU Hong-li, “The Research and Experiment of the Embedded System μC /OS-II on PC,” Journal of Shanghai University of Electric Power, Magn. China, vol.5 (7), pp.275-248, June 2009.

4.        ZHANG Shi, DONG Jianwei, SHE Lihuang, “Design and development of ECG monitor’s software system,” Computer Engineering, Magn. China, vo33(9), pp.277-279, May 2007.





Amir Aliabadian

Paper Title:

Zone Radius Optimization Based On Maximum Node Velocity, Number of Transmitting Nodes and Total Number of Nodes

Abstract:    ZRP (Zone Routing Protocol) is a hybrid routing Protocol specifying routs within a region of a network, called routing zone. ZRP can be configured for a particular network by adjusting the routing zone radius. Routing zone radius (R) is defined based on the number of hops. So, a routing zone maintains some nodes that their distances to a specified node are at most R hops. In fact, ZRP is designed for optimizing the (Query/reply) mechanism efficiency. ZRP is a combination of proactive and reactive protocols; within the zone, it is in proactive and between zones is reactive. The first one is called IARP and the latter one IERP. In this paper, we intend to evaluate the ZRP Performance in a network. To do this, we change the zone radius and performance is evaluated by measuring the control traffic generated during routing process. In fact, control traffic is viewed as the sum of the IARP routing update packets and the transmission of IERP request/reply/failure packets. Our results determine the optimum zone radius considering the node velocity, the number of transmitting nodes and the total number of nodes.

   Zone routing protocol, Ad-hoc networks, zone radius, node velocity.


1.       Http://www.ietf.org/html.charters/manet-charter.html
2.       Elizabeth, Royer, Chai-Keong, Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, April 1999, IEEE Personal communications.

3.       Haas, Zygmunt j., jing Deng, Ben. Liang, Panagiots papadimitrator , S ., Sajama , “ Wireless Ad Hoc Networks”, Ithaca, New York, 2001.

4.       Daniel Lang, “A comprehensive overview about selected Ad-Hoc Networking Routing protocols”, Licentiate thesis, Department of computer Science, Technische Universitat, Munchen, 2003.

5.       C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Coputers’’ , In pric. Of Acm SIGCOMM,pages 234244, London , England Aug 1994.

6.       S.Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks”, ACM Mobile Networks and Applications Jourmal, Special issue on Routing in Mobile Communication Networks, 1996.

7.       J.J.Garcia-Luna-Aceves and M. Spohn, “Source-Tree Routing in Wireless Networks”, In Proc. OEEE ICNP 99 , 7 th Intl. Conf. on Network Protocols, Toronto, Canada, Oct 1999.

8.       Haas, Zygmunt J., Prearlman, Marc R., “Providing Ad- hoc connectivity With Reconfigurable Wireless Networks”, Ithaca, New York. Ad Hoc Mobile Wireless Networks, April 1999, Ieee personal Communications.

9.       C.E, perkins, E.M.Royer, and Samir Das, “Ad Hoc On Demad Distance Vector (AODV) Routing” Internet Draft draft-ietf-manet-aodv-04.txt, Oct.1999.

10.     J . Broch D. B. Jojnson , and D. A. Maltz, “The Dynamic Source Routing Protocol for Movile Ad Hoc Networks”, Internet Draft draft-ietf-manet-dsr-03.txt,Oct. 1999

11.     V.park and S. Corson, “Temporally –Ordered Routing Alogrithm (TORA) Version I functional Specification”, Internet Drafft draft-ietf-manet-tora-spec-01.txt,Aug 1998.

12.     B.M. Leiner, D.L. Nielson, and F.A. Tobagi, “Issues in packet Radio Network Design,” Proceeding of the IEEE, vol.75, January 1987.

13.     M. S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,” ACM J. of Wireless Networks. Jan. 1995.

14.     S. Murthy and J.J. Garcia-Luna-Aceves, “A Routing Protocol for packet Radio Networks,” Proc. Of ACM Mobile Computing and Networking Conference, MOBICOM95, Nov.14-15, 1995.

15.     J.Sharony, “A Mobile Radio Network Architecture with Dynamically Changing Topology Using Virtual Subnet, in Proc. Of ICC96.

16.     Marc R. Pearlman, Zygmunt J.Haas, “Determining the Optimal Configuration for the Zone Routing Protocol”, IEEE Journal on selected areas in communication, Vol. 17,No. 8,August 1999.

17.     Haas ,Zygmunt J., Pearlman, Marc R., Samar , P., “Intrazone Routing Protocol (IARP”), June 2001, IETF Internet Draft, draft-ietf- manet-ierp-01.txt.

18.     Haas ,Zygmunt J., Pearlman, Marc R., Samar, p., “Interzone Routing Protocol(IERP)”, June 2001, IETF Internet Draft,draft-ietf-manet-ierp-01 txt.

19.     Z. J. Haas, “The Routing Algorithm for the Reconfigurable Wireless Networks”, ICUP” 97,San diego,CA,Oct 1997

20.     Haas ,Zygmunt J., Pearlman, Marc R., Samar, P., “ The Bordercast Resolution Protocol (BRP) for Ad Hoc Networks”, June 2001, IETF Internet Draft, draft – ietf- manet-brp-01.txt.

21.     Haas, Zegmunt J., Pearlman , Marc R., “The Performance of Query Control Schemes for the Zone Routing Protocol”, August EEE/ACM Transactions on Networking, Vol. 9 , No. 4.

22.     W. Peng, X.C. Lu, On the reduction of  broadcast redundancy in mobile ad hoc networks, Proc. Workshop on Mobile and Ad Hoc Networking and Computing  pp. 129–130,2000.

23.     C-K. Toh, Ad hoc mobile wireless networks: Protocols and systems, Prentice-Hall, NewYork, 2002.

24.     S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks, vol. 8, no.2,pp.153-167,2002.

25.     B. Williams, T. Camp, Comparison of Aroadcasting techniques for mobile ad hoc networks. Proc. ACM Symposium on Mobile (MOBIHOC 2002), pp. 194–205, 2002.

26.     A. Qayyum, L. Viennot, A. Laouiti, Multipoint relaying: An efficient technique for flooding in mobile wireless networks, Proc. Hawaii Int. Conf. Hawaii Int. Conf. System Sciences, 2002.

27.     J. Cartigny, D. Simplot, Border node retransmission based probabilistic broadcast protocols in ad-hoc networks, Telecommunication Systems, vol. 22, no 1- 4,pp.189- 204,2003.

28.     T. Camp, J. Boleng, and V. Davies, A survey of mobility models for ad hoc network research, Wireless Communication &Mobile Computing, Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, vol.2, no.5, pp.483-502, 2002.





Vibha Pandey, Sanjivani Shantaiya

Paper Title:

A Novel Approach for Signature Verification using Artificial Neural Network

Abstract:    This paper presents a new technique for off-line signature verification and recognition. The proposed system is based on morphological features (Shape features).Feature extraction stage is the most essential and difficult stage of any off-line signature verification system. The accuracy of the system depends mainly on the effectiveness of the signature features use in the system. The present research work incorporates a novel feature extraction technique for off-line signature verification system. There are nine features extracted from a static image of signatures using this technique. From the experimental results, the new features proved to be more robust than other related features used in the earlier systems. This approach is implemented in MATLAB and it verifies signatures taking into consideration several novel features and success rate achieved is 99.5%.

   Signature, Morphological, Feed Forward Neural Network, Feature Extraction, offline- signature recognition & verification.


1.        K. Han, and I.K. Sethi, “Handwritten Signature Retrieval and Identification”, Pattern Recognition 17, 1996, pp. 83-90.
2.        S. Chen, and S. Srihari, “Use of Exterior Contour and Shape Features in Off-line Signature Verification”, 8th International Conference on Document Analysis and Recognition (ICDAR ’05), 2005, pp. 1280-1284.

3.        A. Kholmatov, and B. Yanikoglu, “Identity Authentication using improved online signature verification method”, Pattern Recognition Letters, 2005, in press.

4.        M. Hanmandlu, M.H.M. Yusof, and V.K. Madasu, “Off-line Signature Verification using Fuzzy Modeling”, Pattern Recognition 38, 2005, pp. 341-356.

5.        M.K. Kalera, S. Srihari, and A. Xu, “Off-line signature verification and identification using distance statistics”, International Journal of Patern Recognition and Artificial Intelligence 18(7), 2004, pp. 1339-1360. 

6.        E.J.R. Justino, F. Bortolozzi, and R. Sabourin. “A comparison of SVM and HMM classifiers in the off-line signature verification”, Pattern Recognition Letters 26, 2005, pp. 1377-1385.

7.        H. Srinisvasan, M. J. Beal and S.N. Srihari, “Machine Learning approaches for Person Identification and Verification”, SPIE Conference on Homeland Security, 2005, pp. 574-586.

8.        H, Lv, W. Wang, C. Wang and Q. Zhuo, “Off-line Chinese Signature Verification based on Suppor Vector Machines”, Pattern Recohnition Letters 26, 2005, pp. 2390-2399.

9.        M. Blumenstein, X.Y. Liu, and B. Verma, “A Modified Direction Feature for Cursive Character Recognition”, International Joint   Conference on Neural Networks (IJCNN ’04), 2004, pp. 2983-2987.

10.     L.E. Martinez, C.M. Travieso, J.B. Alonso, and M. Ferrer, “Parametrization of a forgery Handwritten Signature Verification using SVM”, IEEE 38th Annual 2004 International Carnahan Conference on Security Technology, 2004, pp. 193-196.

11.     Kalenova,” Personal Authentication using Signature Recognition”, D.2005.

12.     Plamondon, “The Handwritten Signature as a Biometric Identifier: Psychophysical Model & System Design” IEE Conference Publications, R.1995,Issue CP408, 23-27.

13.     Jain, A., Griess, F., and Connel1, S. “Online Signature Recognition”, Pattern Recognition, vol.35,2002, pp 2963-2972.

14.     OZ, C. Ercal, F. and Demir, Z. Signature Recognition and Verification with ANN.

15.     Ozgunduz, E., Karsligil, E., and Senturk,,”Off-line Signature Verification and Recognition by Support Vector Machine”, T. 2005 .Paper presented at the European Signal processing Conference.

16.     Aykanat C. et. al ,(Eds). 2004. Proceedings of the 19th International Symposium on Computer and Information Sciences, ISCIS 2004. Springer-Verlag Berlin Heidelberg New York. pp. 373-380.

17.     Pacut, A. and Czaja,”Recognition of Human Signatures. Neural Network”, A. 2001,in proceedings of the International Conference on Neural Network, IJCNN’01, vol.2, pp 1560-1564.

18.     Miguel A. Ferrer, Jesu´s B. Alonso, and Carlos M.  Travieso,” Offline Geometric Parameters for Automatic Signature Verification Using Fixed-Point Arithmetic”, IEEE Transactions on Pattern analysis and Machine Intelligence Vol. 27, No. 6, June 2005
19.     Shashi kumar , K.B.raja, R.K. Chhotary, Sabyasachi Pattanaik, “Off-line Signature Verification Based on Fusion of Grid and Global Features Using Neural Networks”, Shashi Kumar et. al. / International Journal of Engineering Science and Technology Vol. 2(12), 2010, 7035-704

20.     José F. Vélez, Ángel Sánchez and A. Belén Moreno,” Robust Offline Signature Verification using compression networks and positional cuttings”, Escuela Superior de Ciencias Exper imentalesy Tecnología Universidad Rey Juan Carlosc/ Tulipán, s/n 28933- Móstoles (Madrid), SPAIN.

21.     Ismail A. Ismail 1, Mohamed A. Ramadan 2, Talaat S. El- Danaf 3 And Ahmed H. Samak ,”An Efficient Off-line Signature Identification Method Based On Fourier Descriptor and Chain Codes”, IJCSNS International Journal of Computer Science and Network Security, Vol.10 No.5, May 2010.





Pushpendra Singh, Om Prakash Yadav, Yojana Yadav

Paper Title:

ECG Signal Compression Implementation by a New 2-Dimensional Transform Technique

Abstract:    Electrocardiogram signal compression algorithm is needed to reduce the amount of data to be transmitted, stored and analyzed, without losing the clinical information content. This work investigates a set of ECG signal compression schemes to compare their performances in compressing ECG signals. These schemes are based on transform methods such as discrete cosine transform (DCT), fast fourier transform (FFT), discrete sine transform (DST), and their improvements. An improvement of a discrete cosine transform (DCT)-based method for electrocardiogram (ECG) compression is also presented as DCT-II. A comparative study of performance of different transforms is made in terms of Compression Ratio (CR) and Percent root mean square difference (PRD).The appropriate use of a block based DCT associated to a uniform scalar dead zone quantiser and arithmetic coding show very good results, confirming that the proposed strategy exhibits competitive performances compared with the most popular compressors used for ECG compression. Each specific transform is applied to a pre-selected data segment from the CSE database,  and then compression is performed.

   Compression Ratio, Compression factor, Compression time, ECG, PRD.


1.        B. A. Rajoub, “An efficient coding algorithm for the compression of ECG signals using the wavelet transform,” IEEE Transactions on Biomedical Engineering, 49 (4): 355–362, 2002.
2.        O. O. Khalifa, S. H. Harding, A. A. Hashim, “Compression Using Wavelet Transform” Signal Processing: An International Journal (SPIJ), pp. 17 – 26, 2008.

3.        J. Cox, F. Nulle, H. Fozzard, and G. Oliver, “AZTEC, a preprocessing program for real-time ECG rhythm analysis,” IEEE. Trans. Biomedical Eng., BME-15: 128–129, 1968.

4.        R.N. Horspool and W.J. Windels, “ECG compression using Ziv-Lempel techniques, Comput” Biomed. Res., 28: 67–86, 1995.

5.        B. R. S. Reddy and I. S. N. Murthy, “ECG data compression using Fourier descriptors,” IEEE Trans. Biomed. Eng., BME-33 (4): 428–434, 1986.

6.        H. A. M. Al-Nashash, “ECG data compression using adaptive Fourier coefficients estimation,” Med. Eng. Phys., 16: 62–66, 1994.

7.        S. C. Tai, “Improving the performance of electrocardiogram sub-band coder by extensive Markov system,” Med. Biol. Eng. And Computers, 33: 471–475, 1995.

8.        J. Chen, S. Itoh, and T. Hashimoto, “ECG data compression by using wavelet transform,” IEICE Trans. Inform. Syst., E76-D (12): 1454–1461, 1993.

9.        A. Cohen, P. M. Poluta, and R. Scott-Millar, “Compression of ECG signals using vector quantization,” in Proc. IEEE-90 S. A. Symp. Commun. Signal Processing COMSIG-90, Johannesburg, South Africa, pp. 45–54, 1990.

10.     G. Nave and A. Cohen, “ECG compression using long-term prediction,” IEEE. Trans. Biomed. Eng., 40: 877–885, 1993.

11.     A. Iwata, Y. Nagasaka, and N. Suzumura, “Data compression of the ECG using neural network for digital Holter monitor,” IEEE Eng. Med. Biol., Mag, pp. 53–57, 1990.

12.     L. Auslander, E. Feig and S. Winograd (1984): Abelian Semi-simple Algebras and Algorithms for the Discrete Fourier Transform. In Advances in Applied Mathematics.5, 31-55.

13.     Tinku Acharya and Ajoy K. Roy. Image Processing Principles and Applications. John Wiley.

14.     S. Chan and K. Ho (1990): Direct Methods for computing discrete sinusoidal transforms. IEEE Proceedings, 137, 433-442.

15.     G. Steidl and M. Tasche (1991): A Polynomial approach to Fast algorithms for Discrete Fourier –cosine and Fourier-sine Transforms. In Mathematics in Computation, 56 (193), 281-296.

16.     E. Feig and S. Winograd (1992): Fast Algorithms for Discrete Cosine Trnsforms. IEEE Tran. On Signal Processing.vol-40(9), pp 2174-2193.

17.     Xuancheng Shao and Steven G. Johnson (May 10, 2007): Type-II/III DCT/DST algorithms with reduced number of arithmetic operations. Preprint submitted to Elsevier.

18.     J. Abenstein and W. Tompkins (1982): A new data-reduction algorithm for real time ECG analysis. IEEE Tran. On Biomed. Engg., 29(BME-1):4, 3-8.

19.     K. R. Rao and P. Yip (1990): Discrete cosine transform – algorithms, advantages, applications, San Diego: Academic Press.

20.     Al-Nashash, H. A. M., 1994, "ECG data compression using adaptive Fourier coefficients estimation", Med. Eng. Phys., Vol. 16, pp. 62-67

21.     Bradie, Brian., 1994, "Wavelet Packet Based Compression of Single Lead ECG", Scheduled to appear in IEEE Transactions on Biomedical Engineering

22.     Hamilton, Patrick S., 1991, "Compression of the Ambulatory ECG by Average Beat Subtraction and Residual Differencing", IEEE Transactions on Biomedical Engineering, Vol. 38, No. 3., pp. 253-259.

23.     Pranob K. Charles and Rajendra Prasad K. (2011): A Contemporary Approach For ECG Signal Compression Using Wavelet Transforms. Signal and Image Processing: An International Journal (SIPIJ). Vol. 2, No. 1, 178-183.





N. Rajasekhar Reddy, R.Saraswati

Paper Title:

Intelligent Classification and Retrieval of Software Components

Abstract:    This work proposes a new methodology for smart classification and retrieval of software mechanism based onuser–defined necessities. The classification proposal utilizes a dedicated genetic algorithm which evolves a tiny number of classifiers by dividing the position of available components stored in a database into positive subsets (clusters). Each classifier consequently becomes the leader-representative of its cluster. When a customer wishes to trace a component he/she identifies the preferred characteristics (component profile) which are then compared with the distinctiveness of the available classifiers. The neighboring classifier matching the required distinctiveness over a user-defined threshold will effect in the “winning” set of components belong to its cluster that is accessible to the user in descending matching strength. We have validated our methodology over a artificial dataset of components and the consequences obtained were very encouraging. Last, we here the web application developed to bear the proposed intelligent categorization method.

   Each classifier consequently becomes the leader-representative of its cluster


1.        CLARiFi, IST-1999-11631, http://clarify.eng.it
2.        E. Damiani and M. G. Fugini, “Automatic thesaurus construction supporting fuzzy retrieval of reusable components”, Proceedings of the ACM Symposium on Applied Computing Tennessee, US, pp. 542-547, 1995

3.        R. P. Diaz, “Implementing Faceted Classification for Software Reuse”, Communications of the ACM, Vol. 34, No. 5, pp.88-97, 1991

4.        W. B. Frakes and T. P. Pole “An Empirical Study Representation Methods for Reusable Software Components”,IEEE Transactions on Software Engineering archive, vol. 20,no. 8, pp. 617-630, 1994

5.        D. E. Goldberg, “Genetic Algorithms”, Addison-Wesley, 1989

6.        J. Lee, “Software Engineering with Computational Intelligence”, Springer, 2003

7.        V. Maxville, J. Armarego, C.P. Lam, “Intelligent Component Selection”, 28th Annual International Computer Software and Applications Conference, COMPSAC, pp 244-249, 2004

8.        S. Nakkrasae, P. Sophatsathit and W. R. Edwards, “Fuzzy Subtractive Clustering Based Indexing Approach for Software Components Classification”, International Journal of Computer& Information Science, vol 5, no. 1, March 2005

9.        W. Pedrycz and J. Waletzky, “Fuzzy clustering in software reusability”, Software – Practice and Experience, vol.27, no.3, pp.245-270, 1997

10.     C. Szyperski, D. Gruntz and S. Murer, ”Component Software”, Addison Weslsey, 2002

11.     H. Yao and L. Etzkorn, “Towards a semantic-based approach for software reusable component classification and retrieval”, Proceedings of the 42nd annual Southeast regional conference,pp. 110-115, 2004





Md. Anisa Shereen

Paper Title:

Optimal Allocation of DG Units for Radial Distribution Systems using Genetic Algorithm

Abstract:    This paper proposes a Genetic Algorithm (GA) based technique for the optimal allocation of Distributed Generation (DG) units in the power systems. In this paper the main aim is to decide optimal number, type, size and location of DG units for voltage profile improvement and power loss reduction in distribution network. GA fitness function is introduced including the active, reactive power losses and the cumulative voltage deviationvariables with selecting weight of each variable. Two types of DGs are considered and the distribution load flow is used to calculate exact loss. Load flow algorithm is combined appropriately with GA till access to acceptable results of this operation. The suggested method is programmed under MATLAB software. The effectiveness of the proposed methodology was tested on Standard IEEE33 bus system and found maximum loss reduction for each of two types of optimally placed multi-DGs.

   Genetic Algorithm, Distributed Generators, Cumulative Voltage Deviation, Active and Reactive Power Loss, Weight, Load Flow.


1.        N. Mithulananthan, than OO and LE van phu, "Distributed Generator Placement In Power Distribution System Using Genetic Algorithm To Reduce Losses", Thammasat Int. J. Sc. Tech., vol. 9, no. 3, July-September 2004.
2.        T. Ackermann, G. Andersson, and L.Söder, “Distributed Generation: A Definition Proceedings Of The First International Symposium On Distributed Generation And Market Aspects, June 11-13, 2001, Royal Institute Of Technology, Sweden

3.        S. A. Papathanassion, “a technical evaluation framework for the connection of dg to the distribution network,” electric power systems research.77, pp. 24 – 34, 2007.

4.        W. El-Khattam, and M.M.A. Salama, “Distributed Generation Technologies, Definitions And Benefits”, Electric Power Systems Research. 71, pp.119–128, 2004.

5.        Yiming Mao, and Karen N. Miu ,"Switch Placement to Improve System Reliability for Radial Distribution Systems with Distributed Generation" , IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 18, NO. 4, NOVEMBER 2003.

6.        H. Khan and M.A. Choudhry. Implementation of distributed generation algorithm for performance enhancement of distribution feeder under extreme load growth.International Journal of Electrical Power and Energy Systems. 2010, 32 (9): 985-997.

7.        A. L. Devi, B. Subramanyam, “Sizing of DG Unit Operated at Optimal Power Factor to Reduce Losses in Radial Distribution. A Case Study,” Journal of Theoretical and Applied Information Technology (JATIT), 2005 – 2008.

8.        D.Q. Hung, N. Mithulanathan and R.C. Bansal. Multiple distributed generators placement in primary distribution networks for loss reduction. IEEE Transactions on Industrial Electronics.(In Press).

9.        SujathaKotamarty, SarikaKhushalani and Noel Schulz, "Impact of distributed generation on distribution contingency analysis", Electr. Power Syst. Res. (24 January 2008), doi:10.1016/j.epsr.2008.01.020.

10.     S. Ghosh ,  S.P. Ghoshal and S. Ghosh. Optimal sizing and placement of DG in network system.International Journal of Electrical Power and Energy Systems. 2010, 32 (8): 849-856.

11.     M. Padma Lalitha, V.C. Veera Reddy, N. Usha. 2009. DG placement using Fuzzy for maximum loss reduction in radial distribution system. International journal of computers applications in engineering, technology and sciences.

12.     M. Gandomkar,M. Vakilian,M. Ehsan, " A combination of genetic algorithm and simulated annealing for optimal DG allocation in distribution networks", CCECE/CCGEI,Saskatoon, May 2005 IEEE, PP.645-648.

13.     Y. Alinejad-Beromi(1) , M. Sedighizadeh(2) , M. R. Bayat(1) , M. E. Khodayar(3) “Using Genetic Alghoritm for Distributed Generation Allocation to reduce Losses And Improve Voltage Profile “(1)University of Semnan, Iran (2)Islamic Azad Univ.ofSafeh, Iran. (3) Sharif Univ. Tehran,Iran. proceedings of world academy of science, engineering and technology volume 27 february 2008 issn 1307-6884.

14.     D. Singh, D. Singh and K.S. Verma. Multi-objective optimization for DG planning with load models.IEEE Transactions on Power Systems. 2009, 24 (1): 427-436.

15.     R.M. Kamel and B. Karmanshahi.Optimal size and location of DGs for minimizing power losses in a primary distribution network.Transaction on Computer Science and Electrical and Electronics Engineering. 2009, 16 (2): 137-144.





P. K. Trivedi, N. B.Vasava

Paper Title:

Effect of Variation in Pitch of Tube on Heat Transfer Rate in Automobile Radiator by CED Analysis

Abstract:     The demand for more powerful engines in smaller hood spaces has created a problem of insufficient rates of heat dissipation in automotive radiators. This has lead to the increased demand on the power packed radiators, which can dissipate maximum amount of heat for any given space. The geometry of the finned-tube heat exchanger is an intricate one and there are no analytical optimization schemes available to optimize their design, while experimental trial and error is far too time consuming. The radiator designs at present depend on the empirical methods, wherein existing experimental data is used as the thumb rules for the design process. However, for any preliminary design the performance of the radiator can be accessed through Computational Fluid Dynamics (CFD) in prior to the fabrication and testing. In this thesis, first of all solid modeling of heat exchanger in Solid works is prepared and then this solid model is transferred to ANSYS Workbench mesh module for meshing. After completing meshing, this meshed model is transferred to ANSYS CFX for CFD Analysis. Once CFD Analysis is completed with ANSYS CFX, all the flow parameters like heat transfer rate, temperature contour etc. is identified. After getting all the flow parameter it is possible to examine how the heat transfer rate of radiator can be enhanced. For that purpose one geometrical parameter e.g. pitch of tube is varied. As a result of this parametric study, the effect of pitch of tube for best configured radiator for optimum performance is suggested.

   CFD, Heat transfer, Modeling, Pitch, radiator design, Simulation, etc.


1.        J.P.Holman, 2002, Heat transfer, Tata-McGraw-Hill Publications.
2.        ANSYS 12.1 User Guidelines.

3.        Hucho, W.H., Aeodyanamics of Road Vehicles, 4th Edition, SAE International, 1998.

4.        Hucho, W.H., Aeodyanamics of Road Vehicles, 4th Edition, SAE International, 1998.

5.        Changhua Lin and Jeffrey Saunders, 2000, “The Effect Of Changes in Ambient and Coolant Radiator Inlet  Temperatures and Coolant Flow rate on Specific Dissipation”, SAE Technical Papers, 2000-01-0579.

6.        Wikipedia, the free encyclopedia, “Radiator”, Wikipedia@ Wikimedia Foundation, Inc, 2006. 

7.        Incropera, F.P.; and DeWitt, D.P. (2002). Fundamentals Of heat and mass Transfer.  (5th Ed.), Wiley, New York.





R.Naveen,  K.Thanushkodi,  C.Saranya

Paper Title:

Sleep Pass Gate Approach for Static Power Reduction in 8*8 Wallace Multiplier

Abstract:    As the VLSI technology and supply/threshold voltage continue scaling down, leakage power has become more and more significant in the power dissipation of today’s CMOS circuits. The leakage power dissipation is projected to grow exponentially during the next decade according to the International Technology Roadmap for Semiconductors (ITRS).This affects the portable battery operated devices directly. The multipliers are the main key for designing an energy efficient processor, where the multiplier design decides the digital signal processors efficiency. In this paper, a sleep pass gate method is used to reduce the static power dissipation in 8*8 Wallace tree multiplier architecture which has been designed by using 1-bit full adders. This method uses two complementary sleep transistors connected in parallel forming a gate pass structure. In our proposed leakage reduction method, the actual output logic state is maintained in both active and standby mode of operation. The main objective of our work is to calculate leakage power in 8*8 Wallace tree multiplier with sleep pass gate and it is compared with the 8*8 Wallace tree full adder multiplier. The proposed method reduces upto half of the static power dissipation with lesser area and delay.

   Static leakage power, Sleep transistor, Subthreshold leakage, Wallace multiplier, 1- bit full adder


1.       C.S.wallace, “A Suggestion for a fast multiplier”, IEEE Trans.Elechon.con@.,vol.EC-13,pp.14-17, Feb.1964
2.       D. Radhakrishnan, “Low-voltage low-power CMOS full adder,” IEEE Proc. Circuits Devices Syst., vol. 148, no. 1, pp. 19–24, Feb. 2004

3.       Kaushik Roy, Sharat C. Prasad, “Low-power CMOS VLSI circuit design,” Wiley-India, 2009

4.       K. Roy, S. Mukhopadhyay, and H. Mahmoodi-Meimand, "Leakage current mechanisms and leakage reduction techniques deep-submicron CMOS circuits," Proeedings of the IEEE, Feb. 2003, 91, (2), pp. 305-327.), pp305-327.

5.       Abdollahi, F. Fallah, and M. Pedram, “Leakage current reduction in CMOS VLSI circuits by   input vector  control,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.12, no. 2, pp. 140–154, February 2004.

6.       K. Agarwal, H. Deogun, D. Sylvester, and K. Nowka, “Power gating with multiple sleep modes,” Proceedings of the 7th International Symposium on Quality Electronic Design, March 2006, pp. 633– 637.

7.       V. Sundararajan, and K. K. Parhi, “Low power synthesis of dual threshold voltage CMOS VLSI circuits,” Proceedings. Of ISLPED, pp. 139–144, 1999.

8.       Q. Wang, and S. Vrudhula, “Static power optimization of deep submicron CMOS circuits for dual Vt technology,” Proceedings of ICCAD, pp. 490–496, April 1998.

9.       T. Douseki, S. Mutoh, Y. Matsuya, T. Aoki, S. Shigematsu and J. Yamada, “1-V power supply high-speed digital circuit technology with multithreshold-voltage CMOS,” IEEE Journal of Solid-State Circuits, pp. 847-854, 1995.

10.     K.  Flautner, N.  S.  Kim, S.  Martin, D.  Blaauw, and T.  Mudge,  “Drowsy  caches:  simple   techniques  for  reducing  leakage  power,”  Proceedings of the International Symposium on Computer Architecture, pp. 148-157, May 2002.

11.     “Analog Switch”http://www.maxim-ic.com/app-notes/index.mvp/id/4243.





Y. Jahnavi, Y. Radhika

Paper Title:

A Cogitate Study on Text Mining

Abstract:    The vast amount of digitalized textual content has given rise to the need for sophisticated text mining techniques. Text Mining is the process of analyzing and extracting the useful information from a set of semi structured and unstructured documents by applying machine learning and natural language processing techniques.  It is easy for the people to assimilate from the categorized text documents. Even though a large research has evolved into this problem, there is a survey that indicated trends and directions. In this paper a cogitate study on preprocessing, term weighting algorithms, concept based term weighting algorithms, pattern discovery, categorization,  domain ontology based frame work for text mining and summarization techniques is presented. In addition, a number of successful applications of text mining are discussed.

   Classifiers, Term Weighting, Text Mining.


2.       L. Talavera and J. Bejar,“Generality-Based Conceptual Clustering with probabilistic concepts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no.2, pp. 196-206, Feb. 2001.

3.       Sergio Bolasco ,AlessioCanzonetti , Francesca Della Ratta-Rinald and Bhupesh K. Singh, (2002), “Understanding Text Mining:a Pragmatic Approach”, Roam, Italy.

4.       R. Swan and J. Allan, “Automatic Generation of Overview Timelines”, In SIGIR2000, 49-56.

5.       Andreas Hotho, Steffen Staab, GerdStumme,”Text Clustering Based on Background Knowledge”, Technical Report 425, Inst. AIFB, Univ. of Karlsruhe, Apr. 2003.

6.       M. Porter, “An Algorithm for Suffix Stripping,” Program, vol. 14, no. 3, 1980.

7.       S.-T. Wu, Y. Li, and Y. Xu, “Deploying Approaches for Pattern Refinement in Text Mining,” Proc. IEEE Sixth Int’l Conf. Data Mining (ICDM ’06), pp. 1157-1161, 2006.

8.       S.-T. Wu, Y. Li, Y. Xu, B. Pham, and P. Chen, “Automatic Pattern-Taxonomy Extraction for Web Mining,” Proc. IEEE/WIC/ACM Int’l Conf. Web Intelligence (WI ’04), pp. 242-248, 2004.

9.       http://en.wikipedia.org/wiki/Tf*idf

10.     K.K. Bun and M. Ishizuka, “Topic Extraction from News Archive Using TF_PDF Algorithm,” Proc. Third Int’l Conf. Web Information Systems Eng. (WISE ’02), pp. 73-82, 2002.

11.     X. Li and B. Liu, “Learning to Classify Texts Using Positive and Unlabeled Data,” Proc. Int’l Joint Conf. Artificial Intelligence (IJCAI ’03), pp. 587-594, 2003.

12.     S.T. Dumais, “Improving the Retrieval of Information from External Sources,” Behavior Research Methods, Instruments, and Computers, vol. 23, no. 2, pp. 229-236, 1991.

13.     K. Aas and L. Eikvil, “Text Categorisation: A Survey,” Technical Report Raport NR 941, Norwegian Computing Center, 1999.

14.     T. Joachims, “A Probabilistic Analysis of the Rocchio Algorithm with tfidf for Text Categorization,” Proc. 14th Int’l Conf. Machine Learning (ICML ’97), pp. 143-151, 1997.

15.     G. Salton and C. Buckley, “Term-Weighting Approaches in Automatic Text Retrieval,” Information Processing and Management: An Int’l J., vol. 24, no. 5, pp. 513-523, 1988.

16.     Kuan-Yu Chen, LuesakLuesukprasert, and Seng-cho T. Chou,” Hot Topic Extraction Based on Timeline Analysis and Multidimensional Sentence Modeling,” IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 19, NO. 8, pp. 1016-1025, AUGUST 2007.

17.     Y. Yang, T. Pierce, and J. Carbonell., “A Study of Retrospective and Online Event Detection. In Proceedings of the 21st Annual International ACM SIGIR Conference,” Melbourne, Australia. ACM Press. 1998, 28- 36.

18.     B. Thorsten, C. Francine, and F. Ayman.,” A System for New Event  Detection.,” In Proceedings of the 26th Annual International ACM SIGIR  Conference, New York, NY, USA. ACM Press. 2003, 330-337.

19.     K. Zhang, J. Li, and G. Wu., “New Event Detection Based on Indexingtree and Named Entity,” In Proceedings of the 30th Annual International ACM SIGIR Conference, Amsterdam, the Netherlands. ACM Press. 2007, 215-222.

20.     J. Allan, R. Papka, and V. Lavrenko.,”On-line new event detection and tracking,” In Proceedings of the 21st Annual International ACM SIGIR Conference, Melbourne, Australia. ACM Press. 1998, 37-45.

21.     C. Wang, M. Zhang, S. Ma and L. Ru.,”Automatic online news issue construction in Web environment.,” In proceedings of the 17th international conference on World Wide Web, 2008, 457-466.

22.     Yan Gao Jin Liu and PeiXunMa ,”The Hot KeyPhrase Extraction based on TF*PDF,” IEEE, 2011.

23.     M. Lan, C.L.Tan and Hwee-Boon Low, “Proposing a New Term Weighting Scheme for Text Categorization,” American Association for Artificial Intelligence, pp. 763-768, 2006.

24.     Joel, Thomos, Brain, Mark and Ali,, “TF-ICF: A New Term Weighting Scheme for Clustering Dynamic Data Streams.” 

25.     Tian and Tong, “An improvement to TF: Term Distribution based Term Weight Algorithm”, IEEE Computer Society, pp:252-255, 2010.

26.     Stephen Marsland, Chapman & Hall, Machine learning An Algorithm Perspective, CRC. 2009.

27.     Shady Shehata, FakhriKarray, and Mohamed S. Kamel,” An Efficient Concept-Based Mining Model for Enhancing Text Clustering”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 22, NO. 10, pp.1360-1371, OCTOBER 2010.

28.     S.-T. Wu, Y. Li, and Y. Xu, “Deploying Approaches for Pattern Refinement in Text Mining,” Proc. IEEE Sixth Int’l Conf. Data Mining (ICDM ’06), pp. 1157-1161, 2006.

29.     S.-T. Wu, Y. Li, Y. Xu, B. Pham, and P. Chen, “Automatic Pattern-Taxonomy Extraction for Web Mining,” Proc. IEEE/WIC/ACM Int’l Conf. Web Intelligence (WI ’04), pp. 242-248, 2004.

30.     Evan Wei Xiang, Bin Cao, Derek Hao Hu, and Qiang Yang,” Bridging Domains Using World   Wide Knowledge for Transfer Learning”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 22, NO. 6, pp. 770-783,  JUNE 2010

31.     Paul Kingsbury and Martha Palmer,” PropBank: the Next Level of TreeBank”, Proc. Workshop Treebanks and lexical Theories,2003.

32.     Kowalski, Gerald, Mark T Maybury, Information Storage and Retrieval Systems: Theory and Implementation, Springer.

33.     Ricardo Baeza-Yates, Modern Information Retrival, Pearson Education, 2007.

34.     David A Grossman and OphirFrieder, Information Retrieval: Algorithms and Heuristics, Second Edition, Springer.

35.     William B Frakes, Ricardo Baeza-Yates, Information Retrieval Data Structures and Algorithms, Pearson Education, 1992.

36.     Robert Korfhage, John Wiley & Sons, Information Storage and Retrieval.

37.     Ethem. L. Padin, Machine Learning,

38.     Stephen Marsland, chapman and Hall/CRC, Machine Learning An Algorithm Perspective, 2009

39.     R.O. Duda, P. Hart, David G. Stork, Siley, Pattern Classification 2ndedition.

40.     Smith Tsanf, Ben Kao, Kevin Y. Yip, Wai-Shing Ho, and  Sau Dan Lee, ”Decision Trees for Uncertain Data”, IEEE Trans. Knowl. Data Eng., vol. 23, no. 1,pp. 1-15,2010.

41.     A Survey on Transfer Learnig,

42.     www1.i2r.astar.edu.sg/~jspan/publications/TLsurvey_0822.pdf

43.     G.R. Xue. W.Dai. Q.Yang, and Y.Yu,” Topic-Bridged PLSA for Cross-Domain Text Classification”, Proc. 31st Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’08),pp. 627-634, July 2008.

44.     J. Jiang and C. Zhai, “Instance Weighting for Domain Adaptation in NLP,” Proc. 45th Ann. Meeting o the Assoc. for Computational Linguistics, June 2007.

45.     A. Argyriou, C.A. Micchelli, M. Pontil, and Y. Ying, “A Spectral Regularization Framework for Multi-Task Structure Learning”, Proc. 21st Ann. Conf. Neural Information

46.     Domeniconi, and J. Hu, “Cross-Domain Text Classification Using Wikipedia”, The IEEE Intelligent Informatics Bull., vol. 9, pp. 5-7, Nov. 2008.

47.     WordNet, http://www.cogsci.princeton.edu /~wn/, 2006.

48.     T. R. Gruber,” A Translation Approach to Portable Ontology Specifications. Knowledge Acquisition,” 199-220, 1993.

49.     R. Studer, V. R. Benjamins. FenselD.,”Knowledge Engineering, Principles and Methods. Data and Knowledge Engineering,”   161-197, 1998.

50.     N. Guarino. Semantic Matching: Formal Ontological Distinctions for Information Organization, Extraction, and Integration [M].,Pazienza M. T., Information Extraction: A Multidisciplinary Approach to an Emerging Information Technology. Berlin/Heidelberg: Springer, 1997: 139-170.

51.     Feng Hu, Yu-fengZhang, Text Mining Based on Domain Ontology, IEEE, 1456-1459, 2010.

52.     S. Bloehdorn and P. Cimiano and A. Hotho and S.Staab, “An Ontology-based Framework for Text Mining,” 1-20, july 2004.

53.     L. P. Jing, L. X. Zhou, et al.,” Ontology-based Distance Measure for Text Clustering “2006.

54.     Automatic Summarization. Wikipedia,

55.     http://en.wikipedia.org/wiki/Automatic_summarization.

56.     ShanmugasundaramHariharan,” Extraction Based Multi Document Summarization using Single Document  Summary Cluster”, Int. J. Advance. Soft Comput. Appl., Vol. 2, No. 1, pp. 1-16, March 2010.





Saumendra das, Prasant Kumar Padhy, K.Venugopal, Santosh Ranganath .N

Paper Title:

Supply Chain Management: A Business Centric Approach

Abstract:    Many research personnel’s primary attention in the study of supply networks has focused on the product or transportation mechanism and also on the relevant information flows, much less central to the study of supply chain management and its inherent bond with cash flows. Networked organizations are receiving increasing attention in management literature because of their perceived success in terms of fast growth, increased flexibility and efficiency of operations, lower overhead costs, and effective competitive positioning. For all firms, the choice of which activities to perform internally and which to outsource is a critical issue. Cost information can play a fundamental role in the decision about how much “market” and how much “hierarchy.” Indeed, outsourcing is, basically, a cost and benefits evaluation. Management accounting and strategic management studies have, so far, not addressed this perspective explicitly. Management accounting is too internally focused on the costs of the firm rather than the entire supply chain. The strategic management perspective, on the contrary, focuses its attention on the supply chain, but only deals very generally with those transaction costs which emerge while using the market. Both approaches fall short in providing a well articulated financial rationale for the segregation, which activities should be outsourced and which should be entrusted to the market. Neither approach does much to help managers understand where value is created in the value chain, nor the costs of the activities involved including their cost drivers. Cash Flow Management (CFM) studies provide a useful cost analysis framework which is too often missing in the strategic decision making process. Competitive analysis, value or supply chain mapping, and cost driver analysis are, in particular, the tools of CFM. This paper considers a number of central issues related to the study of this under-researched issue. Specifically, we raise the issues of cash flows and their cost as well as risk implications, explore the value that can be derived from optimizing and reorganizing cash flows, and consider the role of current banking services arrangements and their implications for change and improvement of cash flows in supply chain networks where both vertically integrated and network organizations exist. The financial impact arising because of the complexity involved in different organization models and its impact on profitability and competitive position is our main theme.

   Multinational companies; Key resource area; Cash flow management; HP; SCOR and GSC


1.       Ask J.A. and Laseter T.M. (1998), “Cost Modeling: a Foundation Purchasing Skill”, Strategy & Business, Booz Allen & Hamilton.
2.       Atkinson A.A., Banker R.D., Kaplan R.S. and Young S.M. (1997), Management Accounting, Prentice Hall, Englewood Cliffs, N.J.

3.       Baltacioglu, T., Ada, E, Kaplan, M.D., Yurt, O., and Kaplan, Y.C (2007), “A New Framework for Service Supply Chains,” The Service Industries Journal (27:2), pp. 105 – 124.

4.       Berger, A.N., and Udell, G.F (2005) “A More Complete Conceptual Framework for Financing of Small and Medium Enterprises,” World Bank Policy Research Working Paper 3795.

5.       Carr L.P. and Ittner C.D. (1992), “Measuring the Cost of Ownership”, Journal of Cost Management.

6.       Croxton, K., Garcia-Dastugue, S., Lambert, D., and Rogers, D (2001), “The supply chain management processes,” International Journal of Logistics Management (12), pp. 13-36.

7.       Demsetz H. (1993), “The Theory of the Firm”, Revisited, in O.E. Williamson and S.G. Winter (eds.), The Nature of the Firm. Origins, Evolution, and Development, Oxford University Press, New York.

8.       Ellram, L., Tate, W., and Billington, C (2004), “Understanding and managing the services supply chain,” Journal of Supply Chain Management (40), pp. 17-32.

9.       Fellenz, M.R., and Brady, M. (2007), “Technology Deployment for Global Services Supply Networks: A Research Agenda,” Working Paper, Centre for the Dynamics of Global Business Systems, TCD, Dublin, Ireland,

10.     Hennart J.F. (1988), “Upstream Vertical Integration in the Aluminum and Tin Industry”, Journal of Economic Behavior and Organization, vol. 9.

11.     Hergert M. and Morris D. (1989), “Accounting Data for Value, Chain Analysis”, Strategic Management Journal, Vol. 10.

12.     Hill C.W.L. and Hoskisson R.E (1987), “Strategy and Structure in the Multi-product Firm”, Academy of Management Review, vol. 12.

13.     Khanna T. (1998), “The Scope of Alliances”, Organization Science, May-June, Special Issue.29

14.     Kogut, B. (1991), “Joint ventures and the option to expand and acquire”, Management Science, 37, pp. 19-33.

15.     Lee, H., and Billington, C (1995), “The evolution of supply-chain-management models and practice at Hewlett-Packard,” Interfaces (25), pp. 42-63
16.     Lorenzoni G. and Baden Fuller C. (1995), “Creating a Strategic Center to Manage a Web of Partners”, California Management Review, vol. 37, No 3.

17.     Lorenzoni G. and Lipparini A (1999), “The leveraging of Inter-firm Relationships as a Distinctive Organizational Capability: A Longitudinal Analysis”, Strategic Management Journal, Vol. 20, No 5.

18.     McNair C.J. (1994), “The Profit Potential. Taking High Performance to the Bottom Line”, Oliver Wight Publications Inc., Essex Junction, VT.

19.     Sengupta, K., Heiser, D., and Cook, L (2006), “Manufacturing and service supply chain performance: A comparative analysis”, Journal of Supply Chain Management (42), pp. 4-15.

20.     Shank J.K. and Govindarajan V. (1993), “Strategic Cost Management: The New Tool for Competitive Advantage”, The Free Press, New York, NY.

21.     Shank J.K. and Govindarajan V. (1989), “Strategic Cost Analysis”, Richard D. Irwin, Chapter 7.

22.     Shank J.K. and R. Silvi (1999), “Strategic Cost Analysis for Profit Recovery: A Field Study”, Working Paper, Babson College, Wellesley, MA.





Mangala S Joshi, K Nirmala Kumari, Saumil G Merchant

Paper Title:

Job Execution Framework for Performance Testing

Abstract:    Performance Testing [2] determines the system behavior under specific system workloads. The process involves identifying the attributes and acceptance criteria followed by design of tests and configuration of test environment. These tests are implemented and executed on the system. Validation of tests, results collection and analysis of the same is carried out in the next step. Implementing and executing a number of tests either at the instant or schedule it to execute at a particular time on the system would be easier and helpful as it saves tester’s effort and time. Job Execution Framework (JEF) is generic in nature and fulfills the above requirement. It supports 10 functions of which 8 are open to users. This paper gives detailed description of all the functions and their usage.



1.      http://en.wikipedia.org/wiki/Software_performance_testing#Methodology
2.      http://en.wikipedia.org/wiki/Software_performance_testing

3.      http://en.wikipedia.org/wiki/Cron

4.      White Paper Performance Testing Methodology by Johann du Plessis

5.      Teach Yourself Perl 5 in 21 days David Till





Akshay Goswami, Roopali Goel

Paper Title:

Security and Privacy in Vanets

Abstract:    Technologies have both advantages and disadvantages. Now a day’s a vehicle can be tracked by its location, traffic status and position based on transmission of signals, when vehicles communicated to other vehicles. In the above paper, we discuss the different aspects of security and privacy measures in VANET’S. Vanet communication can be enhanced to provide optimized working of security and privacy measures, for flexible communication between interconnected vehicles..

   Now a day’s a vehicle can be tracked by its location


1.       Krishna sampigetnaya*, leping huang+, mingyanLi* , Radha roovendran* , kanta matsura+ , kaary sezaki+  University of Tokyo, Japan *University of Washington , Seattle  In CARAVAN: providing location privacy for VANET’s.
2.       Jose’ mariade Fuentes , Ana Isabel Gonzalez- tables Arturo ribagarda Department of computer science University of carlos  of Madrid  (Spain) in overview of security issues in vehicular ad-hoc network.

3.       Hang dok1, Huirang fu1, rubeen edievarria2 , and Hesivi weerasingne1

1        Oakland university , Rochester

4.       university of Illinois at Chicago , IL , USA In privacy issues of vehicular ad-hoc network.

5.       Babur aslam and cliff c.zoo in distributed certificate architecture for VANET’s.

6.       Aijaz, A., Bochow, B., Dötzer, F., Festag, A., Gerlach, M., Kroh, R., et al. (2006). Attacks on Inter-Vehicle Communication Systems - An Analysis. International Workshop on Intelligent Transportation. Hamburg, Germany: IEEE Communications Society.

7.       Kargl, F., Papadimitratos, P., Buttyan, L., Müter, M., Schoch, E., Wiedersheim, B., et al. (2008). Secure vehicular communication systems: implementation, performance, and research challenges. IEEE Communications Magazine , 46 (11), 110-118.

8.       Papadimitratos, P., Gligor, V., & Hubaux, J.-P. (2006). Securing Vehicular Communications - Assumptions, Requirements, and Principles. Workshop on Embedded Security in Cars (ESCAR), (pp. 5-14). Berlin, Germany.

9.       J.-P. Hubaux, S. Capkun, and J. Luo, “The security and privacy of smart vehicles,” IEEE Security & Privacy, vol. 2, no. 3, pp. 49–55, 2004.

10.     L. Huang, K. Matsuura, H. Yamane, and K. Sezaki, “Enhancing wireless location privacy using silent period,” in IEEE Wireless Communications and Networking Conference (WCNC), 2005, pp. 1187–1192.

11.     M. Gruteser and D. Grunwald, “Enhancing location privacy in wireless LAN through disposable interface identifiers: a quantitative analysis,” in Proc. of the ACM Workshop on Wireless mobile applications and

12.     services on WLAN hotspots (WMASH), 2003, pp. 46–55.

13.     L. Huang, K. Matsuura, H. Yamane, and K. Sezaki, “Towards modeling wireless location privacy,” in Proc. of the Workshop on Privacy. Enhancing Technologies (PET), 2005.

14.     F. Bai, N. Sadagopan, and A. Helmy, “IMPORTANT: A framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks,” in Proc. of the IEEE Infocom, 2003, pp. 825–835.





Manjunath Lakkannavar, Ashwini Desai

Paper Title:

Design and Implementation of OFDM (Orthogonal Frequency Division Multiplexing) using VHDL and FPGA

Abstract:    Orthogonal Frequency Division Multiplexing (OFDM) is a multi carrier modulation technique which divides the available spectrum into many carriers. OFDM uses the spectrum efficiently compared to FDMA by spacing the channels much closer together and making all carriers orthogonal to one another to prevent interference between the closely spaced carriers. OFDM provides high bandwidth efficiency because the carriers are orthogonal to each others and multiple carriers share the data among themselves. The main advantage of this transmission technique is their robustness to channel fading in wireless communication environment. The main objective of this project is to design and implement a base band OFDM transmitter and receiver using FPGA. This project focuses on the core processing block of an OFDM system, which are the Fast Fourier Transform (FFT) block and the Inverse Fast Fourier Transform (IFFT). The work also includes in designing a mapping module, serial to parallel and parallel to serial converter module. The 8 points IFFT / FFT decimation-in-frequency (DIF) with radix-2 algorithm is analyzed in detail to produce a solution that is suitable for FPGA implementation. The FPGA implementation of the project is performed using Very High Speed Integrated Circuit (VHSIC) Hardware Descriptive Language (VHDL). This performance of the coding is analyzed from the result of timing simulation using Xilinx.



1.        “Orthogonal Frequency Division Multiplexing (OFDM) Explained”, Magis Networks, Inc., February 8, 2001, www.magisnetworks.com.
2.        “An Introduction to OFDM”, International Engineering Consortium (IEC),   http://www.iec.org/online/tutorial/ofdm/topic04.html.

3.        Design of an OFDM Transmitter and Receiver using FPGA, Loo Kah Cheng, UTM, 2004.

4.        Implementation of  8 point IFFT and FFT for OFDM System, Nor Hafizah Bt Abdul Satar, UTM, 2004.

5.        “Advantages of OFDM”http//pic.qcslink.com/introPLC/AdvOFDM.htm.

6.        Communication Systems, Simon Haykin, 4th Edition, Wiley 2000.





Rakesh Kumar, Jyotishree

Paper Title:

Novel Encoding Scheme in Genetic Algorithms for Better Fitness

Abstract:    Genetic algorithms are optimisation algorithms. Every search and optimisation algorithm needs a representation which represents a solution to a specific problem. The major issue is to represent the parameter of the problem in the form of the chromosome. Choosing the right method of encoding chromosome is a crucial task and largely effects solving of optimization problem. This paper studies different encoding techniques and their associated genetic operations and then proposes a new encoding scheme to overcome the limitations of existing encoding techniques.

   building blocks, encoding, genetic algorithm, schema theorem.


1.     D.E. Goldberg, Genetic algorithms in search, optimisation, and machine learning. Addison Wesley Longman, Inc., ISBN 0-201-15767-5, 1989.
2.     G. Mendel,  Versuche ¨uber Pflanzen-Hybriden. In Verhandlungen des naturforschenden Vereins, Volume 4, Br¨unn, Naturforschender Verein zu Br¨unn, 1866, pp 3-47.

3.     J.Holland, Adaptation in natural and artificial systems, University of Michican Press, Ann Arbor, 1975.

4.     Mitsuo Gen, Genetic algorithms and engineering design, Wiley-IEEE,             ISBN 0471127418, 1996.

5.     K. Deb, Handbook of Evolutionary computation, release 97/1. Oxford University Press, 1997.

6.     M.Mitchell, An Introduction to genetic algorithms, Prentice Hall of India, New Delhi, ISBN-81-203-1358-5,1996.

7.     A.E. Eiben and J.E.Smith., Introduction to Evolutionary Computing, Springer, First edition, ISBN 3-540-40184-9, 2003C.

8.     S. Zhonzhi, Advanced Artificial Intelligence, Volume 1 of Series on Intelligence Science, Scientific Publisher, ISBN981429134X, 9789814291347, 2011

9.     F. Rothlauf,, Representation for genetic and evolutionary algorithms (2.ed), Physica-Verlag, 2006

10.   John R. Koza, Genetic programming: on the programming of computers by means of natural selection,Volume 1, Complex adaptive systemsBradford BooksAuthorJohn R. KozaEdition4, illustrated, reprintPublisherMIT Press, ISBN0262111705, 9780262111706, 1992





S. M Rajbhoj, P. B. Mane

Paper Title:

An Improved binarization based algorithm using minutiae approach for Fingerprint Identification

Abstract:    The long history of fingerprint, their extensive use in forensics and with need of automatic personal identification in recent years, fingerprints is receiving a lot of attention. There is misconception that fingerprint identification is a fully solved problem. However numerous fingerprint systems currently available which use minutiae based approach still do not meet performance requirement of several civilian applications. Performance of these systems degrades with deterioration in the quality of fingerprint image. In absence of an a priori enhancement step most of the binarization based techniques do not provide satisfactory results when applied to low quality images.  Thus trying to eliminate these shortcomings we present an improved approach for fingerprint recognition providing accurate automatic personal identification.  In this approach we use optical sensor which captures image of excellent quality with large capture area and superior reliability. The recognition algorithm first use histogram equalization technique to improve the global contrast of an image, then enhancement of the image is done by an efficient enhancement technique. We then use binarization based method to extract minutiae. False minutiae are removed using thresholding technique. The matching is based on determining the total number of matched minutiae based on Euclidian distances. This system is tested on two different databases. The experimental result shows that incorporating a fast enhancement technique and using an optical scanner increase the accuracy of the system for lower values of False accept rate.

   Fingerprint identification, Minutiae, Enhancement, Binarzation, Extraction, Thresholding, Euclidian distances.


1.       A. K. Jain, A. Ross, and S. Prabhakar, “An introduction to biometric recognition,” IEEE Trans. on Circuits and Systems for Video Technology, vol.  14, pp. 4–20, Jan 2004.
2.       Davide Maltoni, Dario Maio, Anil Jain, and Salil Prabhakar , Handbook of Fingerprint Recognition, Springer, 2009

3.       L. O’Gorman. Fingerprint verification. In A. K. Jain, R. Bolle, and S. Pankanti, editors, Biometrics: Personal Identification in a Networked Society, pages 43–64. Kluwer Academic Publishers, 1999

4.       K. Jain, L. Hong, and R. Bolle. On-line fingerprint verification. IEEE Transactions on PAMI, 19(4):302–314, April 1997

5.       A. Ross, A. K. Jain, and J. Reisman, “A hybrid fingerprint matcher,” Pattern Recognition, vol. 36, pp. 1661–1673, Jul 2003

6.       http://www.digitalpersona.com/Biometrics/Hardware-Products/U-are-U-4500-Reader/4500-Reader/

7.       L. Hong, Y. Wan, & A.K. Jain, Fingerprint Image Enhancement: Algorithm and Performance Evaluation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8), 1998, 777-789

8.       Ratha, Chen and A K Jain, “ Adaptive flow orientation based feature extraction in fingerprint images, ” Pattern Recognition, vol. 28, pp. 1657–1672, 1995

9.       Gonzales and Woods., Digital Image Processing, 3rd edition, Prentice-Hall, NJ, 2007

10.     FVC2002-Second International Fingerprint Verification Competition.  http://bias.csr.unibo.it/fvc2002/download.asp

11.     Center for Identification Technology Research

12.     http://www2.citer.wvu.edu/     





Jyoti Jadhav, Lata Ragha, Vijay Katkar

Paper Title:

Incremental Frequent Pattern Mining

Abstract:  Association rule discovery is widely used Data Mining technique for Market Basket Analysis. It discovers interesting correlations and frequent patterns from the database. In real life, new transactions are continuously added to the database as time advances. This result in; periodic change in correlations and frequent patterns present in database. Incremental Association Rule mining is used to handle this situation. Most of the existing Incremental rule mining methods are highly dependent on availability of main memory. If sufficient amount of main memory is not available, they fail to generate the results. This paper presents a novel method for incremental discovery of frequent patterns using Main Memory database Management System to eliminate this drawback. Experimental results are provided to support the efficiency of proposed method.

   Apriori, FP-tree, Incremental Association Rule Mining, Main memory database Management System


1.       Ruowu Zhong, Huiping Wang,”Research of Commonly Used Association Rules Mining Algorithm in Data Mining”, International Conference on Internet Computing and Information Services, pp. 219 – 222, IEEE 2011.
2.       R. Agrawal, T. Imielinski, and A.N. Swami “Mining association rules between sets of items in large databases,” Proceedings of ACM SIGMOD International Conference on Management of Data, ACM Press, Washington DC, pp.207-216, May 1993.

3.       R. Agrawal, and R. Srikant, ”Fast algorithms for mining association rules,” Proceedings of 20th International Conference on Very Large Data Bases, Morgan Kaufmann, pp. 487-499, 1994.

4.       Agrawal, R. and Psaila, G. Active Data Mining “Proceeding of 1st international Conference knowledge discovery and database”, Montreal, Auguest 1995.

5.       Agrawal R.; J.C Shaifer Parallel Mining of Association Rule “ IEEE transaction on Knowledge and Data Engineering,Vol.6, Dec 1996.

6.       “Improvement and Realization of Association Rules Mining Algorithm Based on FP-tree”, Vol.4, pp.463, IEEE 2010.

7.       Jiawei Han, Jian Pei, Yiwen Yin, Runying Mao, “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree”, Data Mining and Knowledge Discovery, pp.53–87, IEEE 2004.

8.       J. Han, J. Pei and Y. Yin, “Mining frequent patterns without candidate generation,” The ACM SIGMOD International Conference on Management of Data, pp. 1-12, 2000

9.       Huanglin Zeng Sichuan and Bangrong, “An Improved Algorithm of FP - tree Growth Based on Mapping”, International Conference on Computer Application and System Modeling (ICCASM), 2010.

10.     G. Pradeepini, S. Jyothi, “Tree-Based Incremental Association Rule Mining without Candidate Itemset Generation”, Trendz in Information Sciences & Computing (TISC), pp. 78-81, IEEE 2010.

11.     Liu Jian-ping, Wang Ying, Yang Fan-ding, “Incremental-Mining algorithm Pre-FP in association rules based on FP-tree”, Networking and Distributed
Computing(ICNDC), First international Conference, pp.199-203, IEEE 2010.

12.     Lin, C.-W., Hong, T. –P., & Lu, W. –H. (2009). “The Pre-FUFP algorithm for incremental mining” Expert Systems with Applications, 36, 9498–9505.

13.     T. P. Hong and C. Y. Wang, "Maintenance of association rules using pre-larg itemsets," Intelligent Databases: Technologies and Applications, Z. Ma (Ed.), Idea Group Inc., pp. 44-60, 2006.

14.     T. P. Hong, J. W. Lin, and Y. L. Wu, “Maintenance of fast updated frequent pattern trees for record modification", The International Conference on Innovative Computing, Information and Control, pp. 570-573, IEEE 2006.

15.     Siqing Shan, Xiaojing Wang, and Miao Sui “Mining Association Rules: A Continuous Incremental Updating Technique”, 39In proceeding of: Web Information Systems and Mining (WISM), International Conference on, Volume: 1, pp. 62 – 66, IEEE 2010.

16.     Shih-Sheng Chen, Tony Cheng-Kui Huang, Zhe-Min Lin, “New and efficient knowledge discovery of partial periodic patterns with multiple minimum supports”, The Journal of Systems and Software 84, pp. 1638– 1651, ELSEVIER 2011.

17.     Gu, C.-K., Dong, X.-L. “Efficient mining of local frequent periodic patterns in time series database”, International Conference on Machine Learning and Cybernetic, pp. 183–186, 2009.

18.     Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee a,Ho-Jin Choi(2012) “Single-pass incremental and interactive mining for weighted frequent patterns”, Expert Systems with Applications 39 pp.7976–7994, ELSEVIER 2012.

19.     Tanbeer, S. K., Ahmed, C. F., Jeong, B.-S., Lee, Y.-K., Efficient single-pass frequent pattern mining using a prefix-tree. Information Sciences, 179(5), pp.559–583, 2009.

20.     D.Kerana Hanirex, Dr.M.A.Dorai Rangaswamy “Efficient Algorithm For Mining Frequent Itemsets Using Clustering Techniques”, International Journal on Computer Science and Engineering (IJCSE), Vol. 3 No. 3 Mar 2011.

21.     Sheng Chai, Jia Yang and Yang Cheng, “The Research of Improved Apriori Algorithm for Mining Association Rules” In Proceedings of the Service Systems and Service Management, International Conference, 9-11 June 2007 pages : 1 – 4,2007.

22.     Liu Han-bing, Zhang Ya-juan, Zheng Quan-lu, Ye Mao-gong, “New Incremental Updating Algorithm for Mining Association Rules Based on AprioriTidList Algorithm”, Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC), Vol. 2, pp 1611 – 1614, IEEE 2011.

23.     Kotasek Peter and Zendulka Jaroslav, “Comparison of Three Mining Algorithms for Association Rules”, Proceeding of 34th Springer International Conference on Modelling and Simulation of Systems (MOSIS'2000).

24.     Hector Garcia-Molina, Kenneth Salem, “Main Memory Database Systems: An Overview”, IEEE Transactions on Knowledge And Data Engineering, Vol. 4, No. 6, December 1992.

25.     F. Raja, M. Rahgozar, N. Razavi, and M. Siadaty, “A Comparative Study of Main Memory Databases and Disk-Resident Databases”, World Academy of Science, Engineering and Technology, Issue 14, 2006.





B.S.Vamsi Krishna, P.Satheesh, Suneel Kumar R.

Paper Title:

Comparative Study of K-means and Bisecting k-means Techniques in Wordnet Based Document Clustering

Abstract:   Document clustering plays major role in the fast developing information explosion. It is considered as tool for performing information based operations. Document clustering generates clusters from whole document collection automatically and used in many fields. It is the process of grouping text documents into category groups. It has found applications in various domains in information retrieval and web information systems. Ontology-based computing is considered as a natural evolution of existing technologies to cope with the information onslaught. In current paper, background knowledge derived from Word Net as Ontology is applied during preprocessing of documents for Document Clustering. Document vectors constructed from WordNet Synsets is used as input for clustering. Comparative analysis is done between clustering using k-means and clustering using bi-secting k-means. Results indicate that the bi-secting k-means clustering technique is better than standard k-means clustering technique. These results based on the analysis of specifics of clustering algorithm and nature of document data.

   bisecting k-means, document clustering, standatd k-means, wordnet.


1.        Hotho and S. Staab A. Maedche (2001), ―Ontology-based Text Clustering‖, In proceedings of the IJCAI-2001 workshop Text Learning Beyond Supervision
2.        Andreas Hotho and Alexander Maedche and Steffen Staab (2002), ―Ontology based Text-Document Clustering‖, C, Kunstliche Intelligez, 2002, Vol. 16, No. 4. (2002), pp. 48-54.

3.        Hai-Tao Zheng, Charles Borchert , Hong-Gee Kim(2003), ―GOClonto: An ontological clustering approach for conceptualizing PubMed abstracts‖, Journal of Biomedical Informatics 43 (2010) 31–40

4.        Julian Sedding, ―WordNet-based Text Document Clustering‖, Department of Computer Science, University of York Heslington, York YO10 5DD, United Kingdom

5.        Michael Steinbach, George Karypis and Vipin Kumar(2001), ―A Comparison of Document Clustering Techniques‖, Department of Computer Science and Egineering,University of Minnesota, Technical Report 00-034

6.        Rekha Baghel and Dr. Renu Dhir (2010), ―A Frequent Concepts Based Document Clustering Algorithm‖, International journal of Computer Applications (0975-8887),Volume 4-No.5,July 2010.

7.        S C Punitha, K Mugunthadevi and M Punithavalli (2011), ―Impact of Ontology based Approach on Document Clustering‖ International Journal of Computer Applications 22(2):22–26, May 2011. Published by Foundation of Computer Science.

8.        Samah Fodeh • Bill Punch • Pang-Ning Tan (2011), ―On ontology-driven document clustering using core semantic features‖, Received: 10 December 2009 / Revised: 6 September 2010 / Accepted: 26 November 2010, Springer-Verlag London Limited 2011

9.        Fellbaum, Christiane (2005), ―WordNet and wordnets‖, In Brown, Keith et al. (eds.), Encyclopedia of Language and Linguistics,

10.     Chihli Hung (2004), ―Neural Network Based Document Clustering Using WordNet Ontologies‖, Journal International Journal of Hybrid Intelligent Systems Volume 1 Issue 3,4, December 2004

11.     Brian S. Everitt, Sabine Landau, and Morven Leese. Cluster Analysis. Oxford University Press, fourth edition, 2001.

12.     Sam Scott, Stan Matwin(1997), ―Text Classification Using WordNet Hypernyms‖, Computer Science Dept., University of

13.     DataMining,Wikipedia, http://en.wikipedia.org/wiki/Data_mining‖.

14.     DocumentClustering,Wikipedia, http://en.wikipedia.org/wiki/Document_clustering‖.

15.     Document-termmatrix,Wikipedia, http://en.wikipedia.org/wiki/Document-term_matrix”

16.     WordSenseDisambiguation,Wikipedia, http://en.wikipedia.org/wiki/Word-ense_disambiguation.

17.     WordNet, http://wordnet.princeton.edu/.





Madhusudan Ghosh, Tanmoy Banerjee, Bishnucharan Sarkar

Paper Title:

Nonlinear Dynamics and Chaos in Second Order ZC1- DPLLs with Inherent Time Delay

Abstract:    The present paper examines the dynamics of a delayed second order zero crossing digital phase locked loop (DSZC1-DPLL). Some inherent time delay is inevitable in the loop response due to the non-ideal behaviour of loop digital filter and other constituent blocks. The possibility of chaos and bifurcation in the system has been investigated analytically and numerically. Since the order of the second order loop increases due to loop time delay, the stability limit of the loop will be decreased. Further the inherent time delay in the loop results in period doubling route to chaos. The stability and nonlinear dynamical behaviour of the delayed system has been investigated through standard technique of stability analysis. Chaotic dynamics of the system has been quantified with the help of nonlinear dynamical measures like bifurcation diagram, Lyapunov exponent, Correlation dimension, Kolmogorov entropy etc.

   ZC1-DPLL, Loop time delay, Stability Zone, Bifurcation Diagram, Layapunov Exponent, Correlation dimension, Kolmogorov entropy.


1.       W. Lindsay and C. M. Chie, "A survey of digital phase locked loops", Proc. IEEE, vol. 69, no. 4, pp. 410-431, 1981.
2.       A. Weinberg, B. Liu. "Discrete time analysis of nonuniform sampling first- and - second order digital phase locked loops", IEEE Trans. Commun., COM-22, Feb. 1974, pp. 123-137.

3.       M. Ghosh, T. Banerjee and B. C. Sarkar, “Design limitations and its effect in the performance of ZC1-DPLL”, ACEEE, International Journal on Communication, Vol: 3, Issue: 1, pp: 48-52, 2012.

4.       D. Simon and H. El-Sherief. "Lyapunov stability analyses of digital phase-locked loops", IEEE Conference on Systems, Man and Cybernetics, San Antonio, TX, October 1994, pp. 2827-2829.

5.       D. Simon and H. El-Sherief. "Lyapunov stability analyses of digital phase-locked loops", IEEE Conference on Systems, Man and Cybernetics, San Antonio, TX, October 1994, pp. 2827-2829.

6.       R.C. Hilborn, "Chaos and Nonlinear Dynamics: An Introduction for Scientists and Engineers", second ed, Oxford University press, Oxford, 2000
7.       A. Wolf, J.B. Swift, H.L. Swinnnney, J.A. Vastano, "Determining Lyapunov exponent from a time series", Physica 16D (1985), 285-317.

8.       P. Grassberger and I. Procaccia. "Measuring the strangeness of strange attractors", Physica 9D, 1983, pp. 189-208.

9.       P. Grassberger and I. Procaccia. "Estimation of the Kolmogorov entropy from a chaotic signal", Phys Rev A, vol. 28, 1983, pp. 2591-2593.

10.     H.C. Osborne. "Stability analysis of an N-th power digital phase- locked loop - Part II: Second and third order DPLL's", IEEE Trans. Commun. COM-28, no. 8, August 1980, pp. 1355-1364.

11.     B. C. Kuo, “Analysis and Synthesis of Sampled-Data Control Systems”, Englewood Cliffs, NJ: Prentice-Hall, 1963, chs. 6, I I.





Daljit Singh, Kamaljeet Kaur

Paper Title:

Classification of Abnormalities in Brain MRI Images Using GLCM, PCA and SVM

Abstract:    Accurate automatic detection and classification of images is very challenging task whether they are medical images or other natural images. This paper presents a hybrid technique for automatic classification of MRI images as well as natural images. The proposed method consists of two stages: feature extraction and classification. In first stage, features are extracted from images using PCA and GLCM. In the next stage, extracted features are fed as input to SVM classifier. It classifies the images between normal and abnormal along with type of disease depending upon features. Also it classifies between natural images. For Brain MRI images; features extracted with GLCM gives 100% accuracy with SVM -RBF kernel function. Similarly for natural images; features extracted by GLCM gives 91.67% accuracy with SVM-RBF kernel function. Software used is MATLAB R2011a. Main focus is given on Brain MRI images classification as it deals with precious human life.

   Feature, GLCM, Kernel, MRI, PCA, SVM.


1.        EL- Sayed, EL- Dahshan, Abdul- Badeeh M. Salem, Tamer H.Yousin, “A Hybrid Technique for Automatic MRI Brain Images Classification”. Studia Univ. Babes.Bolyai, Volume LIV, Number 1, 2009.
2.        SaharJafarpour, Zahra Sedhgi, Mehdi ChehelAmirani, “A Robust Brain MRI Classification with GLCM Features”, International Journal of Computer Applications (0975-8887) Volume 37- No.12, January 2012.

3.        Jin Huang, Jingjing Lu, Charles X.Ling, “Comparing Naive Bayes, Decision Trees, and SVM with AUC and Accuracy” IEEE International Conference on Data Mining, 2003.

4.        C.Cortes, V.Vapnik, in Machine Learning, PP. 273-297 (1995).

5.        El-Sayed Abdal Wahed, Abrahim Al Emam, Ami Badr, “Feature selection for Cancer Classification: An SVM based approach”, International Journal of Computer applications (0975-8887), Volume 46- No.8, May 2012-07-23.

6.        F. Keyvanfard, M.A. Shoorehdler, M. Teshndab, “Feature Selection and Classification of Breast Cancer on Dynamic Magnetic Resonance Imaging using ANN and SVM” American Journal of Biomedical Engineering: 2011 ;1(1): 20-25.

7.        N.Christiani, J.Shawe-Taylor, “An Introduction to Support Vector Machines; and other kernel-based learning methods. Cambridge university Press, New York, NY, USA (2000).

8.        Noramalina Abdulla uni Kalthum Ngah, Shalihatun Azlin Aziz, “Image classification of Brain MRI using Support Vector Machine”, 978-1-61284-896-9/11/$26.00,2011 IEEE.

9.        S.N. Deepa, B. Aruna Devi, “Second order Sequential Minimal Optimization for Brain tumor classification” , European Journal of scientific research, ISSN 1450-216X Vol. 64 No. 3 (2011), pp. 377-386.

10.     Ahmad Kharbat, Karim Gasmi, Mohamed Ben Messaond, Nacera Benamrane , Mohamed Abid , “A Hybrid Approach for Automatic Classification of Brain MRI using Genetic Algorithm and Support Vector Machine ” , Journal of Leonardo Sciences , Issue 17, July- December 2012, P 71-82, ISSN 1583-0233.





Navneet Sharma, Vijay Singh Rathore

Paper Title:

Role of Biometric Technology over Advanced Security and Protection in Auto Teller Machine Transaction

Abstract:    In modern era, security is one of an important tool of each organization. If we talk about money it gives major importance. In the banking system, it is also a very confidential issue. The major issue in each bank to safeguard the public deposits and to provide better and effective liquidity. For this purpose, the ATM was developed to facilitate cash availabity to the consumers (public) in any time i.e. 24 X 7. The main object of ATM machines to keep safeguard of money and provide availability of cash very fast. But, in present era, there are several security problems arise in ATM’s. The customers are very conscious about their funds and they afraid to use the machines. Over the last few years banking and Auto Teller Machine frauds increasing day by day. For banking financial operation user are now more dependent on ATM outside the bank premises .Mostly bank are providing the single (PIN) password authentication to their customers for ATM transactions but now a day it is not sufficient to protect the information and verify the authentic user. It is so easy for fraudsters to get the PIN and make fake operation on ATM.   To protect these type of frauds bank can use dual user verification system so that banking operations make more safe. To make dual verification system we can use any biometric technology for security. In this paper, different biometric techniques related security topics regarding ATM  has been discussed. An effort has been made to explain these issues in easy language in a layman style so a layman can understand it easily.    in this paper list few biometric technologies which may use for dual authentication and user verification.

   Auto Teller Machine, Biometric, Fingerprint, Iris, PIN, Vein Pattern.


1.       Richard, B.and Alemayehu, M. (2006) Developing E-banking Capabilities in a Ghanaian Bank: Preliminary Lessons. Journal of Internet Banking and Commerce, August 2006, vol. 11, no.2.
2.       Davide Maltoni, Dario Maio, Anil Jain, and Salil Prabhakar. Handbook of Fingerprint Recognition. Springer, 2003.

3.       Stan Z. Li and Anil K. Jain. Handbook of Face Recognition. Springer, 2005.

4.       Anil K. Jain, Yi Chen, and Meltem Demirkus. Pores and ridges: High-resolution fingerprint matching using level 3 features. IEEE Trans. Pattern Anal. Mach. Intell., 29(1):15– 27, 2007.

5.       ISO/IEC 19794-8. Information technology - Biometric data interchange formats – Part 4: Finger pattern skeletal data, 2006.

6.       ISO/IEC 24745. Information Technology- Security Techniques- Biometric Template Protection (Committee Draft), 2009.

7.       John Woodward, Nicholas M. Orlans, and Peter T. Higgins. BioMetrics: Identity Assurance in the Information Age. Broché, 2003.

8.       Use of biometrics to tackle ATM fraud 2010 International Conference on Business and Economics Research vol.1 (2011).





Rakesh Birle, Lalit Bandil

Paper Title:

Design and FPGA Implementation of Systolic Array Architecture for Matrix Multiplication

Abstract: Matrix multiplication is the kernel operation used in many image and signal processing applications. This paper demonstrates an effective design for the Matrix Multiplication using Systolic Architecture. This architecture increases the computing speed by using the concept of parallel processing and pipelining into a single concept. The selected platform is a FPGA (Field Programmable Gate Array) device since, in systolic computing, FPGAs can be used as dedicated computers in order to perform certain computations at very high frequencies. The description language used as an entry tool to model the hardware architecture is VERILOG HDL.

   FPGA implementation, Matrix multiplication, Systolic Arrays, VERILOG HDL.


1.        S. Ogrenci, A. K. Katsaggelos, and M. Sarrafzadeh, “Analysis and FPGA Implementation of Image restoration under resource constraint,” IEEE Trans. on Computers, Vol. 52, No. 3, pp. 390-399, 2003.
2.        C. Ebeling, C. Fisher, G. Xing, M. Shen, and H. Liu, “Implementing an OFDM Receiver on the Rapid Reconfigurable Architecture,” IEEE Trans. on Computers, Vol. 53, No. 11, pp. 1436-1448, 2004.

3.        G. R. Goslin, “A Guide to Using Field Programmable Gate Arrays for Application-Specific Digital Signal Processing Performance,” Microelectronics Journal, Vol. 28, Issue 4, pp. 24-35, 1997.

4.        T. Komarek, P. Pirsch, “Array architectures for block matching algorithms,” IEEE Transactions on Circuits and Systems, Vol. 36, No. 10, October 1989.

5.        Kuani Lee, Algorithm and VLSI architecture design for H.264/AVC Inter Frame Coding, A PhD Thesis at National Cheng Kung University, Tainan, Taiwan, in 2007.

6.        Ganapathi Hegde, Cyril Prasanna Raj P and P.R.Vaya, Implementation of Systolic Array Architecture for Full Search Block Matching Algorithm on FPGA, European Journal of Scientific Research, Vol.33 No.4 (2009), pp.606- 616.

7.        Feifei Dong, Sihan Zhang and Cheng Chen, Improved Design and Analyse of Parallel Matrix Multiplication on Systolic Array Matrix, IEEE, 2009.

8.        Ziad Al-Qadi and and Musbah Aqel, performances Analysis of Parallel Matrix Multiplication Algorithms Used in Image Processing, World Applied Sciences Journal 6 (1): 45-52, 2009.

9.        Mohammad Mahdi Azadfar, Implementation of A Optimized Systolic Array Architecture for FSBMA using FPGA for Real-time Applications, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.3, March 2008.





Sable K.S., Patil Archana A

Paper Title:

Comparision between Optimization and Conventional Catilever Retaining Wall by Using Optimtool in Matlab

Abstract:    Optimization of concrete retaining walls is an important task in geotechnical and structural engineering. However other than stability considerations very often in such design the settlement aspects is neglected. As such, attention to various aspects of geotechnical engineering design needs to be considered. However, consideration of all these aspects makes the design complicated. To economize the cost under such situation needs to vary the dimensions of the wall several times making it very tedious and monotonous. As it is extremely difficult to obtain a design satisfying all the safety requirements, it is necessary to cast the problem as one of the mathematical non linear programming techniques. A program is developed for analysis and designing low-cost or low-weight cantilever reinforced concrete retaining walls with and without base shear key in matlab for optimtool. The optimtool is used to find the minimum cost and weight for concrete retaining walls. Illustrative cases of retaining wall are solved, and their results are presented and discussed by using Interior point method from optimtool. The comparison between the conventional design from known designer and optimum cost and weight values which are observed from optimtool shows effectively by cost and weight minimization model and graph. The optimum design formulation allows for a detailed sensitivity analysis to be made for variation in top thickness of stem, surcharge load and internal angle of friction with different height.

   Optimization, Minimum cost, Interior point method, 


1.        aribaş, A. and Erbatur, F. (1996). “Optimization and Sensitivity of Retaining Structures.” Journal of Geotechnical Engineering, 122(8), 649-656.
2.        Kaveh A. and Abadi A. S. M. (2010). “Harmony Search Based Algorithm for the Optimum Cost Design of Reinforced Concrete Cantilever Retaining Walls.” International Journal of Civil Engineering, 4(8), 336-357.

3.        Charles V. Camp and Alper Akin "Design of retaining walls using big bang-big crunch optimization Optimum Design of Cantilever Retaining Walls"

4.        Sivakumar babu & b. m. basha Title "inverse reliability based design optimization of cantilever retaining walls" Indian institute of science of bangalore, india

5.        M. Asghar Bhatti Title "Retaining Wall Design Optimization with MS Excel Solver" Department of Civil & Environmental Engineering, University of Iowa, Iowa City, IA





Ashish Xavier Das, Charlie Eapen, A. Ashok, Sudhanshu Tripathi, Ridha Mabruk Shadi

Paper Title:

Dynamic Event Based Energy Efficient Routing Protocol For Wireless Sensor Networks (WSNs)

Abstract:    Wireless sensor networks (WSNs) are being increasingly deployed for various applications such as object tracking and monitoring, precision agriculture, controlling nuclear reactors, detecting seismic activities, security and surveillance, navigational activities, industrial automation, and so on. The main purpose of such networks is to gather information from the environments and deliver the same to the applications. The smartness in functioning of smart environments rely primarily on gathering sensory data through WSNs. The sensor nodes are typically resource deficient with energy being the most critical of all the resources. The nodes in a WSN are connected typically to a powerful controlling node called the base station.

   Wireless Sensor Network (WSN), EBEERP, LEACH, PEGASIS, Data Gathering Decimation (DGD), Cluster-Head (CH).


1.        F. Akylidiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, ―A Survey on Sensor Networks,‖ IEEE Communication Magazine, pp. 102-114, Aug 2002.
2.        D. Estrin, R Govindan, J. Heidemann, and Satish Kumar. Next Century Challenges: Scalable Coordination in Sensor Networks. In Proceedings of Mobicom ' 99, 1999.

3.        J. Yick, B. Mukherjee, and D. Ghosal. Wireless sensor network survey. Computer Networks, 52(12), 2008.

4.        A.A. Abbasi and M. Younis, A survey on clustering algorithms for wireless sensor networks, Elsevier Computer Communications 30 (14-15) (2007), pp. 2826–2841.

5.        W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, ―Energy efficient communication protocols for wireless microsensor networks,‖Proceedings of the 33rd International Conference on System Sciences, January 2000.

6.        Babu ram, N.Chand, Prateek Gupta, S. Chauhan, ―A New Approach Layered Architecture based Clustering for Prolong Life of WSN‖ International Journal of Computer Applications (0975-8887) Volume 15-No. 1, Feburary 2011.

7.        Khattak, A.U.; Shah, G.A.; Ahsan, M.; Two-Tier Cluster Based Routing Protocol for Wireless Sensor Networks, Embedded and Ubiquitous Computing (EUC), 2010 IEEE/IFIP 8th International Conference on Digital Object Identifier: 10.1109/EUC.2010.68 Publication Year: 2010 , Page(s): 410 – 415

8.        W.Heinzelman, A. Chandrakasan, and H. Balakrishnan, ―An application-specific protocol architecture for wireless microsensor .networks, ―IEEE Transactions on Wireless Communication, vol. 1, No. 4, pp. 660-670, October 2002.

9.        Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed Diffusion: A scalable and roubst communication paradigm for sensor networks. In Proceedings of the Eighth ACM International Conference on Mobile Computing and Networking (MobiCom 2002)(pp. 56–67), Sep 23–28, 2002, Georgia, USA.

10.     O. Younis, S. Fahmy, ―Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach,‖ in Proc. of IEEE INFOCOM, vol. 1, pp. 629-640, Mar. 2004.

11.     Kulkarni, S.; Iyer, A.; Rosenberg, C.; An address-light, integrated MAC and routing protocol for wireless sensor networks, Networking, IEEE/ACM Transactions on Volume: 14, Issue: 4, Digital Object Identifier: 10.1109/TNET.2006.880163, Publication Year: 2006 , Page(s): 793 – 806.

12.     Lindsey, S., & Raghavendra, C. (2002). PEGASIS: Power-efficient gathering in sensor information systems. In Proceedings of IEEE Aerospace Conference, Vol. 3 (pp. 1125–1130), March 2002.

13.     Agrawal, D. P., & Zeng, Q. A. (2006). Introduction to wireless and mobile systems (2nd ed.). UK: Thomson.

14.     Al-Karaki, J. N., Ul-Mustafa, R., & Kamal A. E. (2004). Data aggregation in wireless sensor networks—Exact and approximate algorithms. In Proceedings of IEEE HPSR’04, Aug 2004.

15.     Alazzawi, L. K., Elkateeb, A. M., & Ramesh, A. (2008). Scalability analysis for wireless sensor networks routing protocols. In Proceedings of IEEE AINAW’08, Apr. 2008.





M.Seetha, Y.J.Sudha Rani

Paper Title:

A Comprehensive study on threat classification and security service in P2P

Abstract:    Peer-to-Peer overlay network provide various services for the feature of storing, discovering and locating resources efficiently. P2P platform raise more security-related challenges while providing more services. WhenP2P security mainly focusing on the security problems on Overlay, this paper first shows the how to we classify threat. and how to we provide the security mechanisms to that network. This paper also discuss about the various security services.

   peer peer, threat classification, security services, overlay, underlay


1.       B. Wu,et al. “A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks”, In Wireless/Mobile Network Security. Y. Xiao, X. Shen and D-Z. Du (eds), Springer, 2008.
2.       B. Kannhavong et al. “A survey of routing attacks in mobile ad hoc networks,”  in IEEE Wireless Communications Magazine, Vol 14, No. 5, pp 85-91, Oct. 2007.
3.       J.L. Burbank et al, “Key Challenges of Military Tactical Networking and the Elusive Promise of MANET Technology”, IEEE Communications Magazine, Vol 44, No. 11, 2006, pp. 39-45.

4.       S. Jacobs, “Tactical Network Security”, proceedings of IEEE Military Communications Conference, vol. 1, pp. 651-655, Nov. 1999.

5.       Marling Engle & Javed I. Khan,Vulnerabilities of P2P Systems anda Critical Look at their Solutions, Technical Report 2006-11 Internetworking and Media Communications Research Laboratories, Department of Computer Science, Kent State University,http://medianet.kent.edu/technicalreports.html

6.       Ravi Sandhu and Xinwen Zhang. Peer- to-Peer Access Control Architecture Using Trusted Computing Technology. SACMAT’ 05,June 1–3, 2005

7.       B.Crispo, S. Sivasubramanian, P.Mazzoleni, E.Bertino, “P-Hera:Scalable fine-grained access control for P2Pinfrastructures,”Proceedings of the 2005 11th International Conference on Parallel and Distributed Systems (ICPADS'05)





P.C.Chenna Reddy, R. Siva Sankara Reddy

Paper Title:

K- Means Algorithm with Different Measurements in Clustering Approach

Abstract:    Clustering techniques have been used by many intelligent software agents in order tretrieve, filter and categorize document available on the World Wide Web .Clustering isalso useful in extracting salient features of related web documents to automatic ally formulate queries and search for other similar documents on the Web. In this paper, we introduce two new clustering algorithm withs  K-Means Clustering in GeneLinker™  that can effectively cluster documents, even in the presence of a veryhighdimensional feature space.These clusteringtechniques, which are based on generalizations of graphpartitioning, do not require prespecifiedad hoc distance functions, and are capable of automatically discovering document similarities or associations. We conduct several experiment son real Web data using various feature selection and find out the no off clusters in the data documenting this paper also discuss about the real example. In this example we are find out the no.Of clusters.

   clustering, categorization, World Wide Web documents, K-means alogrithmg, Genelinker TM


1.        Agrawal, H. Mannila, R. Srikant, H.Toivonen,and A.I.Verkamo Fast discovery of association rules.In U.M. Fayyad, G.Piatetsk.Shapiro, P.Smith, and R. Uthurusamy,editors,Advances in Knowledge Discovery and Data Mining. pages 307-328.1996.
2.        Mark Achreman and ETet al. Learningprobalistic user profiles.AI Magazine.18 (2):47-56,1997.

3.        D.L. Boley. Principal Direction Divisive Partitioning. Technical Report TR, Department of Computer Science. University of Minnesota.Minneapolis.1998

4.        Andrei Z.Broder, Steven C, Glassman,and Mark S. Manasse..Syntactic clustering of the Web. In Proc of the International World WideWeb Conference. April.1983

5.        J.Moore,E.han,D.Boley,M.Gini,R.Gross,K.Hastings,V.Kumar.Web apge categorization and feature selection usiong association rule and prinicipai component clustering. In & thwork shop on Information Technologies and Systems.Dec 1997.





Nanda Kumar Easwaramoorthy, R. Dhanasekaran

Paper Title:

Optimal Solution Of 14 Bus System Using MATLAB Simulation Incorporating With FACTS Devices

Abstract:    This research work presents a new approach for optimal location of FACTS controllers in a multi machine power system using MATLAB coding. Using the proposed method, the location of FACTS controller, their type and rated values are optimized simultaneously. Among the various FACTS controllers, Thyristor Controlled Series Compensator (TCSC) and Unified power Flow Controller (UPFC) are considered. Optimal Power Flow (OPF) is one of the most important processes in power system, which improves the system performance by satisfying certain constraints. Generally, different optimization methods are used in the literature to solve the OPF problem. In some research works, the optimization process is done by considering total fuel cost or by considering the environmental pollution that occurs during power generation. But in some other research works, FACTS controllers are used to improve the power flow without considering the power generation cost. The OPF problem is one of the most extensively studied topics in the power system community. In power system operation, OPF is an extended problem of economic dispatch (ED) which consider several parameters such as generator voltage, transformer tap change, SVC, and include constraints such as transmission line and transformer loading limits, bus voltage limit, and stability margin limit . The main function of OPF is to select the optimal operation state of a power system, in the time of meeting some particular constraints. OPF study plays a key role in the Energy Management System (EMS), where the entire operation of the system is regulated in each possible real time intervals.

   OPF, EP, TS, SA, ITS, IEP, TCVR, FACTS controller, SVC, UPFC


1.        MithunBhaskar M, SrinivasMuthyala and SyduluMaheswarapu, "Security Constraint Optimal Power Flow (SCOPF) – A Comprehensive Survey", International Journal of Computer Applications, Vol. 11, No.6, pp. 42-52, Dec 2010.
2.        K. Mani Chandy, Steven H. Low, UfukTopcu and HuanXu, "A Simple Optimal Power Flow Model with Energy Storage", In Proceedings of IEEE Conference on Decision and Control, Atlanta, pp. 1051-1057, Dec 2010.

3.        Brahim Gasboui and Boume diene Allaoua, "Ant Colony  Optimization Applied on Combinatorial Problem for Optimal       Power Flow Solution", Leonardo Journal of Sciences, Issue. 14, pp. 1-17, June 2009.

4.        Hongye Wang, Carlos E. Murillo-Sanchez, Ray D. Zimmerman  and Robert J. Thomas, "On Computational Issues of Market-Based Optimal Power Flow", IEEE Transactions on Power Systems, Vol. 22, No. 3, pp. 1185-1193, Aug 2007.

5.        Zwe-Lee Gaing;   Rung-Fang Chang, "Security-constrained optimal power flow by mixed-integer genetic algorithm with arithmetic operators", In Proceedings of IEEE Power Engineering Society General Meeting, pp. 1-8, Montreal, 2006.

6.        N. G. Hingorani and L. Gyugyi, Understanding FACTS concepts and technology of flexible AC transmission systems. New York: IEEE Press, 2000.

7.        R. M. Mathur and R. K. Varma, Thyristor-based FACTS controllers for electrical transmission systems. Piscataway: IEEE Press, 2002.

8.        Y.-H. Song, Flexible ac transmission systems (FACTS). London: The Institution of Electrical Engineers, 1999.

9.        P. Moore and P. Ashmole, "Flexible AC transmission systems. III. Conventional FACTS controllers," Power Engineering Journal, vol. 11, pp. 177-183, 1997.

10.     J. Carpentier and A. Merlin, "Optimization methods in planning and operation," International Journal of Electrical Power and Energy Systems, vol. 4, pp. 11-18, 1982.

11.     M. Noroozian, L. Ängquist, M. Ghandhari, and G. Andersson, "Improving power system dynamics by series-connected FACTS devices," Power Delivery, IEEE Transactions on, vol. 12, pp. 1635-1641, 1997.

12.     H. Ambriz-Perez, E. Acha, and C. R. Fuerte-Esquivel, "Advanced SVC models for Newton-Raphson load flow and Newton optimal power flow studies," Power Systems, IEEE Transactions on, vol. 15, pp. 129-136, 2000.

13.     T. Orfanogianni, "A flexible software environment for steady-state power flow optimization with series FACTS devices." Diss. ETH Zurich, 2000, pp. 135 S.

14.     TarekBouktir and Linda Slimani, "Optimal Power Flow of the Algerian Electrical Network using an Ant Colony Optimization Method", Leonardo Journal of Sciences, Issue. 7, pp. 43-57,  Dec 2005.

15.     TarekBouktir and Linda Slimani, "A Genetic Algorithm for Solving the Optimal Power Flow Problem", Leonardo Journal  of Sciences, Issue. 4, pp. 44-58, June 2004.

16.     Mithun M. Bhaskar, SrinivasMuthyala MaheswarapuSydulu, "A Novel Progressively Swarmed Mixed Integer Genetic Algorithm for Security Constrained Optimal Power Flow (SCOPF)", International Journal of Engineering, Science and Technology, Vol. 2, No. 11, pp. 34-40, 2010.

17.     KeeratiChayakulkheeree and WeerakornOngsakul, "Optimal Power Flow Considering Non-Linear Fuzzy Network and Generator Ramprate Constrained", International Energy Journal, Vol. 8, pp.131-138, 2007.

18.     C. Thitithamrongchai and B. Eua-Arporn, "Self-adaptive  Differential Evolution Based Optimal Power Flow for Units  with Non-smooth Fuel Cost Functions", Journal of Electrical Systems, Vol. 3, No. 2, pp. 88-99, 2007.

19.     P. K.Roy, S. P. Ghoshal and S.S. Thakur, "Biogeography Based Optimization Approach for Optimal Power Flow Problem Considering Valve Loading Effects", International J.  of Recent Trends in Engineering and Technology, Vol. 3, No.  3, pp. 177-181, May 2010.

20.     S. Jaganathan, S. Palanisamy K. Senthilkumaravel and B. Rajesh, "Application of Multi-Objective Technique to  Incorporate UPFC in Optimal Power Flow using Modified Bacterial Foraging Technique", International Journal of  Computer Applications, Vol.13, No.2, pp. 18-24, Jan 2011.

21.     K. S. Swarup, "Swarm intelligence approach to the solution of optimal power flow", J. Indian Inst. Sci., Vol.86, pp.  439–455, Oct 2006.

22.     Mithun M. Bhaskar and SyduluMaheswarapu, "A Hybrid Genetic Algorithm Approach for Optimal Power Flow", TELKOMNIKA, Vol. 9, No. 1, pp. 209-214, April 2011.

23.     KeeratiChayakulkheeree and WeerakornOngsakul, "Multi-Objective Optimal Power Flow Considering System Emissions and Fuzzy Constraints", GMSARN International  Journal Vol. 1, pp. 1 - 6, 2008.





P.Muralidhar, A.Vishnupriya, C.B.RamaRao

Paper Title:

Complexity Reduction of Fast Block Matching Algorithm

Abstract:    This paper presents a new block matching motion estimation algorithm using the macro block features to reduce the computational complexity of motion estimation in video encode applications. Motion estimation block is the computationally intensive block in video encoders. To reduce computational cost various motion estimation algorithms have been proposed. Global Elimination is an algorithm based on pixel averaging to reduce the complexity of motion search while keeping performance close to that of full search. Here adaptive version of Global elimination is proposed that uses macro block features like variance and Hadamard transform to further reduce the computational complexity of  motion estimation. Performance achieved is close to the full search method and global elimination. Operational complexity is reduced compared to global elimination method.

   Block Matching Motion Estimation Algorithm, Global Elimination, Matching complexity reduction, Feature based partitioning.


1.        Li, W.; Salari, E., "Successive elimination algorithm for motion estimation," Image processing, IEEE Transactions on , vol.4, no.1, pp.105-107, (Jan 1995) 
2.        Jong-Nam Kim; Tae-Sun Choi, "A fast three-step search algorithm with minimum checking points using unimodal error surface assumption", Consumer Electronics, IEEE Transactions on , vol.44, no.3, pp.638-648, (Aug 1998)

3.        Lai-Man Po; Wing-Chung Ma, "A novel four-step search algorithm for fast block motion estimation ," Circuits and Systems for Video Technology, IEEE Transactions on ,vol.6, no.3, pp.313-317, (Jun 1996)

4.        Y.L.Chan, W.C.Siu, “New Adaptive Pixel Decimation for Block Motion Vector Estimation”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 6, No. 1, pp.113-118, (Feb 1996)

5.        Yu-Wen Huang; Shao-Yi Chien; Bing-Yu Hsieh; Liang-Gee Chen, "Global elimination algorithm and architecture design for fast block matching motion estimation," Circuits and Systems for Video Technology, IEEE Transactions on , vol.14, no.6, pp. 898-907, (June 2004)

6.        C.Z., Xiao Lin, Lap-PuiChau, “Hexagon-Based Search Pattern for Fast Block Motion Estimation”, IEEE Transactions On Circuits And Systems For Video Technology, Vol. 12, No. 5, pp349-355 (May 2002)

7.        X. Q. Gao, C. J. Duanmu, and C. R. Zou, “A Multilevel Successive Elimination Algorithm for Block Matching Motion Estimation”, IEEE Transactions On Image Processing, Vol. 9, No. 3, pp.501-504, (March 2000)





Arun Kumar Shukla, Sudhanshu Tripathi, Charlie Eapen, A. Ashok

Paper Title:

Ambient Data Collection with Modeling and Implementation of QoS in Wireless Sensor Networks

Abstract:    One of the most important applications for wireless sensor networks (WSNs) is Data Collection, where sensing data are collected at sensor nodes and forwarded to a central base station for further processing. Since using battery powers and wireless communications, sensor nodes can be very small and easily attached at specified locations without disturbing surrounding environments. This makes WSN a competitive approach for data collection comparing with its wired counterpart. With these features in mind, we then discuss issues and prior solutions on the data gathering protocol design. Our discussion also covers different approaches for message dissemination and problem of Quality of Service (QoS) provisioning to assess the relevance of using multipath routing to improve the reliability and packet delivery in wireless sensor networks while maintaining lower power consumption levels, which is a critical component for network control and management and greatly affects the overall performance of a data collection WSN system.

   Wireless Sensor Network (WSN), Quality of Service(QoS), Dynamic Source Routing (DSR), Ad hoc On-demand Distance Vector (AODV), ECMP.


1.       L. Selavo, A. Wood, Q. Cao, et al., “LUSTER: wireless sensor network for environmental research,” in  roceedings of the 4th International Conference on Embedded  Networked Sensor Systems (SenSys ’07), ACM, 2007.
2.       G.WernerAllen, K. Lorincz, J. Johnson, J. Lees, and M.Welsh, “Fidelity and yield in a volcano monitoring sensor network,” in Proceedings of the 7th symposium on Operating Systems Design and Implementation (OSDI ’06), USENIX, 2006.

3.       S. Kim, S. Pakzad, D. Culler et al., “Health monitoring of civil infrastructures using wireless sensor networks,” in Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN ’07), pp. 254–263, ACM/IEEE, April 2007.

4.       C. Hartung, R. Han, C. Seielstad, and S. Holbrook, “FireWxNet: a multi-tiered portable wireless system for monitoring weather conditions in wildland fire environments,” in Proceedings of the 4th International Conference on Mobile Systems, Applications and Services (MobiSys ’06), vol. 2006, pp. 28–41, ACM, 2006

5.       H. Zhang and J. C. Hou, “Is deterministic deployment worse than random deployment for wireless sensor networks?” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM ’06), April 2006.

6.       Y. Gu, J. Hwang, T. He, and D. H.-C. Du, “μSense: a unified asymmetric sensing coverage architecture for wireless sensor networks,” in Proceedings of the International Conference on Distributed Computing Systems (ICDCS ’07), IEEE, 2007.

7.       X. Huang and Y. Fang, “Multiconstrained QoS multipath routing in wireless sensor networks,” ACM Wireless Networks, vol. 14, no. 4, pp. 465–478, 2008.

8.       A. B. Bagula and K. G. Mazandu, “Energy constrained

a.       multipath routing in wireless sensor networks,” in Proceedings of the 5th International Conference on Ubiquitous Intelligence and Computing (UIC ’08), vol. 5061 of Lecture Notes in Computer Science, pp. 453–467, Oslo, Norway, June 2008.

9.       O. D. Incel, Multi-channel wireless sensor networks: protocols, design and evaluation, Ph.D. thesis, Pervasive Systems Research Group, Faculty of Electrical Engineering, Mathematics and Informatics, University of Twente, Twente, The Netherlands, March 2009.

10.     N. Burri, P. Von Rickenbach, and R. Wattenhofer, “Dozer: ultra-low power data gathering in sensor networks,” in Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN ’07), pp. 450–459, ACM/IEEE, April 2007.

11.     F. Wang, D. Wang, and J. Liu, “EleSense: high-rise structure monitoring with wireless sensor networks,” Tech. Rep., Simon Fraser University, 2010.





G. Suresh, T.V. Sreerama Reddy

Paper Title:

Analysis of Spasm and Periodic Leg Movement in Spinal Cord Injury

Abstract:   Spinal Cord Injury (SCI) is an injury to the spinal cord that results in paralysis and loss of sensation. Successful recovery depends upon how well these chronic conditions are handled day to day. SCI people have very often periodic leg movement and severe spasm.  Both are serious problems in the SCI population which is not always managed effectively.  This is likely due to the fact that the syndrome can have various presentations, each with their own specific etiology. Hence this paper presents the overview of analysis of spasm and periodic leg movement in spinal cord injured persons using electro-myogram signals. There is a need for better understanding the syndrome of periodic leg movement and spasticity in SCI persons. So, the main purpose of this paper is to provide an integrated source of information that reflects the most useful knowledge about the main problems of SCI like periodic leg movement and severe spasm from different perspectives.

   Spinal cord injury, Periodic leg movement, Spasticity, Electromyogram


1.        Amir Hassan Kohan. 2010. “Comparison of Modified Ashworth Scale and Hoffmann Reflex in Study of Spasticity.” Acta Medica Iranica, Vol.48, No.3: 154-157.
2.        Arthur M.Sherwood et.al. 2000. “Altered motor control and spasticity after spinal cord injury: Subjective and objective assessment.” Journal of Rehabilitation Research and Development. 37:41-52.

3.        Andrea Maculano Esteves et.al. 2004. “Occurrence of limb movement during sleep in rats with spinal cord injury.” Brain Research. 1017:32-38.

4.        Bridger RS. 1991. Some fundamental aspects of posture related to ergonomics. International Journal of Indian Ergonomics. 8:3-15.

5.        Bishu RR, Hallbeck MS, Riley MW, Sentz TL. 1991. “Seating comfort and its relation to spinal profile: A pilot study.”  Int J Ind Ergon. 8:89-101.

6.        Blair Calancie et.al. 2004. “Tendon reflexes for predicting movement recovery after acute spinal cord injury in humans.” Clinical Neurophysiology. 115:2350-2363.

7.        Blair Calancie et.al. 2004. “EMG for assessing the recovery of voluntary movement after acute spinal cord injury in man.” Clinical Neurophysiology. 115:1748-1759.

8.        Blair Calancie et.al. 1994. “Involuntary stepping after chronic spinal cord injury.” Brain. 117:1143-1159.

9.        Blair Calancie. 2006. “Spinal Myoclonus after spinal cord injury”. Journal of spinal cord Med. 29: 413-424.

10.     Chetan P. Phadke et.al. 2010. “Soleus H-reflex modulation after motor incomplete spinal cord injury: effects of body position and walking speed”.  Journal of spinal cord Med. 33(4):371-378.

11.     Camilla Skold. Et.al. 2002. “Movement-provoked muscle torque and EMG activity in long standing motor complete spinal cord injured individuals.” J Rehabil Med. 34:86-90.

12.     Dietz V, Colombo G, Jensen L, Baumgartner L.1995.” Locomotor capacity of spinal cord in paraplegic patients.” Ann Neurol. 37: 574–82.

13.     D.T. Davy and M.L. Audu. 1987. “A dynamic optimization technique for predicting muscle forces in the swing phase of gait.”  Journal of biomechanics. 20:187-201.

14.     Eduardo Mendonca Scheeren.  et.al. 2011. “Wrist Movement Characterization by Mechanography Technique.” Journal of Medical and Biological Engineering. 30(6):373-380.

15.     Eforestal JR, Mathieu PA and Malanda A. 2006. “Automated decomposition of intramuscular electromyographic signals.” IEEE transactions of biomedical engineering 53:832-839.

16.     FM Reis et.al. 2011. “Plasma iron levels appraised 15 days after spinal cord injury in a limb movement animal model.” 49:361-364.

17.     HK Lim. Et.al. 2005. “Neuro physiological assessment of lower-limb voluntary control in incomplete spinal cord injury.” Spinal Cord.43:282-290.

18.     Huijing. P.A. 1999. “Muscle as a collagen fiber reinforced composite: a review of force transmission in muscle and whole limb.” Journal of Biomechanics. 32:329-345.

19.     James Xie et.al.2008. “Electrophysiological outcomes after spinal cord injury.”  Neurosurg Focus.25:1-5.

20.     Jeffery Winslow. 2008. “Automatic Classification of Long Term Involuntary Spontaneous EMG.” PhD thesis, Dept. of Biomedical Engineering. University of Miami.

21.     Lenny Lucas et.al. 2004. “An EMG-controlled hand exoskeleton for natural pinching”. Journal of Robotics and Mechatronics.  16.

22.     L.P. Jamieson. 2007. “Development and assessment of novel methods of exercise testing during treadmill gait in incomplete spinal cord injury.” PhD Thesis, Dept. of Mechanical engineering, Glasgow University.

23.     Maynard FM Jr, Bracken MB, Creasey G, Ditunno JF Jr, Donovan WH, Ducker TB, et al. 1997. International standards for Neurological and Functional Classification of Spinal Cord Injury. Spinal Cord. 35: 266–74.

24.     MM Adams and AL Hicks. 2005. “Spasticity after Spinal Cord Injury [Review].” Spinal cord. 43:577-586.

25.     MT De Mello et al. 2002. “Reduction of periodic leg movement in individuals with paraplegia following aerobic physical exercise.” Spinal cord. 40:646-649.

26.     MT De Mello et.al. 2004. “Comparision between dopaminergic agents and physical exercise as treatment for periodic limb movements in patients with spinal cord injury.” Spinal Cord. 42:218-221.

27.     MT De Mello et.al. 1999. “Treatment of periodic leg movements with a dopaminergic agonist in subjects with total spinal cord lesions.” Spinal Cord. 37:634-637.

28.     MT De Mello et al. 1996. “Incidence of periodic leg Movements and of the restless legs syndrome during sleep following acute physical activity in spinal cord injury subjects”. Spincal Cord. 34: 254-296.

29.     Marcin Czyz et.al. 2008. “The biomechanical analysis of the traumatic cervical spinal cord injury using Finite Element approach.” Acta of Bioengineering and Biomechanics. 10:43-54.

30.     NB Reese, et.al. 2006. “Restoration of frequency-dependent of the H-reflex by passive exercise in spinal rats.” Spinal Cord. 44:28-34.

31.     Pope MH, Goh KL, Magnuson M. 2002. “Spine ergonomics”. Annu Rev Biomed Eng. 4:49-68.





Ranjan Sarukkalige

Paper Title:

Management of Storm Water Quality in Urban Areas

Abstract:    The main aim of this paper is to highlight the importance of the management of storm water quality in enhancing their activities to improve regional water quality. The procedure on developing storm water management strategies consists of reviewing existing water quality data, identifying water quality issues and developing a decision making tool for the officers, managers and decision makers. It was found that land use activities are the main factor affecting the water quality. Therefore, activities, sources and pollutants related to different land use types including residential, industrial, agricultural and commercial are given high importance during the study. Different management groups and authorities were analyzed in order to understand the associated management framework and issues. The issues identified were used in preparing the decision making tool. Variables associated with the defined “value versus threat” decision making tool are obtained from the intensive literature review. The main recommendations provided for improvement of water quality, include non-structural, structural and management controls.

   Storm water, water quality management, pollutants, land use.


1.       R. Aryal, S. Vigneswaran, J. Kandasamy, R. Naidu, Urban stormwater quality and treatment. Korean Journal of Chemical Engineering, 2010, 27(5), pp1343-1359.
2.       A. Goonetilleke, E. Thomas, S. Ginn, D. Gilbert, Understanding the role of land use in urban stormwate quality management. Journal of Environmental Management, 2005, 74(1), pp31-42.

3.       R.T. Bennerman, D.W. Pwens, R.B. Dodds, N.J. Hornewer. Sources of Pollutants in Wisconsin Stormwater. Water Science and Technology. 1993.

4.       L. A. Corson, Development of Strategy for Preparing an Indot Stormwater Quality Management Plan. 2004.

5.       J.K. Gilbert,.J.C. Clausen., Stormwater Runoff Quality and Quantity from Ashphalt, Paver and Crushed Stone Driveways in Connecticut. Water Research; 2006, 40(4) pp.826-832.

6.       K. Alsharif.  Construction and Stormwater Pollution: Policy, Violations, and Penalties. Land Use Policy, 2010,  27(2). pp. 612-616.

7.       M.E. Barrett, P.M. Walsh, J.F. Malina, R.J. Charbeneau, Performance of vegetative controls for treating highway runoff. Journal of Environmental Engineering, 1998, 124(11), pp1121-1128.
8.       H. Ha, M.K. Stenstrom,. Identification of land use with water quality data in stormwater using a neural network. Water Research, 2003, 37(17) pp4222-4230.
9.       Swan River Trust. Local Water Quality Improvement Plans -Southern River Catchment. City of Armadale. 2009.

10.     D.K. Makepeace, D.W. Smith, S.J. Stanley, Urban storm water quality: Summary of contaminant data. Critical Reviews in Environmental Science and Technology 1995, 25(2), pp93-139.





Manisha Bajpai

Paper Title:

Effectiveness of Developing Concepts in Photo Electric Effect Through Virtual Lab Experiment

Abstract: The ultimate goal of the authors is to examine the effectiveness of virtual labs as an instructional tool; and initial purpose here is to glean student perceptions of the tool from an evaluative perspective. In this way the purpose of this study was to investigate the effect of Virtual Lab Experimentation (VLE) on students’ conceptual understanding of photo electric effect. To achieve this, a pre–post comparison study design was used that involved 50 undergraduate students. Two groups were set up for this study. Participants in the control group used RLE to learn photo electric effect, whereas, participants in the experimental group used VLE. Achievement test was given to the groups before and after the application as pre-test and post test. The independent samples t- test, were used for testing the data obtained from the study. According to the results of analyzes, the experimental group was found more successful than the control group. It is hoped that findings from this study will provide useful information for instructional improvement as well as adding to the literature in this area

Computer Based Teaching, Java, Physics Education, Virtual Laboratory.


1.       American Association of Physics Teachers, Goals of the Introductory Physics Laboratory. The Physics Teacher 35, 546-548 (1997). American Journal of Physics 66, 483-485 (1998)
2.       Arduino, P., Macari, E., and Wyatt, T. “Assessment of a VirtualLaboratory for Geotechnical Engineering”, Proceedings 1999 ASEEAnnual Conference and Exposition, Charlotte, North Carolina, Session1620, 1999, (On CD ROM).

3.       Bhandari, A., Shor, M. H. “Access to an Instructional ControlLaboratory Experiment through the World Wide Web”, Proceedings of the17th American Control Conference, ACC’98, Philadelphia, 1998, pp. 1319-1325.

4.       Budhu, M., “Multimedia Geotechnical laboratory tests”, 1999 ASEEAnnual Conference and Exposition, Charlotte, NC, 1999, June 20-23,(OnCD-ROM).

5.       Budhu, M., “A Virtual Triaxial Test Courseware”, ASCE SpecialTechnical Publications 109, Educational Issues in GeotechnicalEngineering, 2000,  pp. 60 – 70.

6.       Budhu, M., “Interactive Multimedia Geotechnical EngineeringCourse", Proceedings, First International Conference on GeotechnicalEngineering Education and Training,A. A. Balkema, Rotterdam, 2000,  pp.329 – 333.

7.       Budhu, M., “Interactive Multimedia Web-based Courseware withVirtual Laboratories”,  Proceedings, Computers and advanced technologyin Education, CATE, May 24 – 27, Cancun, Mexico, 2000, (On CD ROM).

8.       Budhu, M., “Interactive Soil Mechanics and Foundations”, John Wiley& Sons, NY, 2000.

9.       Budhu, M., “Algorithms for Virtual Laboratories”, Simulation, Journalof Society for Computer Simulation International, Vol. 76(4), 2001, pp.222-231.]  Budhu, M.,  “An Interactive Geotechnical Laboratory”, P

10.    Magin, D. J. and Reizes, J. A., Computer simulation of laboratory experiments: An unrealized potential. Computers Educ. 14, 263-270 (1990)

11.    Gillet, D., Salzmann, C., Longchamp, R. and Bonvin, D., A Methodology for Development of Scientific Teachware with Application to Adaptive

12.    Control.<http://iawww2.epfl.ch/papers/acc-93.pdf> (1993) Walkington, J., Pemberton, P. and Eastwell, J., Practical work in engineering: A

13.    challenge for distance education. Distance Education 15, 160-171 (1994) Mosterman, P. J., Dorlandt, M. A. M., Campbell, J. O., Burow, C., Bouw, R.,

14.    Brodersen, A. J. and Bourne, J. R., Virtual engineering laboratories: Design and experiments. Journal of Engineering Education 83, 279-285 (1994)

15.    Aktan, B., Bohus, C., Crowl, L., and Shor, M.H., Distance Learning Applied toControl Engineering Laboratories. <http://www.ece.orst.edu/~aktanb/distancelabs.html> (1996)

16.    Edward, N. S., An Evaluation of Student Perceptions of Screen Presentations in Computer-based Laboratory Simulations. European Journal of Engineering Education 22, 143-152 (1997)

17.    Cramer, P. G. and De Meyer, G., The Philosophy of the Virtual Laboratory. <http://www.vlabs.net/philos/vlart_g.html> (1997)

18.    Campbell. J. O., Asynchronous Laboratory Learning: Research and Field Trials On Simulated Engineering Education Laboratories - Final Report.<http://olinc.vuse.vanderbilt.edu/elseval2.html> (1997)

19.    Henry, J., Implementation of Practical Control Systems: Problems and Solutions. < http://chem.engr.utc.edu/Documents/MACSCITECH/MACSCITECHpaper1.html >(1997)

20.    Harms, U. , A Virtual Laboratory Unit ‚POHL’s Torsion Pendulum‘. Proceedings of the 4. International Conference on Computer Aided Learning and Instruction in Science and Engineering, pp. 479-482. Chalmers University of Technology, Sweden, Goeteborg (1998)

21.    Harms, U. and Kurz, G., Virtual laboratory - an introductory unit ‘POHL’s torsional pendulum’. Proceedings of the Third IEEE International Conference on Multimedia Engineering Education, # 51. City University of Hongkong, China, Hongkong (1998)

22.    Poindexter, S.E. and Heck, B.S., Using the Web in Your Courses: What Can You Do? What should You Do? <http://users.ece.gatech.edu/~bonnie/webuse/ acc98_online.html> (1999)