Conference Proceeding Conference Theme Emerging trends in computer science and its applications in 21st century is posing unprecedented

challenges to information technology in various disciplines. It concentrates on the development in information technology (IT) and its potential in enhancing its capabilities to achieve goals. The use of IT reduces the overall costs of operations in real life, improves the timeliness and quality of operations and creates a better or!ing environment by reducing routine or!. It provides greater opportunities to develop ne products and services. In the area of data collection and processing, faster and fle"ible capture of data through #$%&#'%, computer and&or telephone assisted intervie ing and computer(assisted coding have resulted in remar!able gains. Amritsar City )mritsar is one of the popular cities of *un+ab and is situated in the northern part of India. It is idely visited by the tourists because of its several religious and historical places li!e ,olden Temple, -allian ala .agh, /urgiana $andir, 0agah .order, %am Tirth and other holy places. The city is !no n for its small and medium si1ed industrial units and is a trade centre for many products. It is connected by road, rail and air transport (%a+a 2ansi International )irport). Swami Satyanand College of Management & Technology 2 ami 2atyanand 'ollege of $anagement 3 Technology is located in )mritsar in the area earmar!ed for education. It is an ape" college of management 3 technology in the )mritsar city. The college is affiliated to *un+ab Technical 4niversity, 5apurthala and is being run under the auspices of 2.6 -oshi $emorial Trust. The college has highly qualified, competent 3 committed faculty from industry and academia 3 state(of( the art infrastructure including a spacious building, ell equipped labs 3 latest learning techniques hich help the institution in producing successful professionals 3 entrepreneurs but also morally up righteous, mentally alert, socially responsible and spiritually sublime human beings. 22'$T is recogni1ed as one of the centres of e"cellence in higher education in the state of *un+ab. The status, it has gained over the years is on its ability to anticipate and incorporate emerging technologies and efficient or! practice to ensure that students are trained to meet the highest and latest industry standards. To meet the emerging needs of the industries, the academic program of the college focus on the !no ledge areas concerning business management and entrepreneurship development.7arious educational events are organi1ed in the college campus to !eep the academic culture rich and alive. 2ome of the ma+or events are national conference, inter college qui1 contest, and faculty development programs etc. Therefore, this college is !no n for its professional educational techniques, highest training and placement records and strong industrial interface in the region. Conference Objective Emerging trends of computer applications is a ma+or multidisciplinary conference organi1ed ith the ob+ective of bringing together various researchers, developers, and practitioners from
1

academia and industry or!ing in all areas of computer and communication technology. It is being organi1ed specifically to help computer industry to derive the advances of ne"t generation computer and communication technology. %esearchers are invited to spea!, and present the latest developments and technical solutions in the areas of /igital %ights $anagement 2ystem, 8ard are 3 2oft are /esign, /istributed 3 *arallel *rocessing, 2oft are Engineering, etc. Conference Topics Digital ights Management System! /igital 0atermar!ing #ptical /isc 'opy *rotection "ardware and Software Design! )lgorithms 'omputer )rchitecture %eal and Embedded 2ystems Distrib#ted and Parallel Processing! *arallel and /istributed 'omputing ,rid 'omputing Software $ngineering! )utomated 2oft are Engineering 2oft are Testing 2oft are :uality )ssurance Comp#ter %raphics and M#ltimedia! Image *rocessing Internet and 0eb )pplications Comp#ter comm#nication! 'omputer 6et or!s $obile 'omputing Sec#rity! 6et or! and 2ystem 2ecurity /igital 2ignal *rocessing Artificial &ntelligence! %obotics and )utomation 9u11y ;ogic

2oft are 'rac!ing 9inger *rinting

'ompilers and Interpreters $odeling languages 32imulations

8igh *erformance 'omputing 'loud 'omputing.

0eb .ased 2oft are Engineering 2oft are *ro+ect $anagement 2oft are %eengineering

/ata 'ompression $ultimedia )pplications

/ata 'ommunications 0ireless 'ommunication

'ryptography Intellectual *roperty *rotection

6atural ;anguage *rocessing 6eural 6et or!s and E"pert 2ystems

Database Management System! /istributed /atabase 2ystems /ata 0arehouse M#ltidisciplinary Applications! .ioinformatics .iomedical Engineering $ar!eting Information 2ystem #nline $ar!eting E%* 2ystem 3 Its Emerging Issues #ther $anagement %elated Topics The above such themes are indicative only, researchers other issues related to main themes. Organi'ing Committee! 'hief *atron *atron 'onference 'onvener 'onference 'o('onvener #rgani1ing 2ecretary Committee Members! $s %upinder 5aur $r. *ardeep 5umar $r. -arman+it 2ingh $s. -aideep Inder 5aur $s. 6eelam 7irmani $s. %a+bir 5aur ,ill $s. 2unpreet 5aur $s. 2avita

/ata $ining /ecision Trees

6atural ;anguage *rocessing /igital ;ibrary E( Trading E(%etailing E('ommerce in /igital $ar!eting E%)

ill be free to present their vie s on

'ol. (%etd.) -% 2harma /r. %a!esh -oshi /r. .al ant 2ingh /r. 8.*. ,upta /r.2umesh 2ood

)ssistant *rofessor )ssistant *rofessor )ssistant *rofessor )ssistant *rofessor )ssistant *rofessor )ssistant *rofessor )ssistant *rofessor )ssistant *rofessor

<

Sched#le

/ay 1 =>??(1?.?? 1?>??(11><? 11><?(1><? 1><?(2><? 2><?(@><? @><? %egistration&%efreshment Inaugural 'eremony 2ession 1 ;unch .rea! 2ession 2 8igh Tea

/ay 2 1?>?? 11>??(1>?? 1>??(2>?? 2>??(<>?? %efreshment 2ession < 7aledictory 'eremony ;unch

(ey )ote Spea*er The 5ey note spea!er of the conference as /%. 8ardeep 2ingh from ,6/4 'ampus, )mritsar. /r. 8ardeep 2ingh has done *h./. ($odelling and /esign of 2oft are $etrics for #b+ect oriented systems). 8e has sonorous e"perience of 2A years in teaching and has B? +ournals, C .oo!s published to his credit. In addition to this he has attended DD national and international conferences. 8e as also a arded ith E.est *rofessor in 'omputer EngineeringF in 2?1<. 8e shared his vie s on the latest trends in Information Technology and also discussed ho IT has become the household name in todayGs orld by e"plaining ne eraGs technologies li!e social net or!ing sites, gadgets, smartphones, etc. 8e also told ho internet access helps us to ma!e our life more easier and comfortable. 8e also thre light on the no. of people using social net or!ing sites for communicating and e"pressing their vie s li!e 9aceboo! hich are essential part of life and people al ays remain eager to share their life moments through these social mediaGs as ell as to give their vie s on different political issues. The term :uantified 2elf as also e"plained by him in detail, this term allo s us to monitor our health and fitness. 0hile concluding his speech, he emphasised on the fact that technology is advancing very fast.

Session &
D

'hanging )spects of Information Technology in 21st Century Sr+)o+ Paper Title 1. 2. <. @. D. 2oft are *ro+ect $anagement> ) 2tate of )rt /r. *arminder 5aur /r. 8ardeep 2ingh Impact of 2oft are $etrics on 'omple"ity during Evolution of 2oft are 2andeep .al )manpreet 2ingh /r. 2umesh 2ood )pplicability of 'omputers and /igiti1ation of ,eography /r. )bhishe! )ggar al /r. 6avneet /ha an E"tracting %eusable 2oft are 'omponents )nshul 5alia /r. 2umesh 2ood ,oods and 2ervices Ta" system()n Insight into Engineering Ta" %eforms in India /r. 8.* ,upta $s. $oni!a )rora ,rid 'omputing> ) 'ommercial 8allmar! -aideep Inder 5aur %anpreet 2ingh )2*.6ET> ) /ynamic )pproach for 0eb /eveloper .alram 2ingh Hadav .lue+ac!ing( 'lo ning Technique Through $obile 6eelam %upinder 5aur *erception )lgorithm> ) 6eural 6et or! Technique Er. 2unny Thu!ral Page )o+ 1 B 1@ 1B 21

C. B. A. =.

<1 <@ <A @< @A C? C@ B?

1?. ) 'ritical )nalysis of #nline $ar!eting $edia 4rvashi 6irula 5omal 11. $obile *hone 'loning> /etection and )voidance %a+bir ,ill 2unpreet 5aur 12. 6et or!(;evel I* $ulticasting *uneet 2harma 1<. ) 2tudy of $odern $edia of 'ommunication and its Impacts on ,lobalised Economy $s. 2avita /r. 8.* ,upta 1@. 'omparative )nalysis of )lgorithms used for 9inding )ssociation %ules in /ata $ining 2an+iv /utta

BD

1D. %ole of ,rid 'omputing in Education> )n Indian *erspective 5amayani 1C. )nalysis of .lac! hole )ttac! in 0ireless 2ensor 6et or!s )rminder 2ingh ,urpreet 5aur 1B. *ros and 'ons of E('ommerce> )n Indian *erspective Te+inder 0alia *allavi 1A. 9actor Influencing 'onsumerGs #nline .uying .ehavior and )ttitude /r. ..2 8undal 2aurabh ,rover 1=. %ole of #nline $ar!eting in 8otel Industry 5unal %ahe+a 2 ati $adaan 2?. 2ecurity .ased $ultifeature %ecognition 2ystem. ,ur+eet 2ingh

A1 AD =2 =C 1?< 1?=

SO,T-A $ P O.$CT MA)A%$M$)T! A STAT$ O, A T Dr+ Parminder (a#r Assistant Professor /%#r# )ana* Dev 0niversity/ Amritsar+ parminder*a#r1yahoo+com Dr+ "ardeep Singh Professor/%#r# )ana* Dev 0niversity/ Amritsar+ hardeep2gnd#1rediffmail+com A3ST ACT The soft are industry moves unrelentingly to ard ne methods for managing the ever increasing comple"ity of soft are pro+ects. 0hile soft are technologies, processes and methods have advanced rapidly, soft are engineering remains a people(intensive process. 'onsequently techniques for managing people, technology, resources and ris!s have profound leverage. This paper highlights common problems ith conventional pro+ect management and suggest solutions ith modern pro+ect mangement. *arameters required for an appropriate soft are pro+ect mangement tool, hich help the pro+ect managers to produce good quality soft are are also discussed. 2oft are pro+ect evolution through its life cycle tries to tell the importance of each activity during their phase. ($4-O DS! 2oft are Engineering, 2oft are *rocess, 2oft are *ro+ect $anagement, *ro+ect $anagement Tools 5+ &)T OD0CT&O) 2oft are engineering is dominated by intelectual activities that are focused on solving problems of immense comple"ity ith numerous un!no ns in competing perspectives. Earlier soft are pro+ects ere research(intensive, dominated by human creativity and diseconomies of scale. 6o (a(days soft are pro+ects are using production(intensive approach dominated by automation and economies of scale ()hmed, 2??C) (.oehm, 1=A1). $odern soft are development processes have moved a ay from the conventional aterfall model, in hich each stage of the development process is dependent upon completion of the previous stage. In order to manage and control all of the intellectual freedom associated ith soft are pro+ect mangement, the activities li!e soft are concept, requirement analysis, architectural design, detailed design and testing should be ta!en care of. These activities supplement the analysis and coding activities (figure 1)

'oncept, 'oncept e"ploration 2ystem e"ploration %equirement )nalysis )rchitectural /esign /etailed /esign Implementation /evelopment

:) *roduction #perations

,ig+ 5! -aterfall Model 6The large7scale system approach8 9 oyce/ -inston/ 5:;<= >+ P O3?$MS -&T" CO)@$)T&O)A? SO,T-A $ MA)A%$M$)T 'onventional soft are management practices are mostly sound in theory, but practice is still tied to archaic technology and techniques. The problems that may e"ist ith conventional soft are management (%oyce, 2?12) are> Protracted integration and late design brea*age! In the conventional model, the entire system as designed on paper, then implemented all at once, then integrated. #nly at the end of this process, it become possible to perform system testing in order to verify the fundamental architecture, interfaces and structure. ?ate ris* resol#tion! %esolution of design issues and engineering trade(offs in the integration phase effects the overall design integrity and its corresponding maintainability. eA#irement7Driven ,#nctional Decomposition! Traditional soft are development process is requirement(driven. )ll requirements are treated equally important and remains constant throughout the soft are development life cycle, hich rarely occurs in the real orld. Adversarial Sta*eholder elationships! /ifficulties in requirement specification and e"change of information solely through paper documents ma!ing it difficult to achieve a balance among requirements, schedule and cost. ,oc#s on Doc#ments and eview Meetings! ;arge volume of documentation and great number of revie meetings results in lo engineering value and high cost in terms of efforts and schedule in their preparation and conduct. B+ MOD$ ) SO,T-A $ P O.$CT MA)A%$M$)T %ecurring issues of conventional pro+ects can be solved ith the help of several critical approaches, as follo s>( Contin#o#s &ntegration> It helps in producing the architecture first hich allo s the integration to occur as the verification activity of the design phase. This enables to detect and resolve the design fla s earlier in the life cycle. Table 1 sho s the differences in or!flo cost allocation bet een a conventional process and a modern process. $arly is* esol#tion! The inception and elaboration phases focus on confronting the ris!s and resolving them before the production stage.
=

 $vol#tionary eA#irements> In modern soft are architecture, requirements are captured in evaluation criteria and attached to each intermediate release, thus leads to the matured understanding of the requirements. Teamwor* among Sta*eholders! Iterative process ith more effective or!ing relationships bet een sta!eholders, allo s trade(offs to be based on a more ob+ective understanding by customers, users and monitors.
2oft are )rchitecture 2oft are /evelopment *rocess #rgani1ational )spects $anagement 2trategies and Techniques %is! )ssessment 2oft are $etrics 2oft are *ro+ect $anageme nt 2oft are 'onfiguration $anagement %equirement Engineering 2oft are Testing 2oft are :uality )ssurance *roductivity 2tandards .est *ractices

,ig >+ Software Project Management C#rrent &ss#es 9igure 2 sho s the various certain issues li!e soft are architecture, soft are testing, configuration management issues etc.that can be handled by soft are pro+ect management no (a(days. The tas! of managing a soft are pro+ect can, therefore, be an e"tremely comple" one, dra ing on many personal, team, and organi1ational resources (%ose et al, 2??B). The various activities over the life cycle of the soft are pro+ect are depicted in figure

2oft are $anagement D?I

2oft are )rchitecture 2oft are /evelopment 2oft are )ssessment 2oft are )rchitecture

2oft are $anagement 1?I

2oft are /evelopment 2oft are )ssessment

2?I 1?I 2?I 2?I

&nception Transition

D?I $laboration

2?I

Constr#ction
2oft are $anagement 1?I

2oft are $anagement 1?I

2oft are )rchitecture 2oft are /evelopment 2oft are )ssessment 2oft are )rchitecture

2oft are /evelopment

2oft are )ssessment

DI <DI D?I 1?I D?I <?I

,ig B+ Software Project evol#tion over the life cycle 9"#mphrey/ 5::C=
1?

The soft are pro+ect life cycle activities sho s that about D?I of the staff assigned to one set of activities in each phase. Table 1gives an overvie of various tas!s that can perform by different 2oft are *ro+ect $anagement tools. 2election of a particular tool depends upon the functions provided by that tool. Table 1. 2oft are *ro+ect $anagement tool selection criteria J6orita,2??CK Criteria Description 1. Tas! 2cheduling Tas! scheduling refers to the assignment of start and end times to a set of tas!s. This feature lets soft are pro+ect manager trac! important pro+ect milestones and note ho is responsible for each tas!. This feature lets the soft are pro+ect manager organi1e and trace requirement details to ensure that proper resources are committed to the pro+ect. The soft are pro+ect manager can establish information relationships bet een multiple documents, assign attributes to the information, such as tas! assignment, priority and status, and change these over time to reflect changes in the pro+ect. 'ollaboration enables both structured and free(flo sharing of !no ledge and best practice. It includes pro+ect status reports that are accessible via a 0eb page, integrated e(mail or discussion boards. Time trac!ing allo s recording, analy1ing and reporting associated ith pro+ect or!ing routine. 2oft are pro+ect manager can use time trac!ing feature to manage employee timesheets and e"penses, calculate salaries, prepare pro+ect estimates, and get invoices based on personal or client or! rates. The estimate feature allo s the pro+ect manager to generate, manage, and validate estimates of effort for a ide variety of pro+ects. It evaluates the pro+ect plan, pro+ect requirements, information about or!ing environment, and even different aspects of companyGs culture. %is! assessment helps the soft are pro+ect manager in identifying and planning for potential pro+ect ris!s. It could also help soft are pro+ect manager to describe the various ris! factors and ho to score them. This feature lets soft are pro+ect manager control schedules, resources, and deliverables of pro+ect. It can manage the impact that changes have on pro+ect ob+ectives, and it lets soft are pro+ect manager trace changes to see ho each requirementLs changes affect multiple other requirements. In addition to ,antt or *E%T charts, some tools provide
11

2.

%esource $anagement

<.

'ollaboration

@.

Time Trac!ing

D.

Estimating

C.

%is! )ssessment

B.

'hange $anagement

A.

%eporting&

'harts

=.

9ile )ttachment

1?.

E(mail notification

11.

*rocess& $ethodology *ortfolio $anagement

12.

hundreds of charts and reports. In addition some tools allo users to develop a custom report format that suits the organi1ation. 9ile attachment let users customi1e pro+ect tas!s, li!e file sharing and document management systems, and 0eb page authoring. 2ome tools help users control document version and chec!out as ell. $ost soft are pro+ect management tools provide integrated e(mail notification to !eep team members informed of the current status such as defects, change in documentation issues and requests, and other related issues. *rocess&$ethodology features allo the soft are pro+ect manager to develop and implement a consistent and standardi1ed process or!flo . *ortfolio $anagement feature helps the soft are pro+ect manager manage multiple pro+ects that are related, such as infrastructure technologies, des!top applications and so on, and allocate resources accordingly.

9igure @ gives us the criteria for selection of an appropriate soft are pro+ect management tool. ;evel 1 is the goal, hich is to identify the best soft are pro+ect management tool for a particular pro+ect. The second level is the t elve criteria to compare and evaluate soft are pro+ect management tools. The third level is the alternative or the soft are pro+ect management tools to be evaluated. Each alternative in level < is connected to every criterion in level 2

;evel 1

;evel 2 Tas! 2cheduling ('1) %esource $anagement ('2)

;evel <

'ollaboration ('<) Time Trac!ing ('@) Estimating ('D) 2election of the best 2oft are *ro+ect $anagement Tool
%is! )ssessment ('C) 'hange $anagement ('B)

%eporting&'harts ('A) 9ile )ttachment ('=)

)lternative 2oft are E(mail 12 notification ('1?) *rocess &$ethodology ('11) *ortfolio $anagement ('12)

$anagement

*ro+ect

,ig D! "ierarchy Str#ct#re for the selection of Software Project Management Tool 9Donna/ ><<D= ,reat number of pro+ect management tools (either open(source or proprietary) and soft are being developed everyday to help managers to automate the administration of individual pro+ects or groups of pro+ects during their life(cycle ()hmad, 2??C), ($ishra 3 $ishra, 2?1<). The most commonly used methods for representing and scheuling pro+ect plans are ,)6TT 'hart and 6et or! /iagrams(*E%T&'*$). 9inal quality of a soft are product is dependent on the manner in hich the pro+ect is completed, and if the soft are is designed in a hasty manner this ill, in due course, create chaos in maintenance and future e"tensions (;am and $ahesh ari, 2??1), so appropriate choice of soft are pro+ect management tool is very essential for the good quality soft are product. D+ CO)C?0S&O)S This paper tries to higlight some common problems associated ith conventional soft are pro+ect management and discuss fe solutions ith modern soft are pro+ect management. The criteria for the selection of soft are pro+ect management tool helps the pro+ect managers to select an appropriate tool. 'ertain issues covered by soft are pro+ect management are also depicted through figure. Each issue has its o n significance. The role of each activity ith in the life cycle of soft are pro+ect evolution is also discussed. Tools required for representation of a pro+ect are also highlighted. It is concluded that appropriate soft are pro+ect management leads to a good quality product.

1<

$,$ $)C$S 1 )hmad, 6. (2??C) 2oft are *ro+ect $anagement Tools> $a!ing a *ractical /ecision 4sing )8*. In *roceedings of the <?th )nnual IEEE&6)2) 2oft are Engineering 0or!shop ()pril 2@ ( 2A, 2??C). 2E0. IEEE 'omputer 2ociety, 0ashington, /', BC(A@ 2 .oehm, .arry 0., (1=A1), 2oft are Engineering Economics, *rentice 8all, Engle ood 'liffs, 6e -ersey. < /avis, )lan $., (1==@), E9ifteen *rinciples of 2oft are Engineering,F IEEE 2oft are, 7olume 11, 6umber C, pp =@(=C. @ /onna /avis, EThe *$ *rescriptionF, 2oft are /evelopment, 2eptember 2??@, pp. DA( BD. D 8umphrey, 0atts 2. (1==D), ) /iscipline for 2oft are Engineering, )ddison 0esley *ublishing 'ompany, $assachusetts. C ;am, 8.E. and $ahesh ari, *. (2??1) Tas! and Team $anagement in the /istributed 2oft are *ro+ect $anagement Tool. In *roceedings of the 2Dth international 'omputer 2oft are and )pplications 'onference on invigorating 2oft are /evelopment (#ctober ?A ( 12, 2??1). '#$*2)'. IEEE 'omputer 2ociety, 0ashington, /', @?1(@?A B $ishra /. and $ishra ).(2?1<), E 2oft are *ro+ect $anagement Tools> ) .rief 'omparative 7ie F, )'$ 2I,2#9T 2oft are Engineering 6otes, 7olume <A, 6umber <, pp 1(@. A 6orita )hmad, *hillip ). ;aplante, M2oft are *ro+ect $anagement Tools> $a!ing a *ractical /ecision 4sing )8*,M se , pp.BC(A@, <?th )nnual IEEE&6)2) 2oft are Engineering 0or!shop 2E0(<? (2E0L?C), 2??C = %oyce, 0inston, 0. (1=B?), E$anaging the /evelopment of ;arge 2oft are 2ystemsF, *roceedings of IEEE 0E2'#6, 1(= 1? %oyce, 0al!er (2?12), 2oft are *ro+ect $anagement, ) 4nified 9rame or!, 2i"teenth Impression, *earson Education 11 %ose, -., *edersen, 5., 8osband, -(8, 5raemmergaard, *. (2??B) $anagement competences, not tools and techniques> ) grounded e"amination of soft are pro+ect management at 0$(data, Information and 2oft are Technol. @=, C (-un. 2??B), C?D(C2@.

1@

&MPACT O, SO,T-A $ M$T &CS O) COMP?$E&T4 D0 &)% $@O?0T&O) O, SO,T-A $ Sandeep 3al esearch Scholar/ P#njab Technical 0niversity/ (ap#rthala+ sandeep+balFD1gmail+com Amanpreet Singh Assistant Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ amanpreetsinghvohra1gmail+com S#mesh Sood Swami Satyanand College of Management & technology/Amritsar+ s#meshGD1gmail+com A3ST ACT 2oft are evolves all through its lifecycle for a variety of reasons hich change the various associated metrics determining its quality. The purpose of soft are engineering process is to !eep comple"ity in chec! by reining in its associated parameters so as to ensure it ages elegantly. 'omple"ity changes ill depend upon the !ind of changes e ant in soft are configuration. It ould vary differently during the initial releases, before demo version and after itGs released, here after it becomes relatively more stable.2oft are metrics capture different aspects of soft are comple"ity. This paper captures and analyses the impact of their change on the health of a soft are over its evolution spanning one month. ($4-O DS! 2oft are evolution, 2oft are comple"ity. &)T OD0CT&O) ;ehman and .elady first applied the term evolution to soft are in the 1=B?s and since then most investigators have used that term to refer to the long, broad vie of change in soft are systems. $ore precisely, e can say that soft are evolution is the sequence of changes to a soft are system over its lifetimeN it encompasses both development and maintenance.J1K 2oft are metrics deal ith the measurement of quality of a soft are product or a process by hich it is developed. ) soft are product can be vie ed as an abstract ob+ect that evolves from an initial statement of need to a finished soft are system including source and e"ecutable code and the various forms of documentation produced during development J2K. The metrics are then used to estimate, predict product costs and schedules and to measure productivity and product quality. Information gained from metrics can then be used in the management and control of the development process in order to improve results.5afura J<K studied the relationship bet een soft are comple"ity metrics and soft are maintenance. T o classes of comple"ity metrics, namely code metrics and structure metrics ere used to quantify the comple"ity of three versions of a medium(si1e system. The author found that both classes of comple"ity gre hen the system as maintained, hich confirmed
1D

;ehmanGs la s. The author also analysed changes in comple"ity at the procedure&module level, and claimed that e"treme changes of comple"ity in one procedure&module may indicate possible fla s during the maintenance activity. In this paper an #pen 2ource 2oft are namely 6);', (6ot )nother ;ousy 'hess ,ame) has been selected. Its A releases are hosted on ,it8ub J@K. It is tested using Test7driven development (TDD) process that relies on the repetition of a very short development cycle> first the developer rites an (initially failing) automated test case that defines a desired improvement or ne function, then produces the minimum amount of code to pass that test, and finally refactors the ne code to acceptable standards JDK. 2ource$onitor version <.@ is a free areJCK that lets you see inside your soft are source code to find out ho much code you have and to identify the relative comple"ity of your modules. 9or e"ample, you can identify the code that is most li!ely to contain defects and thus arrants formal revie . It provides method and function level source code metrics in a fast, single pass through source files and displays those metrics in tables and charts, including 5iviat diagrams. 2ection II of the paper states the differences among the versions and provides the !iviat metric graph for each version. 2ection III contains the comparative study of various metrics across versions. The paper concludes in section I7 ith the conclusion. @$ S&O)S & (&@&AT % AP"S O, )A?C% Total A versions JBK available till no are> 1) Test release had > changed files ith 5: additions and 5< deletions from predecessor. <C files in toto. 2) 7ersion ?.D had > changed files ith 5> additions and < deletions from predecessor. 21 files in toto. 3) 7ersion ?.B had B changed files ith B< additions and >C deletions from predecessor. <1 files in toto. 4) 7ersion <+: had D changed files ith 5C additions and : deletions from predecessor. <B files in toto. 5) 7ersion ?.=.B had 5 changed file ith < additions and < deletions from predecessor. <= files in toto. 6) 7ersion 1.? had > changed files ith D additions and 5 deletion from predecessor. <= files in toto. 7) 7ersion 1.?.?rc1 had 5 changed file ith < additions and < deletions from predecessor. <= files in toto. 8) 7ersion 1.Drc1 had ; changed files ith 5G additions and 5B deletions from predecessor.@A files in toto. The 5iviat graphs of the different versions are given belo > 58 Test elease

its its its its its its its its

1C

,ig 5 )ll metrics sans $a"imum /epth, $a"imum 'omple"ity and *ercentage comments are ithin the prescribed range. 0hile ma"imum depth and comple"ity e"ceed ma"imum limit, percentage of comments are belo the minimum range specified. >8 @ersion <+C

,ig > The case ith this version is same as the one presented above. )verage number of statements per method has increased but is ithin the tolerance levels. In spite of ma"imum depth and ma"imum comple"ity going beyond tolerance levels, average depth and comple"ity are still ithin acceptable limits. The number of methods per class is very close to the lo er specified limit. The impact of such case needs to be studied. 8igh comple"ity is certainly not desirable.;#' are bound to increase over a period of time. 'omple"ity as a function of $ethods per 'lass, )verage 6umber of 2tatements *er method, )verage /epth and not of ;#' needs to be investigated. The impact on the soft are if these metrics fall belo a certain threshold needs to be studied. B8 @ersion <+;

1B

,ig B This graph also presents a scenario similar to the previous one. 8ere too, all but 2 parameters are above high limit and 1 parameter is beneath the lo er limit specified. D8 @ersion <+:

,ig D This !iviat graph also paints a picture similar to the previous cases parameters. 6o ne observations can be reported. C8 @ersion <+:+; ith minor changes in all

,ig C $a"imum depth is observed to be coming closer to the ma"imum specified limit. 6o ne conclusions are to be dra n in this case. G8 @ersion 5+<

1A

2ame things are observed as they observations are noticed. ;8 @ersion5+<+<

,ig G ere in thee. )lthough the figures change, no ne

,ig ; 6o ne observations are noticed in this case. F8 @ersion 5+C

,ig F )verage comple"ity +ust reaches out of ma"imum prescribed limit. )verage number of statements per method too is barely beneath the ma"imum specified range. )part from these, no ne observations are noticed in this case.
1=

COMPA AT&@$ ST0D4 O, T"$ M$T &CS versions metrics Avg+ compleHity <+:+ ; <.11 <=A < B.B@ 5+<+ < <.1< @?1 A B.BB

Test version <+C

<+;

<+:

5+<

5+C

2.B?

2.AC 5>F C D+CB

>+G: 21< D D.B1

2.AB <CD ? C.1B

<.1@ @?@ 2 B.BB

@.DD

?ines of code

2D<1

C<2C

MethodsIClass

=.2@

Avg+ statementsImethod B.<

A.A

;+5

B.A

A.<

A.@

A.<

=.B

Table 5 9rom the table above, e note that ;#', $ethods&'lass though not related vary in a similar fashion over different versions.;#' and $ethods&'lass do not ho ever rise and fall ith )verage number of 2tatements per $ethod. )verage comple"ity pertains to average comple"ity of the hole product release. There ould be average comple"ity of individual classes in a particular release.0hen e increase the number of classes of similar comple"ity and assuming that the class(lin!ages donGt play as significant a role as class comple"ity, in evaluating average comple"ity of the product, e ill find that average comple"ity is directly proportional to class comple"ity. 0ith version changes, average comple"ity, methods&class, number of classes increases consistently ( ith one e"ception). ;#' ould obviously increase as more features are added. 0e can say that average comple"ity is someho a function of comple"ity of the individual classes of the product. 0hile comparing the metrics of different versions, e see that )verage comple"ity varies almost proportionally ith the ;#', $ethods&'lass ith 1 e"ception (transition from test version to version ?.D) here comple"ity increases even though ;#' and $ethods&'lass decrease. The ;#' are reduced to half and $ethods per class increase significantly. )verage number of statements per method helps us e"plain the above discussed e"ception from test release to version ?.D. )lthough it cannot predict rise and fall in )verage 'omple"ity on its o n. If e compare the change in avg. no. of statements&method ith change in )verage comple"ity, e ill find out that the former on its o n cannot predict the latter. 'ase in point is changes over versions ?.=.B, 1.?, 1.?.?. )verage statements per method increase from A.< to A.@ and then bac! to A.<. 0hile average comple"ity increases from <.11 to <.1@ but does not decrease do n bac! to <.11N instead it goes do n only to <.1<. $ore lines of code in 1.?.? compared to ?.=.B helps e"plain this. 0hile ;#' and $ethods&'lass alone can help us in most cases and since they vary almost together, in this case study, in spite of being unrelated. That ho ever is not

2?

the case ith )verage number of statements&method but it has been demonstrated as an important metric. CO)C?0S&O) & ,0T0 $ D& $CT&O) The overall increase in relative comple"ity from the first version (test release) to the final version (7ersion 1.D) of CA.D1I is spread over relative percentage comple"ity increments of D.=2I, (D.=@I, C.C=I, A.<CI, ?.=I, (?.<1I, @D.<CI.The main thing e dra from the study that e cannot ignore any metric hile assessing comple"ity of soft are. Even insignificant ones have the potential to e"plain some fringe cases hich cannot be e"plained by the usual suspects li!e ;#', average statements&method etc. 2oft are development is a dynamic process here e need to !eep all the associated metrics in chec! other ise, the soft are shape and comple"ity might spiral out of control. )s the study of dynamical systems have demonstrated, and as reflected in our study, here one parameter left unchec!ed led to an increase in overall comple"ity, e cannot completely control comple"ity. 0hat e ould ant to do is ensure that as it scales up in si1e (and comple"ity), it stays manageable, accessible and clean. )nd !eeping gauge of metrics ill play a ma+or role in helping us ensure that. 0e ould ant to further e"plore relation bet een class comple"ity and ho the individual comple"ities add up to provide us ith overall average comple"ity of the product. 3&3?&O% AP"4 1. 'oo!, 2tephen, 8e -i, and %achel 8arrison. M2oft are evolution and soft are evolvability.M 4niversity of %eading, 45 (2???). 2. Tahvildari, ;adan, and )+it 2ingh. M'ategori1ation of ob+ect(oriented soft are metrics.M Electrical and 'omputer Engineering, 2??? 'anadian 'onference on. 7ol. 1. IEEE, (2???). <. /. 5afura> The use of soft are comple"ity metrics in soft are maintenance, IEEE Trans. 2oft. Eng., vol. 1<, pp. <<D(<@<, 1=AB. @. https>&&github.com&$eelo&6);',OsourcePcc D. http>&&en. i!ipedia.org& i!i&TestdrivenQdevelopment C. http>&& .camp oods .com&sourcemonitor.html B. https>&&github.com&$eelo&6);',&releases

21

APP?&CA3&?&T4 O, COMP0T$ S A)D D&%&T&JAT&O) O, %$O% AP"4 Dr+ Abhishe* Aggarwal Assistant Professor/ "ind# College/ Amritsar+ agg2:C1yahoo+com Dr+ )avneet Dhawan Assistant Professor /%overnment P+ % + College/ 3ibirani/ 6Alwar8/ ajasthan+ dhawanGG1gmail+com ,eography is the science of EarthGs physical features, resources, climate, population etc. ,eography has developed and transformed from e"periential study to digiti1ed study ith time. *eople used to observe stars in the clear open s!ies and astronomy developed. Torricelli developed barometer and $eteorology developed. 2imilarly other sciences in ,eography developed li!e 8ydrology, $arine ,eography, ,laciology, *edology, .iogeography to name a fe . ,eography as more qualitative than quantitative till the 1= th c. In 1=<D E6I)', the first computer as invented and it also transformed from first generation computers to the present state. In 1=C?s the first quantitative revolution had ta!en place in ,eography and it as assisted by the use of computers. Today in 2ocial 2ciences, computers have become the main tool in research. /ifferent topics representing a selection of the main areas of computer use in geography and sho ho computers can be used to acquire, process and display geographical data. 0or!ed e"amples, for three program pac!ages that are idely used by geographers are R 2tatistical *ac!age for 2ocial 2ciences (2*22), 2ynteny $apping and )nalysis *rogram (2H$)*) and ,lobal Inventory $odeling and $apping 2tudies (,I$$2). The ma+or areas of computer applications and of interest to geographers are those dealing ith statistics, digital cartography, remote sensing, geographical information systems and simulation models ($ather, $. *aul, 1==1). %evolution in the study of ,eography occurred ith the advent of computers. 'omputers and ,eography are indispensable. 'omputers have opened innumerable ne fields in research and made unthin!able, thin!able. The increasing technological advancements in computers have helped to aid geography in many ays. 'omputer science has contributed greatly to the field of geography and has allo ed geographers to accurately and spectacularly vie and observe the earth and human culture. Three ma+or ays in hich computers have changed geography are in geography soft are, remote sensing, and mapping ('omputer 2cience and ,eography ( Their Intersection, #odles, 2?12).E"ploration is an important tool in the study of ,eography. It means going to different places not visited before. Earlier e"plorers used to go to places to find ne discoveries but today digiti1ation has totally changed this aspect and much of the or! is done on computers mince. .ut 6ational ,eography 2cientists thin! that the age(old practice of mapping still plays an important role in this type of e"ploration, but e"ploration can also be done by using images from satellites or gathering information from intervie s. /iscoveries can come by using computers to map and analy1e the relationship among things in geographic space, or from piecing together the multiple forces, near and far, hich shape the ay individual places develop. ,eographic information systems are po erful databases
22

that collect all types of information (maps, reports, statistics, satellite images, surveys, demographic data, and more) and lin! each piece of data to a geographic reference point, such as geographic coordinates (6ational ,eographic, Encyclopaedic Entry). ,I2 is a tool for managing data about here features are (geographic coordinate data) and hat they are li!e (attribute data), and for providing the ability to query, manipulate, and analy1e those data. Technologies that support remote sensing are photogrammetry, cartography, geodesy, surveying, mapping and geo R I'T.:uantitative revolution gave ,eography many ne models li!e gravity models, stochastic models based on the concepts of probability and deterministic models of locational analysis by 7on Thunen and 0eber. 2cholars started ta!ing help of these models to define and analyse ne theories and aspects. ,radually, the sub+ect of ,eography started to transform and ne innovative ideas started to creep in. $any of the changes to the *rinciples and %ecommendations for *opulation and 8ousing 'ensuses (4nited 6ations, 1==A) reflect the emergence of ne technologies for census operations. 2ignificant technical developments ill undoubtedly benefit census data capture, processing and distribution. %E7#;4TI#6 I6 ')%T#,%)*8H $aps are used to sho locations, distances, directions and the si1e of areas. $aps also display geographic relationships, differences, clusters and patterns. $aps are used for navigation, e"ploration, illustration and communication in the public and private sectors. In early C?s computers couldnGt sho maps in the true shape hich used the graphical scales. In 1=A?s ith the introduction of ,eographic Information 2ystem for the first time commercial ,eography developed and the hole orld of data computing and map ma!ing changed. It digiti1es the map and every bit of information can be sorted out. Terrain is first mapped by satellites and aero planes and then digiti1ed maps are constructed. It is called %emote sensing (%2). The term emote Sensing means the sensing of the EarthLs surface from space by ma!ing use of the properties of electromagnetic aves emitted, reflected or diffracted by the sensed ob+ects, for the purpose of improving natural resources management, land use and the protection of the environment (46, 1===) EThe science and art of obtaining information about an ob+ect, area, or phenomenon through the analysis of data acquired by a device that is not in contact ith the ob+ect, area, or phenomenon under investigationM ((;illesand and 5iefer(1==@). E%emote sensingF term as coined by Evelyn *ruitt in mid(1=D?s Especially this technique is po erful in the ma!ing of Topographical 2heets hich sho local terrain in details. $ain benefit of this technique is reading, measuring distances, computing area on the map by +ust one clic!. It constructs the map in layers li!e vegetation layer, road layer, settlement layer etc. and mainly uses the 7ector and %aster data. $ain computer soft ares are E%/)2 I$),I6E, ,I2 )%'7IE0, I;0I2, E%$)**E%, ,E#$E/I), ,%)22, I/%I2I, )%',I2 etc. E2%I 0E.2ITE .esri.com can be visited for details.$ain ,I2 developments in India are> national level organi1ations li!e Indian 2pace
2<

%esearch #rganisation, 6%/$2 and 6I', 2tate level departments and ,I2 Entrepreneurs li!e E2%I India, ;eica India, E%/)2 %$2I, %eliance Infocom, 2atyam 6avigation, .entley India etc. %?O3A? POS&T&O)&)% S4ST$M In 1=B< the 4.2. /epartment of /efense decided to establish, develop, test, acquire, and deploy a spaceborne ,lobal *ositioning 2ystem (,*2). The result of this decision is the present 6)72T)%,*2 (6)7igation 2atellite Timing )nd %anging ,lobal *ositioning 2ystem). ,*2 device helps in locating ob+ects on the earth. It gives the accurate information about the position of any ob+ect. It or!s on the principle of si" satellites. )t least C R A satellites help to locate a place and gives precise position. This technology as used by 5arnata!a 2tate Transport 4nderta!ing to !eep trac! of its buses. It is a small poc!et si1e instrument and as purchased by the Thane $unicipal 'orporation (T$') follo ing the fatal crash in $umbai that claimed several lives. This device has been instrumental in mapping illegal structures in Thane. It is easy to carry and simple to operate, and has revolutioni1ed the ay the machinery operates in the face of this challenges. The corporation has so far scanned and mapped 1C? structures ith the help from this device ( Sharad @yas/ 2?1<). Today every smart phone uses the ,*2 and offer e"tensive mapping capabilities ithout a data connection and sho s full driving directions. 0ith ,*2 one can report speed cameras, chec! out nearby par!ing, can choose bet een 2/ and </ vie s, the latter having </ buildings to help guide the travelers, and offer an additional ay to help to find oneGs bearings. ,I2 and ,*2 technologies enable the coupling of real(time data collection ith accurate position information, leading to the efficient manipulation and analysis of large amounts of geospatial data. ,*2(based applications in precision farming are being used for farm planning, field mapping, soil sampling, tractor guidance, crop scouting, variable rate applications, and yield mapping. ,*2 allo s farmers to or! during lo visibility field conditions such as rain, dust, fog, and dar!ness ()pplicability of ,*2. .gps.gov).,I2 R ,*2 R %emote 2ensing techniques are also used in precised farming techniques, forest management, habitat analysis, space technology, aeronautical industry etc. $,$ $)C$S 1. 'omputer 2cience and ,eography ( Their Intersection, #odles, Hahoo 'ontributor 6et or! -an 1@, 2?12 M2hare your voice on Hahoo ebsites 2. ;illesand Thomas $. 3 5iefer %alph (1==<). %emote 2ensing and Image Interpretation, -ohn 0iley, 6e Hor! <. $ather, *aul $. (1==1). 'omputer )pplications in ,eography, I2.6> =BA(?(@B1( =2C1D(<, -anuary 1==1, 0iley 3 'o., 6e Hor!. @. 6ational ,eographic, Encyclopaedic Entry, ,eography. 5. education.nationalgeographic.co.in/education/encyclopedia/geography C. 2harad 7yas. (2?1<). ,*2 trac!er to map illegal structures, T66 /ec <?, 2?1<, ?C.?2)$ I2T B. 4nited 6ations, 1==A A. 4nited 6ations, 1===
2@

=.

.gps.gov )pplicability of ,*2. $ET ACT&)% $0SA3?$ SO,T-A $ COMPO)$)TS

Ansh#l (alia esearch Scholar/ P#njab Technical 0niversity/ (ap#rthala+ ansh+*amal<<;1gmail+com S#mesh Sood Assistant Professor/ Swami Satyanand College of Management & Technology/ Amritsar+ s#meshGD1gmail+com A3ST ACT The e"traction of reusable soft are components seems to be an interesting tas!. The idea loo!s simple but it is not as it seems. 9or a component to be e"tracted it requires certain criteria to satisfy. 'omponent certification appears to play a significant role in component e"traction. #nly certified components needs to be accepted by the component repository that in turn offers certified soft are components. 2uitability of the components must be chec!ed in respect to requirements of the soft are system under construction. E"traction process is to be accomplished before preparing the design specifications. %eusability test and component assessment is to be conducted hile e"tracting components. ($4 -O DS! 2oft are reuse, 2oft are component assessment, 'omponent e"traction, 'omponent repository. &)T OD0CT&O) )t present, most of the soft are development organi1ations are suffering from quality and timely constraints. $ost of the ma+or organi1ations are in a need to develop high quality soft are products ith less cost and in less time. In one ay, the organi1ations can hire more or!force to produce high quality products in less time but it ill certainly increase the costs of developing products J12K. The other ay is to reuse e"isting soft are or the components of e"isting soft are. .y reusing e"isting soft are a high quality product can be developed in less cost and in less time. 9rom the point of reusability, the soft are engineering can be categori1ed into t o as domain engineering and application engineering. 1In domain engineering, component for reuse is created and stored in library and during application engineering, required component is selected from the reuse library and is used according to the requirements. /evelopment of reusable soft are components is an essential activity in the soft are reuse process. The place here the reusable soft are components can be stored is termed as reusable soft are component database or in general component database. The component database should be so, that it should be able to handle the queries related to components stored in the database and to provide the user ith the appropriate results. %etrieving a component appears to be quiet simple tas! here, but it is not so in actual practice. .ecause retrieving a component requires certain conditions to meet in order to be reused in the system under development. The conditions refer to the qualifications of the components ith respect
1

Wahab presented two view points of software engineering in context of reusabilit !12"# 2D

to the requirements of the proposed system. :ualification of the component states that hether the component has the adequate attributes to suite the functionality of the system or not. ?&T$ AT0 $ $@&$$cIlroy J1=CAK first envisioned 2oft are reuse, at a 6)T# 2oft are Engineering 'onference, here he predicted that mass(produced components ould end the soft are crisis JBK. %amamoorthy J1=AAK establishes the fact that the reusability is limited not only to the source code, but it has to involve requirements specifications, detailed designs, documents and test cases ith it J=K. #uyang J1==CK proposed t o vie points of soft are reuse i.e. build for reuse and build by reuse JAK. 7oas J2???K gave the concept of certifying components. It can play a vital role in reusable soft are component e"traction J11K. ,arcia et al. J2??CK comes up ith the idea of development of component repository helps the soft are engineers in developing soft are systems for reuse and ith reuse. The creation of a component repository provided the basis for storage, search and retrieval of components J@K. )nas al R badareen J2?11K proposed a frame or! that contains the e"traction, adoption and storage of reusable soft are components J2K. %0&D$?&)$S ,O COMPO)$)T $ET ACT&O) The follo ing set of rules&guidelines should be follo ed hile e"tracting the reusable soft are components from a component database> 5+5+ State ,#nctionality of Component eA#ired The functionality of the component required must be stated clearly and precisely. It should be stated in accordance ith scope of the ne system. 5+>+ &dentify the Domain of Component The domain of the component required should be identified in advance in order to e"tract component from the specified domain. #ther ise it may result in the e"traction of any similar component from the other domain. 5+B+ Single ,#nctionality The component to be e"tracted should have the single functionality. ) component ith single functionality should be having less coupling hich ma!es it easy to e"tract and to adapt. 5+D+ elevant Doc#mentation The component must be accompanied ith the relevant documentation required to understand it. The adequate documentation ma!es the component to be understood easily by the user other ise it ill very difficult to understand hat actually a component does. If there are changes required in the component for adapting then it is necessary to have a complete !no ledge of ho it has been designed J=K. 5+C+ Test for e#sability .efore e"tracting the component it must be tested for reusability. Test for reusability here refers to the conditions that are required by the ne system. If a component gets through the
2C

reusability test it is eligible to be inducted into the ne system. #ther ise the component should not be e"tracted J<K. 5+G+ Compatibility The compatibility of the component to be e"tracted must be chec!ed to determine hether it ill match the development platform of the ne system or not. If it does not match then the ne system should be designed in order to ma!e the component compatible ith the system. P OC$SS O, $ET ACT&)% COMPO)$)TS The process of component e"traction specifies the tools and techniques to be used for e"tracting components. The e"traction of components ill be based on specific set of guidelines. The e"traction process is broadly classified into t o> 5+ Component &dentification 'omponent identification is concerned ith the activities that are underta!en to identify a component. It involves hich component is needed to be e"tracted as per the user requirements. The independency and generality of the component are also considered J<K. 0hile identification the needs of the user should be !ept in mind and it should be limited to the scope of the ne system. The hole of the component database is searched in the concerned domain to acquire a component that matches the functionality of the ne system. 'omplete information about the component is gathered in order to chec! its suitability. 9unctionality of the component is +udged, its purpose is to be studied if provided ith the relevant documentation and information about input&output descriptions is also to be gathered. The identification process is to be done before the detailed system design. It actually begins at the pro+ect planning phase ith a rough idea in mind but starts formally after the requirement specification phase J<K. >+ Component K#alification )fter the component is identified it is required to chec! for the suitability of the component. The process of component qualification is actually meant for this purpose. 'omponent qualification qualifies that hether the component is eligible to be inducted into the ne system or not. The component assessment is made hile qualifying a component JDK. 9or a component to be eligible it must satisfy certain tests to be conducted upon it. The first step in component qualification is the test of the reusability. The test of the reusability process considers the conditions hich are required by the ne system. In this test the functional and non R functional requirements of the system are considered J<K. If the component gets through the reusability test then it can be adopted to the ne system. .ut if it does not gets through the reusability test successfully it is to be processed again and then to be tested again. The ne"t step is to test for the technological support the identified component have. It is determined that hether the component have the adequate technological support&platform as prescribed for the ne system or not. If the component appears successful in this test it can be easily adopted into the system, but if it does not, adequate changes can be made either in the system design or in the component hichever costs less in terms of time, money, effort and resources. If a component does not encompass the test of reusability and technological support its induction can be re+ected to the system. O?$ O, COMPO)$)T C$ T&,&CAT&O) &) COMPO)$)T $ET ACT&O)
2B

'omponent certification is a process that ensures that the components of soft are conforms to the ell defined standards and complies ith the established practices. The certification provides a proof of validity to a soft are unit JCK. Though the component certification is a separate process but it is needed to be integrated into the overall component based development process in order to enhance the quality of component and system development activities. It is to be made a necessary condition that only the certified components can be added to the reusable soft are component database. If such condition is imposed in practice then only the components ith valid certificates ill be available for e"traction and only certified components is to be inducted into the ne system. That in turn, enhances the quality of the system to be developed. .ecause a certified component conforms that it is developed using ell established practices and ell defined standards. )t present there is not enough literature present that should be able to address the practical aspects of soft are component certification JCK. There is also a need to involve the component certifiers or the component certification institutes into the component development lifecycle. CO)C?0S&O) 2oft are components can e"tracted from the reusable soft are component database for the purpose of reuse. The e"tracted components may be adopted into the ne system. The guidelines hich may be follo ed for component e"traction are brought under the light. )n illustration about the methods of e"traction is produced. )lso the significance of component certification is stated in order to enhance the quality of component itself and the system to be developed. ) fault R free component e"traction plays an important role in the constitution of soft are systems hich are to be build by reuse. 'omponent e"traction is to be performed by giving a ell thought. 3&3?&O% AP"4 1. )bd R El R 8afi1 2.5., .asili 7.%., 'aldiera ,., ETo ards )utomated 2upport for E"traction of %eusable 'omponentsF, *roceedings. 'onference on 2oft are $aintenance, pp. 212 R 21=, 1==1. 2. )l R .adareen )., 2elamat $.8., -abar $.)., E%eusable 2oft are 'omponent ;ifecycleF, International -ournal of 'omputers, D(2), pp. 1=1 R 1==, 2?11. <. )l R .adareen )., 2elamat $.8., -abar $.)., /in -., Turaev 2., E%eusable 2oft are 'omponents 9rame or!F, European 'onference on 'omputer 2cience, pp. 12C R 1<?, 2?1?. @. ,arcia 7.'., et al., ETo ards a 'ode 2earch Engine .ased on the R 2tate R of R )rt and *racticeF, 1<th IEEE )sia *acific 2oft are Engineering 'onference, .angalore, India, 2??C. D. Ilyas $., )bbas $., 2aleem 5., E) $etric .ased )pproach to E"tract, 2tore and /eploy 2oft are %eusable 'omponents EffectivelyF, International -ournal of 'omputer 2cience Issues, 7ol. 1?, Issue @, 6o. 2, pp. 2DB R 2C@, 2?1<. C. $ali! 6., E'ertification of 2oft are 'omponents for %euseF, International -ournal of )dvanced %esearch in Electrical, Electronics and Instrumentation Engineering, 2(=), pp. @C?< R @C?C, 2?1<.

2A

B. $cIlroy $./., E$ass *roduced 2oft are 'omponentsF, 2oft are Engineering> %eport on a 'onference by the 6)T# 2cience 'ommittee, .russels, pp. 1<A R 1DD, 1=CA. A. #uyang H., 'arver /.;., EEnhancing design reusability by clustering specificationsF, presented at the *roceedings of the 1==C )'$ symposium on )pplied 'omputing, *hiladelphia, *ennsylvania, 4nited 2tates, 1==C. =. %amamoorthy '.7., et al., E2upporting for %eusability in ,enesisF, IEEE Transactions on 2oft are Engineering, vol. 1@, pp. 11@D R 11D@, 1=AA. 1?. 2rinivas '., %ao '.7., E2oft are %eusable 'omponents 0ith %epository 2ystemF, International -ournal of 'omputer 2cience and Informatics, 1(1), pp. A@ R AA, 2?11. 11. 7oas -.$., E'ertifying #ff R the R 2helf 2oft are 'omponentsF, IEEE 'omputer, pp. = R 1D, 2???. 12. 0ahab H., .abar $.I., )hmed 2., E2ingle %epository for 2oft are 'omponent 2election (2%2'2)> ) %eusable 2oft are 'omponent 2election TechniqueF, -ournal of Theoretical and )pplied Information Technology, 2C(1), pp. << R @C, 2?11.

2=

%OODS A)D S$ @&C$S TAE S4ST$M L A) &)S&%"T &)TO $M$ %&)% TAE $,O MS &) &)D&A Dr+ "+P+ %#pta Principal/ Swami Satyanand College of Management/ Amritsar+ g#pta2haripar*ash1yahoo+com Ms+ Moni*a Arora esearch Scholar/P#njab Technical 0niversity/(ap#rthala+ dennisarora1yahoo+com A3ST ACT The present study is an effort to assess the reasons for reforms in Indian ta"ation system and to analyse its various challenges. In the era of globali1ation ,oods and 2ervices Ta" (,2T) system is inevitable for !eeping uniformity in the rates of ta"es. Every nation has its o n economic policy to achieve economic development in the desired manner. .ut it is a ell recognised fact that the economic development basically depend upon the *ublic 9inance 2ystem and the political environment prevailing in the country. *olitical peace and illingness is one of the performance indicators. )t present, 1@? countries in the orld have adopted ,2T. The ,2T bill has been introduced by ta" policy ma!ers after discussions ith Indian ta" regulatory body on )pril <?, 2?11, hich is related to the ma+or indirect ta"es li!e e"cise duties, customs duties, and service ta". )t the state level, the ma+or initiative in recent times has been the introduction of the ,2T so in this paper, the discussion limits itself to this measure. India, particularly after independence has been ma!ing use of ta"ation policy ith direct and indirect ta"es to accelerate economic gro th ith consistent overall ob+ectives of the government, i.e. equality and +ustice. 6evertheless after a period of fe decades the Indian Ta" 2ystem particularly the Indirect ta" regime has been most comple" one in the orld. 2imilarly, our ta"ation la s have become idely entangled in procedures hich act as an impediment in its effective administration. In the present study an attempt has been made to understand the need and impact of the ne ly proposed ta" reform called S,2TG after having a glance on chronology of ma+or events in Indian ta" history. 'onsidering its positive implication as ell as negative implications li!e ta" rate slabs and some provisions creating fears in the minds of businessmen and their opposition to ,2T etc., 2D 'hartered )ccountants ere as!ed to give their opinion on the reform. The e"perts on ta"ation suggest that introduction of this ta" reform (,2T) before /irect Ta" 'ode (/T') is need of the hour. Introduction of ,oods and 2ervices Ta" ill help the government authorities as ell as the income ta" assessees in the era of 8i(tech environment but political( ill is required to dra and implement these alternatives for restructuring. ($4 -O DS! )d valorem rates, /T', ,2T, 8ybrid technology, 6ano( era, 7)T, Tero( rate. &)T OD0CT&O)
<?

In the era of globali1ation, ,2T system is inevitable for !eeping uniformity in the rates of ta"es. /ue to political illingness from different parties there has been along e"ercise of ,2T implementation in India. To !eep uniform ta" rates across the states, to ma!e the system more rational and to increase the revenue of state as ell as central government, ,2T is the need of the hour. In India, business houses face lot of problems. 2o, application of ,2T in this ne era is really challenging not only for the businessman but also for the state governments, sta!e holders and the regulatory bodies. The central or state governments need a provision for the sufficient funds and assistance of e"pert to e"ecute system of ,2T properly. Theoretically, for the governments in developed nationsN the design of a ta" system ould rely largely on consumption ta"es (7)T) on all goods and services applied at a more or less uniform rate today. 8o ever, in the presence of large informal sector and constraints in implementing effective e"penditure(based redistribution measures, it may be necessary to have a combination of income and consumption ta"es. 0ith a ta" system already in place such an option may not be easily available, even the consumption ta"es cover all goods and services at fairly uniform rates. The tas! therefore is to reform the e"isting ta" system so as to minimi1e the e"cess burden of ta"ation ithin the broad contours of the e"isting system. This involves reforms of all ma+or ta"es at the central, state, and local levels. The direction of reform as guided by the literature on ta" reforms in developing countries includes> scaling do n of and possible elimination of trade ta"es over timeN reform of e"isting domestic indirect ta"es to transform them into comprehensive consumption ta"es on goods and services> this should cover both national and sub(national ta"esN CO)C$PT O, %OODS A)D S$ @&C$S TAE7%ST The %oods and Services TaH 6%ST8 is a value added ta" implemented in India. It ill replace all indirect ta"es levied on goods and services by the Indian 'entral and 2tate governments. It is aimed at being comprehensive for most goods and services ith fe ta" e"emptions. 4nder this ta" system e"ports ill be 1ero(rated and imports ill be levied the same ta"es as domestic goods and services adhering to the destination principle. ,2T ill create a single, unified Indian mar!et to ma!e the economy stronger. The implementation of ,2T ill lead to the abolition of other ta"es such as octroi, 'entral 2ales Ta", 2tate(level sales ta", entry ta", stamp duty, telecom license fees, turnover ta", ta" on consumption or sale of electricity, ta"es on transportation of goods and services, etc., thus avoiding multiple layers of ta"ation that currently e"ist in India. %ST &) COMPA &SO) -&T" @AT If the 7)T is a ma+or improvement over the pre(e"isting 'entral e"cise duty at the national level and the sales ta" system at the 2tate level, then the ,oods and 2ervices Ta" (,2T) ill indeed be a further significant improvement R the ne"t logical step R to ards a comprehensive indirect ta" reforms in the country. TA3?$7> Chronology of Transition from MOD@AT to C$)@AT in &ndia 4$A S&%)&,&CA)T $@$)TS
<1

1=AC 1==@ 1==B

2???

2??1

2??@

2?11

Introduction> 2cheme did not include $achines 3*ac!ing $aterials 'apital ,oods 'redit introduced $odvat 'redit %ules re( ritten in simple language Invoices issued by /epot, consignment agent of an importer are made eligible invoices to avail $odvat 'redit $odvat 'redit %ules replaced ith 'E67)T 'redit %ules Input 'redit and 'apital ,oods merged into single set of %ules 2pecial /uty of E"cise non(modvatable .e.f. 1.@.2??? 'apital ,oods 'redit allo ed in t o instalments .e.f.1.@.2??? $odvat 2cheme to be called 'E67)T 'redit 2cheme 6e and separate set of simplified 'E67)T 'redit %ules introduced .e.f.1.@.2??? 'E67)T 'redit 2cheme not available for $atches %estriction on credit (BD percent) for pro+ect import removed 2pecial /uty of E"cise allo ed as credit 6ational 'alamity 'ontingent /uty allo ed as credit -igs and 9i"tures can also be sent to +ob or!er, apart from moulds after availing credit ,eneral permission to clear product direct from +ob or!er end to ultimate buyer *rocedures under $odvat %ules relating to /ealers continue as such under 'E67)T 'redit %ules alsoN .e.f.1.=.2??1 2ervices ta" credit and e"cise duty credit integrated and e"tended across goods and services )E/ 'redit is made available for 'E67)T duty on final goods ,2T .ill So#rce! 3#dgets and )otifications of the Central %overnment

&MP?$M$)TAT&O) O, T"$ TAE $,O MS O) %ST &) T"$ C0 $)T $)@& O)M$)T! SOM$ C"A??$)%$S/ P O3?$MS A)D T" $ATS 6A8 Challenges before the reg#latory bodies in the c#rrent environment!7 Is the political ill of all the parties really so strong to accept all the reforms hich the government ant to implementO The frightening question is( ill the government accept E(Ta"ation la s formulated preferably by an intelligent agency li!e 4nited 6ationsO The most challenging question is( hat !ind of a ta" can reach the ethereal abodes to collect adequate revenue for governanceO 0hat !ind of transaction can be ta"ed and ho ill be entitled for the ta" revenue hen the problems related cyber sales ill ariseO )nother challenging question ill be to detect ta" evasion, hich may evolve the use of 6ano(technologyO If the intelligent machines earn income independent of any human help, ill it be liable to pay ta" as a machineO 2oft are based machines ill be far more efficient than neuron based human machines.

<2

638 Problems and Threats in the modern era that the taH collectors and taH payers may face!7 ;i!e cloning of animals, human cloning ill lead to several moral and legal issues. 'arbon copies of individuals, ethical considerations apart ill definitely pose difficult legal problems of ta" liability for ta"es on income and e"penditure. 2o identifying such problems at early stage ill have to be done before the real problem arises. 8ybrid technology and electric cars ill be common mean of transportation. 2ale and purchase of such transaction, trac!ing problems related to internet trading, E(money and E( commerce and cyber transaction ill be the fe threats and are of deep concern and governments cannot ignore the probable loss of ta" revenue. ?&T$ AT0 $ S0 @$4 )lthough the Indirect Ta" Enquiry %eport issued in 5:;; provided a detailed analysis of the allocation and distributional consequences of union e"cise duties, its recommendations ere not implemented for almost a decade. The rationali1ation recommendations included converting specific duties into ad valorem ta"es, unifying rates, and introducing an input ta" credit to convert the cascading manufacturersG sales ta" into a manufacturing( stage value( added ta" ($)67)T). The interesting part of the reform as that there as virtually no preparation and the introduction of modified value(added ta" ($#/7)T) as a process of Elearning by doing.F This as a strange combination of ta"ation based on physical verification of goods ith provision of an input ta" credit. The coverage of the credit mechanism also evolved over time. It began ith selected items, ith credit based on a one( to(one correspondence bet een inputs and outputs. It as only by 1==CR=B, that it covered a ma+ority of commodities in the e"cise tariff and incorporated comprehensive credit. 6o here else in the orld can one find 7)T introduction so complicated in its structure, so difficult in its operations, and so incomplete in its coverage. In fact, the revenue from the ta" as a ratio of ,/* declined after the introduction of $#/7)T. 9urther reform of the e"cise duties came ith the implementation of the recommendations of the T%'. The measures included gradual unification of rates and greater reliance on account( based administration. In 1===R2???, eleven ta" rates ere merged into three, ith a handful of Elu"uryF items sub+ect to an additional non(rebatable ta" (C and 1C percent). The three rates ere merged into a single rate in 2???R?1 to be called a central 7)T ('en7)T), along ith three special additional e"cises of A, 1C, and 2@ percent for a fe commodities. 9urther, the ta" base as idenedN some e"emptions ere replaced by a ta" at A percent. 2ome simplification of the ta" on the small(scale sector as also attempted. 2mall businesses could either ta!e an e"emption or pay ta" at a concessional rate of C? percent of ta" due, ith access to the ta" credit mechanism. This option, ho ever, as ithdra n from the budget of 2??DR?C. 'ontrary to the general patterns seen in lo (income countries, here an over helming proportion of revenues is raised from international trade ta"es, revenue from this source as not very large in the initial years of independent India, largely because imports ere restricted. 4ashwant Sinha 65:::8 harmoni1ed sales ta" rates. 2inha as 4nion 9inance $inister, on 6ovember 1C, 1=== too! an important decision to stop the unhealthy sales ta" Erate arF. .efore introduction of 2tate(level 7)T, uniform floor rates of sales ta" for different
<<

categories of commodities ere implemented ith effect from -anuary 1, 2???. .efore this, the first preliminary discussion on 2tate(level 7)T too! place in a meeting of 'hief $inisters convened by /r. $anmohan 2ingh, the then 4nion 9inance $inister in 1==D. In this meeting, the basic issues on 7)T ere discussed in general terms and this as follo ed up by periodic interactions of 2tate 9inance $inisters. Tas* ,orce 6><<D8 by implementing the 9%.$ )ct removed all cascading ta"es, such as( octroi, central sales ta", state level sales ta"es etc. In -uly 2??@, the )ct came up ith a proposal for an integrated 7)T on goods and services to be levied by the central government and the states in parallel. The Tas! 9orce proposed a Egrand bargainF hereby the states ould have the po er to ta" all services currently ith the center@1, and therefore both central and state government ould e"ercise concurrent but independent +urisdiction over common ta" bases e"tending over all goods and services. The ne goods and services ta" (,2T) ould have three ad valorem rates, in addition to the Tero(rate. The proposed rate structure considers a floor rate, equal to C percent for the centre and @ percent for the states, a standard rate, equal to 12 percent for the center (to replace the 'E67)T of 1C percent) and A percent for the states, and a higher rate, equal to 2? percent for the centre and 1@ percent for the states. %+(+ Pillai 6><<C8 highlighted the 6ano(era that ill present a horrible nightmare to the ta"man. .ecause the normal life e"pectancy ill reach a minimum of 12? years ith the use of molecular medicines and stem cell based advancements ill be another help for the gro th of ne organs. 'ars and personal flying machines ill be the household gadgets by the year 21??.0ith all such facilities, the practice of ta"ing lu"ury consumption of audio and video products ill be part of the history of ta"ation. The author further e"plains the significance of 7)T because after +oining a band of about 12? 7)T operating nations in the orld, the 7)T regime ould also integrate our ta" system ith the ta" payment pattern of more than the B? percent of the orld population. 8ence, a quic! replacement in the shape of this ta" reform can remove the regressive and unfriendly ta"es li!e entry ta", lu"ury ta", turnover ta" single point or multi point ta" sales ta" and so on. S+ D#tt Maj#mdar 6><5>8 stressed on the possibility of rolling out ,2T. )s a 'hairman of 'entral .oard of E"cise and 'ustoms ('.E') hile addressing a M6ational 'onference on ,2TM, he said, MThere as no need for alarm if ,2T as not rolled out in )pril 1, 2?12.M 8e further quoted that in orld over, ,2T rates are typically bet een 1C per cent and 2? per cent. In India, it is li!ely to be the same,M The ta"(rate under the proposed ,2T ould come do n, but the number of assesses ould increase by D(C times. )lthough rates ould come do n, ta" collection ould go up due to increased buoyancy. MacA#arie $A#ities esearch 6><5>8 in its research or! on India pointed out that MIt no loo!s as if sharp criticism has sha!en them (government) out of lethargy.M CA $ atings 6><5>8 in its concluding remar!s in an article on Economic Impacts of Elections pointed out the possible opposition from coalition partners as ell as parties hich are currently providing support from outside, the government ould have to perforce all this and the time involved in getting in the ,2T ill definitely pressuri1e the government in attaining its goal of fiscal consolidation. It ill have to go slo on radical reforms involving any foreign investment also.

<@

In the light of literature revie ed above, it is obvious that the )ct on Indirect Ta" have seen hundreds of amendments through 9inance .ills every year since its inception. /ue to cumbersome nature of Ta" ;a 9orms coupled ith comple" procedure is a serious deterrent to an honest individual in becoming assessee. To reform the indirect ta" regime, the government proposes to introduce a unified ,oods and 2ervices Ta" (,2T). It see!s to bring uniformity in indirect ta" structure across the country by replacing the e"cise duties, services ta", value(added(ta", state surcharges and local levies ith a unified ta" rate. O3.$CT&@$S To study the concept of ,2T .ill and highlight the challenges, problems and threats in the future of advanced technology before ta"man and assessees. To understand the need of above mentioned ta" reforms in India and understanding the obstacles due to political illingness for implementing these bills. $S$A C" M$T"ODO?O%4 To understand the ,2T ta" reforms some press releases have been referred and ebsites have also been visited. ) set of @ questions in an open(ended questionnaire as designed and ans ers ere sought from the 2D 'hartered )ccountants. The common vie s and responses ('7%) given by most of the respondents have been summari1ed belo hich provide the a areness to !no ledge see!ers and suit the common man needs. )lso the need for reform on indirect ta"es has been studied belo . C@ 57 ,oods and 2ervices Ta" (( ,2T (( is a comprehensive ta" levy on manufacture, sale and consumption of goods and services at a national level. Through a ta" credit mechanism, this ta" is collected on value(added goods and services at each stage of sale or purchase in the supply chain. The system allo s the set(off of ,2T paid on the procurement of goods and services against the ,2T hich is payable on the supply of goods or services. 8o ever, the end consumer bears this ta" as he is the last person in the supply chain. E"perts say that ,2T is li!ely to improve ta" collections and boost IndiaLs economic development by brea!ing ta" barriers bet een 2tates and integrating India through a uniform ta" rate. C@ >7 4nder ,2T, the ta"ation burden ill be divided equitably bet een manufacturing and services, through a lo er ta" rate by increasing the ta" base and minimi1ing e"emptions. It is e"pected to help build a transparent and corruption(free ta" administration. ,2T ill be is levied only at the destination point, and not at various points (from manufacturing to retail outlets). 'urrently, a manufacturer needs to pay ta" hen a finished product moves out from a factory, and it is again ta"ed at the retail outlet hen sold. C@ B7 It is estimated that India ill gain U1D billion a year by implementing the ,oods and 2ervices Ta" as it ould promote e"ports, raise employment and boost gro th. It ill divide the ta" burden equitably bet een manufacturing and services. C@ D7 In the ,2T system, both 'entral and 2tate ta"es ill be collected at the point of sale. .oth components (the 'entral and 2tate ,2T) ill be charged on the manufacturing cost. This ill benefit individuals as prices are li!ely to come do n. ;o er prices ill lead to more consumption, thereby helping companies.

<D

-"4 %ST )$$D$D &) &)D&A /ue to the under mentioned structure of Indirect Ta"ation in India there is a need to bring in the ,2T model in India> There are shortcomings in the structure of 7)T at the 'entral and the 2tate level. 2everal 'entral Ta"es such as additional 'ustoms /uty, surcharges etc. do not form part of the 'E67)T chain. *resent system allo s for multiplicity of ta"es. $any areas of services are left unta"ed. Increased compliance and administrative cost "O- %ST -&?? "$?P T"$ %O@$ )M$)T &) T"$ C0 $)T &)D&A) SC$)A &O The 'anadian e"perience is suggestive of the potential benefits to the Indian economy. The ,2T in 'anada replaced the federal manufacturersG sales ta" hich as then levied at the rate of 1< per cent and as similar in design and structure as the 'E67)T in India. It is estimated that this replacement resulted in an increase in potential ,/* by 1.@ per cent, consisting of ?.= per cent increase in national income from higher factor productivity and ?.D per cent increase from a larger capital stoc! (due to elimination of ta" cascading). This means gains of about 42U 1D billion annually. /iscounting these flo s at a modest < per cent per annum, the present value of the ,2T or!s out to about half a trillion dollars. This is indeed a staggering sum and suggests the need for energetic action to usher the ,2T regime at an early date. "O- %ST -&?? "$?P T"$ T AD$ A)D CO)S0M$ The ,2T is intended to usher in a uniform mar!et for goods and services, cut business costs and boost government revenues. )t the moment, a manufacturer ho ishes to move goods from one state to another has to struggle ith a number of different ta"es, as if ta!ing goods across several countries. ,2T ill bring about a change on the ta" firmament by redistributing the burden of ta"ation equitably bet een manufacturing and services. It ill lo er the ta" rate by broadening the ta" base and minimi1ing e"emptions. It ill reduce distortions by completely s itching to the destination principle. It ill foster a common mar!et across the country and reduce compliance costs. It ill facilitate investment decisions being made on purely economic concerns, independent of ta" considerations. It ill promote e"ports. ,2T ill also promote employment. $ost importantly, it ill spur gro th. Ta"es hich cannot be set off ill reduce. )ll India ta" ill be based on value added. 6o value added implies no ta" to be paid to the government. 'reation of a ta" neutral supply chain. Hou follo any routeN the ta" given to the government ill remain the same. Entry ta", #ctroi etc. ill be there, but as is evident, these are also being slo ly removed. This ill ma!e the supply chain perfectly neutral to ta"es.
<C

&) T"$ C0 $)T SC$)A &O T"$ K0$ST&O) &S 7 -"AT &S %ST A?? A3O0T A)D "O- -&?? &T &MPACT A COMMO) MA)M ,2T has been implemented in more than 1@? countries in some form or the other. It is fast gro ing form of indirect ta" even in the )sia *acific region after being introduced in Europe as a part of the ta" landscape for the past D? years. ,2T is a ta" reform !no n as a ma+or tool for faster economic gro th in )siaLs third largest economy. The introduction of ,2T ill be an effort to improve IndiaLs meandering ta" regime in the arena ?f the countryLs first ever nation ide indirect ta", subsidy burden. Typically it is a single rate system but t o&three rate systems are also prevalent depending upon the requirement of the implementing nation. 2tandard ,2T rate in most countries ranges bet een 1D(2?I. )ll sectors are ta"ed ith very fe e"ceptions& e"emptions. 9ull ta" credits on inputs R 1??I set off is allo ed. 2ome goods, namely crude petroleum, diesel, petrol, aviation turbine fuel, natural gas and alcohol are not to come under the purvie of the ,2T. The constitutional amendment bill also see!s to empo er the *resident to set up ithin C? days of the passage of the legislation, a ,2T 'ouncil ith the 4nion 9inance $inister as chairperson and 4nion $inister of 2tate for %evenue and 9inance $inisters of all the states as members. The 9irst /iscussion *aper on ,2T in India as released by the Empo ered 'ommittee of the 2tate 9inance $inisters on 1?.11.2??=. The ,2T 'ouncil is to or! on the basis of consensus and ma!e recommendations on issues li!e ,2T rates, e"emption lists, and threshold limits. 9urther, the bill provides for setting up of a ,2T dispute settlement authority, comprising a chairperson and t o members to resolve disputes arising out of deviations from the recommendations of the ,2T 'ouncil either by the central or state governments. The draft .ill has since been referred to the *arliamentary 'ommittee on 9inance for e"amination. ) strong information technology (IT) infrastructure has been set up in the chairmanship of 6andan 6ile!ani. 4nique Identification )uthority of India (4I/)I) has been established by the government under the Empo ered ,roup (E'). )mong the fe steps that are being ta!en is the conceptuali1ation and design of the ,2T 6et or! (,2T6) ( a common portal for the centre and states. It ill enable electronic processing of the !ey business processes of registration, returns, and payments. The 6ational 2ecurities /epository ;imited (62/;) has been selected as technology partner for incubating the 6ational Information 4tility that ill establish and operate the IT bac!bone for the ,2T. In this regard the 62/; has set up a pilot pro+ect in collaboration ith eleven states prior to its roll(out across the country. The ,2T shall have t o components. #ne levied by the 'entre hich is 'entral ,2T and the other levied by the 2tates hich is 2tate ,2T. The 'entral ,2T and the 2tate ,2T ould be levied on all transactions of goods and services made for consideration e"cept the e"empted goods. The seller or the service provider can claim Input Ta" 'redit (IT') paid on purchases. .ut ho ever 'ross 4tili1ation of IT' bet een ',2T 3 2,2T ould not be allo ed. Threshold limit of %s.1? lacs for goods and services for all the states and 4nion Territories might be adopted. Threshold for 'entral ,2T on goods may be !ept at %s.1.D 'orers and threshold for 'entral ,2T on services should be appropriately high. ) t o rate structure ould be adopted. ;o er rate for necessary items and goods of basic importance ould be
<B

applied hereas a standard rate for goods in general and special rate for precious metals. Each ta"payer ould be allotted a *)6(lin!ed ta"payer identification number of 1<&1D digits. E' has accepted the recommendations and submitted its report to the ,overnment.

($4 O3STAC?$S &) &MP?$M$)TAT&O) O, %ST A)D T"$ PO?&T&CA? -&?? India is a federal republic and the ,2T ill thus be implemented concurrently by the central and state governments as the 'entral ,2T and the 2tate ,2T respectively. ,2T introduction ill affect revenue of most of the states very badly as ,2T ill curtail their po er to ta". 2tates ill have to surrender their po er to ta" the goods and share central ta" and certainly this ill be a very tough bargain for them. 2tates are demanding that they should be given po er to ta" the services also but ill actually lose their po er to ta" even the goods. In the circumstances of gro ing criticism the government has failed to ma!e head ay on the so( called !ey ,oods and 2ervices Ta" (,2T) since its re(election in 2??=. /ue to opposition among some of the 2A states ho fear that they ill lose their fiscal autonomy. The 'ongress government has in the past accused the .-* of stalling the bill for political advantage. #fficials ere already of the vie that the bill ould miss its )pril 1, 2?12 deadline and the same happened. #n the other side, the opposition called the ,overnment and *rime $inister $anmohan 2ingh a lame duc! although many efforts have been made to introduce ta" reforms for the recent bold policy decisions on ease the subsidy burden. In India, 2A states fear that they ill lose their fiscal autonomy. The ma+or hurdle ahead is on the la hich needs to be approved by t o(thirds of parliament and half of IndiaLs states, hence the need for the government to see! support from the opposition. The la is as much in focus for investors and the public because it sho s the difficulties policyma!ers have in simplifying IndiaLs bureaucratic regulatory landscape, a !ey obstacle to economic development. $oreover, ,2T slashes through a ma1e of local ta"es that can be raised or lo ered at ill by states at present, ma!ing life harder for firms navigating in a country of 1.2 billion people ith notorious bureaucratic red tape. )fter going through the history of ma+or events in table 1, no the question arises that hat has happened to this ta" reform and hat ill be its impact on budgetO The reply is presented here as analysis in table 2 and < for the generally as!ed questions regarding the ta" reform. &mpact on eforms Table 2 belo gives the vie of critical economic reform that has to be passed hich ill help to ease the roadbloc!s presently in the ay of economic gro th>( T).;E 2> &mpact on eforms 2.6#. .I;; $)I6 I224E2 '#$$E6T2 0I;; IT 8)**E6O 1. ,2T %educing the comple"ities of forms /ue to differences 7 and implementing a uniform and ill be delayed single ta" system in India ith a consent of states 2ource> 'are %atings on Economic Issues, $arch C, 2?12.
<A

)ote! v! 4es/ N! )o/ M! CanOt say &mpact on 3#dget The impact on the .udget has to be vie ed over t o years leading to the 2?1@ elections. Ta"ation issues ould once again be an issue in the conte"t of the implementation of ,2T given that states could have a differing vie on the acceptability of the ,2T as there could be potentially a loss of revenue for some states. The table < belo gives an impact in current scenario based on issue>( TA3?$ B! &mpact on 3#dget 2.6#. .I;; '#$$E6T2 .4/,ET .4/,ET 9H2?1< 9H 2?1@ 1. ,2T %econciling the stance of the centre and V 7 different states ould ta!e some more time, ho ever, the centre (if 4*)) may come do n strong on its implementation in 9H1@ So#rce! Care atings on economic iss#es/ March G/ ><5>+ )ote! v! 4es/ N! )o/ M ! CanOt say CO)C?0S&O) & S0%%$ST&O)S In 2?11, the cabinet too! a !ey reform initiative that is aimed at idening the ta" net and increasing federal revenues by introducing a ne bill on indirect ta" ith an intention to replace the old system to meet the global needs as ell as the ta" la s needs in the country. The government as illing to implement it from )pril 1, 2?11. .ut due to certain defects and ob+ections raised by the political parties, the same could not be implemented till today. This .ill on ,2T reform had a 11Dth )mendment in 'onstitution hich has been introduced in the ;o! 2abha in $arch, 2?11 to enable *arliament and state legislatures to ma!e la s for levying ,2T on every transaction of supply of goods or services or both. #riginally, the ,2T as planned to be introduced from )pril 1, 2?1?, but it has been delayed because of stiff opposition from the .haratiya -anata *arty (.-*)(ruled states. The direct ta" code (/T') bill and goods and services (,2T) bill may sooner or later be placed before parliament for approval but the representatives in the Indian *arliament should not forget that proposed reforms are of immense importance to boost the governmentLs revenues and economic gro th. ) positive attitude is needed from the t o sides ('ongress and .-*) in moving the stalled ta" reform for ard. )s per the observations of e"perts, the focus of the reforms should be on broadening the ta" base and reducing dependence on direct ta"es. It is imperative to introduce ,2T before /T' implementation to ma!e the later effective. )s an alternative solution, at the most both the ta" reforms can be implemented together. .efore implementing these reforms a fe healthy discussion rounds of revie e"pert committees from all parties should be organi1ed in the social interest as ell as economic interest of the country. To conclude, India needs to bring stability and predictability in its ta" regime so political parties should perform a constructive +ob instead of treating the legislation ( a political football.

<=

$,$ $)C$S 1. /asgupta )sim 5umar, E9irst /iscussion *aper on ,oods and 2ervices Ta" in IndiaG, The Empo ered 'ommittee #f 2tate 9inance $inisters, 6e /elhi, 6ovember 1?, 2??=. 2. /hadda, Hash, E) snea! pea! to ,oods and 2ervice Ta"F , 2?12. <. *illai.,.5., E7at() 0ay #ut of the Indian Ta" $uddleF, -aico *ublishing 8ouse, $umbai, 2??D. 4# 9ull 'overage on .udget 2?12> .udget 2?12, .udget 6e s 2?12. D. http>&&gstindia.com& C. http>&&topcafirms.com&inde".php& hite(paper&1A=(a(, %etrieved on 2epB, 2?12. B. http>&&in.reuters.com&article&2?1?&?A&2B&idI6India(D111122?1??A2B, %etrieved on /ec.?=, 2?11. A. http>&&articles.timesofindia.indiatimes.com&2?12(?<(1C&union( budget&<12??@D<Q1Qgst(council(gst(dispute(settlement(authority(11Dth(amendment, %etrieved on 2ep B,2?12.(%eporting by )bhi+it 6eogy N editing by )listair 2crutton and 2uro+it ,upta) =. http>&& .careratings.com&*ortals&?&'are)dmin&6e s9iles&Economics&Economic I2?ImpactI2?ofI2?Elections(?<(?C(2?12.pdf, %etrieved on /ec.?=, 2?11. APP$)D&E :ues1> /o you !no about the ,oods and 2ervices Ta"O :ues2(/o you !no the benefits of ,2TO :ues<(8o ill it benefit the 'entre and the 2tatesO :ues@ (8o ,2T is advantageous for individuals and companiesO

@?

% &D COMP0T&)%! A COMM$ C&A? "A??MA ( .aideep &nder *a#r Assistant Professor /Swami Satyanand College of Management and Technology/ Amritsar+ jaideep>B5<1gmail+com anpreet Singh Assistant Professor /(halsa College/ Chawinda Devi/ Amritsar+ preetranaBF1yahoo+in A3ST ACT ,rid 'omputing is a ne atmosphere for solving, tric!y problems such as to study the universe or to simulate a roc!et engine. The concept has not only found its place ith in numerous science pro+ects but it is also being used or various commercial applications. /espite all its advantages, there are still features hich have not been developed. 7arious issues related ith grid computing are privacy, security and interoperability. ($4-O DS! ,rid 'omputing, 9eatures, %esources, .enefits, /ra bac!s. &)T OD0CT&O) ,rid computing combines computers from multiple administrative domains to reach a common go to solve a single tas!, and may then disappear +ust as quic!ly. #ne of the main strategies of grid computing is to use middle are to divide and apportion pieces of a program among several computers, sometimes up to many thousands. ,rid computing involves computation in a distributed fashion, hich may also involve the aggregation of large scale cluster computing(based systems. ,rid computing can mean different things to different individuals. The grand vision is often presented as an analogy to po er grids here users or electrical appliances get access to electricity through all soc!ets ith no care or consideration for here or ho the electricity is actually generated. "O- DO$S % &D -O (M The resources li!e or! station, server, soft are, storage etc. )s ell as a set of tools that could be compared to an operating system ma!e up the computing grid. )t the core of the system is an element called resource bro!er hich handle resource supply and demand according to the technical and economic criteria. ) scheduler hich is responsible for distributing resources to the various machines. The security and access are also managed by the grid security infrastructure hich handles the identification of resource solicitor as ell as access authori1ation up to a certain level of grantee. ,$AT0 $S O, % &D COMP0T&)% 1. @irt#ali'ation! 7irtuali1ation means brea!ing hard coded connection bet een provider and consumers of resources. This is done by pooling together individual resources by type and ma!ing them available them to consumers through abstraction.
@1

2. Provisioning! *rovisioning means the system determines ho to meet the specific need of the consumer. 0hen consumer requests resources through the virtuali1ation layer, behind the scenes, specific resources is identified to fulfill the request and then it is allotted to the consumer ith provisioning. $SO0 C$S O, % &D COMP0T&)% ,rid is a collection of machines, some time referred to as nodes, resources, members, donors, clients , hosts, engines, and many other such terms. They all contribute and combination of resources to the grid as a hole. 2ome resources may be used y all users of the grid, hile others may have specific restrictions. COMP0TAT&O) The most common resource is computing cycles provided by the processor of the machine on the grid. The processor can vary in speed, architecture, soft are platform, and other associated factors, such as memory, storage, and connectivity. There are three primary ays to e"ploits the computational resources of grid> The first and simplest is to use it to run and e"isting applications on an available machine on the grid rather than locally. The second is to use an application designed to split its or! in such a ay that the separate parts can e"ecute in parallel on different processors. The third is to run an application that needs to be e"ecuted many times, on many different machines in the grid. 2calability is a measure of ho efficiently the multiple processors on a grid are used. 5+ Storage! The second most common resource used in a grid is data storage. ) grid providing an integrated vie of data storage is sometimes called a data grid. Each machine on the grid usually provides some quantity of storage for grid use, even if temporary. 2torage can be memory, attach to the processor or it can be secondary storage, using hard dis!, drives or others permanent storage media. $emory attach to a processor usually has very fast access but is volatile. It ould best be used to cache data or to serve as temporary storage for running applications. >+ Comm#nication! The rapid gro th in communication capacity among machines t o day ma!es grid computing practical. 'ompare to the limited band idth available hen distributed computing as first emerging. Therefore, it should not be a surprise that another important resource of a grid is a data communication capacity. This includes communication ithin the grid and e"ternal to the grid. B+ Sec#rity! 2ecurity requirements are fundamentals to the grid design. The basic security components are comprised of mechanism for authentication, authori1ation and confidentially of communication bet een grid computers.

@2

0ithout this functionality, the integrity and confidentially of the data processed ithin the grid ould be at ris!. To properly secure your grid environment, there are many different tools and technology available. The follo ing are the security challenge in a grid environment. Integration Interoperability Trust %elationship 3$)$,&TS O, % &D COMP0T&)% The potential for massive parallel '*4 is one of the most attractive features of grid computing. ) '*4 intensive grid application can be thought of as many smaller sub +obs, each e"ecuting on a different machine in the grid. It ma!es the application more scalable. 1. The additional resources other than '*4 and storage can be provided. 9or e.g.. If a user needs to increase their band idth of the internet to implement a data mining search engine, the or! can be split among grid machine that have independent connection to the internet. 2. In grid computing e can use ideal resources in a efficient ay. -obs can be farmed out to ideal servers or even ideal des!tops. $any of these resources sit ideal especially during the off hours business policies can be n a place that provide +obs to only go to servers that are lightly loaded or have the appropriate amount of memory or '*4 characteristics for the particular application. <. -obs can be e"ecuted in parallels speeding performance. ,rid environments are e"tremely very ell useful to run useful +obs that can be divided into smaller chun!s and run co=ncurrently on many nodes. @. ,rid management soft are automatically re(submits +obs to other machines on the grid hen a failure is detected. To improve reliability, multiple copies of important +obs can be run on different machines throughout the grid. D&SAD@A)TA%$ O, % &D COMP0T&)% 1. The '*4 and local storage areas do not have high speed connections. 2. 'omputers hich actually perform calculations might not be trust orthy. <. /ue to the lac! of central control over the hard are there is no ay to guaranty that nodes ill not drop out of the net or! at random times. CO)C?0S&O) )t the end e can say that grid computing is a cooperation of different computers, for a specific tas!, so that the users acquire the better performance for the specific tas!. )ll computing technologies have their o n place so grid system has a secure future. The developer is doing more effort to reduce cost of grid computing and to ma!e them more secure must be increased.

@<

$,$ $)C$S 1. )rtificial Intelligence ,roup publications J)rtificial Intelligence %esearch ,roupK. It is retrieved on -uly 2=, 2?1?. 2. $ar! .a!er, %a+!umar .unya and /an 8yde, 'luster 'omputing> ) 8igh( *erformance 'ontender, IEEE 'omputer, -uly 1===. <. 9oster, 3 '.5esselman, 'omputational ,rids. $organGs 5aufmann, 1==A.

@@

ASP +)$T! A D4)AM&C APP OAC" ,O -$3 D$@$?OP$ 3alram Singh 4adav Assistant Professor/DA@ College/ Amritsar balramD<CG1gmail+com A3ST ACT In this paper, e have study the ho the compilation process is done on .net technology. In asp.net e have t o type of application can be developed one is *ro+ect and other is ebsite. *ro+ects are des!top application and ebsite are the online eb based application hich run over the internet. ) .6ET application is a set of assemblies developed or reused by programmers, and tested together for correctness and performance. Each assemblyGs references to other assemblies are type(chec!ed at compile(time and embedded into the e"ecutable image, from here they guide the dynamic lin!ing process. &)T OD0CT&O) International efforts to develop a global frame or! to use soft are resources have in -ava and .6ET their most ell(!no n e"ponents. .6ET is an emerging $icrosoftGs pro+ect hich promotes a ne frame or! for 2oft are /evelopment emphasi1ing the use of Internet resources and the interaction bet een components ritten in different programming languages. 0ithin the .6ET platform e can integrate already e"isting technologies and products as ell as ne elements. The V$; pro+ect promoted by the 000 consortium1 is also related to this effort through the use of V$; to document programs in .6ET, the support of 0eb services based on V$;, etc. 0ith an Integrated development Environment (I/E) li!e 7isual 2tudio. 6ET, this is pretty simple. .6ET is an emerging $icrosoftGs pro+ect hich promotes a ne frame or! for 2oft are /evelopment emphasi1ing the use of Internet resources and the interaction bet een components ritten in different programming languages. 0e sho ho to integrate soft are components developed in a functional language ith (graphic) components developed in 'W or another .6ET language. To achieve our ob+ective e use the facilities offered by .6ET to import '#$ components.

COMP&?&)% A)D D$P?O4&)% ASP+)$T APP?&CAT&O)S There are t o type of )2*.6et pro+ects types, the compilation process and finally ho to deploy )2*.6et applications to a local and remote server. .efore e begin e"plaining the mechanism behind compiling )2*.6et pro+ects e should tal! about the different options&pro+ect types e can create ith )2*.6et frame or!. )2*.6et frame or! supports t o different types of pro+ects. 0e have -eb site projects 0ith this option e are allo ed to or! directly ith folders. 0e point 7isual 2tudio to a folder and open it up, the same ay e could open it using indo s
@D

e"plorer. )ll the files in that folder ill sho in the Sol#tions $Hplorer indo . The ay e create this type of pro+ect e launch 7isual 2tudio and then go to ,ile 7P )ew -eb Site. This type of pro+ect as introduced in 72 2??D and the purpose as to provide some ne fle"ibility in creating and or!ing ith ebsites. There is no collective file li!e+vbproj/+csproj e"tension that !eeps trac! of all the individual files in the ebsite. This ma!es it very easy to create copies of the site, move them and share them ith others because there are no dependencies ith files on your local system. 8o ever, it is very difficult to or! ith so#rce control systems. -eb application projects 0ith that option the eb application is managed as a pro+ect ith a single pro+ect file that !eeps trac! of all the content of the eb application. It is easier for developers ho or! in teams or those ho need more control over the contents of the site and its compilation and deployment process. The ay e create this type of pro+ect e launch 7isual 2tudio and then go to ,ile 7P )ew Project 7PASP+)et -eb Application+ If you open the eb application in a indo s e"plorer indo you ill see a +sln file. This is a special file that is more of a container that contains several pro+ects, li!e a eb service pro+ect, a eb application pro+ect. If you bro se through the indo s folder that is your eb application you ill see another file, a +csproj file.If you open this file, you ill see lin!s to all the files of your eb application. 0hen I build 0eb sites I al ays choose to create my application as a -eb Application Project rather than the -eb Site Project type.

,ig 5 ;etLs e"plain hat happens hen a eb application or eb site pro+ect compiles. 0ell, e do rite our )2*.6et applications in 7..6et or 'W. .oth those languages are compiled languages. If you build an )2*.6et application or website project the code e rite ill eventually gets compiled so it can be e"ecuted. 2o e have our source code files, +cs or +vbfiles. Those are created automatically hen e add eb forms to our application. Then those files are compiled ith the appropriate compiler. 0hen using 7isual 2tudio to compile our applications, 7isual studio ill launch the appropriate compiler because it !no s the .6et language e used for implementing that particular eb
@C

application&site. The end result of this compilation is ot nativeIbinary code. It is something else that is called &? or MS&?.$2I; contains code and metadata. The very first time e access a ebsite, e do notice some sort of delay. That is because the ';% of .6et ta!es the $2I; code and runs it through a .&T Compiler (or -itter) to create native code. )ll the subsequent requests ill be serviced very fast. That is something that is happening in the "black box" that is the managed code and the 'ommon ;anguage %untime.

,ig > ,ive your eb application a suitable name. 0hen you press 9D or run your application in any ay, e ill have a b#ild first and e ill get a .dll.The hole compilation process ta!es place, as it as e"plained previously.

,ig B Asp+net ajaH! s#pport for responsive browser applications 0eb bro sers are the most popular user interface for ne applications. 2till, theyGve traditionally suffered from a significant limitation> Each ne request from a user requires a round(trip to the 0eb server, commonly resulting in loading a ne page. ) more intelligent Xand fasterXapproach ould be to access data in the bac!ground henever possible, then update only those parts of the page that change. 4sers ould see much more responsive applications, since they ould spend less time aiting for ne pages to be loaded. This is e"actly hatGs done by the )-)V approach to building 0eb applications. %ather than load a ne page for each user request, the bro ser asynchronously requests data in advance. The code that ma!es this request is typically ritten in -ava2cript, and the data is often (although not al ays) formatted in V$;. These three characteristicsX)synchronous

@B

CO)C?0S&O) #verall, the ne .6ET platform has a lot to offer the soft are developer, including an ecumenical type system, better type information, and an efficient compilation model, all of hich truly tighten up the boundaries bet een components. Ta!ing charge of all these great features is )2*.6ET, hich ill most li!ely be .6ETLs M5iller )pp.M )s e mentioned during our discussion of people(oriented soft are, the future of computing ill undoubtedly involve getting machines to tal! to one another over the Internet. The Internet is a ubiquitous net or! to hich scores of people have access. 4ntil no , there has not really been a ay to use the Internet as a soft are platform. 8o ever, the technology is no in place to ma!e that happen, and )2*.6ET ma!es it that much easier to manage 0eb programming. )2*.6ET !eeps all the good features of classic )2* (in process performance, a ell(established synta", the ability to add e"ecutable bloc!s to your 0eb page) and improves on them (e.g., by providing a more granular 8TT* request handling model, providing a compilation model for 0eb pages, and organi1ing the parts of a 0eb page into classes and ma!ing those classes available through the ';% type system). )2*.6ET ill undoubtedly be the tool of choice for most 0eb developers for the ne"t five to ten years. $,$ $)C$S 1. http>&& eblogs.asp.net&dotnetstories&archive&2?11&?A&21&compiling(and(deploying(asp( net(applications.asp" 2. . <schools.com <. msdn.microsoft.com&en( us&library&=!C!<!@a(vPvs.A?).asp" @. http>&& .codepro+ect.com&)rticles&<A=?B&)2*(6ET(;ocali1ation(:uic!(%eference D. http>&&dotnet.1cu.c1&6ETQ2??C&*apersQ2??C&Y*roceedingsQ2hortQ*apersQ2??C.pdf C. $ac/onald, $., $icrosoft .6ET /istributed )pplications> Integrating V$;0eb 2ervices and .6ET %emoting. $icrosoft *ress, 2??<. B. 2pac!man, /., 2pea!er, $., Enterprise Integration 2olutions. $icrosoft *ress, 2??D. A. 6ilsson, -., .6ET Enterprise /esign ith 7isual .asic .6ET and 2:; 2erver. 2ams *ublishing, 2??2. =. E"stensible $ar!up ;anguage 1.? (2econd Edition). 0<' %ecommendation, #ctober C, 2???. 1?. http>&& .dotgnu.org.

@A

3?0$.AC(&)%7 C?O-)&)% T$C")&K0$ T" O0%" MO3&?$ )eelam Assistant Professor/ SSCMT/ Amritsar neelamsodhi<:1gmail+com #pinder (a#r Assistant Professor/ SSCMT/ Amritsar r#pinder+asr1gmail+com A3ST ACT .lue+ac!ing is misconcepted ith hi+ac!ing but it is +ust a pran! played through mobile ith the help of .luetooth Technology. It do not malfunction the device or information stored. 4ser can perform .lue+ac!ing by sending 7'ard in hich message is ritten in the place of name field, to the other .luetooth enabled device hich is in the range and is searchable. It is successfully used for mar!eting purpose as it is location based Technology. It can be used for sending te"t, voice, pictures via #.EV *rotocol. The only harm through .lue+ac!ing is that the .lue+ac!er can send malicious matter to receiver ho is un!no n to the .lue+ac!er. #nly $odel number and phone name of .lue+ac!er is visible to user. #ne can secure its device from these un anted messages by ma!ing their .luetooth off as soon as their .luetooth related or! is over. ($4-O DS! .luetooth Technology, *iconet Topology, #.EV *rotocol, 2ecurity. &)T OD0CT&O) TO 3?0$.AC(&)% In todayGs hi(tech orld, $obile phones are ubiquitous in social situations as users carry them around as they move through different geographical locations. $obile phones are not only used as a channel for mediated communication but it has been gradually ta!en up in many ays. )s e all are familiar ith the term .luetooth, hich is embedded in different electronic devices li!e mobile phones, *'Gs etc., is used for e"changing information. )nother feature of .luetooth technology is .lue+ac!ing. 3l#ejac*ing is the sending of gratuitous messages over .luetooth to .luetooth(enabled devices such as mobile phones, *)/Gs or laptop computers using the #.EV protocol. .lue+ac!ing also used to send business cards (v'ard that typically contains a message in the name field) to another .luetooth enabled devices anonymously using .luetooth ireless technology. .lue+ac!ing does not harm the receiverGs device data. It is +ust a pran! performed using .luetooth. *hone o ner ho receive blue+ac! message should refuse to add the contents to their address boo!. In order to carry out a blue+ac!ing, the sending and receiving devices must be ithin the range of 1? meters in case of mobile phones and 1?? meters for laptops ith po erful transmitters. O &%&) .lue+ac!ing as ostensibly first conducted by a $alaysian IT consultant S)+ac!G, ho used his .luetooth(enabled phone to publici1e 2ony Ericsson. 8e also formulates the name, hich is a merger of .luetooth and hi+ac!ing. 0hile standing in a ban! queue, )+ac! turned on his
@=

.luetooth, discovered a 6o!ia BCD? in the domain, created a ne contact ith S.uy EricssonYL as the first name, and sent that business card to the 6o!ia phone. The recipient of the 6o!ia phone standing a fe feet a ay from him as surprised to see such an SadvertisementG. )+ac! posted this story on 2ony Ericsson forum and other people started trying it out. .lue+ac!ing has become a rage among the young people ho are !een to play practical +o!es. ) 1<(year( old girl named Ellie from 2urrey, 45 has created a ebsite called Sblue+ac!qG here people can share their blue+ac!ing e"periences. J1K 3?0$TOOT" T$C")O?O%4 .luetooth Technology is used in .lue+ac!ing technique. It is an open ireless technology that uses a pac!et(based protocol ith a master(slave structure. It uses short(range frequency( hopping radio lin!s, intended to replace the cable(s) connecting portable and&or fi"ed electronic devices. .luetooth radio modules operate in the unlicensed Industrial, scientific and medical(I2$) band at 2.@ to 2.@AD ,81. It avoid interference from other signals by hopping to a ne frequency after transmitting or receiving a pac!et by using 9requency 8op 2pread 2pectrum (9822) at a normal rate of 1C??hops&sec. .luetooth differs from other ireless standards such as 0i(9i. .luetooth standard gives both lin! layer and application layer definitions hich support data and voice applications. It *rovides full duple" property and handle both data and voice transmission simultaneously. .luetooth description can be divided into t o sections, the .luetooth 2pecification and .luetooth *rofiles. The .luetooth 2pecification describes ho the technology or!s (i.e. .luetooth protocol architecture), The *rofiles describe ho the technology is used (i.e. ho different parts of the specification can be used to fulfill a desired function for a .luetooth device) 58 3l#ejac*ing Specification Architect#re Overview! The .luetooth specification as developed as a cable replacement. This paper provides a brief description of architecture of .luetooth.
Applications and Profiles OBEX S P RFCOMM L2CAP !C" Link Manager Baseband/Link Controller Radio

D?

,ig5> 3l#etooth Architect#re adio layer! It defines the requirements for a .luetooth transceiver operating in the 2.@ ,81 I2$ band. 3l#etooth 3aseband! The .aseband layer describes the specification of the .luetooth ;in! 'ontroller (;'), hich carries out the baseband protocols and other lo (level lin! routines. The baseband also manages asynchronous and synchronous lin!s, handles pac!ets, does paging, and inquiry to access and inquire .luetooth devices in the area. The .aseband is the physical layer of the .luetooth. ?MP! The ;in! $anager *rotocol (;$*) is used by the ;in! $anagers (on either side) for lin! set(up and control of logical transports and logical lin!s and for control of *hysical lin!s. "C&! The 8ost 'ontroller Interface (8'I) provides a command interface to the .aseband ;in! 'ontroller and ;in! $anager, and access to hard are status and control registers. The 8'I e"ists across < sections, the 8ost ( Transport ;ayer ( 8ost 'ontroller. Each of the sections has a different role to play in the 8'I system. ?>CAP! ;ogical ;in! 'ontrol and )daptation *rotocol (;2')*) supports higher level protocol multiple"ing, pac!et segmentation and reassembly of pac!ets, and providing the quality of service (:o2) related Information. ,COMM! The %adio frequency communications (%9'#$$) protocol provides emulation of serial ports over the ;2')* protocol. It provides a simple reliable data stream to the user, similar to T'*. It is used as a transport layer for #.EV (#b+ect E"change) over .luetooth. SDP! The 2ervice /iscovery *rotocol (2/*) provides a means for applications to discover hich services are provided by or available through a .luetooth device. It also allo s applications to determine the characteristics of those available services ith the help of 4niversally 4nique Identifier (44I/). J2K O3$E! #b+ect E"change *rotocol is a communications protocol that facilitates the e"change of binary ob+ects bet een devices. The #.EV protocol is optimi1ed for ad(hoc ireless lin!s and can be e"change all sorts of ob+ects li!e pictures, files, calendar entries and business cards. ;i!e 8TT*, it is provides the client ith a reliable transport for connecting to a server and may then request or provide ob+ects. J<K The .luetooth architecture is based on a master&slave model. In this model any .luetooth enabled device act as either the master or the slave in its particular net or!. ) single master device can be connected up to seven different slave devices. Piconet Topology! T o or more radio devices together form ad(hoc net or!s called *iconet. )ny slave device in the *iconet can only be connected to a single master. The master coordinates communication throughout the *iconet. It can send data to any of its slaves and request data from them as ell. 2laves are only allo ed to transmit to and receive from their master. #nce the master&slave relationship is established, the direction of control is unidirectional i.e. control is al ays from the master to the slave(s) and they canGt tal! to other slaves in the piconet. 2laves ithin a piconet must also synchroni1e their internal cloc!s and frequency hops ith that of the master. Each piconet uses a different frequency hopping sequence. %adio devices used Time /ivision $ultiple"ing (T/$). ) master device in a piconet transmits on even numbered slots and the slaves
D1

may

transmit

on

odd

numbered

slots.

,ig >!3l#etooth Scatternet 9;= $ultiple piconets ith overlapping coverage areas form a Scatternet. Each piconet may have only one master, but slaves may participate in different piconets on a time(division multiple" basis. ) device may be a master in one piconet and a slave in another or a slave in more than one piconet.J@K

>8

3l#etooth Profiles .luetooth profiles are developed to define the or!ing of .luetooth Technology. It provides the additional protocols that build upon the basic .luetooth standard to more clearly define hat !ind of data a .luetooth module is transmitting. The specific applications describe a number of scenarios here .luetooth performs the radio transmission. ) profile can be described as a vertical slice through the protocol stac!. It defines options in each protocol that are mandatory for the profile. It also defines parameter ranges for each protocol. The profile concept is used to decrease the ris! of interoperability problems bet een different manufacturersL products. ) ne profile can be built on e"isting ones, allo ing efficient reuse of e"isting protocols and procedures.

3?0$.AC(&)% STAT$S 2ince the .luetooth Technology or!s behind the .lue+ac!ing Technique, the follo ing three progressive states are involved in a multi(step process of creating a .luetooth 'onnection bet een t o devices> 1. &nA#iry! #ne must run the inquiry in order to discover the other .luetooth devices. If any device is listening for a request ill respond ith its address, and possibly its name and other information. 2. Paging 6Connecting8! *aging is the process of establishing a connection bet een t o .luetooth devices. Each device needs to !no the address of the other device (found in the inquiry process), before this connection can be commenced.

D2

<. Connection> )fter a device has completed the above paging process, it moves to the connection state. Either hile connected, a device can be actively participating or it can be put into a lo po er sleep mode. Active Mode! It is the regular connected mode, here the device is actively transmitting or receiving data. Sniff Mode> It is a po er(saving mode, here the device is less active. ItGll sleep and only listen for transmissions at a set interval (e.g. every 1??ms). "old Mode> 8old mode is a temporary, po er(saving mode here a device sleeps for a defined period and then returns bac! to active mode hen that interval has passed. The master can command a slave device to hold. Par* Mode > *ar! is the deepest of sleep modes. ) master can command a slave to Epar!F, and that slave ill become inactive until the master tells it to a!e bac! up.JDK 3?0$.AC(&)% 0SA%$ .lue+ac!ing can be used for various purposes and in many fields. /ue to its ireless nature and .luetooth communication channel it can be used in location based purpose and in advertising purpose. It can also be used in busy shopping center, train station, cinema, streets etc. It can be used to communicate bet een consumer and producer to share contents such as te"t, images and internet references. 'ertain brands have already created multimedia content that has been very rapidly circulated around using blue+ac!ing technology. Thus .lue+ac!ing has replaced the conventional advertising via standardi1ed broadcasting medium. J1K 3?0$.AC(&)% S$C0 &T4 2ince it is used for sending unsought messages so it can also be e"ploited for mal are propagation. The term .lue+ac!ing has a strong insinuation of hi+ac!ing a .luetooth device, hich is incorrect. %ather than hac!ing a .luetooth enabled device, .lue+ac!ing is being used for sending messages and for ,uerrilla mar!eting purposes, hich the recipient can delete, ignore or read. )ccording to some published reports, it can be doubted hether the .lue+ac!ing is a successful mar!eting strategy, as many users tend to thin! that something is rong ith their electronic device hen they receive an un anted message. It may be able to transmit Tro+an viruses also. #ne can ma!e their phones secure by using the follo ing measure to avoid being blue+ac!ed. 1. 2et your devices in non(discoverable mode if it is not needed. 2. /o 6ot *ublish the *hone number at any eb site. <. 'hange phoneGs security settings to prevent spam messages. @. 4se licensed spam bloc!er application. CO)C?0S&O) .lue+ac!ing is an act of playing a pran! on someone using .luetooth Technology unless or until .lue+ac!er send some malicious data to receiver. This technique does not harm the
D<

device in any ay. 0ith little bit of a areness and attentiveness one can avoid it. This paper covers all the aspects of .lue+ac!ing Techniques including the .luetooth Technology hich or!s behind it. $,$ $)C$S 1. .lue+ac!ing Technology> #vervie , 5ey 'hallenges and Initial %esearch , %ati!a .ali 2. http>&& .palo ireless.com&infotooth&tutorial.aspW2pecificationI2?TableI2?#f I2?'ontents> <. http>&&en. i!ipedia.org& i!i&#.+ectQEVchange @. http>&& .tutorial(reports.com& ireless&bluetooth&architecture.php D. https>&&learn.spar!fun.com&tutorials&bluetooth(basics&ho (bluetooth( or!s C. http>&&o s.edb.ute"as.edu&sites&default&files&users&nqamar&2catternet.-*,

D@

P$ C$PT O) A?%O &T"M! A )$0 A? )$T-O ( T$C")&K0$ $ +S#nny Th#*ral/ Assistant Professor/DA@ College/ Amritsar s#nny2th#*ral1yahoo+co+in A3ST ACT *erceptron algorithm deals ith a single layer neural approach for the classification of the data. It is based upon supervised learning algorithms hich are applicable hen the desired result is !no n for the samples in the training data. It consists of only layer of multiple nodes at hich computation is performed ith one node to another in the samples hich can be used randomly in the algorithm. The main limitation of this algorithm is that it canGt or! for multilayer neural net or!. 2o, it or!s for the separation of samples that e are using in the algorithm. These are t o types of separation used in mathematics> ;inear separable, 6on( linear separable. 0e can separate the data by using combinational circuits in electronics such that it can be easily separated as a group of input samples. 2ingle layer neural net or! are the net or!s in hich the output unit is independent of other i.e. each eight affects only one input. The perceptron learning rule is a method for finding the eights in a net or!. 0e consider the problem of supervised learning for classification although other types of problems can also be solved. ) nice feature of the perceptron learning rule is that if there e"ists a set of eights that solve the problem, then the perceptron ill find these eights. This is true for either binary or bipolar representations. )n important possibility is offered by the poc!et algorithm it runs *erceptron learning iteratively and holds the eight vector hich has remained unchanged for the greatest number of iterations in memory. &)T OD0CT&O) The field of neural net or!s can be thought of as being related to artificial intelligence, machine learning, parallel processing, statistics, and other fields J1K. The attraction of neural net or!s is that they are best suited to solving the problems that are the most difficult to solve by traditional computational methods. 'onsider an image processing tas! such as recogni1ing an everyday ob+ect pro+ected against a bac!ground of other ob+ects. This is a tas! that even a small childLs brain can solve in a fe tenths of a second. .ut building a conventional serial machine to perform as ell is incredibly comple". 8o ever, that same child might 6#T be capable of calculating 2Z2P@, hile the serial machine solves it in a fe nanoseconds. ) fundamental difference bet een the image recognition problem and the addition problem is that the former is best solved in a parallel fashion, hile simple mathematics is best done serially. 6eurobiologists believe that the brain is similar to a massively parallel analog computer, containing about 1?[1? simple processors hich each require a fe milliseconds to respond to input. 0ith neural net or! technology, e can use parallel processing methods to solve some real( orld problems here it is very difficult to define a conventional algorithm. If e consider the human brain to be the LultimateL neural net or!, then ideally e ould
DD

li!e to build a device hich imitates the brainLs functions. 8o ever, because of limits in our technology, e must settle for a much simpler design J2K. The obvious approach is to design a small electronic device hich has a transfer function similar to a biological neuron, and then connect each neuron to many other neurons, using %;' net or!s to imitate the dendrites, a"ons, and synapses. This type of electronic model is still rather comple" to implement, and e may have difficulty LteachingL the net or! to do anything useful. 9urther constraints are needed to ma!e the design more manageable. 9irst, e change the connectivity bet een the neurons so that they are in distinct layers, such that each neuron in one layer is connected to every neuron in the ne"t layer. 9urther, e define that signals flo only in one direction across the net or!, and e simplify the neuron and synapse design to behave as analog comparators being driven by the other neurons through simple resistors. 0e no have a feed(for ard neural net or! model that may actually be practical to build and use. )$0 A? )$T-O ( APP OAC" ) single(layer net or! has severe restrictions> the class of tas!s that can be accomplished is very limited. In this chapter e ill focus on feed(for ard net or!s ith layers of processing units. $ins!y and *apert ($ins!y 3 *apert, 1=C=) sho ed in 1=C= that a t o layer feed(for ard net or! can overcome many restrictions, but did not present a solution to the problem of ho to ad+ust the eights from input to hidden units. )n ans er to this question as presented by %umelhart, 8inton and 0illiams in 1=AC (%umelhart, 8inton, 3 0illiams, 1=AC), and similar solutions appeared to have been published earlier (0erbos, 1=B@N *ar!er, 1=ADN 'un, 1=AD)J1K. The central idea behind this solution is that the errors for the units of the hidden layer are determined by bac!(propagating the errors of the units of the output layer. 9or this reason the method is often called the bac!(propagation learning rule. .ac!(propagation can also be considered as a generali1ation of the delta rule for non(linear activation functions1 and multilayer net or!s. P$ C$PT O) A?%O &T"M Perceptron algorithm deals ith a single layer neural approach for the classification of the data. It is based upon supervised learning algorithms hich are applicable hen the desired result is !no n for the samples in the training data. It consists of only layer of multiple nodes at hich computation is performed ith one node to another in the samples hich can be used randomly in the algorithm. The main limitation of this algorithm is that it canGt or! for multilayer neural net or!J<K. 2o, it or!s for the separation of samples that e are using in the algorithm. These are t o types of separation used in mathematics ?&)$A S$PA A3?$ &) P$ C$PT O) A?%O &T"M 0e can separate the data by using combinational circuits in electronics such that it can be easily separated as a group of input samples. 2ingle layer neural net or! are the net or!s in

DC

hich the output unit is independent of other i.e. each eight affects only one input. 4sing *erceptron net or!, it is possible to achieve linear separable by using )6/ and #% gate. A)D %AT$ S$PA AT&O) If there are t o input I1 3 I2 and then the possible outcomes using minimum function bet een t o inputs.
$2 1

hich can separate the data by

$1 & 1

,ig 5! And %ate Separation 9rom the above truth table, it is very clear that the 1st three values produce an output 1ero, here as combination of 1, produce an output 1.2o, e can separate ? 3 1 by using graphical technique for the separation. O %AT$ S$PA AT&O) #% ,)TE is a gate hich is based upon the ma"imum value bet een t o inputs.

$2 1

$1 1

,ig >! Or %ate Separation

DB

In the similar fashion e can separate the data because of different output produced according to the inputs. )O)7?&)$A S$PA A3&?&T4 In this technique, *erceptron algorithm fails for the separation of data. In case of non linear structure, the separation is on one side hich canGt be recogni1ed by the e"pert system .0e $2 can prove it by V#% gate.

$1

&

()Z.)GP)G.Z).G ,ig B! epresent )on Seperable )at#re Through V#% gate, e canGt separate it by using a linear structure because the outer edge (?,?) and (1,1) produce an output ? hich is totally differ from intermediate value. .ut according to non(linear structure, e can separate it by t o values 1ero on one side on other side for separation. 8ence, *erceptron algorithm ill not apply on the non(linear separation. A?%O &T"M Initiali1e all the inputs that are input vectors li!e "1, "2, "<\\\\.."n 2et ]P?.1 and !P1. 2tart ith randomly chosen eight ? and 1. 'alculate 1"1Z ? %epeat 2tep hile 1"1Z ?^ ? then> 4pdate their eights>( 1P 1Z]" ? P ?Z]" ! P!Z1 2et their eights as an output ? and E"it

1.

&MP?$M$)TAT&O)
DA

The perceptron program implements the perceptron process +ust described. 6et or!s are assumed to be feed for ard only, ith no recurrence. The net or! is specified in terms of a set of pools of units J2K. .y convention, pool contains the single bias unit, hich is al ays on. 2ubsequent pools are declared in an order that corresponds to the feed(for ard structure of the net or!. 2ince activations at later layers depend on the activations at earlier layers, the activations of units must be processed in correct order, and therefore the order of specification of pools of units is important. Indeed, since deltas at each layer depend on the delta terms from the layers further for ard, the bac! ard pass must also be carried out in the correct order. Each pool has a type> it can be an input pool, an output pool, or a hidden pool. There can be more than one input pool and more than one output pool and there can be ? or more hidden pools. Input pools must all be specified before any other pools and all hidden pools must be specified before any output pools. 'onnections among units are specified by pro+ections. *ro+ections may be from any pool to any higher numbered poolN since the bias pool is pool(1) it may pro+ect to any other pool, although bias pro+ections to input pools ill have no effect since activations of input units are clamped to the value specified by the e"ternal input. *ro+ections from a layer to itself are not allo ed. 0eights in a pro+ection can be constrained to be positive or negative. These constraints are imposed both at initiali1ation and after each time the eights are incremented during processing. T o other constraints are imposed only hen eights are initiali1edN these constraints specify either a fi"ed value to hich the eight is initiali1ed, or a random value. 9or eights that are random, if they are constrained to be positive, they are initiali1ed to a value bet een ? and the value of a parameter called rangeN if the eights are constrained to be negative, the initiali1ation value is bet een (wrange and ?N other ise, the initiali1ation value is bet een wrange&2 and -wrange&2. 0eights that are constrained to a fi"ed value are initiali1ed to that valueJ<K. The program also allo s the user to set an individual learning rate for each pro+ection via a layer( specific lrate parameter. If the value of this layer(specific lrate is unspecified, the net or!( ide lrate variable is used. The perceptron program also ma!es use of a list of pattern pairs, each pair consisting of a name, an input pattern, and a target pattern. The number of elements in the input pattern should be equal to the total number of units summed across all input pools. 2imilarly, the number of elements of the target pattern should be equal to the total number of output units summed across all output poolsJ2K. *rocessing of a single pattern occurs as follo s> ) pattern pair is chosen, and the pattern of activation specified by the input pattern is clamped on the input unitsN that is, their activations are set to hatever numerical values are specified in the input pattern. These are typically ?Gs and 1Gs but may ta!e any real value. 6e"t, activations are computed. 9or each non input pool, the net inputs to each unit are computed and then the activations of the units are set. CO)C?0S&O) In summary, a neural net or! is presented ith a pattern on its input nodes, and the net or! produces an output pattern based on its learning algorithm during the training phase. #nce trained, the neural net or! can be applied to classify ne input patterns. This ma!es neural net or!s suitable for the analysis of gene e"pression patterns, prediction of protein structure, and other related processes in bioinformatics. )fter completing several
D=

simulations for predicting several stoc!s based on the past historical data using fu11y neural net or! ith the .ac!(*ropagation learning algorithm, it is conclusive that the average error for simulations using lots of data is smaller than that using less amount of data. The value of " is so ta!en that iteration becomes less repetitive. i.e. 0e ill ta!e larger values of " as compared to smaller values. )ccording to different users, it may produce the same value but totally mismatch of iterations because of randomly chosen value of input neurons. #ne possibility for future or! is to update the system, so that it can read the past stoc! data automatically from the eb. In this ay the system ill become Internet ready for predicting any stoc! mar!et and is ready at any time. )nother possibility for future or! is to update the system, hich can allo trading the stoc!, hich means users can manage to buy and sell the stoc! after seeing the prediction values from this system. In this ay the system can eventually become Internet ready to be used any here in the orld at any time. It is also possible to ma!e the fu11y neural 0eb(based stoc! prediction system as a commercial application by updating such that it gives more user(friendly functionality and by giving more valuable information to the users on palm machine. $,$ 1. 2. <. $)C$S .en 5rose , *atric! 7en /er 2magtN .)n introduction to 6eural net or!s.. .irgul Egeli, $eltem #1turan, .ertan .adur. 2toc! $ar!et. %obert -. 7an Eyden ,The Application of Neural Networks.

C?

A C &T&CA? A)A?4S&S O, O)?&)$ MA ($T&)% M$D&A 0rvashi )ir#la Assistant Professor/ Swami Satyanand College of Management &Technology+ nir#la+#rvashi1gmail+com (omal Assistant Professor/ Swami Satyanand College of Management &Technology+ *omalasr><* 1gmail+com A3ST ACT Internet or the 0orld 0ide 0eb is e"panding e"ponentially and millions of users are accessing it on a daily basis. It thus serves as a very lucrative media for the businesses to mar!et their offerings on the online channels in order to target potential customers and interact ith the e"isting ones. This paper is focussed on conducting a critical analysis of the various online mar!eting media, highlighting their advantages and disadvantages from an organisationGs point of vie . &)T OD0CT&O) #nline mar!eting, also !no n as Internet $ar!eting, is the mar!eting of products or services over the internet. It ties together the creative and technical aspects of internet including design, development, advertising and sales. It uses the Internet to deliver promotional mar!eting messages to consumers. In other ords, companies selling goods and services directly to consumers as ell as those ho operate on a business(to(business model use online mar!eting. The internet has drastically altered the ay in hich information is shared, and has a profound impact on mar!eting. Internet mar!eting has no become an important piece for any companyGs mar!eting mi". There are fe mar!eting options ith the speed, efficiency and reach as this medium. )nd so a business should ensure that they are focusing sufficiently on their online mar!eting strategies for ma"imi1ing their revenue and gro th returns.J1K 3 &$, "&STO 4 The invention of computers dates bac! to 1=<C, hen the first electrical binary programmable computer called the EElectronic 6umerator, Integrator, )naly1er, and 'omputerF as created by ,ermanyLs 5onrad Tuse. 0ith further development in electronics, in the year 1=D<, I.$ is believed to have developed E)cornF R the mother of the modern day computers. The internet as developed by a group of researchers and scientists or!ing at the )dvanced %esearch *ro+ects )gency ()%*)), 42). #n the #ctober 2=, 1=C=, computers at 2tanford and 4';) connected for the first time using the net or! then called )%*)6ET. J2K The )%*)6ET in particular led to the development of protocols for internet or!ing, in hich multiple separate net or!s could be +oined together into a net or! of net or!s. Though its original design as for resource sharing, )%*)(6ET quic!ly demonstrated its utility as a message system. 2oon researchers understood ho useful the net or! can be for
C1

the transmission of communication. In 1=A<, a mere D?? computer hosts ere connected to the Internet. .y 1=A@, the number of hosts increased to 1?2@./uring the mid(1=A?s, the Internet entered its commercial phase and by 1==?s, the orld itnessed a massive e"pansion of the 6et, because of its accessibility, multi(application and decentrali1ed nature. J<KThe concept of internet mar!eting started in early 1==?s hen te"t(based and simple ebsites ere predominantly used for offering product&service information around the orld. The .ristol($yers 2quibb as the first company that officially launched an online mar!eting campaign. 0ith time, several ebsites came up that employed the concept of online mar!eting for its offerings. Hahoo is said to be one of the online(based firms that as able to quic!ly acquire high amount of profit from online mar!eting. Hahoo successfully targeted the Mnever before seenM type of messages from the online mar!eting industry. .y the mid(1==?s, the online mar!eting industry began to rise as the number of internet users and home based businessmen& entrepreneurs increased in the 4nited 2tates of )merica. J@K D&SP?A4 AD@$ T&S&)% 9C= /isplay advertising conveys its advertising message visually using te"t, logos, animations, videos, photographs, or other graphics. /isplay advertiser frequently target users ith particular traits to increase the adsG effect. In other ords, display advertising refers to those ads that appear alongside eb content. )ptly called banners, this clever ay of advertising as ell as many other forms has proved to be very beneficial. The display advertising can be classified into follo ing categoriesN a8 -eb7banner Advertising! 0eb banners or banner ads typically are graphical ads displayed ithin a eb page. This form of online advertising entails embedding an advertisement into a eb page. It is intended to attract traffic to a ebsite by lin!ing to the ebsite of the advertiser. ,rame Ad 6traditional banner8! 9rame ads are the first form of eb banners. The colloquial usage of Mbanner adsM often refers to traditional frame ads. 0ebsite publishers incorporate frame ads by setting aside a particular space on the eb page. Pop #psIPop7#nder! ) pop(up & pop(under ad is displayed in a ne eb bro ser indo that opens above a ebsite visitorGs initial bro ser indo . ,loating ad! ) floating ad, or overlay ad, is a type of rich media advertisement that appears superimposed over the requested ebsiteGs content. 9loating ads may disappear or become less obtrusive after a preset time period. $Hpanding ad! )n e"panding ad is a rich media frame ad that changes dimensions upon a predefined condition, such as a preset amount of time a visitor spends on a ebpage, the userGs clic! on the ad, or the userGs mouse movement over the ad. E"panding ads allo advertisers to fit more information into a restricted ad space. Tric* banners! ) tric! banner is a banner ad here the ad copy imitates some screen element users commonly encounter, such as an operating system message or popular application message, to induce ad clic!s. Tric! banners typically do not mention the advertiser in the initial ad.

C2

&nterstitial ads! )n interstitial ad displays before a user can access requested content, sometimes hile the user is aiting for the content to load. Interstitial ads are a form of interruption mar!eting.

b8 TeHt Ads! ) te"t ad displays te"t(based hyperlin!s. Te"t ads may also be delivered through email mar!eting or te"t message mar!eting. Advantages 9G= Stim#lating &nterest 0hen a person vie s a eb page and reads the primary content, the ads alongside are difficult to overloo!. 0ith the attractive designs and flashy presentations, display ads can immediately capture the attention of potential buyers, enticing them to clic! on the ad in less than a fe seconds. eaching Target A#dience )ds or banners are usually displayed in relation to the content being vie ed in a eb page. $any ads on the Internet are also highly targeted to specific audiences, only sho ing ads that are related to relative search terms. This ma!es for a very effective ay of getting in touch ith your target audience, thus ma"imi1ing your productGs buying potential. Cheap )lthough placing an ad on top ebsites can cost thousands of dollars a month, prices are usually cheaper for display ads than for rich media ads (due to costs in creating, hosting, and annoyance factors). $asy to Create 2tatic display ads (+pg, gif, sometimes ping) can easily be created in most free graphics programs (or that program for digital photos that came on firm computer). Even animated display ads can be created using free and lo cost soft are. 'reating good display ads requires a bit of design and mar!eting !no ledge. Attention )ds placed ithin a bloc! of content are more li!ely to be clic!ed on (especially if the ad is related to the content). $edium rectangle ads (<??_2D?) are especially effective in content. $asy to 0nderstand 0ith little comple"ity display ads are fairly easy to understand in terms of creation, placement and analytics, ma!ing them a great place to start for beginners. Disadvantages 9;= &gnored )ds placed on the side or page in EtraditionalF ad spots tend to be ignored (because people !no that they are ads ithout paying attention to them R especially if they are animated). 3loc*ed )s ith most ads hich are served from an ad server, display ads may be bloc!ed by vie ers ho either turn off scripting in their bro ser or have some other type of soft are that bloc!s ads. ?imited &nformation
C<

/isplay ads are limited in the amount of information they can convey. Even ith animation a firm usually only have 1?(1D seconds of time to get their message across in a limited space. Information collected about display ads is usually limited to impressions, clic!s and possibly some information about ho clic!ed on the ad. S$A C" $)%&)$ MA ($T&)% 6S$M8 2E$ is a 0orld 0ide 0eb online strategy that is often utili1ed to optimi1e eb pages and simply ma!e them search engine friendly. )lthough having a po erful 2E$ strategy can ta!e too much time and refers it is usually the actual result. It increase in site ran!ings, eb site traffic and even product sales.2E$ is one of the most effective mar!eting techniques to bring qualified leads to our business. It can be further classified as> Search $ngine Optimi'ation 6S$O8 9C=! 2earch Engine #ptimi1ation, or 2E#, attempts to improve a ebsiteGs organic search ran!ings in 2E%*s (2earch Engine %esults *age) by increasing the ebsite contentGs relevance to search terms. 2earch engines regularly update their algorithms to penali1e poor quality sites that try to game their ran!ings, ma!ing optimi1ation a moving target for advertisers. Sponsored Search 9C=! 2ponsored search (also called sponsored lin!s or search ads) allo s advertisers to be included in the sponsored results of a search for selected !ey ords. 2earch ads are often sold via real(time auctions, here advertisers bid on !ey ords. In addition to setting a ma"imum price per !ey ord, bids may include time, language, geographical, and other constraints. 2earch engines originally sold listings in order of highest bids. $odern search engines ran! sponsored listings based on a combination of bid price, e"pected clic!(through rate, !ey ord relevancy, and site quality. Advantages 9F= $asily eaching Target A#dience ) pay(per(clic! campaign can really help to firm reach out to a target audience. /epending on the si1e of firm, a business can spend a particular amount of money on !ey ords that ill attract Internet users to firm ads. This is a great ay of reach to the target audience. Traffic &nflow ) firm can improve traffic to ebsite by investing in the right 2E$ tactics. The internet never sleeps. That means people can visit to site at any time and the site, if properly utili1es 2earch Engine $ar!etingG, it can receive visitors 2@"B. &ncreased 3#siness Prospects Traditional mar!eting still cannot be done a ay ith, but 2E$ offer e"citing prospects. 9or e"ample, online purchase of products&services can really help to ards brand building and even ma!e a fan base of satisfied customers. Search Optimi'ation 9or local businesses, search engine mar!eting can do onders. #ver B?I of online users conduct local searches for information on a variety of products and services. If our company has a sound 2E$ strategy in place, then our company product and services could be the first choice of people.
C@

Disadvantages 9F= More Time and $ffort 2E$ is targeted mar!eting. That means a firm have to spend a lot of time trying to find the right combination of tactics. #nce a firm settle on the right plan, daily updates need to be made so that firmGs search engine ran!ing doesnLt ta!e a beating. )ll businesses do not have so much time to spare for such a tas!. &ncreased Capital eA#irement 2E$ is usually outsourced because of time constraints or lac! of s!ill. This means that a lot of money has to be spent in order to get proper results. 2mall and medium si1ed businesses might not have the funds to spend on search engine mar!eting. 0nethical Practices ;ast but not the least, unethical 2E$ tactics could have a firm struc! off search engine inde"es. This blac!listing could damage firmGs online reputation. 0hile the advantages of 2E$ can out eigh the disadvantages, the results vary from company to company. There is no shortcut to success in the online orld. SOC&A? M$D&A MA ($T&)% 2ocial media mar!eting programs usually centre on efforts to create content that attracts attention and encourages readers to share it ith their social net or!s. The resulting electronic ord of mouth (e0o$) refers to any statement consumers share via the Internet (e.g., eb sites, social net or!s, instant messages, ne s feeds) about an event, product, service, brand or company. J=K Advantages 95<= Direct &nteraction It can connect a firm directly ith their customers and get customers feedbac! as ell as suggestions for improving firmGs products or services. C#stomer @al#e ) firm can ma!e their customers feel valued as human beings, not +ust dollars and cents, and improve their e"periences ith firm business if it uses social media mar!eting smartly. $asy Advertising ) firm can use social media (such as T itter and 9ace boo!) to advertise upcoming events or special offers that a firm thin! their customers ould en+oy. -ider Scope 2ocial media has a ide reach, so customers may even spread firmGs message if they li!e it. $ffective Messaging ) firm can send out his message at times hen firm thin! its customers are most li!ely to see it, and measure the effectiveness of its message ith other tools. Disadvantage 95<= $ffect on %oodwill If one of your customers complains online, that complaint may be seen automatically affect on firmGs business reputation.
CD

orld ide. It

)o Scope of $rror If firm ever ma!e an error, it is seen channels.

orld ide and may even be pic!ed up by ne s

MO3&?$ AD@$ T&S&)% $obile advertising also called 2$2 mar!eting. $obile advertising is ad copy delivered through ireless mobile devices such as smart phones, feature phones, or tablet computers. $obile advertising may ta!e the form of static or rich media display ads, 2$2(2hort $essage 2ervice) or $$2($ultimedia $essaging 2ervice) ads, mobile search ads, advertising ithin mobile ebsites, or ads ithin mobile applications or games (such as interstitial ads, Eadvergaming,F or application sponsorship). J11K Advantages 95>= $ar!eting a product or services by ay of 2$2 is one of the best ays of reaching out to more customers, for the follo ing reasons> Targeting )iche A#dience 2ince users opt(in to receive 2$2 messages from companies, this type of mar!eting pulls in a niche audience, hich is !eenly interested to !no more about the product or service concerned. &mprompt# Deals 2ince all the messages are going out to users in real(time and are instantly delivered, companies can offer impromptu deals to their customers. Industries such as real estate can immediately notify customers about updated property listings and the latest properties available. Constant To#ch 2$2 being highly interactive, companies can !eep in constant touch ith users, urging them to participate in surveys etc. Compiling 0ser7Data ,athering user data is much easier by ay of 2$2 mar!eting. This ma!es it much easier for the company to ma!e changes to the advertising campaign, as and hen necessary. ewards for 0sers 'ompanies can consider offering re ards for usersG participation. If they can also integrate this ith the various types of mobile social media available today, e"isting users ould be able to spread their message through ord of mouth. Disadvantages 95>= ?imited Advertisement 2$2 allo companies very little advertising space. The ma"imum limit for te"t messages is 1C? characters. .esides, the advertiser cannot add impressive audio or animation effects to the messages. That could limit the creativity of the advertiser. ?imited A#dience 2$2 mar!eting is only no gaining popularity. It is use by only a certain age group of people that uses te"ting on a regular scale. 2o thatGs ay it has a limited audience group. eA#ires Time and $fforts
CC

2ince an 2$2 message is so short, the mobile advertiser ould have to put in added time and effort to create an effective enough campaign, hich ould attract more users. Diffic#lt to $ngage 0sers It is not very easy to constantly engage mobile users and encourage them to opt(in to receive messages on their mobile phones. Even if they do opt(in, it is not necessary that they read every message the company sends them. $7MA&? AD@$ T&S&)% Email mar!eting is directly mar!eting a commercial message to a group of people using email. In its broadest sense, every email sent to a potential or current customer could be considered email mar!eting. It usually involves using email to send ads, request business, or solicit sales or donations, and is meant to build loyalty, trust, or brand a areness. J1<K Advantages Trac*ing O& )n e"act return on investment can be trac!ed (Mtrac! to bas!etM) and has proven to be high hen done properly. Email mar!eting is often reported as second only to search mar!eting as the most effective online mar!eting tactic. J1<K Speedy and Cost7effective EmailLs immediacy reduces delays in communication, allo ing businesses to run more smoothly. Email $ar!eting is significantly cheaper and faster than traditional mail, mainly because of high cost and time required in a traditional mail campaign for producing the art or!, printing, addressing and mailing. J1<K Targeted Advertising Approach This is especially the case here the email o ners to be targeted have been born of a proper lead generation program. These are people ho are very li!ely to buy, and the email is, really, +ust a final lin! in the chain. This distinguishes email mar!eting from other approaches here you target people ho ould never buy the product you are selling, even if their lives depended on it. J1@K ed#ced Time and $ffort 4sing email mar!eting, ho ever, one can pull out a mar!eting communications piece in typically less than t o hours. 4sing recurring email templates, all one needs to do is to approve the copy for the email and any changes to graphics, use the database, decide ho to send to, and then +ust hit send. 0ee!sL of or! can be accomplished in +ust a fe hours and by a single employee. J1DK eal7Time Messages 0ith a print mailer or telesales campaign, one needs to select mar!eting campaigns and specials that have a Mlong tailM because of the e"tended period of time bet een campaign development and implementation. .ecause a mar!eting email can be completed in +ust a fe hours, one can literally send Mday(ofM messages to help reduce stoc! or promote a limited time special as needed. #ne can even send unique real(time messages to customers that arrive on their birthdays or anniversaries. J1DK Personali'ed Messages

CB

Email mar!eting presents many dynamic opportunities. 6ot only can one send personali1ed email ith oneGs user name or login name, but many email mar!eting solutions offer the ability to feed in personali1ed information such as sales or purchase history. )lso, because creating separate email sends is significantly less challenging than creating separate postal mail, print mail or advertising campaigns, one can segment the customer list into smaller lists and send very personali1ed messages. 9or e"ample, a company can select all of its users or customers ho are from 6e /elhi and then rite its email mar!eting copy to spea! directly about 6e /elhi. 0ith email mar!eting and communications, one can easily spea! to the customers in a very personali1ed and intimate ay that is not possible ith other mar!eting channels and avenues. J1DK Segment 0ser and C#stomer Database &nformation 2ince one can segment the database of customers or users ith email, e"tremely targeted mar!eting campaigns can be sent, that ill result in increased sales conversions simply because they are so specific. J1DK More ,reA#ent Comm#nications .ecause email ta!es less time to create and send than other mar!eting and advertising channels do, one can communicate ith the customers more frequently. Instead of only being able to send them a flyer or catalogue once a month or once a quarter, one can easily send them offers once a ee!. J1DK Test Mar*eting Messages ,ood mar!eting al ays means being able to test things by obtaining feedbac!. 0ith email mar!eting, it becomes incredibly easy to see hat graphics, headlines, offers and even colours the users and customers ill respond to. ItLs incredibly simple to simply send one version of an email to one part of your list and a second version of an email to a different part of your email list. Then, through the very precise trac!ing tools that email mar!eting offers and via analytics, bounce messages, un(subscribers, clic!(throughs, etc., one can figure out hich mar!eting message or!ed better to convert sales or user actions, as the trac!ed information can be used to measure open rates, positive or negative responses, and correlates sales ith mar!eting. J1DK &t is Simple ItGs easy and itGs simple. )nyone can use it anytime. This method allo s one to use the mailing list hich gives the ability to distribute information to a ide range of specific, potential clients at a lo cost. J1CK Opt in or 0n7S#bscribe Options Emails contain opt(in or opt(out options this helps a company short list its prospects. *eople that ant to hear the message ill happily give you their email address. 0hen they are tired of your message, they can unsubscribe at their discretion. J1CK ,ast esponse /irect mail is slo , it can easily ta!e any here from B to 1? days to get a response. Email mar!eting, ho ever, has a response in any here bet een 1 and < days. It can thus reach a substantial amount of email subscribers in a short amount of time. J1CK
CA

%lobal each 6o matter here you are or hen you need to reach people, targeted emails can reach their targets. There are no boundaries ith email mar!eting. )dvertisers are able to get repeat business affordable and automatically. J1CK Disadvantages Delivery vs+ Spamming ) report issued by the email services company %eturn *ath, as of mid(2??A email deliverability is still an issue for legitimate mar!eters. )ccording to the report, legitimate email servers averaged a delivery rate of DCIN t enty percent of the messages ere re+ected, and eight percent ere filtered. 'ompanies considering the use of an email mar!eting program must ma!e sure that their program does not violate spam la s such as the 4nited 2tatesL 'ontrolling the )ssault of 6on(2olicited *ornography and $ar!eting )ct (')6(2*)$), the European *rivacy and Electronic 'ommunications %egulations 2??<, or their Internet service providerLs acceptable use policy. J1<K 9ire alls, spam filters and email blac!lists are common features of the modern Internet landscape, so emails do not al ays get through to every address. 0hile opt(ins and hite(list requests are viable options, they are only effective if the customer is a are of your business and agrees to allo the email through the filtering gauntlet. )dvertisers need to carefully create email policies, use email authentication soft are and regularly maintain clean, viable and interested prospect lists to assure that messages are getting through. J1BK ?oad Speeds $ost people en+oy an attractive, colourful advertisement, but not every recipient has the computer po er or connection speed to quic!ly load and display email photos or graphics. $any customers ill not ait more than a fe seconds for graphic(heavy emails to load, so advertisers must rely on attention(getting te"t in order to get the message across and !eep the readerLs attention. Effective advertising copy can be e"pensive to procure, unless the advertiser is able to rite in(house. J1BK epetition In traditional print advertising, repetitive ads are necessary for the eventual notice and response of the prospect. 0ith email advertising, the same email sent over and over again is li!ely to be ignored or deleted. -ust as ever(changing headlines in ne spapers entice readers to find out more, sub+ect lines are as important as the email ad content in order to get the email open and read. 'reating consistently irresistible sub+ect lines can be as challenging as effective ad copy. J1BK Competition It is common practice for other companies to opt(in to competitorLs email lists for purposes of obtaining pricing, special offers and information. 0ithin minutes of sending your e"clusive offer email, it may not stay e"clusive for long and may result in pricing ars. ItLs not al ays possible to differentiate customers from competitors on your email list, since posing as a customer is as easy as using a personal email address on a free ebmail service. J1BK
C=

is*s There are ris!s to email advertising that must be ta!en seriously. .eing flagged as a spammer, prospects opting(out because of too many emails or content that is uninteresting, incorrectly targeted or redundant are all ris!s that advertisers face. ) poorly designed email campaign sent to the rong prospects at the rong time can adversely affect credibility and alienate customers((as can slo or no response to customer inquiries, hen email is not continuously monitored. J1BK O)?&)$ C?ASS&,&$D AD@$ T&S&)% )dvertisements grouped by sub+ect usually appearing under categorical headings in a section of a publication and consisting chiefly of descriptive listings in te"t type are popularly !no n as classified advertisements J1AK. It is a form of advertising hich is particularly common in ne spapers and other periodicals hich may be sold or distributed free of charge J1=K. 0ith the appearance of the internet and the ever(gro ing population of the Internet(users, the concept of Sonline classified advertisingG gained popularity. Advantages ,ree 9ree classified ad sites ill allo one to sell their product&service ithout spending any money on advertising costs. J2?K Drives Traffic to Site &f a firm has a product ebsite, then adding its eb address to the classified ad ill encourage customers to bro se the other products that the company is selling. ) classified ad site is simply another place to put a lin! to the desired site, ultimately increasing traffic to the companyGs ebsite.J2?K Saves Time #nline classified ad sites only ta!e a fe minutes to +oin and submit your ad. #ne can also e"tend the duration of the ad online, if required. J2?K $asy $ost online classified ad sites are easy to navigate, are bro ser friendly and are laid out in a clear and concise ay. It is thus considered to be one of the easiest ays to advertise hassle R free. J2?K ?imitless Potential Sales 2elling its product online using the classified advertisement opens up a huge global mar!et for the companyGs product. ;ocal ne spaper ads ill only reach a certain number of readers and therefore a limited number of sales for the company. There are over si" million people online, many of ho might be loo!ing for the e"act product that you are offering. This ma!es placing a classified ad all the more appealing and has the potential to e"pand your business in a much shorter amount of time. J2?K K#ic* es#lts #nline classified advertising produce quic! results and require very little physical effort. *lacing an ad can bring traffic to a ebsite almost instantly. If done correctly, one can generate a boat load of traffic from classifieds. J21K

B?

Disadvantages ?ess ?ife #ne disadvantage of this type of advertising is that an ad ill e"pire quic!ly. The ad ill drop lo er and lo er in the ran!ings until it is not generating any traffic at all. The ads must constantly be replaced. 'onsistency is very important in this type of advertisement. J21K Post Many Ads to See es#lts )nother disadvantage of this type of advertising is that one must post too many classified sites to see big results. )dvertising on one site is not enough to produce great results. Ta!e it to the ne"t level and send ads to about D(1? classified sites. J21K Tedio#s and Time7Cons#ming *osting online(classified ads is very time consuming as one has to manually insert the ads on the sites. /ifferent ebsites allocate different space for the ads. 2ome accept <?? ords, hile others allo as much as 2,??? ords. )n online ad should thus be developed !eeping in mind the ebsite in hich it is going to be published and the various constraints of that ebsite. J22K AD-A $ )n ad are is soft are that automatically displays or do nloads advertising material such as banners or pop(ups hen a user is online J2<K. )lthough this form of advertising poses more dra bac!s, it certainly is equipped ith certain benefits for the organisation as listed belo > Advantages ,ree Software #ne of the biggest advantages of ad are is that it helps obtain free soft are. The ma!ers of the soft are ill embed ad are in the application, or have it serve a pop(up ad. In e"change, one gets the soft are free rather than pay for its use. 0hile a visitor might find the advertising annoying, a firm can eigh that against the advantage of not having to spend money for the soft are. J2@K Sales and Specials )d are services anonymously trac! here a visitor goes hen online. 0hile this might seem invasive, in reality the legitimate ad are services have no idea ho the person is. 'ompanies +ust use the data to serve targeted advertising. 9or e"ample, if a person searches for information on florists, he might find ads received through the ad are system are about flo ers, ho to buy them, here to buy them and possibly information on ho to get discounted deals. This feature is utili1ed by companies for successfully achieving targeted advertising. J2@K Toolbars Toolbars are ob+ects that typically appear at or near the top of the 0eb bro ser that provide some !ind of service. They might help ith searches, or or! ith your favourite social net or!. 0hatever it might do, if one installed the toolbar it is probably because it provides a service that a person anted to use. In e"change, this toolbar trac!s hat an individual does, and either serves ads based on this or uses the information to help advertisers gain demographic !no ledge. J2@K

B1

Disadvantages Seen as Malware The term ad are is frequently used to describe a form of mal are (malicious soft are), usually that hich presents un anted advertisements to the user of a computer J2DK. This online mar!eting technique thus has a more negative image than any other media belonging to this category. Anti7Adware Software Internet users sometimes do nload anti(ad are soft are to !eep their bro sers ad are(free. This can be a setbac! for companies promoting their products & services via. ad are. &gnored by &nternet7#sers Even though an ad are may reach its target mar!et, the pop(ups that open up because of it often hamper more than they benefit in promoting the companyGs offerings. *op(ups usually do not appeal internet users and thus fail in their purpose of generating brand a areness. #nly hen an internet user is free, ill he have the time to go through the pop(ups that open up. A,,&?&AT$ MA ($T&)% )ffiliate mar!eting is a type of performance(based mar!eting in hich a business re ards one or more affiliates for each visitor or customer brought by the affiliateLs o n mar!eting efforts. These affiliates often use regular advertising methods for bringing visitors to the companyGs ebsite. It is a +oint and mutually beneficial business partnership bet een merchants and ebsite publishers&o ners hereby an affiliate is compensated for every visitor or client provided through his effort. J2CK Advantages >DH; Service The Internet is al ays open. This means that a message posted by the company is available 2@ hours a day, B days a ee! and that the ider your affiliate program, the stronger the possibility that at any given moment your message is being seen. J2BK ed#ced Cost of Sales 0ith soft are tools it is possible not only to automate a companyGs sales process, but also to automate the management and trac!ing of the affiliate program, thereby reducing the costs of sales. )ffiliate programs are based on the premise that the content producer only pays the affiliates for pre(defined results. That means no financial outlay until the firm gets results, be it revenue, mar!et information or any other metric you decide is beneficial to your business model. If an affiliate doesnGt produce results, then the organisation doesnGt pay him. J2BK Potential to %row $Hponentially If the company has a good product that appeals to the right demographic and an affiliate program that pays, then its on(line presence and revenue has the potential to gro e"ponentially. #ne affiliate can lead to more and so on, until you can have hundreds, and possibly thousands of people promoting the companyGs product or service. 9ar more than the company could ever have afforded in a traditional sales model. J2BK $asy to Test )ew Ad Campaigns
B2

0ith an affiliate program in place, it becomes easy to test ne advertising campaigns. Hou can develop ne ads and messages and send them out to the affiliates ho ill post them quic!ly. .y using trac!ing soft are, it can quic!ly become apparent if a ne mar!eting campaign is effective. $ar!et testing becomes more efficient, easier to target and you get better metrics and feedbac! than through traditional methodologies. J2BK $asy To Promote $erchants gain a ider place to sell their products and services, resulting in more customers and more sales. $erchants can gain more customers ithout spending valuable time in searching for them. J2AK Additional So#rce of &ncome The affiliate mar!eting program provides an easy ay to create additional sources of income for ebsite publishers and o ners. $ar!eting banners of merchantGs products generate instant sales herein they get a commission. J2AK Cost7$ffective It does not require a si1eable investment on the part of the affiliate. J2AK Disadvantages Commission Costs There is the possibility that some merchants may incur high commission costs and costly set up and maintenance fees due to affiliate facilitators&bro!ers.J2AK Misleading ad7campaign by affiliates The affiliates may engage in false and misleading advertising in order to get sales commissions. 4nscrupulous affiliates may ma!e claims and promises regarding the product and services, hich are completely rong or e"tremely e"aggerated. In cases li!e these, the merchant usually receives complaints and lose any potential consumer. J2AK Threat of ?in*7"ijac*ers ;in! hi+ac!ers can hi+ac! affiliate lin!s and get paid for the commissions instead. J2AK Sporadic )nother ma+or disadvantage is that pay can be quite sporadic. It cannot be relied upon as a stable source of income, especially if you are +ust starting out. J2=K CO)C?0S&O) It can be seen from the above data that online mar!eting serves as a good channel for attracting prospective clients and informing them about the companyGs products 3 services by conveniently displaying the offerings. )s more and more individuals are e"ploring the online orld and becoming avid internet users, it only seems ise if companies encash this opportunity and use internet for mar!eting purposes. #nline mar!eting not only curtails the huge e"penses a company has to incur on advertisements, it is also easy to maintain and update. 8o ever, mar!eting of products over the internet has its limitations too. )n individual has to have some basic !no ledge of the internet to be able to vie the online advertisements displayed by the companies. If an organisation is into niche mar!eting and its targeted customers do not frequent the internet, then online mar!eting ould not seem as lucrative an option for this business as it may seem for others. )lso, ith the ever increasing competition, it becomes imperative for businesses to differentiate themselves from its rivals
B<

on the internet too. 2ho casing similar products in a similar fashion using similar online mar!eting media ould not contribute in enhancing the customer base. #nline mar!eting presents a plethora of opportunities for firmsN ho ever, businesses should strategically aim at utili1ing such online media that ould help in targeting the ma"imum hile costing the minimum. $,$ $)C$S 1. http>&& .slideshare.net&priyan!ashinde<D1&online(mar!eting(ppt 2. http>&& .redbubble.com&people&stevehoo!&+ournal&1111@=1?(ho (good(is(the( internet(its(not(even(sure( hen(it( as(born <. http>&&en. i!ipedia.org& i!i&Internet @. 'ohen()lmagor, %aphael. (2?11). Internet 8istory. International -ournal of Technoethics, 2(2), @D(C@ D. http>&&en. i!ipedia.org& i!i&#nlineQadvertising C. http>&& .eho .com&listQC@A2B1DQbenefits(display(advertisingQ.html B. http>&&sa1bean.com&2??A&?C&?C&display(ads(advantages(disadvantages& A. http>&& . ebarts.com.cy&blog&technology&title(pros(and(cons(of(search(engine( mar!eting.html =. http>&&mashable.com&category&social(media(mar!eting& 1?. http>&& .lin!edin.com&groups&0hat(are(benefits(disadvantages(social( CC<2D.2.2?C?1@A@A 11. http>&&emtmar!eting.com&search(engine(advertising& 12. http>&&mobiledevices.about.com&od&mar!etingapps&a&$obile($ar!eting(*ros()nd( 'ons(#f(2ms($ar!eting.htm 1<. http>&&en. i!ipedia.org& i!i&EmailQmar!eting 1@. http>&& .ti!odigital.com&blog&C(building(business(online&2<(the(advantages(of( email(mar!eting 1D. http>&&emailmar!eting.comm1??.com&email(mar!eting(eboo!&email(mar!eting( benefits.asp" 1C. http>&&shoutitoutdesign.com&top(1?(advantages(of(email(mar!eting& 1B. http>&&smallbusiness.chron.com&disadvantages(email(advertising(<D@C.html 1A. http>&& .merriam( ebster.com&dictionary&classifiedI2?advertising 1=. http>&&en. i!ipedia.org& i!i&'lassifiedQadvertising 2?. http>&&freeadslondon.hubpages.com&hub&free(ads(cardiff 21. http>&&e1inearticles.com&O)dvantages(and(/isadvantages(of(#nline( 'lassifieds3idP<B?C2CD 22. http>&&scorpion(mar!eting.com&QoldQclassifieds.html 2<. http>&& .o"forddictionaries.com&definition&english&ad are 2@. http>&& .eho .com&infoQA2AB11<Qadvantages(ad are.html 2D. http>&&en. i!ipedia.org& i!i&)d are 2C. http>&&en. i!ipedia.org& i!i&)ffiliateQmar!eting 2B. http>&& .fatco .com&!no ledgebase&readQarticle.bmlO!bidPDD1= 2A. http>&& i!i.ans ers.com&:&0hatQareQtheQadvantagesQandQdisadvantagesQofQmar!eti ngQchannelsWslide2
B@

2=. http>&&

.affiliatesee!ing.com&asho &@B.html

BD

MO3&?$ P"O)$ C?O)&)%! D$T$CT&O) A)D A@O&DA)C$ ajbir (a#r %ill Assistant Professor/ Swami Satyanand College of Management & Technology+ rajbir>:1yahoo+co+in S#npreet (a#r Assistant Professor/ Swami Satyanand College of Management & Technology+ s#npreet+C51gmail+com A3ST ACT E"changing vie s ith each other is one of the essential part of our lives that have al ays been a centre of attention among parties at locations geographically apart. )fter this innovation, landlines have replaced the old snail mail technique. ;i!e ise, the term `mobileL has completely uprised the communication by opening up modern applications. Today, mobile phone becomes the spine of the society. .ut because of its increased demand it is sub+ected to fraud. The various upcoming features in mobile phones ma!e it an appealing target for illicit. The ma+or threat to mobile phone is from cloning. 'loning is the process of ta!ing the programmed information that is stored in a legitimate mobile phone an illegally programming the identical information into other mobile phone. )s a result the cloned phone can ma!e and receive calls and the charges for those calls are billed to the legitimate subscriber. $illion of cell user, be it ,2$ or '/$), run at ris! of having their phones cloned. In this paper e have discussed the cloning process, its detection, preventions and its various solutions ($4-O DS! %ising, ,2$, '/$), 'loning 2oft are, /etection 5+ &)T OD0CT&O) In general cloning means the e"act replica or a mirror image of an ob+ect under study. This technique came into e"istence in early =?Gs. $obile phone cloning is mainly a practice here in the transfer or copying the identity of one cellular phone to another is done. The other cell phone becomes the imitation of the original cell phone li!e a clone. 'onsequently, hile calls can be made from both phones and only the original phone is to be paid. Though the communication channels are capable of providing security means, ho ever scam artists get a ay ith the help of loophole in the system. 2o hen one gets huge bills, the chances are that the phone is being cloned. The service provider net or! does not have a ay to differentiate bet een the genuine phone and the EclonedF phone. $illion of cell user, be it ,2$ or '/$), run at ris! of having their phones cloned. ) cell phone customer e"periencing large cell phone bills having Eauto payF billing feature to automatically pay for their cell phone bill from their ban! ere affected the most. 4nluc!ily, there is no best ay the subscriber can detect cloning. The different signs that your cell phone might be cloned includes> phone calls and te"t messages suddenly arenGt receivedN incoming phone calls go straight to voice mailN not receiving missed caller voicemail notificationsN cell phone bill

BC

suddenly sho s international calls being placed from your phoneN suddenly drained cell phone battery.

,ig 5! cell phone cloning 9G= >+ &S$ O, MO3&?$ C?O)&)% The bang times for eavesdroppers ere early 1==?Gs. )n inquisitive youngster ith a a1?? Tandy 2canner could listen in to nearly analogue mobile phone calls of ell(!no n $inisters, 'ompany chiefs and 'elebrities routinely. )s a result, they found their most intimate conversations published in the ne"t dayGs tabloids. This practice started ith $otorola EbagF phones and reached to its height in the mid =?Gs ith a commonly available modification for the $otorola Ebric!F phones, such as the classic, the 4ltra classic and the $odel A???. 0hether it is ,2$ or '/$) handsets, not a single type of mobile communication is safe from cloning. Technically, it is easier to clone a '/$) handset as compared to a ,2$ handset. There are also various online ebsites that provide enormous information on ho one could go about hac!ing into cell phones. B+ P OC$SS O, C$?? P"O)$ C?O)&)% Every phone has an E*%#$. The replica is created by modifying or replacing the E*%#$ ith a ne chip hich ould allo cloner to configure an E26 (Electronic 2erial 6umber) via soft are. $I6 ($obile identification 6umber) should also have to change. 0hen E26&$I6 pair had changed successfully then an effective clone of the original phone has created. E26&$I6 pairs ere discovered in several ays> 1. 2niffing the cell phone. 2. Trashing cell phone companies or cell phone resellers. <. 8ac!ing cell phone companies or cell phone resellers. 'loning or!s under the )$*2()dvance $obile *hone 2ervice)&6)$*2(6arro band )dvance $obile *hone service, but has fallen in popularity as older clone able phones are more difficult to find and ne er phones have not been successfully reverse(engineered. )ctually, )$*2 as a standard system for analog signal cellular telephones service in countries hich is no updated ith digital cellular service by adding 9/$) and T/$). This service is !no n as /()$*2 here as 6)$*2 is a system used by cellular phone net or!s to split a voice channel into three different narro band channels. 'loning has been successfully demonstrated under ,2$, but the process is not easy and it currently remains in the realm of serious researchers. 0hen placing a call, the phone transmits both the E26 and the $I6 to the net or!. These ere, ho ever, sent in the clear, so anyone ith a suitable scanner could receive them. The eavesdropped codes ould then be programmed into another phone.

BB

,ig >! Process of cell#lar phone cloning 95= D+ PATA%O)&A! C?O)&)% SO,T-A $ *atagonia is soft are available in the mar!et hich is used to clone '/$) phone. 4sing this soft are a cloner can ta!e over the control of a '/$) phone i.e. cloning of phone. There are also soft areGs available in the mar!et to clone ,2$ phone. This soft areGs are easily available in the mar!et. ) cloned 2I$ can be used at different places. $essages and phone calls sent by the cloned phones can be trac!ed. 8o ever, if the accused handles the I$EI number of the handset for hich soft areGs are available, there is no ay he can be traced. C+ D$T$CT&O) O, C?O)$D P"O)$S O) )$T-O ( There are some methods to detect cloned phones on net or!> 5+ D#plicate Detection! The net or! detects the same phone in numerous places at the same time. In this case one can close up all the net or!s off so that the authentic customer ill contact the operator so that the clone users ill s itch to another clone. >+ @elocity Trap! The net or! uses the time and places of the phone to detect cloning. 9or e"ample, if the difference bet een the time of the first call and the second call is small, but the geographic distance is impossible for a person to move from one place to another placeN the cloned number is detected. B+ adio ,reA#ency! 9ingerprinting is originally a military technology. The net or! !eeps trac! of the fingerprint of all the mobile phones in its database. Then the net or! ill compare the fingerprint of a mobile phone hen the mobile request a call. If invalid fingerprint as detected, cloned number is also detected. D+ 0sage Profiling! *rofile of customerGs phone usage is !ept, and hen inconsistency is noticed, the customer is contacted. 9or e"ample, if a customer normally ma!es only local net or! calls but is suddenly placing calls to foreign countries for hours, it indicates a possible clone. C+ Call Co#nting! .oth the phone and the net or! !eep trac! of calls made ith the phone, and should they differ more than usually allo ed one call, service is denied. G+ Pin Codes! The caller unloc!s the phone by entering a *I6 code and then calls as usual. )fter the calls have been completed, the user loc!s the phone again. #perators may share *I6 information to enable safer roaming.

BA

,ig B! Cloned Phone Detection 9;= G+ T" $AT M&T&%AT&O) 'hec! every phone bill for fraudulent activity. 'onsider antivirus soft are for your cell phone. ;eave your cell phone at home if travelling abroad. If you use an online profile on your cell phone companyGs eb site to manage your account&ma!e payments ensure you use a strong pass ord. %egularly change your online profile pass ord. 'onfigure your cell phone to require a numeric pass ord to be entered on its !eypad before it can be used to place a call or send a te"t message. /onGt allo strangers to use your cell phone. %egularly bac!up your phone to your computer in case the phone is stolen&infected by mal are. /onGt open messages from unrecogni1ed senders. Turn off .luetooth functionality hen unneeded. .e cautious hen free ringtone advertisements are sent to your phone 'onsider subscribing to $obile $E (if you o n an iphone) to enable you to remotely ipe&loc!do n the phone if it becomes lost or stolen. ;+ "O- TO COM3AT T"&S P O3?$MM 0ith technically refined thieves, customers are helpless against cellular phone fraud. 4sually they became a are of the fraud only once receiving their phone bill. 2ervice providers have adopted certain measures to prevent cellular fraud. These include> 1. $ncryption is regarded as the most effective ay to prevent cellular fraud as it prevents eavesdropping on cellular calls and ma!es it nearly impossible for thieves to steal E26 and *I6 pairs. >+ 3loc*ing is used by service providers to protect themselves from high ris! callers. 9or E"ample, In some countries only users ith ma+or credit cards and good credit ratings are allo ed to ma!e long distance calls. B+ 3lac*listing of stolen phones is another solution to prevent unauthori1ed use. )n Equipment Identity %egister (EI%) enables net or! operators to disable stolen cellular phones on net or! around the orld.
B=

D+ 0ser @erification using *I6 codes is one method for customer protection against cellular phone fraud. C+ Traffic Analysis detects and determines by using artificial intelligence soft are 0hether it is physically possible for the subscriber to ma!e a call from a current location, based on the location and time of the previous call. F+ CO)C?0S&O) )t present mobile industry moves at such a fast pace, itGs often hard to !eep up. 6umerous technologies are in(house everyday but e"isting cellular system have number of potential ea!nesses that are need to be loo! out. It is crucial not only for business industry but also for a common man to ta!e mobile phone security seriously. ) proper a areness and fe simple precautions could deter the criminals. )s increase in technology, it is necessary to provide a security chec! after every si" months. 9inally, cell phones have to go a long ay in security before they can be used in critical applications. $,$ 1. 2. <. @. D. $)C$S Tripti 2ingh, E$obile *hone 'loningF, I-)'' 2?1< 6. .harath %eddy, E$obile 'loningF ;osif l. )ndroulida!is,E$obile *hone 2ecurity and 9orensics> ) practical )pproachF 6athan -. $uller, E0ireless )(TF 9ran! )delstein, 2andeep ,upta, E9undamentals of $obile and *ervasive 'omputingF C. .monsta are.blogspot.in&2?12&12&f(secure(anti(theft(for(all(mobile(and.html B. .dhs.gov&blog&2?12&?2&?C&secret(service(investigates(sophisticated(2D?(million( cell(phone(cloning(scheme A. research.unm.edu&industrialsecurity&'ell*hones.pdf

A?

)$T-O (L?$@$? &P M0?T&CAST&)% P#neet Sharma Assistant Professor/ DA@ College/ Amritsar p#neet+thisis1gmail+com A3ST ACT There are three fundamental types of I*v@ addresses> unicast, broadcast, and multicast. ) unicast address is designed to transmit a pac!et to a single destination. ) broadcast address is used to send a datagram to an entire sub net or!. ) multicast address is designed to enable the delivery of datagrams to a set of hosts that have been configured as members of a multicast group in various scattered sub net or!s. $ulticasting is not connection oriented. ) multicast datagram is delivered to destination group members ith the same Ebest(effortF reliability as a standard unicast I* datagram. This means that a multicast datagram is not guaranteed to reach all members of the group, or arrive in the same order relative to the transmission of other pac!ets. The only difference bet een a multicast I* pac!et and a unicast I* pac!et is the presence of a Egroup addressF in the /estination )ddress field of the I* header. Instead of a 'lass ), ., or ' I* address, multicasting employs a 'lass / destination address format (22@.?.?.?( 2<=.2DD.2DD.2DD). M0?T&CAST &) T"$ &)T$ )$T 2ome applications require data to be delivered from a sender to multiple receivers. E"amples of such applications include audio and video broadcasts, real(time delivery of stoc! quotes, and teleconferencing applications. ) service here data is delivered from a sender to multiple receivers is called multipoint communication or multicast, and applications that involve a multicast delivery service are called multicast applications. In unicast or point(to(point communication, data is sent to a single host. In broadcast or one( to(all communications, data is transmitted to all hosts ith respect to a given scope, for e"ample, all hosts in a ;)6. $ulticast can be thought of as a generali1ation of unicast and broadcast. In multicast, data is transmitted to a set of hosts that have indicated interest in receiving the data, referred to as a multicast group or host group. In principle, it is feasible to implement multicast in a net or! using either unicast or broadcast. 8o ever, both solutions have shortcomings. In a unicast solution to multicast, the sender transmits one copy of the data separately to each host in the multicast group. This is viable for small multicast groups, but hen the number of hosts is large, transmitting the same data multiple times astes a lot of resources. In a broadcast solution to multicast, data is delivered to all hosts in a net or!N for e"ample, and hosts drop the data if they are not members of the multicast group. This solutions or!s hen the hosts of a multicast group are all located on the same ;)6 and the ;)6 supports broadcast transmissions. #ther ise, sending data to a large number of hosts +ust to have it dropped by most hosts is not an economical use of net or! capacity. $a!ing multicast delivery efficient in a pac!et s itching net or! requires a hole set of ne protocols and mechanisms at the net or! layer. 9irst, multicast addresses must be available that can designate a multicast group as the destination of a
A1

datagram. 2econd, there must be mechanisms that allo a host to +oin and leave a multicast group. Third, there is a need for multicast routing protocols that set up paths, called distribution tree, from the sender to the members of a multicast group. The issues related to setting up multicast distribution trees are referred to as multicast routing.

,ig5 The net or!(layer mechanisms in the Internet that support multicast are referred to as I* multicast. The above figure depicts an e"ample of multicast in an I* net or!. The figure sho s four hosts and eight routers. %outers are connected by point(to(point lin!s and hosts connect to routers via Ethernet ;)6s. 8ost 81 is a source of multicast data, and hosts 82, 8< and 8@ are multicast receivers. The distribution tree, indicated ith arro s, is established by the routers using a multicast routing protocol. /ata is delivered do nstream in the distribution tree from the source to the receivers. I* multicast involves both hosts and routers. In I*v@, support of I* multicast is optional, but almost all hosts and most routers support multicast. 8osts that are members of a multicast group e"change Internet ,roup $anagement *rotocol (I,$*) messages ith routers. %outers perform t o main processes in I* multicast> multicast routing and multicast for arding. $ulticast routing sets up the distribution tree for a multicast group by setting the content of multicast routing tables. In multicast, a routing table may list multiple ne"t hop addresses for a routing table entry. )s in unicast, for arding refers to the processing of an incoming datagram, the routing table loo!up, and the transmission on an outgoing interface. 0hen a multicast pac!et arrives at a router, the router performs a loo!up in the multicast routing table for a matching entry. The router for ards one copy of the pac!et to each ne"t hop address in the matching routing table entry.

,ig >! &P M#lticast Addresses The range of I* multicast addresses, 22@.?.?.? to 2<=.2DD.2DD.2DD, corresponds to the 'lass / addresses in the class(based I* address scheme. These are the addresses that start ith E111?F This leaves 2A bits to identify a multicast group.

,ig B
A2

$ulticast addresses designate either permanent or transient multicast groups. ) permanent multicast group is associated ith an I* multicast address that is registered ith I)6).2 Important permanent multicast groups are the all hosts group ith address 22@.?.?.1, hich designates all hosts and all routers on a net or!, and the all routers group ith address 22@.?.?.2, hich designates all routers on a net or!. 2everal protocols reserve permanent multicast groups. 9or e"ample, the I* address 22@.?.?.= is used by %I*2 protocol to designate all %I*2 routers on a net or!, and 22@.?.?.@ is the group of all routers that use the /7$%* multicast routing protocol. )ddresses ith the prefi" 2<<.?.?.?&A are reserved for o ners of autonomous systems< and are used as follo s. The )2 number of an autonomous system is converted into a 1C bit number, and these 1C bits are assigned to the second and third byte of the I* address. Then each autonomous system can use the fourth byte to designate a set of 2DC reserved multicast addresses. 9or e"ample, if the )2 number of an autonomous system is ?"A?A?, the autonomous system effectively o ns the multicast addresses in the range from 2<<.12A.12A.? to 2<<.12A.12A.2DD. )ll addresses that do not designate permanent multicast groups designate transient groups. )ddresses for these groups are assigned dynamically. )n application implicitly allocates a multicast address by starting to transmit to a transient group. The address is released implicitly hen there is no sender and no receiver for this group. If t o applications use the same multicast address, I* multicast treats the applications as a single multicast group, and pac!ets sent by any of the applications are delivered to both applications. 2ince the TT; field in the I* multicast datagrams limits the scope of an I* datagram, it is feasible that different applications use the same I* multicast group, ithout interfering ith each other. 9or e"ample, if a host transmits to multicast group 2<?.1.1.1 and sets the TT; field to 2 in each I* datagram, the transmission ill not be seen by any host or router that is more than t o hops a ay. *roblems occur only if the scope of the I* datagrams transmitted by different applications that use to the same multicast group overlap. The addresses in the range 22@.?.?.?( 22@.?.?.2DD are al ays sent ith the TT; field set to one, and, therefore, the scope of the corresponding groups are limited to the local net or!. &P M#lticast in a ?ocal Area )etwor* 0e first e"plore I* multicast in a local area net or!. The main issues here are the interactions of hosts and routers hen hosts +oin and leave a multicast group, and the address translation bet een multicast I* addresses and multicast $)' addresses. 0e also point out to problems hen I* multicast traffic is sent over a s itched Ethernet net or!. M#lticast o#ting Algorithms in a %raph

,ig D
A<

.efore discussing the routing protocols of the Internet in detail, let us loo! at multicast routing as an algorithmic problem. 0e vie an I* net or! as a graph as sho n in figure (a), here each router is represented as a node and each lin! bet een t o routers is represented by an edge. Each edge is assigned t o cost metrics, for traversing the edge in one or the other direction. 9or simplicity, e assume that all edge costs are set to one. %outers that are connected to multicast group members have a dar! shade. In addition, the router that connects to the source is labeled ith an `2G. 0e assume that there is one multicast source, and that the source is also a member of the multicast group. In this graph, the tas! of multicast routing is the embedding of a tree into the graph such that all multicast group members are connected by the tree. 2o, ho ould an ideal embedding loo! li!eO #ne can thin! immediately of t o ob+ectives to build a good tree, hich are sho n in 9igure (b) and 9igure (c). In the figures, the thic! lines indicate the distribution trees. The first ob+ective is to build a tree that minimi1es the path cost from the source to each receiver. 2uch a tree is called a shortest(path tree or source(based tree 9igure (b). ) shortest(path tree can be relatively quic!ly computed using a shortest(path algorithm, but has the dra bac! that the tree is dependent on the source of the multicast tree. 6ote in 9igure (b), that the shortest(path tree is different hen a different node is the source in the multicast group. Therefore, a distribution tree must be computed separately for each source. The second ob+ective is to build a tree that minimi1es the total cost of the edges, called a minimum(cost tree 9igure (c). /ifferent from a shortest(path tree, a minimum(cost tree does not change hen a different node becomes the source. Thus, the same tree can be shared by all sources. The main dra bac! of a minimum(cost tree is that its computation is prohibitively e"pensive in most cases. In fact, the problem of calculating a minimum(cost tree is !no n to be an 6*(complete problem, meaning that the computation of the tree is intractable unless the net or! is small. The t o ob+ectives for multicast routing, shortest(path tree and minimum(cost tree, represent a set of trade(off for multicast routing. 2hortest(path trees minimi1e the cost of each receiver, hereas the minimum( cost tree minimi1es the cost of the total tree. ) single minimum(cost tree can be shared by all senders, hereas, a shortest(path trees must be built for each source. ;astly, a shortest(path tree can be computed relatively quic!ly, hereas the computation of a minimum cost(tree is not tractable in large net or!s. 2ome of the above trade(offs of multicast routing are reflected in the multicast routing protocols for the Internet. 8o ever, routing protocols have to satisfy additional constraints, hich are not e"pressed in the formulation of a graph problem. 9or e"ample, routing protocols must be able to adapt the distribution tree quic!ly hen hosts +oin and leave a multicast group. )dditionally, most multicast routing protocols require computing the distribution tree in a distributed fashion ithout any central coordination. 9inally, most multicast routing protocols try to leverage off unicast routing protocols, by constructing the distribution tree using information from the
A@

unicast routing tables. This imposes additional constraints on a multicast routing protocol. Core7based Trees! %outing protocols that built core(based trees designate a router, called the core, and built a reverse shortest path tree ith the core as the root of the tree. The core becomes the central hub for disseminating multicast pac!ets sent to the group. 0hen a source transmits a pac!et to a multicast group, the pac!et is sent to the core. 0hen the pac!et reaches the core, it is for arded using the reverse shortest path tree.

,ig C The construction of a core(based tree for a multicast group , is illustrated in above figure. Each receiver that +oins a multicast group sends a +oin message to the core router of the group. The message is sent on the %*9 interface ith respect to the core. If the +oin message reaches a router that is not part of the tree, the router adds an (b, ,) entry to the multicast routing table, adds the interface here the +oin message arrived to the outgoing interface list, and sets the incoming interface to the %*9 interface. Then, the router for ards the +oin message on its %*9 interface in the direction of the core. If the router is already part of the shared tree for group ,, the router, upon receiving a +oin message, adds the interface here the +oin message arrived to the outgoing interface list of the corresponding (b, ,) entry, but does not for ard the +oin message. 2ince +oin messages are sent on the reverse shortest path, the resulting distribution tree is a reverse shortest(path tree rooted at the core. The above figure illustrates the transmission of +oin messages ith router %@ as core, and hosts 8<, 8@, and 8D has members of the multicast group.

,ig G 9or arding of multicast pac!ets in core(based trees is illustrated in figure. 0hen 81 transmits a multicast pac!et, the pac!et is for arded on the unicast shortest path to the core. ) possible route is 81c %2 c %@. 0hen the pac!et reaches the tree at the core,
AD

it is sent do nstream in the core(based tree. 2ending pac!ets al ays to the core and inserting pac!ets into the distribution tree only at the core can be inefficient. 9or e"ample, suppose the path from %1 to %@ is through %<. Then, a pac!et from 81 to 8D ta!es the route 81c %1 c %<c %@ c %< c %Cc %A. 8ere, it ould be better to have %<, instead of for arding the pac!et to the core, for ard the datagram using the core(based tree. %< should for ard the datagram do nstream the tree to %C, as ell as upstream the tree to %@. 8o ever, such bidirectional trees, here pac!ets are for arded both upstream and do nstream a core(based tree, are prone to routing loops, and special precautions are necessary to avoid such loops. The main advantage of using core(based trees is that only one distribution tree is required for each multicast group. This reduces the comple"ity of the routing tables, as ell as the volume of multicast routing protocol messages. The main disadvantage of core(based trees is that, dependent on the placement of the core, the paths from the sender to the receivers through the core can be much longer than the direct path bet een a source and a receiver. CO)C?0S&O) I* multi(casting is a communication mechanism in hich data is communicated from server to a set of clients ho are interested in receiving that data. )ny client can dynamically enter or leave the communication. Though the overall concept seems very simple but the ay it is implemented requires good understanding. 2o, in this tutorial e ill cover the basics of I* multi(casting and ho it is achieved. In case of multicast communication, the server sends data on a particular multicast I* address and clients ho intend to receive that data need to listen on the same multicast address. These clients can be various different net or!s. ) group of clients listening to same multicast address is !no n as host group. Efficient and intelligent use of band idth is paramount, particularly ith the advent of video, mobility, and cloud technologies. It is also critical considering the surge in related one(to(many or many(to(many communication(based applications. $ulticast helps to fulfill the requirement of such band idth(intensive applications ith its inherent ability to replicate single stream hen and here necessary. )pplications across industries such as finance, enterprise, content(provider, entertainment, education, I2*s, and surveillance use multicast to optimi1e the profit(potential of resources ith efficient and quality service offerings. $,$ $)C$S 1# $.one /eployment ,roup, http>&&ns.uoregon.edu& 2. 8. Eri!sson, M$.one> The $ulticast .ac!bone,M ')'$, )ugust 1==@, pp. D@(C?. <. 5. 2avet1, 6. %andall, and H. ;epage, M$.#6E> $ulticasting Tomorro Ls Internet,M I/, .oo!s, 1==C. @. 7. 5umar, M$.one> Interactive $ultimedia #n The InternetM, $acmillan *ublishing, 1==D, 2<2 pp. 5# 6;$ $.one *age, http>&& .nlm.nih.gov 6# )'$ 2ig6et $.#ne programs page, http>&& .acm.uiuc.edu&signet&

AC

B. $. $acedonia and /. .rut1man, M$bone *rovides )udio and 7ideo )cross the Internet,M 'omputer, )pril 1==@, pp. <?(<C. A. 'isco 2ystems $ulticast *age, http>&& .cisco.com& arp&public&C1@&1B.html

AB

A ST0D4 O, MOD$ ) M$D&A O, COMM0)&CAT&O) A)D &TS &MPACTS O) %?O3A?&S$D $CO)OM4 Ms+ Savita Assistant Professor/ Swami Satayanand College of Management &Technology/ Amritsar+ s+savita1ymail+com Dr+"+P+%#pta Principal/Swami Satayanand College of Management &Technology/Amritsar+ g#pta2haripar*ash1yahoo+com A3ST ACT 'ommunication is an integral part of the efficient and smooth or!ing of any enterprise. In this globalised era, business is not confining to the national boundaries rather e"panding its ings to the international hori1ons. This study is mainly concerned ith the ob+ective to describe various electronic media used in the present era and to thro light on its positive impacts on the globalised economy. ($4-O DS! 'ommunication, /o n ard, 4p ard, 8ori1ontal, Transactional, 9ormal and Informal 'ommunication. &)T OD0CT&O) 'ommunication is an integral part of the efficient and smooth or!ing of any enterprise. In this globalised era, business is not confining to the national boundaries rather e"panding its ings to the international hori1ons. #rgani1ations are no culturally diversified and are providing quality services ith the use of electronic devices and systems. Therefore, communication has become an important factor in the success of any business. 6o letGs try to understand ho latest electronic medias are getting popular among the people of 21st century. 'ommunication is the process of sharing ideas, information and messages ith each other in a particular time and place. 'ommunication includes riting and tal!ing, as ell as non( verbal communication (such as facial e"pressions, body language, or gesture), visual communication (the use of images or pictures, such as painting, photography, video or film) and electronic communication (telephone calls, electronic mail, cable television or satellite broadcast). 'ommunication is a vital part of personal life and is also important in business and situations here e encounter each other (Encarta, 1==A) The ord EcommunicationF has been propounded from the ;atin ord EcommunisF hich means to share in common. It also suggests that communication is common understanding through the mind and heart. 'ommunication does not simply mean to transmit the message or an idea but also to transmit it ith the same sense and spirit ith hich the sender intends to convey. 'ommunication is complete and effective if the receiver perceives the message ith the same sense and spirit. E'ommunication may be broadly defined as the process of meaningful Interaction among
AA

human beings. $ore specifically it is the process by hich meanings are perceived and understanding is reached among human beingsF /. E. $c 9ar land O3.$CT&@$SI $S$A C" M$T"ODO?O%4 This study is mainly concerned ith the ob+ective to describe various electronic $edias used in the present era and to thro light on its positive impacts on the globalised economy. It is purely descriptive in nature, demonstrating the importance of electronic media and is based purely on our personal opinions, e"periences and observations P OC$SS O, COMM0)&CAT&O) 'ommunication is considered to be most important ingredient of the management process. Interpersonal and t o ay communication is fundamental to all managerial activities. ('handan ) The communication process starts ith the sender ho gives shape to his ideas and converts them into a message and later on putting them into various symbols and signs, he transmits this message to the receiver through a proper channel. 'ommunication flo s do n ard, up ard and hori1ontal in formal net or! of communication and it can flo from any direction to any direction or the communication hich e do normally ith our friends, relatives and colleagues over a cup of tea, lunch, tal!s at social gatherings.0enburg and 0ilmont have suggested that E'ommunication, instead of being Sup ardG or do n ard, hich is inter(communication, should be StransactionalG communication hich is mutual and reciprocal because all persons are engaged in sending(encoding) and receiving (decoding) messages simultaneously. 'ommunication is the glue that holds a society together. The ability to communicate enables people to form and maintain personal relationships. )nd the quality of such relationship depends on the caliber of communication bet een the parties (.rennan,1=B@).In any organi1ation, communication may be formal or informal. 9ormal communication follo s the chain of command and is recogni1ed as official. In addition to formal, organi1ations also have informal channels of communication. Informal communication channels arise from the social relationships that evolve in the organi1ation and even though these are neither required by management, but it helps in communicating important matters to the management hich ould not other ise feasible through normal channels. ('handan). It acts as a bridge over hich information passes from one person to another person. It can be one ay or t o ay communication. If there is absence of the feedbac! from the receiver, then it is one ay communication. It can be understood ith the help of a model as e"plained by 9ig.1
Send er Recei$er

Message

Encoding

C#annel Selection
A=

Recei$ing% ecoding% Meaning

,ig+ 5! One7-ay Comm#nication Model 0hen there is active feedbac! or response from the receiver to ensure that the message has been understood ith the same sense and spirit it is called t o( ay communication. This feedbac! can be verbal as ell as non(verbal.
$ncoding Message Channel Selection eceiving

Sende r Decoding as eceiver

Channel Selection

Selectio n Message

ecodi ng Meanin $ncoding as g Sender

eceiv e

Selecti on

,ig >! Two7way Comm#nication To ma!e the communication more effective, one must follo certain scientific principles hich have been advocated by 9rancis -. .ergin through BcGs i.e. 'andid, 'omplete, 'oncise, 'lear, 'oncrete, 'orrect and 'ourteous. It is most imperative that the message sent by you, should be free from irrelevant information. There should not be anything hich conceals the truth. 5ate ;udeman profoundly rites, EIf you ma!e sure you are ' telling the truth, you onGt have to orry about people listening to you hen people donGt listen, it is usually because the spea!erGs got something else he or she is communicating beside the truth.FThe message in the communication should also be correct, complete and clear. If a person has clear thoughts and he e"presses them ith clear e"pression !eeping the brevity of the message in mind then it ould arouse the interest of the reader in the message. To ma!e the statement particular and more informative, e must use authentic data. 9or e"ample( (i) The discount on shirts is very high. (ii) The discount on shirts is B? percent. The first statement is general and vague but second one is concrete because it is presenting definite facts. The message should be considerate and compassionate. )l ays ensure that e are not hurting any otherGs self respect. @A &O0S M$D&A O, COMM0)&CAT&O) $edias of 'ommunication refer to the vehicles through hich a desired message is transmitted from one person to another. ) decade before, hen the field of IT as not so developed and as only confined to telegraph, radio, television and computers, at that time a need as felt to ma!e it more advanced and consequently, it led to many innovative and latest devices of communication. India has made great progress in the field of the telecommunication sector in recent years. )ll this is due to innovative efforts made by computer soft are engineers. ModernI ?atest devices 0ith the revolution in the field of IT, our economy is ushering into digital economy, here the ays of doing business have drastically changed. 6o the selling and buying of the

=?

products and services, the transactions of money and the dissemination of !no ledge and learning is made electronically. &SD) 6&ntegrated services Digital )etwor*8! It provides the facility of transmitting the voice, data and images through telephone lines at accelerating speed ith minimum errors. I2/6 helps in connecting *', fa" machine and phone to a single line. This device is also becoming popular because of its higher speed, clear connections and broad communication capacities. ?aptopsIPalmtops! These devices are designed to ma!e the life more easy and quic!. These are of light eight and easily portable and hence bul! of information can be carried at any place. These devices are also used for e(mailing, organi1ing schedule appointments. ;arge amount of information is also e"changed because they have the same components li!e microprocessor, operating system, solid state memory, batteries, and display and input devices. ?A) 6?ocal Area )etwor*8! It enables us ith the connection of t o or more computers through fiber optical cable so that, employees of the same organi1ation can share the information and can communicate ith each other. It has certainly made the communication quic! and cheap. It facilitates the employees to communicate daily to a central office to submit their daily or! performed. -A) 6-ide Area )etwor*8! To connect the computers on separate sites, separate cities and separate countries, 0ide )rea 6et or! has been developed. )s data is transmitted over distance so, it requires a modem to insert. 'orporations often use 0)6 to communicate ith the e"ecutives and employees. 0ith the use of 0)6, no. of long distance phone calls have reduced and the or!load of unnecessary ritten files has lessened to large e"tent. &nternetI$7mail! Through the internet connections, people can e"change their information through various internet tools li!e E(mail. E(mail has become the most popular and cheap means of communication. $oreover, Internet is a orld ide computer net or!, by hich a user can communicate his message to another person in any part of the orld. Through e( mail, bul!y files can be sent to large number of persons at one time. Teleconferencing> It is basically an audio communication hich is possible through the phone. Through teleconferencing people in different part can see and hear each other. Teleconferencing plays a onderful part in delivering the important message especially hen e"ecutives are not interested in unnecessary travelling and also do not ant any interruption in or!. Teleconferencing is a verbal e"change of message among t o or more persons. @ideoconferencing! 7ideoconferencing enables group of people and individuals to interact ith each other sitting at different places. *eople can see and hear each other hile communicating. It provides a virtual visual meeting environment bet een t o or more participants. SMS 6Short Message Services8> This communication is done through telephones that enable receiving and the sending of the te"t message among different mobile phones. This te"t may be in the form of ords or numbers or the combination of alphanumeric. ,aH Machine! 9a" is one of the most popular media for transmitting the ritten as ell as visual material such as diagrams, copies, images, etc. these machines can be connected ith telephone both at transmitting end and receiving end. In the hole IT has revolutioni1ed the life of a common man.
=1

Positive &mpacts of &T on globalised economy 6o adays, the basic function of mar!eting is to plan, promote and to sell the product in the e"isting mar!et by grabbing the attention of the potential customers. 2o, business firms have turned to computers to perform their various mar!eting functions. 6o computers have manifold and multi(dimensional effects. /ue to this IT revolution, industrial economy is transforming into a digital economy in hich all the transactions are made electronically. $anagers ta!e help of computers in planning their product, in advertising their product and determining various channels of distribution. *roper communication bet een the interested parties reduces the points of friction and minimi1es those that inevitably arise. )ccording to 'handan E.y proper communication and sharing of information, the management ta!es the employees into confidence and ma!es them more !no ledgeable about problems and policies of the enterpriseF Today, computers are used in various fields to communicate the desired message to the clients, suppliers and customers. .usiness & manufacturing sector, ban!ing and insurance sector, post office, educational and medical institutions are the field here computer is used mainly. IT has changed the scenario of the society here the people of any age group are using these electronic devices for multiple reasons li!e entertainment, !no ledge and their or! performance. $emorial 2loan R 5ettering 'ancer in 6e Hor! is training I.$Gs 0atson to absorb millions of pages of cancer( research results, and use it to recommend ays of treatment. There are positive impacts of electronic media because it has transformed the business from a traditional to e(commerce&e(trading. It is impossible for any country to thrive unless it adopts the e( ays. This huge transformation has got possible only ith the help of IT. $oreover businessmen rely upon IT for multiple reasons li!e> because of its accelerating speed and accuracy %esearchers suggest that e"posure to violence in television, movies, video games, cell phones, and on the internet enhance the ris! of violent behavior on the vie erGs part. These buttons Rgadget devices have assumed a central role in a personGs life. These are the blessing of science and technology ill have to be used rationally other ise it ould uproot us from our culture and values. CO)C?0S&O) 9rom the above analysis of the paper, it can be concluded that during the end of the 2? th century, the society has seen a revolutionary change in the field of 'ommunication. It has altogether changed the scenario of communication process in the functioning of an organi1ation and in life of a human being. It ill help in enriching the society in this field through their innovative techniques. E'omputers that e use no are fast but dumb. Those in the cognitive computing era ill understand the conte"t in hich they function. They ill also learn constantly and improve their capabilities,F 8ari *ula!!at $,$ $)C$S 1. ..$. 8amer, E'ommunication ithin the or!placeFe(a research paper submitted in partial fulfillment of the requirement $aster of 2cience degree in Training and /evelopmente , The graduate 2chool 4niversity of 0isconsin R 2toutF )ugust(2??D
=2

2. .rennan -. (1=B@). The 'onscious 'ommunicatorN ma!ing communication or! in the or!place. )ddison R 0esley *ublishing 'o. %eading, $) <. 'handan -2, E$anagement concepts and strategiesF, 7i!as *ublishing house *vt.;td, 1==B, pp( <D1(<B@ @. 8ari *ula!!at, E'omputers as 8umansF The Economic TimesF, 11th of /ec, 2?1<, p( 11. D. -ohn %.0enburg and 0illiam 0.0ilmont EThe *ersonnel 'ommunication *rocessF -ohn 0iley (1=B<) p(D C. 7arinder 5umar and .odh %a+, E.usiness 'ommunicationF, *ulished 2?1<, pp(2, BB,1?D(11D. B. . i!ipedia.com

=<

COMPA AT&@$ A)A?4S&S O, A?%O &T"MS 0S$D ,O ,&)D&)% ASSOC&AT&O) 0?$S &) DATA M&)&)% Sanjivdatta P% Department of Comp#ter Science/ DA@ College/ Amritsar dattasanjiv1rediffmail+com A3ST ACT Data Mining 6DM8 is a step in the !no ledge discovery process consisting of particular data mining algorithms that, under some acceptable computational efficiency limitations, find patterns or models in data. In data mining, association r#le mining is a popular and ell researched method for discovering interesting relations bet een variables in large databases. /iscovering association rules is a core topic of data mining. The tas! of finding association mining, has received considerable attention over the last decades. This article presents a survey of evolution of association mining algorithms, giving an overvie to some of the previous researches done in this topic, evaluating the current status of the field, and envisioning possible future trends in this area. The theories behind association rules are presented at the beginning. 5+ &)T OD0CT&O) )ssociation (rule) mining, the tas! of finding correlations bet een items in a dataset, has received considerable attention, particularly since the publication of the )I2 and )priori algorithms J<KJ11K. /iscovering association rules is at the heart of data mining. It detects hidden lin!ages of other ise seemingly unrelated data. These lin!ages are rules. Those that e"ceed a certain threshold are deemed interesting. Interesting rules allo actions to be ta!en based upon data pattern. They can also help ma!ing and +ustifying decisions. Initial research as largely motivated by the analysis of mar!et bas!et data, the results of hich allo ed companies to more fully understand purchasing behavior and, as a result, better target mar!et audiences. )s the mar!et(bas!et problem is about finding out hat items people buy together ithout !no ing the person so that mar!eters can position items accordingly in the store to generate higher volumes of sales and ma!ing other !inds of sales decisions. 2ome of the rules discovered maybe trivial, e.g. people ho buy bread tend to buy butter. It is the e"traordinary rules that are interesting, e.g. people ho buy diapers also buy beers. It is the ability to discover the interesting rules that ma!es association rules discovery valuable and contributes to !no ledge discovery. )ssociation mining applications have since been applied to many different domains including mar!et bas!et and ris! analysis in commercial environments, epidemiology, clinical medicine, fluid dynamics, astrophysics, crime prevention, and counter(terrorismXall areas in hich the relationship bet een ob+ects can provide useful !no ledge. )ssociation mining is user(centric as the ob+ective is the elicitation of useful (or interesting) rules from hich ne !no ledge can be derived. The !ey characteristics of usefulness suggested in the literature are that the rules are novel, e"ternally significant, une"pected, nontrivial, and actionable. The
=@

association mining systemGs role in this process is to facilitate the discovery, heuristically filter, and enable the presentation of these inferences or rules for subsequent interpretation by the user to determine their usefulness. The problem of discovering association rules can be generali1ed into t o steps> (1) Finding large item sets and (2) Generating rules from these item sets. *revious researches are mostly along these lines and have gro n into various dimensions. This paper aims at revie ing some of the past or!s in the field, evaluating the current status, and envisioning future trends. $ost of the technical details of individual research are intentionally left out ith the e"pectation that interested readers ill read the original papers. The ne"t section first discusses the bac!ground theories behind discovering association rules. Then, it tal!s about researches in finding large item sets and the comparison of different algorithms. ;astly, it tal!s about researches in generating rules. .efore each subsection ends, a little discussion about the current status and future trends are presented. If available, applications of the ideas ill also be mentioned. The last section is the conclusion. >+ T"$O &$S .efore discussing researches in specific areas of mining association rules, it is orth revie ing the theories behind association rules, the different types of rules, and their generation. )ssociation rules are defined asstatements of the form dV1,V2,\,Vne (f H , hich means that H may present in the transaction if V1,V2,\,Vnn are all in the transaction. 6otice the use of ma to imply that the rule is only probable, not identical. 6ote also, that there can be a set of items, not +ust a single item. The probability of finding H in a transaction ith all V 1, V2, \,Vnis called confidence. The threshold (percentage) that a rule holds in all transactions is called support. The level of confidence that a rule must e"ceed is called interestingness J2K. There are different types of association rules. The simplest form is the type that only sho s valid or invalid association. This .oolean nature of the rule dubs the name .oolean )ssociation %ules. In our mar!et(bas!et e"ample, E*eople ho buy s!im mil! also buy lo fat oilF is a .oolean association rule. In spite of the various !inds of rules, the algorithm to discover association rules can generally be bro!en do n into t o steps> (1) 9ind all large (frequent) item sets ( ) large item set is a set of items that e"ceeds the minimum support. (2) ,enerate rules from the large item sets. The algorithms vary mainly in ho the candidate item sets are generated and ho the supports for the candidate item sets are counted. 2ince its introduction in J<K, the )priori algorithm has been the most mentioned algorithm for step 1. $any improvement JB, 1<K, e.g. speed up and scale up, of step 1 are about improving the )priori algorithm by addressing its fallacy of generating too many candidate item sets. There are also algorithms that are not based on )priori J=,11,12K but aim at addressing the issues of speed of )priori. 2tep 2 is mostly characteri1ed by confidence and interestingness. There are researches about different ay of generating rules JBK and alternative measure to interestingness JC, 1?K. There are also researches about generating different types of rules J1, DK.

=D

>+5 ,inding ?arge &temsets $ost of the earlier researches in mining association rules ere actually done in this topic. That includes a milestone research of the )priori algorithm. 7arious researches ere done to improve the performance and scalability of )priori included using parallel computing. There ere also studies to improve the speed of finding large item sets ith hash table, map, and tree data structures. 9ollo ing are the algorithms> >+5+5A&S There as a real bu11 in early =?s about ho to emulate the biological immune system in the real orld scenarios. The capacity of the immune system to proliferate cells that produce antibodies henever it detects a high degree of matching ith an antigen is, ithout doubts, fascinating. ) series of algorithms ere invented and ne systems called artificial immune s stems ere designed. )I2 algorithm uses candidate generation to detect the frequent item sets. The candidates are generated and counted on as the database is scanned. )fter reading the transaction, it is determined hich of the item sets that ere found to be large in the previous pass are contained in this transaction. 6e candidate item sets are generated by e"tending these large item sets ith other items in the transaction. ) large item set ; is e"tended ith only those items that are large and occur later in the le"icographic ordering of items then any of the items in ;. the candidates generated from a transaction are added to the set of candidate item sets maintained for the pass, or the counts of the corresponding entries are increased if they ere created by an earlier transaction. The disadvantage of the algorithm is that it generates and counts too many candidate item sets that turn out to be small. )I2 ere the first algorithm that introduced the problem of generating association rules. 2ee J11K for details. >+5+> Apriori T o of )prioriGs predecessors are )I2 J11K and 2ET$. )I2 and 2ET$ generate candidate item sets on(the(fly during the pass of database scan. ;arge item sets from previous pass are chec!ed if they are present in the current transaction. 8ence, ne item sets are formed by e"tending e"isting item sets. These algorithms turn out to be ineffective because they generate and count too many candidate itemsets that turn out to be small (infrequent) J<K. To remedy the problem, )priori, )prioriTid, and )priori8ybrid ere proposed in J<K. )priori and )prioriTid generate item sets by using only the large item sets found in the previous pass, ithout considering the transactions. )prioriTid improves )priori by only using the database at the first pass. 'ounting in subsequent passes is done using encodings created in the first pass, hich is much smaller than the database. This leads to a dramatic performance improvement of three times faster than )I2 and four times faster than 2ET$ in one of their e"periments in J<K. ) further improvement, called )priori8ybrid, can be achieved hen )priori is used in the initial passes and s itches to )prioriTid in the later passes if the candidate !(item set is e"pected to fit into the main memory. )nother scalability study of data mining as done in J1?K by introducing a light( eight data structure called 2egment 2upport $ap (22$) that reduces the number of candidate item sets needed for counting. 22$ contains the support count for the 1(itemset. The individual support counts are added together as the upper bound for !(item sets. )pplying this to )priori, the effort to generate 1(itemset is
=C

saved by simply inspecting those 22$ support counts that e"ceed the support threshold. 9urthermore, those 1(itemsets that do not meet the threshold ill be discarded to reduce the number of higher level item sets to be counted. >+5+B ,p7%rowth The )priori algorithm has its o n disadvantages that made other scholars thin! of ne approaches to mine frequent patterns. The t o main do nsides are the possible need of generating a huge number of candidates if the number of frequent 1(itemsets is high or if the si1e of the frequent pattern is big the database has to be scanned repeatedly to match the candidates and determine the support 0hat if e find a ay to mine the frequent patterns ithout candidate generationO This ould be a big improvement over )priori. This is hat the frequent(pattern gro th (9*(gro th) algorithm does. It adopts a divide(and(conquer strategy and a frequent(pattern tree. It stores information about the frequent patterns. ) 9*( tree(based method, called 9*(gro th, is also proposed to mine frequent patterns and does not involve candidate generation. 6ot only did JAK sho that 9*(gro th performs an order of magnitude better than )priori, it also sho ed that it is more scalable. 9rom iterative methods li!e )priori and /8* to innovative use of data structures li!e 22$ and 9*(tree, research in mining large item sets has made it more scalable and efficient. The need for faster and more scalable algorithms ill continue because databases are getting bigger and bigger every day. %esearch in distributed algorithms for finding large item sets ill gain more and more attention as more databases are integrated together. This presents a ne level of challenge that demands more fle"ible algorithms in vie of different representation of similar data, e.g. 1ip code maybe represented by string or integer, so that data do not need to be normali1ed before mining. $ore researches in parallel algorithms are also e"pected as grid computing is gaining interest. 'ompare to the numerous or!s done to search for better algorithms to mine large item sets, the qualifying criterion R support threshold R and the mechanism behind it R counting R have received much less attention. The problem ith support threshold is that it requires e"pert !no ledge, hich is sub+ective at best, to set this parameter in the system. 2etting it arbitrarily lo ill qualify item sets that should be left out, vice versa. $oreover, as database si1e increases, the support threshold may need to be ad+usted. The ne"t section ill highlight a fe researches that address some of these issues. >+> %enerating #les %esearch in rule generations mainly focus on ne er algorithms, deriving more types of association rules, and interestingness of the rules. 6e er algorithms mostly employ ne strategy li!e parallel computing JCK and Evolutionary )lgorithm (E)) JBK. 6e er rules types add dimension and quality to the traditional .oolean rule type. E"amples are quantitative association rules J1K and temporal association rules J@K. 6e er criteria JC, 1?K on interestingness tend to be more ob+ective than support and confidence. $ost of the association rules are generated by counting the number of occurrence of the rule in the database R the confidence. Therefore, it is intuitive to partition the set of all frequent item sets and count in parallel. Together ith the < parallel algorithms to mine frequent item sets, JCK presented a parallel implementation for rule generation using the previously(stated approach.
=B

In recent years, E) has been idely adopted in many scientific areas. E) borro s mechanisms of biological evolution and applies them in problem(solving. It is especially suitable for searching and optimi1ation problems. 8ence, the problem of mining association rules is a natural fit. JBK 4sed E) to generate association rules. It ta!es a population frequent item sets as the initial population. 4sing E) that includes crossover and mutation of these item sets, the population ill evolve into one that contains item sets ith better and better fitness function. 0hen the desired number of frequent item sets is left in the population, the algorithm ill stop. This novel ay of generating&searching association rules allo s for overlapping intervals in different item sets. 9or e"ample, one frequent item set can have interval from J1?, 2?K and another one can be J1D, 2DK. This is a sharp contrast to other techniques that divided the attributes into non(overlapping intervals. %ules that fall across t o intervals may not be possible for discovery, hence a loss of information. This algorithm allo s ne rules to be discovered. %esearch is also done in the types of association rules. )t the beginning of data mining research, .oolean association rules dominated the field. ;ater on, more focus as put on :uantitative )ssociation %ules. :uantitative association rules are rules over quantitative and categorical attributes li!e age and marital status. $ining these rules involve partitioning the values of the attribute, but may loss information as a result of the division. J1K Introduced an algorithm based on )priori to mine quantitative rules. It also introduced a partial completeness to measure information loss due to partitioning, and Egreater than e"pectedF interest as interestingness measure. *artial completeness is directly proportional to information loss. ,iven the minimum support and partial completeness by the user, the system can figure out the number of partitions needed. ) quantitative rule is interesting only if it has Egreater than e"pectedF support and&or confidence specified by the user. The algorithm scales up linearly ith e"perimental data J1K.The time dimension is one that e"ists in all transaction. Therefore, it should be included in finding large item sets, especially hen not all items e"ist throughout the entire data gathering period. J@K Introduced the temporal concept by limiting the search for frequent item sets to the lifetime of the item set members. It also introduced the concept of temporal support, in addition to the normal support and confidence. The lifetime of an item is defined by the first and last time an item appears in the database. The temporal support is the minimum interval idth. Thus, a rule is considered as long as there is enough support or temporal support. ) byproduct of this approach is that old, obsolete item sets can be deleted. )ny associations discovered by the above algorithms are eligible to be rules. The quality of those rules is measured by confidence. 8o ever, only those rules ith confidence above a certain level are interesting and deserve attention. $ost algorithms define interestingness in terms of user(supply thresholds for support and confidence. The problem is that these algorithms rely on the users to give suitable values. ) ne algorithm, called )*)'22, is proposed in JDK that does not require such guess or!, but ma!es use of an ob+ective interestingness measure called ad+usted difference. $oreover, )*)'22 can discover both positive and negative association rules. J=K presented a ne concept of relatedness as an alternative approach to determine interestingness.)*)'22 uses ad+usted difference as an ob+ective interestingness measure. )d+usted difference is defined in terms of standardi1ed difference and ma"imum li!elihood estimate. If the magnitude of the ad+usted difference is greater than 1.=C, i.e. =D percentiles of the normal distribution, the
=A

association is regarded as significantly different and hence, interesting. If the ad+usted difference is positive, it means the rule is li!ely, vice versa. The directional nature of ad+usted difference gives association rules discovery a ne dimension. Interestingness can be sub+ective R using support and confidence R or ob+ective R using ad+usted difference li!e JDK. )n opposite concept R relatedness R as introduced by J=K to e"amine relationship bet een t o items based on their co(occurrence frequency and conte"t. %elatedness is meant to be used in lieu ith interestingness to quantify association rules. %elatedness has three components> (1) average predictive ability of the presence of one item given the presence of the otherN (2) the intensity of the occurrence of an item(pair ith respect to other itemsN (<) the substitutability of another item for the items in the item(pair. These three measures give the strength of the relationship in terms of the frequency of the rule in relation to other items. The study of rule generation started from a single .oolean type using sub+ective measures of support and confidence. It has gro n to include various rule types ith ob+ective measures li!e ad+usted difference and relatedness. The ne researches have added both quality and quantity to rule generation. The quality is improved by using more ob+ective measures to qualify rules. The quantity is increased by novel methodologies that enable mining rules in overlapping intervals and negative associations. It is surprising to see that this topic is not researched more. The quality of the rules a system determined interesting is equally, if not more, important than the speed and scale to find these rules because the real goal of data mining is to mine interesting rules. #nly interesting rules are useful to help decision ma!ing. 4ninteresting or trivial rules, albeit from larger database quic!er, do not. Therefore, more effort should continue to pour in to investigate more ob+ective measures so that data mining can be parameter(free and operational, thus less sub+ective ith higher quality. This ay, domain e"perts can focus on interpreting the rules as oppose to orrying about ho to tune the mining parameters to produce meaningful rules. )s more and more ne data types are created, multimedia data for instance, more researches can also be done to define more association rule types. This may allo ne er behavioral pattern to be analy1ed and outcome predicted. The ability to profile multimedia data in its ra data format for data mining is particularly useful in medicine J12K or even homeland security. B+ CO)C?0S&O) The topic of discovering association rules has been studied over a decade. $ost of the foundation researches have been done. ) lot of attention as focus on the performance and scalability of the algorithms, but not enough attention as given to the quality (interestingness) of the rules generated. In the coming decades, the trend ill be to turn the attention to the application of these researches in various areas of our lives, e.g. genetic research, medicine, homeland security, etc. )s databases are integrated and the data themselves are getting bigger and bigger, algorithmic research about ho to scan faster and more ill receive attention and distributed algorithms that allo sharing of or!load in a grid computing environment ill gain more a areness. 0ith more and more data is created outside of traditional database, data mining and rule discovery ill gro out of scanning database tables into accessing data in its ra format, e.g. video clips. *erformance and scalability issues ill become more prominent. 6e er rule types maybe necessary to facilitate ne data analysis. $ore ob+ective measures of interestingness may also be required
==

to avoid manipulation of rule discovery criteria by domain e"perts to produce desired results. /iscovery association rules ill continue to thrive as a research topic. .ase on the research and development in the past decade, its form and focus areas are e"pected to be dramatically different in the ne"t decade. $,$ $)C$S 1. %ama!rishnan2ri!ant, %a!esh)gra al> $ining quantitative association rules in large relational tables. A!" #$%"&' (ecord, )roceedings of the *++, A!" #$%"&' international conference on "anagement of data #$%"&' +,, -olume ./ $ssue . . -une 1==C 2. $ing(2yan 'hen, -ia ei 8an, *hilip 2. Hu> /ata $ining> )n #vervie from a /atabase *erspective. $000 Trans. on 1nowledge and 'ata 0ngineering. 1==C <. %a!esh)gra al, %ama!rishnan2ri!ant> 9ast )lgorithms for $ining )ssociation %ules (1==@) @. -uan $. )le, ,ustavo 8. %ossi> )n approach to discovering temporal association rules. )roceedings of the .222 A!" s mposium on Applied computing 3 -olume *. $arch 2??? D. 5eith '. '. 'han, 0ai(8o )u> )n effective algorithm for mining interesting quantitative association rules. )roceedings of the *++4 A!" s mposium on Applied computing. )pril 1==B C. $. -. Ta!i, $. #gihara, 2. *arthasarathy, 0. ;i> *arallel data mining for association rules on shared(memory multi(processors )roceedings of the *++, A!"5$000 conference on #upercomputing 6!'(&") #upercomputing 7+,. 6ovember 1==C B. -. $ata, -. ;. )lvare1, -. '. %iquelme> Evolutionary computing and optimi1ation> )n evolutionary algorithm to discover numeric association rules )roceedings of the .22. A!" s mposium on Applied computing. $arch 2??2 A. -ia ei 8an, -ian *ei, Hi en Hin> $ining frequent patterns ithout candidate generation. A!" #$%"&' (ecord , )roceedings of the .222 A!" #$%"&' international conference on "anagement of data #$%"&' 722, -olume .+ $ssue .. $ay 2??? =. %a+esh 6atara+an, .. 2he!ar> /ata mining (/$)> poster papers> %elatedness(based data(driven approach to determination of interestingness of association rules. )roceedings of the .22/ A!" s mposium on applied computing #A! 72/. $arch 2??D 1?. ;a!s 7. 2. ;a!shmanan, 'arson 5ai(2ang ;eung, %aymond T. 6g> The segment support map> scalable mining of frequent itemsets. A!" #$%1'' 0xplorations Newsletter, -olume . $ssue .. /ecember 2??? 11. %a!esh )gra al, Thomas1Imielins!i, and )run 2 ami> $ining association rules bet een sets of items in large database. In )roc. &f the A!" #$%"&' !onference on "anagement of 'ata, *. 2?B(21C, $ay 1==<. 12. 2imeon -. 2imoff, 'habane/+eraba, #smar %. Tagane> $/$&5//2??2> multimedia data mining bet een promises and problems. ACM S G!"" #$plorations %e&sletter'-olume 8 $ssue .. /ecember 2??2

1??

O?$ O, % &D COMP0T&)% &) $D0CAT&O)! A) &)D&A) P$ SP$CT&@$ (amayani Assistant Professor/ 33( DA@ College for -omen/Amritsar *amayani2anand1yahoo+com A3ST ACT ,rid computing is a form of distributed computing hich provides the mechanism for large( scale sharing of computing resources, storage resources and equipments that appear to an end user or application as one large virtual image. )s grid computing ma!es available lo (cost high(performance computing (8*') infrastructures, education is one domain that can be benefited the most from grid computing. This paper presents an insight into grid computing and highlights various grid computing pro+ects in the field of education being implemented in India. ($4-O DS! ,rid 'omputing, ;ayered ,rid )rchitecture, ,)%4/), 6agaland Education ,rid, 5erala Education ,rid 5+ &)T OD0CT&O) Information and 'ommunication Technology has transformed our homes and businesses and has the potential to do the same for education. E(;earning is a result of the development of tools and techniques hich made the modeling of the teaching learning process more fle"ible to students and instructors. 8igher education stands to reap significant benefits from grid computing by creating environments that e"pose students to the Etools of the tradeF in a ide range of disciplines. ,rid computing encourages collaboration among educational institutions orld ide, thus providing a richer learning e"perience to students. There is a big difference in education sector bet een developed and developing countries li!e India. %eason is being, the unavailability of digital learning resources and computing po er in developing countries. In order to overcome this difference, there is a need for approach that supports the usage of geographically distributed computing and learning resources. )ccording to I/$ there are millions of distributes computers on the eb and most of the computing po ers of those *'s are under(utili1ed J1K. ,rid technology provides the solution by allo ing the integration of all the ideal resources and generating super(computing po er ithout affecting local autonomy. ,rid computing in a ay +oins computing resources ('*4, $emory etc.) to solve highly comple" problems. 4sing grid technology, it is possible to distribute processing and data capacity to different computers. Transparent to users to achieve 2uper processing capacity. ,rids can leverage previous investments in hard are and infrastructure to provide processing po er and other technology capabilities to educational institutions that need them. This reallocation of institutional resources is especially beneficial in servicing high demands for processing and storage by the institutions that lac! the infrastructure to do so. Instead of using the moc! data for the research or e"periments, the students can conduct research on the actual data lying some here else, hich ould other ise be unfeasible due to the physical location
1?1

of the resources. The students are no longer restricted to classroom teaching as grid computing facilities ne possibilities for 'ontent and instruction hence giving them ide e"posure. ,rid computing also enables mobile learning since learners can use portable devices to access resources on the grid. In a nutshell, grid allo s users to create educational communities and groups, providing a platform to share resources, information and ideas. >+ % &D COMP0T&)% The concept of grid has been ta!en from po er grid of electricity here grid is the bac!bone to carry the main po er that is generated from various resources J1K. )ll the users ho have access to the electrical grid simply use the electricity ithout !no ing here the po er plant is or ho the current gets to them JDK. ;i!e ise, ,rid technology connects geographically distributed resources li!e '*4 of computers, storage servers etc., through internet to produce a super high ay of informationGs storages and computing po er that can be shared by any user from any here in the orld. These resources are unified in such a ay that it seems to be a one large po erful computer hich helps millions of users to access various types of services simultaneously. B+ ?A4$ $D % &D A C"&T$CT0 $ ,rid computing uses middle are to coordinate disparate IT resources across a net or!, allo ing them to function as a virtual hole JDK. $iddle are acts as a protocol hich is used for communication from sources to destinations and vice versa. This middle are is divided in five individual layers hich have their o n dedicated tas!s. These layers are actually programs here communication technique is defined. J1K

,ig 5! %rid ?ayered Architect#re 9>= The lo est layer is called fabric layer hich is responsible for providing uniform access to all the resources of the grid. This layer is installed locally in all the machines to connect ith the grid. The connectivity layer defines core communication and authentication protocols required for grid(specific net or! transactions. 'ommunication protocols enable the e"change of data bet een fabric layer resources. )uthentication protocols build on communication services to provide cryptographically secure mechanism for verifying the identity of uses and resources JAK. %esource layer builds on 'onnectivity layer communication and authentication protocols for the secure initiation, monitoring, and control of sharing operation on individual resources.
1?2

%esources layer implementations of these protocols call fabric layer functions to access and control local resources. %esource layer protocols are concerned entirely ith individual resources and do not address the issues of global state and atomic actions across distributed collections JAK. 'ollective layers coordinate resources. This layer contains protocols and services that are not associated ith any one specific resource but rather are global in nature and capture interactions across collection of resources. The final layer in grid architecture comprises the user applications that operate ithin a virtual organi1ation environment. )pplications are constructed in terms of, and by calling upon, services defined at any layer. D+ &)D&A) &)&T&AT&@$S ,O $D0CAT&O) &MP?$M$)T&)% % &D COMP0T&)% ,O

D+5 %A 0DA &ndia 9;=! The /epartment of Information Technology (/IT), ,overnment of India has funded the 'entre for /evelopment of )dvanced 'omputing ('(/)') to deploy the nation( ide computational grid S,)%4/)G connecting 1B cities across the country in its ended on $arch 2??A, accomplished its deliverables by connecting 1B cities across @D academic and research institutes country ide along ith the required soft are for managing grid computing applications.,)%4/) is a collaborative environment of scientific researchers and e"perimenters on a nation ide grid of computational nodes, mass storage and scientific instruments that aims to provide the technological advances required to enable data and compute intensive science for the21st century. D+5+5 %A 0DA Connectivity! ,)%4/) ,rid net or! is entirely migrating to 6ational 5no ledge 6et or! (656), the facility built by ,overnment of India. 6ational 5no ledge 6et or! (656) is a multi 1?,bps net or! of 8igh 2peed 'omputing 3'ommunication system, implemented by the /epartment of Information Technology (/IT). The aim of 656 is to unite sta!eholders in science, technology, higher education, %3/ and governance. 656 enables the sharing of high(performance computing facilities, e(libraries, virtual classrooms, and more. D+5+> %A 0DA Components! The ,)%4/) grid follo s a 2ervice #riented )pproach (2#)) herein any large application can be modelled as independent number of discrete services ith ell(defined invo!able interfaces. The layered architecture helps Individual services to perform specific function sand hen called in a defined sequence form a complete business process or a larger application. Access Methods> 'urrently, access to the ,rid resources is through the high(speed communication fabric. ,)%4/) portal is used to access and e"ecute ,rid applications from a conventional 0eb bro ser and other des! top tools. It hides the comple"ity of the ,%I/ from the users. )ccess through 7ideo 'onferencing is also available. $ulti point video conferencing enable people to interact simultaneously from different place and supports their collaborative environment. Data Management> ,)%4/) provides integrated and distributed data storage architecture by deploying the 2torage %esource .ro!er (2%.) from 6irvana. 2%. creates

1?<

and maintains a ,lobal 6amespace across multiple heterogeneous and distributed storage systems in the ,rid so that users can access their data from any here at any time. Collaborative $nvironment> ,)%4/) initiated virtual communities ill focus on collaborative pro+ects in specific technology&application domain. The virtual communities are supported by forming 7irtual #rgani1ations to loo! into the collaborative *ro+ect /evelopment across ,)%4/) *artners. Management and Monitoring Tools> ,rid monitoring and management center at '( /)', .angalore helps in managing and monitoring all the components in the ,)%4/) ,rid. 'omponents li!e 6et or!, 'ompute nodes, 2torages, and 2oft are correctness are monitored on a 2@VB basis. )dvanced soft are li!e *aryave!shanam developed at '( /)', help ineffectively monitoring the health and utili1ation of various components of the ,rid. eso#rces> In this collaborative grid pro+ect, various resources such as high performance computing systems (8*') and satellite based communication systems have been committed by different centers of '(/)' and the partners of ,)%4/). Middleware and %rid Sec#rity> ,)%4/) ,rid deploys ,lobus Tool!it, version @.?.B (,T@), for the operational middle are functionality. ,)%4/) architecture deploys ,2I (,rid 2ecurity Infrastructure), 7irtual #rgani1ation (7#) $anagement and $y*ro"y mechanisms to enforce the security methods of the ,)%4/) ,rid.

D+> The )agaland %rid &nitiative J<K #n Dth $ay 2??A the 2chool of Engineering and Technology of the 6agaland 4niversity has successfully installed and commissioned E/4')TI#6 ,%I/ ,)TE0)H 2H2TE$ (E,,2) developed by the Indian Institute of Information Technology and $anagement R 5erala (IIIT$(5). The first advanced portable E(;earning 2erver as brought by the team from IIIT$(5 and integrated ith the ;)6 and Internet of the 2chool of Engineering and Technology at /imapur. 4sing the server, the team also commissioned 1@?? hours of recorded video lectures by eminent academicians in their respective field under the $8%/ funded 6*TE; (6ational *rogram on Technology Enhanced ;earning) program e"ecuted by the IITs and II2c. The sophisticated portable E(;earning 2ystems has been developed by the IIIT$(5 as part of its Education ,rid initiative that aims to improve quality of higher education through collaborations across premier institutions and universities. D+B (erala $d#cation %rid J@K The /epartment of 8igher Education of the 5erala ,overnment and the Indian Institute of Information Technology and $anagement R 5erala JIIT$(5K launched the 5erala Education ,rid as a state level plan initiative. This initiative planned to lin! the institutions of higher education through a collaborative !no ledge net or! of education servers over the Internet. In this education grid e;earning resource centers have been established at IIT$(5, 5ochi 4niversity of 2cience and Technology, 6ational Institute of Technology 'alicut and 'ollege of Engineering Trivandrum. D+D )ational Open (nowledge %rid proposed by &&TM7( JDK
1?@

IIT$(5 has proposed to build a 6ational #pen 5no ledge ,rid to enable technology enhanced collaborative learning environment in every sub+ect. The proposed grid ill functionally interconnect institutions, universities, colleges and %3/ organi1ations over broadband net or!s. C+ CO)C?0S&O) The orld has undergone transition from the Industrial )ge to the Information )ge and to the present 5no ledge )ge in a rapid ay. In this era, continuous learning ill decide the success of every organi1ation or individual. E(learning is believed to mar! the 1enith of the evolution of learning. Education should provide fle"ibility and adaptability rather than rigidity. ,rid technology !no s no boundaries and each field can ta!e advantage of technology, than!s to the ability to connect and communicate. )dapting grid computing, especially in field of education is necessary for both enhancing the quality of higher education and research and ill serve India in attaining a !no ledge superpo er. $,$ $)C$S 1. 2adeque Imam2hai!h, E)pplication of ,rid 'omputing for #nline ;earning %esourcesF. 2. 'hristian .ra1, E%,rid(;earning> The %ole of ,rid 'omputing in E(;earningF. <. 5 5annan and 5% 2rivathsan, E:uality Education through Education ,rid(The 6agaland InitiativeF. @. 5% 2rivathsan, E5erala Education ,ridF. D. 5% 2rivathsan, E6ational #pen 5no ledge ,rid and Technology Enhanced ;earning for :uality 8igher Education, *ost ,raduate Education and %3/ *roposed as a $ission $ode *rogram 4nder the 11th *lanF. C. .educase.edu&eli B. .garudaindia.in A. .ar"iv.org&pdf&cs.ar

1?D

A)A?4S&S O, 3?AC( "O?$ ATTAC( &) -& $?$SS S$)SO )$T-O (S andeep (a#r Assistant Professor/Trai Shatabdi %+%+S (halsa College/Amritsar+ *randeep::1yahoo+com A3ST ACT 0ireless sensor net or! is a gro ing technology hich is offering solution to variety of application areas such as health care, military and industry. These !inds of net or!s usually apply number of devices !no n as sensor devices. These sensors hich are limited are distributed over the environment and communicate through the ireless media. 0e simulated blac! hole attac!s in 6et or! 2imulator < (ns(<) and measured the pac!et loss in the net or! ith and ithout a blac! hole. 0e also proposed a simple solution against blac! hole attac!s. #ur solution improved the net or! performance in the presence of a blac! hole by about 1=I. &)T OD0CT&O) 0ireless sensor net or!s are composed of autonomous nodes that are self( managed. They usually have a dynamic topology such that nodes can easily +oin or leave the net or! at any time and they move around freely. They have many potential applications, especially in military and rescue operations such as connecting soldiers in the battle field or establishing a temporary net or! in place of one hich collapsed after a disaster li!e an earthqua!e.In these net or!s, besides acting as a host, each node also acts as a router and for ards pac!ets to the correct node in the net or! once a route is established. To support this connectivity nodes use routing protocols such as )#/7 ()dhoc #n(/emand /istance 7ector) or /2% (/ynamic 2ource %outing).0ireless sensor net or!s are usually susceptible to different security threats and blac! hole attac! is one of these. In this type of attac!, a malicious node hich absorbs and drops all data pac!ets ma!es use of the vulnerabilities of the on demand route discovery protocols, such as )#/7. In the route discovery process of )#/7 protocol, intermediate nodes are responsible to find a fresh path to the destination, sending discovery pac!ets to the neighbor nodes. $alicious nodes abuse this process and they immediately respond to the source node ith false information as though they have a fresh enough path to the destination. Therefore source node sends its data pac!ets via this malicious node assuming it is a true path. .lac! hole behavior may also be due to a damaged node dropping pac!ets unintentionally. In any case, the end result of the presence of a blac! hole in the net or! is lost pac!ets.In our study, e simulated blac! hole attac!s in ireless sensor net or!s and evaluated their effects on the net or! performance.0e made our simulations using ns(< (6et or! 2imulator version <). 8aving implemented a ne routing protocol hich simulates the blac! hole behavior in ns(<, e performed tests on different topologies to compare the net or! performance ith and ithout blac! holes in the net or!. )s e"pected, the throughput in the net or! deteriorated considerably in the presence of a blac! hole. 0e also proposed a solution based on ignoring the first established route to reduce the adverse
1?C

effects of the blac! hole node in a sensor net or! using )#/7 as a routing protocol. 0e implemented the solution also in ns(< and evaluated the results as e did for the blac! hole implementation. 0e presented the improvement due to our proposed solution in the proceeding sections. The paper is organi1ed as follo s> section 2 describes the )#/7 protocol and blac! hole attac!s are described in section <. 6et or! simulation results are presented in section @ and the proposed solution is described in section D follo ed by conclusions in section C. AOD@ O0T&)% P OTOCO? )dhoc #n(/emand /istance 7ector ()#/7) J1K is an on demand routing protocol hich is used to find a route bet een the source and destination node as needed. It uses control messages such as %oute %equest (%%E:), and %oute %eply (%%E*) for establishing a path from the source to the destination. 8eader information of these control messages are also e"plained in J1K. 0hen the source node ants to ma!e a connection ith the destination node, it broadcasts an %%E: message. This %%E: message is propagated from the source, and received by neighbors (intermediate nodes) of the source node. The intermediate nodes broadcast the %%E: message to their neighbors. This process goes on until the pac!et is received by destination node or an intermediate node that has a fresh enough route entry for the destination in its routing table. 9resh enough means that the intermediate node has a valid route to the destination established earlier than a time period set as a threshold. 4se of a reply from an intermediate node rather than the destination reduces the route establishment time and also the control traffic in the net or!. This, ho ever, leads to vulnerabilities as e"plained earlier.2equence numbers are also used in the %%E* messages and they serve as time stamps and allo nodes to compare ho fresh their information on the other node is. 0hen a node sends any type of routing control message, %%E:, %%E*, %E%% etc., it increases its o n sequence number. 8igher sequence number is assumed to be more accurate information and hichever node sends the highest sequence number, its information is considered most up to date and route is established over this node by the other nodes. 3?AC( "O?$ ATTAC(S In a sensor net or! that uses the )#/7 protocol, a blac! hole node pretends to have a fresh enough routes to all destinations requested by all the nodes and absorbs the net or! traffic. 0hen a source node broadcasts the %%E: message for any destination, the blac! hole node immediately responds ith an %%E* message that includes the highest sequence number and this message is perceived as if it is coming from the destination or from a node hich has a fresh enough route to the destination. The source assumes that the destination is behind the blac! hole and discards the other %%E* pac!ets coming from other nodes. The source then starts to send out its data pac!ets to the blac! hole trusting that these pac!ets ill reach the destination. 7ulnerabilities of sensor net or!s against blac! hole attac!s are studied by different authors. /eng et.al. J2K addresses the blac! hole problem and proposes a solution based on modification of the )#/7 protocol. The authors propose to chec! the route through the ne"t hop in the agreed upon path. This solution means that ne"t hop information shall be added to the standard )#/7 header. 2imilar approach is adopted in J<K here the nodes are as!ed to send their neighborhood sets once the route is established. In J@K t o solutions are
1?B

proposed for detecting the blac! hole attac! in sensor net or!s. 9irst solution involves sending a ping pac!et to the destination to chec! the established route. If the ac!no ledgement does not arrive from the destination, presence of a blac! hole is deduced. The other approach proposed is based on !eeping trac! of sequence numbers as blac! holes usually temper ith these sending pac!ets ith unusually high sequence numbers. ) survey of intrusion detection methods against various attac!s, including blac! hole attac!s, is given in JCK. )$T-O ( S&M0?AT&O)S To investigate the effects of blac! holes e simulated the ireless mesh net or! scenarios ith and ithout a blac! hole node present in the net or!. To be able to do that e introduced a ne protocol, hich e called M.8)#/7M, into the ns(<. 6odes hich are mar!ed as blac! holes adopted this protocol and behaved e"actly li!e blac! holes as described above. To test this protocol e used t o simulations of a small net or! ith B nodes. In the first scenario e did not use any blac! hole nodes and in the second scenario e added a blac! hole node to the simulation. 0e then compared the results of the simulations.0e used 4/* protocol in both simulations and attached '.% ('onstant .it %ate) application that generates constant pac!ets through the 4/* connection. '.% pac!et si1e is chosen to be D12 bytes, and data rate is set to 1 $byte. /uration of the scenarios is 2? seconds and the '.% connections started at time equals to 1.? seconds and continued until the end of the simulation in a D?? " D?? meter flat space. 0e manually defined appropriate positions of the nodes to sho the data flo and also introduce a movement only to 6ode 1 to sho the changes of the data flo in the net or!. ) blac! hole node is included in the net or! for the second simulation. 0e observed that the protocol is functioning as it should hence it could be applied to larger net or!s. 0e used 2? nodes in the actual test net or!s and 4/* connections are established bet een even and odd numbered nodes. In this setup the even numbered nodes are the sending nodes and odd numbered nodes are the receiving nodes. 9or e"ample 6ode ? is transmitting to 6ode 1, 6ode 2 to 6ode <, 6ode @ to 6ode D etc. 6ode 1A and 6ode 1= are used as blac! holes during the simulations as needed. Thus, e could count the sent and received pac!ets bet een any t o nodes. 0e could also count the number of pac!ets dropped at each node including the blac! hole nodes.In all the 1?? scenarios e tested, the same nodes are acting as a source and sending to the same destination but in each scenario, every single node is placed at different coordinates and e"hibits different movements. 6ode positions and movements are randomly generated. 9or each scenario nodes move from a random starting point to a random destination ith a speed that is randomly chosen in a BD? " BD? meter Qat space. Total simulation time is set to D?? seconds and the '.% connections started at the first second of the scenario and lasts for @D? seconds. 0e allo ed D? seconds for the buffers to be emptied after the transmission ends. In our scenarios '.% parameters are set to have pac!et si1es of D12 bytes, and data rates of 1? !bits&sec. 9or each scenario e performed t o simulations. In the first one every node is or!ing in cooperation ith each other to !eep the net or! in communication. The pac!et loss in a sensor net or! ithout any malicious nodes is presented in Table I.

1?A

In the second e introduced one malicious node that carries out the blac! hole attac! in the net or!. In this case node 1A acted as a blac! hole and node 1= as silent. 0e measured the number of pac!ets sent by the source and received by the destination. 0e also tried to evaluate ho many of the pac!ets that could not reach the destination node are absorbed in the blac! hole. These are also sho n in Table II. 0e could then compare the results of these t o simulations to understand the net or! and node behaviors. The results of the simulation sho that the pac!et loss in the net or! ith a blac! hole increases beyond that dropped by the blac! hole node. This e assumed to be due to increased congestion in the routes to ards the blac! hole node. 0e repeated these calculations for 2 blac! holes and the results are presented in Table III. The average of only D scenarios are used here and both node 1A and node 1= ere assigned .8)#/7 protocol. )d hoc net or!s may also e"perience pac!et loss due to parameters employed. In our 1?? simulations of a normal )#/7 net or!, e sa that data loss sho ed variations of up to I@? as the net or! parameters such as the distribution of the nodes changed.

S&M0?AT&O) A)D $@A?0AT&O) O, $S0?TS ) sensor net or! is basically a random graph. 2ome of the nodes are in direct communication if they are in the radio coverage area of each other. #ther nodes communicate through the routing performed by their neighbors. It is not an easy tas! to calculate the probability of having a route from one node in the net or! to another even for special cases JBK. 8ence the connectivity of the net or!s are usually determined through simulations or
1?=

e"haustive search, and usually only connectivity for the nodes hich are attempting to set up a connection is considered. In our case e generated random net or!s and created 1?? scenarios this ay. #ur net or!s in the different scenarios changed over time as the nodes moved randomly. 0e tested the conductivity of the net or!s and the number of hops for different paths during the entire simulation period. Tero hops means there is no connection bet een a pair of nodes. 9igure 1 sho s the measured and calculated probability of different distances bet een nodes in the net or!. .y distance e mean number of hops and the calculations are made assuming normal distribution. 9rom the figure 1?.A I of the nodes are ithin 1 hop of each other and this is in close agreement ith the results found in JAK.

0e also manually chec!ed the number of paths bet een the nodes under consideration as described in the previous section. 0e found out that for the scenarios e chec!ed there ere al ays a second route bet een the nodes hich are communicating. 0e also made the follo ing observations> 0hen )#/7 protocol is used, %%E* message arrived from different possible routes and in the cases e tested for e"ample one arrived at the source on average at tP 1.2BCD seconds as opposed to the %%E* message arriving from the blac! hole node on average at tP ?.2?D= seconds. It is reasonable to assume that an %%E* message ill arrive from the blac! hole earlier than the actual destination ith a higher probability as the blac! hole does not aste any time by chec!ing the tables.

11?

In some cases, this idea may not or!. 9or instance the second %%E* can be received at the source node from an intermediate node hich has stale information about the destination node or the second %%E* message may come from the blac! hole node if the real destination node is nearer than the blac! hole node. These e"amples may be e"tended according to the specific nodes in different net or! topologies.

.ased on the above arguments and observations e chose to use the second route for message delivery and investigated if this approach improves the net or! performance under the blac! hole attac!s in a sensor net or!. 0e implemented a ne protocol hich e called I/2)#/7 in ns(<. In this approach e used the first %%E* message to initiate the data transfer but if a second %%E* message arrived then e s itched to the ne route. To be able to evaluate if our solution improves the performance e used the same scenarios and simulation parameters as described previously. Table 7 sho s that the proposed approach reduced the pac!et loss by about 1=I, but the pac!et loss in the net or! ithout a blac! hole has also increased by about @I (Table I7). The proposed protocol does not require any e"tra pac!ets to be transmitted and the protocol pac!ets have not been modified. #nly the mechanism on hich the protocol acts is modified. #ur calculations sho that the probability of finding a dis+oint third route from the source to the destination is negligible. To verify this, e modified the I/2)#/7 protocol further to chec! for a third %%E* message ( e called this protocol <I/2)#/7) and use the ne ly notified route if one is found. The net or! started communicating using the route established by the first %%E* message, s itched to the route indicated by the second if a second %%E* arrived and then to the third one if one e"isted. The results of this approach ith and ithout a blac! hole are presented in Tables 7I and 7II respectively. The results sho that there is almost no difference bet een using the second or the third %%E* messages. This is due to the scarcity of the third dis+oint routes. CO)C?0S&O)S In this study e analy1ed the effects of blac! holes in sensor net or!s. 0e implemented an )#/7 protocol that simulates the behavior of a blac! hole in ns(< and e simulated 1??
111

scenarios each involving different sensor net or!s ith 2? nodes each moving randomly. 0e introduced a blac! hole in each scenario and compared the performance of the net or!s ith and ithout a blac! hole. 0e also tested a net or! ith t o blac! holes for only five scenarios. 0e then implemented a modified )#/7 protocol hich responded to the second %%E* message if it arrived assuming that it is more li!ely to have the first %%E* arriving from the blac! hole if one e"ists in the net or!. The results demonstrate that the presence of a blac! hole increases the pac!et loss in the net or! considerably. The net or! e"perienced A=.=DI pac!et loss on average due to the introduction of a blac! hole. This loss is partially (@A.A2I) due to pac!ets dropped in the blac! hole node and partially due to congestion in the net or! over the paths to ards the blac! hole node.The proposed modified )#/7 protocol reduced the pac!et loss due blac! hole attac! to B1.?=I hich is an improvement of 1A.ACI compared to the )#/7 protocol. 4sing the third %%E* message did not have any noticeable positive contributions to the pac!et loss in the net or!. The proposed protocol does not ma!e any modifications in the pac!et format hence can or! together ith the )#/7 protocol. )nother advantage is that the proposed I/2)#/7 does not require any additional overheads such as sending a ping to the receiver or !eeping a blac! hole list through a different protocol.

112

$,$ $)C$S 1. *er!ins, '.E., %oyer, E.$., M)d(hoc on(demand distance vector routingM, .cs.ucsb.edu&hravenben&classes&papers&aodv(mcsa==.pdf 2. /eng, 8., ;i, 0., )gra al, /., M%outing 2ecurity in 0ireless )d 8oc 6et or!sM IEEE 'ommunication $aga1ine ( #ctober 2??2) pp. B?(BD <. 2un, .., ,uan, H., 'hen, -., *ooch, 4.0., M/etecting blac! hole attac! in $obile ad( hoc net or!sM, @. )l(2hurman, $., Hoo, 2., *ar!, 2., M.lac! hole )ttac! in $obile )d 8oc 6et or!sM, )'$ 2outheast %egional 'onference (2??@) pp. =C(=B D. http>&&moment.cs.ucsb.edu&pub&rfc<DC1.t"t C. $ishra, )., 6ad!arni, 5., *atcha, )., MIntrusion detection in ireless ad(hoc net or!sM, IEEE 0ireless 'ommunications, 9ebruary 2??@, pp.@A(C?. B. *apadimitratos, *., 8aas, T. -., and 2irer, E. ,., M *ath set selection in mobile ad hoc net or!sM, *roceedings of the <rd )'$ international 2ymposium on $obile )d 8oc 6et or!ing 'omputing ;ausanne, 2 it1erland, -une ?= ( 11, 2??2 $obi8oc G?2 pp. 1(11.

11<

P OS A)D CO)S O, $7COMM$ C$!A) &)D&A) P$ SP$CT&@$ Tejinder -alia Assistant Professor/ Swami Satyanand College of Management & Technology/ Amritsar twjairaj#1gmail+com Pallavi Marwaha Assistant Professor/ Swami Satyanand College of Management & Technology/ Amritsar marwaha+pallavi1gmail+com A3ST ACT This is perhaps blessing in disguise for India that our country is still a developing country, because of this India has a lot of margins of gro th in different sectors and one of the sector having a lot of hidden potential is on(line trading. India has enormous potential for e( commerce business because of gro ing Indian per capita income, population, changing lifestyle trends and also because of liberali1ation, globali1ation and privati1ation. &)T OD0CT&O) +ust 22 years bac! orld ide eb as made public 3 only because of this revolution many invention, todayGs e(commerce become feasible 3 getting tremendous gro th in 2??? there ere more than 11? million users and B2 million domain names. It is estimated that in 2?1D there ill be <BC million users of internet orld ide. In India there are about 1<B million internet users. In 2?12 the total turnover of e( commerce business raised to U1@ billion and it is still increasing. It is e"pected to contribute around @I to ,/* by 2?2?. It is estimated that in 2?2@ Indian e( commerce revenue ill touch 42/ 12D(2C? billion. )ccording to a report by 9irst /ata 'orporation and I'I'I $erchant 2ervices, over BD million Indian citi1ens ill shop online by 2?1B, compared to ten million online shoppers in 2?12. Time spending on internet by an Indian is also increasing day by day. In 2?11 the average time spent per person per month as 12.= hours in 2??C, increase to 1B.@ hours in 2?11. )t present the main sector chosen for online trading are computer gaming, gambling, online tic!eting, clothing, ban!ing, insurance, grocercies and leisure etc. in India almost daily e see a ne e(commerce ebsite comes into picture and all of them are getting business. $any ne commercial T7 channels are being opened purely concerned ith online trading 3 they all are flourishing. 7enture capitalists and other private equity holder specially sho n a !een interest in this mar!et and they are very successful after indulging into this business. In India the best figures for e( commerce business are coming from online boo!ing for tour and travel. )s I have already said the traditional Indian thin!ing of saving money is decreasing day by day, no every Indian, even a lo middle class person ant to en+oy his or her life and they are not hesitating at all to spend the money on travelling. IndiaGs tour and travel industry is the second largest in the orld. /ecreased rates of domestic air tic!ets have revolutioni1ed the tour and travel industry. 6o even a common person can buy air tic!et very easily. )ll the domestic flights are attracting their customers through
11@

the advertisements and lots of seasonal discounts. It is said that the tour and travel industryG turn over ill be reached at 42U 111 billion by 2?1D. )irline passenger traffic ill increased to 1C2.< million in 2?12 from D=.< million in 2??D. #n line retail sector is the second largest e(commerce mar!et in India. The organi1ed retail sector is increasing very fast in India. It is e"pected that this industry ill match the online tour and travel industry by 2?1D. %etail industry at present in a childhood stage, if the government of India offers the india some ta" benefits, then it can gro more rapidly. .ut online retail sector have some challenges ahead specially in Indian mar!et. $ost of the Indians, henever they ant to buy their clothing ant to chec! them by touching and feeling the fibre ith their hands. This is not possible in online trading. It ill ta!e some time to remove this mental barrier from Indian customers. 0hile purchasing perfumes and other accessories, the same barrier e"ists. Then there ill be very tough competition of Indian retails sector ith the global retail players. )fter the announcement for D1I 9/I by the government, a lot competition ill increase. )ll the global players can invest big amount of money, and they can even bear heavy losses too. If the competition ill be high then the profit margins ill be narro . If the Indian online retail industry ants to face the foreign retail sectors then the margins of profit ill be less and more discounts have to be given to customers to attract them. The online classifieds are third big industry in India. #nline recruitment, online matrimonial services and online real estate businesses are also gro ing fast. )t present #nline recruitment covers C2.DI of the business of the total online classified business in India ith a mar!et si1e of 42U ==.2 million. $any things are there hich support the decision of +umping into this business. 9irst, India is gro ing very fast and all the foreign investors are considering India the best mar!et to invest in any form of business. 0hy any form because e can find here different persons having different financial statuses, from poor to billionaires and they are not fe in number. The purchasing po er of different Indians vary from %s.one for a small thing to %s t enty crore to buy a car. If any company focuses on +ust one percent of the total population of India, it becomes 1.2 crore. 2o they can sell 1.2 crore of their products monthly or annually. 2econd reason to invest in India is that, India is a country of different eathers. #ne regionGs eather is different from other region, so a company can select any region in India depending upon the nature of their product. The third reason for any company to run their online trading business successfully is that Indians are changing their life styles very frequently. 6o Indians money saving old thin!ing is changing and they are no spending lavishly. They ant to get all lu"uries and comforts of life ithout hesitating to spend good amount of money. 9ourth reason is that per capita income of Indians is increasing day by day. It is estimated that by 2?1D, per capita income of an Indian ill be increased t o and half times than hat they are getting at present. Incomes of Indians are increasing and the prices of *'Gs are decreasing, so more number of Indians can no by computers. 'ompetitions among T7 channels concerned ith online trading and different e( commerce ebsite are increasing day by day and this is good for customers. $any discounts and other free schemes are being given to them. )ccording to e"perts of e( commerce, often 2?1< all the companies related ith on line trading ill focus or
11D

customers lay, better customer services and many more personali1ed offers. It is also observed that slo ly cash on delivery phenomenon ill become obsolete and the use of debit as ell as credit cards ill be on force front, but still this industry needs a lot of e"posure as ell as a areness in India. #ur country has many areas, regions here even still people are una are of internet. $any villages loc! the facility of internet. 7ery big gaps bet een the economic condition of people of India, illiteracy rate is high, still a lot of unbalance and diversification in geographical and demographical conditions. E( commerce needs another sha!eout in India and that is mobile e( commerce. .ecause against 1<B million internet users in India, the number of mobile users are =D1 million. $obile users in non metros and other smaller to ns ould li!e to get informations for online travel boo!ings(retail and services for other financial transactions as their approaches to reach at malls and multiple"es are very limited, they have to cover lot of distance for these things. %esidents of smaller to ns have much more mobiles than having internet connections.smartphones have revolutioni1ed the benefits of internet. In India you can purchase smartphones at less than D??? %s. It is estimate that mobile user base ill account for C?I of the total internet user in India by 2?1D. )fter e( commerce it is no the turn of $('ommerce. )lready ripples are being created in Indian e( commerce mar!et. The companies concerned ith e( commerce business are raising funds very frequently for further e"pansions, because they have started earning profits, li!e 2napdeal,$yntra, 8ealth!art and many more. 9lip!art alone raised %es. 12?? crores recently for further e"pansion programmes. Earlier the companies ere focused on urban mar!et. .ut no they are focusing on rural mar!et as ell.e(commerce companies are no building arehouses outside the central places, so that deliveries to rural areas can become feasible and the product could reach upto the customer ithout delay. Indian on(line customers have some unique demands. 9irst is everybody li!e cash(on(delivery system. Though fe companieies for the benefit of customers have started another form of '#/ facility that is card(on(delivery.no the courier company brings a mobile machine for card s apping at the time of delivery.)ma1on.com in 'hina has started doing the same activity. 2emi( urban and rural customers of India do not ant to give money before receiving the product, a lot of trust and confidence of Indian customers is yet to be achieved by e( commerce companies. 2emi(urban and rural customers ant to avoid any ban!ing procedure for money transactions. 9e of them donGt a are of ban!ing and fe have un!no n mental restrictions. 2econd demand of Indian customers is that return process of products should be seamless and easy. #ne of the top company have started pic!ing the products from homes to get the loyalty and confidence of the customers. Third demand of customers is that delivery of the product should be free of cost. This psychology of the customers is already understood bt the companies and many of them are giving free delivery. 2till a lot of technical changes are required for the ebsites related ith e( commerce, many ebsite are not user friendly so frequent change must he done for easy trading. Tal!ing on the negative aspects, the big hindrance for e(commerce industry is the shortage of trained manpo er in India. ;ac! of e( commerce courses and diplomas are negligible. The attrition rate is as high as CDI at +unior level and 2?I at senior level. /ue
11C

to shortage of manpo er companies are poaching employees from others. 'ertainly online trading ill decrease the employment of sales 3 mar!eting staff. This is my personal thin!ing that as more 3 more online trading and shopping e"pands, more health 3 physical problems amongst the consumers ill arise. 0e have already made our life very comfortable. The consumer ho ould purchase the things from the mar!et, 0al! here 3 there for shopping ill be more physically fit than the customers ho ould shop online. in India small scale industrialist thin! that e(commerce business is meant for big industrial houses only but I thin! this is rong, smaller companies ho cannot invest huge money on advertisements can no advertise ith very less investments on Eyou tubeF and Emy spaceF a lot of companyGs resources can be saved. 2maller companies ho cannot ho cannot set up their offices in different countries or open sho rooms can no very easily approach international customers ith the ith the help of e(commerce. 6o it ill be very easy for the companies to reach customers via emails and mobile smsGes, if they ant to !no different customer needs and ants. 6o some companies concerned ith e(trading are setting up different departments li!e mar!ing dept, finance dept 3 8% dept. CO)C?0S&O) 0ith the advent of online trading, no customer ill not face geographical boundaries, if they ant to get any brand of product. Though ma+ority of urban population of India is using internet, but government is still not using benefit of e(commerce. 2ome important documents li!e )adhar cards, voting cards forms should be filled online. 0ith this a lot of time 3 money can be saved. The distribution net or! built by the government cannot reach upto all individuals. 0ith the e"pansion of e( commerce the numbers of s!eptical consumers are decreasing. $ore and more shopping is ta!ing place. Even one can purchase at lesser prices than from the malls and multiple"es. There is still a lot of insecurity among the consumers ho ant to use debit and credit cards for money transactions. ,overnment should ta!e some further steps to ensure security of payments for online transactions. Especially in India there is no legal protection against online transactional frauds. Intellectual property rights should also be given. In the end I ould say that the benefits of e(commerce are much more than the ill effects, and golden period of e(commerce is +ust around us. $,$ $)C$S 1. *roblems and prospects of e( commerce( )l!a %aghnath and $urli /har *angta 2. e( commerce(an Indian perspective( *.T.-oseph, 2.-. <. e(commerce in India begins to give physical retail a run for its money( 6ivedita $oo!er+i. @. e(commerce in India> past present 3 future( )mrita )ggar al 3 others D. %ebirth of e(commerce in India( Ernst and Houng ($ilan 2heth) C. Trends in IndiaGs e(commerece $ar!et(Tia /aniell 0igder and $anish .ahl,)ugust 1<, 2?12
11B

,ACTO &),?0$)C&)% CO)S0M$ OS O)?&)$ 304&)% 3$"A@&O A)D ATT&T0D$ Dr+ 3i*ramjit Singh "#ndal Associate Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ Dr+ Sa#rabh %rover Associate Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ @i*as (#mar . ,/ %#r# )ana* Dev 0niversity/ Amritsar+

A3ST ACT This paper addresses one of the fundamental issues of e(mar!eting> ho to attract and in over the consumer in the highly competitive Internet mar!et place. )nalyses the factors affecting the online consumerGs behavior and attitude e"amines ho e(mar!eters can influence the outcome of the virtual interaction and buying process by focusing their mar!eting efforts on elements shaping the customerGs virtual e"perience, the 0eb e"perience. Identifying the 0eb e"perience components and understanding their role as inputs in the online customerGs decision(ma!ing process are the first step in developing and delivering an attractive online presence li!ely to have the ma"imum impact on Internet users. 'lic!(and( mortar firms delivering superior 0eb e"perience influence their physical clientsG perceptions and attitudes. %esearch provides a contribution to the theoretical debate around the factors influencing the online consumerGs behavior. ($4-O DS! Internet mar!eting, 0orld 0ide 0eb, #nline operation, 'onsumer behavior, buying behavior Type> %esearch paper &)T OD0CT&O) )t the heart of business today lies the Internet, a global net or! of net or!s enabling heterogeneous computers to directly and transparently communicate and share services ith customers. It can lead to a completely ne economy. Internet business is the point here economic value creation and information technology come together. (;ee et al., 2??<). 9or the past fe decades, businesses are itnessing the intensity of rapid changes in usage of information technologies (IT), for the business decision(ma!ing purposes. *revious studies sho ed that, in the 1==?s, businesses used to perceive the Internet mostly as a communication tool referring to the e(mail and multimedia capabilities, sending or do nloading documents, etc. (*oon, 2 atman, 1==B). To fulfill some primary commercial functions, such as gathering information by e"ploring other 0eb sitesN providing customer support and conducting on line transactions (2oh et al, 1==B).The consumerGs buying behavior has been al ays a popular mar!eting topic, e"tensively studied and debated over the last decades hile no contemporary mar!eting te"tboo! is complete ithout a chapter
11A

dedicated to this sub+ect. The predominant approach, e"plaining the fundamentals of consumer behavior, describes the consumer buying process as learning, information( processing and decision(ma!ing activity divided in several consequent steps> *roblem identification, Information search, )lternatives evaluation, *urchasing decision, *ost purchase behavior (.ettman, 1=B=). ) distinction is frequently made bet een high and lo involvement purchasing, implying that in practice the actual buying activity can be less or more consistent ith this model, depending on the buyerGs perceived purchasing ris!s. 8igh or lo degree of involvement is also a question of buyer e"perienceN products purchased for the first time, in general, require more involvement than frequently purchased products (.oyd et al, 2??2). 6e"t to identifying the steps of the buying process and the potential role of mar!eting in each stage, mar!eters are eager to comprehend ho purchasing choices and decisions are made, ho consumers are li!ely to react to innovation and ho to predict the outcome of the customer vendor interaction (/avis et al., 1=A=). $ost academics and practitioners agree that demographic, social, economic, cultural, psychological and other personal factors, largely beyond the control and influence of the mar!eter, have a ma+or effect on consumer behavior and purchasing decisions (8arrell 3 9ra1ier, 1===). /espite their incapacity to e"ercise any substantial influence on the above factors, mar!eters can have some bearing on the outcome of the buying process by engaging different mar!eting tools, the most prominent being the @*s R product, price, place and promotion R also !no n as the mar!eting mi" (.orden, 1=C@). $ar!eting practitioners none the less idely deem the @*s as the tools that can influence the consumerGs behavior and the final outcome of the buyer(seller interaction (5otler and )rmstrong, 2??1). #nline buying behavior 4nderstanding the mechanisms of virtual shopping and the behavior of the online consumer is a priority issue for practitioners competing in the fast e"panding virtual mar!et place. This topic is also increasingly dra ing the attention of researchers. Indicative of this is the fact that more than 12? relevant academic papers ere published in 2??1alone ('heung et al., 2??<). ,iven the continuous e"pansion of the Internet in terms of user numbers, transaction volumes and business penetration this massive research endeavor is not surprising. $ore than 2? per cent of Internet users in several countries already buy products and services online (Taylor 6elson 2ofres, 2??2) hile more than D? per cent of 42 net users regularly buying online (9orrester %esearch, 2??<). These developments are gradually transforming e(commerce into a mainstream business activity hile at the same time online consumers are maturing and virtual vendors reali1e the importance and urgency for a professional and customer(oriented approach. Het the Internet meltdo n at the end of the 1==?s and plenty of more recent anecdotal and empirical evidence indicate that many online firms still do not completely understand the needs and behavior of the online consumer (;ee, 2??2) hile many of them continue to struggle ith ho effectively to mar!et and sell products online (-oines et al, 2??<). )s in the case of traditional mar!eting in the past, most of the recent research and debate is focused on the identification and analysis of factors that one ay or another can influence or even shape the online consumerGs behaviorN a good deal of research effort is focused on modeling the online buying and decision(ma!ing process ('oc!burn and $c5en1ie, 2??1). T"$ MA ($T&)% M&E $?$M$)TS
11=

 Price The number of literature references of the price as an input influencing the online consumerGs behavior is limited. 6e"t to that, research on the role and importance of the online price contradicts the predominant belief that price is the main motivator for consumers hen choosing a particular 0eb site. )nd hile most online consumers ould insist that lo price is their ma+or motive to buy online products, facts do not seem to confirm this. %esearch based on clic!(through analysis indicates that only A per cent of 0eb users in 6orth )merica are aggressive price hunters and only <? per cent of purchasing managers identify lo er prices as the !ey benefit of buying online (The $c5insey :uarterly, 2??1). 9actors found in the literature associated ith the price as part of the 0eb E"perience are the price level, the online promotional actions or discounts and the price transparency. ,#lfillment 0ith the e"ception of digiti1ed products (music, soft are, e(boo!s, etc.) easily delivered online, for all other types of products offered online the order fulfillment and product delivery do not coincide ith the placing the online order. The ay online vendors follo up orders and deliver products has an immediate impact on the illingness of customers to order and more importantly, to return to the 0eb site for business in the future. )lternative payment methods, fast delivery, fle"ible delivery options and order trac!ing are frequently mentioned elements of the fulfillment process. Promotion This element is also rarely found to be one of the essential ingredients of the 0eb e"perienceN the number of relevant literature references is rather limited. 2pecific promotional elements mentioned in the literature as enhancing the 0eb e"perience are free e"tra services, sales promotions and incentive programs. COMM0)&CAT&O) The literature references on this aspect refer to the quality of information provided about the firmGs products, the clarity of selling conditions and the delivering terms. Information can to a certain degree compensate the lac! of physical contact ith the product, reducing the online consumerGs uncertainties. $@&$- O, ?&T$ AT0 $ 2even studies have been revie ed and formulated in tabular form hich enumerates ma+or ob+ectives and findings. .ohnson %eorge & Swap 65:F>8 found that male and female sub+ects loo! for different qualities in another person hen assessing his or her trust orthiness. 9or male sub+ects, the scale includes factors of reliability, emotional trust, and general trust. 9or female sub+ects, similar, but not identical, reliability and emotional trust factors emerge. 0ith respect to our research e include gender issues to e"amine hether requirements for trust are different bet een male and female 2hoppers. #ther demographic variables, especially age and education level, are regarded as important factors that greatly influence consumer behavior. In our final model these t o variables are controlled.

12?

 ,ra'ier et al 65:FF8/ the presence of a ebsite undoubtedly can convey some sense of a firmGs trust orthiness to consumers. If the ebsite is the only means to interact ith the consumers a firm ith an e"clusive online presence, it is important to e"amine its characteristics. In a traditional buyer seller relationship, a salespersonGs !no ledge of the product, the ability to sell, besides personal characteristics such as li!eability, honesty, consistency, customer(orientation, familiarity ith the customer, and prior e"perience are considered important in reali1ing the sale and building consumer trust. Mc(night et al 65::F8/ eb Trust indicating that the firmGs compliance ith standards of internal business processes or order fulfillment, or assuring that the firm has employed specific technologies to enable secure and reliable order and payment handling and legal recourse indicating that the firm ill ma!e every effort to fulfill its promises to consumers, or ris! reaping sanctions through social disapproval or legal action. ?iang and "#ang 65::F8 found that consumersG prior e"perience had a moderating effect in predicting their acceptance of Internet shopping. %esearch related to the adoption of other technology based shopping formats have also indicated that previous non(store e"perience may help predict intention to adopt interactive electronic formats and that shoppers ho use electronic shopping technologies have more e"perience ith these or related technologies. Thus, past non(store and online e"periences may have a direct impact on a consumerGs trust in an e(firm, because !no ledge or e"perience is related to increased assessment of the trust orthiness of an Internet vendor. M#rphy . et al 65:::8/ in the case of an Internet vendor, the ebsite is perhaps the only ay a firm communicates ith its customers. Therefore, its appearance and structure can encourage or discourage a consumerGs purchase intentions. In the mar!eting literature ebsite features such as layout, appeal, graphics, readability, and ease(of(use have been considered to affect consumersG clic!ing frequency. Shim et al 6><<58/ a consumerGs attitude to ard online shopping is mirrored by his or her perceptions of shopping convenience, hich can be measured by the e"tent to hich a consumer accepts the Internet as a ne shopping medium and ho useful it really is. 2ub+ective norms refer to a consumerGs perceptions of the e"tent to hich significant referents approve of Internet use for shopping. *erceived behavioral control is reflected by the perception of ease(of(use of the Internet as a shopping means, perceived control in interaction (the use of personal information), and perceived ris! in E(commerce system security and privacy. Miya'a*i & ,ernande' 6><<58/ ho found that more e"perience ith the Internet and the use of other remote purchasing methods are related to lo er levels of perceived ris! to ard online shopping, hich in turn results in higher online purchase rates. This leads to the inclusion of three additional variables in this study about the characteristics of consumer time since the Internet has been used, frequency of shopping online, and e"perience of shopping through other direct purchase methods such as catalogs. O3.$CT&@$S O, T"$ ST0D4 1. To analy1e the 9actors Influencing 'onsumerGs online buying behavior. 2. To study the attitude of consumers to ards online mar!eting.
121

,ACTO S A,,$CT&)% T"$ O)?&)$ CO)S0M$ OS 3$"A@&O ,#nctionality factors! 9actors enhancing the online e"perience by presenting the virtual client ith an good functioning, easy to e"plore, fast, interactive 0eb site. 9unctionality includes E4sabilityF and EInteractivityF elements. Psychological factors! 0eb sites must communicate integrity and credibility in order to persuade customers to stop, e"plore them and interact online. *sychological factors are those playing a crucial role in helping online customers unfamiliar ith the vendor or unfamiliar ith online transactions to overcome fears of fraud and doubts as to the trust orthiness of the 0eb site and vendor. 0sability! 6ah and /avis (2??2) define 0eb usability as the ability to find oneGs ay around the 0eb, to locate desired information, to !no hat to do ne"t and, very importantly, to do so ith minimal effort. 'entral to this idea of usability are the important concepts of ease of navigation and search (6ah 3 /avis, 2??2). 4sability is considered as an important quality criterion of information systems (*reece et al, 1==@) and 0eb sites (#sterbauer et al, 1===). Elements enhancing the 0eb site usability are the convenience of using the site, the loading speed of the pages, the information structure etc. Convenience! %esearch indicates that convenience is a prime motivator for 0eb customers to stop and interact ith online vendors. 'ustomers associate convenience ith easy and fast information bro sing, shopping and settling of the online transactionN 0eb designers must try to understand ho their customers are li!ely to perform these activities online and ad+ust their procedures accordingly. S&T$ ,&)DA3&?&T4 A)D ACC$SS&3&?&T4 $ost 0eb consumers are searching for products and services by means of search engines and online directories. It is very important that site designers apply a consistent search engine strategy so that online consumers can easily find the site. 0eb sites must be further more accessible by users ma!ing use of different types of 0eb bro sers. Site speed! #nline customers e"pect fast loading 0eb pages. 0eb designers must !eep in mind that the average time customers per page vie ed is lo and steadily diminishing over time ('oc!burn and $c5en1ie, 2??1). OrderingIpayment processes! 'umber some and lengthy processes required for ordering and settling online transactions are still one of the most important sources of customer irritation, loss of good ill and interrupted online transactions. ) balanced approach is necessary so that 0eb sites remain simple to use and secure at the same time. Psychological elements! online tr#st !#nline trust is one of the issues researchers, as ell as practitioners, frequently associate ith the success or failure of online ventures. )ccording to 8arris Interactive (2??1) around B? per cent of the 42 0eb users are seriously concerned about the safety of their personal information, transaction security and misuse of private consumer data. 2ub+ects li!e hac!ing, fraudN spam and online scams frequently ma!e headlines, raising security concerns as ell as s!epticism and mistrust. The physical distance, lac! of personal contact and the anonymity of the Internet are also factors further increasing the consumersG an"iety and ris! perceptions. #nline firms, especially those lac!ing strong

122

brand recognition and physical presence, should not underestimate the importance of trust as a 0eb e"perience element. Transaction sec#rity and c#stomer data safety! )re principal concerns of online customers purchasing products or services online. 2ervice disruptions, hac!ing into online vendorsG databases and display of customer data on clandestine 0eb sites are frequent Internet incidents as!ing for constant vigilance by online firms. Clear ordering/ payment and ref#nding proced#res! )s ell as concrete customer policies, good communication and strict security help customers face online transactions ith more confidence. #nline vendors can also in security(minded customers by offering multiple payment alternatives, something though not al ays feasible (e". customers overseas). %#arantees and ret#rn policies! ;i!e in traditional business, product guarantees offered by 0eb firms are po erful tools for gaining competitive advantages, raising the level of customer trust and reducing the online transaction an"iety. 'lear policies outlining product returning procedures and compensation in case of dissatisfaction ith the product have been found to have a positive effect on online vendorsG credibility. 0ncertainty red#cing elements! 'omponents of uncertainty reducing elements are Efrequently as!ed questionsF (9):s) and conflict(resolution policies. )llo ing easy access of online customers to this type of information enhances trust but also reduces the number of inquiries of customers ith questions on such issues. CO)C?0S&O)S A)D &MP?&CAT&O)S %esearch on factors influencing the consumer online buying behavior has revealed that there are several factors hich effect consumer buying decision In the case of consumers buying behavior the @*s of the mar!eting mi" are considered as the main controllable tools influencing the buying behavior. %esearch indicates that in the case of the 0eb consumer a set of elements e"perienced during the virtual interaction are indeed the controllable factors affecting the online buyer. This study identifies the main constituents of the online e"perience or 0eb e"perience as being> the functionality of the 0eb site that includes the elements dealing ith the siteGs usability and interactivityN the psychological elements intended for lo ering the customerGs uncertainty by communicating trust and credibility of the online vendor and 0eb siteN and the content elements including the aesthetic aspects of the online presentation and the mar!eting mi". These three sets of factors are the main online mar!eting tools under the control of the e(mar!eter. /espite the fact that a good deal of research has been done on identification of the individual components of the 0eb e"perience during the last five years, little attention has been paid in integrating this research endeavor. This study, based on an e"tensive revie of research published during the last si" years, identifies and classifies these 0eb e"perience components in a frame or! emphasi1ing their e"tend, variety and interdependence. The study also underlines the fact that !no ledge as to the e"act ay these factors interact ith each other as ell as their individual eight and importance is still very limited. The 0eb e"perience frame or! can be useful to both practitioners and academicsN it could help online mar!eters and 0eb site designers to identify issues requiring special attention hen designing and building their online firm or evaluating their e"isting online venture. 9or academic researchers this classification could be a basis for the
12<

formulation of ne hypotheses and research questions leading to better mapping of the online consumerGs behavior. The frame or! could also be the basis of further research focused on better understanding of the nature and eight of the 0eb e"perience elements, either in isolation or in interaction ith each other and in different virtual mar!et settings. The proposed classification also has limitations> some of the factors included in this frame or! have presumably received relatively more research attention than others as indicated by the number of papers found to deal ith these particular elements. It ill be premature to dra any conclusions as to the importance of each of these elements or to relate them directly to any steps of the buying process on the basis of this study. It is also possible that factors not included in the classification can be important elements of the 0eb e"perience yet neglected by researchers so far. 9inally, the 0eb e"perience must be regarded as a dynamic and evolving sub+ect rather than a static oneN developments in the virtual mar!et place, changing customer techno graphics and technological innovation ill present e(mar!eters ith ne tools and methods for enhancing their customersG online e"perience. In that respect this study depicts the current picture of the research done thus far, a good starting point for further research in the direction of developing a comprehensive theory on the online buying behavior. $,$ $)C$S 1. )./. $iya1a!i and ). 9ernande1, (2??1), 'onsumer perceptions of privacy and security ris!s for onlineshopping, The -ournal of 'onsumer )ffairs, <D(1), 2BR@@. 2. .ettman, -.%. (1=B=), )n Information(*rocessing Theory of 'onsumer 'hoice, )ddison(0esley, ,len 7ie , I;. <. .orden, 6.8. (1=C@), EThe concept of the mar!eting mi"F, -ournal of )dvertising %esearch, -une, pp. 2(B. @. .oyd, 8.0., 0al!er, #.'., $ullins, -. and ;arrei chei, -('. (2??2), $ar!eting $anagement, ) 2trategic /ecision($a!ing )pproach, $c,ra (8ill&Ir in, 'olumbus, #8. D. '. -ohnson(,eorge and 0.'. 2 ap, (1=A2), $easurement of specific interpersonal trust> 'onstruction and validation of a scale to assess trust in a specific other, -ournal of *ersonality and 2ocial *sychology, @<(C), 1<?CR1<1B. C. 'heung, '.$.5., Thu, ;., 5 ong, T., 'han, ,.0.0. and ;imayem, $. (2??<), E#nline consumer behavior> a revie and agenda for future researchF, *roceedings of the 1Cth .led e'ommerce 'onference, .led, =(11 -une. B. 'oc!burn, ). and $c5en1ie, .. (2??1), E0hat do 0eb users doO )n empirical analysis of 0eb useF, International -ournal of 8uman('omputer 2tudies, 7ol. D@, pp. =?<(22. A. /.8. $c5night, ;.I. 'ummings and 6.;. 'hervany, (1==A), Initial trust formation in ne organi1ational relationships, )cademy of $anagement %evie , 2<(<), @B<R@=?. =. /avis, 9./., .ago11i, %. and 0arsha , *.%. (1=A=), E4ser acceptance of computer technology> a comparison of t o theoretical modelsF, $anagement 2cience, 7ol. <D 6o. =, pp. =A2(1??<.

12@

1?. 9orrester %esearch (2??<), E9orrester %esearch pro+ects 42 ecommerce to hit nearly U2<? billionF, press release, available at> .forrester.com&E%&*ress&%elease& ?,1BC=,A2<,??.html, and E'onsumer technographics>the online consumer 1==A to 2??<. 11. ,.;. 9ra1ier, %. 2pe!man and '.%. #G6eal, (1=AA), -ust(in(time e"change relationships in industrial mar!ets, -ournal of $ar!eting. D2, D2RCB. 12. 8arrell, ,./. and 9ra1ier, ,.;. (1===), $ar!eting, 'onnecting ith 'ustomers, *rentice(8all, Engle ood 'liffs, 6-. 1<. 8arris Interactive (2??1), E*rivacy leadership initiativeF,available at> .ftc.gov&bcp& or!shops& glb&supporting&harrisI2?results.pdf 1@. -. $urphy, 2urfers and searchers, (1===), 'ornell 8otel and %estaurant )dministration :uarterly A@R=D. 1D. -oines, -.;., 2cherer, '.0. and 2cheufele, /.). (2??<), EE"ploring motivations for consumer 0eb use and their implications for e(commerceF, -ournal of 'onsumer $ar!eting, 7ol. 2? 6o. 2, pp. =?(1?A. 1C. 5otler, *. and )rmstrong, ,. (2??1), *rinciples of $ar!eting, *rentice(8all, Engle ood 'liffs, 6-. 1B. ;ee, '., 'hoi, .., ;ee, 8. (2??<), ) development environment for customer(oriented Internet business> e.i1.ench, The -ournal of 2ystems and 2oft are, 7ol. B2, pp. 1C<( 1BA. 1A. ;ee, *($. (2??2), E.ehavioral model of online purchasers in e(commerce environmentF, Electronic 'ommerce %esearch, 7ol. 2, pp. BD(AD. 1=. $c5insey :uarterly (2??1), E,etting prices right on the 0ebF, %eport 6o. 2, available at> .mc!inseyquarterly.com 2?. 6ah, 9.9.(8. and /avis, 2. (2??2), E8'I Internet research issues in e(commerceF, -ournal of Electronic 'ommerce %esearch, 2pecial Issue> 8uman 9actors in 0eb(based Interaction, 7ol. < 21. #sterbauer, '., 5oj hle, $., ,rechenig, T. and Tscheligi, $. (1===),E0eb usability testing> a case study of usability testing of chosen sites (ban!s, daily ne spapers, insurances)F, *roceedings of Dth )ustralian 0orld 0ide 0eb 'onference 22. *oon, 2., 2 atman, *. $. '., (1==B)> 2mall business use of the Internet. 9indings from )ustralian case studies, International $ar!eting %evie , 7ol. 1@, 6o. D, <AD(@?2. 2<. *reece, -., %ogers, H., 2harp, 8., .enyon, /., 8olland, 2. and 'arey, T. (1==@), 8uman('omputer Interaction, )ddison(0esley, 0o!ingham. 2@. 2. 2him, $.). Eastlic!, 2.;. ;ot1 and *. 0arrington, (2??1), )n online prepurchase intentions model> The role of intention to search, -ournal of %etailing, BB, <=BR@1C. 2D. 2oh, '., $ah, :. H., ,an, 9. -., 'he , /., %eid, E. (1==B)> The use of the Internet for business> the e"perience of early adopters in 2ingapore, Internet %esearch> Electronic 6et or!ing )pplications and *olicy, 7ol. B, 6o. <, 21B(22A. 2C. T.*. ;iang and -.2. 8uang, (1==A) )n empirical study on consumer acceptance of products in electronic mar!ets> ) transaction cost model, /ecision 2upport 2ystems, 2@, 2=R@<. 2B. Taylor 6elson 2ofres (2??2), The T62 Interactive R ,lobal ecommerce %eport, available atN .tnsofres.com& ger2??2&home.cfm.

12D

O?$ O, O)?&)$ MA ($T&)% &) "OT$? &)D0ST 4 Mr+ (#nal aheja Assistant Professor/ Swami Satyanad College of Management and Technology/Amritsar+ *#nalraheja5:<;1gmail+com Ms+ Swati Madaan/ Assistant Professor/?a*shay College Of "otel Management swatimadaan>F1gmail+com A3ST ACT #nline mar!eting is a go green activity and a boon to the hotel industry. In every business sector it is becoming a hot topic and even plays a very important role in mar!eting strategy of hotel industry. 8otel industry is getting a lot of business through internet. ;ots of guest love to reserve their rooms by +ust chec!ing their requirement and if any hotel meets the same they boo! them online by gathering information. #nline mar!eting is effective for both guest and hotel perspective. 8otels are getting online reservation and providing information about their product and services they are offering. The guest is getting easily access to the information about the hotels and one can choose the best suited hotel according to their budget. 0e can easily say that online mar!eting is providing a boost to hotel business.Information systems form a fascinating and rapidly e"panding field of study. 8ospitality traditionally lags other sectors in adopting information technology (.uic!, 2??<) J2K. #nline mar!eting has e"panded and brought more opportunities for hotels so that they can approach their guest easily. The information in this paper is from ebsites, research papers, articles and thesis by qualitative research method. ($4-O DS! #nline mar!eting, 8otels, :ualitative, %esearch &)T OD0CT&O) The concept of online mar!eting has e"panded and opened more opportunities for hotels to approach their guests. Earlier, the Internet as only to contact guests, it as part of direct mar!eting. 6o adays particularly ebsites has been becoming a famous media for hotels to introduce their products and services. The Internet is becoming and considered as an independent and effective mar!eting tool. The Internet brings a ide range of services, products and prices from different hotels to the guest. It is another steady means to obtain items for guests even also gives hotels big opportunities to e"pand into the ne mar!ets,. .esides this, for employees have ne chances to improve their s!ills and contribute e"tremely to the competitiveness for their hotels. 9or hotels to be successful, a set of different mar!eting activities has to be managed effectively efficiently by the organi1ations. /uring last fe years the demand of internet users increased lots hich sho s that no a dayGs every buddy ants to get the information in +ust a single clic! hich is not possible ithout online information and this online information is being provided by the hotels by means of online

12C

mar!eting there are various ays by hich hotels do the online mar!eting some are as follo s. 5+ 3anner ads The most idely used forms of the advertising online are that of banner ad J1K. In this the ad is on the ebsite and usually highlights itself ith different si1e, colour, and motion. It can be in different mode any punch line, video or a question. In the bac! history hen these banners ads started they ere non moving square, picture or te"t. .ut today it is often a video that starts hen u start over the mouse or clic! it on the same. Therefore this banner ad can be easily compared to an outdoor communication form that developed ith the internet. The rate of interest for banners are calculated in t o ays, firstly the brand a areness (%obinson et al 2??B), here the remembrance of your message or brand name is important. 2econdly by a rate of interaction ( the clic! through rate ('T%) R the more people ho clic! on the banner, the more value the advertiser has been given. It has been found that hile repetition reduces 'T% is enhances brand a areness (%obinson et al 2??B). >+ Pop7#ps It is defined by a ne page (of the current bro ser) opens on top of the page you are currently visiting. There are different variations of the pop(up> #pening a ebsite under the one currently being visited called the pop7#nder The pop(inN here something is covered or blurred at the visited ebsite for advertising something. *op(ups can be designed to appear hen a ebsite is loading, after a period of time is spend on a ebsite, or upon leaving the site&closing the indo . *op(ups can appear as small indo s covering a portion of the host ebsite, it can therefore be less intrusive, e.g. hen not covering a vital te"t or similar. &' ,loating ad 9loating ad is a type of media advertisement that appears compulsory over the requested ebsites content. These types of ads disappear and become less obstructive after a time period. D+ $Hpanding ad These types of ad changes dimensions upon a preset condition, such as a preset amount of time a guest spends on a ebpage, userLs clic! on ad, or the userLs mouse movement over ad. E"panding ads allo the advertisers to fit more of information into a controlled ad space. C+ Tric* banners ) tric! banner is banner ad here the ad copy imitate some screen part users commonly encounter, such as a popular application message or operating system message or to induce ad clic!s. Tric! banners typically donGt mention the advertiser in the ads, and thus they are the form of bait(and(s itch. Tric! banners commonly attract the higher(than(average clic!( through rate. G+ TeHt ads Te"t ad displays te"t(based hyperlin!s. Te"t(based ads display separately from the eb pageLs primary content, or they can be entrenched by hyper lin!ing individual phrases or ords to advertiserLs ebsites. Te"t ads may also be sent through te"t mar!eting or email

12B

mar!eting. Te"t(based ads often render faster than graphical ads and can be harder for ad( bloc!ing soft are to bloc!. 7. Search $ngine Mar*eting 6S$M8 2E$ or 2earch Engine $ar!eting is designed to boost a ebsiteLs visibility in search engine results pages (2E%*s). 2earch engines often employ visual cues to compare sponsored results from organic results. This mar!eting includes all of an advertiserLs behaviour to ma!e a ebsiteLs listing very prominent for topical !ey ords. T"$ &)T$ )$T AS A MA ($T&)% TOO? ,O "OT$?S There are four main channels of distribution for hotel services, namely> direct (fa", telephone, or Internet), tour holesaler, retail travel agent, and specialty channeler. The Internet is considered as ne est tool of mar!eting outlet for hotel services out of above channels. $ar!eting and promoting is very essential for the success of any hotel. Internet ith its nature of reaching ide ranging is a very effective mar!eting tool. .y replacing traditional modes of mar!eting it is very effecting and time saving. The cost of mar!eting on internet is also lo as it is cheaper to communicate on electronic medium. This is one of the important reasons hy various companies in the hotel industry are setting up sites on ( ) 0orld 0ide 0eb in order to create virtual shopping, to promote their products and to offer services. The Internet mar!eting increases the communication opportunities, especially for fara ay or island destinations. Internet, because of a high(speed ay of information communication, is fitting in ell as an ideal channel for tourism mar!eting. It enables hotel businesses to improve their competitiveness and performance.To increase the performance of any hotel and to increase the business the most suitable product of any hotel is accommodation hich is easily available on the Internet. $ost of the hotels have created ebsites to improve their guest services in recent years since the Internet has proven to be an effective means of advertising, mar!eting, and distributing and as an information(disseminating tool (8uang 3;in, 2??C). Especially, hotels use Internet to promote the products and services and even compete ith the counter parts. Increasing numbers of the Internet users ma!e use of Internet> to get information, to plan schedules, and to search and buy hotel related products. the Internet enables hotels to interact ith their guests and continuously alter their products and services in order to meet and e"ceed guest e"pectations. SOC&A? M$D&A AS MA ($T&)% TOO? 2ocial media sites are online platforms and tools, hich ma!e the collaboration and co( operation of the users on the Internet. The users are enable to team up on the content, share o n opinion, share their e"periences, contact others +ust for pleasure or for business. 2ocial media sites li!e 0i!ipedia or Hahoo offer great possibilities and opportunities for hotels to advertise and promote. In these sitesN 8otels are allo ed to promote their products and services or events. 2ocial media sites enable the people to use eb not +ust to receive information, but also to interact ith other users. The interaction bet een them happens in a ay that the users are able to post comment on each otherGs posts. )ccording to 2terne (2?1?) at the moment there are different e"ternal categories to social media. 8e as ell said that there may be already some more coming up. Therefore the gro th
12A

of these types of social media tools is fast and rapidly changing. 8o ever he lists si" categories almost all of the sites enable people to interact ith others. 2ome of these are for users to as! questions or submit an opinion, here others can easily ans er to them. 0hereas some of social media sites are there for giving feedbac! or to comment on products, E"ample commenting on the boo!s and other products on )ma1on.com. )s ell there are other social net or! site such as 9aceboo! and ;in!edIn, hich are semi(open communities for connecting online and allo ing the users to communicate or collaborate in different ays. (2terne 2?1?.) 2#'I); $E/I) 0E. 2ITE2 /el.isio.us, .lin!list, 2impy (2#'I); .##5$)%5I6,) /igg, *ropeller, %eddit (2#'I); 6E02) 9aceboo!, 8iD, ;ast.9$ (2#'I); 6ET0#%5I6,) Interacting by voting for articles and also commenting on them. Interacting by adding and follo ing friends, sharing your information, adding pictures, adding posts, adding videos and lin!s to your profile and also commenting on othersG profile. Interaction by sharing videos and photos and commenting on others shared files. T8EI% *4%*#2E Interacting by searching thorough ebsites

HouTube, 9lic!r (2#'I); *8#T# 3 7I/E# 28)%I6,) 2ocial media net or!ing sites (-uslkn 2??=.)

3$)$,&TS O, O)?&)$ MA ($T&)% 3enefits to Cons#mers! %#ests Stay 0pdated! The internet !eeps guests updated through ebsites, emails, social net or!ing sites and online adverts. $any guests can use the internet on the move through technology such as smart phones and tablets. $anufacturers and retailers can instantly update their guests through the internet. %#ests Can Compare Online! The greatest advantages for the guest are that they can easily compare services or products hat they ish to buy from the comfort of their o n homes. Instead of visiting a number of different retail outlets, the user simply has to chec! on different internet indo to compare prices or features of the product&service they ish to purchase. $any retailing ebsites offer facility here different products they sell can be easily compared. There is also facility of price comparison on ebsites that guest can use to get the best price for their products. Clear Prod#ct &nformation for the %#est! 0ebsites offer clear and consistent product information to all the internet users. There is little chance of mishearing or misinterpretation hat the sales man said as in a retail store. The internet has ample
12=

product information hereas in the shop the guest is reliant in the !no ledge of their sales advisor. Transparent Pricing! *ricing online is very transparent and clear for the guestN the guests can easily access pricing information from a range of seller ith a fe internet clic!s. The guest can easily ta!e advantage of the pricing this information can be easily access information 2@ hours a day. 0hereas prices for products offered for sale in retail premises can only be accessed hilst the store.

3enefits to mar*eters! (1) %#est elationship 3#ilding> the companies can interact ith guests to learn more about the needs and to build guest databases. (2) &ncrease $fficiency & ed#ce Costs> maintaining a physical store is e"pensive, costs of rent, insurance, and utilities. (<) %reater ,leHibility> a paper catalog can be easily ad+usted hourly or daily other than the printed catalog hich canGt be changed. It is easy to adapt product accessibility, promotions and prices, and to match changing mar!et conditions. (@) Access to %lobal Mar*ets> The Internet is a orld ide medium, it allo s sellers and buyers to clic! from one place to another in seconds. ,ACTO S P $@$)T&)% CO)S0M$ S , OM $).O4&)% O)?&)$ MA ($T&)% )ccording to ;iebermann Hehoshua and 2tashevs!y 2hmuel (2??2, 2=1(<??), the factors hich can prevent guests from using and believing in #nline mar!eting include &nternet credit card stealing! $a!ing payment online in +ust a single clic! too easy but still lots of people donGt ant to go for the same. These days credit card theft rate is getting too high. This is the main reason hy people donGt go for using online payment methods. ,ear of s#pplying personal information! ,uest is fear of getting their personal information lea!ed. The companies usually call during the or!ing hours hich ma!e guest very annoying. 2ome time guest are of very reserved nature and they even donGt ant that their information get lea!ed to the companies. Pornography and violence! #nline mar!eting is very efficient and effective ay. *eople love to go for this information but the trouble is hile going for the ebsites pop up of various porn sites come out hich should not be there. &nformation reliability! Information provided on these ebsites are not much reliable. )t the time of purchasing the information provided is different but after purchasing the items the configuration changed. Even during reservation of rooms the prices are different as hidden prices are not sho n to the guest but after the room reserved the price got raised. ?ac* of physical contact! There is not any personal contact ith the manufacturer and the seller the payments are made online. .ecause there is no physical contact if e receive any damaged items again e have to send the same items through the channel it ta!es long time.
1<?

)ot receiving &nternet prod#cts p#rchased! This type of activities commonly can be seen these days in day to day life. The items are purchased and payment is done online but the products are not received. These types of practices are not trust orthy hich ma!e a negative impact on the online mar!eting reputation. &nternet #sage addiction> #nline mar!eting provides information on online rather than buyers visit any retail shop they got all the information on the eb only. Every time for purchasing of the items the buyer have to use internet and the regular use of internet leads to internet addiction.

S-OT A)A?4S&S .elo is listed several facts, hich according to the research findings ere seen as strengths, ea!nesses, opportunities and threats to the #nline mar!eting. .y listing these facts, it is certainly easier to be able to compare these together and to prioriti1e them. .y having a list of these aspects to #nline mar!eting it is easy to ma!e conclusions on hether Internet mar!eting is an effective ay of mar!eting for a business or an Industry. 2T%E6,T82 'ost(effective $easurable $odifiable Targeting ider target group #pen data 7arious options 0E)56E22E2 Too ide Tough 'ompetition 'onstantly changing Emerging ne trends and devices 'ustomers are advanced #**#%T46ITIE2 ,etting ne customers 'ustomer relationship ;oyal customers Investment 0ebsite visitors T8%E)T2 Targeting rong people

1<1

6ot enough !no ledge 6ot !eeping up 0rong tools ith ne trends and devices

CO)C?0S&O) The internet plays a very vital role in mar!eting hotel products and services. The hotels can easily promote and advertise their services and attract the guest to their property. )s internet is a cheap and popular medium the guest love to reserve their rooms online and boo! services according to their requirements. Even online mar!eting has lots of negative points bust still it is the favourite medium for guest to get the information and reserve their accommodations. .y this research paper one can easily say that the online mar!eting plays a very vital role in hotel industry. $,$ $)C$S 1. .uic!, I. (2??<). MInformation technology in small 2cottish hotels> is it or!ing.M International -ournal of 'ontemporary 8ospitality $anagement 1D (@)> 2@<(2@B. 2. ;iebermann Hehoshua and 2tashevs!y 2hmuel (2??2, 2=1(<??), *erceived ris!s as barriers to Internet and e(commerce usage <. 6guyen p. ;inh and 8oang tung 2??A, Internet mar!eting acquisition process p1A, ;ahti 4niversity of )pplied 2ciences, /egree *rogram in International .usiness Thesis. @. *eter #G'onnor, *h./, -amie $urphy, *h./. ) %evie of %esearch on Information Technology in the 8ospitality Industry. D. %obinson, 8elen 3 0ysoc!a, )nna 3 8and, 'hris (2??B), EInternet advertising effectivenessF International -ournal of )dvertising p D2B(D@1, 0orld )dvertising %esearch 'enter ;imited. C. http>&& . isdomportal.com&.oo!s&#nline$ar!eting.html.

1<2

S$C0 &T4 3AS$D M0?T&,$AT0 $ $CO%)&T&O) S4ST$M %#rjeet Singh Assistant Professor/Trai shatabdi %+%+S+(halsa college/Amritsar+ g#rjit>;1gmail+com A3ST ACT *alm print is a promising biometric feature used in access control and forensic application. The e"isting method includes the use of multiple features of palm print to significantly improve the matching performance. In this paper, a simple methodology of acquiring an image for palm using camera is done. The captured image is cropped to obtain the region of interest (%#I). The features absolute co(efficient, hori1ontal co(efficient, vertical co(efficient and diagonal co(efficient are e"tracted from the region of interest. These features are e"tracted using si" level 8aar transform. ($4-O DS! %egion of interest (%#I), 8aar transform, Energy levels. &)T OD0CT&O) .iometric is the most secure and convenient authentication tool. .iometrics provide security benefits across the spectrum, from IT vendors to end users, and from security system developers to security system users .iometrics measure individualLs unique physical or behavioral characteristics to recogni1e or authenticate their identity. *alm print recognition system is a digital image processing system hich can be designed using a $)T;). source code. *alm print is universal, easy to capture and does not change much across time. *alm print biometric system does not requires speciali1ed acquisition devices. It is user(friendly and more acceptable by the public. .esides that, palm print contains different types of features, such as geometry features, line features, point features, statistical features and te"ture features. In this paper no special lighting is used in this setup. The hand image is segmented and its !ey points are located. The hand image is aligned and cropped according to the !ey points. The palm print image is enhanced and resi1ed. 2equential modified 8aar transform is applied to the resi1ed palm print image to obtain modified haar energy ($8E) feature. The sequential modified 8aar avelet can maps the integer(valued signals onto integer(valued signals ithout abandoning the property of perfect reconstruction. The $8E feature is compared ith the feature vectors stored in the database using Euclidean /istance. The accuracy of the $8E feature and 8aar energy feature under different decomposition levels and combinations are compared. 3&OM$T &C M$T"ODO?O%4 ) basic palm print biometric system has four stages. They are image acquisition, image preprocessing, feature e"traction and feature matching. 9igure 1 sho s a basic palm print biometric system.

1<<

,ig 5!3asic Palmprint 3iometric System *alm print can be acquired using digital camera. /igital camera can acquire high resolution image in longer distance compared to ''/ camera. It can also be connected to computer as the real time acquisition device. The hand image (palm print) is usually ta!en in front of a dar! intensity bac!ground to ease the image segmentation process. Image pre(processing includes region(of(interest selection. %egion(of(interest (%#I) selection is the cropping of palm print image from the hand image. The %#I mas! is square, circle or custom in shape. 2quare %#I mas! is used in most of the earlier or!. 'ircled %#I mas! and custom %#I mas! are used if the feature e"tractor required specific types of %#I region. The feature e"traction depends on the types of feature targeted. In some cases, different features types are combined to form a ne feature types. 9or e"ample, the combination of line feature and geometry feature to form line geometry feature. The e"tracted feature is usually represented and stored as a feature vector. In feature matching, feature vectors ere compared using similarity measurement. The complete overvie of the e"isting palm print biometric system is sho n in 9igure. 2

,ig >!Complete Overview of $Histing Palm print 3iometric System In the e"isting or!, a palm print based biometric system that can be or! in peg(less environment. The !ey point in the hand image is determined before the palm print image is selected and e"tracted. The palm print image is normali1ed and its features are e"tracted. Three different feature e"traction methods, namely, /iscrete 'osine Transform (/'T) energy feature, 0avelet Transform (0T) energy feature and 2obel'ode, hich can be used to represent the palm print effectively is investigated. The figure < uses a novel orientation estimation algorithm for palm prints.

1<@

,ig B! ,lowchart of composite algorithm ) ne initial estimation method is developed to reliably estimate the orientation field even in regions having many creases. It is crucial for the palmprint recognition system to reliably estimate the orientation field. It is used in ridge enhancement and minutiae validation, ma!ing it very important in minutiae e"traction. 7arious #rientation estimation algorithms have been proposed for fingerprints these algorithms consist of t o main steps> initial estimation and post smoothing. ;ots of post smoothing methods has been designed, including the hierarchical gradient method, the model(based method, the region gro ing algorithm, etc. .ut no matter ho po erful these smoothing algorithms are, they all rely on the results provided by the initial estimation. If there are over helming errors in the initial estimation results, no smoothing algorithms can generate reliable results magically. The complete overvie of the proposed palmprint biometric system is sho n in 9igure @.

,ig D! 3loc* diagram of the proposed method In the proposed or!, a palmprint based biometric system that can be or!ed in real(time is proposed. The follo ing sections e"plains the condition during hand image acquisition, determination of the !ey points in the hand image, *almprint image selection ,e"traction and matching are e"plained in 2ection gives the overvie of feature e"traction and representation. The results and discussion among different type of methods have also been done .The final section summari1es the conclusion obtained from this or!.

1<D

&MA%$ ACK0&S&T&O) The right(hand images of different users are ta!en in front of a uniform dar! intensity bac!ground using high resolution digital camera. In our palm print acquisition device, a digital camera is used to capture high(resolution palm print images. In our e"periment, a /I$),E Vt camera is used, and the collected palm prints are 2?@A_1D<C 2@bit %,. images. To obtain high verification accuracy, it is important to construct an ob+ective verification database. Therefore, e collected palm print images at different times and different position, and built our palm print database. In the collection, 1? individuals provided their palm prints, mainly consisted of volunteers from the students and staff at our college.

,ig C! $Htracted feat#res ,$AT0 $ $ET ACT&O) 9eature e"traction is a step to e"tract the meaningful features from the segmented %#I for the later modeling or verification process. In e"tracting the features, e use the operator(based approach to e"tract the line(li!e features of palmprint in the %#I of palm table. ) si" level 8aar transform is being used for feature e"traction inorder to obtain both high and lo frequency coefficients. The follo ing steps are involved 2tep 1> Image is converted to binary 2tep 2> .oundary tracing A(connected pi"els algorithm is applied on the binary image to find the boundary of palmprint image .The starting point is the bottom left point E*F and the tracing direction is counter cloc! ise. The end point is also E*F. )nd these boundary pi"els are collected in .oundary pi"el vector (.*7). It calculates the energy level 2tep <> Euclidean distance is calculated bet een database image and input image. E /ist P J(V(V1) [2 Z (H(H1) [2K [ (1&2) ((( (1) "AA -A@$?$T T A)S,O M The 8aar avelet is the simplest possible avelet and presents a good capability to identify data variations, as ell as to preserve the variations location. 9or the simulations, it is considered the 8aar avelet ith one null moment to detect the borders of the neptune attac! JAK. The scale function l(") and the corresponding 8aar avelet function m(") are given by> n(") P d1o2, ? p t p 1 ?, other ise

((((((2)

1<C

q(") P d1o2, ? p t p r ?, othe ise (((( (<) 6ote that it operates on data by calculating the sums and differences of ad+acent elements. In our analysis e are going to consider a threshold value of B?I of $a" P $a"s d+!s,!P?,...,n+t1, n+ P 2Tt+ per level. This operation ill allo a faster data manipulation, and consequently a faster data analysis, in order to identify the location of strong variations inside the signal. &MA%$ MATC"&)% The proposed palm print identification system line segments. It ma!es uses of the added attributes of comprises three modules, i.e., palm print acquisition, line orientation and line point association to measure palm print representation, and palm print identification. The novel technique of $odified ;ine segment has been adopted in a number of applications, such as Euclidean /istance (E/), hich is given by, E /ist P J(V(V1) [2 Z (H(H1) [2K [ (1&2) ((((((((((@) E/ is one of the most commonly used methods *alm print $atching image processing and matching applications. $EP$ &M$)TS A)D $S0?TS 9alse )cceptance %ate (9)%) is the percentage of rongly accepted individuals over the total number of rong matching. 9alse %e+ection %ate (9%%) is the percentage for number of rongly re+ected individuals over the total number of correct matching. In similarity measurement (Euclidean /istance and 8amming /istance), the accuracy is calculated as follo s> )ccuracy P (1 R (9)% Z 9%%&2)) b 1?? (((((((((( (D) Table ! Comparison es#lts $ET8#/ %$2 *26 )''4%) E % 'H 0avelet .ased 2A.2? D?.A ADI %ecognitio B n 2equential 8aar D?.AB <@.2 =@I Transform < S&M0?AT&O) $S0?TS

1<B

,ig G!window containing vario#s styles of #icontrol objects

,ig ;! -indow showing s#ccessf#l loading of database

,ig F! -indow to select an image

1<A

,ig :! -indow showing inp#t image

,ig 5<! -indow showing cropped image

,ig 55! -indow showing completion of feat#re eHtraction

1<=

,ig 5>! -indow showing a#thentication res#lt CO)C?0S&O) In this paper e have presented a palm print recognition system for security purposes. It uses a si" level 8aar transform to e"tract the details in the palm print. The image as cropped and the features ere e"tracted from the cropped input image. The process of cropping and feature e"traction as carried out for the database images. )fter calculating the energy levels the person as identified as authenticated or unauthenticated. $,$ $)C$S 1. ). -ain, *. 9lynn, and ). %oss, 8andboo! of .iometrics. 2pringer,2??B. 2. 2. /e an and 0. Elementary, E2can a *alm, 9ind a 'lue,F The 6e Hor! Times, 2??<. <. The 9.Is 6e"t ,eneration Identification(6,I), http>&&fingerprint.nist.gov& standard&*resentations &archives&6,IQ#vervie Q9ebQ2??D.pdf,2??=. @. 9. ,alton, 9ingerprints. 0m. 2. 8ein *ublishing,2??2. D. -. Thou, 9. 'hen, 6. 0u, and '. 0u, E'rease /etection from 9ingerprint Images and Its )pplications in Elderly *eople,F *attern %ecognition, vol. @2, no. D, pp. A=C(=?C, 2??=. C. /. 8uang, 0. -ia, and /. Thang, E*alm print 7erification .ased on *rincipal ;ines,F *attern %ecognition, vol. @1, no. @, pp. 1<1C(1<2A, 2??A.

1@?

Session && ,lobali1ation of I69#%$)TI#6 TE'86#;#,H in *resent era Sr+)o+ 1. Paper Title #nline $ar!eting> ) .lessing or /isguise for .usiness /r. ..2 8undal /r. 2aurabh ,rover -asleen 5aur .hatia Technology and S)adhaarG >)n )ttempt to .roaden Indian 4nique Identification /r. 8.* ,upta 8iti!a /hingra $oni!a )rora Escalating Trends for Information 'omputing over 8eterogeneous 0eb /r.8armunish Tane+a /r. 5avita Tane+a Impact of E('ommerce on the Industry /r. 8.2 .halla /r. 8ardeep 5aur %ole of 4nified $odeling ;anguage in 2oft are %eengineering -as inder 2ingh /r. )shu ,upta /r. -aiteg 2ingh 9eature E"traction and 'lassification in ,urumu!hi 'haracter %ecognition 2ystem 7i!ram 2harma 0eb %epository Efficiency> %ole of 8TT* E"tension 9rame or! 7ive! )ggar al )nalysis of blac! 8ole )ttac! in $obile )d(8oc 6et or!s *reeti 5arma 2teganography and Image )uthentication Techniques 2apna 5umari Impact of I'T on Teaching and ;earning $ahesh ,reen 'omputing $anan 5hanna 2mo!ey )rchitecture ( /istributed 9ire all 2ystem 6avdeep 2ingh Tarun 2harma Page )o+ 1

2.

<.

1C

@. D.

22 2C

C.

<1

B.

<D

A. =. 1?. 11. 12.

<A @C D? D@ DB

1@1

1<. 1@. 1D.

0orm 8ole )ttac! in 0ireless 2ensor 6et or!s )rminder 2ingh 'omparison of /)2 and 2)6 Technologies )mandeep 5aur -asbir 2ingh /efending )gainst /enial of 2ervice )ttac!s> ) 6et or! 9iltering .ased )pproach )mrinder 2ingh 2ecurity and *rivacy in 0ireless ;)6. 8ardev 5aur 2ecurity and *erformance Enhancing in )dhoc ,roup 'ommunication 2ystems ,ur+eet 2ingh 'omputer )pplications in 8otel Industry $r. 2umit 5umar )rtificial Intelligence() 6e *erspective %andeep 5aur 'loud 'omputing> )n Investigative 'ost )pproaches -aideep Inder 5aur

CD B1 BC

1C.

AC

1B.

=<

1A. 1=. 2?.

1?1 1?D 11<

1@2

O)?&)$ MA ($T&)%! A 3?$SS&)% O D&S%0&S$ ,O 30S&)$SS Dr+ 3+S+ "#ndal Associate Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ Dr+ Sa#rabh %rover Associate Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ .asleen (a#r 3hatia esearch Scholar/ %#r# )ana* Dev 0niversity/ Amritsar+ A3ST ACT *eople of all ages are spending more and more time online, and are turning to the internet for better services, convenience and life(enhancing tools> +ust consider ho people use online shopping, online ban!ing, eb communities that cross all boundaries, instant ne s and updates, social net or!s and chat, self(e"pression and any of the do1ens of other things that the eb ma!es possible. 0eb not only e"erts an increasingly strong influence on peopleGs everyday life but acts as a fascinating shopping and purchasing medium. The Internet opens the ay of Eone to oneF mar!eting that is perfectly adapted to the customerGs profile. Internet retailing is a relatively ne shopping channel ith a continuous entry of first(time shoppers (8ollo ay et al., 2??D) and in hich cumulative e"perience generates different subgroups of customers. This study is an attempt to analy1e the prospects and problems related ith #nline $ar!eting. ($4-O DS! Internet, $ar!eting, %etailing, E"perience and *rospects. &)T OD0CT&O) Throughout its history, the internet has reinvented itself many times R and the changes are far from over. The current eb is dominated by sociali1ing, cooperation, sharing and personal entertainment. It is a space both for or! and play R an essential tool for virtually every business and the go(to repository for all forms of media culture products. Internet mar!eting R often called online mar!eting or emar!eting R is essentially any mar!eting activity that is conducted online through the use of internet technologies. It comprises not only advertising that is sho n on ebsites, but also other !inds of online activities li!e email and social net or!ing. Every aspect of internet mar!eting is digital, meaning that it is electronic information that is transmitted on a computer or similar device, though naturally it can tie in ith traditional offline advertising and sales too. O)?&)$ $K0&@A?$)TS O, T AD&T&O)A? T$C")&K0$S Q Physical -or*place P website. Thin! of your ebsite as the public face of your company. 0here before customers ould visit or phone your office to find out about your products or to ma!e business arrangements, this can no all be done on the official ebsite. ) ebsite can offer additional features, li!e useful resources, online shopping and customer support. Q Conventional advertising P online advertising+

1@<

*rint, radio and television advertising usually requires a large investment upfront for creation, and a second large sum for placement. #nline advertising carries a much lo er ris!, since it can be fully controlled, changed, retracted and modified at any time. The more targeted the advert, the more li!ely you are to generate qualified leads and higher returns. Q S#rveys/ polls and mar*et research P web analytics+ The traditional ay of measuring the effectiveness of a mar!eting campaign as to ta!e survey and polls of consumers and to measure the effect on the companyGs incomeN both quite blunt and sub+ective measures. 0eb analytics are very different R they allo absolute and precise measurement of every activity that your mar!eting material is involved in, giving you the best picture of hat or!s. Postal mail P e7mail+ Email is the targeted, personali1ed equivalent of traditional posted direct mail. It has several advantages. 9irstly, it is much easier for the client to act on the information if you include a lin! or a fill(in form for a competition. 2econdly, it is easy for the customer to opt out of the advertising, ma!ing it less intrusive R or they can share it further if they find the content useful. Thirdly, it is much easier to construct a specifically targeted list online, due to the ide availability of demographic information. )nd finally, email mar!eting is cheaper and quic!er, since there is no printing or posting involved R hich also ma!es follo ing up and ans ering questions easy. u Conventional P#blic relations P Online P#blic relations Traditional *r usually happens behind closed doors, as individual problems and complaints can be dealt ith in private, or on the large scale, through impersonal broadcast media. #n the eb, *r ta!es on an entirely different dimension, because anyone can read hat others are saying about your company. If the message is bad, a substantial crisis can occur. .rand management and *r are incredibly important on the eb, because even one dissident voice can have a mar!ed effect. Q -ord of mo#th P @iral Mar*eting Traditional mar!eting relies heavily on ord of mouth to spread slogans, brand names and recommendations, and the eb is no different. 8o ever, online ord of mouth has the tendency to spread virally, as each agent is lin!ed to e"ponentially increasing numbers of people do n the line. 9or e"ample, if every 9aceboo! user has an average of 1?? friends, then every profile is +ust t o steps a ay from 1 million others. 9igures of this scale indicate +ust hy ideas can spread virally on the eb. )eed of Online Mar*eting 'ustomers e"pect the highest convenience and information at their fingertips. )ll companies need a ebsite as their central point of contact. 'ustomers are fic!le. They ill not e"pend a lot of energy to find you online. )udiences ant to interact ith and converse about your brand and products. give them the opportunity to do it in a mediated space, and become part of the discussion. #nline mar!eting is almost al ays cheaper and more targeted than traditional. ?iterat#re eview
1@@

Electronic commerce has become one of the essential characteristics in the internet era. )ccording to 4';) 'enter for 'ommunication *olicy (2??1), online mar!eting has become the third most popular internet activity, immediately follo ing e(mail using or instant messaging and eb bro sing. It is even more popular than see!ing out entertainment information and ne s, t o commonly thought of activities hen considering hat internet users do hen online. #f internet users, @A.=I made online purchasing in 2??1, ith three( quarters of purchasers indicating that they ma!e 1(1? purchases per year. Internet has revolutioni1ed the ay in hich consumers purchase goods and services (9orsythe and 2hi, 2??<). 'onsumers are not interested in the technology per se but ho the internet can improve their shopping e"periences and helps them ma!e better decision (.ur!e, 2??2). 2 aminathan, 0hite and %ao (1===) e"plored that consumers ho are primarily motivated by convenience are more li!ely to ma!e purchase online. .ellman, ;ohse and -ohnson (1===) e"amined the relationship among demographics, personal characteristics and attitude to ards online shopping and found that people ho have a more E ire lifestyleF and ho are more time(constrained tend to buy online more frequently, i.e., those ho use the internet as a routine tool and&or those ho are more time starved prefer shopping on the internet. .hatnager et al., (2???) e"plored ho demographics, vendor&service&product characteristic and ebsite quality influence the consumersG attitude to ards online shopping consequently their online buying behavior. The same study indicated that the convenience the internet affords and the ris! perceived by the consumers are related to the consumersG attitudes and behavior positively and negatively. )lrec! and 2ettle (2??2) found that internet shopping as vie ed as saving more time than traditional modes of shopping. .hatnagar et al., (2???( 2??1) found that for those ho use online information sources of buying financial products, time availability as not associated ith the propensity to conduct and online search for or purchase of these products. That is, those ho ere pressured for time did not use online purchasing more than those ho ere not pressured for time. -arvenpaa, Tractins!y and 7itale (2???) investigated ho consumersG perceived store si1e and reputation influence their trust in the store, ris! perception, attitudes and illingness to buy at the specific store. The study found that there is a positive correlation bet een consumer trust in internet stores and the storeGs si1e and reputation. )ccording to ;ee, *ar! and )hn (2??1), t o main categories of perceived ris! emerge in the process of online shopping. The first is the perceived ris! associated ith product&service and includes functional loss, financial loss, time loss, opportunity loss, and product ris!. The second is the perceived ris! associated ith conte"t of online transactions, and includes ris! of privacy, security, and no repudiation. )mong them, the influence of financial ris!, product ris!, and concern for privacy and security are significant (2enecal 2???N .orchers 2??1N .hatnagar et al. 2???). 8o ever, the fourth dimension of attitude, consumers trust in the stores, can reduce perceived ris!. 4sing a qualitative analysis, 0olfinbarger and ,illy (2??1) suggest that t o motives, i.e., shopping for fun (hedonic) and shopping ith a goal in mind (utilitarian) are typical of online shoppers. 8edonic shoppers are motivated by their involvement ith a class of products that directs their bro sing the internet through auction sites and visit to hobby(related sites. In other ords, the hedonic shopper typically see!s a product specific online shopping e"perience. *eterson, .alasubramanian and .ronnenberg (1==B) support the vie that due to the special features of the internet its suitability to mar!et products and services depends on the features
1@D

of the products and services being mar!eted. /onthu and ,arciaGs (1===) analy1ed that older internet users ere more li!ely to buy online hen compared to younger users, even though the younger users had more positive attitudes to ards internet shopping. /hola!ia and 4usitalo (2??2) found that younger consumers reported more hedonic and utilitarian benefits of online shopping than older consumers. In contrast, -oines, 2cherer and 2cheufele (2??<) found that younger respondents ere more li!ely to shop online.%odgers and 8arris, 2??< determined that omen ere emotionally less satisfied ith online shopping and mad fe er online purchases than men. #n the other hand, 'itrin, 2tem, 2pangenberg and 'lar! (2??<) found that omen demonstrate a stronger need for tactile input in product evaluation than men ('itrin, 2tem, 2pangenberg and 'lar!, 2??<). The inability to touch or try on products, a shortcoming of online purchasing, might also result in fe er female online shoppers. ;i, et al. (1===) found that men used more frequent online shopping than omen and ell(educated consumers ere the frequent eb buyer. They also found that consumers ith high incomes used more frequently internet for shopping. #ther studies have also indicated that men, more highly educated and higher income groups are more li!ely to buy online than omen, the less ell education, and lo er groups (9orsythe and 2hi, 2??<N ;i et al, 1===N 2 inyard and 2mith, 2??<8+ 0hen engaged in e(commerce purchases over the internet, effort is primarily a mental activityN shoppers or! at their !eyboard instead of having to plan for and travel to multiple shopping sites. ;ifestyle compatibility encompasses the consumersG lifestyle and shopping habits (7ellido, et al., 2???). In addition, lifestyle compatibility may reflect on the consumerGs opinion of those that ma!e e(commerce purchases (,oldsmith and .ridges, 2???). *layfulness and the perception of EfunF ta!e into account the shopperGs overall satisfaction ith the shopping e"perience (,oldsmith, et al., 2??1). 4nnecessary shopping time and the inability to locate in(stoc! products of the desired color and si1e are e"ample of occurrences that diminish the shopping e"perience. 'ustomer service affects purchase decisions through vendor !no ledge, responsiveness and reliability (,effen, 2??2). 'ontinued interaction bet een the customer and the service or!er can lead to the development of a relationship bet een the parties. $ean hile, consumer ris! refers to the possibility that the consumer ill be harmed or in+ured by either the product or by the shopping process. 'redit card security is the predominant e"ample of a personal ris! inherent in e(commerce purchase transactions (,oldsmith and .ridges, 2???). *rivacy ris! reflects the degree to hich a consumer may sacrifice their privacy hen they are required to provide confidential information in the course of ma!ing a retail e(commerce transaction (.hatnagar et al., 2???N 7i+ayasarathy, 2??2). 3$)$,&TS O, MA ($T&)% O) T"$ &)T$ )$T The various benefits of mar!eting online are as follo s> %eaches here no other media doesN )llo s transmission of more comple" messages than other mediaN *ossibilities of segmentation & targeting ( demographics, depending on the conte"t, during the day, depending on the other visited sites etc..N $ore control over the %each & 9requency and the ability to calculate the unduplicated audience of the entire campaignN
1@C

 )pplications are based on information. 'onsumers see!ing ans ers to specific questions. If any product is appropriate and correctly described, there is a greater chance of selling than if they appeal to emotions. $essages can be cut for different types of buyers> those loo!ing for information, those ho see! the best price, the target value, and so on. If they are visual, you can put pictures and movies. If they are the target numbers, can sho a lot of statistics. In fact, consumers can create their o n scenarios for the sale as it see!s information of interest and avoid other types of information. 2pace is unlimited and cheap. Hou can put an entire encyclopedia of information about company and products on the Internet for a modest amount of money. 'onsumers see!ing the company message. They choose to cyber(maga1ine to read information. 6ot only that, it is e"pected that this communication should be interactive. They ill be able to establish a line of communication ith the company to find ans ers to questions quic!ly, if not immediately. )t this time, the technology allo s consumers to find information in your store and send an e(mail your staff. $ust respond as quic!ly to build a relationship. )s tools for audio and video on the Internet are quite young, the main ay in hich information is obtained is through the printed ord ( and the advantage that the Internet uses scenarios and selling information products can be ritten in hyperte"t, feature that allo s consumers to move the information to another as allo ed in place to ma!e ay through the entire document eight in linear from start to finish. 9or e"ample, say you sell a product that can be understood on many levels, such as food. It may have a picture of a piece of chocolate accompanied by a paragraph that this product claiming virtues s eet, dar! and seductive and consistency as creamy and smooth. 8o ever, a person concerned about health ould li!e to !no ho many fat and calories each product contains. 'an be included these information too. 9or a more technical, such as phone, can start by sho ing a phone and basic information such as features, benefits and price. ) direct and immediate ( visits, conversions, and even salesN %eal(time optimi1ationN 'omplete measurability> almost every element of a campaign can be monitored and translated into %#I (%eturn on Investment)N 'reative opportunities more comple"> games, dialogues, rich(media ads interactive, and stories or even virtual universesN Internet is located at the convergence of all media> audio, video, te"t, images, plus interactivity. ?&M&TS O, &)T$ )$T AD@$ T&S&)% The on(line advertising communication is still encountering many obstacles> 2till the mar!et is insufficiently !no n. The fact that the net or!s develop very fast and the Internet is totally decentrali1ed does not ma!e the usersG number evaluation easier. It very difficult to establish the si1e of the potential mar!et, and this fact slo s do n the offer of services and
1@B

content. The mar!et is either not accurately divided according to the demographic, socio(cultural features or according to the consumption habits etc. The specialists in communication donGt have yet all instruments necessary for the comparison of different advertising supports. %elatively fe people are online, and those ho are usually have limited data and slo connections. )nything that I2 put online has to be accessible to the lo est common denominator. .asic computer s!ills are generally quite limited, so online content has to be clear and easy to useN other ise, customers ill simply give up. )s more human interaction is done online, virtual communication becomes tiring and disconnects people from the real orldN any interaction online must be personal and supported by offline mar!eting efforts *rivacy R or its slo erosion R is a big concern for eb users. as the borders bet een public and private life begin to blur, customers are ary of giving out personal data. The net or! !no s everything about its users> their age, their profession, their salary, their tastes and customs. Their private life is not a secret anymore for the on(line sellers. .y connecting to the Internet the user starts the Ecoo!iesF programs. Thus hundreds of pieces of information are stored in the program of that user and they represent an electronic Ecurriculum vitaeF that can be subsequently used in mar!eting or publicity actions ith a precise target. The most researches sho that the main problem regarding the interactive advertisement refers to the userGs attitude. 8e does not access the advertising banner in order not to quit the page he is using, being afraid that he might not return to that page. In order to avoid this obstacle the specialists must pay more attention to the users and try to understand and anticipate their behavior. The lac! of s!illed consultants ho can tell them ho the technological changes can help them reaching their high ob+ectivesN The lac! of transparency regarding the prices. 9or the same service the proposals vary up to the triple priceN The multimedia agencies have copied the classical schema of the communication agencies, emphasi1ing the creativity. )lthough, this is a rong choice, in the first place because the creative process is limited on the Internet because of several constraints> the user can not be forced to spend his precious time aiting for the do nload of too complicated images and dra ings. The true creation in multimedia field lays in the logic of traffic on the site, in rapidity, ergonomy and in the arborescence administration.

CO)C?0S&O) #nline mar!eting represents a remar!able advancement in the field of mar!eting goods and services. 6ot only, it offers a ide variety of options to the customers but it also provides a convenient hub of items used by the consumers in their daily routine of life hich they canGt purchase due to the scarcity of time. .ut it has its o n

1@A

loopholes hich a user should !eep in mind before carrying out any transaction on internet because its convenience can be converted into a dangerous game if not used cautiously. $,$ $)C$S 1. )lrec!, *. and 2ettle, %. (2??2). The hurried consumer> time(saving perceptions of internet and catalogue shopping. -ournal of /atabase $ar!eting, 1?(1), pp. 2D(<D. 2. .ellman, 2., ;ohse, ,. and -ohnson, E. (1===). *redictors of online shopping behavior. 'ommunications of the )'$. @2(12), pp. <2(<A. <. .hatnagar, )., $isra, 2. and %ao, 8. %. (2???). #nline ris!, convenience and internet shopping behavior. 'ommunications of the )'$. @2(11), pp. =A(1?D @. .orchers, ). (2??1). Trust in Internet shopping> ) test of a measurement instrument. *roceedings of the Bth )mericas 'onference on Information 2ystems, 11, pp. B==(A?<. D. .ur!e, %. %. (2??2). Technology and the customer interface> 0hat consumer ant in the physical and virtual store. -ournal of the )cademy of $ar!eting 2cience, <?(@). 1<, pp. @@1(@<2. C. 'itrin, ). 7., 2tem -r., /. E., 2pangenberg, E. %. and 'lar!, $. -. (2??<). 'onsumer 6eed for Tactile Input> )n Internet %etailing 'hallenge. -ournal of .usiness research, DC(11), pp. =1D(=2< B. /hola!ia, %. %. and 4usitalo, #., (2??2), 2 itching to Electronic 2tores> 'onsumer 'haracteristics and the *erception of 2hopping .enefits, International -ournal of %etail and /istribution $anagement, <? (1?), pp. D@=R@C=. A. /onthu, 6. and ,arcia, )., (1===), The Internet 2hopperv, -ournal of )dvertising%esearch, <=, pp> D2RDA. =. 9orsythe, 2. $. and 2hi, .. (2??<). 'onsumer patronage and ris! perceptions in internet shopping. -ournal of .usiness %esearch, DC, pp. ACB(ABD. 1?. ,efen, /. (2??2). 'ustomer loyalty in e(commerce. -ournal of )ssociation for Information 2ystem, <, pp. 2B(D?. 11. ,oldsmith, %. E. and .ridges, E. (2???). E(talling vs retailing> 4sing attitudes to predict online buying behavior. :uarterly -ournal of Electronic 'ommerce, 1(<), pp. 2@D(2D<. 12. ,oldsmith, %. E., .ridges, E. and 9reden, -. (2??1). 'haracteri1ing online buyer> 0ho goes ith the flo O :uarterly -ournal of Electronic 'ommerce, 2(<), pp. 1A=( 1=B. 1<. 8ollo ay .., 0ang 2, *arish -T. The role of cumulative online purchasing e"perience in service recovery management. - Interact $ar!et 2??DN 1=(<), pp. D@RCC. 1@. -arvenpaa, 2. ;., Tractins!y, 6., and 7itale, $., (2???), E'onsumer trust in an internet storeF, Information Technology and $anagement, 1, @D(B1 1D. -oines, -., 2cherer, '. and 2cheufele, /. (2??<). E"ploring motivations for consumer eb use and their implications for e(commerce. -ournal of 'onsumer $ar!eting, 2?(2), pp. =?(1?A. 1C. ;ee, /., *ar!, -., and )hn, -. (2??1). #n the e"planation of factors affecting e( commerce adoption. *roceedings of the 22nd International 'onference on Information 2ystems, C, pp. 1?=(12?.

1@=

1B. ;i, 8., 5uo, '. and %ussell, $. ,., (1===), The impact of perceived channel utilities, shopping orientations, and demographics on the consumerGs online buying behaviour, -ournal of 'omputer($ediated 'ommunication, D (2). 1A. ;uminiwa xoproni, 2imona )urelia .odog (2??B), 9ascicle of $anagement and Technological Engineering, 7olume 7I (V7I), 2??B. 1=. *eterson, %. )., .alasubramanian, 2. and .ronnenberg, .. -., (1==B), E"ploring the implications of the Internet for consumer mar!etingv, -ournal of )cademy of $ar!eting 2cience, 2D (@), pp> <2=R<@C. 2?. %odgers, 2. and 8arris, $. (2??<). ,ender and E('ommerce> )n e"ploratory study. -ournal of )dvertising %esearch, @<(<), pp. <22(<<?. 21. 2enecal, 2. (2???). 2topping variables in online buying processes> )n innovation diffusion approach. *roceedings of the Cth )mericas 'onference on Information 2ystems, D, pp. 1<A?(1<AD. 22. 2 aminathan, 7., 0hite, E.;. and %ao ..*. (1===). .ro sers or buyers in cyberspaceO )n investigating of factors influencing electronic e"change. -ournal of 'omputer $ediated and 'ommunication, D(2), pp. 122(1<@. 2<. 2 inyard, 0. %. and 2mith, 2.$. (2??<). 0hy people (donGt) shop online> ) lifestyle study of the Internet consumer. *sychology and $ar!eting, pp.DCB(D=B. 2@. 4';) 'enter for 'ommunity *olicy. (2??1). The 4';) Internet report 2??1> 2urveying the digital future(year t o. J#nlineK )vailable> http>&& .ccp.ucla.edu&pdf&4';)(Internet(%eport(2??1.pdf. 2D. 7ellido, )., ;isboa, *.-.,. and $eehan, 5., (2???), y:uantitative characteri1ation and prediction of on(line purchasing behavior> ) latent variable approachv, International -ournal of Electronic 'ommerce, @ (@), pp> A<R1?@. 2C. 7ellido, )., ;isboa, *. -. ,. and $eehan, 5. (2???). :uantitative characteri1ation and prediction of online purchasing behavior> ) talent variable approach. International -ournal of Electronic 'ommerce, @(@), pp. A<(1?@. 2B. 0olfinbarger, $., and ,illy, $., (2??1), 2hopping online for freedom, control and fun, 'alifornia $anagement %evie , @< (2)> <@RDD.

1D?

T$C")O?O%4 A)D RAAD"AA O! A) ATT$MPT TO 3 OAD$) &)D&A) 0)&K0$ &D$)T&,&CAT&O) Dr+ "+P+ %#pta Principal/ SSCMT/ Amritsar+ g#pta2 haripra*ash1yahoo+com "iti*a dhingra esearch Scholar hiti*a5:1gmail+com Moni*a arora esearch Scholar/ P#njab Technical 0niversity, (ap#rthala dennisarora1yahoo+com A3ST ACT The Information TechnologyL has paved a path to ards transforming India. To provide an access to deliver public services and utilities it as imperative in modern times also. The )adhaar pro+ect is an e"ample of using modern technology to leapfrog for future development and transformation of our country. The traditional I/s are only available to a very narro segment of IndiaLs population. 8ence, there as a need felt by Indian government in the changing scenario to create an I/ system hich can provide an access to other host of public services and utilities. In the present time, people are ell a are of the fact that not having an identity proof can be a huge impediment. This paper is an attempt to discuss some benefits and issues related to technology (li!e biometric) and e(commerce lin!age in India if )adhaar is to be treated as a solution named S#ne card to allG. The paper ill present an insight into ,overnment efforts hich has set up this )adhaar programme principally for t o main reasons. #ne is to give everybody an I/ so that they can participate in so called modern economy and second, is to see that its numerous elfare schemes hich go to individuals are being passed to the genuine beneficiaries. The ris! of /ata lea!age is involved, so it is suggested that technologyN if used ith great caution, the Indian government could deliver entitlement and subsidies in much more efficient and equitable ay, ith )adhaar in place. ($4-O DS! .iometrics, /e(duplication, 9inancial Inclusion, ,enuine beneficiaries. &)T OD0CT&O) Technology is manGs attempt at playing ,od. It is the method e adopt to bring about change in ourselves and in the orld around us. It can ma!e life simpler for some and unbelievably comple" for their parentsY .ut, most importantly, technology is our attempt to ma!e the orld a smaller place.0hen it comes to technology, one thing is certain> There ill al ays be a ne application or product to enhance or! productivity or streamline an e"isting process. Ta!e, for instance, the change from floppy dis!s to '/s to e"ternal flash drives hich have become fi"ed commodities in !ey chains all over the orld as a ay to meet peopleLs and organi1ationLs data storage and mobility needs. )nd, hat about the change from mainframes
1D1

to client servers, and no to virtuali1ed serversO )s these e"amples sho , ne er and faster technologies ill continue to e"ist and enhance the ay organi1ations perform their day(to( day or!. ;et us begin ith a storyN ) *olice officer is searching for a criminal for some case. 8e started his investigation at the place for finding some clues. 8e found a bloody thumbprint and ta!es it do n to the lab, analy1es and matches it to a recorded set of prints thereby finds and catches the criminal. This is hat most of the movies sho us. In this case if the fingerprints did not match the recorded set of samples ho can e trace that person in a orld ith nearly B billion populationsO Is this possible only in the reels or can e implement this even in real lifeO 0e can ma!e it possible in real life if e have the fingerprints of all the residents of a country stored in one database here e also store the entire information used to authenticate him and issue him a unique identification number. 9or e"ample every citi1en or permanent resident of 3#lgaria has a unique 1?(digit 0niform Civil )#mber. This number can be used for trac!ing their citi1ens for the purposes of ta"ation, government benefits etc. $any developed countries have this national identification number. In &ndia there are some problems regarding the identities li!e, /ue to lac! of ability there are issues of multiple identities for same person and also it has been difficult to identify fa!e documents or fa!e identities. If photo is not present on the identity e cannot say hether the identity belong to the person carrying it or not. /ue to fa!e identities there are misuses of elfare benefits as it is difficult to uniquely identify the individuals. 2o &ndia also thought of providing a unique identification for each and every resident of the country. 0)&K0$ &D$)T&,&CAT&O) A0T"O &T4 O, &)D&A 60&DA&8 The 4I/)ILs mandate is to issue every resident of India a unique identification number lin!ed to the residentLs demographic and biometric information, hich they can use to identify them any here in India, and to access a host of benefits and services. Aadhaar! The number has been named )adhaar, hich means LfoundationL, or LsupportL. )adhaar card, consisting a12 digit number is issued for every individual, including infants. Each individual of a family ill have separate )adhaar 4I/ number. 0hile enrollment it verifies all the documents pertaining to an individual and collects biometric information photograph, ten fingerprints and iris through scanning. ?&T$ AT0 $ $@&$ )andan )ile*ani 6><5B8 / 4I/)I chairman hile giving an oration titled LIndiaLs transformationF stressed that )adhaar pro+ect is one such e"ample of using modern technology to leapfroge and it is a pro+ect to solve the problem of people ho do not have an ac!no ledgement of their e"istence by people and the state or lac! of ac!no ledgement of their identity.
1D2

eserve 3an* of &ndia 6><5B8 advises ban*s to adopt Aadhaar a#thentication for card7based transactions+ )ccording to %eserve .an! of India ,uidelines (2ep,2?1<) ban!s ere as!ed to ensure that ne card payment infrastructure are able to authenticate transactions using )adhaar(lin!ed biometrics after the 2upreme 'ourt orders issued on 2eptember 2<, 2?1<. It issued notices to states hich have made )adhaar cards compulsory for availing government schemes, )lso all ne card present infrastructure has to be enabled for both E$7 chip and *I6 and )adhaar (biometric validation) acceptance, Euro pay $aster'ard 7isa or E$7 chip and *I6 authentication involves card information stored in a chip that is accessible through a *I6 or personal identification number, hich replaces a cardholderGs signature. The central ban! notification left it to ban!s to ta!e a decision on hether they should adopt )adhaar as an additional authentication factor or use E$7 'hip and *I6 technology for securing the card payment infrastructure, for cards that %.I has not specifically as!ed ban!s to use E$7 norms. %epresentatives of both the 4nique Identification )uthority of India, hich manages the repository of biometrics lin!ed ith the unique identity number it issues, and @isa &nc+ one of the initial contributors to the E$7 system, said the %eserve .an! of India notification leaves the choice to the customer on hether they ant to go ith E$7 or ith )adhaar. )n increase in the number of cases of fraud because of stolen card data through card s!imming and counterfeiting had prompted %eserve .an! of India to form a panel to loo! into securing card(based transactions through additional layers of authentification, such as *I6s and biometrics in $arch 2?11. ,o ri $u!her+ee (2?1<) e"plained in the current notification about problems faced by general public for )adhar card based on the recommendations of the or!ing group headed by , global head of digital mar!eting at 2tandard 'hartered .an!. -ustice ..2. 'hauhan a bench headed by, hile hearing public interest litigation, issued notices on Tuesday to states including /elhi, $aharashtra, %a+asthan and 5erala. The hearing comes in the light of a *ublic Interest ;itigation (*I;) challenging the lin!ing of elfare payments to )adhaar cards under the governmentGs direct benefit transfer scheme. 0ttam )aya* 6><5B8, group country manager, India and 2outh )sia at 7isa 'onsolidated 2upport 2ervices (India) *vt. ;td. said, E%.I has been pragmatic in mandating it incrementally as it is giving )adhaar a run ay to evolve in terms of operations, use cases, ris!, technology standards, dispute resolution and get these things in order. .ecause )adhaar is to!enless and doesnGt need a card, it has great potential for inclusion.F 8o ever, 6aya! said, EIt is not clear from hen this is effective, but )T$ and point(of(sale infrastructure providers have to be ready. Today, )T$s donGt even have E$7, so it needs to be seen if there are enough suppliers for providing infrastructure that is both )adhaar(lin!ed biometric and E$7 chip and *I6 enabledF. A+P+ Singh 6><5B8/ 4nique identification )uthority of India deputy director general said, EThis is +ust hat e anted because the notification means all the ne and replacement point of sale infrastructure ill be able to use both )adhaar(lin!ed biometrics and E$7 chip and *I6.F E0e had never been for a mandatory move to
1D<

)adhaar and believe that in due course, ban!s ill find it a more appropriate and cost( effective solution for authentication,F 2ingh said 3ioScan %ro#p 6><5B8/ 3ioScan 5< from 3io $nable Technologies Pvt ?td , The 4I/ 'ertified Ten 9ingerprint 2canner for 4I/ )adhar *ro+ect is getting idely accepted across the country ith different 4I/ Enrollment )gencies for its high quality and ability to register citi1ens fast. .io2can1? has been certified by 2T:' ('ertification .ody for 4I/) for 9ingerprint %egistration for 4I/ *ro+ect. )s only 2T:' 'ertified *roducts can be used for 9ingerprint Enrollments for issuing )adhar 4I/ 6umber, 2T:' follo s a very strict procedure for certifying 9ingerprint 2canners so that only quality products can be used for a smooth and hassle free enrollment. 4I/ is one of the prestigious pro+ects in India here one 4nique Identification 6umber ill be issued to every citi1en hich can be used as an I/ *roof and ill be very useful for all the citi1ens and mainly people belo poverty line having no I/ *roof. )s it require registering all the Ten 9ingerprints of the person, 9ingerprint %egistration is the most important part of the process and requiring quality 9ingerprint 2canner for fast and better registration. .io2can1?, manufactured in Italy or!s on patented technology and has been designed !eeping Indian Environment in mind and because of that unli!e other 9ingerprint 2canners it doesnGt require any e"tra pressure on hand to register fingerprints and ma!es .iometric %egistration a smooth process for the Enrollment )gencies ho other ise ere facing problems in registration ith other 9ingerprint 2canners. Manmohan (#mar 6><5B8, 7* $ar!eting, .io Enable said, E0ith our 1? years of e"perience in or!ing for 9ingerprint Technology, .io2can1? as launched and certified by 4I/ !eeping the problems being faced by E) in mind, and today e are very happy to see that e are getting very positive response from different Enrollment )gencies using our 9ingerprint 2canner and .io2can1? helping them in registering citi1ens very fast hich ill certainly help 4I/ in achieving their target.F 8e further added, E0e have already deployed huge number of our 9ingerprint 2canner across the country and Enrollment )gencies in different district of $aharashtra, )*, $*, %a+asthan and .ihar are using our 9ingerprint 2canners. 0e are dedicated for ma!ing 4I/ a success and or!ing hard for educating the Enrollment )gencies, providing them training on our product for proper registration and helping them ith on(site service and support.F 2hrini *illalamari, $/, ,rapesoft, one of the leading Enrollment )gency from )*, e"plained that the agency tested 2(< 9ingerprint 2canners for 4I/ )adhar 9ingerprint Enrollment and find .io2can1? as the most suitable and fastest registering device. %e!ha 2harma of )tishay Infotech, one of the leading Enrollment )gency from $* stressed about .iometric solutions because the 4I/ %egistration or! has been found very much satisfactory for fe district of $* and %a+asthan. .io Enable is offering .iometric solutions since last 1? years and largest supplier of 9ingerprint systems for ,overnment pro+ects, #ffice )ttendance and )ccess control systems in India.

)$$D A)D O3.$CT&@$

1D@

The 4nique Identification 6umber pro+ect gained a lot of attention internationally ith companies li!e $icrosoft, Hahoo anting to be a part of it. 8ereGs hat led the researchers to have insight into efforts made for )adhaar pro+ect. The public information is about the highly IT dependent initiative led by IndiaGs IT c1ar 6andan 6ile!ani, the need as felt to understand the benefits and problems attached ith the )adhaar card. The present study has been carried ith an ob+ective to understand simply that ho a significant number of underprivileged citi1ens ill be brought under the 4I/ system. 8ence, for the purpose information has been collected from various ne spapers and ebsites and official ebsites li!e http>&&uidai.gov.in 0SA%$ O, T$C")O?O%4 &) AAD"AA P O.$CT! A D&SC0SS&O) To quote some facts it as stated by 6eli!ani ('hairman, 4nique Identification )uthority of India)> )round C?? million Indians ill possess )adhaar cards by the middle of 2?1@. << million people have been issued the cards hile another @? million have been enrolled, )dding that currently a total of C??,??? ne people ere being enrolled at 2?,??? locations across the country every day. This ill go to one million a day by #ctober2?1@. 0ith Sde(duplicationL technologyG (bio(metrics R ten fingerprints and retina imaging, the the most important part of the 4I/ architecture) in a couple of years, there ill be @?? million cards, and every day one million ne people ill be enrolling. This means that before the ne"t morning, each of these ill have to be chec!ed against the data of @?? million e"isting cards so there ill be no duplication.. 4nder the financial inclusion process, the 4I/)I is also conducting a pilot in Tum!ur to open simultaneous ban! accounts lin!ed to their 4I/. EThis is important for financial inclusion and the authorities are in tal!s ith C@ ban!s across the country. It ill be the !ey game changer in the 4I/ pro+ect as the on(line identity that ould provide individuals ith a portable identity that can be authenticated any here. In India hich has the total population of over one billion, only D? million people had passports hich ere mere five per cent of total population, around <? million people paid ta"es and over 1D? million people had driver licence. 2ince the commencement of the pro+ect <? million ban! accounts have been opened as a direct benefit of the )adhaar card, and 1? million transactions have been made using the unique I/ number. 3$)$,&TS A)D P O3?$MS $?AT$D TO AAD"AA 1. 3enefits of Aadhaar Easily verifiable in an online cost effective ay. It is unique and robust enough to eliminate the large number of duplicate and fa!e identities in government and private databases.

1DD

)adhaarLs guarantee of uniqueness and centrali1ed, online identity verification ould be the basis for building these multiple services and applications, and facilitating greater connectivity to mar!ets. It ould give any resident the ability to access these services and resources, anytime, any here in the country. )adhaar card can be used for opening .an! account, ,as connection, %ation card, *hone connection, *)6 card, *assport. It ould also be a foundation for the effective enforcement of individual rights. 2. Problems in 3an*ing Sector! /espite emerging technologies in ban!ing sector, rural people didnGt have access to ban! services, here @?I of the rural residents did not have ban! accounts. )s the poor ill transact in lo er amounts ban!s ill not find them attractive, as their transaction costs are high. Aadhaar a#thentication in ban*ing The strong authentication that 4I/)I ill vastly reduce the documentation that the poor are required to produce for a ban! account, and significantly bring do n 5no Hour 'ustomer (5H') costs for ban!s. 2o if every rural resident has an )adhaar card then the ban!s can help him or her opening an account ith minimum costs than earlier. 0&D and its applications )adhaar card at present is issued on a voluntary basis. If it made mandatory it can be used for various applications in different fields. %overnment benefits ,overnment can transfer the benefit amount directly to the ban! account of the beneficiaries to hich their )adhaar card is lin!ed. In this ay e can avoid middlemen eating a ay the government fund. 9or the rural people if the ban! branches are not there in their village e can provide them the micro)T$ facility here he need to verify his identity by ma!ing a thumb impression on the micro)T$. Then the person carrying the micro)T$ ill pay the benefit amount and the ban! ill deduct this amount from the

beneficiaryGs account. ,ig 5! a Model for Direct Delivery of %overnment Services to 3eneficiaries

So#rce! http!IIwww+npci+org+inIdoc#mentsIA$PS,AK3an*+pdf @oting 4sing )adhaar card as 7oterGs I/ and implementing a technology at election counter here voter can either type his )adhaar number or s ipe his card, e can eliminate duplicates thereby reducing rigging in elections. Criminal acts In a huge country li!e India it is al ays difficult to capture culprits. if any cc camera fortunately records video of culprit then by using that photo e can easily find out through
1DC

the database of 4I/I). )lso in some criminal acts if e get the fingerprints of the criminal, e can try to match them ith the database and easily catch the culprit. Corr#ption! )s )adhaar card number is lin!ed to a ban! account, instead of )T$Gs e can use )adhaar card to ithdra cash, pay bills, cash transfer etc. 'orruption, a ma+or issue in India can be solved by this approach as e use the card for every transaction that e ma!e, so it is easy to find the persons ho transact in large amounts or ho transact or spend more than their income. .y this, illegal transactions can be controlled and corruption can be easily controlled. Perfect a#thentication )adhaar 4I/ uses biometric scanning to ensure the authentic identity of a person, hereas a 7oters I/, driving license, even a passport can be forged. ?P% Distrib#tion ;*, for /omestic 'oo!ing is heavily subsidi1ed. 2o people are using fa!e connections and misusing the benefits. If )adhaar card is integrated ith the customer database of ;*, e can eliminate illegal diversion of cylinders. Mobile connections $obile connections are idespread and these connections can be used for anti national activities. If e authenticate all the mobile connections of a person by lin!ing them to his )adhaar number e can have a control on the fa!e connections. $commerce /ue to cash on delivery payment system offered by various e(commerce players there is a ris! of a fa!e customer order or a customer denying that he didnGt order it. To avoid this e can authenticate the customer by as!ing his )adhaar card number and the mobile number, hich is lin!ed to the )adhaar. ,ig >! &nterrelationship of Aadhaar Card -ith P#blic 0tility Services

So#rce! http!IIwww+npci+org+inIdoc#mentsIA$PS,AK3an*+pdf One card for all If the )adhaar card consists of all the information including address, photo, *)6 card number, license details, 7oter I/, ration card e can remove all the cards and use only )adhaar card for all purposes thereby reduce large amount of paper. ;in! all vehicle registrations to )adhaar card, all *)6 card details to )adhaar card. 2o )adhaar card ill be the only card providing 4nique Identification. CO)C?0S&O) A)D S0%%$ST&O)S Actions to be ta*en To reap benefits from all this sectors, e need to ma!e 4I/ mandatory to all the residents of India. 2o that in 2? years do n the line every person in the country ill have 4I/ cards.
1DB

)s the population in India is huge it is difficult to implement and authenticate each time in every sector hen a person ant to receive any benefit. It ill require massive amount of supercomputer, processing po er, band idth and IT infrastructure at local, district, state and central level. This needs more budgets to implement. There are also concerns that personal data ill be revealed if bac! search is done and possible security threat e"ists as ban! accounts are lin!ed to )adhaar card. ,ig B! is* Model

2ource> 9http>&&uidai.gov.in SShttp!IIwww+npci+org+inIdoc#mentsIA$PS,AK3an*+pdf 2o hen e consider the ris! model e see that, as it requires huge technology and e"pertise the ability to e"ecute is less but if e implement it e have a great opportunity for economic gro th so e might face an implementation ris!. .ut if a proper budget is allocated and the necessary technology is made available in every sector it moves to the sustainability quadrant and thereby e accomplish sustainable economic gro th. India is undergoing many technological and economic advances in both ,overnment and private sectors. 2till many people in India are solely dependent on government benefits and services. 2o for sustainable gro th in the country e need to provide these services to the right person for hich e need a verifiable identity. )adhaar provides this unique identification facility. )lso if e implement )adhaar verifiable technology in every sector e can eliminate corruption, fa!e identities and have a fair process.,oing through the client soft are readme documents available on the 4I/)I ebsite, the soft are is currently designed for <2(bit operating systems and requires $icrosoft .6ET 9rame or! <.D 2*1 and $icrosoft 2:; 2erver 2??A %2.)ccording to another technical document titled %egistrar Integration manual, it is suggested that prior to citi1ens coming in for the biometric scans. ) pre(enrollment process ta!es place hereby demographic data and its verification is done beforehand. The need for )adhaar pro+ect arose after the discovery of fa!e and duplicate records and non(e"istent beneficiaries in governmentGs elfare schemes for the underprivileged. This as mainly due to poor attempts at verification of demographic and biometric information. The )adhaar *ro+ect ill address these issues. 4nique Identification )uthority of IndiaGs (4I/)I) overarching goal is to ensure that a significant number of underprivileged citi1ens are brought under the 4I/ system. To conclude ith the quote of 6andan 6il!eni EThis is not technological gobbledygoo!. It ill change India at scale and speed.F $,$ $)C$S 1. *rashanthi,$.*., *riyan!a, (2?1< ), S)adhaar 'ard (4I/) and itGs )pplicationsG, .usiness )rticle, = -une, 2?1<, available at http>&&mbas!ool.com&author&BC?<.retrieved on /ec. <1,2?1<.

1DA

2. Times of India (2?1<), G)dhaar e"ample of using Technology to leapfrogG , available at http>&&articles.timesofindia.indiatimes.com&2?1<(1?(1C&india.,%etrieved /ec 2D,2?1<. <. The 8indu, *ress Trust of India ,(2?1<), S6ile!ani targets C?? million )adhaar cards by 2?1@G, available at http>&& .thehindubusinessline.com&industry(and( economy&nil, @. %eserve .an! of India, (2?1<), S)dopt )adhaar authentication for card(based transactionsG, )vailable at http>&& .livemint.com&Industry&vqgD44de+E fdqquDAap6&)dop., %etrieved = -une,2?1<. D. S'ompanies, processes and technology behind IndiaGs 4I/ pro+ect, )adhaarG, edited by $anan 5a!!ar )vailable at http>&& .1dnet.com&blog&india&companies( processes(and(tech.&1 #ct 2?1?, %etrieved on 2D /ec, 2?1<. C. http>&& .bioenabletech.com&aadhaar(card,retrieved , %etrieved on 2B /ec., 2?1<. 7# http>&&uidai.gov.in& A. http>&& .npci.org.in&documents&)E*29):.an!.pdf =. http>&&en. i!ipedia.org& i!i&4niqueQIdentificationQ)uthorityQofQIndia

1D=

$SCA?AT&)% T $)DS ,O &),O MAT&O) COMP0T&)% O@$ "$T$ O%$)$O0S -$3 Dr+"arm#nish Taneja DA@ College/ Sector 5</ Chandigarh+ harm#nish+taneja1gmail+com Dr+(avita Taneja SD College/ Ambala Cantt+/ "aryana+ *avitatane1gmail+com A3ST ACT The information computing over eb is comple", coping ith the e"pectations of diverse users and balancing the forces upon effective computing have inherent engineering challenges. The impact of 0orld 0ide 0eb (000) in 2?1< is staggering, as it is garnering more and more attention in every single aspect of life. 8o ever, the processes that go into ma!ing an application more usable from userGs point of vie are relatively immature. The amount of data on eb has been e"ploding, gro ing at an apparently unstoppable rate for years. This paper highlights the ma+or characteristics of information computing over eb. The popularity of the 000 is accompanied ith plethora of ever emerging research issues in the field of information computing over eb and the same is discussed in this paper. &)T OD0CT&O) Information computing on eb ta!es account of the structure, storage, analysis, searching, and retrieval of information. The primary function of current eb search engines in this direction is to efficiently search for the query results at the document level. 8o ever, countless structured information about real( orld ob+ects is embedded in static eb pages and online eb databases J1K. It is reali1ed that eb users usually search for information of a certain Sob+ectG, rather than a eb page containing the query terms. /ocument(level information retrieval can unfortunately lead to irrelevant results in ans ering miscellaneous queries of diverse users. The ob+ect oriented design paradigm hen applied to this field may greatly reduce the comple"ity of computing system hile improving reusability and manageability. The most distinguishing requirement of todayGs search result through information computing systems for comple" heterogeneous eb is to dynamically adapt to vigorously changing eb contents and demands. ,uaranteeing timeliness has become a decisive aspect of quality of service for many important eb applications. #b+ect oriented approach may improve performance for non(conventional eb search that handle outsi1ed volumes of eb. This may be addressed by managing irrelevant data accessed by queries and transactions and by enhancing the ran!ing mechanism. The paper is organised as follo s. In section 2, the 8istory of Information computing over 000 is discussed. 2ection < e"plores the applications of eb information computing. In 2ection @, a discussion regarding components of information processing over eb is given. 2ection D highlights the characteristics of the same. $a+or research issues are discussed in section C and finally section B concludes the paper.
1C?

"&STO 4! -$3 &),O MAT&O) COMP0T&)% Traditionally the concept of search engine as conceived as quic! information retrieval of stored eb data and as published ay bac! in 1=@D by an )merican engineer and science administrator, 7annevar .ush. The essay E)s 0e $ay Thin!F J2K may have been ritten as early as 1=<C. The first concrete search engine as shaped in the 1=C?s by ,erard 2alton at 'ornell 4niversity as the E2$)%T information retrieval systemF (2altonGs $agic )utomatic %etriever of Te"t) J<K. )lso, ,erard 2alton is mar!ed as the father of modern search technology. .ut the first on the internet, search engine as called )rchie, +ust )rchive ith the EvF removed to inde" 9T* archives. The first eb search engine as called 0ande" released in 1==< and used an inde" created by the first eb cra ler, 0orld 0ide 0eb 0anderer, ritten in *erl by $atthe ,ray at $assachusetts Institute of Technology. The need of instant communication as reflected in culture and commerce of common man in mid 1==?Gs. The gro th of 000 from email, te"t messaging, video calls to blogs, chat rooms, social net or!ing and online shopping sites as accompanied by creation of ne search engines supporting vivid information computing capabilities J@K. The first full te"t search engine as launched as 0eb'ra ler in 1==@ that inde"ed entire eb pages J1?K. ,oogle technology as originally called .ac!%ub, a pro+ect ;arry *age and 2ergey .rin started or!ing on in 1==C. Hahoo and $icrosoft didnGt have their o n search engine technology until 2??@. Hahoo 2earch used data from In!tomi, )lta7ista and as even po ered by ,oogle for some time JDK. $icrosoftGs $26 2earch opted for other search engine results usage and launched their o n technology in 2??D (beta in 2??@). )lso, ith higher total number of searches orld ide, .aidu, the 'hinese search engine, surpasses $icrosoftGs ;ive 2earch. The first eb site put up as http>&&info.cern.ch& on )ugust C, 1==1 J1@K. It is estimated that in 1==< eb carried only 1I of the information flo ing through t o ay telecommunication, by 2??? this figure had gro n to D1I and by 2??B more than =B I of all telecommunicated information as carried over the internet and not to mention the percentage in 2?11 J12, 1DK. APP?&CAT&O)S O, -$3 &),O MAT&O) COMP0T&)% #ne of the ma+or inventions of the 1==?s is the 000. 2ince its advent in 1==1, the eb has evolved as global interconnection of individual net or!s operated and used by both public and private sectors. Its origin can be traced bac! hen Internet as the tool to interconnect laboratories busy in government research. 000 has been e"ponentially e"panding reaching every remote corner of the earth. It has revolutioni1ed the availability of electronically accessible information. 8istorically the information computing methodologies implemented ere sufficient to tac!le only C2< ebsites on the internet (1==<), than today, hen there are over 1CD million ebsites on the internet. 0eb information computing has spectrum of applications from academic research to commercial applications. The enormous increase in the quantity of online te"t available and the demand for access to different types of information by diverse users have, ho ever, led to transformed applications of eb information computing in a ide range that go beyond simple eb page retrieval, such as question ans ering, eb ob+ect detection and trac!ing, summari1ation, multimedia retrieval, biological and chemical informatics, searched results mining, soft are engineering and
1C1

genomics JCK. The applications of eb information computing also include the content search in the digital libraries, media search li!e image, music, ne s, blog and video retrieval. 0eb information computing provides a fle"ible and open platform for electronic commerce and other peer to peer approaches, searching on the des!top, enterprise, federated, mobile, and social search for varied eb users. /omain specific applications of information computing include e"pert search, geographic information computing, and eb information computing in specific domains and other vertical searches. MA.O COMPO)$)TS O, -$3 &),O MAT&O) COMP0T&)% Information computing over eb broadly is to e"tract and manage the relevant information based upon userGs request from 000 as sho n in 9igure 2. The main components of eb information computing are as follo s> u Crawler> 'ra lers are used to collect the information from the eb pages using graph searching techniques JCK. It scrutini1es the pages from eb and gathers the required information for the search engine from given set of 4niform %esource ;ocator (4%;). u Page epository> The database here the information collected by eb cra ler is stored in termed as page repository. u &ndeHer> It inde"es the various eb pages contained in repository. The inde"ing process collects, parses and stores data in order to facilitate fast and accurate information retrieval J1<K. This optimi1es speed and performance of eb information computing. u an*ing> The ran!ing techniques are used to assign the priorities to the documents and e"tract the same from the inde"ers le"icon and present them to the diverse users J11K. C"A ACT$ &ST&CS O, -$3 &),O MAT&O) COMP0T&)% The volatile nature of the eb is characterised by boundaries of classic eb information computing systems. 0eb content is distributed across countless eb servers scattered across the Internet, therefore unli!e conventional approach, it is a prerequisite to assemble a realistic snapshot of the ebGs content before constructing its representation through inde"ing.

1C2

0orld 0ide 0orld 0ide 0eb 0eb 4ser(s) :uery

%esults

Web *age (uer *rocessor

%esults

'ra ler

0eb *age
#ptimi1ed (uer

5ey ords

/atabase )
%epository

,ig 5! %eneral architect#re of web information comp#ting thro#gh Search $ngine In tandem ith developments in eb technology and eb programming, the eb is increasingly functioning as a platform for a gro ing number of on(line services and eb applications such as Internet ban!ing, eb mails, on(line shopping etc. 'hanges in the use of the eb induce changes in the intent of eb searchers JBK. The abundance of content on the eb demands greater discrimination hen returning search results for broad(topic searches. )nother characteristic that have direct impact on eb information computing is deliberate manipulation of eb search engines in order to boost the ran!ing of eb documents in search results. /ue to the commercial motives of traffic hungry eb site o ners, manipulation of this sort ranges from being deceptive to fraudulent. E"ponential gro th of eb users and the ease ith hich they can upload contents on eb highlights the need of content controls on material published on the eb but in general it is absent leading to a higher chance that modern eb documents contain incorrect information than conventional eb. 0eb searchers tend to feel more assured by information that originates from important sites. The most important design criteria for optimised computing over eb may be relevancy of retrieved content. /uplication poses a problem for both search engines and eb users ali!e. 2earch engines are computationally burdened by the cra ling, inde"ing and storage of duplicate content and users face larger list of searched results in presence of duplicates. $S$A C" &SS0$S O, -$3 &),O MAT&O) COMP0T&)% 0eb information computing presents e"cellent opportunities and challenges for the research and development of ne generation eb(based information processing methodologies, as ell as for e"ploiting eb intelligence. 0ith the s ift e"pansion of the eb, even the
1C<

common man can access information on absolutely every topic on 000. $a+ority of eb users needs are limited still boundless to follo ing three !ey features> 1. %elevant results from userGs perspective. 2. Interface that is friendlier. <. 2cope for limiting or e"panding search criteria. .oundless as the ease of usage and the efficiency share the pac!age ith spectrum of open problems in the field of information computing over eb. 9ollo ing is the list of ma+or research issues in this regard> Si'e of web+ 0eb has the curse of too much information. The eb of infinite information reflects that almost all e"isting methods and tools to manage information are not designed for a orld of infinite information. The challenge is to develop information computing that can ensure originality and scalability of most of the information of interest. "eterogeneo#s web so#rces+ The amount of information being added to the 000 every day is not only rising in content but also information sources are very diverse. In its origins eb as restricted for a fe speciali1ed users. 6o adays, unfortunately, the more data is posted to eb by diverse users, the more difficult it is for creation and maintenance of structured searchable data for users. &nterface Design+ %ising applications of Internet has scarf up highly heterogeneous set of users in terms of their needs and comprehension of eb. The search of information on eb has rightly transformed to Mdiscovery of informationM, truly a discovery if user could find the desired search results. "#ge n#mber of search res#lts+ If the results happens to be large li!e t o millions, and the results desired miss to e"ist in the first screen of hits, the user prefer to repeat the search by EimprovingF search criteria rather than scanning the rest of the result list. &nterpretation of web search res#lts+ If the search result is 1ero, it is usually tric!y to !no hich segment of the te"t query lead to unsuccessful search. (eyword based searching+ 7ocabulary mismatch issues in inde"ing and retrieval is the most common outcome of this most prevalent and traditional approach of eb search. 0eb queries do not represent all desired information. 0eb search engines are effective for some types of queries in some conte"ts. %etrieval of the eb pages containing all the query ords typed by user and then ran!ing them according to other features based on lin!s, 4%;s, 8yper Te"t $ar!up ;anguage (8T$;) is traditional approach that is not very effective for other types of queries, and in other environments. an*ing+ 0eb information is infinite and thereGs al ays some here else to go. Information computing in such e"panding environment should be able to use conte"t and query features to infer characteristics of the information need such as query and ans er types and use these characteristics to ran! potential eb pages. )utomatic learning for popularity propagation factor using the partial ran!ing of the eb ob+ects is also a gro ing challenge. Crawling+ 0eb content is distributed across countless eb servers therefore unli!e Information %etrieval collections it is a prerequisite to assemble a snapshot of the eb contents and this +ob is challenging in terms of scalability of cra ling techniques.

1C@

$ffective etrieval+ ,lobal eb content retrieval orld is vibrant, gro ing and a ash ith options. 0eb users al ays elcome this breadth of choice. 8o ever, retrieving the right eb page based on query poses unique challenges that can be tric!y hen sifting through the myriad of options available. Effective retrieval particularly in terms of relevancy of result and speed of information computing over eb demands enhanced computing JAK. *articularly user e"pect internet as electricity, i.e., user need not even thin! about itN itGs +ust there. -eb Congestion+ 4sersG queries support a large s ath of the eb ecosystem. These contribute valuable traffic to numerous eb sites and fuel the e"pansion of eb usage. 0eb sites must deliver the most value in less time. 9or e"ample ,oogle has al ays anted people to come to ,oogle and then go a ay. 4nfortunately many eb sites measure success by time user be on ebsite leading to multiplying congestion on eb. M#lti7ling#al and M#lti7media &ss#es+ $ultimedia retrieval, multilingual searches involving eb pages in different languages need to include translation services as appropriate. )lso visual searches represent query parameters in a non te"tual format here applicable that is primarily comple" J=K. Identification of eb ob+ects in eb information computing is largely an artistic process. 9or embedding ob+ect oriented concepts, eb information computing need to develop modular and e"tensible information computing components so that these components can be used in a mi" and match fashion. To build ob+ect oriented eb information computing systems, developers need to e"plore a large design space that may be tailored for better performance. E"isting information retrieval methods provide plethora of tools and techniques that require enhancement in the light of continuous gro th of eb. /esign and development of information computing systems is a comple" and e"pensive process.

CO)C?0S&O) The challenges faced by e"isting performance of information computing over 000 emphasi1ed that information computing requires fundamental changes to conventional information retrieval strategies to satisfy modern eb users. Traditional search engines on 000 focus essentially on relevance ran!ing at the page level. *age(level information retrieval can unfortunately lead to highly inaccurate relevance ran!ing in ans ering ob+ect oriented queries. The most distinguishing requirement of todayGs comple" heterogeneous eb is the need of the computing system to instantly adapt to vigorously dynamic eb conditions. 'onventional information computing mechanisms are based on cra ling eb information and ran!ing results. These mechanisms ere designed for !ey ord based search on limited eb and controlled users. 8o ever, information (ma+orly unstructured) uploads and updations over e"ponentially e"panding eb can be very frequent in present scenario ma!ing conventional mechanisms both ineffective and e"pensive. The ran!ing problem e"aggerates particularly in case of social net or!s here user and unstructured information sources diversity are at its e"tremes and needs to be re(visited.0ith gro ing popularity and ever gro ing si1e of 000, ne challenges for information computing are +ust round the corner
1CD

as it is becoming critically important to provide eb users ith search results that are in alignment ith the requirements ith ease and accuracy. 0eb information computing at the bac!end handle distributed dynamic environment to provide higher relevancy for eb search results. $,$ $)C$S 1. ;a rence 2., and ,iles '.> E2earching the 0orld 0ide 0ebF, in the -ournal of 2cience, 7olume 2A?, 6umber D<C?, pp. =A(1??, pp. AR1??, 1==A. 2. .ush, 7.> E)s e may thin!F, in )tlantic $onthly, 7olume 1BC, Issue 1, pp. 1?1R 1?A, 1=@D. <. 2alton ,., and $c,ill $.> EIntroduction to $odern Information %etrievalF, by $c,ra (8ill, 6e Hor!, 1=A<. @. Vu -. ;.> EInternet search engines> %eal orld information retrieval issues and challengesF, in the *roceedings of 'onference on Information and 5no ledge $anagement, 5ansas 'ity, $issouri, 6ovember 1===. D. .attelle > EThe 2earch> 8o ,oogle and its %ivals %e rote the %ules of .usiness and Transformed #ur 'ultureF 1st Edition, *ortfolio 8ardcover 2??D. C. .rin 2. and *age ;.> EThe )natomy of a ;arge(scale 8yperte"tual 0eb 2earch EngineF, in 'omputer net or!s and I2/6 systems, 7olume <?, pp. 1?BR11B, 1==A. B. *i!to -.> E2ummary of 000 characteristicsF, in the 0orld 0ide 0eb -ournal, 7olume 2, Issue 2, pp. 2R1<, 1===. A. ,ordon, $., and *atha!, *.> E9inding information on the 0orld 0ide 0eb> The retrieval effectiveness of search enginesF, in Information *rocessing and $anagement, 7olume <D, Issue 2, pp. 1@1R1A?, 1===. =. Vu -. ;.> E$ultilingual search on the 0orld 0ide 0ebF, in the *roceedings of 8a aii International 'onference on 2ystem 2ciences <<, $aui, 8a aii, -anuary 2???. 1?. *ushpa %. 2uri and 8armunish Tane+a> EInde"ing 0eb /ocuments for 'omputing on 0ebF, in the *roceedings of 6ational 'onference on Emerging Trends in 0eb 'omputing, ,6, 'ollege, Hamuna 6agar, 8aryana, India, pp.1@D(1C?, #ctober 2?1?. 11. *ushpa %. 2uri and 8armunish Tane+a> E0eb(ob+ect %an! )lgorithm for Efficient Information 'omputingF, International -ournal of 'omputer 2cience and Information 2ecurity (I-'2I2), *ittsburgh, 42), 7olume =, 6umber 2, pp. 1C2(1CB, 9ebruary 2?11. 12. ;aure .. 5ohen, EThe orld of 2earch EnginesF, Internet Tutorials 2?11 J#nlineK, available at, http>&& .internettutorials.net& orld(of(search(engines.asp, 1< /ec. 2?11. 1<. ;arson %.> EIntroduction to Information %etrievalF, in the -ournal of the )merican 2ociety for Information 2cience and Technology, 7olume C1, Issue @, pp. AD2(AD<, 2?1?. 1@. http>&&info.cern.ch 1D. http>&& .searchenginehistory.com&

1CC

&MPACT O, $?$CT O)&C COMM$ C$ O) T"$ 30S&)$SS Dr+ "+ S+ 3halla "ead/ Deptt+ Of Commerce/ %ovt+ College/ Ajnala/ Amritsar+ Dr+ "ardeep (a#r Assistant Professor/ + + 3awa D+A+@+ College for %irls/ 3atala+ hardeep*a#r<D1gmail+com A3ST ACT Electronic commerce is also commonly !no n as e(commerce+ It is a type of industry here the buying and selling of products or services is made over the electronic systems such as the Internet and other computer net or!s. Electronic commerce is generally considered to be the sales aspect of e(business. It also consists of the e"change of data to facilitate the financing and payment aspects of business transactions. Electronic commerce is an effective and efficient ay of communicating conducting business. Electronic commerce is also bringing transformation in business. If e ill tal! about the businesses of ho sell online, almost C?I people said that e(commerce has increased their sales. They also feel that their geographic reach has also e"panded. $oreover doing the business on the internet also helps the industry to save time, energy and paper. Through saving of papers the business also helps the society by saving environment. 0e al ays tal! about that e should emit less pollution and save trees. )nd electronic commerce helps us in this regard a lot. Electronic commerce or e(commerce refers to a ide range of online business activities for products and services. It also means to any form of business transaction in hich the parties interact electronically. E( commerce is usually associated ith buying and selling over the Internet. The business involves the transfer of o nership, rights to use goods &services through a computer net or!. Electronic commerce is generally considered to be the sales aspect of e(business. It also consists of the e"change of data to facilitate the financing and payment aspects of business transactions. This is an effective and efficient ay of communicating ithin an organi1ation and one of the most effective and useful ays of conducting business. E(commerce can be divided into> #nline catalogs(E(Tailing) .uying or 2elling on various ebsites The gathering and use of demographic data through eb contacts and social media Electronic /ata Interchange (E/I) E(mail and fa" TodayLs Internet as initially developed through 4.2. ,overnment investment in computer net or!ing technology dating bac! to the 1=C?Ls. The Internet as originally used for lin!ing and transmitting information among scientists. .ut no days it is idely used in every field. T4P$S O, $7COMM$ C$

1CB

3#siness7to73#siness 63>38! .2. e(commerce is simply defined as e(commerce bet een companies. This is the type of e(commerce that deals ith relationships bet een and among businesses. )bout A?I of e(commerce is of this type, and most e"perts predict that .2. e(commerce ill continue to gro faster than the .2' segment. The .2. mar!et has t o primary components> e(infrastructure and e( mar!ets. 3#siness7to7Cons#mer 63>C8! .usiness(to(consumer e(commerce, or commerce bet een companies and consumers, involves customers gathering informationN purchasing physical goods (i.e., tangibles such as boo!s or consumer products) or information goods (or goods of electronic material or digiti1ed content, such as soft are, or e(boo!s)N and, for information goods, receiving products over an electronic net or!. It is the second largest and the earliest form of e(commerce. 3#siness7to7%overnment 63>%8! .usiness(to(government e(commerce or .2, is generally defined as commerce bet een companies and the public sector. It refers to the use of the Internet for public procurement, licensing procedures, and other government(related operations. This !ind of e(commerce has t o features> first, the public sector assumes a pilot&leading role in establishing e(commerceN and second, it is assumed that the public sector has the greatest need for ma!ing its procurement system more effective. 0eb(based purchasing policies increase the transparency of the procurement process (and reduce the ris! of irregularities). Till date, ho ever, the si1e of the .2, e(commerce mar!et as a component of total e(commerce is insignificant, as government e(procurement systems remain undeveloped. Cons#mer7to7Cons#mer 6C>C8! 'onsumer(to(consumer e(commerce or '2' is simply commerce bet een private individuals or consumers. This type of e(commerce is characteri1ed by the gro th of electronic mar!etplaces and online auctions, particularly in vertical industries here firms&businesses can bid for hat they ant from among multiple suppliers. It perhaps has the greatest potential for developing ne mar!ets. Mobile Commerce 6m7commerce8! $(commerce (mobile commerce) is the buying and selling of goods and services through ireless technology(i.e., handheld devices such as cellular telephones and personal digital assistants (*/)s). -apan is seen as a global leader in m(commerce. )s content delivery over ireless devices becomes faster, more secure, and scalable, some believe that m(commerce ill surpass ire line e(commerce as the method of choice for digital commerce transactions. This may ell be true for the )sia(*acific here there are more mobile phone users than there are Internet users.

&MPACT O) 30S&)$SS E(commerce helps people to carry out businesses ithout the barriers of time or distance. #ne can log on to the Internet at any point of time i.e,2@ hours a day according to o n desire. .enefits to the $ar!et $ar!et analysis, product analysis and customer analysis is improved no a days Easy to create and maintain client database
1CA

;o (cost in advertisement 8elps small businesses compete against large companies. Enables a very speciali1ed niche mar!et.

3$)$,&TS TO T"$ C0STOM$ )vailability of ide(scale information at one des!. )vailability of variety of products at the lo price. 2aving of time and money. 9ast services and delivery. $a!es it possible for people to or! and study at home. $a!es possible electronic auctions. $7COMM$ C$ A)D 30S&)$SS The internet has affected almost every aspect of our lives. It includes the ay e communicate ith each other and ho e !eep our database on different issues. It has made a profound impact on society. 6o days e prefer to do shopping online, hich forces retailers to open online division. It also forces smaller businesses to change their business style to being completely online. It has changed the ay of spending money. It ill continue to affect the companies to sell and mar!et their products. It ill also influence the people ay of spending in the coming years. D& $CT MA ($T&)% Electronic commerce enhances product promotion and services through direct interaction ith customers. 0hen e deals ith consumers via net the cost of delivering information is reduced automatically. The ne comers can also establish their image ith less e"pense. Electronic commerce is period of t o ay communication hich aims to e"plore, compare and question about product by the customer. It also offers the opportunity to understand the needs of customers. E(commerce enhances promotion of products and services through direct, attractive and interactive contact ith customers. 6e sales channel creates ne dimensions for e"isting products. It facilitates direct reach of customers and the bi(directional nature of communication. There is direct saving in cost of providing information to customers over the internet hich results in a lot of savings to senders in comparison ith non electronic delivery of goods. 6o the delivery of products and services is reduced to seconds. The administrative or! hich consumes lot of time earlier related to physical delivery of products is no reduced significantly. O %A)&JAT&O)S %apid progress in the field of e(commerce ill force organi1ations to adapt the ne technology quic!ly. It offers them the opportunity to e"periment ith ne products, services, and processes. 6o the organi1ations are more responsive and fle"ible in regard to consumers inquires. 6e organi1ational approaches are required for adoption of ne technologies. #rgani1ations should separate the e(commerce unit from the conventional sales
1C=

unit to obtain its benefit in full e"tent. This type of corporate change brings more fle"ibility in or!. The nature of or! and employment ill also be transformed. 9rom the point of vie of the organi1ations doing business online means the requirement of less staff members because all orders and transactions are e"ecuted automatically. The change brought on by these changes is helps to the great e"tent in creating ne opportunities and ne ris!s and helps us into ne ays of thin!ing about +obs and salaries. )gain the organi1ations ta!e advantages of price because there is a price difference bet een the traditional stores and online stores. #nline discounts and prices ill encourage shoppers to buy goods from an online store. ) product in an online store is cheaper because the cost of maintenance, due to online stores need not to pay for rent of shop, and different bills and more salaries for employing staff. #nline stores save money from different aspects of business and the ultimate benefit of hich pass it on to customers by lo ering their prices. #nline stores can ta!e advantage of fluid pricing hich is increasing or decreasing prices quic!ly depending on circumstances, hich is not or less possible in traditional stores. MA)0,ACT0 &)% E('ommerce also changed the manufacturing styles of business. 6o the business has shifted from mass production to demand(driven production. 6o the production process is +ust(in(time manufacturing. The production system has to ma!e vital lin! ith finance, mar!eting, and other functional systems, and not only ith the finance, mar!eting etc. they have to create lin! ith the business partners and customers. #rders that are ta!en from customers can be directed to designers and to the production floor, ithin seconds. *roduction cycle time is cut by D? percent or more in many cases, especially hen production is done in a different country from here the designers and engineers are located. 'ompanies li!e I.$, ,eneral $otors, are assembling products for hich the components are manufactured in many locations (;a!shmi, 2?1?). 2ub(assemblers are also getting benefit from this through gathering materials and parts from their vendors. )gain the cost benefits are also present in this aspect. ,&)A)C$ The requirement of finance and accounting system is different in case of e(commerce. The old pattern of payment system is ineffective or inefficient for business hich is done electronically. The use of the ne payment systems such as electronic cash is complicated. The use of electronic cash involves legal issues, complications and agreements on international standards. Electronic cash system made the business fast and easy. The lost of money during the +ourney and misappropriation in cash is also lesser hich act as security for producers. Electronic cash is the biggest revolution in currency era. Its diversity is perfectly suited to the internet. It could change consumersL financial lives and sha!e the foundations of financial systems and even governments. $,$ $)C$S 1. ;a!shmi, ;., 2?1?. Impacts of E('ommerce on .usiness, JonlineK available at> ^http>&& . articlesbase.com&ecommerce(articles&impacts(of(ecommerce(on( business(1AA2=D2.htmlf
1B?

2. <. @. D. C. B.

$alcom, 9ran!, MThe %ealities of 0eb .ased Electronic 'ommerceM, 2trategy 3 ;eadership, $ay&-une 1==B, p.<2. $onga %uchi (2?1?), EThe .usiness Impact of E('ommerceF ,ian -yoti E(-ournal, 7olume 1, Issue 2 (-an R $ar 2?12) 2ubhash .hatnagar and %obert 2ch are, EInformation and 'ommunication Technology /evelopment> 'ases from IndiaF, 2age *ublications, 2??? The Electronic 'ommerce and 'onsumer *rotection ,roup (EE('ommerce ,roupF), http>&& .ecommercegroup.org&guidelines.htm en. i!ipedia.org& i!i&E(commerce

1B1

O?$ O, 0)&,&$D MOD$?&)% ?A)%0A%$ &) SO,T-A $ $$)%&)$$ &)% .aswinder Singh esearch Scholar/ P#njab Technical 0niversity/ (ap#rthala+ jaswinder+singh1chit*ara+ed#+in Dr+ Ash# %#pta Assistant Professor/AP. &nstit#te of Management+ g#ptash#51 rediffmail+com Dr+ .aiteg Singh Associate professor/ Chit*ara 0niversity+ jaiteg+singh1 chit*ara+ed#+in A3ST ACT $a!ing a small change in the soft are because of change in user requirement or any other reason is crucial. 2tudies regarding soft are maintenance reveal that appro"imately D?I of maintenance time is spent by maintainers in the process of understanding the code. Thus need is to use some ay to visuali1e the pictorial representation of the code for better and accurate understanding. 4nified modeling language (4$;) is a visual modeling language, and is used to create visual model of soft are system. The %ole of 4$; is significant in all phases of soft are development li!e inception, elaboration, construction and transition. In this paper e proposed 4$; playing !ey role not only in understanding the e"isting code but also integrating the ne requirement in the e"isting soft are. #b+ective is to analy1e the ne requirement and to adapt the ne requirement in e"isting soft are by visuali1ing the functionality and incorporating the changes in correct manner. ($4-O DS> %eengineering, 4$;, 'lass /iagram, )ctivity /iagram, 7isuali1ation &)T OD0CT&O) To provide better understanding of the code of e"isting soft are, pictorial representation of the code is very much beneficial. 2o for better understanding of code the need is to convert the e"isting code in some pictorial representation. The pictorial representation should be such that e not only able to depict the functionality of each module but also ho these module are interacting ith each other. E"tending further the pictorial representation should also able to spea! about the scope of adapting enhancement in the e"isting picture. 4nified $odeling ;anguage (4$;) has already proved as a de facto standard to visuali1e, specify, construct and document the artifacts of soft are system. 4$; is playing very significant role in all phases of soft are development li!e inception, elaboration, construction and transition. 0e are emphasi1ing the significant role of 4$; in soft are reengineering. ?&T$ AT0 $ )ccording to Tichelaar .2 J1K, reengineering goes beyond soft are maintenance. %eengineering techniques can be used to perform maintenance tas!s such a bug fi"ing or any other adaptation ithin its original feature set. 8o ever, %eengineering can also be applied
1B2

to change systems in a more considerable ay, i.e., to add ne functionality. )s already stated above studies of soft are maintainers J2K have sho n that appro"imately D?I of their time is spent in the process of understanding the code that they are to maintain, so understanding the code is an important part of any soft are reengineering activity. #ne can argument that the structured analysis tools li!e data flo diagram (/9/) or entity relationship diagram (E%(diagram) can also provide visuali1ation of code but 9or diagrammatically representations of various phases of soft are development 4$; is better than using data flo diagrams and entity relationship diagram. ,he11i. ' et al. J<K clearly contrast the use of /9/s and 4$;. The boo! states /9/ and E% diagrams as semiformal approach and it recogni1e 4$; as a formal approach to develop modular specifications. 4$; is ell suited for ob+ect oriented paradigms here as /9/ or E% diagrams are ell suited for procedure paradigms. The role of 4$; in #b+ect #riented *rogramming (##*) has been idely accepted. .ruce E. 0ampler J@K stated that design and development methodologies have al ays needed a graphical notation to e"press the designs. In the past, one of the ma+or problems has been that each ma+or methodology has had its o n graphical notation. This has all changed ith the emergence of the 4$; (4nified $odeling ;anguage) as the standard notation. )ny of the current design methodologies, heavy eight or agile, use or can benefit from the 4$;.Hounis ..$ et al. JDK illustrate the use of 4$; based approach for re(engineering of programmable logic controller (*;') program. They illustrate the reengineering of *;' program using 4$; class /iagrams and state 'hart diagrams. CAS$ ST0D4 )n ob+ect oriented code ('ZZ code) JCK is considered that is represented in a file named Estudent.cppF()nne"ure(I). This code is required to be reengineered. To increase the understanding of e"isting code it is better to give a visual representation. To represent the structural vie of the code, class diagram of 4$; has been used. )s stated 2chmidt. -.0 et al. JBK 'lass diagrams are central for analysis, design and implementation. 'lass diagrams are the richest notation in 4$;. 9or the considered ob+ect oriented code, class diagram of 4$; not only sho s the detailed structure of every class but also the relationship among various classes. /iagram 1 sho s the class diagram for e"isting 'ZZ code. The inheritance implementation in code is visuali1ed using Egenerali1ationF relationship among classes. 'lass diagram also representing an association among student and sports class ith multiplicity of many to many. Every individual class is identified by their name .'lass diagram is not only representing the attributes and operations of each class but also represents the scope, data type ,number of arguments and their types for every operations and attribute of the class. .y follo ing this diagram e can very ell analy1e that $ar!s class is being inherited from 2tudent class and %esult is inherited from $ar!s class and 2ports class. 2ports are associated ith the student as score attribute %epresent score of mar!s achieved by student.

1B<

)fter understanding the 'ode, no it is required to be reengineered. 6e requirement says the incorporation of grade module ith the e"isting 'ZZ code. 2ummerville .I JAK illustrates a possible reengineering process and stated that soft are re(engineering al ays involves some program re(structuring. /iagram 1 represents a phase of soft are reengineering here there is analy1ed e"isting code and documented it ith the help of 4$; diagram. To include the ne requirement, e need to understand the behavior of the system. The behavior can be ell understood by the use of activity diagram of 4$;. .. *each in his paper J=K illustrates the use of 4$; activity diagrams in a user oriented soft are development process aiming at an ob+ect(oriented analysis and interface model. )s described by #+o .) et .al J1?K activity diagrams sho s control&data flo s from one activity to another, addresses the dynamic vie of a system, useful for modeling its functions and emphasi1es the flo of control among ob+ects .the behavior of our system hen e tal!ing about addition of ne module has been analy1ed .thus /iagram 2 represent an )ctivity diagram depicting ho the reengineered code ill behave. )s defined by Ian 2ummerville, one phase of soft are reengineering(*rogram structure improvement, by using activity diagram analy1ed and modified the behavior of our system

. )fter analy1ing the behavior, e no that it is required to create an entity for grade calculation. 2o requirement has been recogni1ed. 0e can no give the visuali1ation of hat
1B@

is required using 4$;. 'lass diagram can fulfill this diagram required static structure.

hich is able depict the

/iagram < is representing the signature of our ne class. This structure is representing the attributes and operations also. The interrelationship of this ne class ith e"isting classes can be visuali1ed using class diagram as sho n in diagram @.

#nce the class has been analy1ed, the behavior of this entity has been identified using 4$; activity diagram. /iagram D given belo sho s the required activities using the activity diagram.

1BD

$S0?T /iagram @ and D depicts structural representation of classes after introducing ne class and the activity diagram for calculating grades respectively. 6o this can be helpful to reali1e the actual code and successful implementation of requirement. 9inal code after reengineering is given in Estudent%.cppF ()nne"ure(II). Thus 4$; visuali1es the activities of soft are reengineering for better understanding. Tools (li!e $agic /ra ) are available to directly convert the diagrams to the appropriate code of 'ZZ. CO)C?0S&O) Thus 4$; plays the !ey role in understanding the e"isting code and integrating the ne requirement in the code. .y ta!ing a simple 'ZZ code e are emphasi1ing the use of 4$; in soft are reengineering .#ne can easily analy1e the use of 4$; for large soft are pro+ects hich are required to be reengineer. In this paper only t o types of 4$; diagrams are sho n but for large scale soft are reengineering pro+ects e can get the advantage of using other 4$; diagrams li!e 4se 'ase, 2equential, 'omponent, 2tate, #b+ect and /eployment /iagram. These diagrams can very ell visuali1e the structural, behavioral, implementation aspects of soft are for giving significant support for soft are reengineering. $,$ $)C$S 1. Tichelaar, 2. 2??1. $odeling #b+ect(#riented 2oft are for %everse Engineering and %efactoring, 4niversity of .ern> 8ochschulstrasse 2. 9+eldstad, %. 3 8amlen, 0. (1=A<). M)pplication program maintenance(report to to our respondentsM. Tutorial on 2oft are $aintenance, 1<(2B. *ari!h, ,. 3 Tvegint1ov, 6. (Eds.). IEEE 'omputer 2oc. *ress. <. ,he11i, '., -a1aeri, $., 3 $andrioli, /. 2??<. 9undamentals of 2oft are EngineeringF. *rentice 8all, I2.6 W> ?1<<?DC==C.
1BC

@.

.ruce E. 0ampler 2??1 The Essence of #b+ect #riented *rogramming ith -ava and 4$;, )ddison(0esley ;ongman *ublishing 'o., Inc. .oston, $), 42) D. Hounis .$. . and frey.,,2??C 4$; based approach of reengineering of *;' program C. 2chmidt .-.0 ,$atthes .9, 1=== B. .alagurusamy E. S#b+ect oriented *rogramming 'ZZG, < rd Edition, by Tata $c,ra hill publication A. 2ummerville. I. 2??B. 2oft are Engineering, Ath editionF by *earson education =. ..*each =A,E#n the %ole of )ctivity /iagrams in 4$;, Institute for Informatics, Technical 4niversity> $unich 1?. #+o .) and Esteve1 .E 2??D,#b+ect(#riented )nalysis and /esign ith 4$; , version 1.?.

1BB

,$AT0 $ $ET ACT&O) A)D C?ASS&,&CAT&O) &) %0 0M0("& C"A ACT$ $CO%)&T&O) S4ST$M @i*ram Sharma/ Asst+ Professor/ DA@ College/ Amritsar vi*2pnv1yahoo+com

A3ST ACT )n optical character recognition (#'%) is the process of converting scanned images of machine printed into computer readable codes. %ecognition of characters of Indian languages li!e hindi and pun+abi has been an area of research for many peoples and large number of research papers and reports have been published in this area. This generali1ed ay for developing #'% system of any script involves preprocessing, segmentation, feature e"traction 3 classification and *ost processing. This paper describe mainly on 9eature E"traction and 'lassification *hase of #'% of ,urumu!hi script. *ossible feature sets that can be possessed by a character (of ,urumu!hi script) li!e presence of sidebar, presence of headline, number of +unctions ith baseline are discussed that contains discriminating information, hich can distinguish one character from another. The classification stage uses the features e"tracted in the previous stage to identify the te"t segment according to preset rules. ) hybrid classification scheme, hich combines the relative advantages of binary tree and nearest neighbor classifiers, is described.

($4-O DS> ,urumu!hi script, *reprocessing, 2egmentation, 9eature e"traction, 'lassification, 9eature sets, *ost processing. &)T OD0CT&O) #'% is the acronym for #ptical 'haracter %ecognition. ) human eye can read the characters of any language ritten correctly by person or hen it is printed. $a!ing the computer do the same is called the problem of character recognition. #'% (optical character recognition) is the process of converting scanned images of machine printed or hand ritten te"t or hand printed te"t into computer readable codes. The practical importance of #'% application, as ell as the interesting nature of the #'% problems has led to great research in this challenging fieldJ2K. %esearch in #'% is popular for its applications in many applications including post offices, defense organi1ations, office automation, cheque verification and a large variety of ban!ing, business, data entry applications and commercial data processing applications J1K. The main goal of #'% is to imitate the human ability to read in a very fast rate. The process of #'% of any script involves pre(processing, 2egmentation, 9eature E"traction, 'lassification and *ost processing.
1BA

,$AT0 $ $ET ACT&O) The feature e"traction stage analy1es a te"t segment (character) and selects a set of features or descriptors that can be used to uniquely identify the te"t segment. The selection of proper set of feature is most important stage of #'%. In most of the Indian language li!e 8indi and *un+abi, every character has certain features that distinguish it from another character. ) good feature set containing discriminating information, hich can distinguish one ob+ect from another ob+ect. It must also be as robust as possible in order to prevent generating different feature codes for the ob+ects in the same class. The selected set of features should be a small set hose values efficiently discriminate among patterns of different classes, but are similar for patterns ithin the same class. The purpose of feature set is to precisely divide the set of the characters lying in middle 1one into smaller subsets hich can be easily managed. The cardinality of these subsets varies from 1 to A hich mean that number of characters is a subset is from 1 to A. 9or classifying the character set into smaller subclasses, a binary classifier tree J<K is used hich ma!es use of one feature among feature set at each node. 2ome of the features used in ,urumu!hi script are> a8 )#mber of j#nctions with the headline 6ft58! It can be noted that each character in middle 1one of ,urumu!hi character set has either one or more than one +unctions ith the headline. 9or e"ample r has one +unction ith headline hile V has t o +unctions ith headline. This feature is true if a sub(symbol of ,urumu!hi has one +unction ith headline else it is false. There are 1= sub(symbols in ,urmu!hi characters set having this feature true> h, !, s, c, ' +, +, t, T, f, 9, ", q, d, n, *, ., r, v, 7 )dditionally, this feature is true for both the components of g (a multicomponent character). $oreover, this feature is also true for vo els I, i. #n the contrary, this feature is false for a, E, e, s, 5, ,, -, z, :, /, p, b, m, V, l This feature has been used to divide the complete ,urmu!hi characters set into t o almost equal si1ed subsets. )s sho n in 9igure 2(d), for the ,urmu!hi character s, this feature is false. )s sho n in 9igure <, for the characters !, c, f, 9, d and v, this feature has become false instead of true. b8 Presence of sidebar 6ft>8! This feature is present if a vertical sidebar, of appro"imately the same height as of the character, is present at the rightmost side of the sub( symbol. 9urther, it is noted that if full sidebar e"ists in ,urmu!hi characters, it is al ays at the rightmost side of the character. There are 11 characters in middle 1one having full sidebar at their right end. These characters are> ), s, 5, ,, +, :, /, p, b, m, V . )dditionally, second component S.G of the multi component character gagga (g) has sidebar at the right end. There are t o vo els bihari (I) and sihari (i), hose one stro!e falls in middle 1one having sidebar at their right end. )lso four characters have quarter sidebar at their right end. These characters are> r, h, c and first component SrG of the multi component character g. These characters have also been considered for this feature. )s such, there are total 1A sub(symbols (characters, vo els, components of multi component characters) containing this feature. This feature divides the hole set of sub(symbols in middle 1one in almost t o equal si1ed subsets. The feature is true if a vertical sidebar is present at rightmost side of the sub(symbol else it is false. )s sho n in 9igure 1(a), the ,urmu!hi character sassa (s) has full sidebar. Presence of half sidebar 6ftB8! This feature is present if a sidebar, of appro"imately half the height of the full character is present at the rightmost side of the sub(symbol. There
1B=

are A characters in ,urmu!hi script having this feature> e, ', z, t, 9, d, *, v. In addition to these, one vo el !anna( ) also contains this feature. This feature is true if a half sidebar is present at the rightmost side of the sub(symbol else it is false. )s sho n in 9igure 1(b), for ,urmu!hi character iri (e) this feature is true. Presence of a loop 6ftD8! The presence of a loop in the character is another important classification feature. #ne thing to be noted is that e consider a loop only if headline is not part of that loop. 9or e"ample V does not have a loop since headline is involved hile r has a loop. Open at top 6ftC8! This feature is true if the character is open at top along the headline or in other ords if there is no loop containing headline as its subpart. E"amples of characters ith this feature are R p and m hile it is absent in l and V. Presence of headline 6ftG8! The presence of headline in the sub(symbol is another important feature for classification. Even hen the sub(symbols are highly degraded, this feature is retained. 9or e"ample, p has no headline hile t has headline. There are <? sub symbols in middle 1one of ,urmu!hi character set having this feature present> a, e, s, h, !, g, s, c, ', +, -, z, t, T, f, 9, ", q, :, d, /, n, *, b, ., V, r, l, v, 7 9urthermore, three vo els I, i and have this feature true. This feature is very much robust to the noise. This feature is e"tremely useful for differentiating similar characters such as s and m, 5 and :, / and p (ftB). This feature is true if headline is present else it is false. )s sho n in 9igure 1(c), the ,urmu!hi character s contains this feature.

,ig#re 5! ,eat#res of %#rm#*hi characters! 6a8 sidebar present/ 6b8 half sidebar present/ 6c8 headline present C?ASS&,&CAT&O) The classification stage is the main decision(ma!ing stage of an #'% system that uses the features e"tracted in the feature e"traction stage to identify the te"t segment according to the preset rules J@K. Template matching, syntactic or structural methods, statistical methods JDK, artificial neural net or!s, !ernel methods JCK and hybrid classifiers (binary classifier tree and nearest neighbor classifier) are notably used classification methods. Traditionally, nearest neighbor classifier and binary classifier trees have been the t o most commonly used classifiers. The nearest neighbor classifier is an effective technique for classification problems in hich the pattern classes e"hibit a reasonably limited degree of variability. 9or a specific and clear machine printed te"t, the pattern of each class tends to cluster tightly about a typical or representative pattern for that class. 4nder these conditions, a nearest neighbor classifier can be a very effective approach to the classification problems. The nearest neighbor method compares the input feature vector ith a library of reference vectors and the pattern is identified to be of the class of the library feature vector to hich it has the closest distance. It, ho ever, suffers from the t in problems of speed and memory. The si1e of the
1A?

library has to continually increase as the classifier is required to recogni1e more and more fonts JDK. If the classifier requires a library of 1, ??,??? vectors to achieve acceptable accuracy on the training set, then 1,??,??? distances must be computed at run time to classify each input vector. 8uge amount of memory is also required to store those 1, ??,??? library feature vectors. ) binary tree classifier determines the classification of a point in feature space (the input feature vector), by successively narro ing the region in hich it is e"pected to lie. 2tarting from the root node, the classifier tests a particular feature or a set of features associated ith that node and decides hether to branch to the ne"t left node or the ne"t right node. The process is continued until the classifier traces a path to a particular terminal node and returns the classification associated ith that terminal node. B+5 "ybrid classification scheme 'onsidering the relative advantages and disadvantages of both the classifiers, a hybrid classification scheme hich combines the relative advantages of binary tree and nearest neighbor classifiers may be used. This is e"pected to result in a very effective classification scheme. The hybrid classification scheme that can be used for ,urumu!hi (*un+abi) characters proceeds as follo s> 1. 4sing binary classifier tree, depend upon the e"tracted features, the symbols are classified into different character sets. In one set, e can have more than one symbol. 2. )fter this, the symbol classified to one of the possible sets is recogni1ed using nearest neighbor classifier. The main advantage of the hybrid classification scheme in contrast to the conventional single(stage classifiers here each character image is tested against all prototypes is that a character image is tested against only certain subsets of classes at each stage. This enhances computational efficiency. CO)C?0S&O) ) good feature set containing discriminating information hich can distinguish one ob+ect from another ob+ect. 9eatures set identified in this paper using various methods have the success rate of =<I.The hybrid classification scheme is very effective for machine printed characters and have a success rate of =?I for Indian languages script. 8o ever, applying hybrid classification scheme for recogni1ing hand ritten characters does not provide us e"pected results and there is need to apply some other classification methods li!e 27$. $, $)C$S 1. 2.6. 2rihari 3 2tephen 0. ;am,'haracter recognition 2. -. $antas, E)n overvie of character recognition methodologiesF, )attern (ecognition <. ;ehal ,. 2. and 2ingh 'handan, 9eature E"traction and classification for #'% of ,urmu!hi script, 7ive!, 1=== @. *al 4. and 'haudhary .. .., 'omputer recognition of printed .angla script, IntLl -. 2ystem science 2C,1==D(21?B(212<). D. 5artar 2ingh 2iddharth , $ahesh -angid, %enu /hir, %a+neesh %ani, E8and ritten ,urmu!hi 'haracter %ecognition 4sing 2tatistical and .ac!ground /irectional

1A1

/istribution 9eaturesF, International -ournal on 'omputer 2cience and Engineering (?=BD(<<=B), 7ol. < 6o. C -une 2?11. C. 7i!as - /ungre et al., E) %evie of %esearch on /evnagari 'haracter %ecognitionF, International -ournal of 'omputer )pplications (?=BD(AAAB), 7olume(12, 6o.2, 6ovember 2?1?

1A2

-$3 $POS&TO 4 $,,&C&$)C4! O?$ O, "TTP $ET$)S&O) , AM$-O ( @ive* Aggarwal Deptt+ Of Comp#ter Science/ DA@ College/ Amritsar+ vive!Qaggar{yahoo.com A3ST ACT ) eb repository stores and manages a large collection of data Mob+ects,M in this case eb pages. $any sites, in particular search engines, use cra ling as a means of building eb repository. There are many important characteristics of the 0eb that ma!e cra ling very difficult. The 8TT* E"tension 9rame or! is a simple yet po erful mechanism for e"tending 8TT* by describing which e"tensions are introduced along ith information about who the recipient is, and how the recipient should deal ith them. This paper discusses the concept of providing e"tension to 8TT* to build eb repository, thus reducing the utili1ation of band idth and increasing the coverage of eb. 5+ &)T OD0CT&O) The 0orld 0ide 0eb, abbreviated as 000 and commonly !no n as the 0eb, is a system of interlin!ed hyperte"t documents accessed via the Internet. ) eb search engine is designed to search for information on the 0orld 0ide 0eb. 4nli!e 0eb directories, hich are maintained by human editors, search engines operate algorithmically or are a mi"ture of algorithmic and human input. ) 0eb cra ler is a computer program that bro ses the 0orld 0ide 0eb in a methodical, automated manner or in an orderly fashion. This process is called 0eb cra ling or spidering. 2earch engines use spidering as a means of building eb repository. The usefulness of a search engine depends on the relevance of the result set it gives bac!. In other ords, the performance of search engine depends on the contents of its repository. Thus it becomes most important to e"pand the repository and to !eep it updated. 8o ever surveys have found that even the best search engines fail to reach the Einvisible ebF of bac!end databases. >+ -$3 $POS&TO 4 $K0& $M$)TS ) eb repository stores and manages a large collection of eb pages. It is conceptually not that different from other systems that store data ob+ects, such as file systems, database management systems, or information retrieval systems. 8o ever, a eb repository does not need to provide a lot of the functionality that the other systems provide, such as transactions, or a general directory naming structure. Thus, the eb repository can be optimi1ed to provide +ust the essential services, and to provide them in a scalable and very efficient ay. In particular, a eb repository needs to be tuned or targeted to provide> Scalability! ,iven the si1e and the gro th of the eb, it is paramount that the repository scale to very large numbers of ob+ects. The ability to seamlessly distribute the repository across a cluster of computers and dis!s is essential. Streams! 0hile the repository needs to provide access to individual stored eb pages, the most demanding access ill be in bul!, to large collections of pages, for inde"ing or data
1A<

mining. Thus the repository must support stream access, here for instance the entire collection is scanned and fed to a client for analysis. Eventually, the repository may need to support ordered streams, here pages can be returned at high speed in some order. (9or instance, a data mining application may ish to e"amine pages by increasing modified date, or in decreasing page ran!.) ?arge #pdates! The eb changes rapidly. Therefore, the repository needs to handle a high rate of modifications. )s ne versions of eb pages arrive, the space occupied by old versions must be reclaimed (unless a history is maintained, hich e do not consider here). This means that there ill be substantially more space compaction or reorgani1ation than in most file or data systems. The repository must have a good strategy to avoid e"cessive conflicts bet een the update process and the applications accessing pages. $Hp#nging Pages! In most file or data systems, ob+ects are e"plicitly deleted hen no longer needed. 8o ever, hen a eb page is removed from a eb site, the repository is not notified. Thus, the repository must have a mechanism for detecting obsolete pages and removing them. This is a!in to Mgarbage collectionM e"cept that it is not based on reference counting. B+ O?$ O, -$3 C A-?$ &) 30&?D&)% -$3 $POS&TO 4 ) 0eb cra ler is a computer program that bro ses the 0orld 0ide 0eb in a methodical, automated manner or in an orderly fashion. This process is called 0eb cra ling or spidering. $any sites, in particular search engines, use spidering as a means of providing up(to(date data. 0eb cra lers are mainly used to create a copy of all the visited pages for later processing by a search engine that ill inde" the do nloaded pages to provide fast searches. ) 0eb cra ler is one type of bot, or soft are agent. In general, it starts ith a list of 4%;s to visit, called the seeds. )s the cra ler visits these 4%;s, it identifies all the hyperlin!s in the page and adds them to the list of 4%;s to visit, called the cra l frontier. 4%;s from the frontier are recursively visited according to a set of policies. B+5 Problems with crawling There are important characteristics of the 0eb that ma!e cra ling very difficult> its large volume, its fast rate of change, and dynamic page generation. The large volume implies that the cra ler can only do nload a fraction of the 0eb pages ithin a given time, so it needs to prioriti1e its do nloads. The high rate of change implies that by the time the cra ler is do nloading the last pages from a site, it is very li!ely that ne pages have been added to the site, or that pages have already been updated or even deleted. The number of possible cra lable 4%;s being generated by server(side soft are has also made it difficult for eb cra lers to avoid retrieving duplicate content. Endless combinations of 8TT* ,ET (4%;(based) parameters e"ist, of hich only a small selection ill actually return unique content. 9or e"ample, a simple online photo gallery may offer three options to users, as specified through 8TT* ,ET parameters in the 4%;. If there e"ist four ays to sort images, three choices of thumbnail si1e, t o file formats, and an option to disable user( provided content, then the same set of content can be accessed ith @A different 4%;s, all of
1A@

hich may be lin!ed on the site. This mathematical combination creates a problem for cra lers, as they must sort through endless combinations of relatively minor scripted changes in order to retrieve unique content. ,iven that the band idth for conducting cra ls is neither infinite nor free, it is becoming essential to cra l the 0eb in not only a scalable, but efficient ay, if some reasonable measure of quality or freshness is to be maintained. ) cra ler must carefully choose at each step hich pages to visit ne"t. B+> 3ehavior of a -eb crawler The behavior of a 0eb cra ler is the outcome of a combination of policies> a selection policy that states hich pages to do nload, a re(visit policy that states hen to chec! for changes to the pages, a politeness policy that states ho to avoid overloading 0eb sites, and a paralleli1ation policy that states ho to coordinate distributed 0eb cra lers. B+B Crawling the Deep -eb ) vast amount of 0eb pages lie in the deep or invisible 0eb. These pages are typically only accessible by submitting queries to a database, and regular cra lers are unable to find these pages if there are no lin!s that point to them. ,oogleLs 2itemap *rotocol and mod oai are intended to allo discovery of these deep(0eb resources. /eep 0eb cra ling also multiplies the number of 0eb lin!s to be cra led. 2ome cra lers only ta!e some of the ^a hrefPM4%;M(shaped 4%;s. In some cases, such as the ,ooglebot, 0eb cra ling is done on all te"t contained inside the hyperte"t content, tags, or te"t. D+ P OPOS$D D$S&%) ST AT$%4 'ra ler problems can be handled if cra lers and search engines use a more appropriate protocol that helps to identify efficiently that hat can and should be copied. This can be achieved by using a protocol solution bet een search engines and eb servers distributed throughout the eb rather than using a protocol bet een eb cra lers and search engines. The goal can be accomplished using 8TT* e"tension frame or!. D+5 "TTP $Htension ,ramewor*s 8TT* E"tension 9rame or! describes a generic e"tension mechanism for 8TT*, hich is designed to address the tension bet een private agreement and public specification and to accommodate e"tension of applications using 8TT* clients, servers, and pro"ies. These 8TT* e"tensions are not coordinated, since there has been no standard frame or! for defining e"tensions and thus, separation of concerns. )s a result e"tensions are often applied in an ad hoc manner hich does not promote reusability nor interoperability. The 8TT* E"tension 9rame or! is a simple yet po erful mechanism for e"tending 8TT* by describing which e"tensions are introduced along ith information about who the recipient is, and how the recipient should deal ith them. C+ CO)C?0S&O)

1AD

.y using a protocol solution to build the eb repository, the coverage of eb can be increased and the freshness of eb repository can be maintained. This solution also reduces the e"tra utili1ation of the net or! band idth by eb cra lers. $,$ $)C$S 1. $ichael 5..ergman, E The deep eb> surfacing hidden valueF, The +ournal of electronic publishing, the university of $ishighan press, 2??? 2. 2teve ;a rence, E)ccesssing information on ebF <. 8enry Tirri, E'hallenges for internet searchF, IEEE 'onference, -anuary 2??<

1AC

A)A?4S&S O, 3?AC( "O?$ ATTAC( &) MO3&?$ AD7"OC )$T-O (S Preeti (amra Assistant Professor/ D+A+@ College/ Amritsar preeti*amraC1gmail+com A3ST ACT This research paper is based on introduction to $)6ET2, ho communication ta!es place in it, various !inds of routing protocols, the various !inds of attac!s on it and is the various fla s in $)6ET2 hich leads to such attac!s. It also gives a brief overvie about the the blac! hole attac! on $)6ET2 and various !ind of routing protocols hich get affected by the .lac! 8ole attac! along ith an overvie about the countermeasures to avoid it. ($4-O DS! $)6ET, .lac! 8ole, %outing *rotocols 5+ &)T OD0CT&O) TO P O3?$M 0ireless net or!s are gaining popularity to its pea! today, as the users ant ireless connectivity irrespective of their geographic position. There is an increasing threat of attac!s on the $obile )d(hoc 6et or!s ($)6ET). .lac! hole attac! is one of the security threat in hich the traffic is redirected to such a node that actually does not e"ist in the net or!. ItGs an analogy to the blac! hole in the universe in hich things disappear. The node presents itself in such a ay to the node that it can attac! other nodes and net or!s !no ing that it has the shortest path. $)6ETs must have a secure ay for transmission and communication hich is quite challenging and vital issue. In order to provide secure communication and transmission, researcher or!ed specifically on the security issues in $)6ETs, and many secure routing protocols and security measures ithin the net or!s ere proposed. *reviously the or!s done on security issues in $)6ET ere based on reactive routing protocol li!e )d(8oc on /emand /istance 7ector ()#/7). /ifferent !inds of attac!s ere studied, and their effects ere elaborated by stating ho these attac!s disrupt the performance of $)6ET. The scope of this seminar is to study the effects of .lac! hole attac! in $)6ET using both *roactive routing protocol i.e. #ptimi1ed ;in! 2tate %outing (#;2%) and %eactive routing protocol )d(8oc on /emand /istance 7ector ()#/7). 'omparative analysis of .lac! 8ole attac! for both protocols is ta!en into account. The impact of .lac! 8ole attac! on the performance of $)6ET is evaluated finding out hich protocol is more vulnerable to the attac! and ho much is the impact of the attac! on both protocols. The measurements ere ta!en in the light of throughput, end(to(end delay and net or! load. 2imulation is done in #ptimi1ed 6et or! Engineering Tool (#*6ET). 5+5 3rief Description In a ireless mobile ad hoc net or! ($)6ET), there are no basic net or! devices, such as routers or access pointsN data transfer among nodes is reali1ed by means of multiple hops, and rather than +ust serving as a single terminal, every mobile node acts as a router to establish a
1AB

route. 6odes are the systems or devices i.e. mobile phone, laptop, personal digital assistance, $*< player and personal computer that are participating in the net or! and are mobile. 0hen a source node intends to transfer data to a destination node, pac!ets are transferred through the intermediate nodes, thus, searching for and quic!ly establishing a route from a source to a destination node is an important issue for $)6ETs. 0ireless lin!s also ma!es the $)6ETs more susceptible to attac!s, hich ma!e it easier for the attac!er to go inside the net or! and get access to the ongoing communication J=, 21K. $obile nodes present ithin the range of ireless lin! can overhear and even participate in the net or!. 8o ever this lead to security issues because of its features li!e open medium, changing its topology dynamically, lac! of central monitoring and management, cooperative algorithms and no clear defence mechanism. This paper studies different types of routing protocols, attac!s and their effects on the $)6ETs. 0ormhole attac!, .lac! hole attac!, 2ybil attac!, flooding attac!, routing table overflo attac!, /enial of 2ervice (/o2), selfish node misbehaving, impersonation attac! are !ind of attac!s that a $)6ET can suffer from. )lso it simulates the blac! hole attac! using *roactive and reactive routing protocols and hich of them is more vulnerable to the blac! hole attac!. It also highlights the countermeasures. 5+> Comm#nication in MA)$T 0hen a node ants to communicate ith another node, the destination node must lies ithin the radio range of the source node that ants to initiate the communication. The intermediate nodes ithin the net or! aids in routing the pac!ets for the source node to the destination node. 6odes are autonomous and play the role of router and host at the same time. $)6ETs or!s on T'*&I* structure to provide the means of communication bet een communicating or! stations. 0or! stations are mobile and they have limited resources, therefore the traditional T'*&I* model needs to be refurbished or modified, in order to compensate the $)6ETs mobility to provide efficient functionality. 5+B Classification of MA)$Ts o#ting Protocols %outing protocols in $)6ETs are classified into three different categories according to their functionality 1. %eactive protocols 2. *roactive protocols <. 8ybrid protocols The hierarchy of these protocols is sho n bello in the figure

1AA

,ig 5+5! Classification of protocols 58 eactive Protocols! %eactive protocols also !no n as on demand driven reactive protocols. The fact they are !no n as reactive protocols is, they do not initiate route discovery by themselves, until they are requested, hen a source node request to find a route.J<, @K. Ad7"oc On Demand Distance @ector Protocol 6AOD@8! )#/7 is described in %9' <DC1 JDK. ItGs reactive protocol, hen a node ishes to start transmission ith another node in the net or! to hich it has no routeN )#/7 ill provide topology information for the node. )#/7 use control messages to find a route to the destination node in the net or! >8 Proactive Protocols! *roactive routing protocols or! as the other ay around as compared to reactive routing protocols. These protocols constantly maintain the updated topology of the net or!. Every node in the net or! !no s about the other node in advance. )ll the routing information is usually !ept in tables. 0henever there is a change in the net or! topology, these tables are updated according to the change. The nodes e"change topology information ith each otherN they can have route information any time hen they needed JCK. Optimi'ed ?in* State o#ting Protocol 6O?S 8! The #ptimi1ed ;in! 2tate %outing (#;2%) protocol is described in %9'<C2C JBK. The #ptimi1ed ;in! 2tate %outing (#;2%) protocol is proactive routing protocol that is also !no n as table driven protocol by the fact that it updates its routing tables. B8 "ybrid Protocols! 8ybrid protocols e"ploit the strengths of both reactive and proactive protocols, and combine them together to get better results. The net or! is divided into 1ones, and use different protocols in t o different 1ones i.e. one protocol is used ithin 1one, and the other protocol is used bet een them. Tone %outing *rotocol (T%*) is the e"ample of 8ybrid %outing *rotocol. 5+D Sec#rity &ss#es &n Manet

1A=

2ecurity in $obile )d(8oc 6et or! ($)6ET) is the most important concern for the basic functionality of net or!. )vailability of net or! services, confidentiality and integrity of the data can be achieved by assuring that security issues have been met. $)6ET often suffer from security attac!s because of its features li!e open medium, changing its topology dynamically, lac! of central monitoring and management, cooperative algorithms and no clear defense mechanism. These factors have changed the battle field situation for the $)6ET against the security threats. In the last fe years, security of computer net or!s has been of serious concern hich has idely been discussed and formuli1ed. $ost of the discussions involved only static and net or!ing based on ired systems. 8o ever, mobile )d(8oc net or!ing is still in need of further discussions and development in terms of security J21K. 0ith the emergence of ongoing and ne approaches for net or!ing, ne problems and issues arises for the basics of routing. 0ith the comparison of ired net or! $obile )d(8oc net or! is different. The routing protocols designed ma+orly for internet is different from the mobile )d(8oc net or!s ($)6ET). Traditional routing table as basically made for the hosts hich are connected ired to a non dynamic bac!bone J22K. /ue to hich it is not possible to support )d(8oc net or!s mainly due to the movement and dynamic topology of net or!s. /ue to various factors including lac! of infrastructure, absence of already established trust relationship in bet een the different nodes and dynamic topology, the routing protocols are vulnerable to various attac!s J2<K. $a+or vulnerabilities hich have been so far researched are mostly these types hich include selfishness, dynamic nature, and severe resource restriction and also open net or! medium. /espite of the above said protocols in $)6ET, there are attac!s hich can be categori1ed in *assive, )ctive, Internal, E"ternal and net or!(layer attac!s, %outing attac!s and *ac!et for arding attac!s. $)6ET or! ithout a centrali1ed administration here node communicates ith each other on the base of mutual trust. This characteristic ma!es $)6ET more vulnerable to be e"ploited by an attac!er from inside the net or!. 0ireless lin!s also ma!es the $)6ET more susceptible to attac!s hich ma!e it easier for the attac!er to go inside the net or! and get access to the ongoing communication J=, 21K. 5+C The vario#s ,laws in MA)$TS which lead to different types of attac*s are!7 )on Sec#re 3o#ndaries! $)6ET is vulnerable to different !ind of attac!s due to no clear secure boundary. The nature of $)6ET, nodes have the freedom to +oin and leave inside the net or!. 2poofing of nodeGs identity, data tempering, confidential information lea!age and impersonating node are the results of such attac!s hen security is compromised J1?K. Compromised )ode! $obile nodes in $)6ET are free to move, +oin or leave the net or!. )d(hoc net or! mobility ma!es it easier for a compromised node to change its position so frequently ma!ing it more difficult and troublesome to trac! the malicious activity.

1=?

)o Central Management! $)6ET is a self(configurable net or!, hich consists of $obile nodes here the communication among these mobile nodes is done ithout a central control. Each and every node act as router and can for ard and receive pac!ets J12K. /etecting attac!s and monitoring the traffic in highly dynamic and for large scale )d(8oc net or! is very difficult due to no central management. Problem of Scalability The nodes are free to move in and out of the )d(8oc net or! hich ma!es the )d(8oc net or! very much scalable and shrin!able. 5eeping this property of the $)6ET, the protocols and all the services that a $)6ET provides must be adaptable to such changes. >+ 3?AC( "O?$ ATTAC( &) MA)$T In blac! hole attac!, a malicious node uses its routing protocol in order to advertise itself for having the shortest path to the destination node or to the pac!et it ants to intercept. This hostile node advertises its availability of fresh routes irrespective of chec!ing its routing table. In this ay attac!er node ill al ays have the availability in replying to the route request and thus intercept the data pac!et and retain it 0hen this route is establish, no itGs up to the node hether to drop all the pac!ets or for ard it to the un!no n addressJ22K.The method ho malicious node fits in the data routes varies. 9ig. @.1 sho s ho blac! hole problem arises, here node E)F ant to send data pac!ets to node E/F and initiate the route discovery process. 2o if node E'F is a malicious node then it ill claim that it has active route to the specified destination as soon as it receives %%E: pac!ets. It ill then send the response to node E)F before any other node. In this ay node E)F ill thin! that this is the active route and thus active route discovery is complete. 6ode E)F ill ignore all other replies and ill start seeding data pac!ets to node E'F. In this ay all the data pac!et ill be lost consumed or lost.

,ig >! 3lac* "ole problem 3lac* hole attac* in Ad7"oc on Demand Distance @ector 6AOD@8+ T o types of blac! hole attac! can be described in )#/7 in order to distinguish the !ind of blac! hole attac!. &nternal 3lac* hole attac* This type of blac! hole attac! has an internal malicious node hich fits in bet een the routes of given source and destination. )s soon as it gets the chance this malicious node ma!e itself an active data route element. )t this stage it is no capable of conducting attac! ith the start of data transmission. This is an internal attac! because node itself belongs to the data route
1=1

$Hternal 3lac* hole attac* E"ternal attac!s physically stay outside of the net or! and deny access to net or! traffic or creating congestion in net or! or by disrupting the entire net or!. E"ternal attac! can become a !ind of internal attac! hen it ta!e control of internal malicious node and control it to attac! other nodes in $)6ET. 3lac* hole attac* in Optimi'ed ?in* State o#ting Protocol 6 O?S 8 In #;2% blac! hole attac!, a malicious node !eeps its illingness field to ill al ays in its 8E;;# message. 2o in this case, neighbors of malicious node ill al ays select it as $ultiple *oint %elay. 8ence the malicious node earns a privileged position in the net or! hich it e"ploits to carry out the denial of service attac!. The effect of this attac! is much vulnerable hen more than one malicious node is present near the sender and destination nodes. B+ CO0)T$ M$AS0 $S In preventive mechanism, authentications, access controls, and encryption techniques are involved. 0hile in %eactive mechanism, different schemes li!e intrusion detection systems (I/2) and cooperation mechanisms are used. In case of $)6ET intrusion is used for detection of misuse. D+ M&T&%AT&O) T$C")&K0$S A%A&)ST 3?AC( "O?$ ATTAC( The net or! layer is far more vulnerable for attac!s than any layer in $)6ET. 6umerous security threats are imposed on this layer. #ne ay is to use secure routing protocol. )ttac! hich modifies routing messages can be provo!ed by the use of source authentication. /igital signature, message authentication code ($)'), hashed $)' (8$)') can be used. 4p to certain level of security can be attained at net or! layer in internet by the use of I*2ec. )uthenticated %outing for )d(8oc 6et or!s ()%)6) is another routing protocol hich provides the protection from .lac! 8ole attac! here there is threat to the changes in sequence number, hop count modification, source routing changes and spoofing of destination addresses. D+5 Mitigation Sol#tion by Deng The proposed solution by /eng gives the approach of disabling the reply message by the intermediate. This method avoid intermediate node to reply hich avoid in certain case the .lac! 8ole and implements the secure protocol. This increase the routing delay in large net or!s and a malicious node can ta!e advantage by replying message instead of destination node. 2o for this one or more routes are used by the intermediate nodes hich replay the %%E: messages to confirm the routes from intermediate nodes and destination nodes for sending out the data pac!ets. In case if it does not e"ist, the reply messages is discarded from intermediate node and alarm messages are sent to the net or!. This method avoids the .lac! 8ole problem thus preventing the net or! from malicious node. The message reply from the intermediate is not disabled hich increase the routing overhead. D+> Mitigation by Confirmation eA#est Message It has been proposed route confirmation request message ('%E:) and route confirmation reply ('%E*) in order to avoid .lac! 8ole attac!. In this proposal hen intermediate nodes sends %equests to the source node its send '%E: to its ne"t hop node in direction of
1=2

destination node. )fter receiving '%E:, the ne"t hop loo! for route in its destination in cache. If its receive '%E* during this time it ill confirm the validity of path in %oute reply and in '%E*. 4pon matching the source node ill recogni1e the route being correct. Its dra bac! is that it cannot detect multiple .lac! 8ole attac!s. D+B Mitigation by SAOD@ protocol The 2ecure )d(8oc #n(/emand /istance 7ector %outing (2)#/7) hich verify the destination node by e"changing random numbers. 2)#/7 can effectively prevent .lac! 8ole attac! in $obile )d(hoc net or! and maintain better routing efficiency. It is better than )#/7 in terms of security and routing efficiency. D+D Mitigation by chec*ing m#ltiple $P The solution focus on the requirement of a source node to ait unless the arrival of %%E* pac!et from more than t o nodes. 0hen it receives multiple %%E*s the source node chec! that there is any share hops or not. The source node ill consider the routed safe if it finds the share hops. Its dra bac! is the introduction of time delay it has to ait for the arrival of multiple %%E*s before it +udges the authentication of node. CO)C?0S&O) $obile )d(8oc 6et or!s has the ability to deploy a net or! here a traditional net or! infrastructure environment cannot possibly be deployed. 0ith the importance of $)6ET comparative to its vast potential it has still many challenges left in order to overcome. 2ecurity of $)6ET is one of the important features for its deployment. The research paper analyses the vulnerability of t o protocols #;2% and )#/7 have more severe effect hen there is higher number of nodes and more route requests. *ercentage of severances in delay under attac! is 2 to D percent and in case of #;2%, here as it is D to 1? percent for )#/7. The throughput of )#/7 is effected by t ice as compare of #;2%. In case of net or! load ho ever, there is effect on )#/7 by the malicious node is less as compare to #;2%. .ased on the research and analysis of simulation result by the author the conclusion is that )#/7 is more vulnerable to .lac! 8ole attac! than #;2% ,0T0 $ -O ( 0ireless )d(8oc net or!s are idely used net or!s due to their fle"ible nature i.e. easy to deploy regardless of geographic constraints. These net or!s are e"posed to both e"ternal and internal attac!s as there is not centrali1ed security mechanism. ) lot of research or! is still need in this area. 0e tried to discover and analy1e the impact of .lac! 8ole attac! in $)6ETs using )#/7 and #;2% protocols. There is a need to analy1e .lac! 8ole attac! in other $)6ETs routing protocols such as /2%, T#%) and ,%*. .lac! 8ole attac! can also attac! the other ay around i.e. as 2leep /eprivation attac!. The detection of this behavior of .lac! 8ole attac! as ell as the elimination strategy for such behavior has to be carried out for further research. $,$ $)C$S 1. -. 0. 'res ell, %esearch /esign> :ualitative, :uantitative and $i"ed $ethods )pproach, 2nd Ed, 2age *ublications Inc, 'alifornia, -uly 2??2.

1=<

2.

5. 2an1giri, .. /ahill, ..6. ;evine, '. 2hields, E.$. .elding %oyer, E2ecure routing protocol for )d(8oc net or!s,F In *roc. of 1?th IEEE International 'onference on 6et or! *rotocols, /ept. of 'omput. 2ci., 'alifornia 4niv., 2anta .arbara, '), 42). *p.BA( AB, I226> 1?=2(1C@A, 12(1D 6ov. 2??2. <. '.E.*er!ins and E.$.%oyer, E)d(8oc #n /emand /istance 7ector %outing,F *roceedings of the 2nd IEEE 0or!shop on $obile 'omputing 2ystems and )pplictions, pp.=?(1??, 9eb, 1===. @. '.$ barushimana, ).2hahrabi, E'omparative 2tudy of %eactive and *roactive %outing *rotocols *erformance in $obile )d(8oc 6et or!s,F 0or!shop on )dvance Information 6et or!ing and )pplication, 7ol. 2, pp. CB=(CA@, $ay, 2??<. D. http>&& .faqs.org&rfcs&rfc<DC1.html C. $.)bolhasan, T.0ysoc!i, E./ut!ie ic1, E ) %evie of %outing *rotocols for $obile )d(8oc 6et or!s,F Telecommunication and Infromation %esearch Institute 4niversity of 0ollongong, )ustralia, -une, 2??<. B. http>&& .faqs.org&rfcs&rfc<C2C.html A. http>&& .netmeister.org&misc&1rp&1rp.htmlW2E'TI#6???@1???????????????, last visited 12 )pr, 2?1?. =. *.7.-ani, E2ecurity ithin )d(8oc 6et or!s,F *osition *aper, *)$*)2 0or!shop, 2ept. 1C&1B 2??2. 1?. $.*arsons and *.Ebinger, E*erformance Evaluation of the Impact of )ttac!s on mobile )d(8oc net or!sF 11. /...%oy, %.'ha!i and 6.'ha!i, E) 6e 'luster(.ased 0ormhole Intrusion /etection )lgorithm for $obile )d(8oc 6e or!s,F International -ournal of 6et or! 2ecurity and Its )pplication (I-62)), 7ol. 1, 6o.1, )pril, 2??=. 12. 6.2hanti, ;ganesan and 5.%amar, E2tudy of /ifferent )ttac!s #n $ulticast $obile )d(8oc 6et or!F. 1<. '.0ei, ;.Viang, ..yuebin and ,.Viaopeng, E) 6e 2olution for %esisting ,ray 8ole )ttac! in $obile )d(8oc 6et or!s,F 2econd International 'onference on 'ommunications and 6et or!ing in china, pp.<CC(<B?, )ug, 2??B. 1@. 2.$arti, T.-.,iuli, 5.;ai, $..a!er, E$itigating %outing $isbehavior in $obile )d( 8oc 6et or!sF. 1D. Thu, '. ;ee, $.-.2aada i, T., E%TT(.ased #ptimal 0aiting time for .est %oute 2election in )d(8oc %outing *rotocols,F IEEE $ilitary 'ommunications 'onference, 7ol. 2, pp. 1?D@(1?D=, #ct, 2??<. 1C. $.T.%efaei, 7.2rivastava, ;./asilva, $.Elto eissy, E) %eputation(.ased $echanism for Isolating 2elfish nodes in )d(8oc 6et or!s,F 2econd )nnual International 'onference on $obile and 4biquitous 2ystems, 6et or!ing and 2ervices, pp.<(11, -uly, 2??D. 1B. 7.$aha+an, $.6atue and ).2ethi, E)nalysis of 0ormhole Intrusion attac!s in $)6ETs,F IEEE $ilitary 'ommunications 'onference, pp. 1(B, 6ov, 2??A. 1A. 9.2tan+ano, %.)nderson, EThe %esurrecting /uc!ling> 2ecurity Issues for 4biquitous 'omputing,F 7ol. <D, pp. 22(2C, )pr, 2??2.

1=@

1=. 8.;.6guyen,4.T.6guyen, E2tudy of /ifferent Types of )ttac!s on $ulticast in $obile )d(8oc 6et or!s,F International 'onference on 6et or!ing, 2ystems, $obile 'ommunications and ;earning Technologies, )pr,2??C. 2?. 8./eng, 0.;i and /.*.)gra al, E%outing 2ecurity in 0ireless )d(8oc 6et or!s,F 4niversity of 'incinnati, IEEE 'ommunication $ag1ine, #ct, 2??2. 21. 5. .is as and $d. ;iaqat )li, E2ecurity threats in $obile )d(8oc 6et or!F, $aster Thesis, .le!inge Institute of TechnologyF 2 eden, 22nd $arch 2??B 22. ,. ). *egueno and -. %. %ivera, EE"tension to $)' A?2.11 for performance Improvement in $)6ETF, 5arlstads 4niversity, 2 eden, /ecember 2??C 2<. 2. ;u, ;. ;i, 5.H. ;am, ;. -ia, E2)#/7> ) $)6ET %outing *rotocol that can 0ithstand .lac! 8ole )ttac!.,F International 'onference on 'omputational Intelligence and 2ecurity, 2??=. 2@. #pnet Technologies, Inc. E#pnet 2imulator,F Internet> .opnet.com, date last vie ed> 2?1?(?D(?D 2D. 2. 5urosa a et al., E/etecting .lac!hole )ttac! on )#/7(.ased $obile )d(8oc 6et or!s by /ynamicF 2C. $. )l(2hurman, 2($. Hoo, and 2. *ar!, E.lac! 8ole )ttac! in $obile )d(8oc 6et or!s,F )'$ 2outheast %egional 'onf. 2??@.

1=D

ST$%A)O% AP"4 A)D &MA%$ A0T"$)T&CAT&O) T$C")&K0$ Sapna (#mari Assistant Professor/ 33(DA@ College for women/ Amritsar+ g#ptasana1rediffmail+com A3ST ACT 2teganography is the technique of hiding confidential information ithin any media. This is often confused ith cryptography because the t o are similar in the ay that they both are used to protect confidential information. The difference bet een the t o is in the appearance in the processed output. This paper e"plores the various techniques used to authenticate the visual data recorded by the automatic video surveillance (72) system. )utomatic video surveillance systems are used for continuous and effective monitoring and reliable control of remote and dangerous sites. .y data authentication e mean here a procedure capable of ensuring that data have not been tampered ith and of indicating their true origin. ($4-O DS! steganography, cryptography, atermar!, authentication &)T OD0CT&O) The ob+ective of steganography is to hide a secret message ithin a cover(media in such a ay that others cannot discern the presence of the hidden message. $odern steganography uses the opportunity of hiding information into digital multimedia files and also at the net or! pac!et level. ) substitution based information protection method here e combine cryptographic, steganographic and signal processing concepts together for achieving security 3 this method is !no n as Steganography 3ased &nformation Protection method+ In this method e substitute the information bit in randomly selected pi"els at random places ithin ;2. region. 2teganography in images has truly come of age ith the invention of fast, po erful computers. 2oft are is readily available off the Internet for any user to hide data inside images. The various techniques used to authenticate the visual data recorded by the automatic video surveillance system. )utomatic video surveillance systems are used for continuous and effective monitoring and reliable control of remote and dangerous sites. 7isual data can be modified using sophisticated processing tools ithout leaving any visible trace of the modification. 2o digital or image data have no value as legal proof. Therefore the true origin of the data must be indicated to use them as legal proof. .y data authentication e mean here a procedure capable of ensuring that data have not been tampered end ith and of indicating their true origin. A0T"$)T&CAT&O) T$C")&K0$S )uthentication techniques are performed on visual data to indicate that the data is not a forgeryN they should not damage visual quality of the video data. )t the same time, these techniques must indicate the malicious modifications include removal or insertion of certain frames, change of faces of individual, time and bac!ground etc. #nly a properly
1=C

authenticated video data has got the value as legal proof. There are t o ma+or techniques for authenticating video data. They are as follo s> 1) 'ryptographic /ata )uthentication 2) 0atermar!ing( based authentication 1. Cryptographic Data A#thentication! It is a straight for ard ay to provide video authentication, namely...through the +oint use of asymmetric !ey encryption and the digital 8ash function. 'ameras calculate a digital 2ummary (digest) of the video by means of hash function. Then they encrypt the digest ith their private !ey, thus obtaining a signed digest hich is transmitted to the central unit together ith acquired sequences. This digest is used to prove data integrity or to trace bac! to their origin. 2igned digest can only read by using public !ey of the camera. To authenticate visual data each video camera is assigned a different public or private !ey pair, ith private !ey hard ired ithin the cameras. ) document encrypted ith the private !ey of any particular camera can be decrypted ith its o n public !ey. This property is used to provide centre authentication that is to trace bac! to the true origin of the data. .efore sending the video sequence to the central unit, cameras calculate a digital summary or digest of the video by means of a proper hash function. The digest is then encrypted ith their private !ey. Encryption is done by considering the digiti1ed value of the brightness of each pi"el. /igital signal is a sequence of 1eros and ones and it is encrypted ith the private !ey using a proper algorithm. The signed digest thus obtained is then transmitted to the central unit together ith the acquired visual sequence. ;ater the signal digest is used to prove data integrity or to trace bac! to their origin. The signed digest is read using the public !ey of the camera hich produce the video and chec! if it corresponds to the digest derived from the decrypted video content using the same hash function. )ny manipulation of the data ill change the calculated image digest derived from the decrypted data. )ny discrepancy bet een the decrypted digest and calculated image digest indicate that the data has been tampered, ith identical digest indicates that the data is genuine. 7alue of the visual data can be added by tying each frame to the particular label of the instant the frame has been produced yet. This can be achieved by printing date and time of creation of each frame. )ny modification of either the date or time could be easily revealed since it ould change the locally calculated image digest. >+

-atermar*ing7 based a#thentication!

1=B

0atermar!ing data authentication is the modern approach to authenticate visual data by imperceptibly embedding a digital atermar! signal on the data. ) digital atermar! is a signal that is imperceptibly embedded ithin digital data. This signal can be detected or e"tracted by means of computations to ma!e some assertions about the host data. /igital atermar! is a signal hich added to a document to authenticate it and to prove the o nership. ) commonly encountered digital ,ig 5 atermar! is the logo most television channels display on the top of the television screen. 6ot only does it advertise the channel but also provides the legal benefit of having a source signature persist /uring video recording. 0atermar! tas! consists of t o main steps> i) 0atermar! casting>( in hich the signal represented by the atermar! is transmitted over the channel, that is in atermar! casting an encoder function | ta!es a host image SfG and a atermar! S G and generate a ne image 9 P | (f, ) ii) 0atermar! detection>(in hich the signal is received and e"tracted from possibly corrupted image. C?ASS&,&CAT&O) O, -AT$ MA (&)% A0T"$)T&CAT&O) SC"$MAS The characteristics of atermar!ing system largely depend on its application scenario. 9or instant copy rite protection application require that the atermar! is robust against most common data manipulation, i.e. its presents can still be detected after non(destructive transformation of host document. T o approaches for atermar!ing data authentication are possible> 1. 9ragile atermar!ing 2. %obust atermar!ing 9ragile atermar!ing refers to the case here atermar! inserted ithin the data is lost or altered as soon as host data undergoes any modification. 0atermar! loss or alternation is ta!en as evidence that data has been tampered ith, hereas the information contained ithin data used to demonstrate data origin. In case of robust atermar!ing a summary of the candidate frame or video sequence is computed and is inserted ithin the video sequence. Information about the data origin is also ith the summary. To prove data integrity the information conveyed by the atermar! is recovered and compared ith the actual content of the sequence. Their mismatch is ta!en as 0)TE%$)%5I6, an evidence of data tampering. The capability to 0)TE%$)%5I6, locali1e the manipulation ill depend on the 2ummary of hich is embedded in to the image.
%#.42T 0)TE%$)%5I6,

9%),I;E 0)TE%$)%5I6,

7I2I.;E 0)TE%$)%5I6,

1=A
I67I2I.;E 0)TE%$)%5I6,

/4); 0)TE%$)%5I6,

,ig > $K0& $M$)TS O, -AT$ MA (&)% 3AS$D @S DATA A0T"$)T&CAT&O) In order to highlight the peculiarities of 72 data authentication. ;et us consider the most common requirements for atermar!ing authentication techniques. 1. The authentication technique must not deteriorate the visual quality of data quality. 2. The authentication technique should be able to identify any unauthori1ed processing acquired to visual data. <. The authentication technique should not consider innocuous manipulation, e.g., image compression and 1ooming, as valid authentication attac!s. @. It should be difficult for unauthori1ed person to forge an authenticated image. D. The authentication chec!ing procedure should be easily performed by authori1ed persons. C. The authentication chec!ing procedure should locali1e data tampering. ) atermar!ing algorithm for 72 data authentication based on semi(fragile atermar!ing of each frame of the video sequence. The atermar! !ey used for atermar!ing a specific frame in the sequence is composed of the camera id and frame number. ,enerating the atermar! !ey using frame number provides the advantage of producing frameR dependent atermar!s. In this case, frame removal or frame substitution can be easily detected as non authentic. To perform authenticity chec!, the detection should first !no the frame number in the sequence hich is al ays 1ero. 0atermar! embedding is performed by altering all the pi"els of the original frame according to the follo ing formula. 9 (") P f(") if (") P ? g1 (f("), n(")) if (") P(1 g2 (f("), n(") if (") P1 0here g1g2 are suitably designed function based on ". n(") denotes a function that depends on neighborhood of ". In the atermar! detection procedure, the detector generates first the ater mar! for each frame to be chec!ed. To do so, the id number of camera that produce the sequence and the frame number are needed. )uthentication chec! is a t o level process. ) first level decision on image authenticity is ta!en by comparing the atermar! detection of the te"t image ith a
1==

pre specified threshold T. If the first level decision test indicates that the image is someho altered but authentic, a second level decision test should be performed. This test indicates hether the alternations made on the image are concentrated in certain regions or one spread on the image. CO)C?0S&O) In these modern eras, visual surveillance system finds application in almost all fields, ranging from commercial to defense. The video data acquired by 72 system are forming vital evidence for several legal situations. 2o for such situations, the importance of authenticating their content is very high. 'ryptography and atermar!ing based authenticating techniques are quite safe and efficient for this purpose and they are li!ely to remain for quite for some hile. 3&3?&O% AP"4 1. http>&& . <.org&T%&1==A&%E' ("ml (1==A?21? 2. http>&&online.red oods.cc.ca.us&instruct <. http>&& .sans.org&reading(room @. http>&& .particle.!th.se&hlindsey&8ard are660'ourse D. http>&& C.bcity.com&m+futures& C. http>&& .++tc.com&pub

2??

&MPACT O, &CT O) T$C"&)% & ?$A )&)% Mahesh Sharma Pathan*ot 3#siness College/ Pathan*ot maheshsharmapt*1yahoo+com A3ST ACT 9or years, traditional classroom teaching as only viable option. Even the teaching at schools and colleges level is effective, but the ne technologies must be used to develop the ne ideas and innovations. E(;earning is the perfect complement to traditional teaching programs. The advent of e(learning is the use of net or! technologies to create, faster, deliver, and facilitate learning, anytime and any here. E(learning also supports in delivery of individuali1ed, comprehensive, dynamic learning content in real time, aiding the development of communities of !no ledge, lin!ing learners and practitioners ith e"perts. E(;earning is the ideal venue to communicate any instructional information, simulate processes, demonstrate proper tas! performance, train on custom soft are or equipment, sho ho to troubleshoot systems, or prepare the learner for classroom training. #verall *erformance appraisal of teachers using I'T is very good for both teachers and students. 0hich increase the satisfaction level of Teachers and improve the performance of students. The present paper is an effort to sho the impact that ho the ne and developing technologies can be used to improve the teaching(learning process in education and for business also. &)T OD0CT&O) ;earning through information 3 communication technology is a natural e"tension of e( learning into a ne pedagogical paradigm that supports learning in such an environment by using and combining ne technologies that satisfy the demands 3 need of learners, teachers and students. Information 3 communication technology is emerging as promising technologies for supporting learner since they started to offer net or! support of throughout the orld and connectivity to access instructional resources. In a span of last fe years, e( learning is gro ing very rapidly. ,lobally spea!ing, the !ind of penetration that has reached is astounding and no other can come any closer. 6o demography is immune from it and it has slo ly become associated ith the youth in a bigger ay. This !ind of digital communication as unthin!able almost a decade bac!. E(learning has the potential of ta!ing learning and !no ledge across geographical boundaries and generations due to the fact that it can be accessed ith ease. The mission of e(;earning is to provide the learner ith an up(to(date and cost(effective !no ledge that yields motivation 3, s!ill to the learners. The capacity of information and communications technology to support multimedia resource(based learning and teaching is also relevant to the gro ing interest in e(learning. E(learning is naturally suited to distance learning and fle"ible learning, but can also be used in con+unction ith face(to(face teaching, in hich case the term .lended learning is commonly used. ;us! in says that the MeM should be interpreted to mean e"citing, energetic, enthusiastic, emotional, e"tended, e"cellent, and educational in addition to MelectronicM that is a traditional national
2?1

interpretation. This broader interpretation allo s learning and media psychology into a ne equation .In this Eva or centuryN people have to learn more than ever before. )$$D TO ST0D4 To reduce the poverty of nation it is essential to provide good quality education to the students and the important factor of education system is teacher. It is necessary to improve the performance and satisfaction level of teachers hich naturally increases the quality of education and improves the studentGs performance. *roper performance can only be find outs ith the proper needs for improvement of teachers and level of satisfaction. Teachers using I'T maintains the accuracy in performance and reduces the comple"ities. The concept of distance education as founded on the principles of fle"ible access. It aimed to allo distance learners, ho ere generally adult learners in full or part(time employment to be able to study at a time, place, and pace that suited their convenience. The goal of distance education as to free these learners from the constraints of conventional residential educational settings. They ould not be required to live or attend lectures in locations a ay from here they may be living and or!ing. )ccess to information and communications technology changed all that as it offered a range of possibilities for capturing and delivering all types of sub+ect matter 3 content to learners and teachers in this distributed educational settings. This is becoming increasingly affordable and palatable ith a ide range of soft are applications and computer conferencing technologies for collaborative inquiry among students and asynchronous. These applications enable learners and teachers to engage in synchronous as ell as asynchronous interaction across space, time, and pace. It is no idely believed and has been proven in various countries that learning through I'T could and has been a huge factor in getting disaffected young adults to engage in learning, here traditional methods have failed. This is the ne orld and everything is changing ( the mar!et, the need, the people. E(learning is the future. ) clear aim of e(learning is to ma!e the learning process more fle"ible, accessible and personali1ed. E( ;earning is unique in that it allo s truly any here, anytime, personali1ed learning. It can also be used to enrich, enliven or add variety to conventional lessons or courses. )nalysis and survey (IEEE $ultidisciplinary Education $aga1ine) it is found that the use of mobile learning may have a positive contribution in learning as ell as in teaching. O3.$CT&@$ To reduce the need for classroom training To reduce the poverty of nation by providing good quality education to the students. To ma!e learning available anytime, any here To minimi1e the time and manpo er requirements b. To increases the accuracy and reduces the comple"ities 'lass or! can be scheduled around personal and professional or! %educes travel cost and time to and from school ;earners may have the option to select learning materials that meets their level of !no ledge and interest ;earners can study herever they have access to a computer and Internet
2?2

2elf(paced learning modules allo learners to or! at their o n pace /ifferent learning styles are addressed and facilitation of learning occurs through varied activities /evelopment of computer and Internet s!ills that is transferable to other facets of learnerLs lives 2uccessfully completes online or computer(based courses builds self(!no ledge and self(confidence and Encourages students to ta!e responsibility for their learning

M$T"ODO?O%4 9or this study researcher collects the data from primary and secondary sources. *rimary data> %esearcher conducts a feedbac! from Educational institutes&colleges, *rincipals of the institutes ho are in contact ith many teachers and %esearchers 3 a feedbac! from various 2tudents, *arents, and 2ubordinates and also collect the data from other IT persons li!e data operators, programmers and some teachers also ho are or!ed in different IT areas. )nd also collect the data from 6on IT persons li!e ban!ers, officers etc. by direct communication, and intervie s. The 1@? samples are selected by lottery method to collect primary data S$CO)DA 4 DATA 2econdary data ( This data is collected through papers, +ournals, maga1ines, and eb etc. 9indings ( .y using discrete and qualitative technique the researcher found that ,&)D&)%S )fter analy1ing data collected through various methods researcher found that. 4se of I'T in performance appraisal process can covers various factors of data hich are not covered by traditional method. I'T can increases the more satisfaction level of teacher than other. TeacherLs satisfaction improves the teaching quality. *roper ay of performance appraisal is essential for improve the performance of both teacher and student ?&M&TAT&O)S )vailability of hard are and soft are 2lo or unreliable Internet connections can be frustrating The memory or the storage capacity is limited. .and idth may degrade ith increasing users hen 4sing ireless net or!s. It is important to have fully functional devices The ireless net or!s are not generally very secure. CO)C?0S&O)

2?<

) gro ing body of literature, learning and teaching is suggesting that learning is greatly enhanced hen it is anchored or situated in meaningful and authentic problem(solving activities This approach to learning and teaching is founded on the principles of learning by doing and e"periencing It places or confronts learners ith authentic situations and scenarios hich are motivating and hich require learners to carry out tas!s or solve problems and reflect upon their actions. 0hile such learning designs are suited for any learning and teaching conte"t or media, their effectiveness and efficiency can be some hat constrained by the fi"ed time, space and pace limitations of learning and teaching in conventional campus( based classroom settings. )t last e(learning is best ay to improve learning 3 teaching. E( learning is currently the most useful as a supplement to I'T and is playing a central role in enriching the learning e"perience. It is no idely believed and has been proven in various countries that e( learning could and has been a huge factor in getting disaffected young adults to engage in learning, here traditional methods have failed. This is the ne orld and everything is changing ( the mar!et, the need, the people. E (learning is the future $,$ $)C$S 1. Evaluating /istance Education and E(learning. In '. 8o ard, -. 7. .oettcher, ;. -ustice, 5. 2chen!, *. %ogers, 3 ,. ). .erg (Eds.), Encyclopedia of /istance ;earning.. 2. $obile learning> ) hand boo! for educators and trainees by )gnes 5u!uls!a(8ulme, -ohn Tra"ler. $eans, ..NToyama, H.N $urphy, %.N .a!ia, $.N -ones, 5. (2??=). <. Evaluation of Evidence(.ased *ractices in #nline ;earning> ) $eta()nalysis and %evie of #nline ;earning 2tudies. @. In '. 8o ard, -. 7. .oettcher, ;. -ustice. D. Educating the 6et ,eneration. E/4')42E E(.oo!, #blinger, /., 3 #blinger, -. (2??D).

2?@

% $$) COMP0T&)% Manan (hanna Asst+ Prof+ Comp#ter Science Department/ %#r# )ana* Dev 0niversity College @er*a+ *hanna+manan1gmail+com A3ST ACT Environmental problems are increasing day by day hich are affecting our health. 2o in order to address such a problem hich is increasingly perceived as a S'risisF, there are gro ing movements globally in order to implement environment friendly computing. 4se of technology in various fields, if not has done properly can have adverse affects on the environment. E,reen 'omputingF is a name given to such a movement hich represents environment friendly ay to use machines, reduces po er and environmental aste. &)T OD0CT&O) ,reen computing is the name given to the study and practice of using computing resources efficiently. ) multifaceted global effort to reduce energy consumption and promote sustainability is termed as ,reen 'omputing movement. *roposed and e"isting strategies range from the practical to the fanciful, and include government regulation, industry initiatives, design and use of modern hard are hich is energy efficient. The mere focus of this green computing movement is on the data centers hich are often termed as Ethe 247Gs of the technical orldF, since enormous and asteful consumption of energy is done. ,ACTS A3O0T COMP0T&)% &) TODA4OS -O ?D )n estimated 1?? atts of energy is required for a /es!top *' having 1B(inch flat panel(out of hich CD atts for computer and the remaining <D atts is consumed by the monitor. IT industry is responsible for creating 2I of the orldGs carbon emissions. 4se of screen saver does not save energy, so hen a computer is not in use for a hile it should be !ept on sleep mode. If a computer system is left on 2@"B throughout a year, then around BD? pounds of carbon dio"ide ill be emitted into the atmosphere. ) huge dome of money is asted through inefficient business printing. The above stated facts are fe in number hich states degradation of environment as the need and use of computer is increasing. To ensure proper consumption and protection of environment ,reen 'omputing movement should be adopted. ,reen 'omputing represents a responsible ay to address the issue of global arming. .y adapting its practices, organi1ation can contribute to ards the environment.

2?D

$EAMP?$S O, P ACT&C$S O, % $$) COMP0T&)% 1. ,oogle uses customi1ed evaporative cooling to significantly reduce its data centerGs energy consumption. 2. /ell has accelerated into its progress to reduce ha1ardous substances in its computers for e"ample #pti*le" des!top. <. 8e lett(*ac!ard unveiled Ethe greenest computer everF in 2??A( the %pDB?? des!top *'. Its =?I material can be recycled. ST$PS TO % $$) &T 9ollo ing the policy of Energy 2tar, e can have environment friendly computing> 5+ P#rchasing energy efficient comp#ters> The 42 environmental protection agency (E*)) established the Energy 2tar program (in 1==2, in order to save energy and protect the environment). E6E%,H 2T)% label is no found on almost all computer systems, electronic products hich indicate the product is doing its part to ards the environment. 'onsumers can use E*E)T (Electronic *roduct Environment )ssessment Tool) hich assists in buying a energy saving computers. >+ Conserve $nergy! 'onsumer on its o n part can do save energy in follo ing ay> a. %eplacement of '%T monitors ith ;'/ monitors, as they use half to t o third of energy of a '%T monitor. b. Turning of the system if not in use for an e"tended period of time. c. .uying the hard are as required by the +ob. 9or e"ample, 1=GG monitor uses @?D more energy than 1BGG monitor. 2o if required and necessary then only purchase the desired hard are. B+ Turning of the system if not in use for an e"tended period of time. D+ Print Smarter! There are various ays to reduce paper consumption such as( a. *urchase a printer that supports duple" printing. b. 2 itch of the printer hen not in use. c. 4se electronic archiving technique to save paper. d. ETrac! changesF feature should be used rather then red line correctness. e. *rint al ays double sided and ma!e sure to reuse hardcopies hich are blan! etc. C+ Activate Power management feat#re! It can be done in follo ing manner( a. ,o to start, select 'ontrol *anel. b. 'lic! on *o er options. c. 'reate your o n po er plan for the system. 9or e"ample( 'omputer to set on sleep mode after 2?(C? min of inactivity. 2et monitor to sleep after D(1? min of inactivity. $COMM$)DAT&O)S 9rom the above stated facts it is cleared that use of electronic media should be done in proper ays such as>(
2?C

%ecycling of old computers 4se laptops on battery po er hen charged rather than on phantom po er. %edesign 'ompilers, performance libraries and instruction sets. %esponsible disposal and recycling of discarded equipments.

CO)C?0S&O) In spite of all the research and innovation, po er management has long ay to go. The energy efficiency of todayGs system can be improved by proper e"amination of their inherit inefficiencies and rethin!ing of their design. Energy 2tar rating along ith general components of computer can help to reduce amount of energy consumed per day. %eplacement of old machinery ith ne is only efficient if the efficiency different are high and the old equipments can be recycled. $,$ $)C$S 1. http>&&en. i!ipedia.org& i!i&greenQcomputing. 2. 'omputing. %evie 2??B> ,reen computing. )ccountancyage, 1A /ecember 2??B, .accountancyage.com&computing&ne s&22?D=1D&2??B(revie (green(computing <. http>&&green orld2?1?.blogspot.in @. http>&&e1inearticles.com

2?B

,ig 5

2?A

SMO($4 A C"&T$CT0 $ 7 D&ST &30T$D ,& $-A?? S4ST$M )avdeep Singh Asst Prof+/Trinity College/ .alandhar+ navdeep2singhFB>C1yahoo+in Tar#n Sharma Asst Prof+/ C+T &nstit#te of Management and &nformation Technology/ .alandhar+ mr+tar#nsharmaFG1gmail+com

A3ST ACT Traditional intranets have a central location on the net or! hich easily allo s the enforcement of a central security policy. They rely on the notion that there is one central entry point for all internal machines. )dditionally, all machines that are considered logically inside the intranet reside behind the entry point. Increasingly this is not the case. 0e propose 2mo!ey, a system that manages and distributes a central security policy to end clients on a net or!. 2mo!ey installs a distributed fire all on a client based on a userGs location and needs. The security policy that it distributes is based on the credentials the user provides and the lo est level of access needed for the user to complete their tas!s is enforced. ($4-O DS> 9ire all, /istributed, 6et or! 2ecurity, 4ser, 2ecurityN &)T OD0CT&O) Traditional corporate intranet security as based on the notion of Eus vs. themF. )nything inside the corporationGs intranet as a trusted friend and anything outside as treated as a potential adversary. ) fire all a component placed bet een t o sections of the net or! that filters traffic dictated by some security policy as used to separate the intranet from the rest of the orld. Today intranet topology is changing. 0ith the gro th of e"tranets that allo authori1ed users, such as telecommuters, access to the intranet from the outside (see figure 1) and the increasing e"istence of un(trusted users, such as a corporate visitor, inside the intranet (figure 2), the concept of a conventional fire all is becoming antiquated. #ne solution is that central security policy be pushed to the endpoints. .y allo ing end clients the ability to enforce a centrali1ed security policy, the intranet can essentially be spread over a large area and travel over un(trusted lin!s. 'lients can be trusted based on providing authentication, not on their geographical location. 8o ever, it is difficult to distribute the security policy since adversaries can be found any here and may try to intercept it. .y decentrali1ing the net or!, an attac!er has more opportunities to brea! into the system. There is not one security bottlenec! that can be tightly monitored. Each client has to be trusted to be secure so that the net or! ill not be infiltrated. 0e propose 2mo!ey, a system that sets up a centrali1ed security policy on clients in a distributed system. 2mo!ey distributes the policy on a per(user basis, so that each user is allotted the amount of access that he or she can trusted ith. #n a multi(user machine, 2mo!ey can retrieve and enforce separate policies for users ith different needs.
2?=

,ig 5! $Hternal single7 and m#lti7 #ser machines can belong logically to the intranet

,ig >! &nternal machines may have different connectivity needs ,& $-A??S 9ire alls are a mechanism for policy control. ) traditional fire all consists of several different components the t o most important being filters and gate ays. 9ilters bloc! the transmission of certain classes of traffic. ,ate ays provide relay services to compensate for the effects of the filters. 9ire alls only bloc! banned traffic from progressing. They provide no protection against problems ith higher(level protocols. Traditionally the fire all has been placed as a barrier bet een an intranet and the outside orld. It is a barrier that all traffic entering must pass through. $ore recently, internal fire alls have been instituted to isolate smaller, internal security domains. $ost of todayGs fire alls operate using a rule based system. The rules instruct the fire all hich inbounds pac!ets to let pass and hich to bloc!. 2imilarly, it monitors outbound traffic. The fire allGs rule(base must be updated as ne threats become !no n as rules are usually only ritten to combat !no n problems. #n some systems, the rules are grouped by roles. %oles are properties assumed by the different hosts in the net or! and define the capabilities needed by that host. .y assigning rules to roles and roles to hosts, each host is guaranteed protection of its needs. %oles can be hierarchically assigned ith hosts inheriting rule sets from less secure ones. This also has the side effect of separating the security policy from the net or! topology since hosts can have different rule sets. D&ST &30T$D ,& $-A??S ) distributed fire all is a mechanism that enforces a centrali1ed rule policy but pushes the enforcement of it to ard the edges. In current implementations of the distributed fire all, access is controlled by machine identification. It is up to the host machine to fetch the security policy from a repository hen an alarm is triggered. There is no ay to automatically propagate the policy through the system or even to guarantee that a host has to update its policy on a regular basis. $achines are identified a via cryptographic certificate

21?

and are allo ed to +oin the net or! based on this identification. ;ocal hosts do nload the security policy. 0hen a connection is established, the policy daemon ill screen the incoming traffic. If it is approved, the policy daemon ill inform the !ernel to proceed ith the connection. If the daemon ill try to establish validity through outside sources before, if needed, ultimately denying the connection. S$C0 &T4 &SS0$S &) D&ST &30T$D S4ST$MS There are several !no n threats to distributed 2ystems that need to be analy1ed hen designing a security policy for one 4ser must be verified and channels must be secured .) system, in order to be considered secure, has to provide several guarantees . These are> u Confidentiality> The guarantee that sensitive information ill not be disclosed to unauthori1ed recipients. u &ntegrity> /ata is modified in an authori1ed manner. u Availability> %esources of the system must be accessible to an authori1ed user.

,ig B! Distrib#ted ,irewall

,ig D ! Connection to -eb Server

,ig C! Connection to &ntranet

211

CAS$ SC$)A &O This system ould be useful in a plethora of situations. 8o ever, the !ey feature is that the security policy is assigned based on the user at the end host. Each user can load an individuali1ed policy. ,or eHample/ there may be a situation inside a large company here they have noticed people misusing the I$ clients and they have a suspicion that the clients are compromising their security. The system administrators decide to bloc! these clients from being able to communicate ith clients outside the corporation. This can be done ith a simple addition to the fire all. 8o ever, it might not be pertinent for the policy to bloc! internal communication. In this case, a user(based policy ould be the best scenario to choose since the policy could be selectively applied. D$S&%) O@$ @&$2mo!ey is a user(based distributed fire all system for use on single( or multi( user machines. The system is designed in three large components hich reside in user space and !ernel space on the individual system and the server base located inside the traditional intranet. Each of these areas holds different sections of the system. u0ser Space! The items in user space include the ;ogin 'lient (see section <.2.1), the *olicy $anager (see section <.2.2) and the 2tored 4ser Information (see section <.2.<). These components are either in need of user level input, li!e the login client, or need to access items, such as the file system, hich is done from user space. u (ernel Space! The items in !ernel space include the *olicy 8andler (see section <.2.D) and the 9ire all (see section <.2.C). These components are placed in the !ernel because they have need of access to the lo (level processes the !ernel has control of. Q &ntranet! The intranet contains components that hold sensitive information, such as pass ords, and needs to be in an area here it can be closely monitored and be under tight control. The servers (see sections <.2.1 and <.2.@) are located in this space.

,ig G Smo*ey as designed ith security in mind. It follo s the basic rules of system design that underlay a secure system. It follo s the principles of separation of privilege and least privilege The Trusted computing base includes the !ernel, the fire all, the policy server and handler and the policy and login servers. The servers and client communicate using public !ey encryption over a verified secure channel. B+>+5 ?ogin Client and Server The login client and server are a part of a basic authentication system. The user enters his or her name and pass ord into the login application. The user name and pass ord are used to
212

obtain a tic!et and a user identification number (4I/) access to the policy server

hich

ill allo

the user to gain

B+>+> Policy Manager The policy manager has t o different states times that it is called to act. It is called by the login application at login time. It is also accessed hen the user logs out. )t login time, the system is passed the tic!et and the 4I/ by the login client. The policy manager uses this 4I/ to retrieve the user(specific rules if they are stored on the computer (see section <.2.<). The time the rules ere last stored along ith the tic!et, the 4I/ and the type of client the user is on are passed to the policy server (see section <.2.@). The policy server ill then inform the policy manager if it has the most recent version of the security policy. If not, or if the rule base is not on the machine since the user is ne to that client, the policy manager ill request the ne rule set from the policy server and it ill be sent bac! in encrypted form and stored. The policy manager ill then request the !ey to decrypt the policies it has retrieved from storage. 0hen this is received, it ill decrypt the policies and pass them to the policy handler (see section <.2.D) along ith an install instruction. #n logout the policy handler has a much simpler tas! It is passed the 4I/ and it ill pass that to the policy handler ith a remove instruction. 8o ever, it must authenticate that this removal request is valid by being given a certificate of assurance by the application that the user has indeed been disconnected

,ig ;! Diagram of the system design B+>+B 0ser7?evel Storage The user(level storage stores a userGs individual security policy on the client. These rules are stored in an encrypted form because if the client is compromised they cannot be read thus allo ing !no ledge of policies used across the system. The 4I/ and date they ere last modified is stored unencrypted along ith the record. The !ey to decrypt the rules is not stored on the machine so they cannot be read ithout authentication by the server. The rule set is stored by hashing over the 4I/. )ny user ho has logged onto the client and had the security policy set up for them ill have their rules stored under the assumption that a user ill ma!e a pattern of using that machine. 'urrently, there is no mechanism for removing the stored data of users ho have not appeared on the client for a hile. The choice as made to store data on the system in order to reduce the latency of configuration. *assing large amounts of data across the net or! is not trivial and ould slo do n the time it ill ta!e to
21<

configure the system. 2ince e anticipate the security policy as made to store the data locally.

ill evolve slo ly, the decision

B+>+D Policy Server The policy server is the central machine here the rules are stored and delivered to clients requesting them. The security rules are stored in usable form so they can be directly installed onto the client ithout modification. 0hen a rule is added, the system administrator goes to the policy server and adds the rule in this form along ith the groups of users and types of machines that it applies to. The rules are stored in a database hich is !eyed under the groups and types of machines. 0hen a request comes in from the policy manager to see if its rules need updating the policy server ill first chec! the tic!et and ma!e sure that it is valid. If it is, it ill retrieve the records that correspond to the group the 4I/ belongs to and the machine type that have been added since the rule bundle has last been updated. If this query is null, then the client has the most recent set of rules and is informed of the fact. If not, the server ill gather all of the rules applicable to the 4I/ on that type of machine into a bundle and encrypt them. 4pon request from the client, this bundle ill be sent to the client to store. #nce the client is guaranteed to have the most recent version of the rules, it ill request the !ey to decrypt them. The !ey is different for each 4I/ so a user ill not be able to access any other userGs rules ith that !ey in order to preserve the separation of privilege. The !ey is a combination of the serverGs !ey and the 4I/. This !ey is sent bac! to the policy manager. B+>+C Policy "andler 0hen the policy handler receives rules along ith an install command, it integrates the ne rules into current fire all. It receives the rules in the correct form to be interpreted by the net or! stac!. It also receives the 4I/ and tags the rules ith these so that they are only applied to net or! traffic that is arriving destined for that user. If the rule already e"ists on the fire all, the 4I/ tag is added to that rule to prevent duplication. 0hen the policy handler receives a remove command ith the 4I/, it ill remove the 4I/ tag from the rules. If the rule is only tagged ith the current 4I/, it is removed from the fire all The rest of the fire all is left intact. B+>+G ,irewall The fire all, li!e a traditional one, ill bloc! transmission and receipt of certain classes of traffic 8o ever, there are some !ey changes made to 2mo!eyGs fire all. Thez fire all is not static> it has to be able to be modified on the fly hile the computer is still online. The other !ey change to note in the implementation of the fire all is the presence of 4I/s. %ules, hen bound to the 4I/s, should only be applied to traffic bound for applications o ned by that user. B+B Threat Model 2mo!ey has several places here it could be attac!ed. If 2mo!ey as bro!en into, the attac!er could set the security rules or stop them from being applied on a machine. This is a dangerous situation. )n attac!er could bypass the security by !no ing hat bac! doors are

21@

there because they put them thereY There are several locations here 2mo!ey is at ris!. 8o ever, there are safeguards in place to prevent the attac!ers from gaining control u The attac!er could pretend to be the policy server. 0hen 2mo!ey chec!s to see if the rules it has are up to date, the attac!er could respond negatively and replace the userGs rules ith its o n and be able to gain control of that userGs account on the machine. 8o ever, 2mo!ey uses secure authenticated channels to prevent this. u The attac!er may try to spoof a policy manager to gain access to the rules applied on a machine. It ould request the rule bundle and !ey as if it ere a ne user on a client. 8e or she could use their !no ledge of the security policy to brea! into the system later. The tic!ets and authenticated channels should prevent this attac!. u ) malicious user may have access to a multiuser machine. 8o ever, since the security policies stored on the machine are encrypted using a unique !ey generated by the server, the attac!er ill not be able to get the !ey to decode the rules ithout a valid tic!et. u )n attac!er may gain access to a userGs account. The attac!er ill be able to decode the rules that are stored since he ill have a valid tic!et. 2ince rules are for that user and others in the same group on the same type of machine, he ill be able to use his !no ledge to brea! into those machines as long as he can detect here they are. This can currently only be stopped by detection and changing the rules to plug holes. In order to stop this attac!, 2mo!ey ould need to be modified to allo a 4I/ access to the !ey only once per tic!et issued. ()lthough, if the user has already gained access to the account, it is unli!ely he ould need to e"amine the security policy to discover holesY) u If an attac!er gains access to the machine, they may be able to spoof the application and tell the policy manager that a specific 4I/ has logged out, thus removing the security protection from the user hile they are still connected to the net or!. 8o ever, since the communication bet een modules requires authentication, this is protected against.

,ig F! ,lowchart of the Policy Manager

21D

9igure 6o A> 9lo chart of the *olicy $anager. Teal bo"es are a part of the *olicy $anager. The access some e"ternal functions. ,reen bo"es are a part of the *olicy 2erver. ,rey bo"es are part of the *olicy 8andler. D+ &MP?$M$)TAT&O) The current status of 2mo!ey is that it contains a fully implemented policy manager and a s!eleton(code implementation of the policy handler and policy server. 2mo!ey is ritten in -)7) and runs on a ;inu" platform. The rules are implemented in an I* 'hains format hich is a tool!it that adds rules to an e"isting fire all on a ;inu" platform. The policy handler is implemented using several small modules (see figure A). )ll data is private and inaccessible from the outside. The modules are divided into the follo ing> Main Interacts ith the application. It receives the 4I/ and hether this is a login or logout request. It is the only module that is able to receive instructions from the local machine. If the tic!et is invalid, it returns the error to the login application and e"its. It calls the module manages the rest of the modules and ma!es sure they are acting correctly. Director $anages the rest of the modules and directs the flo of the data. etrieve ecord %etrieves the encrypted user data. Chec* @alidity 'alls the policy server and chec!s the validity of both the stored data and the tic!et. etrieve Policy %equests and receives the ne rules from the policy server and stores them locally. It also retrieves the !ey hich is used to decrypt the rules and then is destroyed. Call (ernel The unencrypted rules are passed to the policy handler and then destroyed, ?ogo#t %equests the policy handler remove rules related to the 4I/. C+ CO)C?0S&O) 2mo!ey is the prototype of a system that distributes a centrali1ed security policy to clients. 2mo!ey can set individual security policies based on the user, location and type of the machine. This custom ability ma"imi1es the usefulness of the security system since it can be geared to ard the current situation. )lthough fire alls have come under criticism as not the most useful security policy, 2mo!ey can be generali1ed to the distribution of other policies. 2mo!ey has sho n ho to centrally manage and securely dynamically distribute a security policy $,$ 1. 2. <. @. $)C$S 9ire alls and Internet 2ecurity %epelling the 0ily 8ac!er .y )ddison(0esley.z 9ire alls R ) 'omplete ,uide .y ,oncalves , $arcus 0eb help ( .inflibnet.ac.in , arcticlebase.com, ama1on.com, google.co

21C

-O M "O?$ ATTAC( &) -& $?$SS S$)SO )$T-O (S Arminder Singh Assistant Professor/Trai Shatabdi %+%+S (halsa College/Amritsar+ profarminder1hotmail+com A3ST ACT 0ireless sensor net or! is a gro ing technology hich is offering solution to variety of application areas such as health care, military and industry. These !inds of net or!s usually apply number of devices !no n as sensor devices. These sensors hich are limited are distributed over the environment and communicate through the ireless media. )s sensor devices are limited the net or! e"posed to variety of attac!s. 'onventional security mechanisms are not suitable for 026s as they are usually heavy and nodes are limited. #ne of the most severe attac!s to detect and defend in ireless sensor net or! is orm hole attac! in hich data ill be for arded from one part of the net or! to the other part trough the ormhole tunnel. In this paper i focused on ormhole attac! and proposed distributed net or! discovery approach to mitigate its effect. ($4-O DS! 0ireless 2ensor 6et or!, ormhole attac!,026. &)T OD0CT&O) The term ireless net or! refers to any !ind of net or!ing that does not involve cables. It is a technique that helps entrepreneurs and telecommunications net or!s to save the cost of cables for net or!ing. 0ireless technology has helped to simplify net or!ing by enabling multiple computer users to simultaneously share resources in a home or business ithout additional or intrusive iring. These resources might include a broadband Internet connection, net or! printers, data files, and even streaming audio and video. This !ind of resource sharing has become more prevalent as computer users have changed their habits from using single, stand(alone computers to or!ing on net or!s ith multiple computers, each ith potentially different operating systems and varying peripheral hard are. In this paper i focused on the ormhole attac! in 026s, presented selected countermeasures and then proposed net or! discovery approach hich needs no additional tools or accurate time synchroni1ation. S$)SO D$@&C$ A C"&T$CT0 $ 7erdonel et al. describe the sensor node device as the simplest tool in the ireless sensor net or!s and considers the five elements for sensor device hich are sho n in 9ig1. )ccording to their or!s, sensor node device has the $icrocontroller hich manages all tas!s. It also equipped ith the memory hich is used to store environmental sensed data. The radio transceiver is used to transmit data. )dditionally it has the sensor to sense environment. )nd finally the po er source, the battery, hich is used to provide required po er for the other elements.

21B

,ig 5! Sensor )ode Architect#re )s sensor device consist of limited components, it could not be used for comple" tas!s and processes. Therefore any mechanisms including security approaches, should meet these restrictions in order to be viable in sensor net or!s. -O M"O?$ ATTAC( &) -S) #ne of the most severe attac!s to detect and defend in ireless sensor net or! is ormhole attac! J1(DK. In this attac!, a malicious attac!er receives pac!ets from one location of net or!, for ards them through the tunnel ( ormhole) and releases them into another location. The illustration of ormhole attac! in ireless sensor net or!s is sho n in 9ig 2.

-O M"O?$ ATTAC( CO0)T$ M$AS0 $S &) -S) This section ill present countermeasures in order to detect, defend or mitigate the effect of ormhole attac! in ireless sensor net or!s. In general the common method in order to detect ormhole attac! in 026 is to use neighbor discovery techniques. 2ometimes this ill be achieved through applying special equipments such as antenna J12K. #ther approaches may use accurate time synchroni1ation in order to detect hether pac!ets are received from the authori1ed neighbors or not J1<(1@K. )dditionally protocols may estimate the distance of the sender through the signal straight and verify hether data comes from the node ithin the range of communication or not J1DK. 2ome other approaches in this regards apply centrali1ed mechanisms hich uses statistical analysis and methods to detect ormhole attac! J1CK. These approaches ill detect ormhole e"istence due to specific changes in certain statistical pattern. The rest of this section ill revie selected approaches regarding to ormhole attac! detection and mitigation in 026. P OPOS$D )$&%"3O D&SCO@$ 4 APP OAC"

21A

.ase on the discussions in previous section, in order to mitigate effect of ormhole attac! in 026, a distributed neighbor discovery approach has been proposed. There are some criteria to determine hether ormhole attac! is performing in the net or! or not. 9or e"ample some methods use statistical approach. They find dramatic changes in the certain statistical patterns and then decide on e"istence of ormhole in the net or!. ;onger propagation can be another symptom of ormhole e"istence. )dditionally one can determine the e"istence of ormhole in the net or! by chec!ing the parameters such as bigger transmission range than that of normal condition, and previous node is not a neighbor as ell. The proposed method is based on the fact that mentioned ormhole data comes from unauthori1ed and illegal neighbors. In order to illustrate the idea of the proposed neighbor discovery technique, consider 9ig. <presented at belo . This figure illustrates of net or! ith 12 nodes. 'onsider to nodes S)G and S.G. The actual neighbors of node S)G are S)1G and S)2G and the real neighbor of node S.G are S.1G and S.2G. This means that node S)G receives information only form nodes S)1G and S)2G and nodes S.1G and S.2G only send data to node S.G. )s it is sho n in the 9igure@, node S)G is connected to node S.G through the ormhole. Therefore node S)G can also receive data from node S.G and vice versa.

,ig B! )etwor* Affected -ith -ormhole The problem of ormhole attac! ill be solved if the receiving node can determine hether arrival data comes from actual neighbor or not. Therefore in order to mitigate the effect of passive ormhole attac! hich attac!er is not belong to the net or! and does not use the sensor devices to receive and for ard the data through the ormhole tunnel, neighbor discovery protocol has been proposed. A+ System Ass#mptions It has been assumed that each t o neighbor nodes have the secret share !ey hich has been shared after deployment of net or! and cannot be captured by attac!er as it needs more time to capture. It is also assumed that attac!er cannot lunch ormhole attac! before certain time in hich illustrates the time to complete neighbor discovery. )dditionally attac!er could not change or modify transmitted data and uses its o n devices and cannot use net or! nodes to lunch attac!. )fter certain amount of time ( hich is not considerable) attac!er can lunch ormhole attac! and it can also lunch selective for arding attac! hich data randomly for arded by attac!er after message as for arded to other tunnel endpoint. 3+ Definition The proposed method starts to or! as every node, say S)G, sends 8E;;# message to the all of on hop neighbors. This message is encrypted ith secret shared !ey bet een each t o neighbors, say 5). hich is the shared secret !ey bet een t o nodes S)G and S.G. It contains the I/ of sender, a random number as nonce and message digest. The message digest is computed using hash algorithms such as 28)1 and $/D. I used $/D algorithm in order to generate hash values as it is recommended in the literatures J2B(2AK hich claimed
21=

$/D is suitable to be used in 026. 0hen a neighbor, say S.G, receives a 8E;;# message, it ill decrypt the message using a shared !ey bet een itself and the sender of the message. )fter that it computes the hash of S2ender I/G concatenation of S6onceG. If result is equal to hat is in the message, the 8E;;# message is authenticated and from an authori1ed neighbor. #nce 8E;;# message is authenticated, %E2*#62E message ill be sent bac!. %E2*#62E message contains the identity of sender (a node hich sends a %E2*#62E message), S6onceG under the simple function 9 and message digest of S2ender I/G concatenation of S9(6once)G. It is considerable that 9 is a simple function such as 9 (n) P n Z 1 and message is encrypted via shared !ey among the sender and receiver. )fter %E2*#62E message has been received to the destination, it ill be decrypted via shared !ey bet een t o neighbors. )fter %E2*#62E message as decrypted, node S)G verifies node S.G through the authentication steps. 9irst it chec!s eather hash value of SI/.S and S9(6once)G is equal to the hash value in the %E2*#62E message or not. 2econdly it chec! for the value of S9(6once)G. If these t o tests are successfully achieved the neighbor is authenticated, other ise it is fa!e neighbor and %E2*#62E message ill be deleted. 0hen a neighbor is authenticated through the verification of %E2*#62E message as it mentioned, its information saved into the destination node, node S)G in my e"ample, and constructs data structure called neighbor list 6) ( 6I illustrates the neighbor list of node SIG). I assume as neighbor list of each node constructed, it ill !eep safely in node. The constructed neighbor list ill be used in order to ma!e sure message is received from the authori1ed neighbor. 9or my research this list only contains the identity of the neighbors. It also can integrate ith !ey materials as needed. C+ S&M0?AT&O) A)D $S0?T In order to evaluate the effectiveness of this approach, 62< as applied. /eployment of the net or! as achieved by randomly distribution of D? nodes over the areas of @BC_<?< meter square hich made hierarchal net or! in hich data ill be sent to base through the parent. These numbers of nodes are selected to cover up previous researches parameters J2=K and J1CK, although i have seen variety of parameter values proposed by researchers in the literature. Table 1 sho the net or! parameter hich is used in simulation.

The intent of research is to mitigate the effect of ormhole attac! in the 026. Therefore i proposed neighbor discovery approach to mitigate the ormhole effect in the mentioned net or! set up the simulation using 62<. In this section i presented the results of the simulation. I measured total number of sends and receives in the original and enhanced net or! under the ormhole attac! here D@I of nodes are affected ith the ormhole. The result is presented in 9ig @.
22?

,ig D! Total sends of sends & receives of original & $nhanced )etwor* #nder wormhole attac* )s it can be seen in the 9ig @, there is tremendous increase in number of sends and receives of original net or! under ormhole attac!. This is happened as attac!ers rebroadcast every pac!et it gains. 4nli!e original net or!, enhanced one mitigates overload of ormhole attac!.

,ig C! Mitigation Percentage of wormhole attac* 9ig D sho s the percentage related to overload mitigation of passive ormhole attac! through the enhanced protocol. )s it depicted in mentioned figure, almost 1??I of ormhole overload ill be mitigated shortly after lunching of ormhole attac! in the net or! here D@I of nodes are affected ith the ormhole. D CO)C?0S&O) A)D ,0T0 $ -O (S In this paper, i discussed about 026, its applications and the most idely used element of it, sensor device. )dditionally security issues in 026s ere presented. Then i focused on the ormhole attac! in these !inds of net or!s and presented selected countermeasures. )fter ard i generali1ed previous countermeasures, analy1ed them and selected the better one. )nd then based on the presented results e proposed net or! discovery approach base on distributed scheme hich needs no additional tools or accurate time synchroni1ation. )ccording to the simulation proposed approach acted efficiently and mitigated almost 1??I of ormhole attac! overload in the environment here D@I of nodes are affected ith the ormhole. In future i ill try to integrate this approach ith the secure routing protocols in 026Gs. $,$ $)C$S

221

1. Thao, Thibin, E/etecting 0ormhole )ttac!s in 0ireless 2ensor 6et or!s ith 2tatistical )nalysisF. > $000, :A#0 $nternational .2*2 2. *rasanna+it ., 7en!atesh, E)n )pproach to ards /etection of 0ormhole )ttac! in 2ensor 6et or!s.F :A#0 $nternational !onference on $nformation 0ngineering. pp. .;< - <;+. <. 5arlof, 'hris and 0anger, /avid. E2ecure %outing in 0ireless 2ensor 6et or!> )ttac!s and 'ountermeasuresF. $000,2??< pp. 11<(12B. @. 2ecurity of 0ireless 2ensor 6et or!s. %ehana, -inat. 2??=. 2eminar on Internet or!ing. D. 2ensor 6et or! 2ecurity> ) 2urvey. 'hen, Viangqian, et al. 2??=, IEEE '#$$46I')TI#62 24%7EH2 3 T4T#%I);2,7#;. 11,pp. D2(B<. C. ;ITE0#%*> ) light eight countermeasure for ormhole attac! in multihop ireless net or!s. 5halil, Issa, .agchi, 2aurabh and 2hroff, 6ess .. s.l. > IEEE, 2??D. International conference on dependable systems and net or!s. pp. 1 ( 1?. B. ) secure routing protocol for ad hoc net or!s. 2an1giri, 5imaya, et al. 2??2. 1?th IEEE International 'onference on . pp. BA ( AB . A. ,raaf, %ennie de, et al. /istributed /etection of 0ormhole )ttac!s in 0ireless 2ensor 6et or!s. ;ecture 6otes of the Institute for 'omputer 2ciences, 2ocial Informatics and Telecommunications Engineering. s.l. > 2pringer, 2?1?, pp. 2?A(22<. =. /efending against ormhole attac!s in mobile ad hoc net or!s. 0ang, 0eichao, et al. 2??C, 0ireless 'ommunications 3 $obile 'omputing. 1?. 4sing /irectional )ntennas to *revent 0ormhole )ttac!s. 8u, ;ing"uan and Evans, /avid. 2??@. 6et or! and /istributed 2ystem 2ecurity 2ymposium (6/22). 11. 2ecure and resilient cloc! synchroni1ation in ireless sensor net or!s. 2un, 5un, 6ing, *eng and 0ang, 'liff. 2??C, IEEE -ournal on 2elected )reas in 'ommunications, pp. <=D ( @?A . 12. 2ecure neighbor discovery in ireless net or!s> formal investigation of possibility. *oturals!i, $arcin, *apadimitratos, *anos and 8ubau", -ean(*ierre. 6e Hor! > )'$, 2??A. 2??A )'$ symposium on Information, computer and communications security. 1<. 2ecure neighborhood discovery> a fundamental element for mobile ad hoc net or!ing. *apadimitratos, *., et al. 2??A, IEEE 'ommunications $aga1ine, pp. 1<2 ( 1<= . 1@. .uttyian, ;evente, /iora, ;ias1lio and 7a+da, Istvian. 2tatistical 0ormhole /etection in 2ensor 6et or!s. )uthenticated :ueries in 2ensor 6et or!s, ;ecture 6otes in 'omputer 2cience. s.l. > 2pringer, 2??D, pp. 12A ( 1@1. 1D. )n approach to mitigate ormhole attac! in ireless ad hoc net or!. ;ee, ,unhee, 5im, /ong(!yoo and 2eo, -ungtae!. 2??A. International conference on information security and assurance. pp. 22? ( 22D.

222

COMPA &SO) O, DAS A)D SA) T$C")O?O%&$S Amandeep (a#r Assistant Professor/Trai Shatabdi %#r# %obind Singh (halsa College/ Amritsar+ .asbir Singh Assistant Professor/%#r# %obind Singh (halsa College/Sarhali6Tarn Taran8+ A3ST ACT The ever increasing demand for fast and reliable data storage has caused dramatic changes in the storage model. . The direct attached storage (/)2) is suitable for environments ith an individual server or a limited number of servers, the environment rapidly become unmanageable if there are multiple servers or significant data gro th. *erformance and scalability are limited and, in such multiserver environments, /)2 resources cannot be efficiently allocated. /)2 systems also limit data sharing and tie up valuable ;)6 band idth during bac!up indo s. Thus /)2 model is being replaced by storage area net or!s (2)6s). 2)6s provide the capability to distribute the storage across multiple servers leading to decentrali1ed and e"ternali1ed storage. ($4-O DS! 2torage area 6et or!, 9iber 'hannels, /irect attached storage (/)2), Inter 2 itch ;in! (I2;) and ;o er total cost of o nership (T'#). 5+ &)T OD0CT&O) The increasing demand for data storage ith reliability, larger band idth and security continue to #verburden traditional direct attached storage (/)2) servers. ;arge organi1ations using the /)2 model ith a large number of servers are distributed geographically all over the country storing terabytes of data. The /)2 model is based on each server having its o n private connection to the storage, the private connection based on the small computer systems interface (2'2I) bus. The /)2 model e"hibits serious limitations hen confronted ith the current storage demands. The first limitation is the unavailability of data during a server failure, since the server controls all access, to the data through its 2'2I bus. The second limitation is the 2'2I performance of only A? $.&s data transfer rate. )lso, this A? $.&s band idth is of the entire 2'2I bus hich is shared among all the devices connected to the 2'2I bus. In addition, the actual performance is dependent on the server capabilities. The third limitation is the 2D meters ma"imum cable length allo ed bet een a server and the storage. 8ence, the emerging alternative to the /)2 model is the one based on the concept of the storage area net or! (2)6). ) 2)6 is a high speed net or! ith a connection bet een the servers and the storage as sho n in 9igure 1. 9igure 1 depicts the most commonly used 2)6 topology, namely the s itched fabric 2)6.

22<

,ig 5 In this topology, the servers are connected to the storage through a fabric comprised of s itches and cables. The connections bet een the fabrics s itches are !no n as inter s itch lin! (I2;). In 9igure 1, it can be seen that the client or!station access the server through the traditional local area net or! here as the servers access the storage through the 2)6. The servers can access the storage through alternative paths, and the clients through multiple servers. The ma"imum physical cable length bet een a server and the storage can vary from D?? m to D? !m depending on hether a multimode or single mode transmission is implemented.

,ig > >+ SA) 3$)$,&TS 2)6s offer a range of benefits that address the needs of todayGs data(intensive businesses> u ?ower total cost of ownership 6TCO8 R0hile the initial cost of a 2)6 solution may be higher than that of /)2, the inherent fle"ibility and scalability of a 2)6, together ith its reduced management comple"ity and cost, deliver long(term cost benefits. 2)6s can be tailored cost( effectively to a companyGs needs. 0hen additional capacity is required, it can be e"panded ithout do ntime.
22@

u $fficient capacity #tili'ation R .y consolidating storage resources and sharing capacity across multiple servers, 2)6s generally utili1e D?I more capacity per storage device than /)2. This further optimi1es the storage spend. u Centrali'ed storage management R .y centrali1ing the management of all storage resources, even vast amounts of storage can be easily managed by a small IT staff. ) single IT person can manage @(B times the amount of capacity as compared to /)2 resources, dramatically reducing management costs and headaches. u S#perior data protection R 2)6s provide the infrastructure to implement advanced data protection features X li!e snapshot and mirroring&replication X to enhance bac!up and recovery and /isaster %ecovery features critical to uptime and business success. u &ncreased #ser prod#ctivity R .y erasing technology boundaries bet een data and users across the enterprise, 2)6s increase collaboration and productivity, saving time and money and enhancing corporate profitability. B+ SA) T$C")O?O%&$S 0ith their gro th in popularity and technology advances, t o types of 2)6 technology have emerged> one based on 9iber 'hannel interface technologyN the other based on the more recent I*(based i2'2I protocol. Each offers its o n set of advantages. <.1 ,iber Channel > In this 2)6 infrastructure, storage and servers are lin!ed via a high(speed net or! of interconnected 9iber 'hannel s itches for high(speed, bloc!(level data access. )dvantages include> u @ery high performance > up to 2,b throughput, ma!ing 9iber 'hannel ideal for demanding, transaction(intensive storage applications. u 7ery high availability, enabling a range of redundant configurations to deliver the uninterrupted data access required for mission(critical applications. u *roven 2)6 technology, ith a solid trac! record of reliability in demanding enterprise environments. B+> iSCS& R This 2)6 infrastructure leverages the fle"ibility and ubiquity of I* net or! and Ethernet technology to deliver all the consolidation, scalability and fle"ibility benefits of a 2)6, at a lo er cost than fibre channel. )dvantages include> u @ery cost7effective ! i2'2I 2)6s utili1e lo (cost I* net or! elements to deliver a Total 'ost of # nership (T'#) @<I lo er than that of /)2\and D?I lo er T'# than 9' 2)6s. u Easy to deploy and manage, leveraging industry(standard I* technology, standards and protocols and requiring only limited staffing, ith no speciali1ed s!ill sets. These advantages have made i2'2I 2)6s a popular alternative for smaller organi1ations and or!groups see!ing a cost(effective solution. They are ideal for 0indo s, ;inu", and 6ovell environments here server proliferation is ma!ing storage management comple" and e"pensive. D+ CAPA3&?&T&$S A)D ?&M&TAT&O)S O, SA)S T$C")O?O%&$S
22D

Criteria Initial cost considerations

iSCS& SA)s u ;o deployment costs u ;everages e"isting I* net or! resources u ;o er management costs (T'#) than fiber channel 2)6 and /)2 uImplementation dependent.

,iber Channel SA)s u 8igh deployment costs u %equires special 9iber 'hannel infrastructure u %equires speciali1ed training u ;o er management costs (T'#) than /)2

2calability

u 12C devices in arbitrated loop 'onfiguration. u 1C million devices in a s itched configuration u 4p to 2,b u ,ro th path to 1?,b u $ultiple paths bet een servers and storage enable a constant connection, even if some paths go do n. u ;imited to 1?!m

*erformance

)vailability

u C?(A?I of 9' u 4p to 1,b u ,ro th path to 1?,b u $ultiple paths bet een servers and storage enable a constant connection, even if some paths go do n. u 6o distance limitations

/istance bet een storage and servers Ideal for\

u 2mall(to($edium si1ed businesses u %emote offices&.ranch #ffices /epartmental&0or!groups u 'ompanies ith modest IT staff u 'ompanies ith short investment(return cycles

u ;arge businesses&/ata 'enters u $ission 'ritical )pplications ( )pplications requiring highest performance and availability u 'ompanies ith robust IT e"pertise u 'ompanies ith longer investment return cycles

C. &)T$ )$T ,&3 $ C"A))$? P OTOCO? i9'* is a gate ay(to(gate ay protocol to transport 9iber 'hannel frames over T'*&I* s itching and routing elements. )ccording to the IET9 draft , the protocol enables attachment of e"isting
22C

9iber 'hannel storage products to an I* net or!. )n i9'* fabric supports only 'lass 2 and < fiber channel transport services. i9'* gate ays are located at the interface of 9iber 'hannel and I* 1ones. )t least one T'* session is managed bet een a pair of gate ays corresponding to a 9iber 'hannel session in the 9' 1one. The difference bet een 9'I* and i9'* is that 9' commands and data terminate in i9'* gate ays, ma!ing the design of the i9'* gate ay critical for achieving high application throughputs. /epending on the available band idth, parallel T'* sessions can be established for higher aggregate throughput and also to isolate the effect of pac!et loss and congestion on individual T'* sessions. P$ ,O MA)C$ A)A?4S&S O, SA) P OTOCO?S Parameter /ata indo ,ibre7Channel7 based $a"imum number of buffer credits available> 12D 21?@ payload Z @@ overhead iSCS&7based 2ingle T'* connection ith indo of 2DC !bytes 1@?@ payload Z 11@ overhead (,9*) or 112. overhead (*#2) T'* processing overhead> protocol( related (pac!et(based) Z chec!sum (byte(based) *arallel rites are available in the dis! C@ !bytes i2'2I draft ,C&P7 and i,CP7based 2ingle T'* connection ith a indo of2DC !bytes 1<A@ payload Z 1<@ overhead (,9*) or 112. overhead (*#2) T'* processing occurs in gate ays

9rame si1e (bytes)

T'* processing delays I&# rites

6ot applicable

I&# bloc!

*arallel rites are available in the dis! C@ !bytes 9ibre 'hannel *rotocol

*arallel rites are available in the dis! C@ !bytes 'ombination of 9' and I*

)$T-O (73AS$D SA) separation distance! ? to D??? !m. )ll the equipment collocated in the same office for ? !m, optical equipment&I* routers are placed every D? !m. Available bandwidth! 1 ,b&s Pac*et loss! 6egligible ,raming! ,9* for point(to(point optical $,$ $)C$S 1. E)chieving 0ire(2peed i2'2I *erformance,F )lacritech and 6ishan 2ystems tech. note, http>&& .alacritech.

22B

2. ). benner. 9iber 'hannel> ,igabit 'ommunication and I&# for 'omputer 6et or! $c ,ra 8ill , 1==C <. 9. 2chmidt. The 2'2I .us and Ide Interface *rotocols. )ddison 0esley, 1==B. @. -. 2atran and et al. i2'2I. In http>&&search.ietf.org D. T.'lar!, designing 2torage )rea 6et or!, )ddison 0esley.

22A

D$,$)D&)% A%A&)ST D$)&A? O, S$ @&C$ ATTAC(S! A )$T-O ( ,&?T$ &)% 3AS$D APP OAC" Arminder Singh ?ect#rer/ Trai Shatabdi %+%+S (halsa College/Amritsar+ g#rjit>;1gmail+com

A3ST ACT This paper considers a number of methods open to a malicious person ishing to cause denial of service to a victim computer system. This type of attac! is pertinent as it assaults the very fabric of e(commerceN interconnectivity. )n attac!er ishing to cause their victim to become inoperable or operate ith a degraded service subverts normal net or! operations. This paper proposes traffic filtering at the organisational boundary to provide a defence mechanism against denial of service attac!s. The advantages of this approach are that it is adaptable, portable, implementable, and requires little e"tra cost to the organisation. This paper introduces t o techniques for analy1ing this type of attac!. .ased on our analysis, a number of filtering rules are proposed to illustrate the breadth of defence that this approach can provide. It is also recognised that this approach ill be used in con+unction ith a number of other, non(computer defence mechanisms. 5+ &)T OD0CT&O) /enial of service is a si1eable security problem in our interconnected orld and contrary to some riters it is unli!ely to disappear J1=, 1@K. The '2I&9.I survey of 1=== found that <2I of the respondents detected denial of service attac!s directed against them J1DK. This is an increase of BI on the previous yearLs survey figure J=K. The cost of such an attac! to businesses is great, as as demonstrated in the 9ebruary 2??? attac!s on e(commerce ambassadors such as Hahoo and )ma1on. The cost to Hahoo alone as estimated at UD??,??? or more in lost advertising and e(commerce revenue J@, 1<K. $ore importantly the cost may be greater in consumer confidence terms. /enial of service is an e"isting problem and the aim of our research is to develop a methodology for countermeasures to this type of attac! that is applicable to todayGs Internet economy. This research uses e"isting techniques in a ne application. 9ire all technologies are traditionally used by an organisation to protect their informational and physical resources from e"ternal attac!s. The net or! filtering approach proposed by our research applies a similar control over data flo to specifically counter the denial of service problem. )daptability and portability are particular requirements of todayGs interconnected orld and are therefore important considerations for our approach. #ur analysis has led us to see that a primary defence against denial of service attac!s is to place net or! filtering to control the flo of traffic into our organisation. There are t o advantages for proposing filtering(based countermeasures to denial of service. 9irst, most organisations are structured such that they ill be employing some form of filtering at their net or! perimeter. Therefore, additional rule(sets can be easily updated on a regular basis.
22=

2econd, in the face of ne attac!s, no e"tra cost is incurred other than the time to implement the rules and for ongoing updates. )lso, this cost is further +ustified in the breadth of denial of service attac!s that can be defended against, both application(based and protocol(based. This paper presents a ne ay of using an e"isting net or! filtering mechanism such as fire alls to provide a cost(effective and adaptable defence specifically against denial of service attac!s. This paper is organised as follo s. 2ection 2 provides an overvie of the denial of service problem by presenting the breadth of attac! types. T o categori1ations of denial of service are introduced, application(based (e(mail) attac!s and protocol(based attac!s. 2ection < presents t o techniques for analysis. 2ection @ describes the net or! filtering approach to countermeasures. 9or the purpose of illustration, these are divided into inbound and outbound filterin rules hich constitute our policies. 2ection D considers requirements that compliment the filtering countermeasures. 2ection C presents conclusions and recommendations. >+ O@$ @&$- O, D$)&A? O, S$ @&C$ To understand the mechanisms for countering denial of service attac!s, it is first necessary to define and e"plore the nature of these types of attac!s. /enial of service attac!s are hen a legal net or! user is prevented from performing his&her functions or prevents other users from performing their functions J1?K. This definition does not touch on the sub+ect of intent. /enial of service can occur both by deliberate acts and by accidental subversion of normal net or! services. /enial of service is simply a question of supply and demandN an attac!er demands more resources than the victim is able to supply. This is achieved by either sending large amounts of data to the victim, over helming the ma+ority of available resources, or many small requests that over helm the target by having to deal ith many small tas!s. )nalysis conducted so far has identified that there are t o broad genres of denial of service attac!N application(based attac!s and protocol(based attac!s. >+5 Application based attac*s )pplication(based denial of service attac!s are the simplest, often launched by e(mail. $ost organi1ations today use e(mail for the rapid dissemination of information and A1.CI of Internet users utilise this service.2 To place this use in perspective, in 1==A, the 42 *ostal 2ervice delivered 1?1 billion pieces of mail, and e(mail delivery for the same year is estimated at @ trillion J1AK. The very robustness of the e(mail infrastructure ensures that these types of denial of service attac!s succeed J1K. There are a number of attac! scenarios that e"ploit e(mail message passing mechanisms. 9or e"ample, Mchain bombsM e"ploit message handling J1K. ) large number of e(mails are directed at the $essage Transfer )gent 1 ($T)), hich attempts to deal ith the messages that it has received. It passes as many messages as it is able to handle into its outbound queue for $T)2 before it crashes o ing to the large amount of data. $T)2 receives the traffic from $T)1 and attempts to deal ith the messages until it too crashes o ing to the large amount of traffic. This process continues for all $T)s.)nother e(mail based denial of service method is message amplification. This is
2

+,-ail is the second -ost popular $nternet activit next to Web surfing or browsing#

2<?

especially pertinent to a large organisation such as an academic institution. < ) message is sent to all users ithin a system. The e(mail server receives the message and then attempts to deliver it to all those named. This ould not be a problem if all the recipients ere located on separate servers. 8o ever, in an institution that has many thousands of e(mail accounts, such as a university or global corporation, a large amount of messages are stored on one server. 9or e"ample, as illustrated belo , person A sends an e(mail to all university e(mail system users, of hich there are 2?,???. The mail server receives the e(mail and then for ards message * to each of the recipientsL accounts. Thus, message * is duplicated 2?,??? times and held on the server until the destination accounts are accessed. *erson ( reads the message, and replies to all recipients of the message. "essage ., the reply, is sent to the server and the server dutifully delivers message . to all 2?,??? recipients. )s e can see, @?,??? messages are created out of +ust t o messages. )s accounts are accessed, the server attempts to deliver message * and message . to recipientsL des!tops. Therefore, not only are server resources needlessly asted ith +ust t o messages, but also the net or! no has to deal ith @?,??? messages, potentially bringing net or! resources to a standstill. This attac! could be launched both accidentally or deliberately. E(ail Ser$er

.ccount 1 .ccount 2 .ccount 3

Person AMessage 1

.ccount 4 .ccount 5 .ccount 6

.ccount n

,ig 5! An ill#stration of 5 email message being amplified by a central email server+ The sit#ation wo#ld be compo#nded if an acco#nt replied to all recipients of the message/ placing a great strain on the server and networ* reso#rces in trying to deal with j#st two messages+ >+> Protocol based attac*s )t the other end of the denial of service spectrum are protocol(based attac!s. These attac! mechanisms subvert normal net or!ing protocols in order to cause availability problems in their intended targets. The T'*&I* suite, hich underpins todayGs Internet, as never intended to offer comprehensive, scaleable security mechanisms J=K. This, combined ith the e"plosive gro th of the Internet ithin businesses, and the lac! of security a areness sho n by organisations, has created a dangerous Ecoc!tailF that an attac!er may e"ploit. 9or e"ample, one attac! method that subverts Internet protocol architectural fla s is M2H6 floodingM. This attac! method is based on e"ploiting the three( ay handsha!e in T'*, as illustrated belo . This handsha!e guarantees that both communicating parties, the source and
3

.s occurred at /iverpool 0ohn 'oores 1niversit in .pril 2&&&#

2<1

destination machines, are ready to transfer data and allo s both sides of the connection to agree initial sequence numbers JCK. The three( ay handsha!e protocol or!s as follo s. =ost * chooses a sequence number, x, and sends a connection re>uest transport protocol data unit containing x to host .. =ost . replies ith a connection accepted transport protocol data unit ac!no ledging x and announcing its o n initial sequence number, . 9inally, host * ac!no ledges host .Ls choice of an initial sequence number ithin the first data unit that it sends J1BK.

Host 1# 3onnection 1 4e5uest 2ie 6se5 7 x) 2# .c8nowledge 6se5 7 y9 .3: 7 x) 3# ;ata 6se5 7 x9 .3: 7 y)

Host 2

,ig >! The TCP three7way handsha*e+ This handsha!e is necessary as the client and server numbers are not tied to a universally available cloc!, and the t o hosts may have different mechanisms for pic!ing authenticating numbers in the handsha!e J11K. M2H6 floodingM subverts this handsha!e by not allo ing it to ta!e place correctly. In particular, the T'* )'5 flag is never returned causing host 2 to ait in a half(open state J=K. %esources allocated to the bogus connection are tied up until the server times out and resets the connection request, thus preventing legitimate connection requests.)nother e"ample of a normal net or! protocol that can be subverted for malicious purposes is the Internet 'ontrol $essage *rotocol (I'$*). 9or e"ample, a single pac!et can be sent to a broadcast net or! ith the address of an intended victim. $any systems may respond to the echo re>uest, causing a large amount of echo responses to be sent to the victim. #ther methods of I'$* e"ploitation include resetting e"isting connections by sending destination unreachable and time to live exceeded messages J2K. The above denial of service attac!s are by no means the only methods that can be employed by a malicious person. #ther methods include 4ser /atagram *rotocol (4/*) flooding, e"ploitation of specific operating system vulnerabilities, and Efinger bombsF. The situation is further complicated by the emergence of distributed denial of service (//o2) tools, such as EtrinooF, ETribe 9lood 6et or!F, EmstreamF, etc. These tools infiltrate legitimate systems to form attac! net or!s by over helming victimsG resources. In addition to the sheer volume of traffic that they can send to a victim, they can also alternate bet een and combine attac! methods, for e"ample launching 2H6 flood and 4/* floods in one attac! JBK.

2<2

B+ ATTAC( A)A?4S&S The number of denial of service options open to the attac!er therefore ma!es the provision of countermeasures a difficult process. 0ith anti(virus security, a program can be run that loo!s for unusual file patterns, hich are then chec!ed against a database of !no n viruses. If there is a match, it is assumed that there is a virus and the soft are deals ith it in the prescribed ay. 0e are not afforded such a lu"ury in defending against denial of service. There are no such unusual patterns, +ust a subversion of normal net or! operations. ) range of solutions to denial of service attac!s have been posited and ta!e t o forms. #n the one hand are the solutions that attempt to provide countermeasures to a broad range of attac! types by tac!ling higher(level issues. These range from resource sharing servers that are positioned at the Internet 2ervice *rovider, to probabilistically mar!ing pac!ets as they traverse the Internet to provide trace bac! of attac! pac!ets J1=, 1DK. #n the other hand is a range of solutions to specific issues such as T'* 2H6 flooding, hich do not attempt to address the breadth of the denial of service problem J1C, 11K. 8o ever, hat these t o approaches have in common is that they do not address the short(term needs of organi1ations ishing to conduct business over the Internet. In order to develop countermeasures to a range of denial of service attac!s, it has been necessary to develop a methodology for loo!ing at the problem. 0e propose t o approaches for analy1ing commonalities bet een the ide(ranging attac! types. The first approaches has been to develop a method for mapping attac!s at various levels of net or!. 9our levels of net or! are mapped outN or!station, local area net or! (;)6), ide area net or! (0)6), and Internet. 7arious attac!s are placed onto this net or! mapping based on the target level of the attac!. 0hilst organi1ations may use all of these net or! levels, e have been able to identify ho attac!s are targeted at particular levels to cause denial of service. 9or e"ample, a subscription list attac!, here a victim is signed up to a large number of ne sgroups to increase e(mail traffic to that address, is primarily a threat at the or!station level. It may have little effect at the 0)6 level, e"cept for increased traffic over a net or! or through particular mail servers. )t the ;)6 level, particular attac!s such as 4/* flood or e(mail amplification are a concern. )t the other end of the net or! mapping, attac!s that change routing tables to cause denial of service are primarily a concern of 0)6 and Internet levels. This analysis allo s us to characteri1e the various denial of service attac!s into t o broad categories of effect in order to develop countermeasures. The or!station to organi1ational 0)6 levels are particularly threatened by Ebottlenec!F attac!s, i.e. there is a particular cho!e point on the net or! that is targeted by the attac!er. )t the 0)6 and Internet levels, EinfrastructureF attac!s are more pertinent, for e"ample, the changing of /62 routing tables J<K. The Ebottlenec!F attac!s are of more interest because e can identify the point at hich traffic enters or leaves a net or!, and have some control over that traffic, hilst EinfrastructureF attac!s are outside the organi1ational control.This analysis has allo ed us to identify here countermeasures that address the breadth of attac!s can be placed, i.e. at the perimeter of the organi1ation to form an )rea of 'ontrol ()o'). 8o ever, it does not identify hat those countermeasures should be. ) second analysis approach has been developed to loo! at this issue. The second approach has been to compile a catalogue of denial of service attac!s. 4sed in con+unction ith the net or! mapping, this catalogue has enabled us to see a finer granularity of attac! effects and similarities bet een countermeasures that can be adopted
2<<

into a proposed methodology. 9or e"ample, 2H6 flood attac!s effect the ;)6 and 0)6 levels using the net or! mapping analysis. 8o ever, their true target is the server buffer space hich is consumed by half(open state connections J1C, 11K. )lso, e can see the similarities bet een 4/* flooding and I'$* attac!s that despite using different protocols, both target net or! band idth. D+ )$T-O ( ,&?T$ &)% The t o approaches described in 2ection < have sho n that e"isting net or! filtering mechanisms such as fire alls can be employed to defend against denial of service attac!s. 8o ever, the issue of ho to use such a filtering mechanism to prevent denial of service attac!s remains unans ered. In this section, e aim to develop a ne ay of using an e"isting net or! filtering mechanism for cost(effective defence against denial of service attac!s.There are t o advantages for proposing filtering(based countermeasures to denial of service.@ 9irst, most organisations are structured such that they ill be employing some form of filtering at their net or! perimeter in the form of a fire all. $any large organisations employ fire alls to protect themselves from ould(be attac!ers, and they fulfill the role of isolating an organisation from the rest of the orld JAK. Therefore, additional rules can be adopted quic!ly and easily updated on a regular basis. 2econd, no e"tra cost is incurred other than the time to implement the rules and for ongoing updates. The cost is further +ustified in the breadth of denial of service attac!s that can be defended against. 9iltering rules can be implemented at a single point +ust as easily for e(mail based attac!s as for protocol(based attac!s.The role of the filter, as illustrated belo , is to maintain control over the traffic that enters and leaves the )o'. )ll traffic must pass through the filter in order that rules of acceptable traffic may be applied. D It must be noted, ho ever that it ould be futile for an organisation to employ this method of defence if users ere able to circumvent this requirement. 9or e"ample, it ould be unacceptable for users to have their o n private Internet connections bypassing this central gate ay J12K

F"L)ER

Ao 4 2he rule sets presented in this paper will for- the basis of a larger s C 5 .cceptable traffic is predefined b the organisational securit polic #
2<@

External
ste- being developed as part of ongoing research#

Network s

,ig >! &ll#stration of the filtering system+ The filter sits on the perimeter of the AoC and filters traffic to and from eHternal networ*s/ maintaining control of what traffic is allowed to enter or leave the AoC networ*s+ D+5 &nbo#nd filtering )nother method of e(mail attac! is to send large files or data to the victim. Their computer must process these files or data prior to collecting any further messages. If the document is sufficiently large, it causes the recipientGs machine to be inoperable for some time hile the machine is do nloading the e(mail from the $T). This is assuming that the victim is able to complete the do nload ithout crashing. If the user attempts to rectify this by rebooting ithout the completion of the do nload, the ne"t time that they access their e(mail, the $T) ill again attempt to pass the attac! e(mail. The victim ill have to as! system administrators to delete the e(mail from the $T). 2etting a si1e limit to all incoming traffic can circumvent this issue.C 9or e"ample, the security policy could be that e(mails are limited to a ma"imum of D?? 5b, as illustrated in the follo ing filtering rule> &if message si1e P ^D??5b &then message P valid &if message si1e P fD??5b &then message P not valid &if inbound message P valid &then accept message &if inbound message valid &then $T) re+ect message )s e can see, valid messages ould pass unhindered through the $T) filter. The inbound message filter ill accept a message under D??5b in si1e but ill re+ect any message over that si1e. If the organi1ational $T) ere to pass the message, it ould cause the recipientLs machine to crash denying resource availability. )n inbound filter can also defend against protocol(based attac!s. 7arious denial of service tools attac! e"ploit net or!ing vulnerabilities in particular operating systems. 9or e"ample, E0innu!eF, a tool that can be found easily on the Internet e"ploits a vulnerability in $icrosoft #perating 2ystems by sending out of bound data to port 1<=. The effect is to crash vulnerable victim machines.B ) filtering rule ould ta!e the follo ing format>
6 7

<o-e e,-ail software now allows the user to set the -axi-u- si=e of inco-ing -essages# 2his progra- has successfull crashed -achines using >2 4#& in lab experi-ents9 but the proble- has been rectified in -achines running Windows 2&&&#

2<D

&if destination port P port 1<= & here port 1<= dprescribed portse &then traffic P valid &if destination port P port 1<= & here port 1<= dprescribed portse &then traffic valid &if traffic P valid &then accept traffic &if traffic valid &then do not accept traffic This rule set can be e"panded to incorporate a number of vulnerable ports and to defend against a number of //o2 tools. 9or e"ample, remote control of a EtrinooF master by the attac!er is accomplished via a T'* connection to port 2BCCD&tcp JBK. .y instigating a filter rule that inbound traffic to that port is not allo ed, the attac!er is unable to control the master and launch an attac!. This rule set is illustrated by the follo ing> &if destination port P port 2BCCD&tcp & here port 2BCCD&tcp dprescribed portse &then traffic P valid &if destination port P port 2BCCD&tcp & here port 2BCCD&tcp dprescribed portse &then traffic valid &if traffic P valid &then accept traffic &if traffic valid &then do not accept traffic 9urther do n the chain of the //o2 attac! net or! sit the daemons. These utili1e particular ports for communications bet een the net or!s of attac!ing computers. 9or e"ample, the EtrinooF program utilises 4/* traffic to port 2B@@@&udp for communications bet een the EtrinooF master and EtrinooF daemons JBK. .y specifying the port to be bloc!ed and placing it ithin the prescribed ports set, inbound traffic from the attac!ing masters to any machines that have been infiltrated to act as a EtrinooF daemon can be bloc!ed. Therefore, the follo ing filtering rule can be applied> &if destination port P port 2B@@@&udp & here port 2B@@@&udp dprescribed portse &then traffic P valid &if destination port P port 2B@@@&udp & here port 2B@@@&udp dprescribed portse &then traffic valid &if traffic P valid
2<C

&then accept traffic &if traffic valid &then do not accept traffic )s e can see, a database of prescribed ports can be built up hich can be used to bloc! communications amongst the EtrinooF attac! net or!. The advantage of this approach is that traffic targeted at these particular ports can be logged and audited, alerting system administrators to the possibility of //o2 tools residing on the internal net or!. The generic rule set ould loo! as follo s> &if pac!et P 4/* &or pac!et P T'* &and pac!et destination dprescribed portse &then message P valid &if pac!et P 4/* &or pac!et P T'* &and pac!et destination dprescribed portse &then message valid &if message P valid &then accept message &if message valid &then do not accept message B+> O#tbo#nd filtering The principal roles of the outbound filter are to detect the passing of traffic ith spoofed I* addresses and the detection of hidden //o2 tools residing ithin the organisationGs system. #utbound traffic undergoes simple rule(based filtering according to the organisationGs security policy, ensuring that only legitimate traffic is passed. This satisfies current recommendations that system administrators should not allo their net or!s to be used to launch an attac!, as suggested by organisations such as 'E%T JDK. 9or e"ample, the follo ing rule can be applied for the detection of spoofed I* addresses> &if I* address of outbound traffic P 2?=.1AD.1<1.12= & here I* address 2?=.1AD.1<1.12= dvalid I* addresse &then traffic P valid &if I* address P 2?=.1AD.1<1.12= & here I* address 2?=.1AD.1<1.12= dvalid I* addresse &then traffic valid &if traffic P valid &then pass traffic &if traffic valid &then do not pass traffic
2<B

#nly traffic ith source I* addresses belonging to the set dvalid I* addresse is allo ed to pass through the filter. In the above rule set, traffic ith the I* address 2?=.1AD.1<1.12= is attempting to pass through the outbound filter. 0ith this rule set, a number of addresses have been earlier declared as valid. Traffic containing source I* addresses that do not belong to the previously declared set of valid addresses are declared not valid. C+ COMP?&M$)T&)% T"$ ,&?T$ &)% CO0)T$ M$AS0 $S The net or! filter approach provides a strong defence against the threat of denial of service, but there are other mechanisms outside the scope of the filter itself that should be adopted by the organi1ational security policy. 9irst, the filtering rules ill only be as good as their updates. It is necessary for the organi1ation to !eep up ith security issues so that changes may be made to the filtering rules after they are implemented. This ill require human resources and an organi1ation must ensure that these resources are supplied. 2econd, the organi1ation must be a are of the resources it is trying to protect. These mechanisms include the prioriti1ing of the organi1ational computer and information resources. 9inally, security a areness training should be given at all levels of the organi1ation. %esponsibility for a ide range of security issues often lies ith the users of a system. G+ CO)C?0S&O)S A)D ,0T0 $ -O ( The denial of service problem is one that is unli!ely to disappear ithout a redesign of the fundamentals of the T'*&I* suite. Therefore, an organi1ation in an increasingly interconnected global environment requires defences against this type of attac!. This paper has presented a ne ay of using an e"isting net or! filtering mechanism such as fire alls to provide countermeasures specifically to the denial of service problem. #ur analysis and literature survey have led us to see that a primary defence against denial of service attac!s is to place net or! filtering to control the flo of traffic into our )o'. )s many organi1ations ill already have some traffic regulation capacity in the form of fire alls, the cost of implementing these countermeasures to a broad range of attac! types is not significant. ) number of security policies based on our research have been presented to demonstrate the adaptability of this approach in the face of a broad spectrum of denial of service attac!s. 9uture or! includes the implementation of the proposed approach to demonstrate its applicability and effectiveness in defending against these attac!s. $,$ $)C$S 1. .ass, T., 9reyre, )., ,ruber, /., 3 0att, ,. (1==A), LE(mail .ombs and 'ountermeasures> 'yber )ttac!s and .rand IntegrityL, $000 Network, 5>, (2), pp. 1?(1B, IEEE 'omputer 2ociety, 6e Hor!, 42) 2. .ellovin, 2. $. (1=A=), L2ecurity *roblems in the T'*&I* *rotocol 2uiteL %eprinted from !omputer !ommunications (eview, 5:, (2), pp. <2(@A, http>&& .+a.net&'E%T&.ellovin& T'*(I*Q2ecurityQ*roblems.html <. .ishop, $., 'heung, 2., 3 0ee, '. (1==B), EThe Threat from the 6etF, IEEE 2pectrum, BD, (A), pp.DC(C<
2<A

@. .rodie, I. 3 8ammersley, .. (2???), The Times, 9ebruary = 2???, p. 1B D. 'E%T 'oordination 'enter (1===), L%esults of the /istributed(2ystems Intruder Tools 0or!shop *ittsburgh, *ennsylvania 42) 6ovember 2(@, 1===L, 2oft are Engineering Institute 'arnegie $ellon 4niversity, http>&& .cert.org&reports&dsitQ or!shop.pdf C. 'omer, /. E. (1==D), $nternetworking with T!)5$) -olume $? )rinciples, )rotocols, and Architecture 8all International, 42) B. /ittrich, /. (1===), LThe /o2 *ro+ectLs MtrinooM /istributed /enial of 2ervice )ttac! ToolL, http>&&staff. ashington.edu&dittrich&misc&trinoo.analysis A. ,ilmore, '., 5ormann, /., 3 %ubin, ). /. (1===), L2ecure %emote )ccess to an Internal 0eb 2erverL 5B, (C), pp. <1(<B, IEEE 'omputer 2ociety, 6e Hor!, 42) =. 8arris, .. 3 8unt, %. (1===), LT'*&I* 2ecurity Threats and )ttac! $ethodsL, !omputer !ommunicati A=B, Elesevier 2cience, 6etherlands 1?. $uftic, 2., *atel. )., 2anders, *., 'olon, %., 8ei+nsdi+!, -., 3 *ul!!inen, 4. (1==<), 'istributed # stems, -ohn 0iley 3 2ons, .ath, ,reat .ritain 11. $utaf, *. (1===), S/efending )gainst a /enial(of(2ervice )ttac! on T'*G, %)I/ 1===, http>&& .cerias.purdue.edu&raid&proceedings&1===&more&mutaf.pdf 12. *fleeger, '. *. (1==B), #ecurit in !omputing, 2nd Edition, *rentice 8all International, 4pper 2addle % 1<. *roctor, *. E. (2??1), The )ractical $ntrusion 'etection =andbook, *rentice 8all International, 4pper 2addle %iver, 6-, 42) 1@. %utstein, '., .utt -r., -. ;., 3 8o e, '. /. (2???), L9orrester .rief R 8ac!er )ttac!s> )inGt 6uthinG to 2ee 8ereL, 9orrester %esearch, http>&& .forrester.com&E%&%esarch&.rief&?,1<1B,A==C,99.html 1D. 2avage, 2., 0etherall, /., 5arlin, )., 3 )nderson, T. (n.d.), L*ractical 6et or! 2upport for I* Tracebac!L, 4niversity of 0ashington Technical %eport 40('2E(??(?2(?1, http>&& .cs. ashington.edu&homes&savage&papers&40('2E(??(?2(?1.pdf 1C. 2chuba, '. ;., 5rsul, I. 7., 5uhn, $. ,., 2pafford, E. 8., 2undaram, )., 3 Tamboni, /. (1==B), S)nalysis of a /enial of 2ervice )ttac! on T'*G, IEEE 2ymposium on 2ecurity 3 *rivacy, #a!land, '), $ay 1==B, http>&& .mathcs.s+su.edu&faculty& 1B. schuba&pub&pubs&=B&ieeeQsecQpriv1A&main.ps 1A. Tanenbaum, ). 2.(1==C), !omputer Networks <rd ed., *rentice(8all International Edition, 42) 1=. 4';) 'enter for 'ommunication *olicy (2???), SThe 4';) Internet %eport 2urveying the /igital 9utureG, http>&& .ccp.ucla.edu 2?. Han, -., Early, 2., 3 )nderson, %. %. (n.d.), SThe Veno2ervice R ) /istributed /efeat for /istributed /enial of 2erviceG, http>&& .cl.cam.ac.u!&ftp&users&r+a1@&"eno.pdf

2<=

S$C0 &T4 A)D P &@AC4 &) -& $?$SS ?A) Prof+ "ardev (a#r Assistant Professor/ Trai Shatabdi %+%+S (halsa College/Amritsar A3ST ACT 0ireless local area net or!s ( ireless ;)6s, or 0;)6s) are metamorphosing the landscape of computer net or!ing. The use of mobile computing devices, such as laptops and personal digital assistants, coupled ith the demand for continual net or! connections ithout having to Mplug in,M are driving the adoption of enterprise 0;)6s. 6et or! managers are using 0;)6s to facilitate net or! moves, add(ons and changes. In addition, the inherent fle"ibility of 0;)6s overcomes limitations created by older buildings, leased spaces, or temporary or! areas.This topic is not only the most fundamental Internet *rivacy and 2ecurity topic , but also arguably the most technical and comple" one. 0hen e thin! about computer security, net or!ing security ill surely be at the top of our list of considerations, as so many threats to our privacy and security are net or! borne. 2o this is a little effort in laying out an advice for the future technocrats in ma!ing sure of their ideas and to give them the information hich they can use it in a right ay.

This paper not only furnishes the details about 0ireless ;)6s but also besto s an abundant number of methods in hich the security of these 0;)6s can be breached. It also contributes a myriad number of ays in hich one can th art the potential assault on the 0;)6s net or!. ($4-O DS! 0ireless ;)6, 2ecurity, 8ac!ing, )ccess points. &)T OD0CT&O) TO -& $?$SS ?A) 8igh(speed ireless ;)6s can provide the benefits of net or! connectivity ithout the restrictions of being tied to a location or tethered by ires. 0ireless connections can e"tend or replace a ired infrastructure in situations here it is costly or prohibitive to lay cables. *ortable access to ireless net or!s can be achieved using laptop computers and ireless 6I's. This
2@?

enables the user to travel to various locations and still have access to their net or!ed data. 0ithout ireless access, the user ould have to carry clumsy cabling and find a net or! tap to plug into. 9or businesses, ireless net or!s give more mobility and fle"ibility by allo ing employees to stay connected to the Internet and to the net or! as they roam. .eyond the corporate campus, access to the Internet and even corporate sites could be made available through public ireless Ehot spots.F net or!s. )irports, restaurants, rail stations, and common areas throughout cities can be provisioned to provide this service.The IEEE has produced the series of standards referred to as A?2.V, hich encompassed ;)6s, $)6s and *)6s. The IEEE A?2 is confined to standardi1ing processes and procedures that ta!e place in the bottom t o layers of the #2I %eference $odel ( The $edia )ccess 'ontrol ($)') or lin! layer and the *hysical layer. The committee of IEEE A?2 standards is currently divided up into or!ing groups numbered A?2.1 through A?2.1B. The figure sho s ho the A?2.1" ireless security process is supposed to or!. The original standard, hich is currently used to set up 0ireless 6et or!s, is the IEEE A?2.11 standard. 6o adays, there are four types of 0ireless net or!s, ranging from slo and ine"pensive to fast and e"pensive. They are> 0E') (0ireless Ethernet 'ompatibility )lliance) (0I(9i, .luetooth, Ir/) (Infrared /irect )ccess) and 8ome%9. T AD&T&O)A? -?A) S$C0 &T4 )s ith other net or!s, security for 0;)6s focuses on access control and privacy. %obust 0;)6 access control prevents unauthori1ed users from communicating through access points, the 0;)6 endpoints on the Ethernet net or! that lin! 0;)6 clients to the net or!. 2trong 0;)6 access control ensures that legitimate clients associate ith trusted, rather than MrogueM access points. 0;)6 privacy ensures that only the intended audience understands the transmitted data. The privacy of transmitted 0;)6 data is protected only hen that data is encrypted ith a !ey that can be used only by the intended recipient of the data.

,ig >
2@1

,ig B Traditional 0;)6 security includes the use of 2ervice 2et Identifiers (22I/s), open or shared( !ey authentication, static 0E* !eys and optional $edia )ccess 'ontrol ($)') authentication. This combination offers a rudimentary level of access control and privacy, but each element can be compromised. ATTAC(&)% A -?A) )$T-O ( In this section, the various methods in hich one can get illegal access to a 0;)6 are e"amined. The tools hich are available freely on the internet and are being used for attac!ing a 0;)6 are as follo s> 6ets tumbler, 5ismet, 0ellenreiter, T8'(%4T, Ethereal, 0E*'rac!, )ir2nort and 8ost )*. The different types of attac!s are as e"plained belo > 5+ $avesdropping> In the ireless net or!, eavesdropping is the most significant threat because the attac!er can intercept the transmission over the air from a distance a ay from the premise of the company. >+ Tampering! The attac!er can modify the content of the intercepted pac!ets from the ireless net or! and this result in a loss of data integrity. B+ 0tili'ing Antennas! To connect ith ireless ;)6s from distances greater than a fe hundred feet, sophisticated hac!ers use long(range antennas that are either commercially available or home built and can pic! up A?2.11 signals from up to 2,??? feet a ay. D+ -ar Driving! 0ar driving is simply driving around in a car to discover unprotected ireless ;)6s. 0indo s(based free are tools probe the air aves in search of access points that broadcast their 22I/s and offer easy ays to find open net or!s. C+ Malicio#s Association! ) hac!er begins this attac! by using free are 8ost)* to convert the attac!ing station to operate as a functioning access point. )s the victimLs station broadcasts a probe to associate ith an access point, the hac!erLs ne malicious access point responds to the victimLs request for association and begins a connection bet een the t o. )fter providing an I* address to the victimLs or!station (if needed), the malicious access point can begin its attac!s. The hac!er ( acting as an access point ( can use a ealth of available hac!ing tools available that have been tested and proven in a ireless environment. )t this time, the hac!er can e"ploit all vulnerabilities on the victimLs laptop, hich can
2@2

include installing the 8ost)* firm are or any other laptop configuration or programmatic changes. The malicious association attac! sho s that ireless ;)6s are sub+ect to diversion and stations do not al ays !no hich net or! or access point they connect to. Even ireless ;)6s that have deployed 7*6s (7irtual *rivate 6et or!) are vulnerable to malicious association.. G+ &nterference and .amming! ) simple +amming transmitter can ma!e communications impossible. 9or e"ample, consistently hammering an access point ith access requests, hether successful or not, ill eventually e"haust its available radio frequency spectrum and !noc! it off the net or!. ;+ 3r#te7,orce attac*! ) brute(force net or! attac! is one in hich the intruder attempts to derive a 0E* !ey by trying one value at a time. 9or standard 12A(bit 0E*, this ould require trying a ma"imum of 21?@ different !eys. F+ Mac spoofingL &dentity theft! $any enterprises secure their ireless ;)6 ith authentication based on an authori1ed list of $)' addresses. )ny user can easily change the $)' address of a station or access point to change its LidentityL and defeat $)' address( based authentication. 2oft are tools such as 5ismet or Ethereal are available for hac!ers to easily pic! off the $)' addresses of an authori1ed user. The hac!er can then assume the identity of that user by asserting the stolen $)' address as his o n. :+ Man7in7the7middle attac*! To begin this attac!, the hac!er passively observes the station as it connects to the access point, and the hac!er collects the authentication information, including the username, server name, client and server I* address, the I/ used to compute the response, and the challenge and associate response. The hac!er then tries to associate ith the access point by sending a request that appears to be coming from the authenticated station. The access point sends the 7*6 challenge to the authenticated station, hich computes the required authentic response, and sends the response to the access point. The hac!er observes the valid response. The hac!er then acts as the access point in presenting a challenge to the authori1ed station. The station computes the appropriate response, hich is sent to the access point. The access point then sends the station a success pac!et ith an imbedded sequence number. .oth are captured by the hac!er. )fter capturing all this data, the hac!er then has hat he needs to complete the attac! and defeat the 7*6. The hac!er sends a spoofed reply, ith large sequence number, hich bumps the victimLs station off the net or! and !eeps it from re(associating (i.e. ?"??ffffff). The hac!er then enters the net or! as the authori1ed station. D$)&A?7O,7S$ @&C$ ATTAC( Every net or! and security manager fears the do ntime and loss of productivity from a crippling /enial(of(2ervice attac!. .ecause A?2.11b ireless ;)6s operate on the unregulated 2.@,81 radio frequency that is also used by micro ave ovens, baby monitors, and cordless phones, commonly available consumer products can give hac!ers the tools for a simple and e"tremely damaging /o2 attac!. 4nleashing large amounts of noise from these other devices can +am the air aves and shut do n a ireless ;)6. 8ac!ers can launch more sophisticated /o2
2@<

attaIn this section, the various methods in hich one can get illegal access to a 0;)6 are e"amined. The tools hich are available freely on the internet and are being used for attac!ing a 0;)6 are as follo s> 6et2tumbler, 5ismet, 0ellenreiter, T8'(%4T, Ethereal, 0E*'rac!, )ir2nort and 8ost)*. MA(&)% A -?A) MO $ S$C0 $ )s todayGs companies e"tend their ireless capabilities across their entire enterprise, several issues come to the forefront, not the least of hich is the security of their proprietary data. /espite the comple"ity of the problem, an enterprise can underta!e some relatively simple measures to th art hac!ers and maintain the integrity of their ireless net or!. There are at least ten ays in hich e can prevent malicious attac!s on a 0;)6 hich are as described belo . 1. Discovery and Mitigation of og#e -?A)s and @#lnerabilities > The basis for all 0;)6 security should start by understanding the environment in hich your 0;)6 operates.4nauthori1ed MrogueM 0;)6s (( including access points, soft access points (laptops acting as access points), user stations, ireless bar code scanners and printers (( represent one of the biggest threats to enterprise net or! security by creating an open entry point to the enterprise net or! that bypasses all e"isting security measures..ecause a simple 0;)6 can be easily installed by attaching a UD? access point to a ired net or! and a U@? 0;)6 card to a laptop, employees are deploying unauthori1ed 0;)6s even hen IT departments are slo to adopt the ne technology or even opposed to it. These rogue access points generally lac! standard security and thus circumvent an enterpriseLs investment in net or! security. Insecure ireless user stations such as laptops pose an even greater ris! to the security of the enterprise net or! than rogue access points. The default configuration of these devices offer little security and can be easily misconfigured. Intruders can use any insecure ireless station as a launch pad to breach the net or!. The same insecurity can come from net or! vulnerabilities originating from improperly configured 0;)6s. 6eighboring 0;)6s located in the same vicinity as your 0;)6 also pose ris!s of the neighboring stations accessing your net or! and interfering on ireless channels. 9ree are, such as 6et2tumbler and 5ismet, and other commercial scanners can survey the air aves for rogue access points and some net or! vulnerabilities. ) time(consuming effort, this process requires a net or! administrator to physically al! through the 0;)6 coverage area loo!ing for ireless data and is limited in effectiveness because it only samples the air aves for e"isting threats. 6e rogue access points and other vulnerabilities can arise after a scan and ill not be detected until the ne"t time a net or! administrator surveys the net or!. -ohn ,irard, the leading authority in ireless security at ,artner Inc., stated at a security conference in Europe that the least effective ay to achieving this is to buy a handheld MsnifferM and patrol the perimeter of the organi1ationLs net or!. )ccording to ireless security e"perts, discovery of rogue access points, stations and vulnerabilities is best accomplished ith 2@&B monitoring of the 0;)6. 'ontinuous monitoring ill identify
2@@

2.

<.

hen and here the rogue first appeared, ho it connected to, ho much data as e"changed and the direction of traffic in real time. ,irard further commented that the most secure method is to install a separate set of ireless intrusion(detection sensors. ?oc* Down All Access Points and Devices > The ne"t step of 0;)6 security involves perimeter control for the 0;)6. Each ireless(equipped laptop should be secured by deploying a personal agent that can alert the enterprise and user of all security vulnerabilities and enforce conformance to enterprise policies. #rgani1ations should deploy enterprise(class access points that offer advanced security and management capabilities. Enterprises should change the default 2ervice 2et Identifiers, hich are essentially the names of each access point. 'isco access points come ith the default 22I/ of Mtsunami,M ;in!sys defaults to Mlin!sys,M and both Intel and 2ymbol access points default to M1?1.M These default 22I/s alert hac!ers to vulnerable 0;)6s. The 22I/s should be changed to names that are meaningless to outsiders. )n 22I/ of M'E# #fficeM or MEast 'ash %egisterM only calls attention to valuable information that a hac!er ould li!e to get into. Enterprises should also configure access points to disable the broadcast mode here the access point constantly broadcasts its 22I/ as a beacon in search for stations ith hich to connect. .y turning this default feature off, stations must !no the 22I/ in order to connect to the access point. $ost enterprise(class access points allo you to limit hich stations can connect to it based on filtering of media access control addresses of authori1ed stations. 0hile this is not foolproof, $)' address filtering provides basic control over hich stations can connect to your net or!. ;arger enterprises ith more comple" 0;)6s that allo hundreds of stations to roam bet een access points may require more comple" filtering from remote authentication dial(in service (%)/I42) servers. To eliminate the threat of intruders connecting to your 0;)6 from the par!ing lot or the floor above you here connection speeds ill be greatly reduced, access points should be configured to not allo the slo er connection speeds. $ncryption and A#thentication 77 @P) > Encryption and authentication provide the core of security for 0;)6s. 8o ever, fail(proof encryption and authentication standards have yet to be implemented. In 2??1, researchers and hac!ers demonstrated their ability to crac! 0ired Equivalency *olicy (0E*), the standard encryption for A?2.11 0;)6s. 2oon after, hac!ers published free are tools, such as 0E*'rac!, that allo anyone to crac! the encryption after observing enough traffic over the net or! to figure out the encryption M!ey.M )fter reports sho ed the vulnerability of 0E* and standard authentication, many enterprises ere discouraged from implementing 0E* into their 0;)6 deployments, hich left their net or!s totally e"posed. .ecause these encryption and authentication standards are vulnerable, stronger encryption and authentication methods should be deployed to more completely secure a 0;)6 ith ireless virtual private net or!s and %)/I42 servers. 7*6s can employ strong authentication and encryption mechanisms bet een the access points and the net or!, and %)/I42
2@D

@.

systems can be used to manage authentication, accounting and access to net or! resources.0hile 7*6s are touted as a secure solution for 0;)6s, one( ay authentication 7*6s are still vulnerable to e"ploitation. /eployment of 0;)6s in large organi1ations can create a nightmare of distributing and maintaining client soft are to all clients. #ne( ay authentication 7*6s are also vulnerable to man(in(the(middle attac!s and a number of other !no n attac!s. $utual authentication ireless 7*6s offer strong authentication and overcome ea!nesses in 0E*. /espite these vulnerabilities, encryption and authentication remain essential elements of 0;)6 security. 2et and Enforce 0;)6 *olicies > Every enterprise net or! needs a policy for usage and security. 0;)6s are no different. 0hile policies ill vary based on individual security and management requirements of each 0;)6, a thorough policy (( and enforcement of the policy (( can protect an enterprise from unnecessary security breaches and performance degradation. 0;)6 policies should begin ith the basics of forbidding unauthori1ed access points and ad hoc net or!s that can circumvent net or! security. .ecause many security features, such as the use of 0E* or 7*6s and open broadcast of 22I/s, are controlled on the access points and stations, policies should be in place to forbid the reconfiguration of access points and 0;)6 cards to alter these features.0;)6 security is greatly increased ith policies that limit 0;)6 traffic to operate on set channels, at connection speeds of D.D$bit&sec. and 11$bit&sec., and only during select hours. .y establishing a set channel for each access point, all traffic on the other channels can be identified as suspicious activities. ) policy that all stations connect at the higher speeds protects a 0;)6 from intruders in the par!ing lot or neighboring office ho are li!ely too far a ay to connect at D.D$bit&sec. and 11$bit&sec. ) policy that limits 0;)6 traffic to select hours of operation protects a net or! from late(night attac!s of an intruder in the par!ing lot connecting to the net or! or an unscrupulous employee sending sensitive files from the ired net or! to a ireless net or! hile no one else is around. )lthough policies are necessary, they can be useless paper eights ithout enforcement. 2imilar to the effective discovery of net or! vulnerabilities, policy enforcement requires 2@&B monitoring of a 0;)6.

2@C

&)T 0S&O) D$T$CT&O) A)D P OT$CT&O) 2ecurity mangers rely on intrusion(detection and (protection to ensure that all components of 0;)6s are secure and protected from ireless threats and attac!s. 0hile many organi1ations have already deployed intrusion(detection systems for their ired net or!s, only a 0;)6(focused I/2 can protect your net or! from attac!s in the air aves before the traffic reaches the ired net or!. The most advanced ireless I/2 involves the real(time monitoring of A?2.11a&b&g protocols. .y continuous monitoring of all 0;)6 attac! signatures, protocol analysis, statistical anomaly and policy violations, organi1ations are able to detect attac!s against the 0;)6, including identity thefts from $)' spoofing, man(in(the(middle and denial( of(service attac!s, and anomalous traffic from unusual off(hours activity or large do nloads T"$ ?A4$ $D APP OAC" 0ith the cost of a ireless infrastructure decreasing ith each innovative development, it is becoming easier for people to use for or! and play any here they desire. It is also easier, ho ever, for hac!ers to e"ploit the vulnerabilities of 0;)6s to brea! into net or!s through ireless bac! doors rendering millions of dollars spent on fire alls and ired I/2 obsolete. 0ithout proper security, the integrity of valuable information can be compromised. ) layered approach is the only ay to fully secure a net or!. ;oc!ing do n devices and communication bet een devices is a startN ho ever, organi1ations must also have visibility into their ireless net or! to understand here breaches are occurring. To achieve this, 2@&B monitoring of the air space is required to enable safe deployment of 0;)6s. CO)C?0S&O) It is preferable to have only one access point and ma!e it run under a secure operating system li!e ;inu". It is better to occasionally boot up and trap sections of traffic to loo! for any attac! signatures. The user must connect via a 7*6, the access point is secured so it cannot be reset, 0E* is enabled, and access point is in a position that limits travel of the radio frequency outside of the premises. The traffic bet een the access point and the ;)6 passes through a fire all to help bloc! any possible /o2 attac!s on the 0;)6 from entering the enterprise ;)6. 0;)6s are definitely here to stay, but pose definite security issues hich can be minimi1ed+ $,$ $)C$S 1. 4nderstanding 0ireless ;)6 security ( /r. 2andeep 5. 2inghal. 2. 5no n vulnerabilities in 0ireless ;)6 security ( $. 5omu 3 T. 6ordstrom
2@B

<. .uilding secure 0ireless ;ocal )rea 6et or!s ( *. Trudeau. @. 2ecurity in *ublic )ccess 0ireless ;)6 6et or!s ( 9. $oioli. D. 0ireless ;)6 2ecurity Threats ( ). 'hic!ins!y, ;itton. C. .google.com

2@A

S$C0 &T4 A)D P$ ,O MA)C$ $)"A)C&)% &) AD"OC % O0P COMM0)&CAT&O) S4ST$MS %#rjeet Singh ?ect#rer/ Trai Shatabdi %+%+S (halsa College/ Amritsar+ profarminder1hotmail+com A3ST ACT 2ecurity and performance play a vital role in every field hether it is .an!ing, /atabases or 'omputer 6et or!s. )n ad hoc mobile net or! is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections bet een nodes are capable of changing on a continual basis. This pro+ect aims to provide a sliding indo protocol for improving communication performance and security re!eying in adhoc group multi communications. The proposed scheme is a simple e"tension to the /ynamic 2ource %outing (/2%) protocol, hich improves both routing performance and increases the security of adhoc particularly at high mobility. The ob+ectives of this paper is to propose a pseudo sliding indo protocol builds on e"isting adhoc routing protocols for interleaved group communications here there is no single multicast address and this is able to serve many route requests to different destinations ithin a certain time out period hile avoiding net or! collisions or interferences and congestion. In group communications, a critical element in controlling information is to ensure that only the appropriate individuals have the cryptographic !eys that enable them to decode the disseminated information. The sliding indo scheme is e"tended to maintain Efor ard confidentialityF as ell as Ebac! ard confidentialityF ith lo er rate of re!eying especially hen mobility is high. ($4-O DS> 2liding 0indo *rotocol, 2ecurity, *erformance, )dhoc 5+ &)T OD0CT&O) $obile ad hoc net or!s have properties such as no infrastructure, arbitrary movement, scarce resources and limited po er. )lthough multicasting in ad hoc net or!s has been proposed, a user may ish to individually communicate ith several distinct users at the same time. There is therefore no single multicast group address as each node has its o n unique address. This is a form of group communications as the nodes all belong to a group here there is interleaved multiple individual communications bet een multiple destinations and the same single source, all having different unicast addresses here each node may receive and send different messages. ) node may therefore need to discover routes to multiple nodes at the same time and multiple nodes may +oin or leave the group at the same time. E"isting routing protocols are either multicast or unicast. 0e propose a mi"ed protocol for hich uses unicast addressing, yet for group communications. #ur ob+ective is to propose a routing protocol that>

 .uilds on e"isting ad hoc routing protocols for interleaved group communications here there is no multicast address. 9or deployment and other practical reasons, our ob+ective is not to propose a comple" ne protocol, but a simple protocol based on current protocols. 0ill improve communication performance hen compared to e"isting unicast routing approaches. 0ill improve security in terms of re!eying overhead in group communications as opposed to current methods for group security. The significance of this or! lies in the simplicity and minimal modifications to e"isting protocols, and the enhancement of t o !ey characteristics of mobile group communications performance and security. #ur proposed >+ S?&D&)% -&)DO- P OTOCO? 0e e"tend the /2% protocol JBK for our or!. 0e propose a pseudo(sliding indo protocol for multi( communication that ould serve many route requests to different destinations ithin a certain timeout period hile avoiding net or! collisions or interferences and congestion. 0e have been liberal ith the usage of the term Ssliding indo G as strictly spea!ing it is a sliding indo scheme here the indo moves in multiple units rather than single units. 8enceforth e refer to the sliding indo /2% protocol as sliding indo and to the normal /2% as /2%. >+5+Pse#do7Sliding -indow Protocol It is beyond the scope of this paper to present the sliding indo protocol in detail. 0e therefore informally describe the sliding indo scheme for route discovery only. There may be different indo s for data transfers. $ultiple route requests are sent at the same time. 7alid route replies are stored in a buffer. 0ith each ne valid reply or replies, the indo advances. If a ne reply arrives ithin the time(out period for a destination that is already in the indo , then there are t o possibilities. If the ne reply is a longer route than the one currently in the indo , the ne reply is buffered and only used if the current route fails. If the ne reply points to a shorter path, it replaces the old entry in the indo .) route request is a broadcast pac!et. In outline each request contains the follo ing information> the initiator of the request, the destinations, the time(to(live parameter and a unique request id. Each route request also contains a record listing the address of each intermediate node through hich this particular copy of the route request has been for arded. ) timer is started hen a route request is transmitted. If a timeout occurs before a route reply is returned, the route discovery for the affected nodes is retransmitted.. >+>+Determination of Time7To7?ive Time(to(;ive is the number of hops a pac!et is allo ed to traverse before it is discarded and a route reply returned. ) large Time(to(;ive value ill result in route requests traveling for long distances resulting in reduced performance. ) small Time to ;ive may not generate the routes to some destinations hich are further a ay. The proposed protocol has a number of advantages. This protocol reduces the number of %oute request messages at the e"pense of larger route request pac!ets. This approach
2D?

results in fe er collisions and the discovery of routes to multiple destinations ith a single route request. Each node maintains a route cache here it caches the source routes that it has learned. 0e measure the system performance in terms of cost hich are comprised of the system resource cost (%U&pac!et)and the delay cost (/ U&time unit).The system resource cost indicates the cost of processing the route request and that of transmitting them from the source to the destination. The delay cost indicates ho much time the nodes ait for the source to start data transmission.In the sliding indo scheme the sender broadcast its multiple route requests in one pac!et. $ulti route replies is sent bac! to the source by either the destination node(s)or another node(s)that !no s the route to the destinations. The source node could start the transmission as soon as a route is available. 2ince sliding indo protocol is capable of handling multi replies in one time, the delay cost drops to the cost of a single route reply. The cost ill be less ith the proposed protocol. Even if multiple routes are obtained in one route request, the total cost for multi( communication is less than for the normal scheme. 'learly, this approach is attractive only for applications hich require the establishment of routes to multiple destinations concurrently. The proposed protocol is an e"tension to the /ynamic 2ource %outing *rotocol (/2%), thus satisfying one of our ob+ectives. $EP$ &M$)TS In /2%, %oute /iscovery and %oute $aintenance each operate entirely Eon demandF, the route discovery process typically involved net or! ide flooding of a route request and aiting for a route reply. 0hen a node ith a route to the destination (or the destination itself) is reached a route reply is send bac! to the source node using lin! reversal or by piggy(bac!ing. 'aching provides a mechanism for generation a route reply from a intermediate node en touted to the destination. T o !ey performance metrics ere evaluated> 5+ Pac*et delivery percentage This is the percentage of data pac!ets that are received at the destinations over those sent at the source. >+ etransmission thro#ghp#t This is the percentage of the data pac!ets delivered to the destinations after previous failed attempts to deliver the pac!ets. The pac!et delivery percentage is the most important metric to evaluate the performance of an ad hoc routing protocol. 0e therefore evaluate the number of pac!ets delivered at the first attempt and also those delivered requiring more than one attempt. 0e summari1e the main results. The number of destination nodes ere randomly generated, that is, the number of concurrent multiple destinations for hich routes need to be discovered ranged from 1 to a ma"imum range. This allo ed us to test the robustness of the algorithms ith different number of destinations. B+5+ Pac*et delivery ratio 0e compared the pac!ets delivered ith varying pause time for the five different algorithms ith respect to the sliding indo protocol and the /2% protocol. ) lo pause time indicates a highly mobile net or! hereas a high pause time indicates a relatively static net or!. %esults sho that pac!et delivery percentage decreases hen the
2D1

net or! is in high mobility status (pause time is lo ).#n the other hand the pac!et delivery percentage increases at lo mobility status (pause time is high).To summari1e, results sho that using sliding indo protocol helps to improve the total pac!et delivery rate hen compared to /2%. #ur simulation results sho improvement of total percentage of pac!et delivery hen using a /2% sliding indo over a non(sliding indo scheme. The results of improved total pac!et delivery percentage hen compared to /2% are sho n belo in Table 1. Table 5!&mprovement in Pac*et Delivery )verage percentage improvement of 2chemes 2liding 0indo over /2% /2%Z 1?.<DI )daptive 1?.1AI route .ase /2% =.C?I 0ider error =.2?I 6egative =.?<I cache B+> Other performance meas#res 0e outline some of the performance measures obtained for the five sliding indo algorithms. 0e e"perimented ith %etransmission throughput, indo si1e and timeout for the different algorithms of the sliding indo protocol. 2imulation results sho that the routing retransmission throughput increases hen the net or! is in high mobility status. 'omparing the results for pause time 1? seconds to 1?? seconds, the retransmission throughput is almost doubled for /2%Z. These results indicate that the sliding indo protocol does increase the retransmission throughput for the different algorithms hen the net or! is at high mobility status. 0e also investigated retransmission throughput for different indo si1e hen using the sliding indo algorithms. The indo si1es ere varied from 1? slots to 1?? slots. )ll these algorithms sho the same pattern of behavior in that the retransmission throughput increases as the indo si1e increases. 2imulations sho that retransmission throughput is higher hen the indo si1e is bigger.9inally e investigated the retransmission throughput versus timeout used in sliding indo protocol. The timeout simulation ranged from D seconds to D? seconds. To summari1e, these results indicate that the retransmission throughput is better at high mobility, a bigger indo si1e results in a better retransmission throughput and a bigger timeout value also results in a better retransmission throughput. 9urthermore the sliding indo /2%Z performs the best of these algorithms. D+ S?&D&)% -&)DO- ,O % O0P S$C0 &T4 0e e"tend the sliding indo scheme to secure group communications. In group communications, a critical element in controlling information is to ensure that only the appropriate individuals have the cryptographic !eys that enable them to decode the
2D2

disseminated information. Therefore to maintain for ard confidentiality, hen a member leaves a session or group, the remaining members must be re!eyed to ensure that the departing individual cannot listen in on future communications. 2imilarly, bac! ard confidentiality requires re!eying hen a ne member +oins an e"isting session or group. #ther ise, the ne member ould be able to decrypt any past archived e"changes for hich he&she as not authori1ed. 2ince data cannot be e"changed hile a member Gs data !eys are being updated, the challenge for any !ey management system is ho to generate and distribute ne !eys such that the data remains secure hile the overall impact on system performance is minimi1ed. 8ierarchical group !ey management schemes J<K, J@K have been proposed for scalable net or!s. )s there are a number of such group !ey management schemes, e base our or! on J<K, JCK. #ur ob+ective is not to describe a ne hierarchical !ey management schemeN rather it is to sho that the sliding indo improves !ey management for hierarchical !ey management schemes. Each group i has a !ey distributor, the ,roup (or area) 5ey /istributor (,5/i). In .aseline %e!eying (fig 2) a member leaving the group notifies the local ,roup 5ey /istributor (,5/+), hich halts the current data transmission. 6e"t the local ,5/+ updates the ne group !ey for the remaining members by securely unicasting based on their pair ise shared I/ !ey.

,ig 5! Mobility Model with 3aseline e*eying Even though the member left the group, it still holds the old group !ey but it is invalid since the group !ey has been updated. #nce this is updated securely, a ne data !ey can be broadcast to all members in the same group. )t this point, data transmission resumes using the data !ey. ) member entering the group notifies the local ,roup 5ey /istributor (,5/!), hich halts the current data transmission. 6e"t the local ,5/! unicasts the ne group !ey to the ne ly +oined member. Then the local ,5/! broadcast the ne group !eys to all members in the same group.

,ig >! Mobility Model with &mmediate e*eying Immediate %e!eying (fig<) e"tends the baseline algorithm by adding e"plicit semantics for a hand(off bet een groups. The member initiates a transfer by notifying the affected groups. Each group only updates the local !ey upon the moving node arriving at the subset group (if there is one) of both groups. 6o data !ey is generated and the data transmission continues uninterrupted. 0hen a node " ants to leave an group, it sends a Etransfer Fmessage to ,5/+. ,5/+ unicasts ne group !ey to remaining members of group +.
2D<

,5/! unicasts ne group !ey to node " and ,5/! sends the ne group !ey to e"isting members..oth baseline and immediate re!eying algorithms re!ey the local groups as soon as members transfers. )s a result, a member that moves rapidly bet een t o groups may cause repeated local re!eying.

,ig B! Mobility Model with Delay e*eying /elayed algorithms (fig@) postpone local re!eying until a particular criterion is satisfied (such as after a specific period). $embers moving bet een multiple groups may accumulate multiple group !eys and reuse these !eys hen they return to a previously visited group. In delayed re!eying, each ,5/ maintains a list of members that have left the group but still hold valid !eys for the group. 0hen a member transfers, the group that the member is entering is re!eyed to prevent from falsely transferring into a group to get access to the old !eys (bac! ard confidentially).9or the departed group, ,5/ does not re!ey but instead adds the member to the E"tra 5ey # ner ;ist (E5#;).0hen a member returns to a group, it is chec!ed against E5#; and no ne !eys are generated if it is on the list. The list is reset henever a local re!ey occurs such as the arrival of a ne node not in the E5#; list. /ata transmission stops hen the list is reset. D+5+ Sliding -indow e*eying In a group environment multiple nodes may +oin and leave a group at the same time. 0hen one or more nodes inform the ,5/i that they are +oining a group, the ,5/i uses the sliding indo protocol to distribute the group and data !eys. In other ords, multiple destinations are targeted in one pac!et as described in section <.1 and a sliding indo is !ept at the ,5/i.The sliding indo can handle multiple leaves from and multiple entries to a group. 0ith the sliding indo , the time(out (section <.1) ill ma!e sure local !eys remain valid only for a fi"ed period of time. There is therefore no need to reset the list and stop data transmission hen nodes arrive or leave. If nodes leave a group, the !eys simply e"pire at timeout and there is no need to stop transmission. 2imilarly, hen ne nodes arrive ithout E5#; entries, there is no need to stop data transmission and reset the list. Instead at the end of the timeout period, the E5#; list is updated. The delayed re!eying handles only one request at a time and only updates the E5#; list hen the number of o ners on the E"tra 5ey # ner ;ist e"ceeds a specified threshold or the number of !eys held by a particular node e"ceeds a given threshold. In the delayed re!eying scheme, if the membership on the E5#; or number of !eys held by a particular node do not e"ceed the specified threshold over a long period of time, the hole net or! becomes more insecure since the local !eys ill remain valid for a long period of time. The E"tra 5ey # ner ;ist timeouts using the sliding indo protocol, thus ma!ing the net or! more secure. In the proposed 2liding indo (fig D), re!eying nodes " and y send EtransferF message to ,5/+ saying they are leaving the group.,5/+ adds node " and y to its local sliding indo buffer. ()s the sliding
2D@

indo is able to handle more than one input at one time).

,ig D !Mobility Model with Sliding -indow Protocol ,5/! (the group " and y are +oining) chec!s if node " and node y are on its local buffer If yes, then do nothing. 6odes already have a valid !ey for the group. If no, at timeout reset E"tra 5ey # ner ;ist and re!ey all members in the group. The 2liding indo or!s on a time(out and issuing a ne group !ey ill ensure that no member outside the group holds a valid !ey after a fi"ed time period. The ne local !ey could be added anytime. The old local !ey could be searched through anytime as long as it is ithin the same timeout period. The E5#; is reset at the end of the timeout period. There is no need to stop data transmission if ne nodes arrive or nodes leave a group. $ultiple transfers can be handled by the sliding indo . The sliding indo !eying strategy reveals a better re!eying rate. The ability of sliding indo to handle multiple requests simultaneously means that it scales ell. In the case of thousands of nodes involved in the group communication, here nodes leave and enter dynamically, the baseline and immediate re!eying strategy may not be able to accommodate the or!load due to high re!eying rate. The E"tra 5ey # ner ;ist (E5#;) cache scheme ith delayed re!eying ill become less secure because of the large number of nodes (and hence !eys) involved. D+>+ Sec#re sliding window eHperiments In the simulation of different security algorithms belo e assume that arrivals are described by a *oisson process, that time spent in a group is e"ponentially distributed, and that members traverse groups in a probabilistic manner JCK.0e compare the baseline, immediate, delayed and sliding indo re!eying algorithm respectively. D+>+5+ Pa#se time 0e first consider the re!eying rates for the different security algorithms versus pause time here the members move randomly from one group to another group (inter(group).0hen there is little mobility (high pause time),the members do not get to +oin and leave as frequently as hen there is high mobility (lo pause time). ) lot of re!eying needs to be done at the beginning hen the E5#; is empty. )s the sliding indo algorithm uses timeout to control the validity of the !eys hold in E5#;, not many periodic re!eying updates are necessary hen compared ith the delayed algorithm. 2liding indo is running as a dynamic E5#; and the time(out ill ma!e sure no local !eys remain valid for more than a fi"ed period of time and there is no need to stop transmission if nodes arrive or leave the group. Thus the sliding indo performs best of the four. D+>+>+ K#e#e
2DD

0e ne"t consider security algorithm performance for re!eying rate versus queue. The members move randomly from one group to another inter group. 9or our simulations, the number of groups range from D to D???.The re!eying rate is at the high side for all four algorithms hen the number of groups visited is high.The 2liding indo algorithm has a better re!eying because it does not stop the transmission frequently to update the list. The sliding indo algorithm does not stop the transmission because the !ey updates are done ith the periodic timeout mechanism. 8ence the re!eying rate for sliding indo is the lo est among the four algorithms. D+>+B+ Arrival rate 0e ne"t consider security algorithm performance for re!eying rate versus arrival rate lambda. The members move randomly from one group to another (inter(group).The arrival rate of each node varies from ?.1&s to 1?? &s. 0e assume that the arrival time is described by a *oisson distribution. ;ambda is a rate per unit time or arrival rate. ) more detailed investigation reveals that the sliding indo algorithm sho s a slightly lo er ratio. Therefore the sliding indo is more secure and efficient in terms of group re!eying rate than the delayed algorithm. Table II is a summary of average improvement of re!eying rate using sliding indo algorithm over delayed algorithm hich performs the best of the other three algorithms.The results sho that the re!eying rate of the sliding indo scheme is around D?Iand DIlo er than re!eying rate of the immediate algorithm and delayed algorithm respectively hen the arrival rate is at 1??&s. Table >+ &mprovement of e*eying ate #sing Sliding -indow Scheme *arameters )verage group re!eying rate improvement *ause time 2B.DI :ueue B.D?I )rrival rate D.??I C+ CO)C?0S&O)S In this paper e have proposed a sliding indo mechanism for group multi( communications. The proposed protocol is a simple e"tension to the /2% protocol. The proposed scheme improves both routing performance and increases the security of the ad hoc net or!, particularly at high node mobility. This is significant due to the increasing difficulty in reliable pac!et delivery and secure communications as mobility increases. To test the robustness of the sliding indo , e included route discoveries for different number of destinations. If route discoveries ere limited to a fi"ed number n of destinations for each route discovery, the performance results ould be much better. 9urther performance analysis on using ad+ustable parameters including receiver data rates, pac!et loss rate, delays and node geographical location as ell as a real life or!load study for group model is also needed. The sliding indo also improves re(!eying performance for secure group communications. The results sho that the re!eying rate for
2DC

the sliding indo protocol is lo er than the other three re!eying algorithms, especially hen mobility is high. The comparison had been done for different parameters, including pause time, :ueue (group visited per node) and data pac!et arrival rate. The measure of security is therefore increased using sliding indo scheme. 9uture or! ould investigate an optimum timeout period such that security is not compromised. $,$ $)C$S 1. %eliable congestion(controlled $ulticast Transport *rotocol in $ultimedia $ulti( hop 6et or!s in *roc. #f the Dth int. symposium on ireless personal multimedia communications. 2??2. 2. $.2inghal, /.*anda, and *.2adayappen, ) %eliable $ulticast )lgorithm for $obile )d 8oc 6et or!s, in *roc.of /istributed 'omputing 2ystems 0or!shop ,pp.DC<(DB?,2??2. <. ../e'leene, ;./ondeti, 2.,riffin, T.8ard+ono, /5i ior, -.5urose, /.To sley, 2.7asudevan, '.Thang, F2ecure group communications for ireless net or!s F, *roceedings of $I;'#$ .2??1. @. 'hung 5ei 0ong, $ohamed ,ouda, 2imon 2.;am, E2ecure ,roup 'ommunications 4sing 5ey ,raphs F, IEEE&)'$ Transactions on 6et or!ing,7ol.A,6o.1, 9ebruary 2??? D. %odeh, 5..irman, /./olev, E#ptimi1ed ,roup %e!ey for ,roup 'ommunication 2ystems F, *roceedings of 6et or! and /istributed 2ystem 2ecurity 2ymposium 2??? C. ' Thang, . /e'leene, - 5urose, / To sley, E'omparison of Inter()rea re!eying )lgorithms for 2ecure 0ireless ,roup 'ommunications F,*erformance Evaluation ,7ol.@=,2ept.2??2 B. /.-ohnson, /.$alt1, -.-etcheva, The dynamic source routing protocol for mobile ad hoc net or!s,Internet /raft,draft(ietf(manet(dsr(?B.t"t,2??2

2DB

COMP0T$ APP?&CAT&O)S &) "OT$? &)D0ST 4 Mr+ S#mit (#mar ?ect#rer/ Desh 3hagat 0niversity/ Mandi %obindgarh+ mhms#mit1gmail+com A3ST ACT This paper focus on the application of computer in hotel departments and also describes some recent development in computer applications in the hotel industry (e.g., front office, food 3 beverage service, house!eeping and others).The ob+ective is to describe and investigate the emerging trends and applications of computers 3 technology in the hotel industry. Technology helps in providing better services to the customer. 8ospitality industries such as hotels are ta!ing and can ta!e advantage of the computer applications and technology systems to advance some of their operations. ($4-O DS! Emerging 'omputer )pplications, 8otel Industry, 8otel 2ervices, 9ront #ffice #perations. &)T OD0CT&O) 8otel industry is the industry hich caters to the ide area of the $ar!et as it deals in the basic need of a human being in a lu"urious ay by providing shelter, food 3 beverage 3 entertainment facilities. 8otel industry covers areas here a guest avails food 3 beverage service or accommodation facilities. 8otel> ( EThe 8otel is an establishment hich provides food 3 beverage 3 accommodation facility on the behalf of money but the condition is that the guest should be in a condition to receive and to be received.F 8otel can deny providing the services if the guest is not in a fit condition to be received i.e. .an!rupt, $ad, Terrorist or /run!en. X according to .ritish ;a (1) 'omputer applications are every here in these days and adding to information and communication technology in different ays. The use of 'omputer involves hard are and soft are hich helps in telecommunication, to store, manipulate, convert, protect, send, receive and share the data. 'omputer and technology made it easier to collect, store, manipulate and share data and information. 0S$ O, COMP0T$ A)D "OT$? OP$ AT&O)S 3$,O $ T"$ A &@A? O, A %0$ST &) A "OT$? ) guest ill be contacting to a 8otel ith the help of internet connection hich requires computer involvement 3 gets the room availability online or by contacting through Telephone. Telephone #perator in a 8otel ill be having 'omputer ith 'ommunication 2oft are so that he&she can for ard the calls of the guest accordingly. ) reservationist ill handle the call and reserve the room after providing information hich is possible only by using 'omputer 3 reservation soft are. %eservationist ill record all the special requirements, instructions 3 provided information (6ame, )ddress, Telephone 6o, /ate 3 Time of )rrival, *roposed /ate 3
2DA

Time of 'hec!(out, *urpose of visit, .ill settlement detail, credit card detail etc.) 3 ill !eep a *op(up in soft are at the time of chec!(in if something should be ta!en care during the registration of the guest so that guest feels comfortable during his&her personal first contact at reception during his arrival. ) Travel )gent ill manage the guest *ic!(up 3 /rop facility by maintaining the record in the computer. These all function require the involvement of computer and 8otel $anagement soft are. D0 &)% T"$ A &@A? O, A %0$ST &) A "OT$? %egistration> 0hen a guest approaches the %eception area of a 8otel there comes some legal formalities hich are !no n as %egistration formalities hich require computer and soft are to upload the guest information, room assigning, $agnetic !ey allotment again requires !ey issuing soft are 3 computer. %#est Acco#nt Creation! .y feeding up the information in the 8otel $anagement 2oft are ,uest )ccount ill be created, assigned ith the room number. D0 &)% T"$ %0$ST STA4 &) A "OT$? ,ood & 3everage! ,uest ants food 3 beverage service either in room or in %estaurant or .ar or 'offee 2hop or in .anquet. The order ta!ing formalities, bill preparation, posting or bill settlement, every step involves computer applications. "o#se*eeping! ,uest avails laundry service from 8ouse!eeping department then signed bill ill be posted and changes ill be added in the ,uest account ith the help of 'omputer and *roperty $anagement 2ystem. It may be #pera, 9idelio, )madeus, 2abre, $)%28), #n:, and I/2 or any *#2 soft are i.e. $I'%#2 etc.

,ig 5! "otel main fo#r departments and comp#ter applications OT"$ S$ @&C$S

2D=

If ,uest goes for any business center related services (9a", ;amination, *hotocopy etc.) or 2pa 2ervices, %ecreational services, %a material store related activities, 2pa services etc. )gain, e ill use the computer to consider the guest request and post the bill into the system. 3&?? S$TT?$M$)T & D$PA T0 $ P OC$SS ,uest )ccount 2ettlement> Even at the end of ,uest stay in a hotel ,uest )ccount ill be closed by ta!ing the payment from the guest and bill settlement ill be done computeri1ed. 9eedbac!> Ta!ing feedbac! from the guest and maintaining that record and to use that for the improvement of the services for ne"t time. COMP0T$ A)D %0$ST $?AT&O)S"&P MA)A%$M$)T %#est "istory! 8otel maintains guest history, hich contains guest stay duration, time, preferences, special instruction or requests. &nd#stry $Hamples! 2uppose guest given all the details during the reservation of room hich are in 8otel $anagement soft are i.e. opera and at the time of chec!(in hotel personnel provides fast service to the guest at reception area because they ere having registration card printed ith ma"imum information printed on that only signature is needed and guest ill be in his &her room ithin minutes. 8ilton 8otel ,roup, $arriott 8otel ,roup 3 other hotel chains use the computer 3 computer soft are for ma!ing the guest happy by offering effective and fast services. $C$)T T $)DS &) COMP0T$ APP?&CAT&O)S &) "OT$?S Palmtop In 8otels, *alm top is in use to get the ,uest order hich is the e"ample of I'T 3 computer application as the products 3 services offered by the hotels are same, but they ant to ma!e a difference by giving fast 3 effective services to guests to ma!e a guest satisfied.(2) A#tomation of Service some guests prefer to interact ith hotel staff through technology rather than pic!ing up the phone. The 8yatt 4nion 2quare 6e Hor! offers three chec!(in options for guests> an i*ad chec!(in ith a staff member called ,allery 8ost, a self(serve chec!(in !ios! and a traditional front des!. )bout @?I of guests at the hotel select the i*ad option. )ccording to %oe, $arriott recently launched a test in <1 hotels that ill allo for remote chec!(in. 2he said the hotels send messages to guests 2@ hours ahead of arrival as!ing for their planned chec!(in time, and the hotel ans ers bac! to let them !no hen their rooms ill be ready. (2) 0se of Digital signage The ,o.oard in 'ourtyard by $arriott as one e"ample of ho digital technology is replacing traditional printed signage and information boards in hotels. )nother e"ample from the participants as the $,$ ,rand 8otel 3 'asino in ;as 7egas. .ehind the hotelGs front des! is a huge video all, and one of the applications is a live tool that allo s guests in line, or anyone in the lobby, to send T itter messages about the hotel or other topics. )lso, the hotelGs food(and( beverage outlets use to the board to promote specials or events. (2)
2C?

-i7,i )ccording to a poll ta!en by the 2mart.rief online service, ADI of travelers believe 0i(9i in hotels should be free. 5impton and $arriott have approached the issue in different ays. )t 5impton, said 6elson, the service is free for guests ho enroll in the chainGs loyalty program. (2) 0se of technology in the lobby 'ourtyardGs ,o.oard lobby information center has become a ay to eliminate the frustration of guests standing in line to as! a simple question, such as directions or a restaurant recommendation. E0e originally put ,o.oards in lobbies to give people information> ne s, stoc!s, eather,F %oe said. E0eGve since added functionality, such as flight information, local information about restaurants and concerts and quic!(response code capabilities to enable the guest to get information on a smartphone. 2oon e ill be adding (93.) options you can get in the lobby.F (2) Social Media most hotel companies restle ith the best ays to employ social media as a mar!eting, communications and guest(service tool. 6elson said 5imptonGs focus is on investing in listening technology to ensure the chain !eeps in touch ith guest revie s, comments and reactions. $arriott last ee! launched its Travel .rilliantly mar!eting campaign, hich %oe said ill help the company Edefine the future of technology.F E0eGre as!ing (the public) to share their ideas on a number of different categories> technology, space design and more,F she said. EThe ne"t evolution of social media is tal!ing to the community and ma!ing it part of our business.F (<) Content Mar*eting Traditional advertising is rapidly losing out as hotel mar!eting professionals begin to reali1e the advantages and effectiveness of content mar!eting. $ar!etingGs ne mantra of E.rands must no acts as publishers,F has arrived in part because of social media and its potential to engage in meaningful conversations ith their loyal fan base and potential clients ali!e. In short, content mar!eting is the ne advertising. .y investing in the sharpest media tools li!e blogs, social media, ne sletters, ebinars, e.oo!s, photo(sharing, or videos and shared media, youGll drastically reduce the hefty investments in traditional paid media. *lus, your 2E# efforts ill be affected if you Eopt outF of being a producer. ,oogle is no eighing current content, social proof and author scores in their results ran!ing. 2imply put, you need to create and share content, hile being of interest to lots of people to even be a player going for ard. (<) Personali'ed systems 'ustomers e"pect their e"perience ithin a hotel to be totally personali1ed to them> from the elcome message on the television screen and food preferences to additional services such as personal training or flo ers in the room. This quic!ly creates a huge range of valuable customer preference data that needs to be fed into the hotel management system in order to deliver a personali1ed, high quality service for each return visit. This is not +ust a case of lin!ing the customer relationship management system into the hotel operations ( it is embedding the process of capturing guest preferences and proactively using that data.
2C1

9or e"ample, if a guest comments on the facilities in the room to someone on the front des! as they leave for the day, the data can be passed to the relevant operational team for the issue to be rectified and the guest notified upon their return ( delivering a truly personali1ed service at all levels of the stay. (<) CO)C?0S&O) 0e can see ho much benefit computer has brought to the hotel industry. The computer has become important component of an organi1ation and ho important it ill be in the future. 8otel applications in hotel industry came up ith advancement in hotel operations in different ays and speed up the or! in hotel different departments. $,$ 1. 2. <. $)C$S 9ront #ffice $anagement ((( 2 5 .hatnagar (9ran! .rothers) http>&& .hotelne sno .com&)rticle&1?BC@&1?(trends(in(hotel(technology http>&&hotele"ecutive.com&ne s ire&@<11<&top(1?(hospitality(industry(trends(for(2?1<

2C2

A T&,&C&A? &)T$??&%$)C$7A )$- P$ SP$CT&@$ andeep (a#r Assistant Professor/Trai shatabdi %+%+S+(halsa college/Amritsar *randeep::1yahoo+com A3ST ACT )rtificial Intelligence ()I) is the area of computer science focusing on creating machines that can engage on behaviors that humans consider intelligent. The ability to create intelligent machines has intrigued humans since ancient times and today ith the advent of the computer and D? years of research into )I programming techniques, the dream of smart machines is becoming a reality. %esearchers are creating systems hich can mimic human thought, understand speech, beat the best human chess player, and countless other feats never before possible. The military is applying )I logic to its hi(tech systems, and ho in the near future )rtificial Intelligence may impact our lives. E"pert systems are latest product of )rtificial Intelligence. These E"pert systems are developed for large number of problems particularly for medical science. ($4-O DS! )rtificial Intelligence, E"pert systems, 8uman mind, Intelligence 5+ &)T OD0CT&O) O, &)T$??&%$)C$ This paper started ith the introduction of the intelligence. It follo ed by the ,oals and history of the )I. Then E"perts and E"pert system is discussed follo ed by the architecture of an E"pert 2ystem. Then fu11y E"pert systems are discussed and concluded paper ith the study of $H'I6 E"pert system.2omeoneGs intelligence is their ability to understand and learn things It is the ability to thin! and understand instead of doing things by instinct or automatically. Thin!ing is the activity of using your brain to consider a problem or to create an idea. )rtificial Intelligence is neither a ship or electronic device nor a soft are or programming style. In contrast, it is the business of using computations to ma!e machines act more intelligently or to someho amplify human intelligence. ) program to so something intelligent.It is the science and engineering of ma!ing intelligent machines, especially intelligent computer programs. It is related to the similar tas! of using computers to understand human intelligence. Intelligence is the computational part of the ability to achieve goals in the orld. 7arying !inds and degrees of intelligence occur in people, many animals and some machines. )fter 00II, a number of people independently started to or! on intelligent machines. The English mathematician )lan Turing may have been the first. in 1=@B. 8e also may have been the first to decide that )I as best researched by programming computers rather than by building machines. .y the late 1=D?s, there ere many researchers on )I, and most of them ere basing their or! on programming computers. >+ %OA? O, A&
2C<

The main goal of )I is to understanding and building intelligent entities. The four main approaches to be covered are> 2ystems that thin! li!e humans 2ystems that thin! rationally 2ystems that act li!e humans 2ystems that act rationally B+ T"$ "&STO 4 O, A& The name artificial intelligenceM dates only to the 1=D?Ls, but its roots stretch bac! thousands of years, into the earliest studies of the nature of !no ledge and reasoning. Intelligent artifacts appear in ,ree! mythologyN the idea of developing ays to perform reasoning automatically, and efforts to build automata to perform tas!s such as game(playing, date bac! hundreds of years. *sychologists have long studied human cognition, helping to build up !no ledge about the nature of human intelligence. *hilosophers have analy1ed the nature of !no ledge, have studied the mind(body problem of ho mental states relate to physical processes, and have e"plored formal frame or!s for deriving conclusions. The advent of electronic computers, ho ever, provided a revolutionary advance in the ability to study intelligence by actually building intelligent artifacts systems to perform comple" reasoning tas!s and observing and e"perimenting ith their behavior to identify fundamental principles. In 1=D?, a landmar! paper by )lan Turing argued for the possibility of building intelligent computing systems. That paper proposed an operational test for comparing the intellectual ability of humans and )I systems, no generally called the Turing Test.M In the Turing Test, a +udge uses a Teletype to communicate ith t o players in other rooms> a person and a computer. The +udge !no s the players only by anonymous labels, such as player )M and player .,M on the te"t that they send to him. .y typing questions to the players and e"amining their ans ers, the +udge attempts to decide hich is computer and hich is person. .oth the human and machine try to convince the questioner that they are the humanN the goal for the machine is to ans er so that the +udge cannot reliably distinguish hich is hich. The game is intended to provide a rich test of intellectual abilities, separated from physical capabilities. The questions are unrestrictedN TuringLs samples range from TuringGs e"amples of possible responses ma!e clear that the aim is to imitate human intelligence, rather than to demonstrate superhuman capabilities Hear W of e"pert systems developed 1=AD D? 1=AC AC 1=AB 11?? 1=AA 22?? 1==2 12??? Table 5! &ncrease in n#mber of eHpert systems developed yearly 6based on D#r*in/ 5::F8 D+ 3 A&)S A)D COMP0T$ S! A& A)D )$0 A? )$TS
2C@

2ome people in )I have been impressed by the fact that the mechanisms of brains are very different in detail from those in computers, even though they may be doing similar sorts of things (storing, transforming, using information). This has led to the investigation of neural nets partly inspired by ideas about ho brains or!. 2ome artificial neural nets have developed entirely as practical solutions to engineering problems ithout much concern for accurate modeling of brain mechanisms. $ore recent or! attempts to move to ards more and more accurate models of real neurons, hich are incredibly comple" and varied. 2ome people thin! that it ill never be possible to understand and replicate all the important aspects of brain function unless e replace computers ith ne !inds of machines, or perhaps build hybrid machines using different technologies. This conclusion is premature. There are t o reasons> 0e do not yet !no hat the real potential of computers ill turn out to be as e develop ne types hich are faster and smaller and can be lin!ed together in vast collections of cooperating systems There is much that e do not !no about brains> including hat they do and ho they do it. 2o e cannot yet say ith confidence that thereLs )6HT8I6, brains can do hich computers ill 6E7E% be able to do, even though there are many things brains can do hich e"isting computers cannot do (and vice versa). C+ $EP$ TS E"pert is the person ho has gained a high level of e"pertise. E"pert person has the follo ing characteristics. %ecogni1e 3 formulate the problem 2olve the problem quic!ly and properly E"plain the solution ;earn from e"perience %estructure their !no ledge 5no hen to brea! rules /etermine relevance of information .e a are of o n limitations G+ $EP$ T S4ST$M )n E"pert 2ystem is a set of programs that manipulate encoded !no ledge to solve problems in a speciali1ed domain that normally requires human e"pertise. The e"pertGs !no ledge is obtained from the specialists or other sources of e"pertise, such as te"ts, +ournal articles and databases. Table 2 sho s the applications of e"pert systems in various fields. )rea I of E"pert systems Engineering 3 manufacturing <D .usiness 2= $edicine 11
2CD

Environment 3 Energy = )griculture D Telecommunications @ ,overnment @ ;a < Transportation 1 Table > Distrib#tion of eHpert systems over application areas ;+ A C"&T$CT0 $ O, A) $EP$ T S4ST$M The architecture of E"pert system is sho n in figure 1.The E"planation of each of the component is given belo .

1ser $nterface

$nference +ngine

:nowledg e +ngineer 5no ledge

9acts
1ser

%esults

5no ledge

update

4pdates

:nowledg e ?ase

,ig 5! es#lts and facts ;+5 (nowledge 3ase It contains the !no ledge necessary for understandingN formulating and solving problems. It includes facts about a specific sub+ect area (called a domain). 9acts could include definitions, relationships, measurements, probabilities, observations, constraints, and hypotheses includes rules of thumb (called heuristics) describing the reasoning procedures by hich an e"pert uses facts to arrive at conclusions ;+> &nference $ngine The inference machine is the central component of the )I engine design because it sets forth constraints that the other components must meet. The +ob of the inference machine is to apply !no ledge from the !no ledge base to the current situation to decide on internal and e"ternal actions. The agentGs current situation is represented by data structures representing the results of simulated sensors implemented in the interface and conte"tual information stored in the inference machineGs internal memory.The inference machine must select and e"ecute the
2CC

!no ledge relevant to the current situation. This !no ledge specifies e"ternal actions, the agentGs moves in the game, and internal actions, changes to the inference machineGs internal memory, for the machine to perform. The inference machine constantly cycles through a perceive, thin!, act loop, hich is called the decision cycle. *erceive> )ccept sensor information from the game Thin!> 2elect and e"ecute relevant !no ledge )ct> E"ecute actions in the game The inference machine influences the structure of the !no ledge base by specifying the types of !no ledge that can be used and ho that !no ledge is represented. 9or e"ample, a reactive inference machine, ith no internal memory, ould limit the !no ledge base to stimulus( response !no ledge represented as rules of the form Eif V is sensed then do H.F The !no ledge base couldnGt contain high(level goals because, ithout any internal memory, the inference machine couldnGt remember the current goal across the multiple /ecision cycles needed to achieve it. Thus, a feature of the inference machine, the lac! of internal memory, affects the !no ledge base by limiting the types of !no ledge included. ;+B $Hplanation ,acility E"pert systems are able to provide some e"planation for the conclusions they reach. The e"planation component can interactively ans er questions li!e> 0hy as a certain question as!edO 8o as a certain conclusion reachedO 0hy as a certain alternative re+ectedO 0hat is the plan to reach the solutionO ;+D (nowledge AcA#isition 5no ledge acquisition is the accumulation, transfer, and transformation of problem(solving e"pertise from a !no ledge source to a !no ledge base. *otential sources of !no ledge include human e"perts, te"tboo!s, databases, special research reports, and pictures. ) !no ledge engineer or!s ith e"perts to capture their !no ledge and incorporate it into the !no ledge base ) typical e"pert system architecture is sho n in 9igure .The !no ledge base contains the specific domain !no ledge that is used by an e"pert to derive conclusions from facts. In the case of a rule(based e"pert system, this domain !no ledge is e"pressed in the form of a series of rules.The e"planation system provides information to the user about ho the inference engine arrived at its conclusions. This can often be essential, particularly if the advice being given is of a critical nature, such as ith a medical diagnosis system. If the system has used faulty reasoning to arrive conclusions, then the user may be able to see this by e"amining the data given by the e"planation system. The fact database contains the case(specific data that is to be used in a particular case to derive a conclusion. In the case of a medical e"pert system, this ould contain information that had been obtained about the patientGs condition. The user of the e"pert system interfaces ith it through a user interface, hich provides access to the inference engine, the e"planation system, and the !no ledge(base editor. The inference engine is the part of the system that uses the rules and facts to derive conclusions. The inference engine ill use for ard
2CB

chaining, bac! ard chaining, or a combination of the t o to ma!e inferences from the data that is available to it.The !no ledge(base editor allo s the user to edit the information that is contained in the !no ledge base. The !no ledge(base editor is not usually made available to the end user of the system but is used by the !no ledge engineer or the e"pert to provide and update the !no ledge that is contained ithin the system. ;+C The $Hpert System Shell The parts of the e"pert system that do not contain domain(specific or case(specific information are contained ithin the e"pert system shell. This shell is a general tool!it that can be used to build a number of different e"pert systems, depending on hich !no ledge base is added to the shell. )n e"ample of such a shell is ';I*2 (' ;anguage Integrated *roduction 2ystem), #ther e"amples in common use include #*2D, )%T, -E22, and Eclipse. ;+G The ete Algorithm #ne potential problem ith e"pert systems is the number of comparisons that need to be made bet een rules and facts in the database. In some cases, here there are hundreds or even thousands of rules, running comparisons against each rule can be impractical. The %ete )lgorithm is an efficient method for solving this problem and is used by a number of e"pert system tools, including #*2D and Eclipse. The %ete is a directed, acyclic, rooted graph (or a search tree). Each path from the root node to a leaf in the tree represents the left(hand side of a rule. Each node stores details of hich facts have been matched by the rules at that point in the path. )s facts are changed, the ne facts are propagated through the %ete from the root node to the leaves, changing the information stored at nodes appropriately. This could mean adding a ne fact, or changing information about an old fact, or deleting an old fact. In this ay, the system only needs to test each ne fact against the rules, and only against those rules to hich the ne fact is relevant, instead of chec!ing each fact against each rule. The %ate algorithm depends on the principle that in general, hen using for ard chaining in e"pert systems, the values of ob+ects change relatively infrequently, meaning that relatively fe changes need to be made to the %ate. In such cases, the %ate algorithm can provide a significant improvement in performance over other methods, although it is less efficient in cases here ob+ects are continually changing. ;+; (nowledge $ngineering 5no ledge engineering is a vital part of the development of any e"pert system. The !no ledge engineer does not need to have e"pert domain !no ledge but does need to !no ho to convert such e"pertise into the rules that the system ill use, preferably in an efficient manner. 8ence, the !no ledge engineerGs main tas! is communicating ith the e"pert, in order to understand fully ho the e"pert goes about evaluating evidence and hat methods he or she uses to derive conclusions. 8aving built up a good understanding of the rules the e"pert uses to dra conclusions, the !no ledge engineer must encode these rules in the e"pert system shell language that is being used for the tas!. In some cases, the !no ledge engineer ill have freedom to choose the most appropriate e"pert system shell for the tas!. In other cases, this decision ill have already been made, and the !no ledge engineer must or! ith hat he is given. 2teps of 5no ledge engineering are given belo .
2CA

Q AcA#isition! )cquiring !no ledge from human e"perts, boo!s, documents (Typically in the form of facts 3 rules). u @alidation! 4sing test cases to verify quality of !no ledge acquired u epresentation! #rgani1ing the acquired !no ledge into a 5no ledge .ase u &nference! /eveloping the soft are to enable inferences to be made using the )cquired !no ledge u $Hplanation & .#stification! ,iving user access to the !no ledge ( typically via> 08H information is required from the user 8#0 a particular conclusion as reached F+ ,0JJ4 $EP$ T S4ST$MS F+5 ,#''y ?ogic 9u11y logic is a superset of conventional (.oolean) logic that has been e"tended to handle the concept of partial truth (( truth(values bet een Mcompletely trueM and Mcompletely falseM. /r.;otfi Tadeh of 4'&.er!eley introduced it in the 1=C?Ls as a means to model the uncertainty of natural language. Tadeh says that rather than regarding fu11y theory as a single theory, e should regard the process of fu11ificationL as a methodology to generali1e )6H specific theory from a crisp (discrete) to a continuous (9u11y) form. F+> -hat is a ,#''y $Hpert SystemM ) fu11y e"pert system is an e"pert system that uses fu11y logic instead of .oolean logic. In other ords, a fu11y e"pert system is a collection of membership functions and rules that are used to reason about data. 4nli!e conventional e"pert systems, hich are mainly symbolic reasoning engines, fu11y e"pert systems are oriented to ard numerical processing. The rules in a fu11y e"pert system are usually of a form similar to the follo ing> If " is lo and y is high then 1 P medium 0here " and y are input variables (names for no data values), 1 is an output variable (a name for a data value to be computed), lo is a membership function (fu11y subset) defined on ", high is a membership function defined on y, and medium is a membership function defined on 1. The part of the rule bet een the MifM and MthenM is the ruleLs premise or antecedent. This is a fu11y logic e"pression that describes to hat degree the rule is applicable. The part of the rule follo ing the MthenM is the ruleLs conclusion or consequent. This part of the rule assigns a membership function to each of one or more output variables. $ost tools for or!ing ith fu11y e"pert systems allo more than one conclusion per rule. ) typical fu11y e"pert system has more than one rule. The entire group of rules is collectively !no n as a rule base or !no ledge base. F+B The &nference Process 0ith the definition of the rules and membership functions in hand, e no need to !no ho to apply this !no ledge to specific values of the input variables to compute the values of the output variables. This process is referred to as inference. In a fu11y e"pert system, the inference process is a combination of four sub processes> fu11ification, inference, composition, and
2C=

defu11ification. The defu11ification sub process is optional. 9or the sa!e of e"ample in the follo ing discussion, assume that the variables ", y, and 1 all ta!e on values in the interval J?, 1?K, and that e have the follo ing membership functions and rules defined. ;o (t) P 1 ( t & 1? 8igh (t) P t & 1? %ule 1> if " is lo and y is lo then 1 is high %ule 2> if " is lo and y is high then 1 is lo %ule <> if " is high and y is lo then 1 is lo %ule @> if " is high and y is high then 1 is high 6otice that instead of assigning a single value to the output variable 1, each rule assigns an entire fu11y subset (lo or high). In this e"ample, lo (t)Zhigh (t)P1.? for all t. This is not required, but it is fairly common. The value of t at hich lo (t) is ma"imum is the same as the value of t at hich high(t) is minimum, and vice(versa. This is also not required, but fairly common. The same membership functions are used for all variables. F+D -here is ,#''y $Hpert Systems 0sedM To date, fu11y e"pert systems are the most common use of fu11y logic. They are used in several ide(ranging fields, including> ;inear and nonlinear control. *attern recognition. 9inancial systems. :+ M4C&) 6$EAMP?$ O, A@A&?A3?$ $EP$ T S4ST$MS8 #ne of the most important e"pert systems developed as $H'I6.This is a system hich diagnoses and treats bacterial infections of the blood. The name comes from the fact that most of the drugs used in the treatment of bacterial infections are called> 2omething mycin $H'I6 is intended to be used by a doctor, to provide advice hen treating a patient. The idea is that $H'I6 can e"tend the e"pertise of the doctor in some specific area. %ules in $H'I6 are of the form> I9 1. The gram stain of the organism is grange, and 2. The morphology of the organism is rod, and <. The aerobicity of the organism is anaerobic T8E6 There is suggestive evidence that the identity of the organism is bacteroides. )n e"ample of a rule ith #% conditions are> I9 1. The therapy under consideration is> 'ephalothin, or 'lindamycin, or erythromycin, or ;incomycin, or 7ancomycin )nd 2. $eningitis is a diagnosis for the patient
2B?

T8E6 It is definite that the therapy under consideration Is not a potential therapyO 0or!ing of the $H'I6 $H'I6 has a four(stage tas!> /ecide hich organisms, if any, are causing significant /isease. /etermine the li!ely identity of the significant organisms. /ecide hich drugs are potentially useful. 2elect the best drug, or set of drugs. The control strategy for doing this is coded as meta(!no ledge. 2o $H'I6 starts by trying to apply the control rule, and this generates sub-goals. The first of these is to determine if there is an organism, hich needs to be treated. This generates another sub(goalN hether the organism is 2ignificant. This provo!es a question to the user. The ans er allo s other rules to be fired, and these lead to further questions. Eventually the I9 part of the control rule is satisfied, and the T8E6 part compiles a list of drugs, and chooses from it.) consultation ith $H'I6 chains bac! from its overall goal of deciding hat organisms need treatment until it finds it lac!s information, and then as!s the user for it. 4sing $H'I6 is thus an interactive process> $H'I6 starts running. $H'I6 as!s a question. The user ans ers it. $H'I6 as!s another question. )n important feature of any e"pert system is that it can e"plain ho it comes up ith conclusions. This allo s users to understand hat the system is doing, and so see that it is doing sensible things. #ne of the advantages of rules is that they ma!e it possible to generate good e"planations. $,$ $)C$S 1. (orml.stanford.edu&+mc& hatisai&node1.html 2. http>&&library.thin!quest.org&2B?D& <. (rmal.stanford.edu&+mc& hatisai&node2.html @. . <c.org&T%&1===&%E'(html@?1(1===122@ &loose.dtd D. . <c.org&T%&1===&%E'(html@?1(1===122@& loose.dtd C. .cs.bham.ac.u!&ha"s&misc&aiforschools.html B. .rb+ones.com&rb+pub&cs&ai?22.htm A. .acm.org&crossroads&"rds<(1&aied.html =. (formal.stanford.edu&+mc&concept&nodeA.html 1? . .medg.lcs.mit.edu&ftp&ps1&2ch art16E-$1 .html 11. %ules and E"pert system by $. 9ire bough

2B1

12. ) 6e )pproach to E"pert 2ystem E"planations .y %egina .ar+ilay, /ary $c'ullough and # en %am bo . 1<. /eveloping a )rtificial Intelligence Engine. 1@. $ichael 7an ;ent and -ohn ;aird 4niversity of $ichigan 1D. 5no ledge %epresentation for E"pert 2ystem $are! *etri! 1C. )rtificial Intelligence by 7an 6astrand. 2cientific Encyclopedia 6e Hor!. 1B. 9undamentals of )rtificial Intelligence. )nny .ulpitt

2B2

C?O0D COMP0T&)%! A) &)@$ST&%AT&@$ COST APP OAC"$S .aideep &nder *a#r Assistant Professor/SSCMT/ Amritsar+ jaideep>B5<1gmail+com A3ST ACT 'loud computing is +ust li!e old ine ne bottle for providing computing services in the present era and it is a paradigm that established as a promising model for using computational resources and soft are resources on(demand pay per use. This ne computing model ill reduce the cost for developing and deploying services on the internet. It is the most tal!ed technologies in recent times and has got lots of attention from media as ell as analysts. The cost advantages of cloud computing to be three to five times for business applications and more than five for consumer reduce. In present time organi1ations have been striving to reduce computing costs and for that reason most of them start on solidating their IT operations and later using virtuali1ation technologies. 'loud computing claims to ta!e enterprises search to a ne level and allo s them to further reduce costs through improved utili1ation, deployment cycles. The economic call of cloud computing converting capital e"penses to or!ing e"penses. ($4-O DS! 'loud computing, cost of cloud computing, cost factors, features. &)T OD0CT&O) 'loud computing is a term hich is used for data and resource sharing through the internet. The term Sclo#dG comes from the cloud shaped symbol and itGs a metaphor for the internet. 'loud computing offer the different services such as servers, storage and applications to the organi1ation or firms ho ant to access these services over the internet. 'loud computing helps user to log in to the computer applications that they desire. It ma!es everything so easy and understandable even the un!no n user of computer can en+oy those services. It helps in business applications as ell as computer technology related ne soft areGs. It includes both the hard are and soft are resources. This helps in saving finance (money) hich is currently spend a lot on cable services for hich e have to pay monthly for annual subscriptions. COST O, C?O0D COMP0T&)% 'ost may be classified according to various criteria and from different perspectives. In cost accounting, cost can be divided into t o different categories> /irect and Indirect cost. /irect costs can be accurately traced to a particular cost ob+ects and are therefore assigned to cost ob+ects using allocations. In the cloud computing there the cost is calculated in t o ays> (1). 'onsumer point of vie (2). *rovider point of vie 5+ Cost in cons#mer point of view ! 'onsumer is the most important ob+ect in the cloud computing. In the cloud computing based on the pay per use methodology and consumer use the service according to this

2B<

scheme. 'loud computing cost is in short term basis hen it required release to them and hen not required then it is aborted. >+ Cost in provider point of view! In the cloud computing the cloud provider is the person or an organi1ation that provides the services to the consumer on the pay role. The cloud provider for providing the services use the different types of the infrastructure, hard are, soft are, net or! charges for services, maintenance cost, s!illed and uns!illed labor etc. e"penses pay by the provider. C?O0D COMP0T&)% COST ,ACTO S A)D $?$M$)TS! The cloud computing cost factors derived from cloud service models (Iaas, *aas, 2aas) that includes cost model, business model, cost estimation, cost parameters, and cloud economics. The cost factors are follo ing> 1. $lectricity! If e are saying that electricity is our life it is not false because all the technological development depends on the po er. .ut the lifeline resource is not fare e have to pay for it. )ll the cloud computing devices depends on it. The po er usage for the consumption of in house electronic devices li!e servers, gate ays, routers, and other net or! devices is considered in this group. 2o the usage of electricity these devices consumed are included in the price of the service provider. 2. "ardware! The 8ard are components li!e servers, computer gate ays, routers, ires, ;)6, 0)6 e"penses etc. are includes. 8ard are cost refers to the purchase of hard are resources. <. Software! The )pplication through hich service interface provided to the customer is included in the soft are. The purchasing of licenses of soft are, hich is used in the premises considered in the soft are cost. There are three types of soft are that are included in the soft are cost estimation li!e basic server soft are, middle are soft are, and application soft are. @. ?abor! The labor is considered t o types s!illed, uns!illed ;abor. This category comprises 2olaris for technicians, ho or! on maintaining soft are, hard are, providing support. This cost factors are impacted by the region or country, in hich the data center is located. ,$AT0 $S 'loud computing has the follo ing features> K#ality of service! It provides capability to meet all the requirements by the outsourced services and resources. eliability! %eliability provides the ability to ensure the right operation of system ithout any disruption i.e. no loss of data, no error during e"ecution of operation. %eliability is achieved ith the help of redundant data. ,leHibility! 9le"ibility is the main feature of cloud computing that ad+ust in every core infrastructure, potentially non(functional requirements.

2B@

 Device and location independence> Enable users to access systems using a eb bro se regardless of their location or hat device they are using (e.g., *', mobile phone). )s infrastructure is off(site (typically provided by a third(party) and accessed via the Internet, users can connect from any here. CO)C?0S&O) )t the end e can say that no these days cloud computing is the ne ave of the ne"t generation in terms of computing. 'loud computing revolutioni1es the ay businesses or! by allo ing instant, secure access to private and public hosted net or! from any here. )ll of our program files, important data, emails, and other office data can be accesed from any here in the orld by any pc. 'loud computing offers a secured access, manageable and maintained IT infrastructure hich allo s clients to or! in high speed net or! environment ithout any costing of connecting any servers, maintaining them and !eep bac!ing them al ays ith the fear of losing data. )dvent of cloud computing ma!e the human life bit easy+ $,$ $)C$S 1. ,ruman ,alen (2??A(?@(?B).F0hat cloud computing really meansF. 2. 'loud 'omputing >'oncepts, Technology, 3 )rchitecture .y Thomas )ri, %icardo *uttini. <. 'loud security and privacy >)n Enterprise perspective on ris!s and compliance .y Tim $ather. @. 'loud 'omputing E"plained> Implementation handboo! for enterprises .y -ohn %hoton D. 'loud )pplication )rchitecture> .uiliding )pplications and Infrastructure in the cloud .y ,eorge %eese. C. 0i!ipedia, S'loud 'omputingG(available at http>&&en. i!ipedia.org& i!i&cloudQcomputing B. 2'loud computing

2BD

Session &&& ,lobali1ation of I69#%$)TI#6 TE'86#;#,H in *resent era

2BC

1#

'omponent and Its Impact on 2oft are /evelopment. 8ardev 5aur To 2tudy the Effect of 7ariation of /ischarge 'urrent in Electric /ischarge $achining of )2T$ )CA1/< /IE 2TEE; 8ar ant 2ingh 6irmal 2.5alsi $oving To ards ,reen 'loud 'omputing 8arsimran 2ingh )nand 0eb $etrics for E(*ublishing in India> )ccessibility, *ortability and 4sability 5apil ,oyal )pplication of 9u11y ;ogic )pproach> 8andover 2cheme %enu 2harma Image *rocessing )pplications in 9ood Industries 2andeep ,upta E('ommerce in India )mandeep 5aur -ee an -yoti %ole of Technology in 2preading of Education /r...2 8undal 7ipin 5umar E%* and Its Implementation Issues $anish 5umar %avneet 5aur To ards #ptimal %esource $anagement in 8eterogeneous 'loud /atacenters> ) /ynamic )pproach for /istributed ;oad .alancing )nil 5umar 7eera ali .ehal /ipti $alhotra $orphological )naly1er of *un+abi 5amal+eet 5. .atra ,2$(%> Evolution and )pplicability -arman+it 2ingh 'omparative 2tudy of $aintenance and %eengineering of 2oft are -as inder 2ingh )shu ,upta -aiteg 2ingh

>+

B+ D+

C+ G+ ;+ F+ :+ 5<+

55+ 5> 5B

5D

) 'omparison of #nline Trading and Traditional Trading> 'onceptual 2tudy /r. )parna .hatia .inny

5C 5G 5; 5F

*redicting *rimary Tumors 4sing /ata $ining Techniques $eha! 6aib )mit 'hhabra %egion .ased /igital Image *rocessing 6aina 8anda )mbiguity in 6atural ;anguage *rocessing .hel 2BB 7eera ali

/erivative> Trading 9rame or!, its 'hallenges and ,ro th *rospective

Isha

COMPO)$)T A)D &TS &MPACT O) SO,T-A $ D$@$?OPM$)T Prof+ "ardev (a#r Assistant Professor/ Trai Shatabdi %+%+S (halsa College/ Amritsar+

A3ST ACT 'omponent based soft are development is ne trend in soft are development. The aim of 'omponent based soft are engineering is to create application from reusable, e"changeable and connectable components. 'omponent provides service ithout regard to here the component is e"ecuting or its programming language. 'omponent can range from simle function to entire application system. ) lot of research efforts have been devoted to analysis and design methods for component based soft are development. This ne soft are development is used due to problem of software crisis. 'risis here means that the quality of soft are is generally unacceptably lo and that deadlines and cost limits are not being met. This paper is concerned ith the introduction of components, developing component and 'omponent based soft are development. .ecause 'omponent based development is a relative ne approach to soft are engineering, the number of methods specially designed for './ is still limited. The brief study of various 'omponent model and the methods of component development are also available. 2ome types of tips are also available for the component development, component based soft are development and component integrator. The main concept arise hether e are developing soft are using available components or e are developing components so that it can be used later. 5+ &)T OD0CT&O) 'omponent based soft are development is ne trend in soft are development. ) lot of research efforts have been devoted to analysis and design methods for component based soft are. E"ample of 'omputer 2ystem assembly. Hou have to needs components li!e board, %)$, 8//, cables, 2$*2 and many more. Each item is standardi1ed no , and product from different manufacturers can be used to assemble a single *' li!e %)$ and 8// of any manufacturers can be used ith .oard of any manufacturers. The hard are products are +ust li!e various components..9or reusing the components, you have to !no e"actly the connecting mechanism.C3S$ It is the branch of computer science that deals ith the development of more productive soft are by reusing the various available (already build) 'omponent. The target is to increase the productivity, reduce the cost and time to mar!et of soft are.J1K.'.2E is based on Ethe buy do not buildF philosophyJ1K. >+ D$,&)&T&O) O, COMPO)$)T 1. ) nontrivial nearly independent and replaceable part of a system that fulfils a clear function in the conte"t of ell defined architecture J1K 2. ) unit of composition ith contractually specified and e"plicit conte"t dependencies onlyJ1K
2BA

<. ) run time soft are component is a dynamically bindable pac!age of one or more programs managed as a unit and accessed through documented interfaces that can be discovered at run(timeJ2K @. ) business component represents the soft are implementation of an EautonomousF business concept or business process. It consists of all the soft are artifacts necessary to e"press, implement and deploy the concept as a reusable element of a large business systemJ2K D. ) component is a language neutral, independently implemented pac!age of soft are services, delivered in an encapsulated and replaceable container, accessed via one or more published interfaces. ) 'omponent is not platform constrained or application bound.JCK C. )ccording to 8armon, ) component could be described simply as a module. .ut that is a little too vague. 8armon 6!omponents,1==A) argues further that a tighter definition might be, Ea component is a soft are module that publishes or registers its interfacesF.JCK B+ -"4 A COMPO)$)T73AS$D D$@$?OPM$)T APP OAC"M There are a number of factors that indicate that the component based development is good for todayGs mar!et. )ccording to .ro n 6An &verview of !@/, 1==C) the follo ing factors have contributed to ma!e the component(based development approach become so popular. The need to automate the soft are development process. The economic push moving many organi1ations to ards greater use of available commercial solutions. The style and architecture of the applications being developed has significantly changed. ) set of infrastructure standards and supporting technologies has emerged during the last fe years. /omain(specific libraries and frame or!s are starting to appear. ;eading companies ithin the soft are industry have announced component(based development strategies. The eb infrastructure is maturing. 0hile there is a great deal of chaos and competing technology, there is also a basic shape to the infrastructure that allo s collections of independent(developed soft are applications to be searched, remotely invo!ed, and communicate ith each other. D &)T$ ACT&O) -&T" COMPO)$)T

2B=

<oftware <oftware $nterface

3o-ponent

<oftware

<oftware
'< word

+xcel

<pell 3h ec8 3o-ponent

*ower point

,ig 5

'omponents e"press themselves through interfaces. )n interface is the connection to the user that ill interact ith a component. If an interface is changed the user needs to !no that it has changed and ho to use the ne version of it. 9unctions that are e"posed to the user are usually called )pplication *rogrammable Interface ()*I). If there is a change to the )*I, the user has to recompile his code as ell. This is not the case in interpretative languages li!e 2malltal! or -ava, but for compiled languages such as '&'ZZ.9ig 1 and 2 sho s the possible interaction ith component. In an ob+ect(oriented orld, an interface is a set of the public methods defined for an ob+ect. 4sually the ob+ect can be manipulated only through its interface. In 'ZZ the user has to recompile the code only hen an interface, referred from the code, is changed. There is also a dra bac! that the user of the class must use the same programming language throughout the hole development. 2eparating the interface from the implementation is a ay to avoid this tight coupling. This !ind of separation is made ith binary interfaces as done in '#%.) and '#$ . .inary interfaces are defined in an interface definition language (I/;) and an I/; compiler, hich generates stubs and pro"ies, ma!es the applications location transparent. C+ T"$ COMPO)$)T 3AS$D D$@$?OPM$)T P OC$SS The component based development can be considered by t o levels. first one is developing soft are ith components and second is developing components needed for future soft are development. /eveloping soft are ith components focus on assembly soft are components that provide user services required by specific business. .ut component development process focuses on acquire, rap and build the actual components. C+5 Developing software with components9>= .efore acting and ta!ing decisions on ho to build applications from components, the follo ing questions should be considered>

2A?

The functionality provided by the component may not remain precisely hat you need over time, forcing you to create rappers that get around this. Things are getting even orse if you are not getting support from the vendor. The functionality of the component may be more than you actually need, requiring you to rite restrictive rappers for functionality that you do not ant to be used. 4se of unintended functionality may cause problems. If you succeed to get the source code from the component vendor, can you really maintain it if something goes rongO ) malfunction in the component may cause an error in your product. )re illing to have a certification strategy for this. Hour customer ants your product to or! ithout having to thin! about your internal design. Hou have to provide the fi" of the problem even though the error is in the third(party component. If you as! the component vendor to customi1e the component for you, are you a are that you no are strongly dependent on the vendorO The vendor can charge you anything they please.

The follo ing are the recommendations for the Component integrator! $a!e a thorough evaluation of the component suppliers. )re they suitable as a supplierO /o they have good quality products and supportO 'hec! their economy so they donGt easily ban!rupt. *ut a lot of effort into the legal agreement ith the supplier. This may save you if the supplier goes out of business or if they refuse to support you. 'reate good and long term relations ith the supplier for better cooperation. ;imit the number of partners and suppliers. To many ill increase the costs and the dependencies. .uy EbigF components here the profit is greatest. The management of to many small components can consume the profit. )d+ust the development process to a component(based process. 8ave !ey persons that are assigned to supervise the component mar!et. They shall !eep trac! of ne components and trends. Try to get access to the source code. Test the components in your environment. )ll these advices do not give a complete solution to all the problems that have to be dealt ith but they state that developing for and ith components has to be carried out carefully ith a second thought. C+> Developing Components 0hen developing and designing components, the follo ing points should be !ept in mind )l ays document all the features of the component. /o not restrict the documentation to functionality and document all other properties as ell. E.g. *erformance, resource consumption, limitations, robustness, etc.

2A1

*rovide test(suites ith the component so that the customer can test your component in their environment. It is e"tremely important to test an imported component in the environment it ill operate. *rovide source code if possible, it might help the application developer to understand the semantics of your component. $a!e the components so they easily integrate into e"isting component frame or!s. /escribe hat frame or!s the component or! ith and describe ho to ma!e it or! ith other frame or!s as ell. 'omponents need to be carefully generali1ed to enable reuse in a variety of conte"ts. 8o ever, solving a general problem rather than a specific one ta!es more or!.

G COMPO)$)T 3AS$D D$@$?OPM$)T P OC$SS 6D$@$?OPM$)T ?&,$ C4C?$ 0S&)% COMPO)$)TS8 This section describes the differences of ho to develop components and ho to develop ith components. It is important to do this distinction to ma!e it clear ho to use different methods. The developer of a component has to thin! about ho to ma!e the component open for integration ith other components and not so much about ho to integrate other components. The development cycle of a component(based system is different from the traditional ones. 9or instance the aterfall, iterative, spiral and prototype based models. /evelopment ith components differs from traditional development. There is a ne development process for '.2E and it differs from the traditional aterfall model. 9igure < sho s a comparison bet een the t o different development processes. ,athering requirements and design in the aterfall process corresponds to finding and selecting components. Implementation, test and release correspond to create, adapt, deploy and replace.
4e5uire-ent ;esign i-ple-ent

2est

2est

,ig >
@ind
<elect .dapt

;eplo

4eplace

,ig B The different steps in the component development process are> 1. 9inding components that may be used in the product. 8ere all possible components are listed for further investigation. 2. 2elect the components that fit the requirements of the product. <. 'reate a proprietary component that ill be used in the product. 0e do not have to find these types of components since e develop them ourselves. @. )dapt the selected components so that they suit the e"isting component model or requirement specification. 2ome component needs more rapping than others. D. 'ompose or deploy the product. This is done ith a frame or! or infrastructure for components. C. %eplace old versions of the product ith ne ones.This is also called maintaining the product. There might be bugs that have been fi"ed or ne functionality added.
2A2

G+ COMPO)$)T MOD$?S The component models define the standards forms and standard interfaces bet een the components. They ma!e it possible to components to being deployed and to communicate. The communication can be established bet een components on the same node (computer) or bet een different nodes. 'omponent models are the most important step to lift the component soft are off the ground. If components are developed independent of each other then it is highly unli!ely that components developed under such conditions are able to cooperate usefully. The primary goal of component technology, independent deployment and assembly of components is not achieved. ) component model supports components by forcing them to conform to certain standards and allo s instances of these components to co operate ith other components in this model.The three ma+or component models are used today ith success. These three are '#$, -ava.eans, and '#%.) and all of them have different levels of service for the application developer. /istribution is provided ith a communication protocol that has been added to the basic component model. '#$ uses /istributed '#$ (/'#$), -ava has %emote $ethod Invocation (%$I) and '#%.) uses Internet Inter(#%. *rotocol (II#*). There is a difference bet een systems that have their components tightly coupled together and those that have loose references bet een the components. In case of loose references the components connect to their fello components hen needed and not in the build phase. 9or these !inds of systems, it is much more a challenge to determine hat the system ill loo! li!e hen it is started. )ll three models *resented in this section are loosely coupled. ) component model could broadly be described as a specification for ho a component must be constructed in order to ma!e it or! in a correct manner. There are lots of component models that have been introduced the last fe years. .ut, according to 8armon ('omponents, 1==A), at the moment, most component developers are focused on the follo ing three standards> '#%.), '#$, and -ava.eans. G+5 Component Object Model 6COM8 $icrosoft is the founder of 'ommon #b+ect $odel ('#$. '#$ is a specification. It specifies ho to build components that can be dynamically interchanged. E'#$ provides the standard that components and clients follo to ensure that they can operate togetherF The 'omponent #b+ect $odel provides a model for designing components that have multiple interfaces ith dynamic binding to other components. '#$ is an open standard, hich has been implemented on many different platforms, but the main platform is of course $icrosoft 0indo s for hich it as first developed. 'omponents e"pose themselves through interfaces and only interfaces. The interfaces are binary hich ma!es it possible to implement the component in a variety of programming languages such as 'ZZ, 7isual .asic and -ava. ) client uses '#$ to locate the server components and then it queries for the anted interfaces.'#$ establishes the connection bet een client and server. .y defining interfaces as unchangeable units, '#$ solves the interface versioning problem. Each time a ne version of the interface is created a ne interface ill be added instead of changing the older version. ) basic '#$ rule is that you cannot change an interface hen it has been released. This ma!es couplings bet een '#$ components very loose and it is easy to upgrade parts of the system indifferent from each other. /'#$ is the protocol that is used to
2A<

ma!e '#$ location transparent. ) client tal!s to a pro"y, hich loo!s li!e the server and manages the real communication ith the server. '#$Z is an e"tension to '#$ ith technologies that support among others> transactions, directory service, load balancing and message queuing. G+> .ava3eans -ava as founded by 2un and it is much more than a programming language. There are number of -ava technologies supporting the development of component(based systems. #ne of these technologies is -ava.eans. -ava.eans is the component model for -ava. It is a set of standards for pac!aging -ava implemented services as components. G+B CO 3A 6Common Object eA#est 3ro*er Architect#re8 The #b+ect $anagement ,roup (#$,) is the founder of the 'ommon #b+ect %equest bro!er )rchitecture ('#%.)). #$, is a non(commercial organi1ation hose charter is to establish industry guidelines and ob+ect management specifications that provide a common frame or! for distributed ob+ect and component(based application development. '#%.) as designed by the #$, in order to ma!e it possible to communicate bet een multiple language on multiple platforms. It is important to note that '#%.) is only a collection of standards, hich can be implemented by different vendors. ;+ A)A?4S&S O, M$T"ODS .ecause component(based development is a relatively ne approach to soft are engineering, the number of methods specifically designed for './ is still limited. 2ome './ methods are e"tensions of e"isting methods, in particular methods for ob+ect(oriented development. ) more e"haustive overvie of our research is given in JBK. ;+5 CADA ')/) ('#$*)2 )nalysis and /esign) is a ne soft are development methodology developed by #rdina Institute for %esearch and Innovation. ')/) as not developed from scratch, but incorporates Sbest(practiceG methods and techniques from the follo ing sources> 'atalysis '%' ('lass, %esponsibility, 'ollaborations) cards /2/$> /ynamic 2ystems /evelopment $ethod 4$;> 4nified $odelling ;anguage #ne of the central ideas behind the ')/) methodology is that a method should support analysts and designers, not dictate them. Therefore, ')/) provides guidance for the various design stages, but ithout prescribing the precise order in hich steps have to be ta!en. ;+> Catalysis 'atalysis is a research initiative developed at the 4niversity of .righton by /G2ou1a and 0ills. The method is intended to support the modelling and construction of open distributed systems. #pen distributed systems are considered to evolve in form and function over time, as components and services are added and removed from it. 'atalysis is about the incremental construction of a business model using pac!aging, refinement and decomposition.

2A@

;+B Comet The 'omet stands for E'#mponent(based $EThodologyF, has been developed in the #pen .usiness #b+ect Environment (#.#E) pro+ect, submitted under the E2*%IT frame or! I7. 2everal user groups and technology suppliers are involved in the pro+ect. The 6or egian research institute 2I6TE9 is responsible for the development of '#$ET. '#$ET is characteri1ed by development of application(independent business ob+ect models, and the reali1ation of these models in soft are components. ;+D 0P The %ational 4nified *rocess (%4*) is the soft are engineering method of the %ational 2oft are 'orporation. It is an iterative, ob+ect(oriented, controlled and tool(supported method applicable to all sorts of soft are development pro+ects. The %4* en+oys a considerable popularity in the soft are industry, especially amongst users of %ationalGs modelling and implementation support tools. The development process is divided in four phases> inception, elaboration, construction and transition, and an arbitrary number of iterations. In addition, the %4* is structured along a number of workflows, hich group different !inds of activity, vi1. .usiness modelling, %equirements, )nalysis 3 design, Implementation, Test and /eployment, but also a number of supporting or!flo s, such as *ro+ect management and 'onfiguration 3 change management. ;+C Select Perspective> 2elect *erspective is a method for developing soft are applications. It is supported by several tools from *rinceton 2oftech Therefore, the main ideas of the methodology are about results that are scalable and adaptable to changes. To achieve this goal, 2elect *erspective is based on './. )ccording to *rinceton 2oftech, './ capitali1es on previous methodologies such as 2tructured /evelopment, %)/, #b+ect(oriented development, and e"tends these. 2elect *erspective is a hierarchical method. It has phases, core activities ithin each phase, and ithin each activity a standard method. The phases are EalignF, EarchitectF and EassembleF . $,$ $)C$S 1. 'omponent base soft are Engineering( ) loo! at reusable soft are componets .y 9aisal 2iddiqui. 2. 'omponent based soft are engineering(6e *aradigm of 2oft are development by Ivica 'rn!ovic and $agnus ;arsson $alardalen 4niverstiy 2 eden <. 'omponent and 9rame or!s by 0ee 8o .eng .rain @. )n )pproach to 'omponent .ased 2oft are Engineering for distributed Embedded %eal Time systems by 4 e %astofer, 9ran! .eliosa D. $onitoring 2oft are 'omponents and 'omponent (.ased 2oft are by -erry ,ao,Eugene H.Thu,2imon 2him 2an -ose 2tate 4niversity 2an -ose C. Evaluation of 'omponent .ased /evelopment $ethod .y 6ic!y .oertien,$aarten 0.) 2teen,8en! -on!ers Telematica Institute 6etherlands. B. Evaluation of 'omponent .ased development $ethods .y 6ic!y .oertien ,$aarteen A. 0.) 2teen,8en! -on!ers =. 'omponent .ased 2oft are Engineering by 7orgelegt 7on,'hina
2AD

TO ST0D4 T"$ $,,$CT O, @A &AT&O) O, D&SC"A %$ C0 $)T O) MAC"&)&)% O, ASTM AGF5 DB D&$ ST$$? &) $?$CT &C D&SC"A %$ MAC"&)&)% "arwant Singh/ M+ Tech st#dent/ 3eant College of $ngineering & Technology/ %#rdasp#r+ )irmal S (alsi 3eant College of $ngineering & Technology/ %#rdasp#r+

A3ST ACT Electric /ischarge $achining is non conventional machining process hich based on thermo electric energy bet een the or! piece and electrode. Electric /ischarge $achining is generally used for machining of hard materials. The most important performance measure in E/$ is 2urface roughness, 2urface 8ardness, $aterial removal rate, Tool ear and /imensional accuracy. In this research or!, e"perimental investigations have been made to study the effect of variation of discharge currents on $aterial removal rate ($%%) and 2urface roughness (2%). The machining tests ere conducted on )2T$ )CA1 /< die steel or! piece using copper electrodes by varying the discharge current. T o copper electrodes ere used in this research or! namely simple copper electrode and cryogenic treated copper electrode. The machining process as carried out at current levels (1 )mps to 12 )mps), *ulse(on time (@}sec) and *ulse(off time (2}sec).The results are discussed. ($4-O DS> E/$, /ischarge current, $aterial removal rate, 2urface roughness, 'opper electrode, 'ryogenic treated copper electrode &)T OD0CT&O) Electrical discharge machining (E/$) is most significant non conventional machining process hich is used for machining hard materials and geometrically comple" shaped parts for hich traditional machining processes are not suitable (,ostimirovic et al., 2?12).This process has found its application in the production of dies, ma!ing moulds, punches, aerospace products, automotive industry and surgical components (8o and 6e man,2??1).In electro(discharge machining(E/$) process, the control of erosion of the metal is achieved by the rapidly recurring spar! discharges produced bet een t o electrodes, one tool and other or!, in a dielectric medium(-ain,2??1). The history of E/$ goes bac! to 1BB? hen -oseph *riestly discovered the erosive effect of electric discharges. ;a1aren!o and ;a1aren!o found the destructive properties of electric discharge in 1=@<.The use of '6' (computer numerical control) brought various advances in or!ing of E/$ in 1=A?. The efficiency of E/$ advances remar!ably ith the help of '6' (computer numerical control) (8o and 6e man, 2??1). 2ome industries are using '6'(E/$ to reduce the problem of changing tools (8 ang et al., 2?1?). E/$ process should use '6' (computer numerical control) to remain competitive as a micro(manufacturing technology (5umar, 2?1<). ?&T$ AT0 $ $@&$2AC

)fter studying related literature ith my topic a lot of data has been found out. The same is being furnished belo >( .hogal et al. (2?11)studied the effect of variation of discharge current on $%%,E0%,2%,/),28 ith E/$ machining of /ie steel using four different types of electrodes namely copper('u), )luminum()l), .rass and ,raphite. 8e found that $aterial removal rate, /imensional accuracy and 2urface roughness increases ith the increase in discharge current and 2urface hardness decreases ith the increase in current. 8e e"amined that higher $%% is achieved by copper electrode. 8igher surface roughness and dimensional accuracy is produced by brass electrode. .elgassim et al. (2?12) e"amined the effect of E/$ parameters on the surface hardness of )I2I /< tool steel. 8e found that current has very less effect on machined surface hardness and other parameters li!e gap voltage, pulse on time and pulse off time significantly affect the surface hardness. 5ocher et al. (2?12) e"amined the microstructure of )I2I /< tool steel before and after heat treatment and investigated the 2urface roughness of /< steel after E/$. 8e sho ed that copper(tungsten is better than copper and graphite electrode to produce high quality surfaces. *ravin et al. (2?12) investigated the effect of E/$ parameters on Electrode ear rate, $aterial removal rate and radial over cut hile machining of )I2I /< material. 8e studied that $%%, E0%, %#' mainly influenced by *ea! current and other factors have very less effect. 8arpreet et al. (2?12) studied the effect of current and different electrode materials on material rate, tool ear rate ith E/$ machining of )I2I /< 2teel. 8e compared the copper, brass electrodes ith cryogenic treated copper, brass electrodes on machining of )I2I /< 2teel. 8e found that copper electrode gives higher material rate and cryogenic treated copper electrode has lo tool ear as compare to copper electrode. 8arpreet et al. (2?12) compared the different electrode materials on surface roughness ith machining of die steel. %esults sho that surface roughness increases ith increase in current and pulse time. 8e found that 2urface roughness of cryogenic treated cooper and brass electrode is lo as compare to simple copper and brass electrode. O3.$CT&@$S O, T"$ ST0D4 The main ob+ectives of the current research or! are> To 2tudy the effect of the variation of current on $aterial %emoval %ate of machining )2T$ )CA1 /< /ie 2teel To 2tudy the effect of the variation of current on 2urface %oughness of /ie 2teel To compare the performance of pure copper electrode and cryogenic treated copper electrode M$T"ODO?O%4 5+5 Machine Tool The 2par!oni" Electric /ischarge $achine ith ma"imum capacity of 2D) investigation.9ig.1 sho s the 2par!oni" E/$.

as used in this

2AB

,ig 5! Spar*oniH $DM 5+5+5+ $DM Components Electric po er supply /ielectric system (5erosene #il is used) 0or! piece Electrode Tool 2ervo control 5+5+>+ Specification $a!e> 2*)%5#6IV (I6/I)) *7T. ;T/. $ade> 92D 2eries 5+5+B+ Technical Specification Table si1e> ( C?? V @?? mm ;ong R'ross Travel> ( <?? V 2?? mm $a". Electrode eight> <D 5g. $a". 0eight of 0or! piece> ( CD? 5g $a". 8eight of 0or! piece> ( <D? mm Tan! si1e> ( AD?VDD?V@?? mm

5+> -or* Piece Material To conduct e"periments the )2T$ )CA1 /< as used as or! piece material for the current research or!. )2T$ )CA1 /< steel as chosen based on its applications in dra ing dies, forming rolls, stamping, po der metal tooling, blan!ing, punches and cold forming dies. 0or! pieces ere cut from the flat available from the mar!et. 9inal dimensions of or! pieces ere 2? mm " 2? mm " 12 mm. The chemical composition and mechanical properties of )2T$ )CA1 /< die steel are as sho n in the Table 1 and Table 2 respectively. Table 5 7 The chemical composition of ASTM AGF5 DB die steel 6wt T8 'arbon 'hromium $anganese *hosphorus 2ilicon 2ulphur Tungsten 7anadium 2 ( 2.<? 11.D ( 1< ?.C ?.?< ?.C ?.?< 1 ma" 1 ma"

2AA

8ardness %' C<.D

Table >7Mechanical Properties of ASTM AGF5 DB $odulus of Elasticity I1od Impact $achinability 1=?(21? ,*a 4nnotched 2A.? @D.? ( D?.? I

5+B $lectrode Material ) cylindrical pure copper and cryogenic treated copper electrode as used as tool material in this e"perimental or!. The diameter of electrode material as 1?mm. The various properties of 'opper ('u) are sho n in Table <. Table B7 Properties of Copper 6C#8 Thermal /ensity $odulus of $elting ;atent 8eat Thermal 'onductivity Elasticity *oint of 9usion E"pansion <=1.1 0&m A.=@ " 5 at 1??~' !g&m 1?< 11B ,*a 1<DC 5 1<@ -&g 1C.="1?(C &5 at 1??~'

5+D Dielectric 0sed The !erosene oil as used as dielectric fluid for all the e"periments in the current investigation. Table @ sho s the properties of !erosene oil. Table @ ( *roperties of !erosene oil 2urface Tension 6&$ /ensity 5g & $ /ynamic 7iscosity ?.?2A A2? 2@??

5+C Machining process E"periments ere performed on (2par!oni"(2D)) Electric discharge machine. Each e"periment as performed for fi" time period of 1D min. work piece loss ( g ) x 1??? The machining process densit ( g & cm < ) x machining time (min) as carried out at current levels (1 )mps to 12 )mps), *ulse(on time (@}sec) and *ulse(off time (2}sec). ) pure copper and cryogenic treated copper as used in this investigation. 2urface roughness (}m) as measured using $itutoyo ma!e surface roughness tester. The $%% has been calculated by using the or! piece loss from the or! piece divided by the density and machining time as per the formulae given belo $%% (mm<&min) P $S0?TS A)D D&SC0SS&O) 5+5 $ffect of variation of discharge c#rrent and electrode material on M ,ig#re > sho s the effect variation of discharge current and copper electrode on $%% of )2T$ )CA1 /< /ie steel or! material. The trend sho s that as discharge current increases, the $%% also increases. %esults sho that hen the discharge current increases from 1)mp to 12)mp then the discharge stri!es the or! piece ith more intensity. 9ig.2 sho s that
2A=

ma"imum $%% is obtained at 11 amps current using a copper electrode. 0ith the increase in current from 11(12 amps, the $%% decreased. The copper electrode yields the highest $%% of <2.D<C mm<&min for )2T$ )CA1 /< steel. The increase in $%% ith the increase in pulse current is due to the enhancement of spar! energy that facilitates the action of melting and vapori1ation. It is found that $%% of cryogenic treated copper electrode is less than copper electrode. The cryogenic treated copper electrode yields the highest $%% of <?.2D< mm<&min. ,ig#re B sho s the effect of discharge current and cryogenic treated copper electrode on $%%.

,ig >! $ffect of c#rrent and copper electrode on M

,ig B! $ffect of c#rrent and cryogenic treated copper electrode on M 5+> $ffect of variation of discharge c#rrent and electrode material on S#rface ro#ghness ,ig#re D sho s the effect of variation discharge current and copper electrode on surface roughness of )2T$ )CA1 /< /ie steel. It is observed that as the discharge current is increased the surface roughness increased and due to lo spar! energy at lo current, good surface finish is obtained. The ma"imum and minimum value of surface roughness is 1@.B< }m 3 1.12 }m hich are for copper at 12amps 3 1amps discharge current respectively. ,ig#re C sho s the effect of discharge current and cryogenic treated copper electrode on 2urface %oughness. The cryogenic treated copper electrode yields the highest 2% of 1<.1@

2=?

}m and lo est 2% of ?.=A }m. %esults sho that among the copper and cryogenic treated copper electrode the cryogenic treated electrode has given better surface finish.

,ig D! $ffect of c#rrent and copper electrode on S

,ig C! $ffect of c#rrent and cryogenic treated copper electrode on M . CO)C?0S&O) The $aterial removal rate ($%%) increase ith the increase in input po er (i.e. discharge current). )t lo amperes the $%% is lo , and as the current increases the $%% also increases. 2urface roughness increased ith increasing discharge current. ;o amperage gives the best surface finish, and as the current increases the surface roughness increases.

2=1

The 'opper electrode gives the better material removal rate ($%%) than 'ryogenic treated copper electrode. The 'ryogenic treated copper electrode gives the better 2urface finish (29) than copper electrode.

$,$ $)C$S 1. ,ostimirovic $, 5ovac ., 2!oric . 3 2e!ulic $, EEffect of electrical pulse parameters on the machining performance in E/$F, Indian -ournal of Engineering 3 $aterials 2ciences, 7ol. 1A (2?12) @11(@1D. 2. 8o 5 8, 6e man 2 T,F 2tate of the art electrical discharge machining (E/$)F, International -ournal of $achine Tools 3 $anufacture, @< (2??<) 12ABR1<??. <. -ain % 5, (2??1), E*roduction technologyF, 5hanna publishers, 6e /elhi. @. 8 ang H ;, 5uo ' ;, 8 ang 2,F The coating of TI' layer on the surface of nic!el by electric discharge coating( E/') ith a multi( layer electrodeF, -ournal of $aterials *rocessing Technology, 21? ( 2?1?) C@2(CD2. D. 5umar 2, E2tatus of recent developments and research issues of electrical discharge machining (E/$)F, International -ournal of ;atest Trends in Engineering and Technology (I-;TET), 2 (<) (2?1<) I226> 22BA(C21V. C. .hogal 2, ;aroiya 2 ', 2indhu ',F 2tudy of machining parameters in spar! erosion machining of 8ot /ie 2teel ith different electrodes E6ational 'onference on )dvancements and 9uturistic Trends in $echanical and $aterials EngineeringF, *un+ab Technical 4niversity, -alandhar (2?11). B. .elgassim #, )busada ), EInvestigation of the influence of E/$ parameters on the machined surface hardness of )I2I /< 2teelF, -ournal of Engineering %esearch, (1C) (2?12) <1(<A. A. 5ocher ,, 'hopra 5, 5umar 2,F Investigation of 2urface integrity of )I2I /< tool steel after E/$F, International -ournal of Emerging Technology and )dvanced Engineering, 2(@) (2?12) I226>22D?(2@D=. =. *ravin %, -adhav 7 2,F )n E"perimental Investigation of Electrode 0ear %ate (E0%), $aterial %emoval %ate ($%%) and %adial #vercut (%#') in E/$ of 8igh 'arbon(8igh 'hromium steel ()I2I /<)F, International -ournal of Engineering and )dvanced Technology(I-E)T), 1(D) (2?12) I226>22@=(A=DA. 1?. 2ingh 8, 2ingh ),F 0ear .ehavior of )I2I /< 2teel 4sing 'ryogenic Treated 'opper and .rass Electrode in Electric /ischarge machiningF, International -ournal of $odern Engineering %esearch (I-$E%), 2(C) (2?12) @@C2(@@C@. 11. 2ingh 8, 2ingh ),F E"amination of 2urface %oughness 4sing /ifferent $achining *arameter in E/$F, International -ournal of $odern Engineering %esearch (I-$E%),2(C) (2?12) @@BA(@@B=.

2=2

MO@&)% TO-A DS % $$) C?O0D COMP0T&)% "arsimran Singh Anand Assistant Professor/ DA@ College/ Amritsar+ harsimran2anand1yahoo+com A3ST ACT 'loud computing is emerging as a critical information communication technology. It can be defined as Eon(demand, dynamic access to a collection of I'T resources (such as net or!s, storage, processing, applications, and services) over a net or!F. 'loud computing involves the delivery of computing services from a remote location, analogous to the ay electricity, ater, and other utilities are provided to most customers. These services are delivered through a net or!, usually the Internet. 8o ever, the gro ing demand of 'loud infrastructure has drastically increased the energy consumption of data centers, hich has become a critical issue. 8igh(energy consumption not only leads to high operational cost, but also leads to high carbon emissions hich are not environment friendly. This paper provides some insights into and help progress to ard greener cloud computing. ($4-O DS! 'loud 'omputing, *rivate 'loud, *ublic 'loud, Energy Efficiency, 7irtuali1ation, /ynamic *rovisioning. 5+ &)T OD0CT&O) The term cloud is analogous to SInternetG. 'loud computing basically involves delivery of computing resources over the Internet. It is an environment in hich virtual shared servers provide infrastructure, platform and soft are for speciali1ed corporate and user applications. In other ords, cloud computing provides a shared pool of resources hich include data storage space, net or!s and computer processing po er on a pay(as(you(use basis. 42 6ational Institute of 2tandards and Technology (6I2T) defines cloud computing as Scloud computing is a model for enabling convenient, on(demand net or! access to a shared pool of configurable computing resources (e.g., net or!s, servers, storage, applications, and services) that can be rapidly provisioned and released ith minimal management effort or service provider interaction.G J1K. >+ 3$)$,&TS O, C?O0D COMP0T&)% It has been established that cloud computing has several benefits hen compared to conventional computing. Cost ed#ction! 'loud computing drastically reduces the cost of o ning and operating the required information technology infrastructure (including hard are and soft are) by an organi1ation. eliability! It is more reliable in the sense that it enables the access to applications and data any here via the internet. Scalability! It is more scalable as it offers unlimited processing and storage capacity.
2=<

$fficiency! 'louds are considered efficient since they allo organi1ations focus on sharpening their core competencies by e"ploiting a number of cloud computing benefits such as on(demand computing resources and faster and cheaper soft are deployment capabilities at lo cost.

B+ $)$ %4 0SA%$ &) C?O0D COMP0T&)% .ut there is another side to cloud computing hich needs serious consideration. The gro th in demand for cloud computing has immensely increased the energy requirement of data centers that host cloud computing services. This high energy consumption results in high carbon emissions hich is not good for the environment. %esearch studies sho that the Information and 'ommunication Technologies (I'T) generates about 2I of the total global '# 2 emissions. )ccording to a report published by the European 4nion J1K, a decrease in carbon emission by 1DI(<?I is required before year 2?2? to !eep the global temperature increase belo 2#'. )nother report, !no n as the 2mart 2?2? report JCK, EEnabling the ;o 'arbon Economy in the Information )geF estimates that the environmental footprint from data centers ill more than triple bet een 2??2 and 2?2?, ma!ing them the fastest gro ing contributor to the Information and 'ommunication Technology (I'T) sectorGs carbon footprint. Thus energy consumption and carbon emission by cloud infrastructures have become !ey environmental issues. Even the most efficiently built data center ill produce carbon emissions rather than eliminating them since they are so designed as to reduce electricity costs and not '#2 emissions. 9ollo ing are the details of energy consumption in a cloud> Data Center! ) typical data center has a gate ay router, a local area net or!, servers and storage. 2ometimes, several data centers ith dedicated transport bet een them are maintained ithin a single cloud J2K. 4ser data passes from his o n device through an Internet 2ervice *roviderGs router to a gate ay router ithin a cloud data center. 0ithin data centers, data moves in a local area net or! and is processed on virtual machines hich may further access storage servers. Each of these devices as ell as net or! devices hich are used to serve cloud users consumes energy J1K.) ma+or cause of energy consumption in data centers is the idle po er asted hen servers run at lo utili1ation J@K.*o er consumption in transport represents a significant proportion of total po er consumption for cloud storage services at medium and high usage rates. )s the number of file do nloads per hour increases, the energy consumption in transport gro s and storage as a service consumes more po er resulting in very less energy efficient cloud storage. )lso a substantial amount of energy is consumed by po er distribution systems, conditioning equipment and cooling infrastructures. It has been observed that the cooling equipments consume almost the same energy as that consumed by the servers and storage systems in a data center. )nother ma+or factor for increased energy consumption is the e"ponentially gro ing number of terminals, a phenomenon !no n as the net or! effect. 'loud providers in order to increase their financial gains aim at increasing the si1e of the cloud by adding more servers&terminals to the e"isting cloud. This results in not only an increase in the communication energy but also decrease in the computation energy saving
2=@

from e"isting servers&terminals. )s long as the per terminal computation energy is smaller than the communication energy consumption, the cloud computing cannot support indefinitely many terminals in an energy efficient manner. /ata center *o er 4sage Effectiveness (*4E) defined as the ratio of total data center po er consumption divided by the po er consumption of the IT equipment is a standard metric useful in measuring po er efficiency of data centers. ;esser the value of *4E, more energy efficient the data center is. )etwor* Devices! The net or! system is another area of concern since it also consumes a non(negligible fraction of the total po er consumption. The transmission and s itching net or!s in the Internet account for another ?.@I of total electricity consumption in broadband(enabled countries. 2ince the data and applications need to be transferred from userGs machine to the cloud, much more data communication band idth is required. In general, userGs computer is connected to Ethernet s itch of Internet 2ervice *rovider. The .road 6et or! ,ate ay (.6,) net or! performs traffic management and authentication functions on the pac!ets received by Ethernet s itch. These .6, routers in turn are connected to other Internet routers. Each of these net or! devices consume po er hich increases ith the increase in traffic volume. )ccording to a research, public cloud consumes more po er in transmission and s itching compared to a private net or!. $ost of the energy in net or! devices is asted because they are designed to handle orst case scenario. 8ence, the energy consumption of these devices remains almost the same during both pea! time and idle state. The 2mart 2?2? analysis forecast JCK that the global carbon footprint of the main components of cloud based computing R data centers and the communications net or! ould see their emissions gro , on average BI and DI respectively, each year bet een 2??2 and 2?2?. Software Applications! )nother important factor that contributes to energy consumption is the ay soft are applications are designed and implemented. 'loud computing enables a user to run applications o ned by him or those offered by the cloud itself. In both the cases, the energy consumption depends on the application being run. If the application is long running ith high '*4 and memory requirements then e"ecution ill result in resources consuming more energy. The energy inefficiency in e"ecution of an application is due to inaccurate design and implementation. D+ TO-A DS % $$) C?O0D COMP0T&)% 9ollo ing are some of the measures that can ma!e the design and practical implementation of clouds green. Application ?evel! In order to save energy at application level, the soft are needs to be installed on such an infrastructure hich saves the po er hile e"ecuting it. 9or this, the research and analysis of trade(off bet een performance and energy consumption must be done for the soft are on various platforms and hard are. 9urther, the energy consumption at the compiler level and code level should be considered hile designing the future application implementations J1K.

2=D

0se of @irt#ali'ation! #ne ay of increasing the energy efficiency of data centers is to virtuali1e the servers, ith each server being divided up into virtual machines J2K. The consolidation of virtual machines, live migration and performance isolation, are some of the features of virtuali1ation hich help in minimi1ing po er consumption. 4tili1ing several virtual machines on a server is !no n as S2erver consolidationG J2K. It means that lesser number of actual physical servers is necessary and hence it helps in managing the trade(off bet een performance, resource utili1ation and energy consumption. 7irtual machine migration allo s fle"ible and dynamic resource management hile facilitating fault management and lo er maintenance cost J1K. 0se of efficient sched#ling and provisioning! Energy efficiency can be achieved by means of dynamic provisioning algorithms that select a small number of active servers for servicing and rest of the servers can be s itched to a lo po er setting J2K. There are some techniques hich focus on minimi1ing the over provisioning using consolidation of virtuali1ed server. Then, researchers have also proposed some techniques for improving the energy efficiency of storage systems. #ne such technique !no n as ;ightning divides the storage servers into cold and hot logical 1ones using data classification. These servers are then s itched to inactive state for energy saving. Datacenter ?evel 6Cooling/ "ardware/ )etwor*/ Storage8 Energy effectiveness can be increased by ma!ing the I'T resources as ell as the other resources such as cooling, accommodation and net or! devices energy efficient. 9irst and foremost, steps must be ta!en to construct sustainable data center. /atacenters should be constructed in such a ay so as to harness the energy from rene able sources such as sun and ind. 42 has a standard for sustainable construction called ;EE/ J2K. )nother ma+or factor contributing to ards high(energy consumption is the cooling system employed in datacenters. It has been proved that energy needed to run cooling systems accounts for up to D?I of the total amount of energy consumed by the datacenter. $inimi1ing the energy consumption helps improve *4E(type metrics J2K. /atacenters use either air or ater based cooling systems. 'hillers are ater(cooling systems that produce cooled ater for the ventilation units. ) number of metrics are available for measuring the efficiency of different cooling systems. COP! the ratio bet een the quantity of heat removed and the electrical energy consumed. $$ ! energy efficiency ratio for roof mounted cooling systems. 'ooling systems positioned close to the servers are more efficient than those that cool the entire room or space J2K. Energy efficiency can also be achieved by deploying ne po er efficient servers and processors. $any ne energy efficient server models are currently available in mar!et. 'onsolidation of storage systems helps to further reduce the energy requirements of IT 2ystems. 9or E"ample, 2torage )rea 6et or!s allo building of an efficient storage net or! that consolidates all storage. The use of energy efficient dis!s such as tiered storage allo s better efficiency J1K. Incorporation of advanced po er management techniques, for e"ample a lo po er or idling state hen the server is hardly being used and dynamic voltage and frequency
2=C

scaling, hich allo s the voltage and also the energy consumption to be altered. These techniques combined ith effective scheduling methods bring energy efficiency J2K.The energy efficiency in net or!ing can be achieved by embedding energy a areness in the design of the net or! devices and protocols of net or!s. 2everal solutions have been proposed for the same li!e, resource consolidation, virtuali1ation, selective connectedness and proportional computing. %esource consolidation helps in regrouping the under( utili1ed devices to reduce the global consumption. 2elective connectedness allo s turning off unused resources at the edge of the net or!. 7irtuali1ation as already discussed helps in improving the hard are utili1ation. *roportional computing is applied to the system as a hole and to individual devices and components J1K. C+ CO)C?0S&O) There is no doubt that cloud computing has enormous potential to transform the orld of IT. .ut the energy demand of cloud cannot be neglected since it leads to a substantial amount of carbon emissions. 8ence, there is need to pave ay for green cloud computing. 'loud providers need to reduce the electricity demand of clouds and ta!e ma+or steps in achieving high energy efficiency rather than +ust loo!ing for financial benefits. $,$ $)C$S 1. 2aurabh 5umar ,arg and %a+!umar .uyya, E,reen 'loud 'omputing and Environmental 2ustainabilityF. 2. *ieter $eulenhoff, E'loud 'omputing> ,rey or ,reenF. <. -ayant .aliga, %obert 0 ) )yre, 5erry 8inton and %odney 2 Tuc!er, E,reen 'loud 'omputing> .alancing Energy in *ocessing, 2torage and TransportF. @. 9eng 2eng 'hu, 5 ang 'heng 'hen and 'hen($ou 'heng, ETo ard ,reen 'loud 'omputingF. D. 2ri!rishna Iyengar, E,reen 'loud 'omputingF. C. .greenpeace.org&coolit

2=B

-$3 M$T &CS ,O $7P03?&S"&)% &) &)D&A! ACC$SS&3&?&T4/ PO TA3&?&T4 A)D 0SA3&?&T4 (apil %oyal Asst+ Prof+ Comp#ter Sc+ & &T/ DA@ College/ Amritsar goyal2*apil1yahoo+com A3ST ACT The research paper ill highlight the impact of e(publishing in India on $obile computing platforms. The theme ill sho case the formation of or!ing $odel under the umbrella of 0<' India office, T/I; program of /ept. of Electronics 3 Information Technology, ,overnment of India. The multidisciplinary approach ill incorporate all ma+or sta!eholders from industry, academia and ,overnment. The ob+ectives of this sub(theme are> (i) /eveloping $obile Ecosystem for e(publishing in Indian ;anguages. (ii) *roliferation of 0<' 2tandards for e(publishing. (iii) /eveloping a best practices frame or! in Indian ;anguages integrating 0<'. ($4-O DS! 0<', T/I;, e(publishing, ecosystem, best practices. &)T OD0CT&O) 0eb $etrics is the systematic procedure to measure, collect, analysis and advance of internet based e(publishing standards in India. The basic ob+ective is to understand and optimi1e eb usage for accessibility, portability and usability for Internet based eb traffic. 0eb $etric is a tool for measuring mobile computing platform and can be used as a technique for business and mar!et driven analytics research both in public sector and corporate domain to assess and improve the effectiveness of a e(publishing standards in India. It ould further help in accessing consumer readiness Inde", 0eb based $ar!eting strategies and application specific soft are to accelerate mobility in e%eading space in India.. It helps gauge traffic and popularity trends hich is useful for mar!et research. The U$V way System gaining Moment#m+ 0<' (E*4.) specification *rotocol. 0orld 0ide 0eb 'onsortium is or!ing in right direction to provide sustainable approach to ards e(publishing in India. They have already started their India office in the year 2?1? in association ith $)IT. 2ince India diversity can better understand by its people living in remote areas spea!ing many languages. It is very challenging tas! for the 0eb $etric engineers to synchroni1e the availability of tools and best practice. The E*4. specification is a distribution and interchange format standard for digital publications and documents. E*4. defines a means of representing, pac!aging and encoding structured and semantically enhanced 0eb content X including 8T$;D, '22, 27,, images, and other resources X for distribution in a single (file format. E*4. has been idely adopted as the format for digital boo!s (e.oo!s),
2=A

TD&? Technology /evelopment for Indian ;anguages (T/I;) is an incredible initiated ta!en by the /epartment of Electronics 3 Information Technology (/eitH), $inistry of 'ommunication 3 Information Technology ($'3IT), ,ovt. of India ith basic aim to develop I'T based Info *rocessing Tools and Techniques to improve and enhance human(machine interaction on $obility platform irrespective to language, translator and standards. 2ome of common research efforts made by T/I; are> /evelopment of English to Indian ;anguages $achine Translation 2ystem ()nuvada!sh) /evelopment of English to Indian ;anguages $achine Translation ($T) 2ystem ith )ngla(.harti Technology> /evelopment of Indian ;anguage to Indian ;anguage $achine Translation 2ystem (2ampar!)> /evelopment of 'ross(lingual Information )ccess (';I)) /evelopment of %obust /ocument )nalysis 3 %ecognition 2ystem for Indian ;anguages (#'%) /evelopment of #n(line hand riting recognition system (#80%) /evelopment of Te"t to 2peech 2ystem for Indian ;anguages (TT2) /evelopment of )utomatic 2peech %ecognition in Indian ;anguages ()2%) /evelopment of 2ans!rit $achine Translation 2ystem It ould also promote $ulti(;anguage Technology best practice on standardi1ation via internet or!ing bet een various departments or!ing in public and private domain both locally and globally. It ould further ta!e guidelines from International and national standardi1ation bodies such as I2#, 46I'#/E, 0orld( ide(0eb consortium (0<') and .I2 (.ureau of Indian 2tandards) to ensure adequate representation of Indian languages in e"isting and future language technology standards. $7P03?&S"&)% , AM$-O (

,ig 5

2==

MO3&?$ $COS4ST$M &) C"A)%&)% PA AD&%M! T"$ D4)AM&C C"A)%&)% ,AC$ O, &)D&A) P03?&S"&)% The orld of e.oo!s and publishing 2tandards has undergone a paradigm shift. 'redit goes to than!s to the convergence of mobile ecosystem in global mar!et and its impact in great Indian space. Ecommerce and $commerce has given e(publishing ne and innovate platform and is used as bu11 ord for digital format of ne spapers ,boo!s, +ournals, maga1ines, reports etc. stored in electronic or digital form. The industry has itnessed gro th on account of benefits such as lo cost of production, lo investments, lo inventory storage costs, and the opportunity to reach out to larger audience across the globe in a cost effective manner 2@VBV<CD pattern. M.oo! retailers are transforming, as many customers go online to purchase. This move has put a lot of pressure on traditional chain stores to create revenue and profits. 2imilarly, digital boo!s continue to gain mar!et share, and are no estimated at AI to1?I of revenue for some ma+or publishing,M as reported by -effrey ). Trachtenberg of the 0all 2treet -ournal. 2ome of the common concerns are> ,ro th of the mar!et 6ature of boo!s people read Issues of piracy and copyright )doption of e(publishing by publishers 4pta!e by authors 3&3?&O% AP"4 1. http>&& . <.org&T%& ebarch& 2. http>&& .digital(scholarship.org&sepb& <. http>&&quod.lib.umich.edu&+&+ep&<<<C@D1.???B.2?1OrgnPmainNvie Pfullte"t @. http>&& .idpf.org&epub&vocab&structure& D. . <cindia.in C. .tdil.mit.gov.in

<??

APP?&CAT&O) O, ,0JJ4 ?O%&C APP OAC"! "A)DO@$ SC"$M$ en# Sharma Assistant Professor/D+A+@ College/ Amritsar+ ren#sharma5:;F1yahoo+co A3ST ACT 8andover initiation demands special attention in cellular mobile systems to provide uninterrupted services to the dedicated end users. Though many handover schemes have been proposed yet it has been a big as! to deliver the desired quality of service. In this paper, an efficient handover scheme has been proposed hich ma!es use of fu11y logic theory. The proposed system uses four parameters to ma!e the handover decision. These parameters are signal strength from the home base station (228), signal strength from the neighboring base station (226) , distance bet een the mobile user ($4) and the home base station and the available net or! band idth (.0) in the neighboring cells. 8igher band idth helps in achieving high data rates. The simulation results reveal that the proposed system e"ecutes an efficient handoff ta!ing care of the probability of the false handover. ($4-O DS! )vailable net or! band idth, /e(fu11ification, 9u11ification,, $embership functions. 5+ &)T OD0CT&O) ) user initiates a call in one cell and is quite li!ely to move to another cell hile the user in una are of the fact that the serving base station has changed. This process of changing the base station in order to maintain the required signal level is termed as handover i.e. the old serving base station handovers the call to a ne base station. The handover enables a user to continue his call in a ne cell ithout any interruption. 8andover not only involves loo!ing for a ne base station in a cell but also allocating voice and control signals to the channel hich is to be allocated the ne entrant in the cell. It should provide the desired quality of service (:o2) to the $4. 8andover can be classified into 2 main types> 1. 8ard 8andover> In hard handover, ) $4 is connected to only one base station throughout the entire call and is mostly used ,2$ and ,*%2 systems. 2. 2oft 8andover> ) soft handoff allo s t o or more connections to neighboring base stations to be monitored i.e. the net or! is overlapped. 8andoff may also be classified as 7ertical handoff and hori1ontal handoff J2K. The signal strength from $4 is continuously monitored through a reverse channel by the cell site. )s $4 moves a ay from the base station, there is a gradual decrease in the signal strength from the base station. The cell site begins to loo! for ne er base stations to handover the call hen the signal strength decreases continuously. 0hen the signal strength reaches a threshold level, the call is transferred to a ne base hich presents the ma"imum signal strength to the $4.

<?1

,ig 5! A cell#lar mobile system The traditional schemes generally ma!es use of the received signal strength from the home base station (228) and that of the neighboring base station (226) hile ignoring the other parameters such as the available net or! band idth, distance hich changes continuously according to the velocity of the $4 and play an important role in the handover decision ma!ing. In this paper, e have proposed a handover scheme using fu11y logic approach considering four parameters stated belo 1. SS"! denotes the signal strength from the home base station. It indicates the availability of the net or!. 2. SS)! denotes the signal strength from the neighboring base station. It indicates the availability in the neighboring net or!. <. Distance 6D8! denotes ho far the mobile unit is from the home base station. @. )etwor* 3andwidth 63-8> denotes the availability of channels the neighboring cells. >+ $?AT$D -O ( In the past, several schemes have been suggested in order to provide a seamless handoff. ?eonard 3arolli/ ,atos Ehafa/ Arjan (oyama/ A*io (oyama/ Ma*ota Ta*i'awa J1K proposed an intelligent handoff system using fu11y logic and random al! model considering parameters signal strength from present and neighboring base station and the distance bet een mobile station and base station. It removes the ping(pong effect during handover. Presila &srat/ )amvi Cha*ma and M+M+A "ashem J2K proposed adaptive handoff management protocol using fu11y logic approach considering parameters received signal strength, distance and speed. They provide simulation for both inter and intra(system handoff. King "eJ<K proposed vertical handoff decision algorithm bet een 00)6 and 0;)6 using fu11y logic approach considering parameters received signal strength, available net or! band idth, monetary cost and user preferences. It reduces redundant handoffs and balanced net or! resources. B+ "A)DO,, D$C&S&O) P O3?$M To enhance the system capacity and efficient utili1ation of the channel band idth, the cells have been divided into smaller micro cells. In such a case, the handoff occurrence is inversely proportional to the cell si1e. 2uch conditions demand the triggering of handoff only if necessary i.e. the time at hich the handoff occurs should be accurate. /ue to the fading effects in cellular environment, it is hard to design an appropriate algorithm hich e"ecutes the handoff at that instant.

<?2

To eliminate the un anted handoffGs, a value greater than the threshold value is set. If the threshold level at the cell boundary is (=?d., e set up a value higher than (=?d. say (=?d.Z such that the handoff is triggered at this threshold. The handover decision depends upon the value of . 2electing an appropriate value of reduces the unnecessary handoffGs. The above proposition does not give good results all the time so e have to consider some other parameters to ma!e the accurate handover decision. 2ince the available channels are limited and all the users cannot be the accommodated at same time, so the base station loo!s for those neighbor hich have sufficient band idth and best signal strength. D+ ,0JJ4 ?O%&C APP OAC" 9u11y logic tool is a mathematical tool for dealing ith uncertainty. 9; methods offer advantages since they can operate ith imprecision data and several non linear functions ith lesser comple"ity. These methods help to ma!e the system dynamic and are capable of decision ma!ing to provide an intelligent output J@K. It has < main components> 5+ ,#''ification! is the process here the crisp values are converted into fu11y. The uncertainty in crisp values forms the fu11y values. This conversion is represented by the $ember functions. 8ence fu11ification process gives the membership values for the given crisp quantities. 9igure 2 represents an e"ample of a membership function. >+ ,#''y interference system! It is the heart of the fu11y logic system. It is also called as fu11y rule based systems. The 9I2 formulates suitable rules and ma!es the decision based upon the set of rules.

,ig >! A triang#lar membership f#nction B+ De7f#''ification! /e(fu11ification performs the inverse function of the fu11ifier. It involves fu11y to crisp conversions so that the crisp quantities may be utili1ed for further processing. It is also called as Erounding offF method. 2everal methods are available for defu11ifying li!e centroid method, eighted average method, center of sums etc. 9igure < represents an entire fu11y logic system. In the proposed fu11y logic system, the input to the 9I2 are the signal strength from the home base station (228) and the neighbor base station (226) , the distance of mobile unit from the home base station (/) and the available net or! band idth in the neighbor cells. The output is the handover decision (8#).In this paper, the handover threshold is set as ?.=<B

<?<

,ig B! A f#''y logic system i.e. as soon as the handover value nears this value, the handover process begins. 8#T8 P ?.=<B The 9I2 allocates the membership values to the input and the output parameters. The follo ing fu11y sets are formed> } (228) P d0ea! (0), 6ot 2o 0ea! (620), ,ood (,) and E"cellent (E)e } (226) P d0ea! (0), 6ot 2o 0ea! (620), ,ood (,) and E"cellent (E)e } (/) P d6ear (6), 6ot 2o 6ear (626), 6ot 2o 9ar (629), 9ar (9)e } ().0) P d7ery ;o (7;), ;o (;), 8igh (8), 7ery 8igh (78)e } (8#) P d;o (;), $edium ($), 8igh (8), 7ery 8igh (78)e The 9I2 houses a system called 9u11y %ule .ase (9%.) hich consists of several rules. These rules are formed by several if(then statements hich are responsible for the decision ma!ing and producing the requisite output. 2uch rule based systems are called as universal appro"imators.

(a)

(b)

(c)

(d)

<?@

(e) ,ig D ! Membership f#nctions for 6a8 SS"/ 6b8 SS)/ 6c8 Distance/ 6d8 A3-/ 6e8 "andover decision

,ig C! ,lowchart for handover decision 9igure D represents the flo chart hich is the basis of the simulation in order to produce an efficient handover decision. The base station continuously monitors the signal strength through a reverse channel. ) high received signal strength in the home cell ith a minimal distance from the base station eliminates any need for handover. )s the signal strength reduces to a value belo a prescribed level, then the system loo!s for the signal strength of neighboring base stations and the distance bet een the $4 and the home station. If the $4 is nearing the cell boundary and the distance. Table 5+ ,#''y r#les set

<?D

228 E , , , , , , , 620 620 620 620 620 620 620 620 620 620 620 620

/istance ( 6 6 626 626 629 629 629 6 626 629 629 629 629 629 629 629 9 9 9

.and idth 226 ( ( ( 0 ( 620 ( 0 ( 620 ( 0 ( 620 ( , ( 0 ( 0 7; 0 7; 620 ; 620 8 620 7; , ; , 8 , 7; 620 ; 620 8 620

8# ; ; ; ; ; ; $ $ $ $ ; ; $ $ $ $ 8 ; $ $

228 620 620 620 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

/istance 9 9 9 6 626 626 629 629 629 629 629 629 9 9 9 9 9 9 9 9

.and idth 226 8 , 8 E 78 E ( ( ( 0 ( 620 7; 0 7; 620 7; , ; , 8 , 78 , 7; , ; , 8 , 78 , 7; E ; E 8 E 78 E

8# 8 78 78 ; ; ; ; ; ; $ 8 8 ; $ 78 78 $ 8 78 78

from the home cell is increasing rapidly, it loo!s for the ne base stations in the ne cell and measures their receiver signal strength and the band idth available in the ne cells. The handover criterion is based on the fact that the ne base station should not only have a good signal strength but also sufficient band idth to accommodate high data rates. If the signal strength of neighboring base station is e"cellent but the available net or! band idth is very lo , then a search for a ne base station begins hich has good signal strength as ell as high available band idth. If the $4 is near the base station in home cell but the signal strength is quite lo i.e. the $4 is in hole, the base station aits for some time. If the user remains in a hole for a longer period, the call drop may occur. Table 1 represents the set of rules hich have been formulated to calculate the handover decision. #n the basis of these rules e have calculated the handoff values in various situations considering the other parameters also. 0e have ta!en lesser number of rules in order to minimi1e latency and ta!e the handover decision at accurate time.

<?C

C+ S&M0?AT&O) $S0?TS ) relation bet een 228, / and 8#> 9igure C represents the relation bet een the parameters. )s the distance from the .2 increases and the 228 decreases, e see a gradual increase in the value of handover.

,ig G

b. %elation bet een 228, 226 and 8#> 9igure B represents the relation bet een the parameters. )s the 226fff228, the probability of handover is more. c. %elation bet een 226, .0 and 8#> 9igure A represents the relation bet een the parameters. )s the 226fff228, the probability of handover is more.

,ig ;! elation between SS"/ SS) and "O

,ig F! elation between SS"/ 3- and "O

<?B

Table 2 sho s the minimum and ma"imum values of various parameters to ma!e the accurate handover decision and Table < sho s the results of the simulation. The handover threshold has been set to ?.=<B. Table >+ Min and maH val#es of parameters $in 228 / .0 226 226(d.m ) (CB (A<.@ (1?1 (1?1 (111 (111 (111 (12? (1<1 (1@?d.m ?!m ?!bps (1@?d.m $a" (C?d.m 2.D!m 1??!bps (C?d.m 8andover ?.2D1 ?.2@ ?.D=2 ?.BB2 ?.A=D ?.A=D 1.?C 1.1 1.<

Table B+ Sim#lation res#lts /istance(!m) .0(!bps) 226 (d.m) ?.C<D D?.A (11? ?.=?@ 1.<< 1.<< 1.C< 1.AB 1.AB 1.AB 2.?2 D<.A D<.A C@.@ DC.A DC.A DC.A DC.A BC.D (==.2 (==.2 (AD.< (=D (=D (AD.< (=?.A (CB.<

G+ CO)C?0S&O) The proposed fu11y logic system that e have used to demonstrate the handover decision ma!ing, emphasis on the available band idth from the neighboring cells. The simulation results sho that a better handover decision can be made by selecting the required threshold limits. The simulation results vary depending upon the varying user requirements. 8o ever, in real situations the fu11y sets can be modified to achieve better effects $,$ $)C$S 1. ;eonard .arolli, 9atos Vhafa, )r+an 5oyama, )!io 5oyama, $a!ota Ta!i1a a, E)n Intelligent 8andoff 2ystem for 0ireless 'ellular 6et or!s 4sing 9u11y ;ogic and %andom 0al! $odelF, *roc. 2??A IEEE International 'onference on 'omple", Intelligent and 2oft are Intensive 2ystems, pp. D(11, 2??A. 2. *resila Israt, 6amvi 'ha!ma and $.$.) 8ashem, E) 9u11y ;ogic(.ased )daptive 8andoff $anagement *rotocol for 6e"t(,eneration 0ireless 2ystemsF, *roc. 11 th International 'onference on 'omputer and Information Technology I''IT 2??A , pp.2AA(2=<, /ec. 2??A.

<?A

<. :ing 8e, E) 9u11y ;ogic .ased 7ertical 8andoff /ecision )lgorithm bet een 00)6 and 0;)6F, *roc. International 'onference on 6et or!ing and /igital 2ociety, pp. DC1(DC@, IEEE 2?1?. @. 2aurav 2hah, $aina! $u!her+ee, 2armastha 6eogy, E98$2> 9u11y ;ogic(based 8andoff $anagement 2cheme for ireless 6et or!sF *roc. 1Dth International 'onference on )dvanced 'omputing and 'ommunication, pp. @?A(@1<, IEEE 2??B. D. Hing(8ong 0ang, 'hih(*eng 8su, 5uo(9eng 8uang and 0ei('hia 8uang, E8andoff decision scheme ith guaranteed :o2 in heterogeneous net or!F, *roc. 2??A 9irst IEEE International 'onference on 4bi($edia 'omputing , IEEE *ress, -uly 2??A, pp.1<AR1@<, doi>1?.11?=&4$E/I). 2??A.@DB?AB=. C. 5. *ahlavan, et al. E8andoff in hybrid mobile data net or!sF, IEEE *ersonal 'ommunications, )pril 2???, pp.<@(@B. B. %. .ere1divin, %. .reining, %. Topp, E6e"t(,eneration 0ireless 'ommunication 'oncepts and TechnologiesF, IEEE 'ommunication $aga1ine, 7ol. @?, 6o. <, pp. 1?A(11C, 2??2.9. )!yildi1, -. $c6air, -.2.$. 8o, 8. 41unalioglu, 0. 0ang, E$obility $anagement for 6e"t ,eneration 0irteless 2ystemsF, *roc. #f IEEE, 7ol. AB, 6o. A, pp. 1<@B(1<A@, )ug. 1===. A. Tripathi 6./., %eed -.8., and 7an;andingham 8.9., E9u11y logic based adaptive handoff algorithms for microcellular systemsF, IEEE @=th 7ehicular Technology 'onference, 7ol. 2, pp. 1@1=(1@2@, -ul. 1===.

<?=

&MA%$ P OC$SS&)% APP?&CAT&O)S &) ,OOD &)D0ST &$S Sandeep %#pta Assistant Professor/ "ind# College/ Amritsar+ Digital image processing is the use of computer algorithms to perform image processing on digital images. )s a subcategory or field of digital signal processing, digital image processing has many advantages over analog image processing. It allo s a much ider range of algorithms to be applied to the input data and can avoid problems such as the build(up of noise and signal distortion during processing. 2ince images are defined over t o dimensions (perhaps more) digital image processing may be modeled in the form of $ultidimensional 2ystem. The processing of data using multi(dimensional system has many advantages in food processing industries li!e identification of standard si1e of food item, colors and ripeness. In the last fe years thermal imaging has found its ay into many more commercial applications. $ost of these applications require a lo cost product ith an uncooled detector.In the food industry, itGs essential to carefully control the temperature of perishable goods throughout production, transportation, storage, and sales. %epeated arnings about illnesses due to tainted and improperly coo!ed foods highlight the need for tighter process control. .ecause this almost al ays involves a human factor, food processors need tools that automate crucial operations in a ay that helps minimi1e human error hile holding do n costs.Thermal imaging cameras are such a tool. 4sing thermal imaging cameras, you can ma!e automated non(contact temperature measurements in many food processing applications. )nalog video outputs can be vie ed on video monitors, and digital temperature data, including $*E,@ video outputs, can be routed to a computer via Ethernet.The main elements doing non(contact temperature measurements in the food processing industry are a thermal imaging camera and associated soft are. They act as EsmartF non(contact sensors to perform 1??I inspections, measuring the temperature of equipment, refrigerated products, and coo!ed foods as they e"it the coo!ing process.Thermal imaging cameras are easy to use, small, and can be positioned almost any here as needed. They can also be used to inspect pac!age sealing, and improve efficiency in other food processing operations.

. ,ig 5 ) fi"ed mounted thermal imaging camera. It can be used for all types of monitoring in the food industryThermal imaging cameras have firm are and communication interfaces that enable their use in automated process control. Third(party soft are ma!es it easy to
<1?

incorporate these tools into automated machine vision systems ithout the need for e"tensive custom( ritten control code. The use of thermal imaging cameras in food processing is gro ing for applications such as> $icro ave coo!ed meats $icro ave drying of parboiled rice and other grains *roper filling of fro1en meal pac!age compartments 'hec!ing integrity of cellophane seals over micro ave meals Inspecting bo" flap glue of over rap cartons $onitoring refrigerator and free1er compartments #ven ba!ed goods Inspecting ovens for proper temperature

,ig >

,ig B T"$ MA? &MA%&)% In the modern era thermal imaging is used as a quality assurance tool. ) thermal imaging camera hich is permanently mountained can record the temperature e.g chic!en tenders as a e"it a continuous convey or oven. The main ob+ective of the thermal imaging is ma!e sure that the food item is enough coo!ed but not overcoo!ed and dried out. %educed moisture contents also represent yield loss on a eight basis. Thermal imaging camera are also used for inspection on micro ave precoo!ing lines. It improve the product quality and safety moreover throughput can be increased hich result in a reduced loss of energy. In the food processing industry it is very important to control the temperature of perishable goods throughout production ,transportation, storage and sales.

<11

$K0&PM$)T MO)&TO &)% In addition to coo!ed food inspection thermal imaging cameras can monitor conveyor ovens. )nother use of thermal imagining cameras for conveyor ovens is monitoring temperature uniformly across the idth of the conveyor ovens coo!ing belt. PAC(&)% &)SP$CT&O) Thermal imaging cameras are used to locate ob+ects and patterns in the image. The different soft are are used for pattern matching in the production of fro1en meal for the proper filling of food tray compartment thermal machine vision can use pattern recognition soft are.)n issue affecting product safety indirectly is the integrity of cartons that over rap and protect food containers. #ne of the most cost(effective ays of sealing over rap cartons is to use heated glue spots on the carton flaps. In the past, the integrity of the spot gluing as determined by periodically doing destructive testing on several samples. This as time( consuming and costly. .ecause the glue is heated, a thermal imaging camera can EseeF through the cardboard to chec! the pattern and si1e of the applied glue spots. The camera can be set up to loo! at predefined areas of the flaps here glue should be applied, and verify spot si1es and their temperatures.

,ig D Het another application for thermal imaging cameras is monitoring container filling operations. )lthough this is seldom a product safety issue, it does affect yield and compliance ith regulations. /ifferent areas on the bottle can be defined and used to trigger an alarm and remove bottles that are over(or under(filled. Thermal imaging cameras are a better alternative to visible light cameras hen a bottle or +ar is made of dar! colored glass or plastic. A0TOMAT&)% M$AS0 $M$)TS )pplication soft are currently available for thermal imaging cameras includes a ide variety of functions that support automated food processing applications. This soft are complements and or!s in con+unction ith firm are built into thermal imaging cameras. The imaging tools and libraries in these pac!ages are hard are( and language(independent, ma!ing it easy
<12

for food processing engineers to quic!ly implement thermal monitoring and control systems.Thermal imaging cameras themselves provide the user ith different operating modes that support correct temperature measurements under various conditions. T o functions commonly found in these cameras are a spotmeter and area measurements.The spotmeter finds the temperature at a particular point. The area function isolates a selected area of an ob+ect or scene and usually provides the ma"imum, minimum, and average temperatures inside that area. The temperature measurement range typically is selectable by the user. )s an ad+unct to the temperature range selection, most cameras allo a user to set up a color scale or gray scale to optimi1e the camera image. $,$ $)C$S 1# $ilan 2on!a, 7aclav 8lavac and %oger .oyle (1===). $mage )rocessing, Anal sis, and "achine -ision. *02 *ublishing. 2. 2. 9arsiu, /. %obinson, $. Elad, and *. $ilanfar. M)dvances and 'hallenges in 2uper(%esolutionM, International -ournal of Imaging 2ystems and Technology, 7olume 1@, no 2, pp. @B(DB, )ugust 2??@. 3# 0. 0aterston M9ood processing magic machines, 7olume 1, pp. 1@(21, )ugust 2??A.

<1<

$7Commerce in &ndia Amandeep (a#r Comp#ter Science/ TS%%S College+Amritsar+ .iwan .yoti Comp#ter Science/ TS%%S College/Amritsar+

A3ST ACT )dvances in telecommunications and computer technologies in recent years have made computer net or!s an integral part of the economic infrastructure. $ore and more companies are facilitating transactions over eb. 9or developing countries li!e India, e( commerce offers considerable opportunity. ;o cost of personal computers, a gro ing installed base for Internet use and an increasingly competitive Internet 2ervice *rovider (I2*) mar!et has helped in fueling E(commerce gro th in India. .ut there are certain dra bac!s that must be apprehended. This study e"amines the e"isting status and current challenges of E('ommerce in India (eywords! E('ommerce, Technology, Internet, 'hallenges, /ra bac!s. 5+ &)T OD0CT&O) In the emerging global economy, e(business has increasingly become a necessary component of business strategy and a strong catalyst for economic development. The integration of information and communications technology (I'T) in business has revolutioni1ed relationships ithin organi1ations and those bet een and among organi1ations and individuals. 2pecifically, the useof I'T in business has Enhanced productivity,encouraged greater customer participation, and enabled mass customi1ation, besides reducing costs. /ue to fast developments in internet technology and increase in number of internet users (from @2?????? in 2??B to A1?????? in 2?1?), Indians are already participating in e( commerce, either as seller or buyer. There is tremendous increase in E('ommerce transactions in India during recent years. The si1e of e(commerce mar!et in India is orth around %s =,D?? crore, out of hich the online shopping mar!et is orth %s 1,<?? crore. 0hile online shopping globally is gro ing at around A(1?I, in India the gro th rate is <?I. .ut apart from all this progress of E(commerce in India there are still some challenges and dra bac!s that require attention and there is a great need of redefining E('ommerce standards at this stage.. >+ A P $S$)T SC$)A &O .y providing the quic! and convenient ays of e"changing goods and services both regionally and globally, E ('ommerce has changed the hole scenario of business. )s a place for direct retail shopping, ith its 2@(hour availability, a global reach, the ability to interact and provide custom information and ordering, and multimedia prospects, the 0eb is rapidly becoming a multibillion dollar source of revenue for the
<1@

orldLs businesses. ) number of businesses already reported considerable success. )s early as the middle of 1==B, /ell 'omputers r e p o r t e d o r d e r s o f a million dollars a day. .y early 1===, pro+ected e(commerce revenues for business ere in the billions of dollars and the stoc!s of companies s!illed i n E ('ommerce ere touching n e highs. )lthough many so(called dotcom retailers disappeared in the economic sha!eout of 2???, 0eb retailing sites such as ama1on.com, cdno .com, and compudataonline.com continued to gro . )ccording to E ( mar!eters, E('ommerce in )sia *acific rises every year and it has been predicted by them that the Ecommerce mar!et may ma!e a hi!e from UD=.1 billion at 2??C to U1CA.B billion by 2?11. The Internet mar!eting is also increasing in India since last D years. 'urrently, mos t of the b u s i n e s s people are doing their business online due to more development in technology a n d internet users across the India. /ay by day, online shopping is truly catching on in India, traditional bric! ith ma+or Indian online portals to display their products and advertise their services. The #nline Travel Industry is the biggest segment in E('ommerce and is booming largely due to the Internet(savvy urban population. The other segments, categori1ed under online non(travel industry, include e( Tailing (online retail), online classifieds and /igital /o nloads (still in a nascent stage). The online travel industry has some private players such as ma!emytrip, 'leartrip and Hatra as ell as I%'T', hich is a successful Indian %ail ays initiative. The o n l i n e classifieds segment is broadly divided into three sectorsN -obs, $atrimonial and %ealEstate. $obile 'ommerce is also gro ing rapidly and proving to be a stable and secure supplement to E( 'ommerce due to the record gro th in mobile user base in India, in recent years. 0ebsites li!e tradeindia.com have more than B??,??? registered buyers and the gro th rate of <DI every year follo ed by Indiamart.com hich claim revenues of more than %s. <A crores and gro ing at a rate of D?I every year. The total .2. transactions in India have crossed 42U1?? billion sho ing <?I to @?I gro th. In near future, E(commerce is also going to play a ma+or role in multimedia, entertainment and fashion industry. The foreign branded companies are eager to ta!e full advantage of the gro ing Indian mar!et and are trying to create mar!et for their products over the net. ,ucci 'o. an Italian iconic fashion and leather goods label is eager to ma!e its hold in India ith .usiness to business transactions. 2ome of the !ey .2. e"changes in India are tradeindia.com, mate"net.com, alibaba.com, auctionIndia.com, indiamart.com, teaaction.com, meta+unction.com, etc. )lthough business(to(business transactions play an important part in e(commerce mar!et, a share of e(commerce revenues is also generated from business to consumer transactions. %ail ay and )irlines have played a vital role in e(commerce transactions in India. Travel portals are e"ploding in India. %ecently ma!emytrip.com has sho n %s 1??? crores of turnover. Travel alone constituted D?I of %s @A?? crore online mar!et in 2??B(?A. In India, online services li!e tic!eting, ban!ing, ta" payment, bill payment, hotel room boo!ing, entertainment, online games, matrimonial sites, +ob sites, etc. are sho ing signs of development in business(to(customer transactions. There has been tremendous boost in the online business ith the stoc! e"change coming online. #nline valentine gifts and /i ali gifts are also becoming popular along ith the birthday ca!es. 4ndoubtedly, ith the middle clas s of 2AA million people , online shopping sho s
<1D

unlimited potential in India B+ C"A??$)%$S )part from all the success of E('ommerce in India, there are follo ing challenges that need to be solved> B+5+ ?ogistics 9irst and foremost, the suppliers or vendors must improve their technology and fulfillment processes. 'urrently, a lot of customer issues occur because t h e fulfillment partner either shipped a rong product or asnLt able to trac! the shipping details. 9or customers to trust this channel, they must see consistency in e"ecution. The critical step in ma!ing this happen is for the online retailers to tightly integrate their systems ith the bac!end fulfillment vendors. The online retailers must start enforcing strong penalties on vendors ho are failing on e"ecution. .etter margins at the e"pense of product quality or e"ecution should not be an option. B+>+ TaHation and %overnment Policy The government must do more to standardi1e policies related to online shopping. The octroi and rules related to shipping products across different states must be standardi1ed. )dditionally, there should also be recourse available to customers ho are victims of online fraud or bad trade practices that are polluting the online environment. B+B+ Cons#mer 3ehavior The biggest difference bet een 42 and Indian customers is that theIndian customerLs shopping behavior is still very need driven. In 42, a number of business models have thrived because there is a large segment of 'ustomers ho are impulse and deal driven. They may not have a need to buy the hand held navigation system R but +ust because it is cool, and is available for a C?I discount on a ebsite may be reason enough to purchase it. B+D+ Capital eA#irements 9or a n Indian company trying to put a successful ebsite on the orld( ide( eb, ill not only have to or! hard but pray hard too to get either funding or a credit line from a ban!. The Indian ban!s are pathetic as they ould ant to see 2(< yrs of .alance 2heet ith *rofits, because they +ust donGt understand that these ne #nline business avatars, here there is no inventory but only 8uman and Tech capital. 2o, the biggest challenge for any ne ebsite in India is 'apital. B+C+ Payment Collection In India a significant share of the revenue (h@I or more) is given to ban! hen net ban!ing facility is used. 0ith a business of thin margin, this effectively means that a company is parting a ay ith almost half of its profits. 9raudulent charges, charge bac!s etc. all become merchantGs responsibility and hence to be accounted for in the business model. D+ )$$D O, T"$ ST0D4 The need of study arises to reali1e the importance of E('ommerce for rapid gro th of economy by creating a areness about the emerging technological developments and
<1C

e"pansion of business at national as ell as international level. C+ O3.$CT&@$S O, T"$ ST0D4 The main ob+ectives of our study are as follo s> 1) To study the e"isting status of E('ommerce in India. 2) To study the importance of E('ommerce in promoting Indian business mar!et. <) To identify the challenges and dra bac!s that create need to redefine the e"isting standards of E(commerce in India G+ $S$A C" M$T"ODO?O%4 This study as conducted on the basis of sample si1e of 1?? respondents (.usinessmen&self( employed) hich as selected using non probability convenience sampling technique from the various locations of 6orth India. The analysis of both primary and secondary data as done in this study. The instrument used for primary data collection as ell structured questionnaire and secondary data as collected from boo!s, +ournals and ebsites. ;+ ,&)D&)%S O, T"$ ST0D4 The main findings of our study are as follo s> a) E(commerce industry is gro ing at a very fast rate in India. b) In the present ,lobali1ation era, .usiness organi1ations align their ob+ective and vision ith the emerged applications of information and communication technology. c) E('ommerce can help to e"pand local business to both national and international mar!ets. d) E(commerce in India is gaining great popularity. e) In order to increase consumer adoption of e( services, the sources of consumer confusion, apprehension and ris! need to be identified, understood and alleviated. f) E(commerce provides tremendous opportunities in different areas but it requires careful application for 'onsumer protection issues. g) 'urrent E('ommerce standards should be redefined to overcome the e"isting challenges. F+ CO)C?0S&O) E(commerce in Indian business has its ma+or contribution to ards the standardi1ed and sustainable business that is leading to the sustainable economy. Therefore business managers should reali1e the significant role and importance o f E(commerce t o e"pand their businesses. )s many companies, organi1ations and communities in India are beginning to ta!e advantage of the potential of e(commerce, there are certain critical challenges hich still e"ist 2o, e"isting E('ommerce standards must be revie ed to provide a ne boost to electronic business. $,$ $)C$S 1. .a+a+, 5.5., 'ountry %eport on E('ommerce (India, $inistry of and information

'ommunications

<1B

2. Technology, /epartment of Information Technology, #ffice of the 'ontroller of 'ertifying )uthorities). <. 'atering to )ffluent 2hoppers #nline, E(mar!eter 2E*TE$.E% 2@, 2?1? @. /epartment of Telecommunication, India, 2?1?. /#T )nnual %eport 2??=(2?1? D. $auricio 2. 9eather man, -oseph 2. 7alacich 3 -ohn /. 0ells (2??C)N is that authentic or artificialO 4nderstanding consumer perceptions of ris! in e(service encountersN Information 2ystem -ournalN 7ol.1C, 2??CN pp. 1?B(1<@ C. 6)22'#6 and .',, 2??1. E('ommerce #pportunities for India Inc. (study report prepared by 6)22'#$ and the .oston 'onsulting ,roup) (-uly 2??1) B. http>&&india(gro th story.blogspot.com&2??A&?1&ecommerce( industry(in(india.html A. http>&&archives.cnn.com&2???&;)0&?C&2=&india.IT.la &inde".html A# http>&& .internet orldstats.com&asia&in.htm 1?. http>&&blog.+oharee1.com&tag&e(commerce(business(statistics 11. India&http>&&dqindia.ciol.com&content&ebi1&etrends&1?.

<1A

O?$ O, T$C")O?O%4 &) SP $AD&)% O, $D0CAT&O) Dr 3+S+"#ndal Associate Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ @ipan (#mar esearch Scholar/%#r# )ana* Dev 0niversity/Amritsar+ vipanamritsar1gmail+com ,uru 6ana! /ev 4niversity, )mritsar Education remains very important tas! as much as the nation building is concerned. It the education hich ma!es reno ned persons hat they are. Teaching and education shifted from various changes in the Indian history. )fter reforms of the early =? paradigm shift in the field of education has been seen due to flooding of private sector schools&colleges&educational institutes, hich raises eyebro s that hether private sector ill full the need of society because primary motto of any private organi1ation is only to earn profit. *rivate concerns also do not spend on research and technology hich public institution has to follo . 2ocial obligations are also ma+or concern because private sectors do not or! for do ntrodden. 8o ever latest %ight to Education made some reservation to the issues, by fi"ing the 2D per cent of the seats for the poor student. :uality of education is also another important issue because balance has to be maintained bet een literacy and education. The primary purpose of this paper is to highlight various schemes of government and diffusion of education. The present paper ill also try to find relation bet een Technology and increase in education level. The secondary data ill be used for the purpose of analysis. 'harts and ,raphs ill be used for presentation purpose. ($4-O DS! :uality of teaching, privati1ation of education, ethical issues, Educational Technology, and globali1ation. $D0CAT&O) &) &)D&A

Education is one of the most po erful instruments for reducing poverty and inequality. Education is equally !ey to enhance IndiaGs competitiveness in the global economy. Therefore, ensuring access to quality education for all, in particular for the poor and rural population, is central to the economic and social development of India. The leaders of our freedom movement reali1ed the importance of girlsG education and had put it as a prime
<1=

agenda for national development. 8o ever, hen India attained independence some C? years ago, it as a formidable challenge that the ne government had to face. The national female literacy rate as an alarmingly lo A.= per centN ,ross Enrolment %atio (,E%) for girls as 2@.A per cent at primary level and @.C per cent at the upper primary level (in the 11 R 1@ years age group). 2ocial and cultural barriers to education of omen and lac! of access to organi1ed schooling had to be addressed immediately. $D0CAT&O) &) &)D&A L ($4 &)D&CATO S only CCI per cent of the Indian people are literate (BCI of men and D@I of omen). 0hile close to =? per cent children in the C(11 age groups are formally enrolled in primary schools, nearly @? per cent drop out at the primary stage. The enrolment ratios of 2cheduled 'aste (2'), 2cheduled Tribe (2T) and $uslim children (especially girls) still remain far lo er than the national average. 1.<C crore (@? per cent) children in the age group of C(1@ years remained out of school as on $arch 2??D, four years after the launch of the 2arva 2hi!sha )bhiyan. 8alf of IndiaGs schools have a lea!ing roof or no ater supply, <DI have no blac!board or furniture, and close to =? per cent have no functioning toilets. The official teacher(student norm is 1>@?, yet in some states classes average is one teacher per A? children. The prescribed norm of a school being available ithin the radius of one !ilometre is still not being fulfilled. $alnutrition, hunger and poor health remain core problems, hich comprehensively affect attendance and performance in classes. The added burden of home chores and child labour influence a large number of children, especially girls, to drop out of school. %O@$ )M$)T SC"$M$S ,O $D0CAT&O) D&,,0S&O) 5+ Central Tibetan schools administration 'entral Tibetan schools administration is autonomous organi1ation under ministry of 8uman %esource /evelopment, ,overnment of India established in 1=CC ith the ob+ective to establish, manage and assist schools in India for the education of Tibetan 'hildren living in India hile preserving and promoting their culture and heritage. >+ )ational (nowledge Commission The 6ational 5no ledge 'ommission is a high(level advisory body to the *rime $inister of India, ith the ob+ective of transforming India into a !no ledge society. In its Endeavour to transform the !no ledge landscape of the country, the 6ational 5no ledge 'ommission has submitted around <?? recommendations on 2B focus areas during its three and a half year term. 0hile the term of the 65' has come to an end, the implementation of 65'Ls recommendations is currently under ay at the 'entral and 2tate levels. B+ Sarva Shi*sha Abhiyan 2arva 2hi!sha )bhiyan (22)) is ,overnment of IndiaLs flagship programme for achievement of 4niversali1ation of Elementary Education (4EE) in a time bound manner, as mandated by ACth amendment to the 'onstitution of India ma!ing free and compulsory Education to the 'hildren of C(1@ years age group, a 9undamental %ight. 22) is being implemented in partnership ith 2tate ,overnments to cover the entire country and address the needs of 1=2 million children in 1.1 million habitations.
<2?

D+ Central &nstit#te of $d#cational Technology 'entral Institute of Educational Technology ('IET), a constituent unit of 6'E%T, came into e"istence in the year 1=A@ ith the merger of 'enter for Educational Technology and /epartment of Teaching )ids.'IET is a premiere national institute of educational technology. Its ma+or aim is to promote utili1ation of educational technologies vi1. radio, T7, films, 2atellite communications and cyber media either separately or in combinations. The institute underta!es activities to iden educational opportunities promote equity and improve quality of educational processes at school level. C+ Department of $d#cation The essence of 8uman %esource /evelopment is education, hich plays a significant and remedial role in balancing the socio(economic fabric of the 'ountry. 2ince citi1ens of India are its most valuable resource, our billion(strong nation needs the nurture and care in the form of basic education to achieve a better quality of life. This arrants an all(round development of our citi1ens, hich can be achieved by building strong foundations in education. In pursuance of this mission, the $inistry of 8uman %esource /evelopment ($8%/) as created on 2eptember 2C, 1=AD, through the 1B@th amendment to the ,overnment of India ()llocation of .usiness) %ules, 1=C1. 'urrently, the $8%/ or!s through t o departments> /epartment of 2chool Education 3 ;iteracy /epartment of 8igher Education G+ Mid Day Meal Scheme The $id /ay $eal is the orldGs largest school feeding programme reaching out to about 5> crore children in over 12.CD la!h schools&E,2 centers across the country. $id /ay $eal in schools has had a long history in India. In 1=2D, a $id /ay $eal *rogramme as introduced for disadvantaged children in $adras $unicipal 'orporation. .y the mid 1=A?s three 2tates vi1. ,u+arat, 5erala and Tamil 6adu and the 4T of *ondicherry had universali1ed a coo!ed $id /ay $eal *rogramme ith their o n resources for children studying at the primary stage .y 1==?(=1 the number of 2tates implementing the mid day meal programme ith their o n resources on a universal or a large scale had increased to t elve states. ;+ )C$ T 6ational 'ouncil of Education %esearch and Training (6'E%T) has comprehensive e"tension programme in hich departments of the 6ational Institute of Education (6IE), %egional Institute of Education (%IE), 'entral Institute of 7ocational Education ('I7E) and offices of the 9ield )dvisers in the states are engaged in activities. 2everal programmes are organised in rural and bac! ard areas to reach out to functionaries in these areas. F+ )ational ?iteracy Mission 6)?M8 6ational ;iteracy $ission (6;$) as set up by the government of India on D $ay 1=AA ith an aim to eradicate illiteracy in the country by imparting functional literacy to non(literates. Thus, 6ational ;iteracy $ission as established not only to ma!e everybody +ust self reliant in the three %s X reading, riting and arithmetic X but also to ma!e them a are of the development issues affecting the society. The target group of 6;$ is people bet een the age of 1D and <D. 6ational ;iterate $ission or!s under the guidance of 6ational ;iteracy $ission )uthority, an independent ing of $inistry of 8uman %esources and /evelopment. :+ $d#cational &nitiatives 6$&8

<21

9ounded by a group of II$) alumni, ith ample personal e"perience of educational institutions, Educational Initiatives (EI) is an effort to ensure every child learns ith understanding. Established in 2??1, Educational Initiatives believes in ma!ing a difference in education through personali1ed learning and ensuring that students learn ith understanding. EI has over 1D years of e"pertise in education, ith a deep understanding of child psychology and efficient methods of teaching, based on detailed research and a formidable database of student learning through )22ET. #ur detailed research has proven that children today respond to rote(based questions relatively ell, ho ever, they fail to ans er unfamiliar or application based questions due to unclear core concepts. $D0CAT&O) $,O MS India has the third largest higher education system in the orld, third only to the 42) and 'hina, catering to about 1? million students through ?.D million teachers and more than 1C??? higher education institutions. There ere only 2? universities and D?? colleges at the time of Independence. There are <C= 4niversities at present comprising 222 2tate 4niversities, 2? 'entral 4niversities, 1?= /eemed 4niversities, D Institutions established under 2tates legislations and 1< Institutes of national importance established by 'entral ;egislation. 9our ne 'entral 4niversity )cts are in the process of being brought in to force. In addition, there are 1A,?C@ colleges including around 1=?2 omenGs colleges. )t the beginning of the academic year 2??C(?B, the total number of students enrolled in the universities and colleges as reported to be 11?.2A la!hs. 9or the last one and half decade higher education in India has been facing crisis. The crisis has resulted from the emergence of all !inds of mismatches bet een the supply and demand of !no ledge in the 5no ledge mar!et. /espite some efforts by )I'TE, 6))', 4,', etc to maintain the quality, overall standard of higher education has continued to deteriorate, thus reducing the value of academic degree from most institution of higher learning. Education according to 0T# enables students to face the challenges of technological change and global commercial integration. Through its capacity to provide s!ills and enable effective participation in the or! force, education is crucial to economic ad+ustment. The researcher lays do n certain reforms hich can be ta!en up ith earnest by all the visionary top leaders of higher education. The points mentioned belo may not be anything ne , but it should be given serious attention by the leaders in 8igher education. 2etting up more 4niversities, or colleges is essential to increase the access to higher learning, but along ith it the overhauling of the e"isting institutions is a dire necessity to compete ith global standards. 0ith the government opening up the gates for 9/I in the 8igher education sector, there are already B?? higher education institutions from all over the orld to set up office &shops in India. If the e"isting higher education institutions do not underta!e revival programme the sic! educational institutions may have to close their institutions. )ll ready many higher education institutions have closed do n some of the non viable departments because it is not economically feasible. %eforms in E"amination> Evaluation is an integral part of learning processN it forms the basis for admission, promotion and also influenced the selection in +obs. The evaluation system has
<22

been revie ed by various committees li!e 4niversity Education commission (1=@A), Education 'ommission (1=C@(CC), 6ational 'ommission on teachers (1=A<(1=AD)N Ish arbhai *atel committee (1=BB)N )charya %amamurthi 'ommittee (1==?) and the ma+or dra bac!s cited are> u )nnual 2ystem of e"amination in many 4niversitiesN u $easuring on %ote memoryN u The present e"amination system provides grades and certification, but no feedbac! u 7alidity and reliability of results are questionableN u 1??I option is still used to a large e"tent in essay type questions. The 4niversity Education 'ommission in 1=@A stated, EIf e ere to suggest a single reform in education system, it ould be of e"amination.F Till date there has not been any remar!able improvement, despite various recommendations li!e internal assessment, continuous evaluation grading system, semester system, national e"amination and open boo! e"amination. Though @A.DBI of 4niversities follo semester pattern and <2.ACI follo s internal assessment, lacunae still e"ists. 'ontinuous evaluation is meaning full and it enhances the learning of students. *eer evaluation may also help to enhance student achievement. #pen boo! e"amination maybe considered as an innovative practice. EEducation plays a vital role in the formulation of the cultural environmental of a society. It also acts as one of the main determinants of competitive advantage of societies and nations.F 2tudents from institutions of higher learning are churned out to meet the follo ing industry needs from the 4ndergraduate and *ost graduate students> )bility to or! in a team, *erformance focus, ;eadership s!ills, )nalytical ability, 2elf confidence, %is! ta!ing, 'apability to sustain or! pressure, 9le"ibility, Interpersonal s!ills, )bility to priorities, /ealing ith an ambiguous situation, ,lobal mind set, *roblem solving, $anaging diversity and conflict, 'ommunication and *resentation s!ills, Thin!ing on their feet and 6egotiation s!ills. P &@AT&JAT&O) O, $D0CAT&O) &) &)D&A 0hile India can boast of having the third largest higher education system in the orld, reality is that India is facing a severe shortage of s!illed human resources. The reason for such a contrasting situation is the e"tremely lo quality of primary, secondary, and college(level education in India. ) possible ay(out from this situation is privati1ation of the education system, hich is predominantly public at present. *rivati1ation of education has the potential to improve the quality of education as ell as to reduce the cost. 8o ever, to ensure access to education for all, the government must design an effective transfer(payment system. )lthough IndiaGs national literacy rate currently e"ceeds BDI, a study by *ratham, a voluntary organi1ation, finds that only D<.@I children in 2tandard 7 can read a 2tandard II level te"t, and that nationally there has been a decline in the childrenLs ability to do basic mathY )nother study by 6)22'#$ finds that BDI of technical graduates and more than ADI of general graduates are unemployableY The problem ith the present Indian education system is that it is delivering a huge quantity of output, in the name of educated populace, ith poor quality. This alarming situation is due to the unavailability of s!illed teachers, the lac! of determination among the e"isting teachers to teach effectively, the poor physical infrastructure, and a lo level of parental input to ard their ardsG education. The deteriorating trend in the educational system continues largely because of the lethargy and mismanagement of the public schooling system hich accounts for nearly A?I of all schools. /espite many efforts from the government to revitali1e the public education system, the
<2<

quality of public education is d indling. 'onsequently, enrollment in private schools, colleges, and universities, is on the rise. 9or instance, a recent study finds that in the city of 8yderabad, B<I of families in slum areas send their children to private school. ) general reali1ation is that the return on investment in the private schools&colleges is much higher as compared to the government schools and colleges, ith some notable e"ceptions. The reason this is possible is the difference in approach bet een the t o. The public education system R follo ing a top(do n approach R is accountable only to the government machinery. 2o even if the teachers in public schools donLt deliver a good quality education, they donLt suffer themselves because their +obs are secure. 8o ever, in the case of private schools R run through a bottom(up approach R the management and the teachers are directly accountable to the respective parents. If they fail to deliver an e"pected quality of education, the parents ould react. They might even pull out their ards from the school. This implies that the teachersG performance ould affect the schoolsL income and reputation. 'onsequently, the teachers ould lose their +obs. 2o a private school has to deliver a good quality education. In fact, they do it better than ma+ority of the public schools. )nother issue is the cost of education. $ost of the public schools are richer than their private counterparts in terms of total e"penditure (on record, at least) and incur a much higher e"penditure on the teaching and administrative staffsG salary. The private schools, on the other hand, are thrifty about infrastructure and, in general, pay much lo er salaries to their staffs. Thus, on average, at a fraction of the e"penditure of a government school or college, a private institution can provide a better quality of education than the public institutions. Thus, private schools can provide a better education at a lo er cost. 2o privati1ation of the primary and secondary educational systems can help ameliorate the situation by improving the quality of education hile reducing the cost. .ut given IndiaLs poverty status (roughly A?I of the population lives belo the national poverty line), only a fe parents ill be able to afford the cost of private education. 8ence, one canLt advocate for a blan!et privati1ation of the entire educational system ithout ta!ing care of the cost. 8o ever, given the present scenario, an alternative system hich provides a better education, ithout over(burdening the poor parents, needs to be put in place. 6o the question is> 0hat this system should loo! li!eO The best solution, of course, is to fi" the public education system. .ut ith the trac!(record of the bureaucratic administration in India, it does not seem realistic to hope for such a positive change. #ne realistic ay, I thin!, is to gradually privati1e the schools and maybe the colleges, too. The government should ta!e care of the educational e"penditure by disbursing to the parents&guardians the cost of their ardsG attending schools through transfer payments rather than funding the schools and colleges directly. This ay, private agencies ill run the institutions, and the parents ill be able to afford the cost. 2ince the parents ill have a control over the money, they can decide hether or not to send their ards to a certain school or college. This !eeps the benefit of the public education system R affordability R intact hile bringing in the efficiency R high quality and lo cost R of the private system. The challenges of introducing such a system ill be manifold. 9irst, the government needs to ma!e sure that schools e"ist in every locality. ;eft to the entrepreneurs themselves, they may fight to open too many schools in high(income localities here the students ill be better compared to the lo income localities. 2o the policy ma!ers must ensure that lo income localities also get a due share of the schools. The government must direct and incentivi1e the program so that
<2@

marginali1ed areas are not left out. The second challenge is to ensure quality. )lthough the private schools, in general, are better than their public counterparts, but relying too much on them can also be costly. The quality of the private schools also varies significantly. 0hile some of them may provide a good quality education at a reasonable cost, others may end up becoming money(ma!ing machines ithout caring for the quality of education. 2o the government should come up ith an effective mechanism to determine, monitor, and control the quality of education in the private system. )nother challenge to implement this mechanism is to come up ith an effective transfer(payment system. This has to ta!e into account the cost of education in a given locality, the frequency of transfer(payments, and a proper utili1ation of funds disbursed. The policy(ma!ers should ma!e sure to issue the payment chec!s on a regular basis to families that have school(going children. If the chec!s or vouchers are not regular or enough to cover the costs, then again, the poor ill suffer more. The government must develop a policy frame or! so that a higher efficiency can be achieved ithout losing the poorer section of the population. Thus, privati1ation of the countryGs education system, coupled ith a ell(tailored transfer(payment system, can help improve the quality of education in India and reduce costs for parents. *rivati1ation of higher education is apparently a fledgling but elcome trend> 8igher education requires it to maintain creativity, adaptability and quality. The economic trail of liberali1ation and globali1ation demands it. 'onsidering the chronic paucity of resources, gradually unburdening itself of the additional responsibility for higher education may be advisable for the government. Instead, it could better utili1e the scarce resources for reali1ing the goal of universali1ation of elementary education and for improving the quality of school education. *rivati1ation of higher education, ho ever, is not ithout social costs. In a polity such as IndiaGs, here structured inequalities have been entrenched, privati1ation is sure to reinforce e"isting inequalities and to foster in egalitarian tendencies. This requires the social supervision of the private sector and effective measures for offsetting imbalances resulting from unequal economic capacities of the population. Thus, e again confront a dilemma> Theoretically, ho do e advance equality ithout sacrificing qualityO *ractically, ho do e control the private sector ithout curbing its creativity and initiativeO That is the challenge in higher education at the beginning of the ne millennium. $D0CAT&O)A? T$C")O?O%4 4sing Technology to Improve 2tudent )chievement 2ince educators first began to use computers in the classroom, researchers have tried to evaluate hether the use of educational technology has a significant and reliable impact on student achievement. 2earching for an ans er, researchers have reali1ed that technology cannot be treated as a single independent variable, and that student achievement is gauged not only by ho ell students perform on standardi1ed tests but also by studentsL ability to use higher(order thin!ing s!ills (such as thin!ing critically, analy1ing, ma!ing inferences, and solving problems). -udging the impact of any particular technology requires an understanding of ho it is used in the classroom and hat learning goals are held by the educators involved, !no ledge about the type of assessments that are used to evaluate improvements in student achievement, and an a areness of the comple" nature of change in the school environment.

<2D

D&,,$ $)T T4P$S O, T$C")O?O%4 In addressing the first factor, educators become a are that many different types of technology can be used to support and enhance learning. 7arious technologies deliver different !inds of content and serve different purposes in the classroom. 9or e"ample, ord processing and e( mail promote communication s!illsN database and spreadsheet programs promote organi1ational s!illsN modeling soft are promotes the understanding of science and math concepts. It is important to consider ho these electronic technologies differ and hat characteristics ma!e them important as vehicles for education (.ec!er, 1==@). Technologies available in classrooms today range from simple tool(based applications (such as ord processors) to online repositories of scientific data and primary historical documents, to closed(circuit television channels and t o( ay distance learning classrooms. Each one is li!ely to play a different role in studentsL learning. %ather than trying to describe the impact of all technologies as if they ere the same, researchers need to thin! about hat !ind of technologies are being used in the classroom and for hat purposes. 2ome researchers define technology use on the basis of its application((ho it is used for learning> Technology can be used as a tutor (e"amples are drill(and(practice soft are, tutoring systems, instructional television, computer(assisted instruction, and intelligent computer( assisted instruction)N ) means to e"plore (e"amples are '/(%#$ encyclopedias, simulations, hypermedia stac!s, net or! search tools, and microcomputer(based laboratories)N ) tool to create, compose, store, and analy1e data (e"amples are ord processing and spreadsheet soft are, database management programs, graphic soft are, des!top publishing systems, hypermedia, net or! search tools, and videotape recording and editing equipment)N and ) means to communicate ith others (e"amples are e(mail, interactive distance learning through satellite systems, computer and modem, and cable lin!s).

$D0CAT&O)A? %OA?S A)D A @&S&O) O, ?$A )&)% T" O0%" T$C")O?O%4 .efore technology is purchased or teachers participate in their first professional development session, the educational goals for students should be determined. 0hat do students need to learn, and ho can technology promote those learning goalsO To ans er these questions, the school can convene a technology planning team comprising administrators, teachers, other instructional staff, technology coordinators, students, parents, and representatives of the community. This team first develops a clear set of goals, e"pectations, and criteria for student learning based on national and state standards, the student population, and community concerns. 6e"t, it determines the types of technology that ill best support efforts to meet those goals. The vie points of parents and community members are helpful in presenting a broader perspective of s!ills that students need to succeed after school. In fact,
<2C

Education and training help pave the ay to a successful and productive future. I'Ts are important, but are certainly not the only piece in the comple" education pu11le see!ing to achieve better, more efficient and more affordable education to an ever(gro ing number of peopleN especially those traditionally e"cluded from formal education, be it for economic, social, geographical or health(related reasons.#penness, inclusion, policy and strategy also play central roles hen it comes to developing global standards. Interoperability, e"tensibility and reusability enabled by standards are indispensable in tapping the full potential of I'T in education and to tac!le the significant challenges faced by todayGs education systems. To reali1e I'T in educationGs benefits to learners, educators and society as a hole, collaboration and sta!eholder engagement ill be crucial to identifying emerging learning technologies and developing standards, technical guidelines and implementation policies.In addition to learning(specific standardi1ation activities, e have described general standardi1ation activities hich drive gro th in technology(enabled learning and bear responsibility for many innovative products and services, particularly in areas related to mobile technologies and video. #f similar importance are accessibility, security and privacy aspects, and considering the rapid spread of learning technologies, standards activities dealing ith these aspects ould do ell to include education and learning as valid use cases in their respective or! programmes. E"isting IT4(T distance learning standards ould benefit from an update and revie by users and providers of learning resources. )dditionally, a successful inclusion of I'T in a countryGs education system ill occur only if implemented through ell(crafted standards, policies and strategies. 6ational administrations and education ministries of the developing orld must play a central role in the standardi1ation process if e are to address the current disconnect bet een the development and implementation of educational technologies. Technical standards ill certainly form an integral part of national or regional I'T(in(education policiesN but in order to achieve lasting positive impacts, it is absolutely essential that e partner technical standards ith standards or best practices in training populations in the implementation, use and maintenance of educational I'Ts. $,$ $)C$S 1. )ggar al, Hash. *ublic and *rivate *artnership in *rimary Education in India> ) 2tudy of 4nrecognised 2chools in 8aryana. 6e /elhi> 6ational Institute of Educational *lanning and )dministration, 2???. 2. )nil 5 )gar al,F .eyond e"amination reformsF 4niversity ne s, 7olume @@ 6o> 2A, -uly 1?(1C, 2??C <. )nnual %eport, 2?11(2?12, $inistry of 8uman %esources /epartment, ,overnment of India @. .agal!oti 2 T, .hramarambi!a /evi, 6aveen 8egde, E2tudents *erception of :uality in 8igher Education> ) 'ase study.F 4niversity 6e s @@ 6o> @C, 6ov 1<(1=, 2??C D. .ashir, 2a+itha. M*ublic 7ersus *rivate in *rimary Education> 'omparison of 2chool Effectiveness and 'osts in Tamilnadu,M *h/ Thesis. ;ondon 2chool of Economics, 1==@. C. .erge, T.;. 3 'ollins, $. eds. (1==C). 'omputer $ediated 'ommunication and The #nline 'lassroom.vol. 2> 8igher Education.'ress!ill> 8ampton *ress, Inc.

<2B

B. .raun($un1inger, 'orina. MEducation 7ouchers ( an International 'omparison,M 'enter for 'ivil 2ociety 0or!ing *aper. 2??D. A. 'handra . * 2ingh, E%einventing Indian 4niversities> )n )pproachF, 4niversities 6e s, 7olume @D, 6o(@1, #ctober ?A(1@, 2??B. =. 'haudhury, 6a1mulN 8ammer, -effreyN 5remer, $ichaelN $uralidharan, 5arthi! and %ogers, 9. 8alsey. M$issing in )ction> Teacher and 8ealth 0or!er )bsence in /eveloping 'ountries.M -ournal of Economic *erspectives, 2??C, 2?(1), pp. =1(11C. 1?. /e, )nuradhaN 6oronha, 'laire and 2amson, $eera. MIndia> *rivate 2chools and 4niversal Elementary Education,M 2outh )sia Education 2ector, Technical 0or!ing *aper 6o. <. 0orld .an!, 2??1. 11. ,auri, 7arun and 7a da, )yesha. M7ouchers for .asic Education in /eveloping Economies> )n )ccountability *erspective.M 0orld .an! %esearch #bserver, 2??@, 7ol. 1=(2), pp. 2D=(A?. 12. ,ovinda, % and 7arghese, 6 7. :uality of *rimary 2chooling in India> ) 'ase 2tudy of $adhya *radesh. International Institute for Educational *lanning, 6ational Institute of Educational *lanning and )dministration, 1==<. 1<. ,yanpedia.in 8irschman, )lbert #. E"it, 7oice, and ;oyaltyN %esponses to /ecline in 9irms, #rgani1ations, and 2tates. 'ambridge, $ass.> 8arvard 4niversity *ress, 1=B?. 1@. 8o"by, 'aroline $inter ed. The Economics of 2chool 'hoice. 'hicago> 4niversity of 'hicago *ress, 2??<. 1D. 8o"by, 'aroline $. MIdeal 7ouchers.M $imeo, 8arvard 4niversity, 2??1. 1C. 5el!ar, 7i+ay. M;et Every *arent .e a 'onsumer,M India Today. -anuary 1C, 2??C. 1B. 5umar 2, *atel % ' and $ehta ) 5, EE"periments ith continuous evaluation and open boo! e"aminationF, 4niversity 6e s 7olume @D, 6o> 2= -uly 1C(22, 2??B 1A. 5ingdon, ,eeta ,andhi. M*rivate and *ublic 2chooling> The Indian E"perience,M $obili1ing the *rivate 2ector for *ublic Education ('onference 7olume ( forthcoming). 1=. 5ennedy 2chool of ,overnment, 8arvard 4niversity, 2??C. M*rivate 2chooling in India> 2i1e, 6ature and Equity Effects.M Economic and *olitical 0ee!ly, 1==C, <1(D1). 2?. MThe :uality and Efficiency of *rivate and *ublic Education> ) 'ase 2tudy of 4rban India.M #"ford .ulletin of Economics and 2tatistics, 1==C, DA(1), pp. DB(A1. 21. 5ingdon, ,eeta ,andhi and $u1ammil, $ohammed. M) *olitical Economy of Education in India> The 'ase of 4.*.M Economic and *olitical 0ee!ly, 2??1, <C(<2). 22. 5remer, $ichaelN 'haudhury, 6a1mulN %ogers, 9. 8alseyN $uralidharan, 5arthi! and 8ammer, -effrey. MTeacher )bsence in India> ) 2napshot.M -ournal of the European Economic )ssociation, 2??D, <(2(<), pp. CDA(CB. 2<. $ehta, )run. MElementary Education in 4nrecogni1ed 2chools in India> ) 2tudy of *un+ab .ased on /ise 2??D /ata,M 6IE*), 6e /elhi, 2??D. 2@. $hrd.gov.in& $ony % 7 2, EEnvironmental concerns on :uality of 8igher educationF, 4niversity 6e s 7olume @D, 6o> 2, -an A (1@, 2??B, 2D. $uralidharan, 5arthi!. ME"it, 7oice, and *ublic ,ood *rovision> Implications for /ecentrali1ation in /eveloping 'ountries.M $imeo, 8arvard 4niversity, 2??C.

<2A

2C. $uralidharan, 5arthi! and 5remer, $ichael. M*ublic and *rivate 2chools in %ural India,M $obili1ing the *rivate 2ector for *ublic Education ('onference 7olume ( forthcoming). 5ennedy 2chool of ,overnment, 8arvard 4niversity, 2??C. 2B. 6))' %eport 2A. *%)T8)$. )nnual 2tatus of Education %eport ()2E%). 2??D. 2=. *%#.E Team. *ublic %eport on .asic Education in India. 6e /elhi> #"ford 4niversity *ress, 1===. <?. 2hah, *arth. MEquity in Education,M .usiness 2tandard. 6e /elhi, -uly 1<, 2??D. <1. $ony % 7 2, EEnvironmental concerns on :uality of 8igher educationF, 4niversity 6e s 7olume @D, 6o> 2, -an A (1@, 2??B, <2. Tooley, -ames and /i"on, *auline. *rivate 2chools for the *oor> ) 'ase 2tudy from India. 'f.T %esearch and /evelopment, 2??<. <<. 0oessmann, ;udger. M*ublic(*rivate *artnerships in 2chooling> 'ross('ountry Evidence on Their Effectiveness in *roviding 'ognitive 2!ills,M $obili1ing the *rivate 2ector for *ublic Education ('onference 7olume ( forthcoming). 5ennedy 2chool of ,overnment, 8arvard 4niversity, 2??C. <@. .education.nic.in <D. .teachersity.org.

<2=

$ P A)D &TS &MP?$M$)TAT&O) &SS0$S $r+ Manish (#mar Assistant Professor/D+A+@ College/Amritsar maroraF<1gmail+com Mrs+ avneet (a#r Assistant Professor/(halsa College/Amritsar ravneet5>;551gmail+com A3ST ACT Enterprise %esource *lanning (E%*) is the method of trying to coalesces all processes ithin an organi1ation into one soft are system or database. E%* pro+ects are a soft are program to learn as ell as a ne ay of thin!ing. This paper provides the introduction to E%*N follo s by the advantages and disadvantages of E%* for organi1ations considering the adoption of E%*, things to be important for its implementation and also cover the some of E%* soft are out of assortment of different E%* soft are. This paper also compares four E%* soft ares,

hich ill be the base for opting enhanced as organi1ation. E%* is a long(term IT investment.

ell as healthier E%* soft are for the any

,ig#re 5 &)T OD0CT&O) E%* is short form for Enterprise %esource *lanning and contains the meaning and ob+ective in its o n name. It is the combination of three ords i.e. $nterprise is a business entity hich encompasses corporationsN 2mall 3 $edium si1ed industries, 6on(*rofit #rgani1ations, 3 ,overnment .odies. The ord enterprise is commonly used for larger organi1ations.
<<?

) reso#rce is any physical or virtual entity that has utility and value and e"ists ith limited availability. ) resource is used to provide service and produce ne goods. )n enterpriseGs goal is to utili1e its resources to ma"imum and to get ma"imum output and ith minimum cost. Planning includes the planning of organi1ational process and maintaining it. It also includes defining the goals and thin!ing of future performance of organi1ation. *lanning in an organi1ation also includes deciding the tas!s and resources to achieve the defined goals. E%*Ls solutions complies all the business activities into one system that integrates all of its core business processes such as construction, order giving out, and catalog management, tied together by E%* applications soft are. .y integrating all the sections of company li!e production, hr, finance etc in to one solution the enterprise can build a quic! decision support system hich can automatically trac! all the records of various departments. It is useful for businesses of all si1es and natures and as a robust productN it interlin!s various departments of the organi1ation and facilitates a smooth flo of information. E%* gives a business an incorporated real(time outloo! of )ssociation considers the E%* system as imperative organi1ational tool because it integrates varied secretarial systems and enable fla less transactions and production, lo er the price and improve the quality of the products

APP?&CAT&O) A $A O, $)T$ P &S$ $CO0 S$ P?A))&)% Enterprise %esource *lanning soft are integrates various business processes such as inventory, production, sales into one complete system to streamline processes and information across the entire organi1ation providing strategic planning and managerial control. 9or e"ample )**;I')TI#6 #9 E%* )%E)(0I2E

,ig >

<<1

,ig B

APP?&CAT&O) &) PA T&C0?A COMPA)4

,ig D

AD@A)TA%$S O, $ P The benefits of E%* are as follo >

<<2

1. .y integrating all of the departments the cost and time of transaction ill be reduced. 2. 6o stoc! out and over stoc! stage. <. 0ith the help of 2ales forecasting E%* ma!e allo , inventory optimi1ation. @. .etter return on inventory. D. .usiness cycle time is being shortened. C. .etter business transactions. B. 'ustomer satisfaction improved due to automating returns to customers. A. 6o mista!e or bugs in inter department +obs. =. .etter resource utility. 1?. Information accuracy improves management decisions. 11. E%* Eliminates the necessities to bring into line changes bet een various systemsX consolidation of sponsorship, promotion, sales, human supply, and industriali1ed applications. 12. E%* information available of management any here and anytime to ma!e proper 3 quic! decisions. 1<. Integrates all data and processes of an Enterprise into a unified system. 1@. Enables seamless flo of information across the Enterprise. 1D. Enabling to gain ma"imum output ith minimum cost. 1C. Tighter controls for financial compliance declaration as ell as other forms of compliance reporting. 1B. The single data source for product and services information ( such as information related to suppliers, vendors, customer orders and the products themselves ( drive rapid product development and launch cycles hich increases a companyLs overall mar!et share. 1A. Effectively managing pro+ects holistically fosters decision ma!ing at critical levels in the development and&or manufacturing process. 1=. *roviding sales and operations planning ith access to critical information fosters Mclosed loopM processes that ensures the business does not overpromise and&or under deliver to customers. 2?. )utomating business processes such as invoicing and sales and purchase orders ithin one system improves forecasting accuracy and reduces inefficiencies. D&SAD@A)TA%$S O, $ P The disadvantages of E%* are 1. 'ustomi1ation of the E%* soft are is limited. 2. %e(engineering of business processes to fit the Mindustry standardM prescribed by the E%* system may lead to a loss of competitive advantage. <. E%* systems can be very e"pensive leading to a ne category of ME%* lightM solutions @. E%*s are often seen as too rigid and too difficult to adapt to the specific or!flo and business process of some companiesXthis is cited as one of the main causes of their failure. D. $any of the integrated lin!s need high accuracy in other applications to or! effectively. ) company can achieve minimum standards, and then over time Mdirty dataM ill reduce the reliability of some applications.
<<<

C. #nce a system is established, s itching costs are very high for any one of the partners (reducing fle"ibility and strategic control at the corporate level). B. The blurring of company boundaries can cause problems in accountability, lines of responsibility, and employee morale. A. %esistance in sharing sensitive internal information bet een departments can reduce the effectiveness of the soft are. =. 2ome large organi1ations may have multiple departments ith separate, independent resources, missions, chains(of(command, etc, and consolidation into a single enterprise may yield limited benefits. 1?. The system may be too comple" measured against the actual needs of the customer. SOM$ O, $ P &) MA ($T A $ 1. )ccount $ate E"press 2. )ccount $ate ;)6 <. )ccount $ate 2:; @. '2.(2ystem D. 'H$) )ccounting 2oft are C. /elte! 7ision B. Enterprise 'ontent $anagement A. Envision V E%* =. E%* 9inancial $anagement 1?. Everest E%* COMPA &SO) O, SOM$ SO,T-A $ An overview )ccount $ate provides business accounting and E%* soft are to small( to medium(si1ed businesses in heavy and light manufacturing, professional services, arehousing and retail sectors, in particular companies ith large number of users and high transaction rates. The illingness to share source code has enabled )ccount $ate to develop partnerships ith other soft are vendors, thus broadening the functional range of its solution. )ccount $ateGs E%* solution is sold on a hosted, local basis and is offered ith 2?Z modules including business intelligence, '%$, accounts receivable&payable, payroll, inventory management and purchasing. It provides < soft ares> )''#46T$)TE ;)6 )''#46T$)TE 2:; )''#46T$)TE EV*%E22 #n the other hand 2oftra! 2ystems as formed in 1==D and provides )dagio )ccounting, a modular E%* system for businesses across the 42), 'anada and 2ingapore. .usinesses using )dagio operate in the distribution, building 3 contracting, professional services, service organi1ations, public accounting, property management and food 3 beverage industries. 0ith over A? dealers and resellers in = countries around the orld, 'anada(based 2oftra! or!s ith small to medium si1ed businesses and employs 12@ people at the headquarters in

<<@

7ancouver. 2oftra! as a arded @ stars at the '*) Technology )dvisor ) ards, 2?12 2oft are *roduct of the year at the 'anadian 'ommunity ;iving a ards. P OD0CT COMPA &SO)

Acco#nt Mate ?A) S#mmary

Acco#nt Mate SK?

Acco#nt Mate $Hpress

Adagio Acco#nting

2pecifically for businesses ith high )n a ard inning transaction volumes solution that fulfills and heavy user /esigned for )dagio )ccounting the needs of small loads. It can businesses ith up E%*, developed by to mid(si1ed accommodate to five concurrent 7ancouver(based companies ith hundreds of users that desire 2oftra!, caters for simpler inventory simultaneous users, the stability and small to medium(si1ed control needs. 'an providing speed of a 2:; businesses that manage be customi1ed businesses ith a database ith U2 to U1??$ in sales quic!ly and easily comprehensive, minimal e"pense. and revenue. to fit the ay you real(time business do business. and financial management solution. $edium 2i1e 2mall .usiness 2mall .usiness $edium 2i1e 2mall .usiness

C#stomer $edium S#itabilit 2i1e y 2mall .usiness Clo#d &nstalled Applicati on ,oc#s

.usiness .usiness .usiness .illing Intelligence&)nalyt Intelligence&)nalyti Intelligence&)naly 'osting ics cs tics 'ustomer '%$ '%$ 9inancials 2ervice 9inancials 9inancials 3 3 )ccounting /ocument Inventory $anagement 3 )ccounting )ccounting Inventory Inventory $anagement 9inancials 3

<<D

)ccounting Inventory $anagement IT #rder $anagement *lanning 3 2cheduling $anagement $anagement #rder *rocess #rder #rder $anagement $anagement $anagement $anagement *roduction *roduction 3 *roduction *roduction 3 $anufacturing $anufacturing 3 $anufacturing 3 $anufacturing *urchasing *urchasing *urchasing *urchasing :uality 'ontrol 2ales 2hipping 3 /istribution 2upply 'hain $anagement 0arehousing Mod#lar T"&)%S TO 3$ $M$M3$ 3$,O $ &MP?$M$)TAT&O) O, SO,T-A $ The right Enterprise %esource *lanning, soft are is crucial to any business. 0hen you have different facets, areas and departments all utili1ing information and other computer systems, you need a fluid, practical and secure ay to manage this sensitive information. 8ere are 1? things you need to consider> 5+ Money The cost is al ays something that is going to be important. $ore than hether or not something is affordable, you need to ascertain its value by comparing its price ith its competitors. >+ &ntegration ,iven the sensitive data and the multi(functional uses of E%*, you need to consider and loo! into ho much a ne piece of soft are ould implement itself into your business. B+ Sec#rity The sensitive data, from payroll to financial and personal information, itGs important to have a secure system, so the soft are needs to adhere to modern security standards and certificates. D+ Time 8o much time does this soft are ta!e to implement ho much time it ould ta!e staff to be trained or become familiar ith the ne soft are. C+ Prod#ctivity something that fits in more effectively and frees up your employees a bit more could increase potential productivity as a result.

<<C

G+ Staff E%* soft are might also depend on your staff. If you have an in(house IT department, are they comfortable ith your choice of soft are in charge of running, monitoring and !eeping the soft are or!ing. ;+ Si'e of Company The company si1e ill affect a lot of things. 8o many people different departments neededO F+ Clo#d v Client7Side Storage If you have sensitive information, for instance, you might ant to trust and invest in your o n secure servers. If you do go for cloud, the security and reliability of the remote server is important, but it does free up space, e"penses and the sheer resources required monitoring your o n servers. :+ S#pport and 3ac*#p If something does go rong, ho ell supported are you such as hether it can !eep bac!up files. 5<+ %rowth Potential hatLs the future gro th potential for both you and the soft areO CO)C?0S&O) Enterprise %esource *lanning *ro+ects should not be entered into lightly. 6ot only are E%* pro+ects a ne soft are program to learn, but they are a ne ay of thin!ing. 9acilities that are used to thin!ing only about hat is going on at their o n plants no have to start thin!ing on a global level. 0hile the day(to(day user of the ne E%* may +ust vie a ne E%* as +ust another soft are program to learn, management needs to vie E%* as a very useful tool that can help the organi1ation to remain competitive in this ever changing orld. There is al ays a ne er technology out there for E%* application. 8ence, e need to continuously equip end(users ith proper mindsets and s!ills to ma"imi1e the usability of the E%* system. E%* is recommended in an organi1ation not only because the advantages outnumber the disadvantages but also by !eeping in mind the ays to overcome the disadvantages. )n organi1ation has to correctly eigh the advantages and disadvantages of E%* ith comparison as ell as things to be important before implementation before going for them. $,$ $)C$S 1. http>&& .erpfocus.com&accountmate(erp(1DB.html 2. http>&& .greenbeacon.com&,reen.eacon0ebsite&$icrosoft('%$(E%*( 2olutions&Enterprise%esource*lanningE%*.asp" <. http>&& .fisscal.com&erp&inde".htmWlite @. http>&& .abuba!ershe!hani.com&blogs&technology&enterprise(resource(planning D. http>&& .r!vitsolutions.com&erp.html C. http>&& .vaishnavisoft.com&#ther2ervices&E%* B. http>&& .u!oug.org& hat( e(offer&ne s&1?(top(things(you(need(to(thin!(about( before(implementing(ne (erp(soft are& A. http>&&community.mis.temple.edu&mis21?1B?2fall2?1<&2?1<&1?&1<&advantages(and( disadvantages(of(erp(systems&

<<B

TO-A DS OPT&MA? $SO0 C$ MA)A%$M$)T &) "$T$ O%$)$O0S C?O0D DATAC$)T$ S> A D4)AM&C APP OAC" ,O D&ST &30T$D ?OAD 3A?A)C&)% Anil (#mar/ Assistant Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ @eerawali 3ehal Assistant Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ Dipti Malhotra Assistant Professor/Amritsar College of $ngineering and technology/ Amritsar+ A3ST ACT The anticipated upta!e of 'loud computing, built on ell(established research in 0eb 2ervices, net or!s, utility computing, distributed computing and virtuali1ation, ill bring many advantages in cost, fle"ibility and availability for service users. 'louds are high configured infrastructure delivers platform, soft are as service, hich helps customers to ma!e subscription for their requirements under the pay as you go model. 'loud computing is spreading globally, due to its easy and simple service oriented model. The numbers of users accessing the cloud are rising day by day. ,enerally cloud is based on data centers hich are po erful to handle large number of users. The reliability of clouds depends on the ay it handles the loads, to overcome such problem clouds must be featured ith the load balancing mechanism. ;oad balancing in cloud computing ill help clouds to increase their capability, capacity hich results in po erful and reliable clouds. This paper compares the traditional approaches ith some recent load balancing approaches and point out the shortcomings hich each of them lac!s and gives the proposal of a load balancing strategy that is dynamic, distributed and heuristic in nature. ($4-O DS7'loud 'omputing, 2ervice(#riented )rchitecture, ;oad .alancing 5+ &)T OD0CT&O) 'loud computing has recently emerged and is a ne technology for hosting and delivering services over the Internet. There are several definitions for the cloud. The definition of cloud computing provided by EThe 6ational Institute of 2tandards and TechnologyF (6I2T) says that 'loud computing is a model for enabling convenient, on(demand net or! access to a shared pool of configurable computing resources (e.g., net or!s, servers, storage, applications, and services) that can be rapidly provisioned and released ith minimal management effort or service provider interaction. 'loud computing provide infrastructure, platform, and soft are as services. These services are using pay(as(you(use model to customers, regardless of their location. 'loud computing is a cost effective model for provisioning services and it ma!es IT management easier and more responsive to the 'hanging needs of the business J2KJ1K.Today net or! band idth, ;ess response time, minimum delay in data transfer and minimum data transfer cost are main challenging issues
<<A

in cloud computing load balancing environment. The performances of computational system depend on several concepts, one of hich is load balancing. The load balancing mechanism is totally dependent on the amount of or! allotted to the system for a specific time period. This is the time here system has to manage and or! according to the priority basics. The interaction ith factors and some load balancing algorithm hich can be applicable for such factors are studied in the current paper. There are several load balancing algorithms for the improvement and optimi1ation of cloud performances. The nature of the algorithm can be dynamic or static, although some algorithms are simple but under some conditions they or! more effectively. 'loud computing is a service oriented architecture, hich is provided via internet. The only ob+ective of the service provider is to provide ma"imum resources output and this can be achieved by implementing load balancing algorithm hich helps in gaining this ob+ective. This paper proposes an algorithm hich is e"perimented on a virtual machine environment. The paper is a comparative study of such several algorithms. 5+5 ?oad 3alancing & $Histing Algorithms ;oad balancing is a computer net or!ing method to distribute or!load across multiple computers or a computer cluster, net or! lin!s, central processing units, dis! drives, or other resources, to achieve optimal resource utili1ation, ma"imi1e throughput, minimi1e response time, and avoid overload. The load balancing service is usually provided by dedicated soft are or hard are, such as a multilayer s itch.

,ig! 5+ ?oad 3alancing &n Clo#d comp#ting ;oad .alancing is a method to distribute or!load across one or more servers, net or! interfaces, hard drives, or other computing resources. Typical data center implementations rely on large, po erful (and e"pensive) computing hard are and net or! infrastructure, hich are sub+ected to the usual ris!s associated ith any physical device, including hard are failure, po er and&or net or! interruptions, and resource limitations in times of high demand. ;oad balancing in the cloud differs from classical thin!ing on load(balancing architecture and implementation by using commodity servers to perform the load balancing. ;oad balancing is used to ma!e sure that none of our e"isting resources are idle hile others are being utili1ed. To balance load distribution, the load can be migrated from the source nodes ( hich have surplus or!load) to the comparatively lightly loaded destination nodes. There are many different !inds of load balancing algorithms available for cloud computing system, hich can be categori1ed mainly into t o groups> Static algorithms divide the traffic equivalently bet een servers. .y this approach the traffic on the servers ill be disdained easily and consequently it ill ma!e the situation more imperfectly J1DK. In Dynamic algorithms decisions on load balancing are based on current state of the system.
<<=

6o prior !no ledge is needed for load balancing J1@K. 2o it is better than static approach. /ynamic load balancing can be done in t o ays > Distrib#ted dynamic load balancing algorithm In the distributed strategy, the dynamic load balancing algorithm is e"ecuted by all nodes present in the system and the tas! of load balancing is shared among them. ) benefit, of this is that even if one or more nodes in the system fail, it ill not cause the total load balancing process to halt. 8o ever it can affect the system performance to some e"tent J1@K Centrali'ed Dynamic ?oad 3alancing Algorithm In the non(distributed one, the dynamic load balancing algorithm is e"ecuted by a single node of the system and the tas! of load balancing is dependent only on that node. In this approach if the load balancing node fails, it ill cause the total load balancing process to halt. J1CK$a+or problem ith the current load balancing algorithms it is hard to fit them into the cloud environment. The important things to consider hile developing such algorithm are> estimation of load, comparison of load, stability of different system, performance of system, interaction bet een the nodes, nature of or! to be transferred, selecting of nodes and many other ones. This load considered can be in terms of '*4 load, amount of memory used, delay or 6et or! load. 5+> Distrib#ted ?oad 3alancing ,or The Clo#d &nspiration from the "oneybee 9;= This biologically(inspired technique is no used as search algorithm in a variety of computing applications 2eeming particularly scalable on a fluctuating underlying system. )s such, hen applied to load balancingN as the demand for 0eb 2ervices fluctuates, it is desirable to dynamically allocate servers to regulate the system against demand. The considered honeybee(based load balancing technique uses a collection of servers arranged into virtual servers, each serving a virtual service queue of requests. ) profit is calculated by each server serving a request from a queue representative of the beesG measure of quality. 3iased andom Sampling 9;= In .iased %andom 2ampling load balancing approach, the load on a server is represented by its connectivity in a virtual graph J1DK. Active Cl#stering 9;= )ctive 'lustering considered in as a self aggregation algorithm to re ire the net or!. This procedure is intended to group li!e instances (i.e. similar service type) together J1AK. 5+B %oals of ?oad balancing> 1. To improve the performance of the data centers. 2. To have a bac!up plan in case the system fails even partially. <. To maintain the system stability. @. To accommodate future modification in the system (2calability). The rest of the report is organi1ed as follo s. The ;iterature revie is discussed in section 2. 2ection < tells the problem definition. 2ection @ present the ob+ective and 2ection D present the conclusion required for proposed or!.

<@?

>+ $?AT$D -O ( :i Thang, et al. J@K presents a better understanding of the design challenges of cloud computing and identify important research directions in this increasingly important area and authors have discussed ho cloud computing is attractive to business o ners as it eliminates the requirement for users to plan ahead for provisioning, and allo s enterprises to start from the small and increase resources only hen there is a rise in service demand. H. -ade+a, et al. J<K has discussed a ne ave in the field of information technology> cloud computing. They have also described the architectural design of cloud computing, its advantages and some issues such as security, privacy, reliability etc and research challenges along ith some of its applications. ;oad balancing in cloud computing system J2K . %am *rasad *adhy, et al. gives an overall idea of cloud computing, its components, functionalities and services provided by the cloud, basic concepts of 'loud 'omputing and ;oad balancing and studied some e"isting load balancing algorithms such as 8oneybee 9oraging )lgorithm, .iased %andom 2ampling, )ctive 'lustering hich can be applied to clouds. $artin %andles, et al. JBK compared the performance of three dynamic load balancing algorithms, discuss the shortcomings and investigated hy it is not possible to have centrali1ed scheduling policy in the cloud environment. They investigate three possible distributed solutions proposed for load balancingN approaches inspired by 8oneybee 9oraging .ehaviour, .iased %andom 2ampling and )ctive 'lustering. 8. El .a!!ali, et al. JAK has surveyed the state(of(the(art of load balancing in cloud computing system. They establish the state of the art load balancing in the cloud computing system, giving a definition of this term, its classification and e"amples of its implementation in classical distributed systems and in the cloud computing system !ey technologies as ell as research directions and cases study of search. - E 2mith and %avi 6ayarJDK, provides ith an in depth !no ledge about concept of virtuali1ation. It discusses the concepts of I2), )*I and ).I interfaces in detail. It also discusses the compatibility issues of processors supporting I2) ith some #perating systems. It provides ith a clear definition about the guest, the 8ost and 7irtual $achine $onitor. It also discusses about the emulation of one instruction set ith another, replicating 7$s so that multiple #2 instances can be run simultaneously and composing 7$ soft are to form a more comple" fle"ible system. B+ P OPOS$D -O ( ;oad balancing is a computer net or!ing method to distribute or!load across multiple computers or a computer cluster, net or! lin!s, central processing units, dis! drives, or other resources, to achieve optimal resource utili1ation, ma"imi1e throughput, minimi1e response time, and avoid overload. There are basically t o types of algorithm currently available in the mar!et are li!e. 2tatic algorithm, hich divides the traffic equally, is announced as round robin algorithm. 8o ever, there ere lots of problems appeared in this algorithm. Therefore, another approach is /ynamic hich is eighted round robin as defined to improve the critical challenges associated ith round robin. In this algorithm each servers have been assigned a eight and according to the highest eight they received more connections. In the situation that all the eights are equal, servers ill receive balanced traffic J@K. *roblem ith
<@1

this !ind of algorithm is that these algorithms are not able to handle burst or!loads. Even these algorithms do not consider the current situation of each node of the system. %ecent )lgorithms , 8oney bee foraging algorithm inspired from the nature used for gathering the information regarding the state of the system and ma!ing decisions based on this collected information proves to be a good strategy hen the system diversity increases and hen the system si1e increases. .ut it does not provide any increased throughput during these conditions JBK..iased random sampling method gives a better output hen the system si1e increases but it gives a lesser throughput hen the system diversity increases. 2imilar is the case ith active clustering JBK.It is not !no n ho to select appropriate balancing techniques for given applications that ill provide a suitable configuration for the application and provide it in a timely manner. 2o problem is to overcome the issues of e"isting load balancing hich ill satisfy all aspects in cloud computing and by satisfying both diverse and heterogeneous cloud environment. D+ O3.$CT&@$S 'loud resource management is e"tremely challenging because of the comple"ity of the system, hich ma!es it impossible to have accurate global state information, and because of the unpredictable interactions ith the environment. The cloud service providers are faced ith large, fluctuating loads that challenge the claim of cloud elasticity. 8ere the main ob+ective is to ma"imi1e the resource 4tili1ation and minimi1e the $a!e span. In a cloud, here changes are frequent and unpredictable, centrali1ed control is unli!ely to provide continuous service and performance guarantees. Indeed, centrali1ed control cannot provide adequate solutions to the host of cloud management policies that have to be enforced. )utonomic policies are of great interest due to the scale of the system, the large number of service requests, the large user population, and the unpredictability of the load. /ynamic and distributed approaches are best suited in this !ind of environment. /ata centers comprise of heterogeneous serverGs i.e. the servers of unequal capabilities. $any authors have proposed many techniques but every technique is having some shortcomings. The static techniques are not all applicable in the cloud environment, as they do not consider the current state of the system. The aim is to purpose a load balancing strategy that is dynamic, distributed and heuristic in nature that can handle both heterogeneous and diverse cloud environment .) combination of algorithms is crucial to this process. Thus a system is required that self( regulates the load ithin the 'loudGs entities ithout necessarily having to have full !no ledge of the system. 2uch self(organi1ed regulation may be delivered through distributed algorithmsN directly implemented from naturally observed behavior, specifically engineered to maintain a globally(.alanced load, or directly altering the topology of the system to enhance the natural pattern of load distribution. C+ CO)C?0S&O) 'loud 'omputing is leading the industryGs endeavor to ban! on this revolutionary technology .'loud 'omputing is a vast concept and load balancing plays a very important role in case of 'louds. There is a huge scope of improvement in this area. 0e have discussed e"isting load scheduling algorithms that can be applied to clouds by comparing their performance, but there are still other approaches that can be applied to balance the load in clouds. The
<@2

*roposed or!s aim is to purpose a load balancing strategy that is dynamic, distributed that can handle both heterogeneous and diverse cloud environment. The performance of the proposed approach can also be increased by varying different parameters along ith it simulation can be further done using 'loudsim hich a simulator is a tool!it (library) for simulation of 'loud computing scenarios. G+ 3&3?&O% AP"4 1. E'loud('omputingF, 2ource>http>&&en. i!ipedia.org& i!i&'loudQcomputing. 2. %am *rasad *adhy , *,outam *rasad %ao ,F;oad balancing in cloud computing systemF ,/epartment of 'omputer 2cience and Engineering 6ational Institute of Technology, %our!ela %our!ela(BC= ??A, #rissa, India $ay, 2?11. <. H.-ade+a , 5. $odi ,F 'loud 'omputing ( 'oncepts, )rchitecture and 'hallenges E International 'onference on 'omputing, Electronics and Electrical Technologies JI''EETK 2?12. @. :i Thang ;u 'heng %aouf .outaba, E'loud computing> state(of(the(art and research challengesF, The .ra1ilian 'omputer 2ociety,2pringer , 2?1?. D. - E 2mith and %avi 6ayar, EIntroduction to virtual $achinesF, Elsevier 2cience, 6ov 1@, 2??@. C. %ich ;ee, .ingchiang -eng, E;oad(.alancing Tactics in 'loudF, 2?11 International 'onference on 'yber(Enabled /istributed 'omputing and 5no ledge /iscovery. B. $artin %andles, /avid ;amb, ). Taleb(.endiab, F) 'omparative 2tudy into /istributed ;oad .alancing )lgorithms for 'loud 'omputingF, IEEE 2@th International 'onference on )dvanced Information 6et or!ing and )pplications 0or!shops, 2?1?. A. 8. .a!!ali E;, ). 5hiyaita , $. Tba!h , /afir E; 5ettani (2?12 IEEE). E;oad .alancing 'loud 'omputing > 2tate of )rtF in volume no>=BA(1(@CB<(1?D<( C&12&U<1.?? 2?12 IEEE *age no. J1?C(1?=K. =. %uben 7an den .ossche et al., F'ost(#ptimal 2cheduling in 8ybrid Iaa2 'louds for /eadline 'onstrained 0or!loadsF, IEEE <rd International 'onference on 'loud 'omputing, 2?1?. 1?. 2uma. 7 et.al, EEnhanced ;oad .alancing )pproach to )void /eadloc!sF, 2pecial Issue of International -ournal of 'omputer )pplications (?=BD R AAAB) on )dvanced 'omputing and 'ommunication Technologies for 8*' )pplications ( )''T8*'), -une 2?12. 11. Isam )1a i $ohialdeen , F'omparative 2tudy #f 2cheduling )lgorithms In 'loud 'omputing EnvironmentF, -ournal of 'omputer 2cience, 2?1<. 12. E'loud2im2ource>https>&&code.google.com&p&cloudsim& i!i&9: 1<. E8o 'loud 'omputing 0or!sF, 2ource> http>&& .ho stuff or!s.com&cloud( computing&cloud(computing.htm. 1@. $ishra %atan, -ais al)nant, E)nt colony #ptimi1ation > ) 2olution of ;oad balancing in 'loudF , International -ournal of 0eb 3 2emantic Technology (I-0esT) 7ol.<, 6o.2, )pril 2?12. 1D. 'hac1!oTenon et.al, E)vailability and ;oad .alancing in 'loud 'omputingF, International 'onference on 'omputer and 2oft are $odeling I*'2IT vol.1@ (2?11)
<@<

 (2?11)I)'2IT *ress, 2ingapore , 2?11. 1C. Tai -ian1h et.al, F)daptive resource allocation for cloud computing environments under bursty or!loadsF, In the <?th IEEE International *erformance 'omputing and 'ommunications 'onference. 1B. #. )bu( %ahmeh, *. -ohnson and ). Taleb(.endiab, E) /ynamic .iased %andom 2ampling 2cheme for 2calable and %eliable ,rid 6et or!sF, I69#'#$* ( -ournal of 'omputer 2cience, I226 1A?B(@D@D, 2??A, 7#;.B, 6.@, /ecember, 2??A, pp. ?1(1?. 1A. 9. 2affre, %. Tateson, -. 8alloy, $. 2hac!leton and -.;. /eneubourg, E)ggregation /ynamics in #verlay 6et or!s and Their Implications for 2elf(#rgani1ed /istributed )pplicationsF. The 'omputer -ournal, $arch <1st, 2??A.

<@@

MO P"O?O%&CA? A)A?4J$ O, P0).A3& (amaljeet ( 3atra Asst Prof/ DA@ College/ Amritsar+ A3ST ACT The paper describes about the development of morph analy1er for *un+abi language. $orphological analysis is the identification of a stem(form from a full ord form. The morphological database in its present state has <?,?<@ unique root ords in different ord classes and 1, <=, A?< distinct ord forms for all these ord classes &)T OD0CT&O) $orphological )nalysis provides information about semantics and the syntactic role of ord in a sentence. 9or each ord form of a te"t, the analysis system determines its root, part of speech, its gender, case, number, person, tense, and comparative degree. Indian languages are characterised by very rich system of inflections, derivation and compound ord formation for hich a standard morphological analy1er is necessary to deal ith any type of te"t. The number of ords are derived from a given root ord by some specific syntactic rules. $orphological analysis is the identification of a stem(form from a full ord form. 9or E"ample, the analy1er must be able to interpret the root form of S O 6m#W8 as R O 6m#X8 and its ,6*(,ender(6umber(*erson) information. ) *un+abi morph analy1er has been developed using the morph database available at *un+abi 4niversity, *atiala, hich analy1es the e"act grammatical structure of the ord. The morph database used by the system includes the information about every *un+abi ord, ith the information about its gender, number, person, case, tense etc. The database also contains the root ord for every inflected ord. COMMO) $E&ST&)% APP OAC"$S ) typical $orphological )naly1er is supposed to return root ord and other grammatical information for a given ord form. 2ome prominent approaches to develop these morphological analysis systems are given belo > T o(level morphology model, developed by 5os!enniemi, is one of the idely used approaches for morphological analysis. It is based on the idea that all the surface forms are reali1ed from their le"ical forms by application of some morphophonemic rules. Therefore, in this approach, all the le"ical forms are listed along ith the morphophonemic rules to be applied on forms. #ne ma+or advantage of this approach is that the same model can be used for morphological generation ithout ma!ing any changes. This t o(level approach being language independent has been applied for various languages, li!e 9innish, English, 5orean, Tur!ish, .angla and 4rdu. J1(AK )nother approach is to develop paradigms for various ord classes and then group root ords based on their paradigms in a le"icon. ) paradigm for a given ord specifies ho its various ord forms can be reali1ed from it along ith their grammatical information. 9or
<@D

performing morphological analysis of a given ord, suffi" removal rules are applied and the potential root is searched in the le"icon. This analysis through synthesis approach has been applied for various languages, li!e ,erman, '1ech, %ussian, 4rdu, 2inhala, and 6epali. J=(1DK 2ome machine learning approaches have also been applied for morphological analysis, li!e memory(based learning for /utch and )rabic. J1C(1BK )s mentioned earlier also, a full(form le"icon based approach is follo ed for morphological analysis. 9ull(form le"icon approach provides 1??I accurate results. The only disadvantage of this approach is the memory it ta!es to list all the ord forms. 8o ever, the analysis of *un+abi le"icons and other *un+abi te"ts provide that the ord forms possible for the *un+abi ords are not infinite or very high. ) typical *un+abi noun has @ forms on an average and a *un+abi verb has around @A forms. Therefore, it is possible to e"plicitly list all the ord forms for *un+abi ords in the database and then query the database to get the information for morphological analysis. DATA3AS$ D$S&%)! Table 1 lists the design of the database used to store this full(form le"icon. Table 5! ,#ll7,orm ?eHicon Database Design ,ield )ame Description 0ord ;ists the ord 'ategory ,rammatical category of the ord )s is evident from Table 1, this database ill have all the ord forms along ith the grammatical category of ord. This database ill give information about all the grammatical categories for hich the ord sho s inflection. /etails about *#2 tags are provided in the ne"t section.The morphological database in its present state has <?,?<@ unique root ords in different ord classes and 1, <=, A?< distinct ord forms for all these ord classes. Table 2 describes the si1e of the morph database. Table >! Morphological Analysis and %eneration ?eHicon Si'e -ord Class -ords Co#nt oot -ord -ords ,orms 6oun 1A@1A <BD=2 *ersonal 2@ B< *ronoun %efle"ive C 1A *ronoun /emonstrative B @A *ronoun Indefinite D 1A *ronoun %elative 1? <2 *ronoun Inflected <=<1 1?<?<
<@C

)d+ective 4ninflected <=DD <=DD )d+ective 'ardinal 1?@ <2C #rdinal =A 2=D $ain 7erb 1BA= A1?CC )u"iliary 7erb A <? Inflected 1@2 <<1 )dverb 4ninflected AB2 AB2 )dverb Inflected 21 C? *ostposition 4ninflected AC AC *ostposition 'on+unction CB CB Inter+ection =D =D *article 2C 2C 7ocative = = *article 'on+unct 7erbs 2AD 2AD *assive C 2@ #perators *rogressive 2 1@ #perators *rimary @= 1<A #perators $odal A @= #perators Total (/istinct <?,?<@ 1,<=,A?< ords) The database contains the grammatical category of each ord as ell as the inflected ords it can form. 9rom this database, the information is retrieved and each ord of the sentence is tagged ith related tag sets. In *un+abi grammar, the parts of speech include noun, verb, ad+ective, adverb, pronoun, preposition, con+unction, inter+ection, operators, au"iliary verbs etc. Table 1 sho s the main table, and Tables <, @, D sho the design of morph database for certain grammatical categories. Table B! Morph Database Design for )o#ns ,ield )ame Description 0ord Inflected ord %oot %oot ord ,ender ,ender information 6umber 6umber information 'ase 'ase information
<@B

SAMP?$ DATA3AS$ $)T &$S ,O )O0)S %ender -ord oot

$asculi /irect ne $asculi 2ingul #bliq ne ar ue $asculi 2ingul /irect ne ar 9eminin *lural #bliq e ue 9eminin *lural /irect e 9eminin 2ingul #bliq e ar ue 9eminin 2ingul /irect e ar Table D! Morph Database Design for Personal Prono#ns ,ield )ame Description 0ord Inflected ord %oot %oot ord ,ender ,ender information 6umber 6umber information 'ase 'ase information *erson *erson Information SAMP?$ DATA3AS$ $)T &$S ,O P$ SO)A? P -ord oot %ender )#mber .oth *lural .oth *lural .oth *lural .oth 2ingular .oth 2ingular .oth 2ingular O)O0)S Case /irect /irect #blique /irect #blique /irect

)#mb er *lural

Case

Person 9irst 9irst 9irst 9irst 9irst 9irst

,ield )ame 0ord %oot ,ender 6umber Tense

Table C! Morph Database Design for @erbs Description Inflected ord %oot ord ,ender information 6umber information Tense information
<@A

*erson

*erson Information

SAMP?$ DATA3AS$ $)T &$S ,O @$ 3S o %ender )#mb Transitivi Ca#sality Person -ord ot er ty $asculi 2ingul Intransitiv 6one " ne ar e .oth 2ingul Intransitiv 6one 2econd ar e .oth 2ingul Intransitiv 6one Third ar e $asculi *lural Intransitiv 6one " e ne .oth *lural Transitive 6one 2econd $,$ $)C$S 1. 5os!enniemi, 5immo. 1=A<b. T o(;evel $odel for $orphological )nalysis. In *roceedings of the Eighth International -oint 'onference on )rtificial Intelligence (I-')I(A<), 5arlsruhe, ,ermany. pp. CA<(CAD. 2. 5os!enniemi, 5immo. 1=A@. ) ,eneral 'omputational $odel for 0ord(9orm %ecognition and *roduction. In *roceedings of the 1?th International 'onference on 'omputational ;inguistics ('#;I6,(A@), 2tanford 4niversity, 'alifornia. pp. 1BA( 1A1. <. 5im, /eo!(.ong, 2ung(-in ;ee, 5ey(2un 'hoi, and ,il('hang 5im. 1==@. ) T o( ;evel $orphological )nalysis of 5orean. In *roceedings of the 1D th International 'onference on 'omputational ;inguistics ('#;I6,(=@), 7ol.1, 5yoto, -apan. pp. D<D(D<=. @. #fla1er, 5emal and l!er 5uru1. 1==@. Tagging and $orphological /isambiguation of Tur!ish Te"t. In *roceedings of the 9ourth 'onference on )pplied 6atural ;anguage *rocessing ()6;*(=@, 2tuttgart, ,ermany. pp. 1@@(1@=. D. #1taner, 2erdar $urat. 1==C. ) 0ord ,rammar of Tur!ish ith $orphophonemic %ules. $asterGs Thesis, /epartment of 'omputer Engineering, $iddle East Technical 4niversity, )n!ara, Tur!ey. C. )legria, Ia!i, Vabier )rtola, 5epa 2arasola, and $iriam 4r!ia. 1==C. )utomatic $orphological )nalysis of .asque. ;iterary and ;inguistic 'omputing, 11(@). pp 1=<(2?<. B. /asgupta, 2a+ib and $umit 5han. 2??@. $orphological *arsing of .angla 0ords using *'(5I$$#. In *roceedings of the 2eventh International 'onference on 'omputer and Information Technology (I''IT 2??@), /ha!a, .angladesh. pp. B1(BB.
<@=

A. 8ussain, 2ara. 2??@. 9inite(2tate $orphological )naly1er for 4rdu. $asterGs Thesis, /epartment of 'omputer 2cience, 6ational 4niversity of 'omputer and Emerging 2ciences, ;ahore, *a!istan. =. .harati, )!shar, 7ineet 'haitanya, and %a+eev 2angal. 1==D. 6atural ;anguage *rocessing R ) *aninian *erspective. *rentice(8all of India, 6e /elhi. 1?. ;e1ius, 0olfgang, %einhard %app, and $anfred 0ettler. 1==C. ) $orphology( 2ystem and *art(of(2peech Tagger for ,erman. In /. ,ibbon, editor, 6atural ;anguage *rocessing and 2peech Technology. %esults of the Third 5#67E62 'onference, $outon de ,ruyter, .erlin, ,ermany. pp. <C=R<BA. 11. ;e1ius, 0olfgang, %einhard %app, and $anfred 0ettler. 1==A. ) 9reely )vailable $orphological )naly1er. /isambiguator and 'onte"t 2ensitive ;emmati1er for ,erman. In *roceedings of '#;I6,()';, 7ol. 2, $ontreal, 'anada. pp. B@<(B@A 12. 2edle!, %ade! and *avel 2mr. 2??1. ) 6e '1ech $orphological )naly1er a+!a. In *roceedings of T2/(2??1, Tele1na %uda, '1ech %epublic. pp. 1??(1?B 1<. 8ana, -iri, )nna 9eldman, and 'hris .re . 2??@. ) %esource(light )pproach to %ussian $orphology> Tagging %ussian 4sing '1ech %esources. In *roceedings of the 2??@ 'onference on Empirical $ethods in 6atural ;anguage *rocessing (E$6;*( 2??@), .arcelona, 2pain. pp. 222(22= 1@. 8umayoun, $uhammad. 2??C. 4rdu $orphology, #rthography and ;e"icon E"traction. $asterGs Thesis, /epartment of 'omputer 2cience and Engineering, 'halmers 4niversity of Technology and ,teborg 4niversity, ,teborg, 2 eden. 1D. 8ettige, .udditha and )so!a 2. 5arunananda. 2??Ca. ) $orphological )naly1er to Enable English to 2inhala $achine Translation. In *roceedings of International 'onference on Information and )utomation (I'I)(2??C), 'olombo, 2ri ;an!a. pp. 21(2C 1C. .osch, )ntal van de and 0alter /aelemans. 1===. $emory(based $orphological )nalysis. In *roceedings of the <B th )nnual $eeting of the )ssociation for 'omputational ;inguistics, 4niversity of $aryland, 'ollege *ar!, $/. *p. 2AD(2=2. 1B. $arsi, Er in, )ntal van de .osch, and )bdelhadi 2oudi. 2??D. $emory(based $orphological )nalysis ,eneration and *art(of(2peech Tagging of )rabic. In *roceedings of the )'; 0or!shop on 'omputational )pproaches to 2emitic ;anguages, )nn )rbor, $ichigan. pp. 1(A

<D?

%SM7 ! $@O?0T&O) A)D APP?&CA3&?&T4 .armanjit Singh Assistant Professor/ Swami Satyanand College of Management & Technology+ .arman+mca1gmail+com A3ST ACT This paper is about the application of ,2$ technology to %ail ays i.e. ,2$(% hich stands for ,lobal 2ystem for $obile 'ommunication(%ail ays is an International 0ireless communication standard for rail ays communication and currently applied as sub(system of Europe %ail Traffic $anagement 2ystem. ,2$(% guarantee performance and secure data and voice communication at speeds up to D?? !m&h bet een Trains and %ail ay %egulation 'ontrol 2ystem ithout any communication loss. *aper includes evolution of ,2$(%, various standards roundabout and drafted, the technologies used for implementation, quality of service factors involved in communication and its valuable advantages to the %ail ays as a means of communication. 5+ &)T OD0CT&O) 8ere in this section of %SM7 (i.e. ,lobal 2ystem for $obile communication (%ail ays) technology e are to present our research on latest innovations in rail ays communication, i.e it is a platform made safe for communication of voice and data bet een the superfast trains (speed up to D??!m&h) and base stations or various members of the rail ay teams> drivers, regulators, teams of operation, personnel on train, station masters etc. It aims to replace the incompatible analog system hich is the old fashion used in the rail ays all around the orld, and are the main cause of the ma+or accidents o ing to bad communication net or! establishment as it as difficult to handle the communication bet een super fast (speed up to D?? !m&h) trains and the base stations using that old techniques. 2o ith the application of this recent technology the mishappenings can be prevented. %SM7 technology as developed in a $0 OP$7funded MO A)$ 6Mobile adio for ailways )etwor*s in $#rope8 pro+ect and the 0&C 6&nternational 0nion of ailways8, in the frame or! of the $& $)$ 6$#ropean &ntegrated ailway $nhanced )etwor*8 pro+ect, has developed a ne digital radio communications standard hich is common to and compatible ith every European rail ays net or!. The pro+ectGs goal is to develop a uniform digital radio system for European railroad traffic. ,2$(% is a platform for voice and data communications as ell as for traffic control system 6$TCS/ $lectronic Train Control System8+ The ,2$(% net or! is based on ,2$ as the radio bearer and comprises the follo ing elements> ( 3ase Station S#b7Systems 63SSs8 of .ase 2tation 'ontrollers (.2's) controlling .ase Transceiver 2tations (.T2s) each containing a number of transceivers (T%Vs). ( )etwor* S#b7Systems 6)SSs8 interfacing to the .22 via the ,2$ S)G interface. The 622 contains $obile service 2 itching 'entres ($2's) ith primary responsibility for call
<D1

control. The $2' is supported by a 8ome ;ocation %egister (8;%) holding subscriber details on a permanent basis, and a 7isitor ;ocation %egister (7;%) containing temporary details of subscribers active ithin the $2' area. ( Mobile $A#ipment 6M$8 interfacing to the .22 via the air interface. ( S#bscriber &dentity Mod#les 6S&Ms8 containing information specific to single subscribers. ) standardi1ed interface lin!s mobile equipment to 2I$ cards. ) 2I$ and $E combined are termed a $obile 2tation ($2). ( Operation and Maintenance Centre 6OMC8 responsible for fault monitoring and maintenance of the mobile net or!. ( Management Centre responsible for networ* config#ration, net or! performance monitoring, management of subscribers to the mobile net or!, etc. ( 3illing Platform 6optional8 to invoice subscribers for the ,2$ services provided. ( ,iHed lin*s these are required to connect together the components of the mobile 5+5 3AC(% O0)D 6-"4 %SM7 ++M8 /uring the course of their or! in the period 1=AD to 1=A=, the 4I' radio frequency group concluded that efforts ould have to be underta!en to negotiate, ith the European 9requency 'ommittee ('E*T), for the allocation of a certain spectrum of the ,2$(band to the rail ays, due to the permanent increasing needs to secure frequencies to underpin future rail ay needs. This request as supported by a pre(study on the usability of either ,2$ or TET%) for the future rail ay mobile communications. 2ome studies ere underta!en to assess possible frequency needs (2tudies to define a traffic model for three representative areas, ;ondon, *aris and $unich, ere carried out) and in parallel the advantages and disadvantages of the t o potential systems ( ,2$ or TET%)) ere discussed. 9inally a decision as ta!en to adopt ,2$, hich as, at that time, the only system in commercial operation ith products available. This as a very important consideration as one of the main ob+ectives as, to use a system, hich as already proven and here off(the( shelf products ere available, ith the minimum of modifications. 8o ever, even at that time it as clear, that ,2$ could not fulfil all the requirements necessary for an efficient rail ay service. Therefore it as necessary to identify and specify the above mentioned )2'I features. The request for frequencies resulted in a recommendation from 'E*T, to provide a spectrum of @ $81 out of the ,2$(band and to allocate this for rail ay use only. This recommendation as later modified into a decision, hich required the national frequency authorities to free this spectrum, hich as already used (mainly by military services), by 2??D at the latest. The way from the idea to %SM7 9ollo ing the decision to adopt ,2$, the 4I' launched a pro+ect in 1==2, together ith the E' and the rail ays, called EI%E6E (European Integrated %adio Enhanced 6et or!). The aim of this pro+ect as, to specify the functional and technical requirements for mobile net or!s hich ould both fulfil the needs of rail ays and ensure interoperability across borders. That involved the description of mandatory requirements for operational communication services, in and bet een net or!s of neighbouring rail ays, ith the goal to allo , in the future, uninterrupted train(services, hen crossing borders.
<D2

A first draft of these $& $)$ specifications was finalised by 5::C+ To validate, that these specifications could be transferred into technical implementations, a further pro+ect as launched in 1==D ith the involvement of the 4I', three ma+or rail ays, the E' and a limited number of ,2$ suppliers, ho ere illing to support ,2$(%. This pro+ect as named $#%)6E ($obile oriented %adio 6et or!), supported by the rail ays in 9rance, Italy and ,ermany and set up in *aris. Three pilot(lines ere planned and realised > This $o4 as signed at that time by <2 rail ays all over Europe. )s of to(day, the number of signatories has increased to <B, including rail ays outside of Europe. In addition to the declaration of illingness set out in the $o4, the 4I' also instigated an )greement of Implementation ()oI), here the signing rail ays committed themselves to start their implementation of the national ,2$(% system. This )oI as signed by 1B rail ays. >+ P &)C&P?$/ SP$C&,&CAT&O) & -O (&)%

,ig 5! %SM ,reA#ency 9>= The ,2$(% specifications, in the interest of interoperability, ta!ing into account the implementation progress and the advance of the technologies. 0e are no in a full implementation stage, most of all rail ay administrations being in a phase of ,2$(% implementation phase. Implementation %eports ill !eep coming, in the ne"t fe yearsN end of 2??B ill find only 6etherlands, 2 eden, ,ermany (9irst 2tage), Italy ('onventional ;ines), and 6or ay migrated, or first stage migrated. $ost of the administrations are planning end of migration for 2?12. Implementation %eports ill continue to be produced in the ne"t fe years and ill need to be dealt ith by the E%T$2&,2$(% pro+ect. The continuation of the ,2$(% 'hange %equest )ctivity is therefore necessary and central to the continued success of the ,2$(% migration in Europe. &n vario#s conditions the wor*ing of %SM7 depicts as follows!

<D<

>+5 )ormal AThe conditions which a part of the railwa is designed to accommodate. This would include the peaks, for example rush hours, and troughs in demand experienced during the da .B 6o the or!ing of the ,2$(% in various different conditions are as in 6ormal case, as in abnormal case, as in Emergency case. >+> )ormal! )ormal is to be considered as situations e"pected to be encountered entering, e"iting and ma!ing train movements in the ,2$(% area and any set up or close do n arrangements as part of start of service or end of service duties. )ormal also includes any routine maintenance activities that do not affect the ability of the system to provide a fully functional operational rail ay. >+B Abnormal )bnormal A0xtreme loading on a part of the railwa s stem. Cor example, this ma be the result of extended dela s on one part of the service impinging on another.B )n unforeseen or unplanned event, hich does not have life threatening or e"treme loss implication including faults and failures e"ternal to ,2$(% equipment. E"amples ould include the failure of a train due to traction problems, or the reduction of infrastructure availability due to a bridge stri!e or bro!en rail. 4nder these conditions it is e"pected that ,2$(% ill operate as designed but be sub+ect to abnormal system loading. )bnormal ould also include any planned maintenance activity not affecting the functionality of ,2$(% on the lines remaining open to traffic. /egraded AThe state of the part of the railwa s stem when it continues to operate in a restricted manner due to the failure of one or more components.B ) planned or unplanned reduction in the ability of ,2$(% to operate in its normal planner. This could include SgracefulG or partial degradation here it remains acceptable to continue to operate the ,2$(% equipment. It ould also include any planned outages to amend or upgrade ,2$(% equipment here this ill result in a reduction of service during the changeover. >+D $mergency $mergency AA current unforeseen or unplanned event which has life threatening or extreme loss implication and re>uires immediate attention, for example a fireB. 'omplies ith the %2*, definition and includes any failures of the ,2$(% system that may cause immediate ris! of e"treme loss. B+ AD@A)TA%$S O, %SM7 o It is a unique and international communications system for voice, data and signali1ation and is normali1ed by European organisms and approved by the rail ay companies. o It offers a very good availability and reliability and It offers fle"ibility. o The voice broadcast service (7.2) ill be used to broadcast rail ay emergency calls ithin predefined areas. It may be accessed from both fi"ed and $obile subscribers and is built up as a simple" connection (one spea!er Rmany listeners). o The voice group call service (7,'2) can serve many types of group communication Especially shunting team. 'ommunication, train radio, and emergency 'ommunication ill require this functionality.
<D@

o ) shunting team is usually only temporary and group members may vary. The 7,'2 ill allo dynamically changing group call compositions ithout the need for the individual group members to change either equipment or frequency 0ill not be used for public communication. o .y using ,2$(% mobiles it ill become significantly easier to reach rail road maintenance personnel. )s an alternative, ne trac!side and tunnel telephones ill be based on ,2$(%. *ersonnel can then be located according to their location and function. o %ail ay personnel ill use ,2$(% and even public ,2$ as a redundant system. The advantages of ,2$(% are better coverage of the =?? $81 band inside the tunnel, and the use of all train functions via one system in the case of an emergency. D+ D&SAD@A)TA%$S O, %SM7 o ) number of interrogators should be installed along the trac!s. o /epots and shunting stations must be equipped ith fi"ed or portable readers. C+ APP?&CAT&O)S O, %SM7 ,2$(% permits ne services and applications for mobile communications in several domains> o 'ontrol and protection ()utomatic Train 'ontrol&ET'2) and E%T$2) o 'ommunication bet een train driver and regulation center, o 'ommunication of on(board or!ing people o Information sending for ET'2 o 'ommunication bet een train stations, classification yard and railtrac!s G+ MA&) 0S$ It is used to transmit data bet een trains and rail ay regulation centers ith level 2 and < of ET'2. 0hen the train passes over a Eurobalise, it transmits its ne position and its speed, then it receives bac! agreement (or disagreement) to enter the ne"t trac! and its ne ma"imum speed. In addition, trac!side signals become redundant. ;+ CO)C?0S&O) )s 6o e can conclude that ,2$(% is no on a good ay to be implemented all over Europe the rail ays and also the 4I' are no in a position to see if this relatively small portion of the ,2$ band allocated to the rail ays is sufficient for the future, to allo continuously evolving traffic to be handled. This bearing in mind those also safety(critical applications have to use ,2$(%. )s a result it can be stated, that the rail ays as one of the most important traffic partners ill need more and more frequencies and that the allocation of these frequencies to rail ays ill never be an easy tas!. STherefore the 4I' as a representative of the rail ays is in charge, to underta!e all efforts to ma!e this possible. 2o, The ,2$(% is the most probably the last but not the least latest technologies using around the orld and also in I6/I) this ill be implemented very soon in super fast trains here old analog systems are ris!y and error prone.

<DD

eferences! 1. http>&& .uic.org&spip.phpOarticleC<1 2. %obert 2arfati 2ystra ,sm(% #perators ,roup 'hairman 4ic Ertms 'onference 2??C <. 45 applications of ,2$(% The operational 'oncept. @. http>&&en. i!ipedia.org& i!i&,2$(% D. http>&& .etsi.org&deliver&etsiQts&1?<1??Q1?<1==&1?<1@B&?1.?1.?1QC?&tsQ1?<1@Bv? 1?1?1p.pdf C. . i!ipedia.com

<DC

COMPA AT&@$ ST0D4 O, MA&)T$)A)C$ A)D $$)%&)$$ &)% O, SO,T-A $ -as inder 2ingh %esearch 2cholar, *un+ab Technical 4niversity, !apurthala -as inder.singh{chit!ara.edu.in )shu ,upta 'omputer /epartment, )pee+ay Institute of $anagement, *un+ab guptashu1{rediffmail.com -aiteg 2ingh 'omputer )pplication /epartment, 'hit!ara 4niversity, *un+ab +aiteg.singh{chit!ara.edu.in A3ST ACT /eveloping soft are either for generic or for specific commercial use is crucial. To fulfill the requirements of intended users, designers or developers put their best efforts to gain optimum accuracy. )lthough designers or developers use all sort of available practices, standard methods, systematic approaches and quantifiable measures of soft are development still soft are being developed need maintenance. $ore over e still lac! in efficient metrics and measures to perform cost effective maintenance. .y ord $aintenance, e cannot be limited to correcting and finding errors and bugs in the system but it is beyond that. 6o maintenance is appropriate ord to be defined on hen e say that system is required to be improved or hen it is required to be modified or hen system is required to be perform on the changing requirement. )fter successive maintenance for the soft are, it might require to maintain the e"isting system by ma!ing changes up to the design level of the soft are. *urpose is to !eep it performing efficiently ithout changing the functionality and also reducing further maintenance cost. This process of maintenance, by ma!ing changes up to design level is called reengineering. The ob+ective of this paper is to revie and evaluate the scope of maintenance and reengineering of soft are. ($4-O DS! 2oft are, $aintenance, %eengineering, 4$;. &)T OD0CT&O) In soft are development phases, maintenance is one of the most important and ma+or activity. 0hile implementing soft are, designer and developer use the best available practices so that the developed soft are can be easily maintainable. $aintenance of soft are is not limited to correcting errors and faults but also to accommodate ne requirements. /oing maintenance repeatedly, degrade the performance of soft are so in this case other more viable approach is to reengineer the soft are system. %eengineering approach considers the e"isting system and ma!es changes to the designing level and recreates the structure ithout changing the functionality of the system.
<DB

?&T$ AT0 $ ). $aintenance )ccording to IEEE definition J1K of maintenance E2oft are maintenance is the process of modifying a soft are system or component after delivery to correct faults, improve performances or other attributes, or adapt to a changed environmentF. )s given in the definition, soft are maintenance is not +ust correcting faults in the soft are but also include improvement in the performance and or!ing in changing environment (change in #2 or program )pplication). $aintenance is often considered as the last activity of soft are life cycle. )bran et al. J2K even treated as a different activity from soft are development because of follo ing characteristics The si1e and comple"ity of each maintenance or! request are such that it can usually be handled by one or t o resourcesN $aintenance or! requests come in more or less randomly and cannot be accounted for individually in the annual budget(planning processN $inor enhancements (adaptive) or! requests of the enhancement category are revie ed ith customers and can be assigned prioritiesN The maintenance or!load is not managed using pro+ect management techniques, but rather ith queue management techniques. $aintenance has a broader scope of configuration management ith more operational considerations. .ut many researchers consider it as an activity hich is integral part of soft are development and required to be started hen soft are development is in progress. *igos!i J<K identify the need of emphasi1ing the role of maintenance starting from the soft are development process by saying E2oft are maintenance is the totality of activities required to provide cost(effective support to a soft are system. )ctivities are performed during the pre(delivery stage as ell as the post(delivery stage. *re(delivery activities include planning for post delivery operations, supportability, and logistics determination. *ost(delivery activities include soft are modification, training, and operating a help des!F. *igos!i identify the role of maintenance not only as a post delivery activity but also in pre(delivery activity. /epending upon hat to maintain and hen to maintain, $aintenance activity can be classified in many forms. I2# J@K classify soft are maintenance in three categories *roblem resolution> Involves the detection, analysis, and correction of soft are non conformities causing operational problems. Interface modifications> %equired hen additions or changes are made to the hard are system controlled by the soft are. 9unctional e"pansion or *erformance Improvement> $ay be required by the purchaser in the maintenance stage. )ccording to IEEE JDK definition $aintenance can be classified in @ types as given belo .

<DA

'orrective maintenance> reactive modification of a soft are product performed after delivery to correct discovered faults. )daptive maintenance> modification of a soft are product performed after delivery to !eep a computer program usable in a changed or changing environment. *erfective maintenance> modification of a soft are product performed after delivery to improve performance or maintainability. Emergency maintenance> unscheduled corrective maintenance performed to !eep a system operational.

I2#&IE' 1@BC@ JCK standardi1es the category of soft are maintenance in form of the timing of the change (proactive or reactive) and the goal of the change (correction or enhancement) as sho n in 9ig.1. 'orrection Enhancement *reventive *erfective 'orrective )daptive 9ig.1 2oft are $aintenance 'ategories JCK

Proactive eactive

7ictor et al. JBK hile studying 9light /ynamics /ivision (9//) of 6)2) ,oddard 2pace 9light 'enter (,29') identify the types and percentage of efforts across maintenance change type. Their distribution of efforts for maintenance is as sho n in figure 2.

9ig.2 Effort distribution in $aintenance types In the 9ig 2, others represents the efforts related to system documentation, other documentation etc. 2tudy of .oehm JAK gives us very important facts about the maintenance. .oehm study included @AB organi1ations and revealed the distinction in percentage of efforts required in soft are development and maintenance. )s sho n in figure <, the percentage of efforts required in maintenance is higher as compare to the development efforts.

<D=

9ig.< 2oft are development and $aintenance 'ost J1K 2tudy of .oehm JAK also provide 1? year of soft are life cycle cost in large organi1ations. )s sho n in 9ig @, data of four organi1ations is given and the cost of maintenance required for each organi1ation is more than D? I.

9ig @> /evelopment and $aintenance 'ost in organi1ations J1K )ccording to +ones J=K, EIn 2??1, more than D? percent of the global soft are population as engaged in modifying e"isting applications rather than riting ne applicationsF. )ll these studies sho s that though designers or developers use all sort of available practices, standard methods, systematic approaches and quantifiable measures of soft are development still soft are being developed need maintenance and maintenance ill remain have huge impact on the cost of soft are life cycle, even larger than the cost of soft are development. ?# eengineering )s stated by 2ingh et al. J1?K, as the time passes, soft are may undergo changes i.e. it require maintenance (corrective, adoptive or perfective maintenance). .ut as the changes are made in the system there is possibility that structure of the system degrade, hence error rate increases hich ma!es the chances more e"pensive. 0ith each change some errors may be added in the system, hich may affect the performance. 8ence ith each change in the system number of errors in the system is li!ely to be increased, hich increases the cost to implement further changes. )s this
<C?

cost increases there is a need either to discard the hole system (%etirement) or to rebuild the system ith little change in design and implementation techniques. This process is called reengineering. 'hi!ofs!y and 'ross J11K define reengineering as Ethe e"amination and alteration of a sub+ect system to reconstitute it in a ne form and subsequent implementation of that formF. )ccording to IEEE 2td. 1==A J12K, E) system changing activity that results in creating a ne system that either retains or does not retain the individuality of the initial systemF. .rien J1<K clearly sho s the reengineering process in figure D.%eengineering includes %everse Engineering of old system (legacy system) and applying for ard engineering to get a ne system.

9ig. D %eengineering J1<K C+ Maintenance @S e7engineering 5umar et al. J1@K represented a discrete model to sho comparisons bet een maintenance and %e(engineering. )s sho n in 9ig.C, $aintenance and re(engineering has been compared using different soft are issues. The comparison depicts the nature of maintenance and re(engineering. .y applying $aintenance, the age of soft are increases here as a ne age period get attached to the soft are system using re(engineering.

<C1

9ig.C $aintenance 72 %e(engineering J1@K If the system continues to go under many changes then the cost of maintenance can be abruptly high and the better approach ould be to re(engineer the system not to maintain.

9ig. B $aintenance 7s reengineering 'ost J1@K )s sho n in 9ig.B, point T represents that cost of maintenance and re(engineering is equal. If cost of soft are hich needs maintenance is evaluated for T point then it is better to do reengineering of that soft are in place of maintenance. /ecision of hen to reengineer soft are or to maintain soft are is difficult. 2ingh et al. J1DK gives various metrics for reengineering and help to ma!e decision of hen to apply maintenance and hen to use reengineering for the system. To capture the status of hen to apply reengineering four variables /efect 'ost (/') J1DK, 9ault 'ost (9') J1DK, %eengineering %equirement 'ost (%%') J1DK and %eengineering %equirement 'ost of $odule (%%'$) J1DK are used. /epending upon %%'$ value, the soft are ill be reengineered or it ill not be. 0hile performing re(engineering, most of the time spends in understanding the e"isting code. 2ingh et al. J1CK in their or! identify 4nified $odeling ;anguage (4$;) as indispensable tool in performing re(engineering tas!. The e"isting code can be directly converted to a visual models using 4$; tools.4$; not only increase the understanding of e"isting code but also proved e"cellent tool to apply for ard engineering on abstract system. CO)C?0S&O) 9or the last many years researchers in their studies ma!e us to reali1e the importance of maintenance for the soft are and give us the idea about the efforts and cost required for doing maintenance and many time proved that maintenance is more important than soft are development. 2imilarly from the past fe years, importance and need of %eengineering as compare to maintenance is identified and it is started ta!en into account that system hether need to undergo for reengineering or maintenance. This paper covers some of the important

<C2

issues regarding maintenance and reengineering and provide comparisons of reengineering and maintenance activity. $,$ $)C$ 1. IEEE 2td. C1?.12, #tandard %lossar of #oftware 0ngineering Terminolog , IEEE 'omputer 2ociety *ress, ;os )lamitos, '), 1==?. 2. )bran, )N 6guyen!im, 8,"easurement of the "aintenance )rocess from a 'emand-based )erspective, -ournal of 2oft are $aintenance> %esearch and *ractice, 7ol. D, no 2, 1==<,p.C<(=?. <. *igos!i,T.$, practical software "aintenance 3 @est )ractices for "anaging Dour #oftware $nvestment, -ohn 0iley 3 2ons, 6e Hor!, 6H, 1==B. @. I2#&IE' =???(<, Eualit "anagement and Eualit Assurance #tandards R *art <> ,uidelines for the )pplication of I2# =??1 to the /evelopment, 2upply and $aintenance of 2oft areF, ,eneva, 2 it1erland, 1==1. D. IEEE 2td. 121=(1==A, #tandard for #oftware "aintenance, IEEE 'omputer 2ociety *ress, ;os )lamitos, '), 1==A. C. I2#&IE'(1@BC@ Information technology 2oft are $aintenance, 2tandard, 9irst edition, 6ov 11, 1===. B. 7ictor. ., ;ionel. ., 2teven. ', Hong($i 5im, 0alcklio ;. $elo and -on /. 7alett, Fnderstanding and )redicting the )rocess of softwaremaintenance (eleases , 'onf. #n 2&0 Eng., .erlin, ,ermany, $arch 1==C. A. .oehm .. E2oft are Engineering EconomicsF, *rentice 8all (1=A1). =. -ones T.', #oftware !ost 0stimation in .22.F, crosstal! -une 2??2. 1?. 2ingh 8., 5alia )., 2ood 2., 5aur *. )nd 5aur 5, A "etric Cramework for 'etermination of (e>uirement for (eengineering, The I'9)I -ournal of 2ystem $anagement, 7ol. C 6o. 2, 2??A,pp.<B(@<. 11. 'hi!ofs!y and -.8.'ross, (everse 0ngineering and 'esign (ecover ? A Taxonom , IEEE 2oft are Engineering +ournal, -an. 1==?, pp 1<(1B. 12. IEEE 2td 121=(1==A, In IEEE 2tandards 2oft are Engineering, 1=== Edition, 7olume T o, *rocess 2tandards, IEEE *ress 1===. 1<. ;iam #G.rien, (eengineering, 'arnegie $ellon 4niversity,2??D 1@. 5umar. ), 2ingh .. ,ill, "aintenance vs.(eengineering #oftware # stems, ,lobal -ournal of 'omputer 2cience and Technology 7olume 11 Issue 2< 7ersion 1.? /ecember 2?11 1D. 2ingh 8., 2ood 2., 5aur %. )nd %atti 6., "etric Cramework for (eengineering )rocess, *un+ab 4niversity %esearch -ournal. 7ol. DB, pp.2D1(2DD, 2??B. 1C. 2ingh. -, ,upta. ), identif ing unified modeling language 6uml) as an indispensable tool in software re-engineering, I-%E)2 7olume 2, Issue 2, 9ebruary 2?12.

<C<

A COMPA &SO) O, O)?&)$ T AD&)% A)D T AD&T&O)A? T AD&)%! CO)C$PT0A? ST0D4 Dr+ Aparna 3hatia Assistant Professor/ %#r# )ana* Dev 0niversity/ Amritsar+ aparnamohindr#1yahoo+co 3inny esearch Scholar/%#r# )ana* Dev 0niversity/ Amritsar binny*B1gmail+com A3ST ACT The technology revolution has had an intense and irreversible impact on the Indian stoc! mar!et. #nline trading is one of the latest ays to invest that has gained popularity in recent years as investors become savvier. It has increased the participation of common man in the stoc! mar!et. It enables mar!et participants, irrespective of their geographical locations, to trade ith one another simultaneously, improving the depth and liquidity of the mar!et. It has made transactions easier to complete, monitor, clear, and settle. In the light of above, this paper is an attempt to understand the procedure of online trading and loo!ing at its benefits and to compare the differences bet een traditional trading and electronic trading. The analysis represents the various benefits availed by the investor after s itching over to online trading. ($4-O DS! Technology, liquidity, online trading &)T OD0CT&O) #nline trading in securities refers to the facility of investor being able to place his o n orders using the internet trading platform offered by the trading member vi1., the bro!er. The orders so placed by the investor using internet ould be routed through the trading $ember. To start ith, investor needs to identify a trading member ho offers internet trading facility and register ith the trading member for availing the internet trading facility.9or many years stoc! mar!ets ere physical locations here buyers and sellers met and negotiated. E"change trading ould typically happen on the floor of an e"change, here traders in brightly colored +ac!ets (to identify hich firm they or!ed for) ould shout and gesticulate at one another R a process !no n as open outcry or pit trading (the e"change floors ere often pit(shaped R circular, sloping do n ards to the centre, so that the traders could see one another). 0ith the improvement in communications technology in the late 2?th century, the need for a physical location became less important and traders started to transact from remote locations in hat became !no n as electronic trading. Electronic trading made transactions easier to complete, monitor, clear, and settle and this helped spur on its development. Investors can no enter orders directly online, or even trade ith other investors via electronic communication net or!s (E'6).
<C@

It enables mar!et participants, irrespective of their geographical locations, to trade ith one another simultaneously, improving the depth and liquidity of the mar!et. It provides full anonymity by accepting orders, big or small, from members ithout revealing their identity. Technology as used to carry the trading platform from the trading hall of stoc! e"changes to the premises of bro!ers and to the *'Gs at the residence of Investors through the Internet. 2ome orders entered online are still routed through the bro!er, allo ing agents to approve or monitor the trades. This step assists in the protection of both the client and bro!erage firm from unla ful or incorrect trades hich could affect the clientGs portfolio or the stoc!bro!erGs license. The move to electronic trading compared to floor trading continued to increase ith many of the ma+or e"changes around the orld moving from floor trading to completely electronic trading. )$$D A)D O3.$CT&@$S O, T"$ ST0D4 #nline trading is the emerging concept in the Indian stoc! mar!et. It involves personal factors, technical factors, business factors and economic factors. The interplay of these factors on stoc! mar!et requires a deep study about the pattern process, procedures and performance. $oreover, transparency has become an important issue ith the regular series of scams over the years. This study is intended to identify the various concepts about online trading and its ay of functioning. Thus, the ob+ectives of the study are as follo s> To understand the procedure for online trading system. To compare the difference bet een open outcry and electronic trading system. M$C"A)&SM O, T AD&)% 62E has main computer hich is connected through 7ery 2mall )perture Terminal (72)T) installed at its office. The main computer runs on a fault tolerant mainframe computer at the E"change. .ro!ers have terminals identified as the *'s installed at their premises hich are connected through 72)Ts&leased lines&modems. )n investor informs a bro!er to place an order on his behalf. The bro!er enters the order through his *', hich runs under 0indo s 6T and sends signal to the 2atellite via 72)T&leased line&modem. The signal is directed to mainframe computer at 62E via 72)T at 62ELs office. ) message relating to the order activity is broadcast to the respective member. The order confirmation message is immediately displayed on the *' of the bro!er. This order matches ith the e"isting passive order(s)N other ise it aits for the active orders to enter the system. #n order matching, a message is broadcast to the respective member. *rocedure of Electronic Trading&#nline Trading 1. Investor log on to stoc!bro!erGs eb site and get themselves registered. 2. .ro!er gives them a log in name, pass ord and personal identification number. <. )n order is placed on the bro!erGs site @. ) revie is done and order is submitted D. The investor receives a Sconfirmation messageG along ith order number and values of the order
<CD

C. 'ontract note is sent through mail in 2@ hours B. /emateriali1ation account is debited or credited by electronic means. P?AC&)% 304 O D$ The investor can simply place the order by informing bro!er to place an order on his behalf if he has open trading account ith bro!er or else log into bro!erGs ebsite and can place order on bro!erGs site. The bro!er enters the order through his *', and sends signal to the satellite via 72)T. The signal is directed to mainframe computer at 62E via 72)T at 62EGs office. ) message relating to the order activity is broadcasted to respective member. The order confirmation message is immediately displayed on the *' of the bro!er. The order confirmation matches ith the e"isting passive orders other ise it aits for the active orders to enter in the system. #n order matching a message is broadcasted to the respective member. The snapshot screen for placing order is sho n in figure 1.

To enter a buy order

,ig 5! Snapshot screen for placing b#y order #rders are entered on the stoc! order tic!et. This order tic!et includes the action, share amount, symbol, price and duration. In the order entry tic!et enter the amount of shares you ish to trade. This must be a hole number, as the mar!et centers do not accept fractional share orders. )lso enter the trading symbol&tic!er (usually letters) for a security you ant to trade. 2elect the type of order you ould li!e to enter. The order can be of the follo ing types>
<CC

Mar*et Order! 0hen you put buy or sell price at mar!et rate then the price get e"ecutes at the current rate of mar!et. The mar!et order get immediately e"ecuted at the current available price. In mar!et order there is no need to mention the priceN the stoc!s ill get e"ecuted at the best current available price. If you ish to buy or sell stoc!s at any specific price then mar!et order is not suitable for you then you have to go for limit order. $ar!et order is for those ho ant to buy or sell immediately at the current available price. ?imit Order! ItGs totally different to mar!et order. In limit order the buying or selling price has to be mentioned and hen the stoc! price comes to that price then your order ill get e"ecuted ith the mentioned price by you. .ut here itGs not sure that the price ill come to your limit order. Importantly limit order and stop loss trigger price are used together. Stop Order! this is a mar!et order to buy or sell if a specified price (the stop price) is reached or passed. )s soon as the stop price is reached the order ill be e"ecuted Mat mar!etM. ) sell stop price ill be belo the mar!etN a buy stop price ill be above the mar!et. 2ell stops are the most common use of this order type. The order ill be entered after the stoc! has been purchased ith the goal of selling the stoc! and avoiding losses if the mar!et drops precipitously. Stop ?imit Order! this is an order to buy or sell a certain security at a specified price or better, but only after a specified price (stop price) has been reached. ) stop(limit order is essentially a combination of a stop order and a limit order. #ne of the things that investor need to decide hen placing an order is ho long you ant it to remain open. This is called the MtermM of the order. In order entry tic!et there is option of validity as sho n in figure 1. 9or most price types, e have t o choices> good for the day (/ay) and good until canceled (,T'). Day Order! ) buy or sell order hich automatically e"pires if it is not e"ecuted during that trading session. )ll mar!et orders are automatically set to /ay. %TC 6%ood #ntil Canceled8! )n order to buy or sell hich remains in effect until it is either e"ecuted or canceled. %ood Till DaysIDate 6%TD8! )n order that allo s the Trading $ember to specify the days&date up to hich the order should stay in the system. )t the end of this period the order ill get flushed from the system. Each day&date counted is a calendar day and inclusive of holidays. The days&date counted is inclusive of the day&date on hich the order is placed. The ma"imum number of days a ,T/ order can remain in the system is notified by the E"change from time to time. &mmediate or Cancel 6&OC8! )n order that allo s a Trading $ember to buy or sell a security as soon as the order is released into the mar!et, failing hich the order ill be removed from the mar!et. *artial match is possible for the order, and the unmatched portion of the order is cancelled immediately. P?AC&)% S$?? O D$ The procedure for placing sell order is same as placing buy order

<CB

To enter a Sell order

,ig >! represents snapshot screen of placing sell order+ *rocedure for buying and selling under open outcry trading It involves follo ing series of steps> 5+ 9inding a .ro!er> 4nder open outcry or traditional trading shares are traded through a bro!er. 8e should be a licensed member of the stoc! e"change. >+ #pening an account ith the bro!er> The bro!er opens an account in the name of the prospective client after chec!ing the credit orthiness of the client. 8e rites customerGs name in the bro!er boo!. B+ *lacing the order> The orders may be Immediate or cancel order> It means to e"ecute the order immediately or to cancel it if it cannot be e"ecuted. /iscretionary order> .ro!er given full discretion to e"ecute. #pen order> 'lient neither fi"ed time limit nor price limit and the order can be e"ecuted any time until cancelled. 9i"ed price order> 0hen the client specifies the price at hich the shares are to be purchased. D+ $a!ing the contract> #n receipt, the bro!er or his cler! go to the floor to transact the business. The trading floor is divided into a number of sections& ings. Each section is a mar!et for particular security for ma!ing the bargain. 0hen bro!er reaches a particular ing of a particular security, he comes in contact ith other parties interested in the same security. The buyers ma!e the bids, the seller ma!es the offer. The bargains are closed at mutually agreed upon prices. The bargains are recorded by both the parties in the noteboo!N on right side sales and on left side purchases. ) slip containing brief details of the bargain is put in the bo" for ma!ing announcements in the offer price list. C+ 2ettlement of transaction> The settlement can be made as > %eady /elivery 'ontracts
<CA

 9or ard /elivery 'ontracts In ready delivery contracts immediate delivery of shares and cash payment is involved and settlement is made either on the same day or ithin short span of time hile in for ard contracts the parties in the contract do not have any intention of ta!ing delivery or ma!ing payment on buying and selling of securities. COMPA &)% $?$CT O)&C T AD&)% A)D OP$) O0TC 4 S4ST$M In todayGs busy orld, it seems as if everything is available online and instantly. 9or traders, this is often seen as a bonus. )fter all, ho ouldnGt relish the opportunity to ma!e big money, fastO 8o ever, there are some traders ho prefer the traditional stoc! trading methods, as opposed to online retailing but changes in the industry have caused more and more clients to shift from traditional trading to online trading. .oth types of bro!erages have advantages, and deciding hich one to choose comes do n to a careful consideration of the features and benefits each one can offer you. 6e and ine"perienced traders often feel more secure about or!ing ith a bro!er, hile those ho have bought and sold stoc!s in the past may prefer to handle things on their o n. 8ere are some of the differences bet een online stoc! trading and traditional stoc! trading $anner in hich an order is placed> In online stoc! trading, traders can place trades instantly using their online account. This account allo s them to access an online trading platform hosted by their bro!erage. In traditional stoc! trading, a trader must telephone their bro!er in order to set up an account. Thus trading ta!es on a more personable nature and as a result is less instant to carry out.Information )ccess> The second comparable difference is the ease ith hich information can be accessed. #nline trading means that a trader can have a hole orld of information at his fingertips in the time it ta!es to enter a search term or clic! a button. The practice of online trading means that stoc! mar!et data can be sent from an analyst to a trader in moments. #n the other hand, those involved in traditional stoc! trading ill obtain their information from traditional sources. This could be via ne spapers, +ournals or television programmes on financial channels. It could also be from their bro!er. The disadvantage ith this is that information from any of these sources, bar the bro!er, ill never be at up(to(date as those hich can be accessed online. %elying on a bro!er to provide you ith only the very latest ne s may indeed be a ris!y strategy.Type of customer(client relationship> 0ith regard to customer( client relationship many traders may ell vie the traditional stoc! trading methods as preferable. )n online bro!erage may deal ith many hundreds of clients each day, and thus a trader may not be assigned his o n personal bro!er. 'onversations ith the bro!er may be brief and fragmented, ith the onus being on placing the right trade, rather than forming a or!ing bond. 'onversely, traditional stoc! bro!ers tend to pride themselves on the long(standing relationships they build up ith customers. In this respect using a traditional stoc! bro!er may feel more emotionally re arding. $ar!et )ccess> Electronic trading has changed the mar!et place. )ccess to the mar!etplace is much improved over the old model. 9or outside customers, there is better transparency before placing an order because they see a little of the boo! and bids ith offers. They can research
<C=

trade history and see historical price quotes. Electronic trading has e"panded the reach of the mar!etplace so that anyone can be connected to it at anytime from any here. 'ost Issues> Electronic trading for many customers has driven do n the cost to trade by eliminating layers of distribution in the mar!etplace. 'ustomerRfI.X(f9loor order des!X( f9loor bro!erXfmar!etN no is simply 'ustomerX(fmar!et or 'ustomerX(fbro!erXR fmar!et. 3$)$,&TS O, O)?&)$ T AD&)% ed#ced cost of transactions> .y automating as much of the process as possible (often referred to as Mstraight(through processingM or 2T*), costs are brought do n. The goal is to %educe the incremental cost of trades as close to 1ero as possible, so that increased trading volumes donLt lead to significantly increased costs. This has translated to lo er costs for investors. %reater liA#idity> Electronic systems ma!e it easier to allo different companies to trade ith one another, no matter here they are located. This leads to greater liquidity (i.e. there are more buyers and sellers) hich increases the efficiency of the mar!ets. %reater competition! 0hile electronic trading hasnLt necessarily lo ered the cost of entry to the financial services industry, it has removed barriers ithin the industry and had a globali1ation(style competition effect. 9or e"ample, a trader can trade futures on Eure", ,lobe" at the clic! of a button R he or she doesnLt need to go through a bro!er or pass orders to a trader on the e"change floor. &ncreased transparency! Electronic trading has meant that the mar!ets are less opaque. ItLs easier to find out the price of securities hen that information is flo ing around the orld electronically. Tighter spreads> The MspreadM on an instrument is the difference bet een the best buying and selling prices being quotedN it represents the profit being made by the mar!et ma!ers. The increased liquidity, competition and transparency means that spread have tightened, especially for commoditi1ed, e"change(traded instruments. )o need to depend on bro*er> Hou are observing every movement of share mar!et right in front of your computer screen. All #pdates on yo#r comp#ter screen> )s you have internet connection ith you ill get all updates of government ne s, companiesG announcements, and corporate declaration etc during mar!et hours. &ndependent for yo#r trades! #n the other part you ill get all information of your traders on your computer screen. Hou can vie yourself your profits and losses done and depending on your current situation you can plan your further trades. In other ords you are totally independent for your trades from your bro!er. Hou are boss of yourself. D&SC0SS&O) A)D CO)C?0S&O)

<B?

The Internet is drastically changing ho everyone does business, including the financial industry. #nline investing has benefits to offer investors as ell as bro!ers. These benefits include lo transaction costs, convenience, speed, boundary spanning, improved communication, and ris! management. #pen #utcry and Electronic 9inancial Trading have advantages and disadvantages. )s an old system, open outcry has several ays to contribute the mar!et liquidity. .esides that, this system has ability to e"ecute the large trades. .ut, in the primary cost and global lin!s factors, open outcry has problems. E"amples, high cost for number of traders employed and their salaries, possibility to give 2@ hour service and to coordinate or! teams in the global scale is limited. #n the other sides, electronic financial trading has ability to reduce the primary cost, because this system needs less labor, s!ill, and time. In the global lin!s factor, electronic financial system provides tolls lin!ing bet een futures e"change and clearing corporation, lin!ing payment, and giving 2@ hour trading. )ccording to the phenomenon in the industrial society, here rapid advances in Information Technology and gro ing competition are causing fundamental changes in the orldGs financial services industry, electronic financial trading system should continue to gro rapidly. $,$ $)C$S 1. ,os ami, '. (2??<). E8o /oes Internet 2toc! Trading in India 0or!OF 7i!alpa> The -ournal for /ecision $a!ers, 7olume 2A, 6umber 1, =1(=A. 2. .arber, .. $., 3 #dean, T. (2??2). E#nline Investors> /o the 2lo /ie 9irstOF The %evie of 9inancial 2tudies, 7olume 1D, @DD(@AB. <. )tes, )., and ,. 8. 5. 0ang. EInformation Transmission in Electronic vs. #pen(#utcry Trading 2ystems> )n )nalysis of 4.2. Equity Inde" 9utures $ar!ets.F -. 9utures $!ts. 1@(2??D)><=1R@1=. @. $artens, $. E*rice /iscovery in 8igh and ;o 7olatility *eriods> #pen(#utcry versus Electronic Trading.F -. Internat 9inanacial $!ts., Institutions, and $oney A(1==A)>2@<R 2C?. D. *irrong, '. E$ar!et ;iquidity and /epth on 'omputeri1ed and #pen(#utcry Trading 2ystem> ) 'omparison of /T. and ;I99E .und 'ontracts.F -. 9utures $!ts. 1C(1==C)>D1=RD@@. C. 0alia 6idhi and %avinder 5umar (2??B), E#nline 2toc! Trading in India> )n B. Empirical InvestigationF, Indian -ournal of $ar!eting, )pril, 7olume VVV7II, 6o.@

<B1

P $D&CT&)% P &MA 4 T0MO S 0S&)% DATA M&)&)% T$C")&K0$S Meha* )aib %#r# )ana* Dev 0niversity/ Amritsar meha*naib;B51gmail+com Amit Chhabra %#r# )ana* dev #niversity/Amritsar+ chhabra+amit;F1gmail+com A3ST ACT /ata mining has received idely adoption in recent years in many industries, largely because of the ability of mining techniques to rapidly yield ans ers to business questions in a short time and the availability of large quantities of data to e"ploit. This paper ill highlight the data and te"t mining in general, along ith focusing on its applications in the area of clinical research. This paper includes survey of applications of data mining methods in medical field. This paper also discusses the various data(mining methodologies that can be used in predicting primary tumor. ($4-O DS> /ata $ining, 'lassification, 'lustering and *rimary tumor. 5+ &)T OD0CT&O) /ata $ining is defined as Mthe efficient discovery of valuable, non(obvious information from a large collection of dataM. The basic goal is to discover !no ledge out of data and present it in a form that is easily comprehensible to humans. There are several data mining techniques, such as 6agve .ayes, /ecision Trees, )rtificial 6eural 6et or!s ()66s), ,enetic )lgorithms, and %egression etc. J1?K.This paper discusses the various approaches of data mining that can be applied on various disease predictions. This paper is mainly focusing on mining the *rimary tumor dataset.*rimary tumor refers to a tumor or mass that is gro ing in the location here cancer originated. 9or instance, if a patient is diagnosed ith stomach cancer, the primary tumor ould be found in the stomach itself rather than else here in the body. 2ometimes the primary tumor can be deadly or harmful even if the cancer has not spread. This is true for tumors gro ing in the lungs, brain, and other ma+or organ systems. J1@K The paper is organi1ed as follo s. In 2ection 2, there is brief e"planation of the data mining concept. In 2ection <, discusses some recent revie of similar or! in the data mining field. 2ection @ discusses issues and challenges ith hich the primary(tumor dataset can be mined. >+ DATA M&)&)% /ata mining is defined as the process of selecting, e"ploring, and modeling large amounts of data to uncover previously un!no n patterns for business advantage J1K. It is also !no n as the process of e"tracting previously un!no n, comprehensible and actionable information from
<B2

large databases and using it to ma!e crucial business decisions +It is the e"traction of hidden predictive information from large databases, is a po erful ne technology ith great potential to help companies focus on the most important information in their data arehouses. It uses machine learning, statistical and visuali1ation techniques to discovery and present !no ledge in a form hich is easily comprehensible to humans. 0hile data mining and !no ledge discovery in databases (or 5// as sho n in figure 1) are frequently treated as synonyms, data mining is actually part of the !no ledge discovery process J1DK.
$D* ;.2 . ;.2. *4+*4B3+<<$ >C ;.2. '$>$>C ;.2. *B<2*4B3+<< $>C BD* ;.2 .

;.2. $>2+C4.2$B > @+.214+ <+/+32$B> ;$'+><$B> 4+;132$B> etc#

3/.<<$@$3.2$ B> 3/1<2+4$>C .<<B<3$.2$B > 41/+< ;$<3BE+4F

*.22+4> +E./1.2$B> *.22+4> <+/+32$B> *.22+4> $>2+4*4+2.2$B >

*.22+4> $>@B4'.2$ B> :>BW/+;C +

,ig 5! (DD process *.22+4> /ata comes from variety of sources is integrated into a singleE$<1./$G.2$B> data store called target data. )fter that data then is pre(processed and transformed into standard format. The data mining algorithms process the data to the output in form of patterns or rules. ;astly patterns and rules are interpreted to ne or useful !no ledge or information. The ultimate goal of !no ledge discovery and data mining process is to find the patterns that are hidden among the huge sets of data and interpret them to useful !no ledge and information. /ata mining is a central part of !no ledge discovery process. B+ $?AT$D -O ( There are large number of papers about applying machine learning techniques for survivability analysis and prediction analysis. In this section number of papers are studied in related to data mining contribution in medical field. /ata mining techniques such as clustering, classification, regression, association rule mining, ')%T ('lassification and %egression Tree) are idely used in healthcare domain JAK. The main focus of this paper JAK is to analy1e data mining techniques required for medical data mining especially to discover locally frequent diseases such as heart ailments, lung cancer, and breast cancer and so on. It also thro s light into the importance of locally frequent patterns and the mining techniques used for the purpose. )uthors J11K have studied that 'ancer is one of the dreadful diseases in the orld claiming ma+ority of lives.
<B<

Though cancer research is generally clinical and biological in nature, data driven statistical research has become a common complement. *redicting the outcome of a disease is one of the most interesting and challenging tas!s here data mining techniques have to be applied. There is a study of blood cancer and its symptoms and staging. Then ;inear regression algorithm is applied and implementing accuracy in this classification by finding out the ratio of cancer in male versus female cases and also hich areas record highest cancer rate and hether habits, diets, education, marital status, living area etc., hich play important roles in cancer pattern.JCK /iscusses variety of data mining techniques, approaches and different researches hich are ongoing and helpful to medical diagnosis of disease. The study revealed that depending on the type of dataset used each model differs in their performance. If the dataset consist of unlabelled features then the clustering model better suits for pattern recognition among the several methods !(means algorithm is adapted by researches due to its simplicity./ata mining plays an important role for predicting diseases in health care industry J12K. This paper revie ed the research papers hich mainly concentrated on predicting heart disease, /iabetes and .reast cancer. There as study of 6ave.ayes, 5(66, and /ecision ;ist algorithm. These algorithms have been used for analy1ing the heart disease dataset. Tanagra data mining tool is used for classifying these data. These classified data is evaluated using 1? fold crossvalidation and the results are compared. /ecision tree is one of the popular and important classifier hich is easy and simple to implement 6ave .ayes is a statistical classifier hich assigns no dependency bet een attributes. The advantages are one can or! ith the nave bayes model ithout using any .ayesian methods. 8ere 6ave .ayes 'lassifiers performs ell. This observation is performed using training to consist <???instances ith 1@ different attributes. The dataset is divided into t o testing and training i.e. B?I of data are used for training and <? I is used for testing. The authors concluded that 6ave .ayes algorithm performs ell hen compared to other algorithms.)ssociation rule mining is used to discover a small set of rules over the database to form more accurate evaluation J2K. It is studied and observed a fle"ible ay, of, mining frequent patterns by e"tending the idea of the )ssociative 'lassification method. 9or better performance, the 6eural 6et or! )ssociation 'lassification system is also analy1ed here to be one of the approaches for building accurate and efficient classifiers. It also concluded that the 6eural 6et or! )ssociation 'lassification system find best possible accurate results. )ssociation rule mining and classification rule mining can be integrated to form a frame or! called as )ssociative 'lassification and these rules are referred as 'lass )ssociation %ules. This revie research paper also analy1es ho data mining techniques are used for predicting different types of diseases. This paper revie ed the research papers hich mainly concentrated on predicting /iabetes.The study to investigate and compare seven different classification algorithms namely, 6aive .ayes, 6aive .ayes updatable, 9T Tree, 52tar, -@A, ;$T, and 6eural net or! for analy1ing 8epatitis prognostic data has been presented J@K. The study concludes that the 6aive .ayes classification performance is better than other classification techniques for hepatitis dataset.)uthors in the study JDK have done the comparison among the different classifiers decision tree (-@A), $ulti(;ayer *erception ($;*), 6aive .ayes (6.), 2equential $inimal #ptimi1ation (2$#), and Instance .ased for 5(6earest neighbor
<B@

(I.5) on three different databases of breast cancer (0isconsin .reast 'ancer (0.'), 0isconsin /iagnosis .reast 'ancer (0/.') and 0isconsin *rognosis .reast 'ancer (0*.')) by using classification accuracy and confusion matri" based on 1?(fold cross validation method. )lso, a fusion at classification level bet een these classifiers to get the most suitable multi(classifier approach for each data set is also introduced. The e"perimental results sho that in the classification using fusion of $;* and -@A ith the *') is superior to the other classifiers using 0.' data set. The *') is used in 0.' dataset as a features reduction transformation method in hich combines a set of correlated features. In 0*.' data set the results sho that the classification using fusion of $;*, -@A, 2$# and I.5 is superior to the other classifiers. )ll e"periments are conducted in 0E5) data mining tool. ) prototype model for the breast cancer as ell as heart disease prediction using data mining techniques is discussed in J=K. The data used is the *ublic(4se /ata available on eb, consisting of =?= records for heart disease and C== for breast cancer. T o decision tree algorithms '@.D and the 'D.? have been used on these datasets for prediction and performance of both algorithms is compared. #ral cancer is the si"th most common cancer and a ma+or health problem in the orld JBK. It aimed at /6) repair genes such as V(ray repair cross(complementing group (V%'') 1, 2, <, and @. 2ingle nucleotide polymorphisms (26*s) dataset ith 2<A samples of oral cancer and control patients ere chosen for disease prediction. )ll prediction e"periments ere conducted using the support vector machine. The result sho ed the performances of the holdout cross validation is superior to 1?( fold cross validation, and the best classification accuracy is C@.2I. 5(means clustering approach using 0e!a interface has been discussed in J1<K. It contained an introduction to the 0E5) or!bench, revie s the history of the pro+ect, and, in light of the recent <.B stable release along ith !(means clustering e"ecution in 0E5) <.B as sho n in figure 2.

,ig >! -e*a &nterface 'lustering is idely used in gene e"pression data analysis. .y grouping genes together based on the similarity bet een their gene e"pressions, functionally related genes may be found. 2uch a grouping suggests the function of presently un!no n genes. D+ P &MA 47T0MO P $D&CT&O)! &SS0$S A)D C"A??$)%$S

<BD

) primary tumor refers to a tumor or mass that is gro ing in the location here cancer originated. The organs and tissues of the body are made up of tiny building bloc!s called cells. 'ancer is a disease of these cells. 'ancer can sometimes spread from here it first started to gro (primary cancer) to form cancers in other parts of the body (secondary cancers). 9or instance, if a patient is diagnosed ith stomach cancer, the primary tumor ould be found in the stomach itself rather than else here in the body. The primary tumor is generally the easiest to remove. It is very important to find it else it may gro and may arise some other lin!ed tumors. 2ometimes cancer cells brea! a ay from the original (primary) cancer. They may spread to other parts of the body through the bloodstream or lymphatic system. The lymphatic system is part of the immune system. ;ymph nodes (glands) are part of this system. They e"ist throughout the body and are connected together by a net or! of tiny tubes (ducts) that carry a fluid called lymph. 0hen a secondary cancer is diagnosed, but even after tests have been carried out, doctors canGt tell here the cancer first started. The primary cancer is un!no n J<K.There e"ist many papers on the mining of the datasets that applies different algorithms ith different statistics. There is need of some accurate and least comple" methods that can provide some hidden and valuable information from the dataset that can help in medical field in detecting the primary origin of cancer. In most cases, a lot of time is asted in trying every single prediction technique (bagging, 27$, etc.) in a bid to find the best solution that fits the analystLs needs. 8ence, ith the advent of improved and modified prediction techniques, there is a need for an analyst to !no hich tool performs best for a particular type of dataset. )lgorithm can be selected from classification, association rules or ith clustering algorithm that can give the best and accurate results.)ttribute subset selection ith methods on the basis of relevance analysis is one ay to reduce the dimensionality as sho n in figure <. %elevance analysis of attribute is done by means of correlation analysis, hich detects the attributes (redundant) that do not have significant contribution in the characteristics of hole data of concern. %an!er ran!s the attribute on the basis of information gain. ,enetic search ran!s the attribute in terms of fitness. Then particular classification approach can be used to define the correctly classified instances on the training set then the model can be tested on the test set. If there are more than 2 classes then multilayer perceptron ith genetic or ran!er search can provide better results as decision tree can be comple" and difficult to understand among classification algorithms. Then there can also be use of the clustering approach to define the groups of similar attributes along ith association rule mining approach in order to find the associated rules in the dataset. 2o ith the use of various algorithms e can find the hidden information in the dataset. $any open source data mining tool are available hich can help in mining the dataset li!e 0e!a <.C, Tangara, %apidminer etc. C+ CO)C?0S&O) In this survey paper the problem of summari1ing the different algorithm of data mining are used in the field of medical prediction are discussed. The main focus is on using different algorithm and combination of several targets attributes for primary tumor prediction using data mining. 9irstly data mining concepts along ith the necessity of predicting primary tumor are discussed. This paper also discusses the various research or!s on data mining methods applied in medical
<BC

field. /epending upon the dataset particular data mining algorithm is selected and mostly it is found that ith less number of classes decision tree is fast and accurate hereas ith increasing number of classes multilayer perceptron is better to understand and accurate. It is also found that feature subset selection or attributes are reduced

<2.42

*ri-ar tu-or#arff

.224$?12+ <+/+32$B>

3/.<<$@$3.2$B > ./CB4$2H'

3B44+32/F 3/.<<$@$+; $><2.>3+< <$'$/.4 2F*+ B@ .224$?12+<

3/1<2+4$>C ./CB4$2H'

.<<B<3$.2$B> 41/+< ./CB4$2H'

<BB

.<<B3$.2+; 41/+< $> ;.2.<+2

+>;

,ig B! Steps for mining primary t#mor dataset

using genetic search. )ssociation rule discovery is mainly based on constraints namely item filtering and attribute grouping. In future the or! can be e"panded and enhanced for the automation of primary tumor prediction. In the overall survey, it can be concluded that ith multiple data mining algorithms e can mine the dataset and can find hidden information from the dataset in order to reach to the valuable information from large amount of data. It is also concluded that each algorithm has its o n evaluation techniqueN so it cannot be easily said hich one is better. 8ence for the mining of primary(tumor dataset, it is very important to analy1e the various algorithms on the dataset and then find the specific algorithms hich provide different patterns and helps to find the valuable information from the inconsistent dataset given. $,$ $)C$S 1. /ave 2mith, E/ata $ining in the 'linical %esearch EnvironmentF, 2ource> http>&& .sas.com, 45, 2??B. 2. /eeptio -ain et.al, E) %evie on associative classification for /iabetic /atasets) 2imulation )pproachF, International +ournal of computers 3 technology 7ol B, 6o 1, $ay <?, 2?1<, I226 22BB<?C1. <. Erin -. 8ill, 0ise,EE5 )rticle Edited .y> .ron yn 8arris, ;ast $odified /ate> 1B #ctober 2?1<, 'opyright *rotected> 2??<(2?1< 'on+ecture 'orporation. )vailable> http>&& . isegee!.com. @. 9adl $utaher .a()l i et.al,F 'omparative 2tudy for )nalysis the *rognostic in8epatitis /ata> /ata $ining )pproachF, International -ournal of 2cientific 3 Engineering %esearch, 7olume @, Issue A, )ugust(2?1< CA?I226 222=(DD1A I-2E% 2?1< http>&& .i+ser.org.
<BA

D. ,ouda I. 2alama et.al,E9u11y )nalysis of .reast 'ancer /isease using 9u11y c(means and *attern%ecognitionF, 2outheast Europe +ournal of soft computing, sep 2?12. C. 5.;o!anaya!i et.al, EE"ploring on 7arious *rediction $odel in /ata $ining Techniques for /isease /iagnosisF, International -ournal of 'omputer )pplications (?=BD R AAAB) 7olume BB R 6o.D, 2eptember 2?1<. B. ;i(Heh 'huang et.al, E2upport 7ector $achine(based *rediction for#ral 'ancer 4sing 9our 26*s in /6) %epair ,enes E*roceedings of the International $ulti'onference of Engineers and 'omputer 2cientists 2?11 7ol I,I$E'2 2?11, $arch 1C ( 1A, 2?11. A. $ohammed )bdul 5haleel et.al , E) 2urvey of /ata $ining Techniques on $edical /ata for 9inding ;ocally 9requent /iseasesE, International -ournal of )dvanced %esearch in 'omputer 2cience and 2oft are Engineering, 7olume <, Issue A, )ugust 2?1<, I226> 22BB 12AV. =. $ohammad Taha 5han et.al ,F ) *rototype of 'ancer&8eart /isease *rediction $odel 4sing /ata $iningF, International -ournal of )pplied Engineering %esearch, I226 ?=B<( @DC2 7ol.B 6o.11,2?12. 1?. 6evine $. ;abib et. al, E0orld )cademy of 2cience, Engineering and TechnologyF 2??B. 11. 6.2udha .huvanes ari et.al, EInformation e"traction of predicting blood cancerF, I-'2 International -ournal of 'omputer 2cience, 7olume 1, Issue @, 2eptember 2?1<. 12. 2.7i+iyarani et.al, E/isease *rediction in /ata $ining Technique R ) 2urveyF, International -ournal of 'omputer )pplications 3 Information Technology7ol. II, Issue I, -anuary 2?1< (I226> 22BA(BB2?) 1<. 2apna -ain et.al, E5($E)62 ';42TE%I6, 42I6, 0E5) I6TE%9)'EF, *roceedings of the @th 6ational 'onferenceN I6/I)'om(2?1? 'omputing 9or 6ation /evelopment, 9ebruary 2D R 2C, 2?1?. 1@. 2ource> 9rom Ehttp>&& .1entut.com&data(mining&data(mining(applications&,F 2?1<. 1D. H. %amamohan ET. )l E) 2tudy of /ata $ining Tools in 5no ledge /iscovery *rocessF, International -ournal of 2oft 'omputing and Engineering (I-2'E) I226> 22<1( 2<?B, 7olume(2, Issue(<, -uly

<B=

$%&O) 3AS$D D&%&TA? &MA%$ P OC$SS&)% )aina "anda Asst+Prof/ Comp Sc/ DA@ College/ Amritsar naina2pisces5;1yahoo+co+in

5 A3ST ACT In areas such as computer vision and Image processing, image segmentation has been and still is a relevant research area due to its ide spread usage and application. This paper focuses on quantitative evaluation and analysis of image segmentation techniques. Image segmentation techniques are being idely used and choosing suitable image segmentation technique is one of the !ey factors for getting better results. 0e considered the techniques under the follo ing three groups> Threshold(based, Edge(based and %egion(based. %egion ,ro ing is an approach to image segmentation in hich neighboring pi"els are e"amined and added to a region class if no edges are detected. This process is iterated for each boundary pi"el in the region. If ad+acent regions are found, a region(merging algorithm is used in hich ea! edges are dissolved and strong edges are left intact. %egion ,ro ing offers several advantages over conventional segmentation techniques. 4nli!e gradient and ;aplacian methods, the borders of regions found by region gro ing are perfectly thin (since e only add pi"els to the e"terior of our region) and connected. The algorithm is also very stable ith respect to noise. P O3?$M D$,&)AT&O) In this our main ob+ective is to study the region based image segmentation techniques hich produce better results in achieving the main goal of image segmentation. There are many techniques under image segmentation. 8ere e have discussed the most prominent technique hich is !no n as region based technique. $?AT$D -O (S (Dr+S+@+(asmir aja/ A+Shai* Abd#l (hadir/ Dr+S+S+ ia' Ahamed/ ><<:8 have studied the atershed method, also called the atershed transform, is a region based image segmentation approach based on mathematical morphology.. It also concluded the $atlab implementation of the atershed transform hich is very sensitive to image noise and usually produces over segmented regions. To solve this problem, the first smooth images ith ,aussian smoothing filters of different scales before applying the atershed transform. .y varying the parameter of ,aussian filters, e can segment an image into a target number of regions. 6Ms+Chin*i Chandho*/ Mrs+Soni Chat#rvedi/ Dr+A+A (h#rshid / A#g><5>8 have concluded the ne approach for image segmentation by applying !(means algorithm. In image segmentation, clustering algorithms are very popular as they are intuitive and are also easy to implement. This paper proposes a color(based segmentation method that uses 5(means
<A?

clustering technique .The !(means algorithm is an iterative technique used to partition an image into ! clusters. This approach thus provides a feasible ne solution for image segmentation hich may be helpful in image retrieval. (Shilpa (amdi/ +(+(rishna ><5>8 This paper provides a survey of achievements, problems being encountered, and the open issues in the research area of image segmentation and usage of the techniques in different areas along ith various region gro ing algorithms and also provides several advantages of %egion ,ro ing over conventional segmentation techniques. ( ajeshwar Dass/ Priyan*a/ Swapna Devi ><5>) This paper describes the different segmentation techniques used in the field of ultrasound and 2)% Image *rocessing. This paper investigates ho various techniques are different from each other. 8ere they focus more on the more common approaches hich are discontinuity based and similarity based in detail and along ith it also compiles some of the technologies used for image segmentation. &)T OD0CT&O) The main goal of image segmentation is domain independent partitioning of an image into a set of dis+oint regions that are visually different, homogeneous and meaningful ith respect to some characteristics or computed property such as grey level, te"ture or color to enable easy image analysis. Image segmentation is a useful tool in many realms including industry, health care, astronomy, and various other fields. 2egmentation in concept is a very simple idea. 2imply loo!ing at an image, one can tell hat regions are contained in a picture. Is it a building, a person, a cell, or +ust simply bac!groundO 7isually it is very easy to determine hat is a region of interest and hat is not. /oing so ith a computer algorithm on the other hand is not so easy. 8o do you determine hat defines a regionO 0hat features distinguish one region from anotherO 0hat determines ho many regions you have in a given imageO /iscontinuity and similarity&homogeneity are t o basic properties of the pi"els in relation to their local neighborhood used in many segmentation methods. The segmentation methods that are based on discontinuity property of pi"els are considered as boundary or edges based techniques and that are based on similarity or homogeneity are region based techniques. 0e have intentionally separated thresholding technique from region based due the usage of histogram and its simplicity. Image segmentation ould have been easy if not because ofN J1KJ2K Image noise 0ea! ob+ect boundaries Inhomogeneous ob+ect region 0ea! contrast and $any others that affect images. &MA%$ S$%M$)TAT&O)95=9>= Segmentation refers to the process of partitioning a digital image into multiple regions (sets of pi"els).The goal of segmentation is to simplify or change the representation of an image into something that is more meaningful and easier to analy1e.Image segmentation is typically used to
<A1

locate ob+ects and boundaries in images. Each of the pi"els in a region are similar ith respect to some characteristic or computed property, such as color, intensity, or te"ture. )d+acent regions are significantly different ith respect to the same characteristic. The purpose of image segmentation is to partition an image into meaningful regions ith respect to a particular application. The motion. 4sually image segmentation is an initial and vital step in a series of processes aimed at overall image segmentation is based on measurements ta!en from the image and might be grey level, colour, te"ture, depth or understanding, 2egmentation. 2ome applications of image segmentation in medical field include> ;ocate tumors and other pathologies, $easure tissue volumes, 'omputer(guided surgery

,ig 5 S$%M$)TAT&O) APP OAC"$S There are t o approaches of Image segmentation>

Approac#es of "(age Seg(entation
<A2

;iscontinuit ?ased

<i-ilarit ?ased

,ig >

1+Discontin#ity 3ased(Interested In Identification of> Isolated points ;ines Edges *resent In Images 2.Similarity 3ased(In this, e try to group those pi"els hich are similar in some sense.The )pproaches under this technique is> Thresholding #peration %egion .ased )pproach %egion ,ro ing %egion 2hrin!ing(%egion 2plitting and $erging)

$%&O) 3AS$D S$%M$)TAT&O)9B=9D= Image segmentation reduces pi"el data to region(based information. It is e"plained in t o categories> $%&O) % O-&)%! ) simple approach to image segmentation is to start from some pi"els (seeds) representing distinct image regions and to gro them, until they cover the entire image. 9or region gro ing us need a rule describing a gro th mechanism and a rule chec!ing the homogeneity of the regions after each gro th step. ,roup pi"els or sub(regions into larger regions hen homogeneity criterion is satisfied. %egion gro s around the seed point based on similar properties (grey level, te"ture, color). $%&O) % O-&)% A?%O &T"M is u 2impler u It ta!es more time than both the above algorithms A?%O &T"M&C APP OAC" egion Splitting
<A<

%egion gro ing starts from a set of seed points. )n alternative is to start ith the hole image as a single region and subdivide the regions that do not satisfy a condition of homogeneity. egion Merging %egion merging is the opposite of region splitting. 2tart ith small regions (e.g. 2"2 or @"@ regions) and merge the regions that have similar characteristics (such as gray level, variance). Typically, splitting and merging approaches are used iteratively.

SP?&T A)D M$ %$ APP OAC" The goal of Image 2egmentation is to find regions that represent ob+ects or meaningful parts of ob+ects. $a+or problems of image segmentation are result of noise in the image. )n image domain V must be segmented in 6 different regions %(1),\,%(6) This is a 2 step procedure> top(do n> split image into homogeneous quadrant regions bottom(up> merge similar ad+acent regions

The algorithm includes> TOP7DO-) The opposite approach to region gro ing is region splitting. It is a top(do n approach and it starts ith the assumption that the entire image is homogeneous. If this is not true, the image is split into four sub images. This splitting procedure is repeated recursively until e split the image into homogeneous regions. If the original image is square 6 " 6, having dimensions that are po ers of 2(6 P 2n)N )ll regions produced but the splitting algorithm are squares having dimensions $ " $ , here $ is a po er of 2 as ell.2ince the procedure is recursive, it produces an image representation that can be described by a tree hose nodes have four sons each. 2uch a tree is called a :uad tree.

<A@

Steps! successively subdivide image into quadrant regions (i stop hen all regions are homogeneous>(()6(i ) G T(F0) obtain quadtree structure 3OTTOM70P at each level, merge ad+acent regions (i and (H if )6(i I (H J) G T(F0 Iterate until no further splitting&merging is possible

"O- &T -O (SMMMI

<AD

<AC

-atershed Method 6-S8 9C= The 0atershed method, also called the atershed transform, is an image segmentation approach based on multi component images. 0atershed 2egmentation gets its name from the manner in hich the algorithm segment regions into 'atchment basins. The term atershed refers to a ridge that divides areas drained by different river systems. ) catchment basin is the geographical area draining into a river or reservoir. The atershed transform requires that you thin! of an image as a surface.This method bi+ectively maps multi(dimensional data into a mono(dimensional space. In geography, a atershed is the ridge that divides areas drained by different river systems. .y vie ing an image as a geological landscape, the atershed lines determine the boundaries that separate image regions. In the topographic representation of an image, the numerical value (i.e., the gray tone) of each pi"el stands for the evolution at this point. The atershed transform computes the catchments basins and ridge lines, ith catchment basins corresponding to image regions and ridge lines relating to region boundaries. 0ith surfaces, it is natural to thin! in terms of catchment basins and atershed lines. The !ey behind using the atershed transform for segmentation is this> 'hange your image into another image hose catchment basins are the ob+ects you ant to identify.

<AB

Watershed lines

In such a topographic interpretation, there are < types of points> *oints belonging to a regional minimum *oints at hich a drop of ater ould fall to a single minimum. (The catchment basin or atershed of that minimum.) *oints at hich a drop of ater ould be equally li!ely to fall to more than one minimum. (The divide lines or atershed lines.) The ob+ective is to find atershed lines. The idea is simple> 2uppose that a hole is punched in each regional minimum and that the entire topography is flooded from belo by letting ater rise through the holes at a uniform rate. 0hen rising ater in distinct catchment basins is about the merge, a dam is built to prevent merging. These dam boundaries correspond to the atershed lines. A?%O &T"M 1. 2tart ith all pi"els ith the lo est possible value. These form the basis for initial atersheds 2. for each intensity level !> 9or each group of pi"els of intensity ! If ad+acent to e"actly one e"isting region, add these pi"els to that region Else if ad+acent to more than one e"isting regions, mar! as boundary Else start a ne region The atershed transform is often applied to the problem here there are separate touching ob+ects in the image.
<AA

The atershed transform usually leads to over segmentation of images due to image noise and other local irregularities. E"ample> 0e consider the beach image to analy1e the performance of 02 method. 9ig.(a) is the original beach image, 9ig.(b) is itGs gray image and 9ig. (c) represents segmented vie using this method. ,ig+6a8 Original &mage,ig+6b8 %ray &mage ,ig+ 6c8 -atershed segmented image 9inally, e can say The 0atershed $ethod is efficient for images ith a small number of segments. C?0ST$ &)% 9G=9;= 'lustering is a classification technique. ,iven a vector of 6 measurements describing each pi"el or group of pi"els (i.e., region) in an image, a similarity of the measurement vectors and therefore their clustering in the 6(dimensional measurement space implies similarity of the corresponding pi"els or pi"el groups. Therefore, clustering in measurement space may be an indicator of similarity of image regions, and may be used for segmentation purposes.The vector of measurements describes some useful image feature and thus is also !no n as a feature vector. 2imilarity bet een image regions or pi"els implies clustering (small separation distances) in

<A=

the feature space. 'lustering methods ere some of the earliest data segmentation techniques to

be developed.

Similar data points gro#ped together into cl#sters

C?0ST$ &)% A?%O &T"M!9G=9;= (7Means Cl#stering 5($eans clustering generates a specific number of dis+oint, flat (non(hierarchical) clusters. It is ell suited to generating globular clusters. The 5($eans method is numerical, unsupervised, non(deterministic and iterative. 5($eans )lgorithm *roperties u There are al ays 5 clusters. u There is al ays at least one item in each cluster. u The clusters are non(hierarchical and they do not overlap. u Every member of a cluster is closer to its cluster than any other cluster because closeness does not al ays involve the center of clusters. The (7Means Algorithm Process 1. The dataset is partitioned into 5 clusters and the data points are randomly assigned to the clusters resulting in clusters that have roughly the same number of data points. 2. for each data point> u 'alculate the distance (Euclidean) from the data point to each cluster. u If the data point is closest to its o n cluster, leave it here it is. If the data point is not closest to its o n cluster, move it into the closest cluster. <. %epeat the above step until a complete pass through all the data points results in no data point moving from one cluster to another. )t this point the clusters are stable and the clustering process ends.

<=?

,ig#re! 9lo (chart of an image segmentation method "ow it wor*s> 2tep 1> 9irst, an image is ta!en as an input. The input image is in the form of pi"els and is transformed into a feature space (%.,). 2tep 2> 6e"t similar data points, i.e. the points hich have similar color, are grouped together using any clustering method. ) clustering method such as !(means clustering is used to form clusters as sho n in the flo chart. The distances are calculated using Euclidean distant.

The above figure sho s ho the data points are clustered in the <(d %,. space. )s one can see all similar colors are grouped together to form a cluster. The data points ith minimum Euclidean distance are grouped together to form the clusters. Euclidean /istance> uThe Euclidean distance is the straight(line distance bet een t o pi"els uEuclidean distance P o(("1 ( "2) Z (y1 ( y2)) , here ("1,y1) 3 ("2,y2) are t o pi"el points or t o data points. 2tep <>
<=1

)fter clustering is done, the mean of the clusters is ta!en. Then the mean color in each cluster is calculated to be remapped onto the image. $Hample! Original image

Origina >7Cl#sters 6Only two colors can be seen after segmentation8

D7Cl#sters6D colors can be seen with D cl#sters8

G7Cl#sters 6G colors can be seen after

segmentation8 The image segmentation is done using !(means clustering in <(/ %,. space, so it or!s perfectly fine ith all images. CO)C?0S&O) )t last, after studying all the different approaches of region based, e conclude that 5(means )lgorithm or!ed the best hen e compare ho ell the images ere segmented. .ut if e compare the time ta!en by each algorithm,0atershed algorithm or!s best. The atershed transform is often applied to the problem herethere are separate touching ob+ects in the image. The orst algorithm in both time and segmentation is %egion ,ro ing )lgorithm. $,$ $)C$S 1. %a+esh ar /ass et.all ,EImage 2egmentation TechniquesF, I-E'T 7ol. <, Issue 1, -an. ( $arch 2?12.
<=2

2. 6. %. *al and 2. 5. *al, E) revie on image segmentation techniques, E *attern %ecogn.2C,12BB(12=@ (1==<). <. EImage 2egmentation and %egion ,ro ing )lgorithmF,International -ournal of 'omputer Technology and Electronics Engineering (I-'TEE) 7olume 2, Issue1 1?<. @. /r.s.v.!asmir ra+a, ).shai! abdul !hadir, /r.2.2.ria1 ahamed,E$oving to ard region( based image D. 2egmentation techniques> a studyF,-ournal of Theoretical and )pplied Information Technology 2??D ( 2??= -)TIT. C. ;. 7incent and *. 2oille,E0atersheds in digital spaces an efficient algorithm based on immersion simulationsF IEEE Trans. #n *attern )nalysis and $achine Intelligence,1<(C)>DA<(D=A,-une 1==1. B. 2.$ary *raveena, /r.Ila7ennila,F #ptimi1ation 9usion )pproach for Image 2egmentation 4sing 5($eans )lgorithmF, International -ournal of 'omputer )pplications (?=BD R AAAB)7olume 2 R 6o.B, -une 2?1? . A. -.) 8artigan E'lustering )lgorithmsF, 6e Hor! 0iley 1=BD.

<=<

AM3&%0&T4 &) )AT0 A? ?A)%0A%$ P OC$SS&)% @eerawali 3hel M+Tech 6SS8/%)D0/ Amritsar behalveerawali1yahoo+in A3ST ACT This paper analy1es some forms of linguistic ambiguities in English. ;anguage is a hallmar! of intelligence, and endo ing computers ith the ability to analy1e and generate language a field of research !no n as 6atural ;anguage *rocessing (6;*)( has been the dream of )rtificial Intelligence()I). In this paper e give a perspective of 6;* from the point of vie of analy1ing the ambiguities. ;anguage is fraught ith ambiguity at all levels, be they morphemes, ords, phrases, sentences or paragraphs. 0e discuss these ambiguities ith e"amples. P O3?$M D$,&)AT&O) In this paper, e are dealing ith common ambiguities that are found in language and ma!e language ambiguous that create lots of understanding problems along ith brief comparative study of resolving techniques that are required in language understanding. $?AT$D -O ( 62??= ,8 has concluded the various types of ambiguities. It is studied that there are quite a number of ambiguities hich varies from each other in different ays and also concluded the tagging approach hich is part of speech tagging that is used for disambiguation. 6)eet# Sharma/ Samit (#mar/ Dr+ S+ )iranjan/ ><5>8 have concluded that 0ord 2ense /isambiguation is applied by a combination of learning algorithms. The study is aimed at comparing the performance of using machine learning algorithms for 0ord 2ense /isambiguation (02/) and traditional approach of !no ledge based. There are many machine learning algorithm li!e nagve bayes, decision tree, neural net or!, clustering, decision list etc.It is also concluded that machine learning algorithm or!s faster ith good accuracy as compare to !no ledge based or dictionary based methods. 6Tamara MartYn -anton/ afael 3erlanga??avori/ ><5>8 have studied clustering(based )pproach for 0ord 2ense /isambiguation. It defined that clustering is the ay to identify groups of semantically related ord senses that can be successfully used in a disambiguation process. In this paper, they presented an unsupervised disambiguation method relying on ord sense clustering that also reveals the implicit relationships (not asserted in 0ord6et) e"isting among these ord senses. They also investigated in depth the role of clustering and its contribution to 02/.
<=@

6-ord Sense Disambig#ation! ?iterat#re S#rvey /.#ne ><5>8have studied the machine learning based approaches for automated classification of ord senses. 2upervised 02/ uses machine learning techniques on a sense(annotated data set to classify the senses of the ords. There are a number of classifiers that assign or classify an appropriate sense to an instance of a single ord.Each algorithm has used certain features associated ith a sense for training. )lgorithms include decision tree, neural net or!, parallel corpa, decision list etc. &)T OD0CT&O) 6atural language processing is the tas! of analy1ing and generating by computers, languages that humans spea!, read and rite J1KJ2KJ<K.6;* is concerned ith questions involving three dimensions> language, algorithm and problem. 9igure 1 e"presses this point. #n the language a"is are different natural languages and linguistics. The problem a"is mentions different 6;* tas!s li!e morphology, part of speech tagging etc. The algorithm a"is depicts mechanisms li!e 8$$, $E$$, '%9 etc. for solving problems. 8ere e are going to deal ith the problems that are related to ambiguities.

,ig 5! Three dimensions of )?P AM3&%0&T4 It is commonly !no n in the field of 6atural ;anguage *rocessing that even simple sentences have a large number of possible readings. )mbiguity is one reason hy computers do not yet understand natural language. ) ord, phrase, or sentence is ambiguous if it has more than one meaning. The ord LlightL, for e"ample, can mean not very heavy or not very dar!. 0ords li!e LlightL, LnoteL, LbearL and LoverL are le"ically ambiguous. They induce ambiguity in phrases or sentences in hich they occur, such as Llight suitL and LThe duchess canLt bear childrenL. 8o ever, phrases and sentences can be
<=D

ambiguous even if none of their constituents is. The phrase Lporcelain egg containerL is structurally ambiguous, as is the sentence LThe police shot the rioters ith gunsL. )mbiguity can have both a le"ical and a structural basis, as ith sentences li!e LI left her behind for youL and L8e sa her duc!L.J1KJ2K The notion of ambiguity has philosophical applications. 9or e"ample, identifying an ambiguity can aid in solving a philosophical problem. 2uppose one onders ho t o people can have the same idea, say of a unicorn. This can seem pu11ling until one distinguishes LideaL in the sense of a particular psychological occurrence, a mental representation, from LideaL in the sense of an abstract, shareable concept. #n the other hand, gratuitous claims of ambiguity can ma!e for overly simple solutions. )ccordingly, the question arises of ho genuine ambiguities can be distinguished from spurious ones. *art of the ans er consists in identifying phenomena ith hich ambiguity may be confused, such as vagueness, unclarity, ine"plicitness and inde"icality.J1KJ2KJDK -"4 AM3&%0&T4 &S A P O3?$MMM95= 2earch space increased> combinatorial e"plosion .asically ambiguity increases the range of possible interpretations of natural language, and a computer has to find a ay to deal ith this. The combinatorial e"plosion results from multiplying up each individual ambiguity. 2uppose each ord in a 1? ord sentence could have < interpretations. The number of interpretations of the hole sentence is going to be> <b<b<b<b<b<b<b<b<b< P D=?@= and due to syntactic & semantic & pragmatic ambiguity the actual number of possible interpretations ill be huge. T4P$S O, AM3&%0&T&$S9C=9G= 0e have studied the total five ambiguities. These are follo ing> 1. ;e"ical )mbiguity 2. 2tructural )mbiguity <. %eferential )mbiguity @. 2cope )mbiguity D. *ragmatic )mbiguity 5+ ?eHical ambig#ity It defines it as SSa ord ith more than one possible meaning in a conte"tGG.;e"ical ambiguity is by far the more common. Everyday e"amples include nouns li!e LchipL, LpenL and LsuitL, verbs li!e LcallL, Ldra L and LrunL, and ad+ectives li!e LdeepL, LdryL and LhardL. There are various tests for ambiguity. #ne test is having t o unrelated antonyms, as ith LhardL, hich has both LsoftL and LeasyL as opposites. There are t o types of le"ical ambiguities> 8omonymy *olysemy

<=C

"omonymy> It is relationship bet een t o or more separate le"ical items have same form but different unrelated meaning i.e. the items called homonymy that have same phonetic or ritten form. E"ample> 2 allo (as a bird &to s allo ).

Types> 1. "omophone( It has different spellings and meanings but have same sounds. E"ample> The verb LdesertL and the noun LdessertL, hich sound the same but are spelled differently, count as distinct ords (they are homonyms). 2o do the noun LbearL and the verb LbearL, even though they not only sound the same but are spelled the sameO 2. "omographs(It has different meaning and pronunciation and have same spellings. E"ample> Tear, Tear. <. Complete(It has different meaning but have same spellings and sounds. E"ample> .an!. PO?4S$M4 It deals ith t o multiple meaning means single le"eme ith several senses called polysemy. E"ample> 9ace (of a human& of a cloc!).

<=B

T4P$S! 1. Metonymy(It has different meaning of a single le"eme. E"ample> .an! account (8e has ban! account& he married ban! account) that is name of the attribute stands for the name itself. >. Metaphors(It has .E"ample> *osition(,ood position to atch&he is at a good position in the university). >+ ST 0CT0 A? AM3&%0&T4 It is a question of E hat goes ith hatF. In this e have several options and ays in hich constituents relate to each other. 2tructural ambiguity occurs hen a phrase or sentence has more than one underlying structure, such as the phrases LTibetan history teacherL, La student of high moral principlesL and Lshort men and omenL, and the sentences LThe girl hit the boy ith a boo!L and L7isiting relatives can be boringL. These ambiguities are said to be structural because each such phrase can be represented in t o structurally different ays, E"ample> LJTibetan historyK teacherL and LTibetan Jhistory teacherKL. Indeed, the e"istence of such ambiguities provides strong evidence for a level of underlying syntactic structure (see 2H6T)V). 'onsider the structurally ambiguous sentence, LThe chic!en is ready to eatL, hich could be used to describe either a hungry chic!en or a broiled chic!en. T o types of attachment are used here> 1. Coordinate attachment( 'o(ordinates in a sentence such as )6/, #%, .4T attach t o or more parts together. E"ample> 0hat can you eat if you are told in the refectory MHou can have peas and beans or carrots ith the set mealM. 1. JpeasK and Jbeans or carrotsK 2. Jpeas and beansK or JcarrotsK This is !no n as co(ordinate attachment. 2. Prepositional attachment( E"ample> 0hat are you being as!ed to do in M*ut the bo" on the table by the indo in the !itchenM. 1. *ut the bo" (a specific bo" ( the one on the table by the indo ) in the !itchen. 2. *ut the bo" on the table ( a specific table ( by the indo in the !itchen). etcY This is !no n as prepositional attachment.
<=A

B+ $,$ $)T&A? AM3&%0&T4 It is defined as $ore than one ob+ect is being referred to by a noun phrase or pronoun phrase. E"ample> 0hat can T8EH refer to in> M)fter T8EH finished the e"am the students and lecturers left.M 2tudents only ;ecturers only .oth D+ SCOP$ AM3&%0&T4 ) scope ambiguity is an ambiguity that occurs hen t o quantifiers or similar e"pressions can ta!e scope over each other in different ays in the meaning of a sentence. EIt is not le"ical but structural in nature. E"ample> Every man loves a oman. The more prominent meaning of this sentence is that for every man, there is a oman, and itLs possible that each man loves a different oman. .ut the sentence also has a second possible meaning, hich says that there is one particular oman ho is loved by every man. SOM$ T$C")&K0$S O, AM3&%0&T4 $SO?0T&O)9G= There are multiple techniques in resolving the ambiguities in languages from traditional approach of !no ledge based to modern technique of ord sense disambiguation. There are t o techniques briefly ritten belo > 5+ ()O-?$D%$ 3AS$D (nowledge of conteHt (nowledge of concept 0se of dictionaries/ thesa#r#s/ -ord)et etc+ $Hample! a8ConteHt based 6Syntactic constraints8 )ctual meaning of the ord is defined by understanding the conte"t. E"ample( a) In conte"t P dinner, MpitcherM means Mcontainer of liquidM b) In conte"t P baseball, MpitcherM means Mthro er of ball.M b8Selectional restrictions 6Semantic constraints8 %ule> 'oncept ) can only combine ith concept . in mode T if ) or . have specified features. E"ample( a) MThe bat ate its dinner.M The sub+ect of MateM is generally animate. Therefore MbatM means Mflying mammalM not M ooden club.M b) MThe sic! bat lay on the ground.M The ad+ective Msic!M generally modifies animate ob+ects. 8ence MbatM P flying mammal.
<==

c)MThe bro!en bat lay on the ground.M The ad+ective Mbro!enM generally modifies inanimate ob+ects. 8ence MbatM is a ooden club. e) MThe horse ran up the hill. It as very steep.M vs. MIt soon got tired.M M2teepM applies to surfaces, hence MitM P hill. MTiredM applies to animate ob+ectsN hence MitM P horse. >+ MAC"&)$ ?$A )&)% A?%O &T"M It is based upon multiple algorithms hich defines rules or corpa as !no ledge based on the basis of any training data. Then that rules apply on the test data to disambiguate the ord senses. There are t o types of machine learning algorithms. a8S0P$ @&S$D /ecision Trees 6agve .ayes .ayes 6ets 2upport 7ector $achines (27$s) 6eural net or! b80)S0P$ @&S$D 'lustering approach CO)C?0S&O) The above literature survey concludes that )mbiguity is a crucial problem for natural language understanding and processing and there are variety of ambiguities andnumber of ays to remove ambiguity in a language .$achine learning algorithms of various forms such as classification algorithms and clustering algorithms are performed on ambiguous dataset and then it ma!e rule based corpa as a training set and that model is applied on the test set and hence in this ay ambiguity is resolve in the test set. $,$ $)C$S 1. http>&& .scism.lsbu.ac.u!&inmand &tutorials&nlp&ambiguity&ambiguity.html 2. )mbiguity 9irst published $on $ay 1C, 2?11, E2tanford Encyclopedia of *hilosophyF. <. #mar )l(8arbi , 2haidah-usoh, and 6orita$d6or a i,F ;e"ical /isambiguation in 6atural ;anguage :uestions (6;:s)F, I-'2I International -ournal of 'omputer 2cience Issues, 7ol. A, Issue @, 6o 2, -uly 2?11 I226 (#nline)> 1C=@(?A1@, .I-'2I.org. @. 0oodley *ac!ard,F-oint )mbiguity $odeling in 6;*F, $arch 21, 2?11. D. 6eetu 2harma, 2amit 5umar, /r. 2. 6iran+an, E4sing $achine ;earning )lgorithms for 0ord 2ense /isambiguation> ) .rief 2urveyF,International -ournal of 'omputer Technology and Electronics Engineering (I-'TEE)7olume 2, Issue 1, $arch 2B, 2?12.

@??

D$ &@AT&@$! T AD&)% , AM$-O (/ &TS C"A??$)%$S A)D % O-T" P OSP$CT&@$ &sha Mehra Swami Satyanand College of Mgt & Tech/ Amritsar ishamehra<G1yahoomail+com Dr+ "+P+%#pta Swami Satyanand College of Mgt & Tech/ Amritsar Dr+ 3h#shan ( Sharma %%DSD College/ Chandigarh. A3ST ACT /erivatives are considered as innovative tool hich formulate underlying value of assets. The introduction of derivative instruments is come out ith a great success. The ris! manageable phenomena of derivatives are the base behind its popularity. Its products hether it is for ard, future, options and s aps sho ed its noticeable place in the capital mar!et. The gro th rate of derivative defines its ell manageable present scenario and an efficient future prospective. 2imilarly, this paper includes the study of regulatory frame or! regarding derivative mar!et and its trading mechanism. This paper also highlights the challenges faced by derivative mar!et in India and also considers the po er of derivative in relation to economic development. ($4-O DS R /erivatives, 7olatility, 9inancial Instruments, 'ommodity, 2toc! E"change etc. &)T OD0CT&O) /erivative mar!et is consider as most profitable mar!et these days because of its nature here commodities can easily be converted into cash in the future mar!et, ithout assessing that the under laying asset is an metals, agriculture product or rupee value etc. There are broadly four types of derivative instruments such as 9utures, #ptions and 9or ard 3 2 aps. The scenario of derivative mar!et in India has reached to multi(trillion dollar level and ith the passage of time it is increasing li!e anything. Its ability of transfer the ris! ith the advantage of loc!ing in assets prices, derivatives are earning popularity among individual and corporate investors. 0ith the introduction of economic reforms in 1==1, ma"imum push has been made to increase the investorsG confidence by generating the trading process more usersG friendly. 'urrent era is considered to be a %is! $anagement Era. 4nder hich derivatives are framed as emerging tool of stoc! mar!et ./erivatives are those instruments hich are not having value of its o n. The history of derivatives is related ith the mechanism here the value of one underlying asset is derived from other asset. The underlying asset may be of any types from the above t o i.e. 9inancial or non(financial. /erivatives are lying in the first place. These instruments are having po er to redistribute the ris! that an individual and corporate investor faces. Thus also add as an important component in the investorGs portfolio. The unbalanced phase of equity mar!ets over the years has resulted in efficient use of equity derivatives. The percentage of the e"change
@?1

traded in equity futures and options have seen a significant gro th. This unbeaten gro th and development by the mar!et participants has resulted in inflo s of capital and also protect the investors from hedging. /erivatives are the financial instruments, hich derive their value from some other financial instruments, called the underlying. It does not formulate any physical e"istence but comes out of a contract bet een t o parties. It does not have any value of its o n but is depends on the value of other physical assets hich are called underlying assets. The underlying assets may be any of the above shares, debentures, tangible commodities, currencies or short term or long term financial securities etc. Therefore the base of all derivatives mar!et is the underlying mar!et, hich could be spot mar!et for gold, or it could be a pure number such as the level of the holesale price inde" of a mar!et price. 0ith the help of derivative mar!et the real and potential participants can e"posure and speculate the movement of underlying variables and on the other hand find the opportunity here the arbitrage gain profit from mispricing of various products bet een different conditions lying in different mar!ets. The most important advantage of this mar!et is that it allo s highly leveraged position to an investor at lo transaction cost and also helps the investor to get innovative and fle"ible payoffs (profits) by ad+usting in different derivative Instruments. )s per the information published in 62E 9act boo! (2??A that 62E is on the ninth position orld derivative e"change mar!et, second in term of contracts traded in single stoc! future and third largest under contracts traded in inde" future category. Its average daily turnover is five times more than the cash mar!et turnover i.e.%s.D21D< crore in the year 2??B(?A. India has successfully launched stoc! futures hich is contributing almost D?I of average daily 9and# segment turnover on 6ational 2toc! E"change. Participants in the derivative mar*et There are three broad categories of participants under derivative mar!et. They are 8edgers, 2peculators and )rbitrageurs. ) 8edger is a one ho enters in the derivative mar!et to reduce its ris!. In India, most derivatives investors consider themselves as hedgers (9itch %ating, 2??@) Indian la s broadly consider derivative as a hedging instrument. 2peculators are !no n as short term investors ho invest not for reducing ris! but only for earning short term profits. They are the one ho !eep the spirit of the mar!et going because they are also ready to bear ris!. They are attracted to high leveraged and liquidity position and lo impact and transaction cost. the ne"t participant in the derivative mar!et, buy and sell derivatives to boo! the profit and not to reduce their ris!. 9uture and options both add to the potential gain and losses of the speculative venture. The third participant , )rbitrageur are one ho are not in the favor of ta!ing ris! that is the reason they simultaneously buying from one mar!et and selling it to another mar!et. )rbitrageur al ays loo!s out for such price differences. )rbitrageur fetch enormous liquidity to the products hich are e"change traded. )ccording to $urti2???,Fall the three players are the sole of the derivative mar!etN they !eep the competition going and help to enhance the healthy fund and liquidity in the mar!et.
@?2

$@&$- O, ?&T$ AT0 $ The critics of the derivative mar!et called it as a mar!et for speculators. ;ittle cash is involved in this mar!et hich is the main reason of its ris!y nature. Thus, it is argued that the contributors of speculative traders in systems, hich allo high degrees of leverage, lo er the quality of information in the mar!et. These uninformed traders could play a destabili1ing role in cash mar!ets ('hatrath, %amchander and 2ong, 1==D). The debate about speculators and the impact of futures on spot price volatility suggests that increased volatility is undesirable. This is, ho ever, misleading as it fails to recogni1e the lin! bet een the information and the volatility ()ntoniou and 8olmes, 1==D). 'o" (1=BC) asserts that the introduction of derivatives mar!ets causes a stabili1ing influence on the underlying mar!et because of the speed at hich information is incorporated into the prices as ell as the amount of information reflected in e"pected prices. This event ould be mainly because derivative mar!ets attract an additional set of traders to the mar!et and because these mar!ets, hich have lo er transaction costs, transmit the ne information to the spot mar!et more quic!ly. It provides circumstances, hich are more favorable to entering the financial mar!ets, and therefore the distribution of the ris! is improved. 6abar and *ar! (1==@) say that the information that options supply about the future strategies of the investors is better than that offered by combinations of assets, so, if the derivatives assets e"ist the volatility ould have to be smaller. )yuso and 6ue1 (1==D) argue that the transference of the ris! to the derivative mar!ets could improve, to a substantial e"tent, the transactions of the spot mar!et. This is because it is not necessary to include a ris! premium in the spot mar!et to compensate the fluctuations of the prices. $S$A C" M$T"ODO?O%4 This present paper has been designed to measure the role of derivative mar!et in the economic development of India. 2imilarly , it include the precise study of different conditions, hich every stoc! e"change of India has to follo for or!ing on the derivative mar!et and it also clarify that ho the derivative mar!et is differs from the cash mar!et. The literature related ith the topic has been ta!en from the articles published in various +ournals and from Internet. ) conceptual analysis is used to e"plain the various relevant points as required to fulfill the ob+ectives of the study. O3.$CT&@$S O, T"$ ST0D4 The ob+ectives of study are as follo > 1. To study the regulatory frame or! follo ed by the stoc! e"change of India to operate on the derivative mar!et 2. To determine the trading $echanism of the derivative mar!et in India. <. To analy1e the 'hallenges of derivative mar!et in India. @. To study the various economic 'ontributions by derivative mar!et in India. $%0?ATO 4 , AM$-O (
@?<

)s per the 2ecurity E"change )ct, by considering the constraints in infrastructure facilities the e"isting stoc! e"changes are permitted to trade derivatives sub+ect to the follo ing conditions> #nline screen based trading system should be applicable for trading. )n sovereign clearing corporation should perform all the clearing transactions of derivative mar!et The e"change should have the sufficient online system to detect mar!et manipulations through the proper monitoring of positions form the price and volume in real time. *osition limits should be used for enhance the mar!et standard. )ll the stoc! e"change should display the information regarding traded quantities and price on at least t o information ending net or!s hich are easily accessible to the investors in the country. The minimum limit regarding the number of members to start the derivative trading on any stoc! e"change is D?. The derivatives trading should be operated segment ise and separate membership is required for each segment specifically. ) separate governing council for the derivative mar!et should be formed on each stoc! e"change. The proportionate of trading&clearing memberGs representation should be @?I of the total members of the governing council. The chairman of the governing councils ill be nominated from the e"isting members of governing council of the derivative divisions&mar!et. T AD&)% M$C"A)&SM Trading system under 6ational 2toc! E"change for derivatives products are better !no n as 6E)T(93# (6ational 2toc! E"change 9uture 3 #ption $ar!et) that is fully automated screen( based trading. There is great fle"ibility for the investors regarding placement of orders. There are various facilities available on the stoc! e"change terminalN such as immediate placement and cancellation of the orders, stop loss, limit creation and gathering information regarding the price prevailing in the mar!et can easily be assessed during building an order. The trading in derivative mar!et is as simple as trading in other stoc! mar!et instruments. There are basically four entities required for derivative trading that are trading members, clearing members, professional clearing members and participants. Trading members are registered under 6ational 2toc! E"change and assigned an I/ (Identification) for their or!ing. They can access on their o n I/ and also trade on behalf of their clients. #n the other hand clearing members are or!ing under the supervision of 62''; (6ational 2ecurities 'learing 'orporation ;imited). They are also consider as clearing members and can clear trade for themselves and others. *rofessional clearing members are basically professional institutions such as ban!s ho or! as custodies hich clear and settle the trade for their members. In this derivative trading mechanism last root is participants ho are li!e

@?@

financial institutions. They can easily trade through multiple trading members but settlement is done under the roof of single clearing member. C"A??$)%$S O, D$ &@AT&@$ MA ($T /erivative mar!et has sho n a great potential in the last fe years, but the real issues are yet not been resolved. Instruments traded under derivative mar!et and its volume of trade is also increasing day by day, but the main ob+ective .i.e. 2etting up of different e"changes yet not achieved .#n the other hand future prospects of derivative mar!ets are not sound because of the unresolved issues and they are framed as big challenges in the ay. Cash vs Physical Settlement> The percentage of physical settlement under commodity derivatives is very less because of the 9or ard 'ontract )ct, 1=D2. In this )ct, cash settlement of outstanding contracts at maturity is disallo ed. In other ords, all outstanding contracts at maturity should be settled in physical delivery. To overcome this huddle participants settle their positions before maturity. This )ct, needs to be ad+usted hich is a big challenge in front of derivative mar!et. &ss#e for mar*et Stability and Development> %egulators and 2upervisory bodies are having an eye on the counter derivative mar!et due to its rapid gro th. 2ome #T' (#ver the 'ounter) derivatives are ta!en as stress relievers in the tough time of global crisis. .ut the big challenge is to overcome the assumption of the critics that this mar!et is less transparent, ea!er capital requirement and systematic ris!. The -areho#sing and Standardi'ation! Effective and Efficient arehousing system is necessary for smooth or!ing of 'ommodity derivative mar!et in the country. ) ell standardi1ed labs and quality testing centers for the ultimate buyer ho ta!es the physical delivery are in deficiency hich is a big challenge in front of the derivative mar!et. ?ac* of $conomics of Scale! /erivative mar!et is still to achieve the stage of Economic of 2cale. 6o matter there is number of commodity e"changes under hich A? commodities are traded, but in reality only fe commodities are popular. Indian ,overnment having the intention to integrate t o mar!ets .0hich ill reduce the effort and increase the competitive spirit and also increase the coordination among various regulating authorities such as %eserve .an! of India, 9or ard $ar!et 'ommission, 2ecurities and E"change .oard of India and the /epartment of 'ompanies affairs of etc. The eg#latory! /erivative mar!et requires a setting up of a regulatory system li!e security mar!et hich is regulated by 2ecurity E"change .oard of India hich is an independent body. #n other side derivative is controlled by 9$' (9or ard $ar!et 'ommission) hich depends upon the funds of /epartment of 'onsumer )ffairs for the development of this mar!et a sole
@?D

po ered body is required. .oth the regulatory authoritiesG i.e.2E.I and 9$' are also required to or! closely for better results Competition of OTC derivatives with the $Hchange traded derivatives! )fter financial crisis it is advisable to transform #T' derivatives into E"change trade derivative. )dvisors are having the vie that this ill increase the transparency, liquidity and on the other side clearing and settlement procedure is better. )ll the above advices are based on the assumption that the e"isting method of trading in #T' products is all based on telephone trading and there is no clearing system in place. Strengthening the Centrali'ed Clearing Parties! ''I;, hich started functioning in 2??2, is the only centrali1ed clearing party for great processing and settlement services in India. It currently provides a guaranteed settlement facility for ,overnment 2ecurity trading, 'learing of 'ollaterali1ed .orro ing and ;ending #bligation ('.;#), guaranteed settlement of foreign e"change trading and settlement of all Indian %evenue 2ervice(I%2). Though the concentration of business relating to money, securities and fore" mar!et ith the ''I; helps in pooling ris! and reducing the overall transactions cost for the system, the 'ertified 9inancial 2ervices )uditorGs ('92)) report opinion that the concentration of such a ide spectrum of activities leads to concentration of ris! in one entity. Therefore, there is a need to strengthen more and more clearing parties. )ew derivative prod#cts for Credit is* Transfer 6C T8! 'redit ris! transfer in broad since (including guarantees, loans syndication and securiti1ation) has a long history. 8o ever there has been a sustained and rapid gro th of ne and innovative forms of '%T associated ith credit derivatives. The most common credit derivatives are 'redit /efault 2 aps ('/2) on single corporate entity and collateri1ed debt obligation. #nce 2??D, '%T activity became significant for t o additional underlying asset classes(asset bac!ed securities and leveraged loans. Internationally, ban!s and financial institutions are able to protect themselves from credit derivatives ere not allo ed in India until recently. The %.I has made an announcement in its second(quarter monetary policy2??=(1? that it has considered it appropriate to proceed ith caution on this issue. To start ith 1st /ecember, 2?11, %.I has introduced guidelines for a basic, over(the(counter, single name '/2 for corporate bonds for residents entities, sub+ects to safeguards. $CO)OM&C CO)T &30T&O) O, D$ &@AT&@$ MA ($T &) &)D&A )s emerging gro th of derivative mar!et in India, it has been proved that the derivative mar!et is also performing the various economic functions that are> /erivative mar!et reflects the price perception of the mar!et participants about the future This may lead to the discovery of current and future prices in the ell organi1ed mar!et.

@?C

/erivative mar!et is a ell organi1ed mar!et here the ris! is ell distributed among the investors that can easily appetite by them. /erivatives are derived from the underlying value of assets due to that quality more and more players are trading in high volume. /erivative has a tradition of influencing educated class ith its clear and broad prospective. This all ill help the economy to develop and create ne employment opportunities, ne business.

CO)C?0S&O) /erivative mar!et is considered as most profitable mar!et these days, hich can redistribute the ris! of the investors. /erivative instruments are gaining popularity and having an e"tremely important place orld ide. The regulatory frame or! as per 2ecurity E"change )ct is sub+ect to certain conditions and the trading mechanism of derivatives at 62E in India is fully automated screen based trading. There are certain challenges hich are faced by derivative, yet it contributes the ma"imum to ards the economic gro th of India. The most important advantage of this mar!et is that it allo s the investor to follo highly leveraged position to an investor at lo transaction cost and also helps the investor to get innovative and fle"ible payoffs (profits) by ad+usting in different derivative Instruments. $,$ $)C$S 1. *o ers $ - (1=B?)> E/oes 9utures Trading %educe *rice 9luctuations in the 'ash $ar!etsOF )merican Economic %evie , C?, @C?(@. 2. 'o", ' ' (1=BC)> E9utures Trading and $ar!et InformationF -ournal of *olitical Economy, A@, 121D(<B. A <. 9igle s!i, 2tephen(1=A1)> E9utures Trading and 7olatility in the ,6$) $ar!etF -ournal of 9inance, <C, pp@@D(A@. @. Engle, %. (1=A2), E)utorregressive 'onditional 8eteros!edasticity ith Estimates of 4nited 5ingdom InflationF, Econometrica, D?, =AB(1??A. D. 2ch ar1 T 7 and 9 ;aatsch (1==1)> E/ynamic Efficiency and *rice ;eadership in 2toc! Inde" 'ash and 9utures $ar!etsF, -ournal of 9utures $ar!ets, 11, CC=(A<. C. )ntoniou ). and 9oster ).-. (1==2) EThe effect of futures trading on spot price volatility> evidence for brent crude oil using ,)%'8F -ournal of .usiness 9inance 3 )ccounting, 1=(@), pp @B<(@@ B. 6abar *.,. and *ar! 2.H. (1==@) E#ptions trading and stoc! price volatilityF 9inance vol, 1D, 1, DD(BB. A. 5umar, %aman, )tulya 2arin and 5uldeep 2hastri (1==D)> EThe Impact of the ;isting of Inde" #ptions on the 4nderlying 2toc!sF *acific(.asin 9inance -ournal, <, <?<(<1B. =. )ntoniou ). and 8olmes *. (1==D) M9utures trading, information and spot price volatility> evidence for the 9T2E(1?? 2toc! inde" futures contract using ,)%'8M-ournal of .an!ing 3 9inance, 1=,pp 11B(12=.
@?B

1?. 'hatrath, )r+un, 2an+ay %amchander and 9ran! 2ong (1==D)> E/oes #ptions Trading ;ead to ,reater 'ash $ar!et 7olatilityOF -ournal of 9utures $ar!ets, 1D (B), BAD(A?<. 11. )yuso -. and 6ue1 2. (1==D) M/esestabili1an los activos derivados el mercado al contadoO> la e"periencia espaola en el mercado de deuda pblicaM $oneda y 'rkdito,2??,pp 1C=(2?. 12. *ericli, ). and ,. 5outmos (1==B)> EInde" 9utures and #ptions and 2toc! $ar!et 7olatilityF -ournal of 9utures $ar!ets, 1B(A), pp =DB(=B@. 1<. *i11i, $., ). )ndre , -. Economopoulos and 8. #G6eill (1==A)> E)n E"amination of the %elationship bet een 2toc! Inde" 'ash and 9utures $ar!ets> ) 'ointegration )pproachF -ournal of 9utures $ar!ets, 1A, 2=B(<?D. 1@. %a+u $ T and 5 5arande (2??<)> E*rice /iscovery and 7oltatility on 62E 9utures $ar!etF 2E.I .ulletin, 1(<), D(1D. 1D. 2henbagaraman * (2??<)> E/o 9utures and #ptions Trading increase 2toc! $ar!et 7olatilityOF 62E %esearch Initiative, *aper no. 2?. 1C. 2tein - ' (1=AB)> EInformation E"ternalities and 0elfare %educing 2peculationF -ournal of *olitical Economy, =D, pp112<(@D. 1B. -oshipura.$ (2?1?),FIs an Introduction of /erivatives Trading 'ause( Increased 7olatilityOG,Indian -ournal #f 9inance,7ol(@) 6o(2),pp<(B. 1A. 5othi al % and ,oyal )(2?12),F%evie of Trading&$ar!eting 2trategies of 9utures and #ptions in IndiaF,)sian -ournal of %esearch in 2ocial 2cience3 8umanities,7o2 Issue@, I226 22@= B<1D. 1=. ,a!har 5amlesh,$eetu (2?1<),F/erivative $ar!et In India> Evolution, Trading $echanismand 9uture *rospectsF, International -ournal of $ar!eting,9inancial 2ervices3 $anagement %esearch.7ol.2, 6o<.pp<A(D?.

@?A

COMP0T$

$S$ @AT&O) S4ST$M! A %?O3A? P$ SP$CT&@$

Pallavi Marwaha Swami Satyanand College of Management and Technology/ Amritsar marwaha+pallavi1gmail+com Tejinder -alia Swami Satyanand College of Management and Technology/ Amritsar twjairaj#1gmail+com A3ST ACT The concept of '%2 i.e. 'omputer %eservation 2ystem came into being in 1=C?s. this technology is around five decades old and being upgraded ith the passage of time. It is only one of its !inds to act as an portal for online transactions globally. It offers high level of reliability to its users. Each '%2 soft are is capable of providing information on national as ell as international airlines. The functioning of each '%2 soft are is quite similar and offers same ease of operation. The main reasons for '%2 being preferred over eb portals are speed, convenience, accessibility and reliability. &)T OD0CT&O) ) computeri1ed %eservation 2ystem is a comple" database that provides information about many travel options, including airline flights, car rentals and hotel, motel and resort rentals. J1K In the beginning '%2 as created, o ned and operated by )viation industry only. It as first used by )merican )irlines in 1=@C. The basic function of '%2s is to transfer information for logistic functions. This system is a storehouse of essential data for disseminating latest information to the service providers and it has the required infrastructure for the same. 'omputing provided the technological advance that laid the foundation for the ne"t stage of airline distribution. 9alling telephony costs, consumer demand for a faster service and the development of ne computer systems paved the ay for the introduction of '%2s in the 1=B?s follo ed a decade later by ,/2s. These developments revolutioni1ed airline distribution systems, enabling travel agents to chec! prices, seat availability and airline schedules from their des!top. 'lients ere offered options allo ing them to ma!e confirmed boo!ings at the time of first inquiry. J2K

@?=

,ig#re &! Comp#ter eservation System Ownership 9B= So#rce! The $vol#tion of the Airline &nd#stry by Steven Morrison/ Clifford -inston In the contemporary era, all the ma+or po erful net or!s are harnessed mainly for this purpose. Today all the necessary information is being provided for the global travel industry. 'onsumers, in the competitive orld not only gather information on boo!ing and travel systems but also get information related to additional services li!e trade sho s, events and visa regulations. All global C Ss offer the following f#nctionalities! i+ Prod#ct Presentation 7arious '%2s soft ares li!e )madeus, ,alileo, 2abre, 0orld 2pan state the arrival departure time, the route, the fare etc. eservation It includes *6% *assenger 6ame %ecord or ,6% ,uest 6ame %ecord. ,are K#ote & Tic*eting The fares are calculated according to the reservation category and the customer needs. Additional Services Invoicing, customer quota, trade sho s and business events

ii+ iii+

iv+

@1?

,ig#re &&! Principal str#ct#re of C Ss 9D= The rapidity of continuous development in reservation system is brought by the ne media and information technology and this has motivated the modern day tourism enterprises to incorporate ne technologies in their management systems so as to bring about efficiency in their or!ing ith lesser human resources. %eservation systems can be biased in t o ays. In the first type, display bias, the hostLs flights are listed more prominently than those of other carriers, usually at the top of the computer screen. This practice as outla ed by the 'ivil )eronautics .oard in 1=A@. The second type, architectural bias, often ma!es it easier for travel agents to obtain information about the hostLs flights than about othersL flights. 9or e"ample the system might require fe er !eystro!es to get information about the hostLs flights or might provide more up(to(date information about the hostLs fares and seat availability. JDK In the mid 1=A?s, '%2 developed into global distribution system offering a ide range of tourism products. S,/2s are the logical e"tension of '%2s and allo agents to access a range of non(airline travel services such as hotels, car(hire, coach tours and attractions. In a sense, a ,/2 provides the travel agent ith a Lone(stop(shopL for most travel products and has become an essential component of the distribution system. .ultalis (1==A) described the role of ,/2s as hori1ontally integrating airlines and vertically integrating all other tourism suppliers in a system that can be described as the circulation system of the travel industry. .y 1==D the coverage of ,/2s had e"panded to such an e"tent that they could be termed L,lobal travel and tourism information and reservation systemsL (#L'onnor, 1===). )lthough '%2s and later ,/2s provided airline managers ith a po erful tool to identify ne mar!et segments and ma"imi1e yields, the use of ,/2 companies added to overall distribution
@11

costs. ,/2 companies provided services for a fee that had to be paid by the airline ta!ing the boo!ing. 0here the ,/2 distribution company as o ned by the airline providing the service (for e"ample, )merican )irlines o ned 2abre and 4nited o ned )pollo) this fee could be absorbed but here the service as provided by another ,/2 company the airline could not afford to refuse to pay the boo!ing fee unless the company as prepared to forego potential revenue through lost boo!ings (*ic!rell, 1==1). CO)C?0S&O) C S soft ares are yet not user friendly. 2till a lot of frequent changes are required in the '%2 operating system. '%2 has been replaced by ,/2 that enables clients to compare, and access information about all travel services, leisure and other tourism related information from various tourism service providers. It is an integrated information system and communication channel, that is the most cost effective tool for buyers of businesses travels to manage the comple"ity of supply. It is much more than +ust reservation tool hich integrates core business processes of tourism businesses, and therefore, increase the productivity, speed and performance. $,$ $)C$S 1. 0elcome to 8ospitality> )n Introduction .y 5aye (5ye(2ung) 'hon, Thomas $aier 2. Tourism /istribution 'hannels> *ractices, Issues and Transformations edited by /imitrios .uhalis, Eric ;a s <. 9igure I> 'omputer %eservation 2ystem # nership 2ource> The Evolution of the )irline Industry .y 2teven $orrison, 'lifford 0inston @. 9igure II> *rincipal structure of '%2s 2ource> The %ole of ,lobal 'omputer %eservation 2ystems in the Travel Industry Today and in the 9uture by /r. )"el 2chul1, ;ufthansa 2ystems D. 'omputer %eservation 2ystems> )ction 6eeded to .etter $onitor the '%2 Industry and Eliminate '%2 biases by /I)6E *ublishing 'ompany

@12

D$@$?OP&)% A COOP$ AT&@$ &)T 0S&O) D$T$CT&O) S4ST$M ,O -& $?$SS S$)SO )$T-O (S %#rpreet (a#r Assistant Professor/Trai shatabdi %+%+S+(halsa College/Amritsar+ rabia2>52>>1yahoo+co+in A3ST ACT 0ireless sensor net or!s (026s) are quic!ly gaining popularity because they are potentially lo (cost solutions that can be used in a variety of application areas. 8o ever, they are highly susceptible to attac!s and it is very probable that an intruder catches already e"isting security measures out. This paper deals ith intrusion detection systems for 026s and ho it is used in the )0I22E6ET pro+ect. 5+ -& $?$SS S$)SO )$T-O (S A)D S$C0 &T4 5+5 &ntrod#ction )n ad(hoc ireless sensor net or! (026) is a net or! made of a large number of simple and lo (cost devices called sensor nodes hich are monitoring physical or environmental conditions li!e temperature, sound, pressure, etc using the ad hoc ireless multi(hop media to communicate these measurements to a base station. This cheap and efficient solution can be used in many military and civilian application areas including emergency response, homeland security and environmental monitoring. The open and distributed nature of the net or!, as ell as the limited resources of the nodes ma!es 026s highly vulnerable to attac!s. Intrusion detection systems (I/2) act as a second line of defence hen an intruder might deceive the other security solutions. In this paper, i e"plain the approach that is follo ed to develop the )0I22E6ET 1 distributed I/2. 5+> Attac*ers %oals and Sec#rity eA#irements The attac!er goals regarding 026s can be multipleN depending on ho easy it is for him to launch an attac!, and the !ind of damages he ants to inflict to the net or!. $oreover, some attac!s can be seen as early steps to ider attac!s that rely on some prerequisites. )mong them, one can mention overhearing data (especially easy if communications are not or ea!ly encrypted, but can also be used for traffic analysis attac!s 1?), in+ecting fa!e data (in order to fa!e the measurements, or attac! the net or! protocols), reduce the performance of the net or! ( hich already has limited resources), brea!ing parts of the net or! lin!s or damaging the hole net or! operation (usually done via the routing protocol). ) secure 026s should be robust and reliable (the failure of a small set of nodes should not brea! the entire security of the net or!), but also ensure data authenticity, integrity, confidentiality and freshness.

@1<

5+B Sec#ring -ireless Sensor )etwor*s They are t o main approaches for securing a 026> adapt the e"isting protocols to counter the possible attac!s, or use e"isting security frame or!s that provide security functions. 2ecuring e"isting protocols usually means less integration or!, but you need to consider the security of each protocol your net or! relies on in order to achieve the global security of the net or!. The secured version of the )#/7 protocol (2)#/7, 1@) is an e"ample of such an approach. 2ecurity frame or!s aim at providing a generic security pac!age that covers the basic security needs for 026s and can be integrated into sensor net or! applications. The protocols must be adapted to use these frame or!s. Tiny2ec 11, Tig.ee 12 or $ini2ec 1< en+oy significant attention in the community. )s presented in the introduction, the open and distributed nature of communications of 026s ma!es it impossible to concentrate all security functions in a central point, so that each node of the net or! needs to e"ecute several security functions. 'ombined ith the limited resources of sensor nodes, this requires to carefully considering the cost of the security mechanisms that are deployed. )s a consequence, it is very probable that a node gets compromised or a fa!e node forged at some point. Intrusion /etection 2ystems for 026s act as a second line of defence. Their role is to detect attac!s before they are successful and compromise the security of the net or!, and to e"pel intruders and compromised nodes from the net or!. >+ &)T 0S&O) D$T$CT&O) ,O -S)S >+5 Specificities and Challenges I/2 for sensor net or!s differ in many ays from the one used in legacy net or!s. The challenges that I/2 have to ta!e up in the particular field of 026s include> u A#tomated decision? nodes must be truly autonomous and adapt to the evolution of the net or! and environment. u ?imited reso#rces? security functions must ta!e into account the scarce band idth, memory, energy and computational po er. u ?ocali'e a#diting? a node can only see hat is happening in its immediate neighborhood. u )o node is tr#stworthy? nodes can be quite easily compromised, and should not be trusted. u Distrib#ted &DS! intrusion detection must happen on several nodes in order to detect distributed attac!s. u Sec#rity of the &DS itself! malicious nodes should not be able to deceive the I/2. >+> )etwor* Architect#re 4sual I/2 are typically stand(alone I/2, here each node runs an independent intrusion detector. This is particularly true for net or!(based intrusion detection systems, hich often consist in a po erful server that has access to the hole traffic (9igure D). 2uch systems cannot perform satisfyingly in 026s, since local audit data are not enough to have a good comprehension of hat is happening in the net or!. 'ooperation bet een the different nodes is needed in order to achieve efficient detection.
@1@

"ierarchical &DS are systems here specific nodes are in charge of monitoring their neighbours, ith various level of cooperation bet een cluster heads, as presented in 2. They are particularly suited for multi(layered net or! architectures. Distrib#ted &DS meet the decentrali1ed nature of ad(hoc ireless sensor net or!s, here each node is responsible for collecting local audit data, and share this !no ledge globally in order to carry out a global intrusion detection system <, @. Mobile Agent 3ased &DS use pieces of mobile code charged ith a specific mission and sent to other nodes in order to analyse the local audit data of other nodes and bring bac! the results to the originator @, or to run a specific attac! detection on a node for distributing the detection tas!s amongst the net or! C. The )0I22E6ET architecture is a hybrid one bet een the hierarchical and the distributed approach. The net or! is partitioned into several multi(hop clusters. Inside each cluster, and at the global level bet een cluster heads, i use a distributed architecture. The intrusions detections and assumptions, and the other I/2 messages are e"changed inside a cluster, and the cluster members cooperatively ta!e the decisions. The cluster head is then responsible for iterating the same process at the global net or! level. This approach enables more scalability, since having a completely distributed I/2 ould flood the net or! hen they are too many nodes. It also minimi1es the dra bac!s of the hierarchical architectures by introducing a high cooperation bet een the nodes.

,ig#re C The left fig#re represents a typical &DS #se in a classical infrastr#ct#re networ*+ The right one ill#strates the networ* of the A-&SS$)$T distrib#ted &DS+ %ray nodes are &DS agents/ circled ones are cl#ster heads+ >+B Collecting A#dit Data )udit data are collected by local agents analysing local sources of information, hich can be hard are or net or! based. The )0I22E6ET pro+ects concentrates on the second one.8ard are audit data include anti(tamper mechanisms, detect hen a node is being
@1D

reprogrammed or atch for abnormal sensor values, li!e accelerometer.8o ever, using the vulnerabilities of soft are (and especially the routing protocol) is often a simpler and easier ay for an attac!er to brea! into the net or!. Thus, the role of the distributed I/2 is to analy1e the overheard traffic and loo! for suspicious behaviours. /ue to the ad(hoc nature of the net or!, a single node has only a partial !no ledge of hat is happening. 8o ever, they can still analy1e the pac!ets that are directly sent to them or e"changed bet een their neighbours, thus acting as Espontaneous atchdogsF. $etrics can then be gathered about badly for arded pac!ets, or nodes flooding the net or! ith route replies B, or even more comple" behaviours.

,ig#re G $Hample of a spontaneo#s watchdog! node D can watch if 3 is correctly forwarding messages from A to C >+D &ntr#sion Detection I/2 need to distinguish bet een normal and abnormal activities in order to detect attac!s against the net or! before they are successful. /etection techniques are usually classified into three categories. u Mis#se detection (also !no n as signature(based detection) consists in comparing audit data ith !no n attac! patterns. This technique is the one mainly used for classical I/2, but is not idely suitable for 026s, due to memory and processing po er constraints. It also suffers from a lac! of fle"ibility and is useless against previously un!no n attac!s. u Anomaly detection systems describe the LnormalL behaviour of the net or! and detect any activity that differs significantly from it, and are thus potentially capable of detecting ne attac!s. The normal behaviour is usually established via automated training A. u Specification7based detection is similar to anomaly detection, but the correct behaviour of the net or! is manually defined. It allo s a smaller rate of false alarms, but is less fle"ible ith regards to the different environments. /epending on the conte"t (for e"ample hich routing protocol is used, or the services deployed in the net or!) and the capabilities of the heterogeneous nodes, different intrusion detection algorithms can be used in order to offer the best ratio bet een detection efficiency and resources consumption. The )0I22E6ET distributed I/2 proposes a plug(in based architecture in order to enable an easy and fle"ible management of the algorithms running on each node. 2ome
@1C

algorithms from the three !inds of detection techniques aforementioned have been implemented, amongst hich! u 3ad Protocol! )n attac!er una are of the services and protocols used in the net or! might try to launch fa!e nodes ith idely used protocols, ith the hope that the net or! ill understand it. This is the simplest implemented detection algorithm. u 3lac* "ole/ %rey "ole/ Selective ,orwarding! the attac!ers are selectively or randomly dropping some or all pac!ets that they should be for arding. )n alert is raised if the ratio of non(for arded pac!ets by a specific node is big compared ith the overall ratio of the atched nodes (e"perience has sho n that false positives couldnGt be ignored) u &ntegrity attac*! This attac! is launched by a node that selectively or randomly alters the pac!et that he for ards. 4nli!e blac! hole or grey hole attac!s, such events are unli!ely to be caused by the nature of communications. u ,looding attac*! )n alert is raised hen a node is sending specific messages at an unusual rate. u eplay attac*! I/2 messages are chec!ed for detecting nodes trying to replay I/2 e"changes in order to lure the system into e"pelling a legitimate node from the net or!, or !eep a malicious one undetected. It uses the mechanisms e"plained in 2.C. >+C Decision Ma*ing and ecovery #nce a local I/2 agent has raised an alarm internally, the ne"t question that arises is ho is going to ma!e the final decision that a node is truly an intruder or not. Independent /ecision( ma!ing 2ystems are usually used in cluster(based architectures because they leave the decision that a node is effectively an intruder to specific nodes (usually the cluster heads) 2. The alternative solution is called 'ooperative Intrusion /etection 2ystems. 0hen an attac! seems to have been detected, the node appeals to neighbouring nodes in order to output a global decision. The )0I22E6ET I/2 uses its hybrid architecture in order to output a global decision on the status of a node. )lerts raised by the local I/2 agents may be only assumptions that something abnormal is happening, ith inconclusive evidence. ;eaving the decision to a single node ould imply a high rate of false positives and false negatives, because the data collected locally is often not enough to output an appropriate intrusion detection decision. The )0I22E6ET uses an open vote mechanism to output a global decision from the /I/2. #nce a node has raised an alert, a voting mechanism is launched bet een the nodes belonging to the same cluster. The cluster head and a random node are elected as vote authorities, and each node has to send its response to them. The vote authorities gather the votes to output the decision at the cluster level. The voting mechanism is authenticated but not ciphered, so that it allo s the nodes to detect potential intruders trying to lure the I/2. The voting mechanisms are then issued at the net or! level bet een the cluster head to output the global I/2 decision. This decision ( hich can be the identification of an intrusion and & or an intruder, or simply a false alarm) is sent bac! to the nodes by the cluster heads. The intruder is then isolated from the net or! via the routing module, and if needed, cryptographic material is updated.
@1B

>+G Sec#re &DS $Hchanges )s the decisions ta!en by the I/2 can e"pel a node from the net or!, it should be very careful not being compromised, and needs to ensure the integrity of the messages e"changed bet een the nodes and that they are sent by legitimate ones.The )0I22E6ET /I/2 uses timestamps and digests to secure the communications bet een the I/2 agents, hich are inspired by the secure #;2% plug(in A. 2ecret !eys are shared inside each cluster and bet een the cluster heads and used to produce and chec! the digests of the messages. Timestamps are used to determine the freshness of the messages and prevent replay attac!s. In order to securely synchroni1e (or re( synchroni1e if needed) cloc!s bet een t o nodes, an e"change of timestamps is done ith challenge(response messages. )ny message received ith an invalid timestamp or digest is then discarded by the I/2 agent, and an alert is raised. This mechanism has been chosen in order to have reasonably secured messages ithout using too e"pensive cryptographic material. ) . > 'ha /($, 5) . ) > 'hb Tsb /(Idb, 'ha, 5) /($, 5) ) . > Tsa / (Ida, 'hb, 5) /($, 5) ,ig#re ; Timestamp eHchange between nodes A and 3+ Ch is a nonce challenge+ Ts is a timestamp/ D a digest f#nction/ ( the shared *ey and &d the identifiers of the nodes+ B+ $SO0 C$ 0SA%$ A)D &MP?$M$)TAT&O) #ur e"periments have sho n that the sensor motes currently available on the mar!et have very limited resources, so that implementing a distributed intrusion detection system on it can be quite discouraging. .efore being able to ta!e into account the po er consumption, the first challenge is simply to deal ith the lo memory of the nodes. The )0I22E6ET test(bed is mainly composed from motes running on Tiny#s, hich respectively only have @5. and A5. of %)$. )s the pro+ect is also integrating modules for secure geographical routing and secure service discovery, the memory limitation is quic!ly e"ceeded. This implies to carefully choose the amount of audit data that is gathered, thus ma!ing intrusion detection more difficult. The )0I22E6ET I/2 uses several mechanisms in order to reduce its resources usage.The first approach has been to optimi1e the metrics gathering process ith regards to the detection algorithms. The metrics shared by the different plug(ins are only collected and computed once, by using a specific module for managing audit data. I have implemented easy(deployment tools that ta!e yaml configuration files as entries in order to load the program code on the motes. These configuration files define hich algorithms and metrics are computed on hich motes, but also some configuration items that ma!e it possible to have the lo est possible memory used by the algorithms ith regards to net or! characteristics li!e the frequency of messages, density of the nodes, etc. #nly algorithms and metrics gathering processes effectively running on the node are compiled. The follo ing figure sho s the relationship bet een the snooping interface (used to gather audit data), the metrics (used to e"tract interesting data) and the detection algorithms (used to decide hether something abnormal is happening).
@1A

,ig#re F elationship between algorithms and metrics collection )nomaly detection algorithms should be the algorithms of choice, since they use less memory and are still efficient in detecting a ide variety of attac!s. 8o ever, pattern(matching techniques should be used on a per(case basisN they are the most efficient hen targeting specific attac!s against specific protocols, li!e the routing one. )pplying the security measures of classical net or!s to 026s is difficult, not to say impossible. 'ryptographic operations and especially asymmetric cryptography are often very costly and should be avoided as much as possible in sensor net or!s. $oreover, nodes donLt have enough memory to store the public !eys of the other members hen net or!s are built ith hundreds of nodes. The )0I22E6ET I/2 thus uses symmetric !eys and timestamps in order to secure its e"changes.9inally, the )0I22E6ET pro+ect is using lo (cost, lo (po er programmable logic devices ('*;/, 1D) in order to implement the most resource demanding functions (and especially cryptographic ones) on hard are, thus speeding up the algorithms and reducing the po er consumption up to 1 & 1??th of that used by a microcontroller. D+ CO)C?0S&O) )026s impose ne challenges on the design of I/2, hich are especially needed due to the unattended operations in open environments. The net or! o ner cannot simply rely on usual security mechanisms to ensure its security. I propose to implement a fle"ible and efficient intrusion detection system, hich can then be used in a variety of ireless net or! and devices, and easily adapted to the resources available. $,$ $)C$S 1. http>&& .a issenet.eu 2. 5achirs!i, %. ,uba, /. 2ch art1, 2. 2toec!lin, and E. Hilma1> 'ase based agents for pac!et(level intrusion detection in ad hoc net or!s. In *roceedings of the 1Bth

@1=

International 2ymposium on 'omputer and Information 2ciences. '%' *ress, #ctober 2??2, pp.<1D(<2? <. 2tamouli> %eal(time Intrusion /etection for )d 8oc 6et or!s. $aster of 2cience dissertation, 4niversity of /ublin, 2??< @. 5. Ioannis, T. /imitriou, and 9. '. 9reiling> To ards Intrusion /etection in 0ireless 2ensor 6et or!s. 1<th European 0ireless 'onference, *aris, )pril 1==B. D. Intrusion /etection )rchitecture Enhancing Trust .ased )pproaches. In *roceedings of the 1st International 0or!shop on 0ireless Information 2ystems, )pril 2??2. C. H. Thang, 0. ;ee, and H. 8uang> Intrusion /etection Techniques for $obile 0ireless 6et or!s. )'$&5lu er 0ireless 6et or!s -ournal ()'$ 0I6ET), 7ol. =, 6o. D, 2eptember 2??<. B. %. %oman, -. Thou, and -. ;ope1> )pplying Intrusion /etection 2ystems to 0ireless 2ensor 6et or!s. 'onsumer 'ommunications and 6et or!ing 'onference, 2??C, pp. C@?(C@@ A. 7. .huse and ). ,upta> )nomaly intrusion detection in ireless sensor net or!s. -ournal of 8igh 2peed 6et or!s, 7ol. 1D, 6o. 1, pp. <<(D1, 2??C =. 8afslund, ). Tonnesen, %... %otvi!, -. )nderson, and #. 5ure> 2ecure e"tension to the #;2% protocol. 1st #;2% Interop 3 0or!shop, 2an /iego, 2??@ 1?. -. /eng, %. 8an, and 2. $ishra> 'ountermeasures )gainst Traffic )nalysis )ttac!s in 0ireless 2ensor 6et or!s. In *roceedings of the 1st 'onference on 2ecurity and *rivacy for Emerging )reas in 'ommunications 6et or!s, )thens, 2eptember 2??D 11. '. 5arlof, 6. 2astry, and /. 0agner> Tiny2ec, ) lin! layer security architecture for ireless sensor net or!s. In *roceedings of the 2nd )'$ conference on Embedded 6et or!ed 2ensor 2ystems, 6ovember 2??@. 12. Tig.ee )lliance> Tig.ee 2pecification. Technical %eport /ocument ?D<@B@r?C, -une 2??D. 1<. $. ;u!, ,. $e11our, ). *errig, and 7. ,ligor> $ini2ec, ) 2ecure 2ensor 6et or! 'ommunication )rchitecture. In *roceedings of International 'onference on information processing in 2ensor 6et or!s, 'ambridge, )pril 2??B. 1@. $. ,uerrero Tapata and 6. )so!an> 2ecuring )d 8oc %outing *rotocols. In *roceedings of the 2??2 )'$ 0or!shop on 0ireless 2ecurity, pp. 1(1?, 2eptember 2??2. 1D. Vilin"> 'ool%unner(II '*;/ 9amily. *roduct specification, /2?=? (v<.?), $arch 2??B.

@2?

DATA -A $"O0S$ A)D DATA M&)&)% Sonia Sharma Assistant Professor/ %)D0 College Ch#ngh/ Distt! Tarn Taran+ *a#rs#rinder5::<1gmail+com A3ST ACT> /ata 0arehouse provides tools for e"ecutives and business managers to systematically organi1e understand and use their data to ma!e 2trategic decisions. It is a must have latest mar!eting eapon and a ay to !eep customers, by learning more about their needs. /ata 0arehouse is a sub+ect oriented, integrated and time variant volatile data in support of management decision ma!ing process. /ata $ining has been defined as the nontrivial e"traction of implicit, previously un!no n, and potentially useful information from data. It uses machine learning, statistical and visuali1ation techniques to discover and present !no ledge in a form, hich is easily comprehensible to humans. /ata $ining process involves data cleaning, integration, selection, transformation, mining, pattern evaluation and !no ledge presentation. ($4-O DS> /ata 0arehouse *rocess, /ata $ining 'omponents, /ata $ining process, /ata 0arehouse. &)T OD0CT&O) /ata arehouse or enterprise data arehouse (/0, /08, or E/0) is a /ata base used for reporting and data )nalysis It is a central repository of data hich is created by integrating data from one or more disparate sources. /ata arehouses store current as ell as historical data and are used for creating trending reports for senior management reporting such as annual and quarterly comparisons. ) data arehouse constructed from an integrated data source systems does not require ET;, staging databases, or operational data store databases. The integrated data source systems may be considered to be a part of a distributed operational data store layer. /ata federation methods or data virtuali1ation methods may be used to access the distributed integrated source data systems to consolidate and aggregate data directly into the data arehouse database tables. 4nli!e the ET;(based data arehouse, the integrated source data systems and the data arehouse are all integrated since there is no transformation of dimensional or reference data. This integrated data arehouse architecture supports the drill do n from the aggregate data of the data arehouse to the transactional data of the integrated source data systems./ata arehouse *rocess includes as> S#bject7oriented! The data in the data arehouse is organi1ed so that all the data elements relating to the same real( orld event or ob+ect are lin!ed together. )on7volatile! /ata in the data arehouse are never over( ritten or deleted X once committed, the data are static, read(only, and retained for future reporting.
@21

 &ntegrated! The data arehouse contains data from most or all of an organi1ationLs operational systems and these data are made consistent. Time7variant! 9or )n operational system, the stored data contains the current value. The data arehouse, ho ever, contains the history of data values. )o virt#ali'ation! ) data arehouse is a physical repository. /ata 0arehouse is a centrali1ed repository that stores data from multiple information sources and transforms them into a common ,multidimensional data model for efficient querying and analysis1.

DATA M&)&)% It refers to e"tracting or EminingF !no ledge from large amount of data. /ata mining is a process of discovering interesting !no ledge from large amounts of data stored either, in database, data arehouse, or other information repositories. /ata mining soft are is one of a number of analytical tools for analy1ing data. It allo s users to analy1e data from many different dimensions or angles, categori1e it, and summari1e the relationships identified. Technically, data mining is the process of finding correlations or patterns among do1ens of fields in large relational databases.9or e"ample, one $id est grocery chain used the data mining capacity of #racle soft are to analy1e local buying patterns. They discovered that hen men bought diapers on Thursdays and 2aturdays, they also tended to buy beer. 9urther analysis sho ed that these shoppers typically did their ee!ly grocery shopping on 2aturdays. #n Thursdays, ho ever,
@22

they only bought a fe items. The retailer concluded that they purchased the beer to have it available for the upcoming ee!end. The grocery chain could use this ne ly discovered information in various ays to increase revenue. 9or e"ample, they could move the beer display closer to the diaper display. DATA M&)&)% COMPO)$)TS Databases or Data -areho#se> ) set of databases such as data arehouses,spreadsheets and other !inds of information repositories here data cleaning and integration techniques may be employed. Databases or Data -areho#se server> 9etching data based on user request from a data arehouse. (nowledge 3ase> The domain 5no ledge employed for finding interesting patterns. Data Mining $ngine> The functional modules that are used to perform tas!s such as classification, association, cluster analysis etc. Pattern $val#ation Mod#le! Interestingness measures are used to focus search to ards interesting patterns. %raphical 0ser &nterface> This module interface the end user and the data mining system,allo ing users to interact ith the system by specifying a data mining tas! or a query through a graphical user interface. DATA M&)&)% P OC$SS 1. Data Cleaning> The removal of noise and inconsistent data. 2. Data &ntegration> The combination of multiple sources of data. <. Data Selection! The data relevant for analysis is retrieved from the database. @. Data Transformation> The consolidation and transformation of data into forms appropriate for mining e.g. by performing aggregation or summary of data. D. Data Mining! The use of intelligent methods to e"tract patterns of data. C. Pattern $val#ation! Identification of patterns that are interesting. B. (nowledge Presentation! 7isuali1ation and 5no ledge representation techniques are used to present the e"tracted or minied 5no ledge to the end user. C?ASS&,&CAT&O) O, DATA M&)&)% (inds of Database Mined > /atabase systems may themselves be classified into different categories.2o the !ind of database mined may give rise to a categoryof the data mining system. (inds of (nowledge Mined! /ifferent types of mining process such as characteri1ation,discrimination,association,classification,clustering or outlier analysis may produce different types of !no ledge.

@2<

(inds of TechniA#es 0tili'ed > 'ategori1ation of data mining systems may be done according to the underlying data mining techniquesthat they employ. (inds of Applications Adapted> /ata $ining can be also be classified based on the applications they adapt.There may be specific data mining systems for telecommunications,/6),stoc! mar!ets etc2.

CO)C?0S&O) /ata 0arehouse is a centrali1ed repository that stores data from multiple information sources and transforms them into a common, multidimensional data model for efficient querying and analysis and data mining is the process of fining correlations or patterns among do1ens of fields in large relational databases. $,$ $)C$S 1. /ata 0arehouse 9undamentals( ) 'omprehensive ,uide for I.T.*rofessionals by *aulra+ *onniah -ohn 0iley32ons,I6'. 2. /ata $ining Theory,$ethodology,Techniques and )pplications by ,raham -.0illiams,2imeon -.2imoff<@B,2?11

@2@

A ST0D4 O, @$ S&O) CO)T O? TOO?S ,O D&ST &30T$D $)@& O)M$)T &nderdeep (a#r esearch Scholar/%#r# )ana* Dev 0niversity/ Amritsar idmaini1yahoo+in Dr+Parminder(a#r Assistant Professor/%#r# )ana* Dev 0niversity/ Amritsar parminder*a#r1yahoo+com Dr+"ardeep Singh Professor/%#r# )ana* Dev 0niversity/ Amritsar hardeep2gnd#1rediffmail+com

A3ST ACT 7ersion control tools are important for collaborative soft are development. It !eeps the trac! of hat changes are made by each developer and hen the changes have been made. )lso it provides the facility to reverse those changes. In the light of state of art this paper revie s version control tools used in #pen 2ource 2oft are /evelopment. 8o the version control tools have evolved ith the time and hat are the various models follo ed by them, are also covered. It also discusses various benefits provided by distributed version control systems. 5ey ords>#pen source soft are, version control system, repository, branching, merging, patch contributions. 5+ Introduction #pen source soft are development has dra n attention of many researchers in recent years. %eason is that it has given ne direction to soft are engineering methodologies. 0hat ma!es it different from traditional soft are engineering practices is its different licensing model and community driven approach. 9or developing open source soft are there are no regularly paid staff. /evelopers contribute ith their o n ill. This community of developers creates their o n ecosystem hich is highly distributed. 6ot only the individuals participate but companies also participate by ma!ing their employees contribute in open source pro+ectsJ1K. To develop the soft are, this community ma!es use of free soft are tools available. To organi1e the history and current status of soft are some versioning tool is required li!e '72, 2ubversion, ,IT, $ercurial etc. Earlier client server versioning tools ere used but the current trend is to use distributed versioning tools.
@2D

>+ 0hat Is 9&#22O 9ree&#pen 2ource 2oft are, refers to a soft are hich is available ithout any fees or charge. It is developed by distributed teams of programmers and released under a license allo ing inspection, modification and redistribution of the soft areGs source J2K.$ost of the tools used by developers are open source. 9or version management '72, subversion, $ercurial, ,IT and other are used. 9or defect and issue trac!ing .T2(.4, trac!ing system) and bug1illa for .ug/atabases are used. B+ 7ersion 'ontrol 2ystem 2ource code is collection of files. 7ersion management tools allo to trac! changes in each file and past states of soft are pro+ect. It stores various changes to files in different versions. )nd these versions ith hole pro+ect structure are stored in the form of repository. ) good 7ersion 'ontrol 2ystem (7'2) should provide follo ing features> 9iles can be edited to save a ne version and it should be easy to +ump to previous version. It allo s your source code to be updated to latest version and synchroni1e your efforts ith other developers. 7'2 stores ith each file log messages e"plaining the changes happened to the file. 7'2 should allo branching by ma!ing a copy of repository in separate area. )fter modifying in isolation it can be merged ith original codeJ<K. D+ Evolution of 7ersion 'ontrol 2ystems ;iterature revie depicts the evolution of versioning control system started ith local data model. ;ocal data model or!s on single file and could not recogni1e entire directory structureJ<K.Every another revision as stored in the form of interleaved deltas. /ifferent versions of files ere stored in linear order.2''2( 2ource code control system ) as first to use this model .2''2 do not allo branching.2''2 follo ed loc!(modify( rite model.;oc!ing mechanism avoids concurrent versions to be created. This resolves the conflicts automatically. This control system as then follo ed by %'2 (%evisioncontrol system).

9ig1> ;oc!(modify( rite modelJ@K In this method file to be changed is first loc!ed, modified and ritten bac! on the server as ne version. This !ind of model imposes pessimistic concurrency control. Then came the era of versioning systems hich ere based on client server model, hich means developers at different locations, can copy the code from main central code, modify the files and
@2C

again merge the changes ith the main code.If there are conflicts they are indicated by versioning system and resolved by the user by its o n.'72 and subversion(276) are popular soft areGs using this model.

9ig 2> 'opy(modify(mergeJ@K '72 ('oncurrent version system) plays a significant role in coordinating the efforts of various developers. #pen source developers are highly distributed. Efforts of these developers are coordinated in single central repository. This central repository maintains a tree structure. Each single line change by developer can be updated at same time and everybody can see the updated copy. #ne of the !ey features of '72 is that it ta!es burden of integrating all the changes and !eeps trac! of any conflict. 8o it coordinates the efforts of developers is e"plained li!e this. The developer do nloads a or!ing copy (directory tree containing the file that ma!e a pro+ect) from '72. This is also !no n as chec!ing out a or!ing copy. The developer edits freely in its o n or!ing copy. )t the same time other developer might be busy or!ing in their o n or!ing copy. .ecause these all are separate copies so there is no interference. The developer finishes his changes and commits then into '72 along ith a log message, hich is a comment e"plain the nature and purpose of changes. The or!ing copy of other developers gets changed automatically JDK. If t o developers ) and . or!ing on their o n copies ma!e changes to same file to same area of te"t give rise to conflict.'72 notices it. )s soon as developer . tries to commit, '72 does not accept the commit and declare the conflict. /eveloper must sort it all and then ma!e a commit. 2ubversion 7ersion 'ontrol tool (276)is the descendent of '72,follo ing the client server model. It provides some improvement over '72 and has replaced '72 in many open source pro+ects. /istributed version control>6o the version control systems have moved to ne"t stage that is distributed version control. Each developer has copy of full repository. There is no central
@2B

repository. /evelopers cannot see the or! of other developers. Though they can share each otherGs or! by push, pull operation and further they can merge their changes. .

9ig<> /istributed push(pull model J@K It or!s li!e /eveloper ) ma!es changes to its or!ing copy and commit it to its local repository to ma!e it public. 2imilarly, /eveloper . ma!es changes to its or!ing copy and commits it to its local repository. 6o the /eveloper ) can pull the changes of /eveloper . and can merge ith its o n history of snapshots. 8e can push his o n changes to /eveloper .Gs repository if he demands and can be merged.JCK C+ .enefits of using /istributed 7ersion 'ontrol 0hen distributed version control systems are used then hole repository is ith the developers, so the obvious benefit is that the commonly used operations such as commit and revie ing history can be performed at local end and no net or! connection is required. 'reating and destroying branches is a simple operationJBK. )lso it ma!es the tas! of merging very easy..ut in case of centrali1ed version control the tas! of branching and merging is difficult and sometimes ris!y also JAK. G+ *ro+ects migrating from 'entrali1ed to /istributed 7ersion 'ontrol $any open source pro+ects are moving their codebase from centrali1ed to distributed version systems. This has been depicted by )l is and 2illito in J=K. They analy1ed various open source pro+ects naming *erl,#pen office, *hython , 6et.2/. )mong these *erl has already shifted its codebase from *erforce ('entrali1ed version control) to ,it (/istributed version control), others are planning to adopt some distributed versioning control system. )mong many one of the benefits of using distributed versioning control is that it gives great benefit to non(committers or patch contributors. 6o they do not need committer status. Each contributor has its o n repository to ma!e the changes and chec! the changes against hole pro+ect. 9urther these changes can be merged ith other developers J=K. )nother benefit for patch contributors is that patches from distributed versioning control system contain sufficient information to trac! the ancestor J=K. This facilitates revie ers for the patch.
@2A

'onclusions #ur study has provided the overvie of various open source version control tools available and ho they synchroni1e the efforts of developers or!ing on a same pro+ect. )lso it gives the insights that ho distributed version control tools are providing more benefits than centrali1ed version control tools. $oreover, /istributed 7ersion 'ontrol 2ystem (/7'2)is getting more popular because it promotes the community contributions. 2o for the evolution of the soft are ith distributed developers, /7'2 is a great help. %eferences J1K8errai1, ,. %obles, -. -. )mor, T. %omera, and -. $.,on1iale1(.arahona. EThe processes of +oining in global distributed soft are pro+ectsF. In ,2/ G?C> *roceedings of the 2??C international or!shop on ,lobal soft are development for the practitioner,)'$,pp.2B( <<,2??C. J2K5.'ro nston,5.0ei,-.8o ison,).0iggins,F9ree&;ibre #pen 2ource 2oft are> 0hat 0e 5no and 0hat 0e /o 6ot 5no . EIn )'$ 'omputing 2urveys,@@,(2),articleB,2?12. J<K6...%uparelia.FThe history of version controlF )'$ 2I,2#9T 2oft areEngineering 6otes,<D,(1),ppD(=,2?1?. J@K 7.9achbereichEle!trotechni!,{) 9ully decentrali1ed, peer(to(peer based version control systemFdissertation,2?11. JDK5.9ogel, F#pen source development ith '72F.*ublished by'oriolis Inc. JCKhttp>&& .git(scm.com&documentation. JBKIan 'lat orthyF/istributed 7ersion 'ontrol 2ystems.0hy and 8o Fianclatworth .files.wordpress.com5.2245*25dvcs-wh -and-how<.pdf. JAK#L2ullivan, .. $a!ing sense of revision(control systems. 'ommunications of the )'$,D2(=), DB(C2,2??=. J=K../.)l is,-.2illitoF0hy are soft are pro+ects moving from centrali1ed to decentrali1ed version control systemsOFIn '8)2E L?= *roceedings of the 2??= I'2E 0or!shop on 'ooperative and 8uman )spects on 2oft are Engineering.IEEE,pp<C(<=,2??=.

@2=

C% -& $?$SS COMM0)&CAT&O)S! ,$AT0 $S A)D C"A??$)%$S ajbir %ill Assistant Professor/ Swami Satyanand College of Management and Technology/ Amritsar+ rajbir>:1yahoo+co+in

A3ST ACT The mobile net or! system has ta!en a remar!able revolution in the area of communication, information gathering and entertainment during the past fe years. The mobile communication industry has beaten the gro th of all other fields. 0ith the development starts from 1, it reaches to @, and no D, is e"pected to be in action very soon. This evolution in mobile communication affects our day to day life. This paper focuses on the upcoming fifth generation of mobile technology along ith the preceding generations. The D, is very high speed ireless technology. The researchers are or!ing on the development of 0000 (0orld 0ide 0ireless 0eb), /)06 (/ynamic )dhoc 0ireless 6et or!s) and complete 0ireless orld. It focuses on high quality voice calls and data transmissions. This forthcoming technology in mobile communication ill support I*7C and flat I*. The fifth generation technology provides services li!e video call, mobile T.7, 8/T7, video on demand, much secured electronic transactions etc. ($4-O DS> 1,, @,, D,, 0000, /)06, I*7C &)T OD0CT&O) The 'ommunication is one of the basic needs in our lives. Earlier e communicate ith our near and dear ones through snail mails hich too! long span of time. )s the time passes, ith the development of information technology, landlines too! the place of snail mails. There are lots of transformations being seen by the orld in this domain. Today mobile phones have ta!en the priority over landlines. Each of us accesses a mobile phone that functions 2@VB. #ur cell phones not only !eep us connected ith the entire orld at huge but also serve the purpose of entertainment gadget. The ireless communication came into e"istence in early 1=B?s. 2tarting from its first generation (1,) to 2.D, and then <,, @, and no the forthcoming D,, this orld of communication has seen a lot of improvement. In a latest ne s 2outh 5orea plans D, ireless net or! by 2?2?.The countryGs science $inistry announced plans to invest a hopping U1.Dbillion in building a nation ide D, ireless service. #nce developed, the net or! ill permit ,igabit (1,b&s) transmission on compatible mobile phones. #f course, a pro+ect li!e this ill ta!e time X si" years, according to a statement released by the ministry. .ut a trial service could be rolled out in certain mar!ets by 2?1B.JDK %$)$ AT&O)S O, MO3&?$ COMM0)&CAT&O) 5+ ,irst %eneration 65%8
@<?

The 9irst ,eneration as rise in1=A?s.1, restrains the )nalog 2ignals and !no n as cell phones. It introduces mobile technologies such as $obile Telephone 2ystem ($T2), )dvanced $obile Telephone 2ystem ()$T2), Improved $obile Telephone 2ervice (I$T2), and *ush to Tal! (*TT). It utili1es analog radio signal hich have frequency range of 1D? $81, voice call modulation is done using a technique called 9requency(/ivision $ultiple )ccess (9/$)).It has lo capability, unreliable handoff, poor voice quality, and no security at all since voice calls ere played bac! in radio to ers, ma!ing these calls susceptible to un anted eavesdropping by third parties. >+ Second %eneration 6>%8 The 2, introduced in late 1=A?s. It is more efficient in replacement to analog systemsN it uses digital signals for voice transmission and has speed of C@ !bps. It holds good security for both sender and receiver. It provides facility of 2$2 (2hort $essage 2ervice) and use the band idth of <? to 2?? 581. 2econd ,eneration technologies are either T/$) or '/$). 6e"t to 2,, 2.D,, 2.BD, system uses pac!et s itched and circuit s itched domain and provide data rate up to 1A? !bps. E.g. ,*%2, '/$) and E/,E. B Third %eneration 6B%8 The International Telecommunication 4nion specified some set of standards for the mobile phones and its services !no n as International $obile Telecommunications(2??? (I$T((2???) i.e., <, This technology transmits data by using pac!et s itched technology and voice calls are interpreted through circuit s itching. Transmission speeds from 12D!bps to 2$bps. In 2??D,<, is ready to live up to its performance in computer net or!ing (0'/$), 0;)6 and .luetooth) and mobile devices area (cell phone and ,*2).)ccess to global roaming ith great clarity, internet, mobile T.7, video conferencing, video calls,$$2,</ gaming and many more are the facilities provided by <, phones. D+ ,o#rth %eneration 6D%8 The basic feature of <, Technology is fast data transfer rates. 8o ever this feature is not currently or!ing properly because, IT4 2?? is still ma!ing decision to fi" the data rates. 6et or! authentication has on the trust of users, because the user can rely on its net or! as a reliable source of transferring data. . @, is a conceptual frame or! and a discussion point to address future needs of a high speed ireless net or!. It is e"pected to emerge around 2?1? R 2?1D. @, should be able to provided very smooth global roaming universally ith lo er cost. The various applications of this technology are mobile T.7 ith more clarity and speed, 8/T7, video on demand, $obile 0i$)V (0orld ide Interoperability for $icro ave )ccess), ;ocation(based services( a provider sends locali1ed eather or traffic conditions to the phone, or the phone allo s the subscriber to find nearby businesses or friends). C+ ,ifth %eneration 6C%8
@<1

)ll ireless and mobile net or!s use internet protocol for transferring data and signals on net or! layer. The upcoming D, technologies provide facilities li!e camera, $*< recording, video player, large phone memory, audio player etc. The D, ireless mobile multimedia internet net or!s can be completely ireless communication ithout limitations, hich ma!es perfect ireless real orld(0000 ( orld( ide ireless eb). 2ince it is based on @, technologies, the Dth ireless mobile internet net or!s are real ireless orld hich shall be supported by ;)2('/$) (;arge )rea 2ynchroni1ed 'ode(/ivision $ultiple )ccess), #9/$ (#rthogonal frequency(division multiple"ing), $''/$) ($ulti('arrier 'ode /ivision $ultiple )ccess), 40. (4ltra( ideband), 6et or!(;$/2 ( ;ocal $ultipoint /istribution 2ervice), and I*vC. 9ifth generation technologies offers tremendous data capabilities and unrestricted call volumes and infinite data broadcast together ithin latest mobile operating system. 9ifth generation should ma!e an important difference and add more services and benefits to the orld over @,. 9ifth generation should be more intellectual technology that interconnect the entire orld ithout restrictions. This generation is li!ely to be introduced around 2?2?. The orld of universal, unremitting access to information and communication ill open ne aspects to our lives and change our ay of living e"tensively.

,ig 5! C% Mobile Phone Table 5! Comparison of all generations of mobile technologies Technology ,eat#res 5% >% B% D% C%

StartI Deployment

1=B?(1=A?

1==?( 2??@

2??@(2?1?

6o

2oon (*robably 2?2?)

@<2

Data 3andwidth

25bps

C@5bps

2$bps

1,bps

8igher 1,bps

than

Technology

)nalog 'ellular Technology

/igital 'ellular Technology

'/$) 2??? (1"%TT,E7 /#) , 4$T2,E/, E

0i$a", ;TE 0i(9i

0000 (coming 2oon)

Service

$obile Telephony (7oice)

/igital voice 2$2, 8igher capacity pac!eti1ed data

Integrated high quality audio, video and data

/ynamic information access, 0earable devices

/ynamic information access, 0earable devices ith )I capabilities '/$)

M#ltipleHing 9/$)

T/$), '/$)

'/$)

'/$)

Switching

'ircuit

'ircuit, *ac!et

*ac!et

)ll *ac!et

)ll *ac!et

Core )etwor*

*2T6

*2T6

*ac!et 6&0

Internet

Internet

,$AT0 $S O, C% The main features the technology might have are as follo s> 8igh speed, high capacity, and lo cost per bit. It 2upport interactive multimedia, voice, streaming video, Internet and other broadband services, more effective and more attractive, .idirectional, accurate traffic statistics.
@<<

Introduction of a ne radio system is possible in hich different radio technologies ill share the same spectrum. This can be done by finding unused spectrum and then adapting to the technology of the radio technology ith hich the spectrum is being shared. Every mobile in a D, net or! ill have an I* address (I*7C) according to the location and net or! being used. The technology is e"pected to support virtual private net or!s. D, technology is providing large broadcasting of data in ,iga bit hich supporting almost CD,??? connections. The high quality services of D, technology based on *olicy to avoid error. D, technology offers transporter class gate ay ith unparalleled consistency. The traffic statistics by D, technology ma!es it more accurate. Through remote management offered by D, technology a user can get better and fast solution. The remote diagnostics is also a great feature of D, technology. The uploading and do nloading speed of D, technology touching the pea!. The D, technology net or! offering enhanced and available connectivity +ust about the orld. Hour intelligent car ill send 2$2 to your cell phone, if someone tries to open the door, hile you are a ay from you car Hour home security camera is attached to secured internet. 2o that you can vie your sitting room on your laptop&mobile phone screen, by accessing secured ebsite. Hou ill have single bill for all telecom services, regardless of application or net or! operator. The artificial intelligence ill be included in D, technology through advance earable computer technology.

,ig >9B= C"A??$)%$S O, C%

@<@

Each engineering practice has their o n standard (9.e!s Telecom has <,**, <,**2, IT4, IET9, etc). To integrate these various standards, requires systematic and time consuming approach. There is no common architecture for interconnecting various engineering practices. #ne common governing body is required, hich creates a common platform for all engineering practices to regulari1e the interconnectivity issues as ell as !no ledge sharing. D, 0ireless )ccess !ey challenges include avalanche of Traffic, e"plosion of number of devices and diversity of requirements such as latency, reliability and lo cost and energy consumption. This multiplicity of requirements is in turn stretching the limits of available technologies.

CO)C?0S&O) In the conte"t of development in mobile communication technology, from 1, to @, each generation has been introduced ith increased speed, improved quality and updated services. The fifth generation technology ill be superior fourth generation. The idea of 0000 ( orld( ide ireless eb) is started from @, technologies and ill be spread out in 9ifth generation. 'onsequently, D, should ma!e our lives more effortless and enhanced by accumulating more services and features. D, should be more intelligent technology that interconnects the entire orld ithout limits. $, $)C$S 1. $s. 6eha /umbre,F Dg ireless technologies(still @g )uction not over, but time to start tal!ing DgF,I-2ET% 2?1< 2. $s. %eshma 2. 2apa!al,FD, $obile TechnologyF,I-)%'ET 2?1<. <. http>&& ebtechdesigner. eebly.com&1&post&2?12&11&Dg(technology(the(future(of( ireless( telephone(technology.html @. $r. )runabha /ebnath,F%ivie on 6e"t ,enration Technologies of 0ireless 'ommunicationF,I-%IT'' . D. http>&& .usatoday.com&story&tech&2?1@&?1&2<&revie ed(south(!orea(Dg&@B=D2=B&

@<D

A COMP $"$)S&@$ ST0D4 O, @A &O0S "0MA) $SO0 C$ &),O MAT&O) S4ST$M 6" &S8 MOD0?$S 0rvashi )ir#la Assistant Professor/Swami Satyanand College of Management &Technology nir#la+#rvashi1gmail+com A3ST ACT 8uman resource forms an integral part of any organisation, and since all the activities in a firm are performed, supervised, monitored and controlled by SthisG human resource, it becomes imperative for organisations to cater to their needs and requirements in an efficient manner. Effectively managing the human resource is a challenge for a firm, simply because of the sheer comple"ities and variations that are encountered hile dealing ith them. It is thus necessary for firms to have a system to easily feed, store and retrieve the various employee(related data. This is here the concept of 8uman %esource Information 2ystem (8%I2) comes to play. This system is a soft are ith a set of modules designed to cater to specific human resource management activities. This study presents a comprehensive analysis of the various 8%I2 modules and their features. -"AT &S " &SM )ggar al and 5apoor (2?12) state that 8uman %esource Information 2ystems (8%I2) is a process that utili1es the information technology for the effective management of human resource functions and applications J1K. 8uman %esource Information 2ystem (8%I2) or 8uman %esource $anagement 2ystem (8%$2) refers to the systems and processes at the intersection bet een human resource management (8%$) and information technology. It merges 8%$ as a discipline and in particular its basic 8% activities and processes ith the information technology field J2K. It is a computeri1ed system typically comprising a data base or inter related data base that trac! employees and their employment specific information (,ill and -ohnson, 2?1?) J<K. It can be briefly defined as integrated systems used to gather, store and analy1e information regarding an organi1ations human resources (8endric!son 2??<) J@K. -"4 &S &T $K0& $DM )s an 8%I2 is an information system hich is developed by IT professionals in collaboration ith the 8% e"perts, it can be used to cater to a ide variety of 8uman %esource $anagement activities. )n e"amination of the literature suggests that the impact of technology in 8%$ falls into t o main areasX the impact on the efficiency of the delivery of 8% processes and the impact on the role of the 8% function itself JDK. Enshur et al. (2??2) analysed the impact of technology on the processes of acquiring, re arding, developing, protecting and retaining human resources and concluded that the shift from traditional 8% to e(8% can lead to Esubstantial reductions in cost and time for many 8%
@<C

activitiesF (p. 2<A) JCK. 2nell, 2tuber, and ;epa! (2??2) discussed that IT may potentially enable 8% to lo er administrative costs, increase productivity and reduce response times JBK. ;engnic!( 8all and $orit1 (2??<) stated that 8%I2, not only reduces process and administrative costs, but can speed up transaction processing, reduce information errors and improve the trac!ing and control of human resource actions JAK. They also noted that 8%I2 provides human resource professionals ith the time needed to direct their attention to ards more business critical and strategic level tas!s, such as leadership development and talent management J1K. 7arious other benefits of implementing 8%I2 in the organisation, as noted by )ggar al and 5apoor (2?12) are as follo s J1K> 9ormulation of policies and programs related to human resource 9acilitating decision ma!ing in areas li!e promotion, transfer, nomination, setting employees provident funds, retirement, gratuity, leave travel concession and earned leave compensation 2upplying data and submitting returns to government and other statutory agencies. 'ollecting appropriate data and converting them to information and !no ledge for improved timeless and quality of decision ma!ing *roducing a greater number of varieties of accurate and real time human resource related reports. Increase competitiveness by %eengineering human resource processes and functions Improving employee satisfaction by delivering human resource services more quic!ly and accurately *rovides a comprehensive information picture as a single, integrated data baseN this enables organi1ations to provide structural connectivity across units and activities and to increase the speed of information transactions. 8%I2 therefore simplifies the various activities involved in the human resource management processes, and thus allo s an organisation to focus on its core business functions. " &S MOD0?$S! The various facets of 8%I2 soft are are called as $odules. 'urrently, the 8uman %esource Information 2ystem is available in the follo ing modules J2K> *ayroll Time and )ttendance *erformance )ppraisal .enefits )dministration 8% $anagement Information 2ystem %ecruiting ;earning $anagement

@<B

*erformance %ecord Employee 2elf(2ervice 2cheduling )bsent & ;eave $anagement )nalytics

Payroll Mod#le This module calculates employeesG or! hours, along ith !eeping a trac! of their attendance information. The system automatically or!s out the applicable ta"es and other deductions, and then generates the appropriate pay chec!s and employee ta" reports. This module can encompass all employee(related transactions as ell as integrate ith e"isting financial management systems J11K. 8%I2 soft are typically has a Time and ;abour $odule. )t a glance, one can have a glance of ho ell are the employees performing. Thus, this module assists in ma!ing assessments so that the labour costs can be optimised J=K. 9eatures of the *ayroll $odule (as offered by 'eridian InsyncLs *ayroll $odule) are J2?K> - *aycheques or /irect /eposit - 2tatutory and 6on(2tatutory /eductions - ,overnment %emittance 9iling - %ecords of Employment (%#Es) - ,arnishee *rocessing - %egular *ayroll %eports - ;egislative 'ompliance - Hear(end 2ervices - Employee )ttendance - 6e Employee 2etup Time and Attendance Mod#le This module automates time!eeping related processes. The offered functionality enhances the organi1ationLs performance by eliminating paper or! and manual processes associated ith pro+ect time!eeping and attendance management. The sophisticated module helps to efficiently organi1e labour data improve the or!force management and minimi1e errors in enforcement of companyLs attendance policies J1?K. The most advanced modules provide broad fle"ibility in data collection methods, labour distribution capabilities and data analysis features. 'ost analysis and efficiency metrics are the primary functions J11K. 9eatures of this module (as offered by #range8%$ soft are) are J1?K> - )llo s precise pro+ect information management - 'reate timesheets to monitor the statuses of pro+ects tas!s relevant to each employee - /efine /ays(off ( ee!ends and specific holidays) - )dministration and management of your o n and your subordinateLs timesheets
@<A

'reate timesheets ee!ly or monthly and times can be entered in hh>mm Time %eports can be generated for approved or all pending approval timesheets )ttendance trac!ing ith more control and clear reporting for 8% administrators and managers

Performance Appraisal Mod#le This module is dedicated to analysing employee performance on the +ob. It is aimed at simplifying the performance revie process, so that the 8% e"ecutives&managers can communicate the !ey performance indicators for each +ob title, allo ing the employees to understand and achieve the organisationGs e"pectations J1@K. 9eatures of this module (as offered by #range8%$ soft are) are J1@K> - 2imply create performance revie s using 5*ILs specific to each +ob title - ;et employees scale their performance through their performance revie s - )llo s employees to understand employerLs e"pectations This module, as offered by /es!era *erformance $anagement allo s an organisation to align, assess, and optimi1e or!force performance ith reliable ,oal and 'ompetency management features J21K. 3enefits Administration Mod#le This module focuses on providing a system for organi1ations to administer and trac! employee participation in the benefits programs. These typically encompass insurance, compensation, profit sharing and retirement J2K. This module provides organisations ith (as offered by the organisation )/* Employease) J12K> - 'entrali1ed /atabase - 9le"ible *lan /esign - *lan /esign 0i1ard - 'redit .ased *rograms - Enrolment *rofiles - .enefits 2tatements - 'onfirmation 2tatements - /ependents - .eneficiaries - Employee 6otes " Management &nformation System Mod#le The 8% management module is a component covering various 8% aspects ( from application to retirement. The system records basic demographic and address data, selection, training and development, capabilities and s!ills management, compensation planning records and other related activities. ;eading edge systems provide the ability to MreadM applications and enter

@<=

relevant data to applicable database fields, notify employers and provide position management and position control J2K. The features offered by this module include (as offered by #pen 2ource Ecommerce 2olutions) J22K> - Employee demographic and address details - Employee recruitment - Employee training details - Employee capabilities and s!ill management details - 'ompensation planning records - *osition management and position control - 0ith a supreme intention to ma!e the system modern ith end to end functionality, the 8% management Information system module ill also include employer notification facility ith the capability to read e"ternal applications. ecr#iting Mod#le The recruiting module allo s 8% professionals to effectively streamline the entire process of applicant trac!ing. The features of the %ecruiting $odule as offered by the #range8%$ soft are are J1DK> - )pplicant /atabase - Intervie 2cheduling - )ssigning 8iring $anagers for -ob 7acancies - 5ey ord Tagging for )dvanced )pplicant 2creening - 2ocial $edia %ecruiting via. 9aceboo! - 'andidate&)pplicant 8istory - *osting 7acancies to an %22 9eed on the 0ebsite ?earning Management I Training Mod#le This module provides a system for organi1ations to administer and trac! employee training and development efforts. The system, normally called a Mlearning management systemM (;$2) is a standalone product, that allo s 8% to trac! education, qualifications and s!ills of the employees, as ell as outlines hat training courses, boo!s, '/s, eb based learning or materials are available to develop hich s!ills. 'ourses can then be offered in date specific sessions, ith delegates and training resources being mapped and managed ithin the same system. 2ophisticated ;$2 allo managers to approve training, budgets and calendars alongside performance management and appraisal metrics J2K. 5ey features of this module are (as offered by *erfect 2oft are) J2<K> - 'entrali1ed access - 'ustomi1ed competency development - )utomatic 6otifications - %obust %eporting
@@?

Performance ecord Mod#le /etail on the performance appraisal can be trac!ed by using this module. 8ere the details of employee appraisal, date of appraisal, ne"t appraisal date are maintained. /isciplinary actions are also part of this module. If a disciplinary action is ta!en against any employee the action and the date of action can be trac!ed as ell J1<K. $mployee Self7Service Mod#le The employee self(service module allo s employees to query 8% related data and perform certain 8% transactions over the system on their o n. Employees may query their attendance record from the system ithout as!ing the information from 8% personnel J2K. This module is a po erful tool providing employees of the company ith the ability to vie relevant information such as personal information updating personal information ith eb ( enabled *' ithout having to hassle the 8% staff. The functionality of this module spans through the entire system ma!ing information available any here anytime. #f course all information is sub+ect to company defined security policy here everyone can only vie the information he & she is authori1ed to. Time and cost saving effects from this solution are tremendous J1CK. 9eatures of this module, as offered by #range8%$ soft are are J1CK> - )llo s employees to log(in to the system and update their personal information independently - The E22 users ill have limited access ithin the system as a security measure - 2ince the application comprises a holiday management module, leave application and approval from their supervisor can be performed from the system itself - )n employee may vie their leave summary to !eep trac! of their leave entitlements, leave ta!en and leave carried for ard Sched#ling Mod#le This module allo s agencies to set up, manage, and assure proper coverage of employees for all the required shifts J1BK. It thereby assists managers in effectively scheduling the tas!s so that no employee is over( or!ed or idle, hile ensuring that all the activities are e"ecuted seamlessly. Absent I ?eave Management Mod#le This module enables staff holiday requests 3 approval processing online. It significantly streamlines all the leave(related procedures eliminates paper or! and saves costs J1AK. .roadly, this module provides organisation ith the follo ing features> (;isted features are present in the #range8%$ soft are J1AK) - /efining leave types relevant to your organi1ation - /isplaying information on leave entitlement, leave time, balance, history and paid time off all in a single screen - /efining /ays(off (staff holiday planning)
@@1

)llo ing employees to apply for leave directly from the system and supervisors may approve or re+ect leave 2ending(out auto e(mail notifications to employees and supervisors on leave statuses

Analytics Mod#le The )nalytics module enables organi1ations to e"tend the value of an 8%$2 implementation by e"tracting 8% related data for use ith other business intelligence platforms J2K. This module provides visual graphics and charts to illustrate and monitor critical dashboard metrics J1=K. CO)C?0S&O) 9rom this study it can be seen that at present, there are various modules & systems of application of the 8uman %esource Information 2ystem. These modules not only serve as an efficient and reliable media for the 8% personnel to feed, store and retrieve employee data, they also offer quic! and easy access to the information pool and simplify the comple" processes of analysing and interpreting the human resource(related data of the organisation. 0ith the advancement in technology, more and more modules shall be developed, focused on the other intricate aspects of human resource management li!e potential appraisal, bac!ground data trac!ing, etc. 8%I2 (or 8%$2) therefore offers e"tensive benefits to companies, ith its various modules, by successfully, efficiently and effectively utili1ing information technology for managing the human resources. $,$ $)C$S J1K )ggar al, 6. 3 5apoor, $. 2?12. E8uman %esource Information 2ystems (8%I2) ( Its role and importance in .usiness 'ompetitivenessF. ,ian -yoti E(-ournal, 7olume 1, Issue 2 (-an R $ar 2?12). J2K http>&&en. i!ipedia.org& i!i&8umanQresourceQmanagementQsystem J<K ,ill, -., -ohnson, *., (2?1?). %esearch methods of managers, 2age *ublications ;imited, 9ourth Edition. J@K 8endric!son, )nthony % (2??<). 8%I2> .ac!bone Technology of 'ontemporary 8%N -ournal of ;abor %esearch, 2@ (<), <A1(<=@. JDK .enfatto, $aria 'hiara (2?1?) 8uman %esource Information 2ystems and the performance of the 8uman %esource 9unction. Tesi di /ottorato, ;4I22 ,uido 'arli, /epartment of .usiness and $anagement f *h/ *rogram in .usiness Information 2ystems, tutor> 9ranco 9ontana, p. 12?. J/octoral ThesisK. JCK Enshur, E., 6ielson, T., 3 ,rant(7allone, E. (2??2). Tales from the hiring line> Effects of the Internet technology on 8% processes. #rgani1ational /ynamics, <1(<), 22@(2@@. JBK 2nell, 2., 2tueber, /., 3 ;epa!, /. (2??2). 7irtual 8% departments> ,etting out of the middle. In %. ;. 8eneman 3 /. .. ,reenberger (Eds.), 8uman resource management in virtual organi1ations (pp. A1(1?1). ,reen ich, 'T> Information )ge *ublishing.
@@2

JAK ;engnic!(8all, $. ;., 3 $orit1, 2. (2??<). The Impact of e(8% on the 8uman %esource $anagement 9unction. -ournal of ;abor %esearch, 2@(<), <CD(<B=. J=K http>&&smallbusiness.chron.com&e"plain(hris(payroll(systems(B2<=D.html J1?K http>&& .orangehrm.com&open(source(product(features(Tand).shtml J11K http>&& .design2B?.com&sds&hris.php J12K http>&& .eease.com&hris&benefitsQadministration.php J1<K http>&& .e"tolutionind.com&empo er(hrms.html J1@K http>&& .orangehrm.com&open(source(product(features(performance.shtmlWperformance J1DK http>&& .orangehrm.com&open(source(product(features(recruitment.shtmlWrecruit J1CK http>&& .orangehrm.com&open(source(product(features(ess.shtmlWess J1BK http>&& .ogs.state.ny.us&purchase&snt&a ardnotes&BC???21C?A9):.pdf J1AK http>&& .orangehrm.com&open(source(product(features(leave.shtmlWleave J1=K http>&& .aghemployersolutions.com&hrQinformationQsystem.asp" J2?K http>&& .ceridian.ca&en&solutions&paying(talent&payroll(hris(insync.html J21K http>&& .des!era.com&hrms J22K http>&& .indiamart.com&company&<DD==?1&services.html J2<Khttp>&& .perfectsoft are.com&products&talent(management&learning(management( soft are.php

@@<

$)"A)C&)% $)T$ P &S$ $SO0 C$ P?A))&)% S4ST$M ,O -& $?$SS )$T-O ( #pinder (a#r Assistant Professor/Swami Satyanand College of Management & Technology/ Amritsar r#pinder+asr1gmail+com )eelam Assistant Professor/ Swami Satyanand College of Management & Technology/ Amritsar neelamsodhi<:1gmail+com

A3ST ACT E%* (Enterprise %esource $anagement) systems relate to the IT discipline that deals ith !eeping fundamental business processes of a company ( hether they deal ith manufacturing automobiles or providing financial services to its customers. 0ireless E%* is an enhancement to core E%* applications and systems so that mobile sales force and customer service personnel can interact ith this information from any here, any time. E%* provides an integrated real(time vie of core business processes, using common databases maintained by a database management system. E%* systems trac! business resourcesXcash, ra materials, production capacityXand the status of business commitments> orders, purchase orders, and payroll. The applications that ma!e up the system share data across the various departments (manufacturing, purchasing, sales, accounting, etc.) that entered the data. E%* facilitates information flo bet een all business functions, and manages connections to outside sta!eholders. ($4-O DS> E%*, 0ireless net or!, $%*, E%* 'omponents. &)T OD0CT&O) Enterprise %esource *lanning (E%*), is a computeri1ed inventory control and production planning system that as born from $aterial %equirements *lanning ($%*) systems. E%* is a system that organi1es functions of an institutionN supporting, for e"ample, accounting, finance, human resources and e(commerce applications through the creation of relational databases and graphical user interfaces that unify the tas!s of institutions li!e corporations, government agencies, non(profit organi1ations, po erful institutions and industries and businesses establishments. E%* is a system that is used to combine all of the information or operations of a company into a single unit. The standard E%* system ill utili1e both computer hard are and soft are in order to achieve this. *erhaps one of the most important parts of the E%* system is the central database. O &%&)
@@@

E%* 2ystem have too! years to emerge and is still evolving. These systems are transformation and ever(changing. .efore early E%*(type systems emerged, in the prehistoric age of 1=C? and early 1=B?Gs /epartmentali1ed systems came into picture. In 1=B?Gs manufacturing chain as the center of business operations. This led to the development of $%* systems. The second phase of E%* development occurred in 1=A?Gs hich focused more on quality measures hich led to the evolution of $%* II 2ystems. In the 1==?Gs,Enterprise %esource *lanning or E%* uses multi(module application soft are for improving the performance of the internal business processes. $ P systems often integrates business activities across functional departments, from product planning, parts purchasing, inventory control, product distribution, fulfillment, to order trac!ing resources. This led to the evolution of E%* 2ystem. The benefits of E%* systems are> customer satisfaction, better information, productivity, increased quality and decreases in time to mar!et, product cost, delivery time, inventory levels. MA.O COMPO)$)TS O, $ P S4ST$MS

,ig 5! Components of $ P System Components of Man#fact#ring !7Engineering, .ills of $aterial, 2cheduling, 'apacity, 0or!flo $anagement, :uality 'ontrol, 'ost $anagement, $anufacturing *rocess, $anufacturing *ro+ects, $anufacturing 9lo Components of S#pply Chain Management !7 2upply 'hain *lanning, Inventory, *urchasing, #rder Entry, *roduct 'onfiguration, 'laim *rocessing, 2upplier 2cheduling, $aterial $anagement Components of ,inancials eso#rce Management !7 ,eneral ;edger, 'ash $anagement, )ccounts *ayable, )ccounts %eceivable, )sset $anagement, Time and E"pense, 9inancial %eporting, pro+ects. Major ,#nctional Components of "#man eso#rces Management !7 8uman %esources, *ayroll, Training, Time 3 )ttendance, .enefits.
@@D

C#stomer elationship Management Components !7 2ales and $ar!eting, 'ommissions, 2ervice, 'ustomer 'ontact and 'all 'enter support. $ P ,O -& $?$SS )$T-O ( /emand for ireless access to enterprise local area net or!s (;)6s) is fueled by the gro th of mobile computing devices, such as laptops and personal digital assistants (*/)s), and a desire by users for continual connections to the net or! ithout being restricted to Mplug in areas,M hich do not move ith their or!. Enterprise %esource *lanning or E%* is going places these days. It has become an integral part of almost all business. 0ireless E%* is nothing but sharing enterprise information through devices li!e internet and other devices ma!ing it possible for outsiders to access the same. )dvancement of 0ireless Technology in E%* has given a double advantage to the companies hich are using E%* for a long time. )s 0ireless technology has its reach beyond any geographic location and also its communication and data transfer process is much faster. 2o it has become the eye candy of every organi1ation. ) fully managed service that helps you conserve IT resources. Easy to deploy 0i(9i solution, completely independent of the e"isting corporate net or!. 2ecure and helps you !eep your net or! *'I compliant. Improves the customer e"perience and !eeps employees connected. 0i(9i solution can be re(located and its capacity can be increased based on changing enterprise requirements. 'ontrol on the number of simultaneous visitors&guests that are allo ed on the enterprise net or!. The internal ireless net or! can also be logically partitioned using 7;)6s (or ith 22I/s) to provide separate net or! band idth partitions. AD@A)TA%$S O, &MP?$M$)TAT&O) O, A) $ P S4ST$M ! %educed redundancy in entering data 0() s stem provides the real time information all needs of the organi1ation in a single system. $ P )llo everyone to access same source and share same source of information $ P allo to access and update instantly Integration among different functional areas to ensure proper communication, productivity and efficiency The )ccounting for all of these tas!s, trac!ing the %evenue, 'ost and *rofit on a granular level. )llo standardi1ation of business processes and enterpriseGs information D&SAD@A)TA%$S O, $ P S4ST$M !7 Ta!es a lot of effort and time and requires a lot of training 'ustomi1ation of the E%* soft are is limited. 2ome customi1ation may involve changing of the E%* soft are structure hich is usually not allo ed. E%* systems can be very e"pensive to install. E%* 2ystems centrali1e the data in one place and this can increase the ris! of loss of sensitive information in the event of a security violation CO)C?0S&O)
@@C

0hile employing an E%* system may be e"pensive, it offers organi1ations a cost efficient system in the long run. E%* soft are or!s by integrating all the different departments in on organi1ation into one computer system allo ing for efficient communication bet een these departments and hence enhances productivity. The organi1ations should ta!e e"tra precautions hen it comes to choosing the correct E%* system for them. There have been many cases that organi1ations have lost a lot of money due to selecting the L rongL E%* solution and a service provider for them. $,$ 1. 2. <. @. D. $)C$ http>&& http>&& http>&& http>&& http>&&en.

.e"forsys.com&tutorials&erp.html .saponlinetutorials.com& hat(is(erp(systems(enterprise(resource(planning& .e"aminer.com&article& ireless(erp .brovis.com&.rovis&pages&solutions&E%*.php i!ipedia.org& i!i&EnterpriseQresourceQplanning

@@B

)$T-O ( S$C0 &T4 A)D &TS TOO?S (omal Assistant Professor/Swami Satyanand College of Management & Technology *omalasr><*1gmail+com

A3ST ACT The net or!s are computer net or!s, both public and private, that are used everyday to conduct transactions and communications among business, government agencies and individuals. The most common e"ample of net or! is internet. )s e !no that by increases the uses of net or!s (internet) the chances of ris! as ell threat are arise. There is need for security hile using the internet services. 6et or! security is a speciali1ed field in computer net or!ing that involves securing a computer net or! infrastructure. 6et or! security is typically handled by a net or! administrator or system administrator ho implements the security policy. 6et or! security system typically relies on layers of protection and consists of multiple components including net or!ing monitoring and security soft are in addition to hard are and appliances. )ll components or! together to increase the overall security of computer net or!.J1K &)T OD0CT&O) 6et or! security comprises the measure a company ta!es to protect its computer system and it is a prime concern for every company that uses computers. 'ompromising net or! security means a hac!er or competitor may gain access to critical or sensitive data, possibly resulting in data loss, or even complete destruction of the system. )ppropriate net or! security is achieved hen a user has to go through several layers of the system. 6et or! security involves all activities that organi1ations, enterprises and institution underta!es to protect the vale and ongoing usability of assets and integrity and continuity of operations. )n effective net or! security strategy requires identifying threats and then choosing the most effective set of tools to combat them. There are various types of threats to net or! security li!eN 7irus, Tro+an horse programs, 7andals, )ttac!s, /ata interception, and 2ocial engineering.J1K 2o, there is a need to identify firstly the threats hich includes the need of net or! security. )fter the deduction of threats e can find that hat type of tools or technique e use for securing our dataO $@&$- O, ?&T$ AT0 $ 2ecurity is concerned ith ma!ing sure that the information received or send is not modified by the unauthori1ed host. The basic requirement of security includes information confidentiality, authentication, authori1ation, data integrity, non(repudiation and availability.2o, net or! security involves the authori1ation of access to data in net or!, hich is controlled by net or! administration. 6et or! administration includes a cryption layer that automatically prevents an
@@A

unauthori1ed program from gaining access. In the net or! ;ayer, fire all can be installed to !eep good pac!ets and bad pac!ets out.I* security also function in this layer.4.2.companies spend millions of dollars each year in net or! security measures or toolsJ<K.2o,appropriate security net or! is provide hen the proper net or! security tools are establishedJ<K. There are various tools and techniques hich provide overall security of the computer net or!. ,enerally one problem arises hen net or! security is implemented is that of fle"ibility.

Tools and TechniA#es of )etwor* Sec#rity N There are various types of tools for securing a computer net or!. 7arious types of tools provide various security levels to computer net or!, yet all of them are of equal importance.J2K

Tools & TechniA#es of Sec#rity

Physica ?ogicalIOperatin ,irewall l g s Sec#rit System Sec#rity y

Password Mechanis m

$ncryptio n

A#thenticatio n & &ntegrity

Digital Signat#r e

a8 Physical Sec#rity! This technique is used to control on the most sensitive component in the computer net or!. It includes net or! administration station, a net or! host or the server room. J2K b8 ?ogical or Operating System Sec#rity! It is a ne"t tool of net or! security. It provides #perating 2ystem 2ecurity (#22).The /epartment of /efense (/#/) oh 4.2.provide some guidelines for operating system security. In the earlier fe years, certified secure #22 has been introduced in commercial operating system li!e 46IV and $icrosoft 0indo 6T.These are at the '2 level, hich provides discretionary access control(file, directory read and rite permission and auditing and authentication controls.J2K c8 ,irewalls! ) fire all is one of net or! security tool that it is used to protect the net or!ed computers from intentional hostile interruption that could result in data corruption or denial of service. The term E9ire allF means a fireproof all intended to prevent the spread of fire from
@@=

one room or area of a building to another. It allo s only authori1ed communications bet een the internal and e"ternal net or!s, ne ays are al ays being developed to compromise these systems. 9ire all system protects and facilitates your net or! at a number of levels. They allo e(mail and other applications, such as file transfer protocol (9T*) and remote login as desired, to ta!e place hile other ise limiting access to the internal net or!. It provides authori1ation mechanism to only specified users ho can gain access through the fire all.J2K d8 Password Mechanism! *ass ord is the most important and commonly used tool for net or! security. In this mechanism the user loc! his data into system by assigning a pass ord to system. If a user ants to open that system then he&she ill put the pass ord of the system and can access the system again. #nly that person can access the system ho !no s the pass ord of that system. 2o, by this ay e secure our data. In other ords, *ass ord is the ay to identify and authenticate users as they access the computer system.J2K e8 $ncryption! It is another security tool used to protect a computer net or! from disaster effect. Encryption $echanism is heavily depending upon on !eys or pass ords. The longer the pass ord, the more difficult the encryption is to brea!. There are t o !inds of encryption mechanisms used. These areN

(inds of $ncryption Mechanism

Private (ey

P#blic (ey

Private (ey encryption uses the same !ey to encode and decode the data. P#blic (ey encryption uses one !ey to encode the data and another to decode the data.J2K f8 A#thentication & &ntegrity! )uthentication means to chec! the reality of user i.e. )uthentication is simply ma!ing sure users are ho they say they are. #n the other hand integrity means hich ensure that the data is correct and accurate hile and after transmission that means data is not altered along the ay. The message integrity is maintained through digital signature.J2K

@D?

g8 Digital Signat#re! /igital signature is a one ay used for secure communication on computer net or!. It is a cryptographically based signature assurance scheme. The term digital signature has some confusion ith electronic signature. It is generally ta!en to be a SsubsetG of electronic signatures. .ut some people use the term to describe something equivalent to electronic signature. Electronic 2ignature means an electronic sound, symbol or process, attached to or logically associated ith a contract or other record and e"ecuted or adopted by a person ith the intent to sign the record.J2K /igital 2ignatures are often used in the conte"t of public !ey infrastructure (*5I) schemes in hich the public !ey used in the signature scheme is tied to a user by a digital identity certificate issued by a certificate authority. It is usually run by a third party commercial firm.J2K Other Tools of )etwor* Sec#rity! There various another numbers of tools to assist net or! security, hich are given as belo J2K> ith

@erification of D)S &nformation! .y !eeping the update /62 information about all hosts on net or! can help to increase security. If an unauthori1ed host becomes connected to net or! then a user can recogni1e it by its lac! of a /62 entry. @irt#al Private )etwor*! It is a secure net or! that uses primarily public telecommunication infrastructure, such as the Internet, to provide remote access to a central organi1ational net or!.7*6 provides cryptographic tunneling protocols to provide> b'onfidentiality b)uthentication b$essage Integrity

@D1

@erification of D)S &nformation @irt#al Private )etwor*

Antivir#s software pac*ages

&dentity Services Sec#rity Management

Other Tools of )etwor* Sec#rity

Antivir#s software pac*ages! These pac!ages counter most virus threats if regularly updated and correctly maintained.
@D2

&dentity Services! These services help to identify users and control their activities and transactions on the net or!. 2ervices include pass ords, digital certificates and digital authentication !eys. Sec#rity Management! This is glue that holds together the other bloc!s of a strong security solution. CO)C?0S&O) 2o, these are the various tools of net or! security. This is not true that only these tools and techniques ill be sufficient to protect a net or!, but hen all these approaches are layered together, then they can be highly effective in !eeping a net or! safe from attac!s and other threats to security. In addition to these tools and techniques a user can maintained a net or! security in a business, organi1ation, institution etc.by adopted a various corporate policies to determine and control access to various parts of the net or!. $,$ $)C$S J1K http>&& . ebopedia.com&TE%$&6&net or!Qsecurity.html J2K`%achpal2ingh and $ani!2harma,2?1?,FE('ommerce3)pplicationF,5alyani publishers. J<K http>&& .vinitech.com&net or!(security&

@D<

D&%&TA? .$-$??$ 4! )$- A%$ O )AM$)TS S#npreet (a#r Assistant Professor/ Swami Satyanand College of Management & Technology/ Amritsar s#npreet+C51gmail+com A3ST ACT In this era of ever(evolving Technology trends /igital -e ellery has come up ith the ability to revolutioni1e the orld. -e ellery is something hich e can ear to adorn ourselves. /igital +e ellery is defined as ireless, earable computers ith embedded intelligence. It contains different parts of communicating devices embedded into a +e ellery piece. 6o adays manufacturers are !een on producing smart and slee! devices hich contains millions of transistors, capacitors or other electronic devices integrated into chips that have the capability to store tons of digital data. The idea behind this concept is to communicate through ireless devices, that is through .luetooth technology and in the same time it could be something that can satisfy oneLs style quotient as it has that potential to roc! the orld by changing the concept of +e ellery. ($4-O DS! /igital data, digital +e ellery, earable computers, .luetooth technology &)T OD0CT&O) )s the name implies digital +e ellery is computeri1ed +e ellery that contains intelligence embedded in them in the form of chips. It operates li!e a ireless computer and ma!es us to communicate through voicemail, email and voice communication ith the help of .luetooth technology (It is a ireless technology standard intended to e"change data over short distances). -e ellery li!e earrings, nec!lace, and bracelets are fitted ith small electronic devices li!e chips that are capable enough to store loads of digital data. These can store items hich one needs to access quic!ly li!e identity cards, plastic money, pass ords, account information etc. 0earing these +e ellery means that the user is no longer in need of carrying any digital gadgets li!e mobile phone. /ifferent parts of mobile phone including antenna, circuitry, battery, microphone, touch pad, receiver are distributed bet een different +e ellery items, allo ing the user to have quic! and easy access to the information and to ma!e and receive calls ithout any geographical hindrance.J1K D&%&TA? .$-$??$ 4 COMPO)$)TS In case of cell phones the internal circuitry is embedded in different pieces of +e ellery, hich operates li!e a normal mobile phone. They are embedded into different parts of the +e ellery according to their or!ing or their manner of e"ecution and each part is assigned specific function to be performed. /igital +e ellery devices consist of a screen or display for information, most li!ely consisting of B(1C(segment, or dot matri" ;E/s, ;'/s, or other technologies such as
@D@

electroluminescent material (E;) or others, hich could become an optional display ./igital -e ellery can be designed in many different si1es and shapes ith a variety of materials ranging from plastic and metal to rubber and glass. They utili1e electromagnetic properties and electronics to display information through a screen or display of some !ind. This could range from ;E/ B(segment, 1C(segment, dot matri", and other programmable ;E/s devices to ;'/s, #;E/s, and other display devices. /ifferent parts of digital +e ellery according to their functions are as J1K J2K> $arrings! They are used as receivers as they contain spea!ers in the form of earphones embedded in it. ing! It includes ;ight Emitting /iodes (;E/s) that ill flash hen there is an incoming call or any incoming message. It can be programmed to flash different types of colors to identify the importance of any call and to identify the callers. It can also be used to sho user, the current status of the e(mailLs inbo" and to sho the importance of the incoming mails. )ec*lace! It contains a microphone embedded in it that allo s a user to tal! directly into it. The voice is transferred by using .luetooth technology. 3racelet! This piece of +e ellery contains 7ideo ,raphics )rray (7,)) display hich has the functionality to flash the name and the number of the caller. 7oice %ecognition 2ystem and dialing !eypad can also be embedded in it. There are number of computeri1ed +e ellery that has been designed so far. 9or e"ample .ava ing/ $arphones embedded in earrings/ 0S37embedded bracelets/ and wrist bo#nd m#sic players etc+ 2ome of them are briefly mentioned belo >

,ig+5 Phillips Swarovs*i flash drive embedded in a pendent 9B= 5+ Philips Swarovs*i flash drive> *hilips, the Titan in the orld of Electronics collaborated ith 2 arovs!i to ma!e digital as ell as fashionable +e ellery gadgets called M)ctive
@DD

'rystalsM that or! as 42. drives and earphones. 9igure 1 sho the pendent embedded ith flash drive. The flash drive has capacity of 1,., hich is enough to store about 1,??? photos or 2D? songs.J<K This adds a glam quotient and a class to oneLs personality. Even if one is not using it as a storage device every time, one can still flaunt it as +e ellery.

,ig+> $arring7 earphone hybrid 9D= >+ $arring7earphone hybrid> This is another e"ample of computeri1ed +e ellery. It consists of ear buds attached ith dangling silver designs of hoops or leaves through comple" chain lin!ing mechanism, in hich earphones are embedded. *roviding music to the ears, it also accessori1es oneLs outfit. There are many fancy hybrid earring(ear buds available that ma!e this gadget a fashionable accessory to ear. CO)C?0S&O) 0ith the digiti1ation and revolution in technology there is nothing impossible in this orld. /igital +e ellery is the best e"ample of this. It has the ability to enamour the orld ith its most e"citing features. Though this technology has some limitations li!e they are needed to be charged before they are used, as they are electronic devices, e"pensive and are sometime not able to provide the effective readiness in case of rist atches embedded ith iphone that are small in si1e, yet they are considered as the future style trend. 0ith integrating technology ith the +e ellery, they have added a glamorous and lu"urious quotient to the technical devices.

$,$ $)C$S 1. http>&& .indiastudychannel.com&resources&B?DC=(/igital(-e ellery.asp"

@DC

2. http>&& < http>&& @.http>&&

.stylestudio<C?.com&inde".php& hat(is(digital(+e elry(D<?B& .trendhunter.com&trends&s arovs!i(tech .trendhunter.com&trends&+e eled(earbuds

@DB