Neural Network-based Colonoscopic Diagnosis Using On-line Learning and Differential Evolution

Size: px
Start display at page:

Download "Neural Network-based Colonoscopic Diagnosis Using On-line Learning and Differential Evolution"

Transcription

1 Neura Networ-based Coonoscopc Dagnoss Usng On-ne Learnng and Dfferenta Evouton George D. Magouas, Vasss P. Paganaos * and Mchae N. Vrahats * Department of Informaton Systems and Computng, Brune Unversty, Uxbrdge UB8 3PH, Unted Kngdom Phone: , Fax: ema:george.magouas@brune.ac.u * Department of Mathematcs and Unversty of Patras Artfca Integence Research Center (UPAIRC), Unversty of Patras, GR-60 Patras, Greece Phone: , Fax: ema:{vpp,vrahats}@math.upatras.gr ABSTRACT: In ths paper, on-ne tranng of neura networs s nvestgated n the context of computerasssted coonoscopc dagnoss. A memory-based adaptaton of the earnng rate for the on-ne Bacpropagaton s proposed and used to seed an on-ne evouton process that appes a Dfferenta Evouton Strategy to (re-)adapt the neura networ to modfed envronmenta condtons. Our approach oos at on-ne tranng from the perspectve of tracng the changng ocaton of an approxmate souton of a pattern-based, and, thus, dynamcay changng, error functon. The proposed hybrd strategy s compared wth other standard tranng methods that have tradtonay been used for tranng neura networs off-ne. Resuts n nterpretng coonoscopy mages and frames of vdeo sequences are promsng and suggest that networs traned wth ths strategy detect magnant regons of nterest wth accuracy. KEYWORDS: Mnmay nvasve magng procedures, Bacpropagaton networs, Medca mage nterpretaton, On-ne earnng, Dfferenta evouton strateges, Artfca evouton.. INTRODUCTION In medca practce, endoscopc dagnoss and other mnmay nvasve magng procedures, such as computed tomography, utrasonography, confoca mcroscopy, computed radography, or magnetc resonance magng, are now permttng vsuazaton of prevousy naccessbe regons of the body. Ther obectve s to ncrease the expert s abty n dentfyng magnant regons and decrease the need for nterventon whe mantanng the abty for accurate dagnoss. Furthermore, t may be possbe to examne a arger area, studyng vng tssue n vvo - possby at a dstance [5] - and, thus, mnmse the shortcomngs of bopses, such as mted number of tssue sampes, deay n dagnoss, and dscomfort for the patent.

2 In ths paper, we focus on neura networ-asssted dagnoss of coonoscopy mages. Coonoscopy s a mnmay nvasve technque for the producton of mages of the coon: a narrow ppe e structure, an endoscope, s passed nto the patent s body. Vdeo endoscopes have sma cameras n ther tps, when passed nto a body, what the camera observes s dspayed on a teevson montor (see Fgure for frame sampes of a vdeo sequence). The physcan contros the endoscope s drecton usng whees and buttons and the whoe procedure s carred out under varabe perceptua condtons (shadngs, shadows, ghtng condton varatons, refectons etc.). Fgure. Frames of a vdeo sequence showng a poypod tumor of the coon. Neura networ-based methodooges present some nterestng quates, such as earnng from experence, generasaton, and are abe to hande uncertanty and ambguty n dstorted or nosy mages to some extent. Thus, these methods provde human experts wth sgnfcant assstance n medca dagnoss [8], [0], [], [3], [3]. The use of neura networs for the detecton of magnant regons n coonoscopy vdeo sequences encounters severa probems: the tme varyng nature of the process; changes n the perceptua drecton of the physcan; varatons n the dffused ght condtons. In most of these cases, off ne earnng or nowedge-based approaches are not abe to represent a possbe varatons of the envronment. On-ne tranng and retranng aow the networ to update ts weghts durng operaton by tang nto account both the aready stored nowedge and the nowedge extracted from the current data, and are proposed as aternatves to batch earnng-based approaches. Of course, the man chaenge when deang wth adaptve technques for earnng, such as on-ne tranng and retranng, s to baance the nformaton reated to recenty acqured data wth the nformaton aready emboded n the networ [3], [6], [7]. Thus, n ths paper we expore on-ne tranng and retranng of neura networs wth the am to detect magnant regons n coonoscopy mages though a formuaton of the probem that s based on the dea of tracng the movng optmum of a dynamcay changng pattern-based error measure. Ths approach concdes wth the way adaptaton on the evoutonary tme scae s consdered [9], and aows us to expore and expand further research on the tracng performance of evouton strateges and genetc agorthms [], [9], [35]. Hence, the reader shoud eep n mnd that n ths paper we do not see goba mnmsers of the error functon, but we are nterested n deveopng an on-ne evouton strategy that w converge to an approxmaton of the optmum souton (the nterestng topc of fndng goba mnmsers n neura networs tranng s descrbed esewhere [4]).

3 The paper s organsed as foows. Secton expans how textura varatons of the tssue are modeed n our approach. Secton 3 dscusses exstng earnng approaches, whe Secton 4 descrbes the proposed onne evouton strategy. In Secton 5 expermenta resuts are presented and fndngs are dscussed. Lasty, concusons are drawn n Secton 6.. TISSUE CLASSIFICATION FOR ENDOSCOPIC DIAGNOSIS In endoscopc dagnoss, the medca expert, based on a dstrbuted percept of oca changes, nterprets the physca surface propertes of the tssue - such as roughness or smoothness, reguarty, and shape - to detect abnormates. It s mportant to note, however, the vast dffcutes n physca attrbutes of the organs. For exampe, n coonoscopy, no two coons are ae. Even wthn the same coon, one secton may have very dfferent characterstcs from another. Adacent regons of the coon nng showng dfferent propertes are dstngushed on the bass of the textura varatons of ther tssue (pt patterns) []. These dffcutes ntroduce severe mtatons n the use of computer-asssted endoscopc dagnoss [3], [3]. Gven a medca mage, the true features assocated wth the physca surface propertes of the tssue are not exacty nown to the mage-nterpretaton system deveoper. Usuay, one or more feature-extracton modes [6], [7] are used to provde vaues for each feature s parameters. The fndngs are then used to nfer the correct nterpretaton. On ths same tas of nterpretaton on the bass of oca changes of the propertes of the tssue under examnaton, the performance of human percepton s consdered outstandng. Furthermore, medca experts have the abty to ether add or remove components from an mage to gve meanng to what they see. Medca experts can aso adapt to changes to the extent that even a dstorted mage can be recognzed. In computersed systems, the cassfcaton of mage regons s usuay qute sophstcated and nvoves mutpe eves of processng. In genera, a mode wth three stages s empoyed as shown n Fgure (adapted from [6]). Lower Leve Processng Enhancement, Feature Extracton, Segmentaton. Hgher Leve Processng Cassfcaton, Labeng, Outcome predcton. Dagnostcs Image Formaton Images Fgure. Mode for dagnostc system that uses medca mages. The ower-eve processng taes mage pxes as nput and performs varous tass such as mage enhancement, feature extracton and mage segmentaton. The hgher-eve processng taes the output from the ower-eve processng as nput and generates output reated to medca dagnostcs. Tass accompshed 3

4 n the hgher-eve processng ncude cassfcaton of features, detecton of specfc esons and dagnoss for varous abnormates. Orgna Image Image wndow extracted from the orgna mage Feature extracton technque Feature Vector... A A A 3 A N Fgure 3. Stages n feature extracton. An mportant stage of the mpementaton s the feature extracton process (see Fgure 3). In our experments the method of cooccurrence matrces was used for feature extracton. Cooccurrence matrces, [9], represent the spata dstrbuton and the dependence of the grey eves wthn a oca area. Each p(,) entry of the matrces, represents the probabty of gong from one pxe wth a grey eve () to another wth a grey eve () under a predefned dstance and ange. From these matrces severa sets of statstca measures, or feature vectors, are computed to bud dfferent texture modes. In our mpementaton, the coonoscopy mage was separated nto wndows of sze 6 6 pxes wth 8 pxes overap. Then the cooccurrence matrces agorthm was used to gather nformaton from the pxes of an mage wndow. Four anges, namey 0 ο, 45 ο, 90 ο, 35 ο, were consdered as we as a predefned dstance of one pxe n the formaton of the cooccurrence matrces. Therefore, four cooccurrence matrces usng the foowng four statstca measures were formed (see [] for detas): Energy-Anguar Second Moment: f = p( ) Correaton: Inverse Dfference Moment: Entropy: where N g f = f 3 =,, () Ng Ng ( ) p(, ) = = σxσ y + µ µ x y, ( ) p(, ) ( ( )) (), (3) f 4 = p, og p,, (4) s the number of grey eves, µ x, µ y are the margna mean vaues of x (aong the horzonta pxe axs) and y (aong the vertca pxe axs), respectvey, and σ x, σ y are the correspondng standard 4

5 devatons. Thus, a set of 6 features descrbng spata dstrbuton n each wndow s obtaned and used to formuate nputs for hgh eve processng. 3. BATCH LEARNING OF MULTILAYER PERCEPTRONS The most popuar neura networ mode s the so-caed Mut-Layer Perceptron (MLP). In an MLP, whose - th ayer contans N nodes, ( =,...,M), artfca neurons operate accordng to the foowng equatons: N = net = w y (5), y = f ( net ) (6) where net s, for the -th neuron n the -th ayer ( =,...,N ), the sum of ts weghted nputs. The weghts, for connectons from the -th neuron at the (-) ayer to the -th neuron at the -th ayer are denoted by w ; y s the output of the -th neuron that beongs to the -th ayer, and the ogstc functon f( net ) = ( + exp( net )) s the -th's neuron non-near actvaton functon. Tranng an MLP to recognse abnormates n mage regons s typcay reased by adoptng an error correcton strategy that adusts the networ weghts through mnmsaton of earnng error: where ( y M t, p, p ) P p N M M E = = = ( y p t,, p ) P = p = s the squared dfference between the actua output vaue at the -th output ayer neuron, for an nput sampe p, and the target output vaue; p s an ndex over nput-output patterns. E p (7) A varety of approaches adapted from the theory of unconstraned optmsaton have been apped to the mnmsaton of functon E. For exampe, et us consder the cass of batch earnng agorthms that adust the weghts accordng to the teratve scheme: w + = w + ηϕ = 0,,,K (8) Note that n (8) the weghts of the MLP are expressed n a smpfed form usng vector notaton. Thus, w defnes the current weght vector, ϕ s a correcton term, and η s the earnng rate at the th teraton. Varous choces of the correcton term ϕ gve rse to dstnct batch earnng agorthms, whch are usuay cassfed as frst-order or second-order agorthms dependng on the dervatve-reated nformaton they use to generate the correcton term. Thus, frst-order agorthms are based on the frst dervatve of the earnng error wth respect to the weghts, whe second-order agorthms on the second dervatve (see [4] for a revew on frst-order and second-order tranng agorthms). 5

6 A broad cass of batch-type frst-order agorthms, whch are consdered much smper to mpement than second-order methods, uses the correcton term ϕ = E( w ). The term E( w ) defnes the gradent vector of the MLP and s obtaned by means of bac-propagaton of the error through the ayers of the networ. The most popuar agorthm of ths cass, caed batch Bac-Propagaton (BP) appes the steepest descent method wth a constant, heurstcay chosen, earnng rate η that usuay taes vaues n the nterva (0,) [7]. Vaues n ths nterva are consdered sma enough to ensure the convergence of the BP tranng agorthm and consequenty the success of earnng [4]. However, t s we nown that ths practce tends to be neffcent [4], [7] and the use of adaptve earnng rate strateges s suggested n order to acceerate the earnng process (see [4] and [9] for revews on adaptve earnng rate agorthms). Wth regards to second-order tranng agorthms, nonnear conugate gradent methods, such as the Fetcher-Reeves or the Poa-Rbere methods [], or varabe metrc methods, such as the Broyden- Fetcher-Godfarb-Shanno method [4], or even modfcaton of Newton's method [7], [8] have been proposed n the terature. These methods expot dervatve cacuatons and submnmzaton procedures (e.g. the nonnear conugate gradent methods) and/or approxmatons of varous matrces (e.g. the Hessan matrx for the varabe metrc or quas-newton methods) to acceerate the earnng process. 4. ON-LINE EVOLUTION STRATEGY On-ne tranng n neura networs s reated to updatng the networ parameters after the presentaton of each tranng exampe, whch may be samped wth or wthout repetton. On-ne tranng may be the approprate choce for earnng a tas ether because of the very arge (or even redundant) tranng set, or because of the sowy tme-varyng nature of the tas. Athough batch tranng seems faster for sma-sze tranng sets and networs, on-ne tranng s probaby more effcent for arge tranng sets and networs. It heps to escape oca mnma and provdes a more natura approach to earnng n non-statonary envronments. On-ne methods seem to be more robust than batch methods as errors, omssons or redundant data n the tranng set can be corrected or eected durng the tranng phase. Addtonay, tranng data can often be generated easy and n great quanttes when the system s n operaton, whereas they are usuay scarce and precous before. Lasty, on-ne tranng s necessary n order to earn and trac tme varyng functons and contnuousy (re-)adapt n a changng envronment. Despte the abundance of methods for earnng from exampes, there are ony few that can be used effectvey for on-ne earnng. For exampe, the cassc batch tranng agorthms cannot straghtforwardy hande nonstatonary data. Even when some of them are used n on-ne tranng there exsts the probem of catastrophc nterference, n whch tranng on new exampes nterferes excessvey wth prevousy earned exampes eadng to saturaton and sow convergence [3], [34]. Beow we present an on-ne BP- 6

7 seeded Dfferenta Evouton (DE) strategy for on-ne neura networ tranng. Frsty, we brefy present the on-ne BP earnng stage of the proposed strategy. Then we proceed by descrbng the on-ne DE stage. Note that the descrpton beow focuses on the probem of adaptng the weghts on-ne, assumng that onne evouton s aways actvated, and does not requre the nput and desred output data to be nown a pror. Our experments, reported n the next secton, were aso conducted under the same assumptons to test the robustness of our approach. Note, however, that n practce, whenever the changes of the envronment are not consdered sgnfcant and the performance s satsfactory, the weghts and structure of the networ shoud reman constant [6]. 4. ON-LINE BACKPROPAGATION LEARNING On-ne BP earnng strateges are usuay based on the use of stochastc gradent descent due to the nherent effcency of ths method n tme-varyng envronments [], [30], [3], [33], [34]. On-ne earnng has been anaysed wthn the framewor of statstcs and t has been shown that t s asymptotcay as effectve as batch (aso caed off-ne) earnng. However, senstvty to earnng parameters s a common drawbac of these schemes [8]. Advanced optmsaton methods, such as conugate gradent, varabe metrc, smuated anneang etc., cannot be used n ths context, as they rey on a fxed error surface and need nformaton from the whoe tranng set [8]. In [0], a varant of the on-ne BP has been proposed. The method can be consdered as a meta-earnng agorthm n the sense that t earns the earnng rate parameters of an underyng base earnng system (.e. of the stochastc gradent descent). To ths end, the new varant uses a memory-based earnng rate adaptaton schedue that expots gradent reated nformaton from the current as we as the two prevous pattern presentatons: + η = η + γ E ( w ), E ( w ) + γ E ( w ), E ( w ). (9) p p At the start of the earnng procedure, = 0, the earnng rate s set to a sma postve vaue; e.g. the nta earnng rate was set to 0.00 n our experments. Then, the weghts are updated on-ne, for each pattern p, foowng the teratve scheme: w = w p p η E ( w ). (0) + p In (9),.,. stands for the usua nner product n n R, E s the pattern-based error measure and s the p E p correspondng gradent vector; η s the earnng rate, and, γ are the meta-earnng rates ( γ < γ ). γ < Meta-earnng rates are aso n use by other on-ne earnng schemes, such as n [], [30],[3],[33], and can tae varous forms dependng on the method. Prevous experments wth the new varant have shown that the scheme of Eq. (9) seems to provde addtona stabzaton n the cacuated vaues of the earnng rate, and 7

8 heps the stochastc gradent descent to exhbt fast convergence and hgh success rate [0]. In addton, the method s charactersed by ow storage requrements and nexpensve computatons, as t ony uses aready cacuated nformaton from the current, as we as the prevous teraton. The dea of consderng the gradent of the prevous teratons n a earnng rate adaptaton scheme has aso been proposed n the context of off-ne earnng. Partcuary, Jacobs n the deta-bar-deta agorthm, [], measures the runnng average of the current, E( w ), and past parta dervatves n order to chec whether the current gradent has the same sgn as the average gradent. Then the agorthm ether ncreases the earnng rate by addng a postve constant to the current vaue, or decreases t by mutpyng the current vaue wth a postve, smaer than one, constant. Fnay, the weghts are updated usng a varant of Eq. (8), as the deta-bar-deta agorthm needs nformaton from the whoe tranng set (.e. t performs batch earnng). The on-ne teratve scheme of (9)-(0) was shown to provde ncreased speed and hgher possbty of good performance n dfferent casses of probems when compared aganst the cassc on-ne BP and other metaearnng rate agorthms (see [0], [5] for detas and comparsons). The roe of on-ne BP n the context of computer-asssted coonoscopc dagnoss s to ntase the popuaton of the DE strategy wth an nta approxmaton of the souton, as w be descrbed beow. 4. DIFFERENTIAL EVOLUTION STRATEGY Evouton Strateges (ESs) are adaptve stochastc search methods that mmc the metaphor of natura boogca evouton. The man dfferences between ESs and Genetc Agorthms e n that the sefadaptaton of the mutaton operator s a ey feature of the ESs, and n that GAs prefer smaer mutaton probabty (rate) [], [9]. Here we use the Dfferenta Evouton strateges, whch have been desgned as stochastc parae drect search methods that can hande non-dfferentabe, non-near and mutmoda obectve functons effcenty, and requre few easy chosen contro parameters [3]. Expermenta resuts have shown that DE strateges have good convergence propertes and outperform other evoutonary agorthms and anneang methods [3]. To appy DE strateges to neura networ tranng we start wth a specfc number (NP) of n-dmensona weght vectors, as nta popuaton, and evove them over tme; NP s fxed throughout the tranng process and the weght popuaton s ntased by perturbng the approxmate souton provded by the on-ne BP (see Reatons (9)-(0)). Thus, the on-ne BP seeds the DE, so the nta popuaton mght be generated by addng normay dstrbuted random devatons to the nomna souton. Let us now descrbe the proposed verson of DE strategy that s used n the on-ne evouton strategy. The weght vectors evove randomy wth each pattern presentaton (teraton) through the reaton v + ( w w + w w ), =, KNP = w + µ, () best r r 8

9 where w s the best popuaton member of the prevous teraton, µ > 0 s a rea parameter (mutaton best constant) whch reguates the contrbuton of the dfference between weght vectors, and vectors randomy chosen from the popuaton wth {,, K,, + NP} w, r w r are weght r, r, K,,.e. r, r are random ntegers mutuay dfferent from the runnng ndex. Amng at ncreasng the dversty of the weght vectors further, a crossover-type operaton s ntroduced n Reaton (). Thus, the so-caed tra vector, u +, =,K NP, s generated. u +, + v, = w, f f r ρ r > ρ or and = rand. () rand Ths operaton wors as foows: the mutant weght vectors, v +, =, KNP, are mxed wth the target vectors, w. Specfcay, we randomy choose a rea number r n the nterva [0,] for each component, =,,, n, of + v. Ths number s compared wth ρ [0, ] (crossover constant), and f r ρ then the -th + + component of the tra vector u gets the vaue of the -th component of the mutant vector, ; otherwse, t gets the vaue of the -th component of the target vector, w. In (), rand s a randomy seected ndex that s used to ensure the tra vector has at east one component from the mutant vector. An appcaton exampe of ths operaton s shown n Fgure 4 for a seven-dmensona weght vector. v w v ρ target vector, mutant vector, tra vector, Fgure 4. Iustraton of the crossover operaton. r u The tra vector s accepted for the next teraton f and ony f t reduces the vaue of the pattern-based error measure ; otherwse the od vaue,, s retaned. Ths ast operaton, caed seecton, ensures that the E p w ftness starts steady decreasng at some teraton, and s descrbed n Reaton (3). + + u f E ( u ) < E ( w ) + p p w = + (3) w f E ( u ) E ( w ) p p 9

10 The combned acton of mutaton and crossover operaton s responsbe for much of the effectveness of DE search, and aows DE strateges to act as parae, nose-toerant h-cmbng agorthms, whch effcenty search the whoe space for soutons [3]. 5. EXPERIMENTS AND RESULTS In our experments, the coonoscopy mages and vdeo frames were separated nto wndows of sze 6 6 pxes wth overap of 8 pxes. Then the co-occurrence matrces agorthm was apped to gather nformaton regardng pxe neghbourhoods of randomy seected mage wndows, as descrbed n Secton. The procedure resuts n 6-dmensona feature vectors, whch are very nosy as no pre-fterng or segmentaton technques s apped, and are used n the experments descrbed beow. The earnng parameters of the onne evouton strategy have been set foowng the recommendatons of [5] and [3]: γ = 0.05, γ = 0. 95, µ = 0.5, ρ = 0.9. Lasty, NP=00. (a) (b) Fgure 5. Coonoscopy mages used n the experments. In the frst set of experments, 000 MLPs wth varyng number of hdden nodes (from 8 to ) were traned usng two batch earnng agorthms, the Adaptve earnng rate Bacpropagaton (ABP) proposed by Vog [36], and the Levenberg-Marquardt (LM) method [7], as typca exampes of frst- and second- order tranng agorthms respectvey. The MLPs were traned usng 0 norma/0 abnorma sampes from mage wndows that were randomy extracted from mages (a) and (b) (see Fgure 5) and tested wth dfferent tssue sampes taen from the two mages. Note that the magnant regons n these mages beong to two dfferent types: Image (a) s a ow grade cancer, whe Image (b) s a moderatey dfferentated carcnoma [5]. The performance of the traned MLPs has been tested on a set of 80 texture sampes (40 norma and 40 magnant) randomy seected from the two mages and dfferent from the tranng set. Ony a sma sampe out of 000 traned MLPs of the dfferent archtectures exhbted cassfcaton success of 90% or hgher. Detaed resuts are shown n Fgure 6. More specfcay, ony 50 MLPs wth 8 hdden nodes, out of the 000 traned, exhbted the desred cassfcaton success (see Fgure 6, eft part). Note aso the sgnfcant dfference n the number of the MLPs wth acceptabe cassfcaton success among the ABP and the LM traned ones. The LM agorthm aso reveas a hgher average percentage of cassfcaton success, as shown 0

11 on the rght part of Fgure 6. In fact MLPs wth hdden nodes exhbt the hghest average n cassfcaton success (96.75%). Thus, hdden node MLPs were used n the second set of experments LM traned MLPs ABP traned MLPs ABP LM Number of MLPs out of Number of hdden nodes Average cassfcaton success Number of hdden nodes Fgure 6. Number of MLPs (out of 000) wth cassfcaton success greater than 89% (eft), and average cassfcaton success (rght) for these MLPs. Resuts are for the mages of Fgure 5. In the second set of experments, 000 MLPs of 6-- archtecture were traned off-ne to detect magnant regons n a frame of coonoscopy vdeo sequence usng a tranng set of 50 norma/50 abnorma patterns. Three batch-earnng methods were comparatvey evauated n ths round of experments: the Levenberg-Marquardt that exhbted good performance n the prevous round, the Scaed Conugate Gradent (SCG) method, [], that s consdered accordng to the terature as a good aternatve to the use of second-order methods [7], and the Rprop agorthm, [5], whch s a frst-order method that appes heurstcs to adapt a dfferent earnng rate for each weght of the networ and combnes successfuy effectveness wth ow computatona requrements [7]. The percentage of cassfcaton success n testng (test set ncuded 3969 patterns,.e. the whoe regon covered n the vdeo frame) for the 000 traned networs s shown n Fgure 7. One can observe that t s not easy to ocate weghts that w aow the networs to detect magnant regons wth a success of over 90%. For exampe, n Fgure 7, ony networs out of the 000 traned wth the Rprop agorthm acheved recognton success from 90% to 00%. For the SCG method the correspondng number s 3 out of 000, whe for the LM method ths number s sghty hgher, as 6 out of the 000 networs exhbted cassfcaton success between 90% and 00%. The best resut for each tranng method s: 9% for the Rprop, 9.4% for the LM and 9.6% for the SCG. Rprop needs on average more epochs to converge than the SCG and LM methods but does not requre heavy matrx computatons or submnmsatons. As a consequence, t was observed that the average tme for tranng wth Rprop was shorter than the correspondng tme of SCG or LM. Thus, we decded to eep Rprop and run experments wth data from other vdeo frames of the same vdeo sequence. The best resuts are summarsed n Tabe.

12 700 Number of traned networs Rprop L-M SCG Percentage of cassfcaton succes n testng Fgure7. Generasaton resuts for three batch-tranng agorthms. From the resuts of Tabe, t s cear that Rprop exhbts the best overa performance compared wth ABP. Note that the resuts of Tabes have been acheved by tranng off-ne frame-dedcated MLPs wth hdden nodes usng 300 patterns randomy chosen from each frame and testng usng data of the same frame. Method Frame Frame Frame 3 Frame 4 Rprop 9% 9% 9% 93% ABP 8% 85% 83% 8% Tabe. Best cassfcaton success for two frst order batch-earnng methods. In the thrd set of experments, the Rprop agorthm was compared wth the cassc on-ne BP usng data from another frame of the same vdeo sequence. 300 patterns were used for tranng and 3969 for testng (.e. the whoe tssue regon covered n the frame). The capabty of the traned networ (6-- MLPs were used) wth the best performance n assgnng approprate charactersatons (norma/abnorma) to frame regons s shown n Tabe. Method Abnorma (%) Norma (%) Mean (%) Rprop On-ne BP Tabe. Best performance n terms of generasaton for Rprop and on-ne BP. The Rprop reveas, n genera, a hgher percentage of success than the on-ne BP. The reader shoud, of course, eep n mnd that Rprop mnmses a batch error measure,.e. t uses the true gradent of the error functon as t expots nformaton from a the tranng patterns. The on-ne BP, on the other hand, mnmses a pattern-based error measure and wors wth an nstantaneous approxmaton of the true gradent because nformaton from ony one pattern s used at each teraton. Therefore, on-ne BP can be used for

13 (re-)adaptng to modfed envronment condtons, whe Rprop requres a nformaton about nput-output patterns to be nown a pror and, thus, fas to wor when a the reevant features of the envronment are not expcty defned n advance. However, the resuts of the experments made cear that the cassc on-ne BP needs further mprovement n order to tran networs to detect magnant regons wth accuracy comparabe to batch tranng methods. In the fourth set of experments, 6-- MLPs have been traned on-ne to detect magnant regons n a set of four frames from the same vdeo sequence. The frames used n the two prevous experments were ncuded n the set. The networs have been traned on-ne, foowng the teratve scheme (9) for adaptng the earnng rate, to recognse patterns from the frst frame. Then on-ne earnng wth dfferenta evouton occurred as data from the second frame appeared at the nput. The on-ne evouton earnng strategy contnuousy adapts the networ as patterns from other frames are presented n random order at the nput. In tota, 00 patterns from the four frames of the vdeo sequence were presented to the networ durng the tranng phase. The networ was then tested usng 5876 patterns from the four frames (4000 patterns approxmatey cover the whoe tssue regon of a frame and ncude norma as we as magnant areas). The average capabty of the traned networs n assgnng approprate charactersatons to expored coon nng regons s presented n Tabe 3. Method Frame Frame Frame 3 Frame 4 On-ne BP 83% 84% 77% 88% On-ne BP seeded DE 93% 9% 84% 90% Tabe 3. Norma/abnorma detecton accuracy. The on-ne BP seeded DE scheme provdes generasaton resuts cose to the best resuts obtaned by the batch tranng methods, as reported n the prevous experments. For exampe, the best SCG-traned dedcated networ n the second experment (traned off-ne and tested usng data from Frame ) had 9.6% success, and the best Rprop-traned dedcated networ n the thrd experment (traned off-ne and tested usng data from Frame ) had 93% success. 6. CONCLUSIONS AND FUTURE WORK In ths paper a new scheme for neura networ-based coonoscopc dagnoss was ntroduced. The proposed on-ne evouton strategy can be consdered as a hybrd agorthm. It uses an on-ne Bacpropagaton strategy wth adaptve earnng rate to seed the nta popuaton of the on-ne Dfferenta Evouton strategy. In our experments, neura networs traned wth the proposed on-ne evouton strategy exhbted satsfactory performance under changng envronmenta condtons, as data from dfferent frames were presented to the networ. 3

14 In the reported experments no emphass was put n fne-tunng the heurstc parameters of our scheme; cassc vaues found n the reevant terature of Dfferenta Evouton strategy were used nstead. In future wor we w fuy nvestgate the propertes, study the effect of the heurstc parameters and evauate the fu potenta of the hybrd earnng strategy n coonoscopc dagnoss by means of extensve testng on ong vdeo sequences and nterpretaton of compex tssue regons. ACKNOWLEDGEMENTS The authors gratefuy acnowedge the contrbuton of Dr. S. Karans (Technoogca Educatona Insttute of Lama, Greece) and D. Iaovds (Unversty of Athens, Greece) n the acquston of vdeo sequences and extracton of features. REFERENCES [] Ameda, L.B., Langos, T., Amara, J.D., and Panhov, A. (998). Parameter adaptaton n stochastc optmsaton, n On-ne Learnng n Neura Networs, Saad, D. (ed.), -34, Cambrdge Unversty Press. [] Angene, P. (997). Tracng extrema n dynamc envronments ', 6th Annua Conference on Evoutonary Programmng VI, , Sprnger. [3] Anguta D. (00). Smart adaptve systems: state of the art and future drectons of research, n Proceedngs of the European Symposum on Integent Technooges, Hybrd Systems and ther Impementaton on Smart Adaptve Systems-EUNITE 00, Tenerfe, Span, -4. [4] Battt, R. (99). Frst- and second-order methods for earnng: between steepest descent and Newton's method, Neura Computaton, 4, [5] Deaney, P.M., Papworth, G.D., and Kng, R.G. (998). Fbre optc confoca magng (FOCI) for n vvo subsurface mcroscopy of the coon, n Methods n dsease: Investgatng the gastrontestna tract, Preedy V.R., Watson R.R. (eds.), Greenwch Medca Meda, London, UK. [6] Douams, A.D., Douams, N.D., and Koas, S.D. (000). On-ne retranabe neura networs: mprovng the performance of neura networs n mage anayss probems, IEEE Transactons on Neura Networs,, [7] Hagan, M., Menha M. (994). Tranng feedforward networs wth the Marquardt agorthm, IEEE Transcactons on Neura Ntewors, 5, [8] Hana, R., Harte, T.P., Dxon, A.K., Lomas, D.J., and Brtton, P.D. (996). Neura networs n the nterpretaton of contrast-enhanced magnetc resonance mages of the breast, Heathcare Computng 996, Harrogate, UK, [9] Harac, R.M. (979). Statstca and structura approaches to texture, IEEE Proc., 67, [0] Innocent, P.R., Barnes, M., and John, R. (997). Appcaton of the fuzzy ART/MAP and MnMax/MAP neura networ modes to radographc mage cassfcaton, Artfca Integence n Medcne,, [] Jacobs R. (988). Increased rates of convergence through earnng rate adaptaton, Neura Networs,, (4),

15 [] Karans, S., Magouas, G.D., and Theofanous N. (000). Image recognton and neurona networs: Integent systems for the mprovement of magng nformaton, Mnmay Invasve Therapy and Aed Technooges, 9, [3] Karans S.A., Magouas G.D., Iaovds D.K., Karras D.A. and D.E.Marous, Evauaton of Textura Feature Extracton Schemes for Neura Networ-based Interpretaton of Regons n Medca Images, Proceedngs of IEEE Internatona Conference on Image Processng, Thessaon, Greece, October 7-0, 00. [4] Kwoh, C.K. (995). Probabstc reasonng from correated obectve data, Ph.D. Thess, Impera Coege, London, UK. [5] Kudo, S.E., Kashda, H., Tamura, T., Kogure, E., Ima, Y., Yamano, H., and Hart, A.R. (000). Coonoscopc dagnoss and management of nonpoypod eary coorecta cancer, Word Journa of Surgery, vo. 4, no. 9, pp , 000. [6] Leondes, C.T. (998). Image Processng and Pattern Recognton, Neura Networ Systems Technques and Appcatons Seres, 5, Academc Press. [7] Looney, C.G. (997). Pattern recognton usng neura networs, Oxford Unversty Press, Oxford, UK. [8] Magouas G. D., Vrahats M. N., Grapsa T. N., and Androuas G. S. (997). Neura networ supervsed tranng based on a dmenson reducng method, n S. W. Eacot, J. C. Mason and I. J.Anderson, eds., Mathematcs of Neura Networs: Modes, Agorthms and Appcatons, pp , Kuwer. [9] Magouas, G.D., Vrahats, M.N., and Androuas, G.S. (999). Improvng the convergence of the bacpropagaton agorthm usng earnng rate adaptaton methods, Neura Computaton,, [0] Magouas, G.D., Paganaos, V.P., and Vrahats, M.N. (00). Adaptve stepsze agorthms for onne tranng of neura networs, Nonnear Anayss: Theory, Methods and Appcatons, 47, [] Möer, M. (993). A scaed conugate gradent agorthm for fast supervsed earnng, Neura Networs, 6, [] Nagata, S., Tanaa, S., Haruma, K., Yoshhara, M., Sum, K., Kayama, G., and Shmamoto, F. (000). Pt pattern dagnoss of eary coorecta carcnoma by magnfyng coonoscopy: cnca and hstoogca mpcatons, Internatona Journa of Oncoogy, 6, [3] Phee, S.J., Ng, W.S., Chen, I.M., Seow-Choen, F., and Daves, B.L. (998). Automaton of coonoscopy part II: Vsua-contro aspects, IEEE Engneerng n Medcne and Boogy, [4] Paganaos, V.P., Magouas, G.D., and Vrahats, M.N. (00). Supervsed tranng usng goba search methods, n Advances n convex anayss and goba optmsaton, Hadsavvas, N.; Pardaos, P. (eds.), vo. 54, Noncovex Optmzaton and ts Appcatons, Kuwer Academc Pubshers, Dordrecht, The Netherands, pp [5] Paganaos V.P., Magouas G.D. and Vrahats M.N. (00). Learnng rate adaptaton n stochastc gradent descent, n Advances n Convex Anayss and Goba Optmzaton, Hadsavvas N.; Pardaos P. (eds.), vo. 54, Noncovex Optmzaton and ts Appcatons, Kuwer Academc Pubshers, Dordrecht, The Netherands, pp [6] Redmer, M. and Braun, H. (993). A drect adaptve method for faster bac-propagaton earnng: the Rprop agorthm ', n Proceedngs of IEEE Internatona Conference on Neura Networs, San Francsco, [7] Roeh, N.M. and Pedrera, C.E. (00). An onne earnng approach: a methodoogy for tme varyng appcatons, Neura Computng and Appcatons, 0, [8] Saad, D. (998). On-ne earnng n neura networs, Cambrdge Unversty Press. 5

16 [9] Saomon, R. and Eggenberger, P. (998). Adaptaton on the evoutonary tme scae: a worng hypothess and basc experments, n Proceedngs of the 3 rd European Conference on Artfca Evouton (AE'97), Nmes, France, Lecture Notes n Computer Scence vo. 363, Sprnger. [30] Schraudoph, N.N. (998). Onne oca gan adaptaton for mut-ayer perceptrons, Technca Report, IDSIA-09-98, IDSIA, Lugano, Swtzerand. [3] Schraudoph, N.N. (999). Loca gan adaptaton n stochastc gradent descend, Technca Report, IDSIA-09-99, IDSIA, Lugano, Swtzerand. [3] Storn, R. and Prce, K. (997). Dfferenta evouton: a smpe and effcent heurstc for goba optmzaton over contnuous spaces, Journa of Goba Optmzaton,, [33] Sutton, R.S. (99). Adaptng bas by gradent descent: an ncrementa verson of deta-bar-deta, n Proceedngs of the 0 th Natona Conference on Artfca Integence, MIT Press, [34] Sutton, R.S. and Whtehead, S.D. (993). Onne earnng wth random representatons, n Proceedngs of the 0 th Internatona Conference on Machne Learnng, Morgan Kaufmann, [35] Vava, F. and Fogarty, T.C. (996). A comparatve study of steady state and generatona genetc agorthms, Evoutonary Computng: AISB Worshop, Lecture Notes n Computer Scence vo. 43, Sprnger. [36] Vog, T. P., Mangs, J. K., Rger, A. K., Zn, W. T., and Aon, D. L. (988). Acceeratng the convergence of the bac-propagaton method, Boogca Cybernetcs, 59,

Neural network-based colonoscopic diagnosis using on-line learning and differential evolution

Neural network-based colonoscopic diagnosis using on-line learning and differential evolution Appled Soft Computng xxx (2004) xxx xxx Neural network-based colonoscopc dagnoss usng on-lne learnng and dfferental evoluton George D. Magoulas a,, Vassls P. Plaganakos b,1, Mchael N. Vrahats b,1 a School

More information

An Ensemble Classification Framework to Evolving Data Streams

An Ensemble Classification Framework to Evolving Data Streams Internatona Journa of Scence and Research (IJSR) ISSN (Onne): 39-7064 An Ensembe Cassfcaton Framework to Evovng Data Streams Naga Chthra Dev. R MCA, (M.Ph), Sr Jayendra Saraswathy Maha Vdyaaya, Coege of

More information

Multi-agent System for Custom Relationship Management with SVMs Tool

Multi-agent System for Custom Relationship Management with SVMs Tool Mut-agent System for Custom Reatonshp Management wth SVMs oo Yanshan Xao, Bo Lu, 3, Dan Luo, and Longbng Cao Guangzhou Asan Games Organzng Commttee, Guangzhou 5063, P.R. Chna Facuty of Informaton echnoogy,

More information

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods Predcton of Success or Fa of on Dfferent Educatona Maors at the End of the Hgh Schoo th Artfca Neura Netors Methods Sayyed Mad Maznan, Member, IACSIT, and Sayyede Azam Aboghasempur Abstract The man obectve

More information

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population Cardovascuar Event Rsk Assessment Fuson of Indvdua Rsk Assessment Toos Apped to the Portuguese Popuaton S. Paredes, T. Rocha, P. de Carvaho, J. Henrques, J. Moras*, J. Ferrera, M. Mendes Abstract Cardovascuar

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Clustering based Two-Stage Text Classification Requiring Minimal Training Data

Clustering based Two-Stage Text Classification Requiring Minimal Training Data OI: 10.2298/CSIS120130044Z Custerng based Two-Stage Text Cassfcaton Requrng Mnma Tranng ata Xue Zhang 1,2 and Wangxn Xao 3,4 1 Key Laboratory of Hgh Confdence Software Technooges, Mnstry of Educaton, Pekng

More information

An Efficient Job Scheduling for MapReduce Clusters

An Efficient Job Scheduling for MapReduce Clusters Internatona Journa of Future Generaton ommuncaton and Networkng, pp. 391-398 http://dx.do.org/10.14257/jfgcn.2015.8.2.32 An Effcent Job Schedung for MapReduce usters Jun Lu 1, Tanshu Wu 1, and Mng We Ln

More information

A Resources Allocation Model for Multi-Project Management

A Resources Allocation Model for Multi-Project Management A Resources Aocaton Mode for Mut-Proect Management Hamdatou Kane, Aban Tsser To cte ths verson: Hamdatou Kane, Aban Tsser. A Resources Aocaton Mode for Mut-Proect Management. 9th Internatona Conference

More information

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties*

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties* Predctve Contro of a Smart Grd: A Dstrbuted Optmzaton Agorthm wth Centrazed Performance Propertes* Phpp Braun, Lars Grüne, Chrstopher M. Keett 2, Steven R. Weer 2, and Kar Worthmann 3 Abstract The authors

More information

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers Approxmaton Agorthms for Data Dstrbuton wth Load Baancng of Web Servers L-Chuan Chen Networkng and Communcatons Department The MITRE Corporaton McLean, VA 22102 chen@mtreorg Hyeong-Ah Cho Department of

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

Predicting Advertiser Bidding Behaviors in Sponsored Search by Rationality Modeling

Predicting Advertiser Bidding Behaviors in Sponsored Search by Rationality Modeling Predctng Advertser Bddng Behavors n Sponsored Search by Ratonaty Modeng Hafeng Xu Centre for Computatona Mathematcs n Industry and Commerce Unversty of Wateroo Wateroo, ON, Canada hafeng.ustc@gma.com Dy

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

TCP/IP Interaction Based on Congestion Price: Stability and Optimality

TCP/IP Interaction Based on Congestion Price: Stability and Optimality TCP/IP Interacton Based on Congeston Prce: Stabty and Optmaty Jayue He Eectrca Engneerng Prnceton Unversty Ema: jhe@prncetonedu Mung Chang Eectrca Engneerng Prnceton Unversty Ema: changm@prncetonedu Jennfer

More information

SUPPORT VECTOR MACHINE FOR REGRESSION AND APPLICATIONS TO FINANCIAL FORECASTING

SUPPORT VECTOR MACHINE FOR REGRESSION AND APPLICATIONS TO FINANCIAL FORECASTING SUPPORT VECTOR MACHINE FOR REGRESSION AND APPICATIONS TO FINANCIA FORECASTING Theodore B. Trafas and Husen Ince Schoo of Industra Engneerng Unverst of Okahoma W. Bod Sute 4 Norman Okahoma 739 trafas@ecn.ou.edu;

More information

Research on Single and Mixed Fleet Strategy for Open Vehicle Routing Problem

Research on Single and Mixed Fleet Strategy for Open Vehicle Routing Problem 276 JOURNAL OF SOFTWARE, VOL 6, NO, OCTOBER 2 Research on Snge and Mxed Feet Strategy for Open Vehce Routng Probe Chunyu Ren Heongjang Unversty /Schoo of Inforaton scence and technoogy, Harbn, Chna Ea:

More information

Off-line and on-line scheduling on heterogeneous master-slave platforms

Off-line and on-line scheduling on heterogeneous master-slave platforms Laboratore de Informatque du Paraésme Écoe Normae Supéreure de Lyon Unté Mxte de Recherche CNRS-INRIA-ENS LYON-UCBL n o 5668 Off-ne and on-ne schedung on heterogeneous master-save patforms Jean-Franços

More information

Factored Conditional Restricted Boltzmann Machines for Modeling Motion Style

Factored Conditional Restricted Boltzmann Machines for Modeling Motion Style Factored Condtona Restrcted Botzmann Machnes for Modeng Moton Stye Graham W. Tayor GWTAYLOR@CS.TORONTO.EDU Geoffrey E. Hnton HINTON@CS.TORONTO.EDU Department of Computer Scence, Unversty of Toronto, Toronto,

More information

Hacia un Modelo de Red Inmunológica Artificial Basado en Kernels. Towards a Kernel Based Model for Artificial Immune Networks

Hacia un Modelo de Red Inmunológica Artificial Basado en Kernels. Towards a Kernel Based Model for Artificial Immune Networks Haca un Modeo de Red Inmunoógca Artfca Basado en Kernes Towards a Kerne Based Mode for Artfca Immune Networs Juan C. Gaeano, Ing. 1, Fabo A. Gonzáez, PhD. 1 Integent Systems Research Lab, Natona Unversty

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center 56 IEICE TRANS. COMMUN., VOL.E96 B, NO. JANUARY 203 PAPER Speca Secton on Networ Vrtuazaton, and Fuson Patform of Computng and Networng Dynamc Vrtua Networ Aocaton for OpenFow Based Coud Resdent Data Center

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Swing-Free Transporting of Two-Dimensional Overhead Crane Using Sliding Mode Fuzzy Control

Swing-Free Transporting of Two-Dimensional Overhead Crane Using Sliding Mode Fuzzy Control Swng-Free Transportng of Two-Dmensona Overhead Crane Usng Sdng Mode Fuzzy Contro Dantong Lu, Janqang, Dongn Zhao, and We Wang Astract An adaptve sdng mode fuzzy contro approach s proposed for a two-dmensona

More information

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks A Smpe Congeston-Aware Agorthm for Load Baancng n Datacenter Networs Mehrnoosh Shafee, and Javad Ghader, Coumba Unversty Abstract We study the probem of oad baancng n datacenter networs, namey, assgnng

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL SIMPLIFYING NDA PROGRAMMING WITH PROt SQL Aeen L. Yam, Besseaar Assocates, Prnceton, NJ ABSRACf The programmng of New Drug Appcaton (NDA) Integrated Summary of Safety (ISS) usuay nvoves obtanng patent

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation Increasng Supported VoIP Fows n WMNs through n-based Aggregaton J. Oech, Y. Hamam, A. Kuren F SATIE TUT Pretora, South Afrca oechr@gma.com T. Owa Meraa Insttute Counc of Scentfc and Industra Research (CSIR)

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Adaptive Multi-Compositionality for Recursive Neural Models with Applications to Sentiment Analysis

Adaptive Multi-Compositionality for Recursive Neural Models with Applications to Sentiment Analysis Proceedngs of the Twenty-Eghth AAAI Conference on Artfca Integence Adapte Mut-Compostonaty for Recurse Neura Modes wth Appcatons to Sentment Anayss L Dong Furu We Mng Zhou Ke Xu State Key Lab of Software

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Comparison of workflow software products

Comparison of workflow software products Internatona Conference on Computer Systems and Technooges - CompSysTech 2006 Comparson of worfow software products Krasmra Stoova,Todor Stoov Abstract: Ths research addresses probems, reated to the assessment

More information

2) A single-language trained classifier: one. classifier trained on documents written in

2) A single-language trained classifier: one. classifier trained on documents written in Openng the ega terature Porta to mutngua access E. Francescon, G. Perugne ITTIG Insttute of Lega Informaton Theory and Technooges Itaan Natona Research Counc, Forence, Itay Te: +39 055 43999 Fax: +39 055

More information

Agglomeration economies in manufacturing industries: the case of Spain

Agglomeration economies in manufacturing industries: the case of Spain Aggomeraton economes n manufacturng ndustres: the case of Span Oga Aonso-Var José-María Chamorro-Rvas Xua Gonzáez-Cerdera Unversdade de Vgo October 001 Abstract: Ths paper anayses the extent of geographca

More information

1. Introduction. Graham Kendall School of Computer Science and IT ASAP Research Group University of Nottingham Nottingham, NG8 1BB gxk@cs.nott.ac.

1. Introduction. Graham Kendall School of Computer Science and IT ASAP Research Group University of Nottingham Nottingham, NG8 1BB gxk@cs.nott.ac. The Co-evoluton of Tradng Strateges n A Mult-agent Based Smulated Stock Market Through the Integraton of Indvdual Learnng and Socal Learnng Graham Kendall School of Computer Scence and IT ASAP Research

More information

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times Asymptotcay Optma Inventory Contro for Assembe-to-Order Systems wth Identca ead Tmes Martn I. Reman Acate-ucent Be abs, Murray H, NJ 07974, marty@research.be-abs.com Qong Wang Industra and Enterprse Systems

More information

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle The Dynamcs of Weath and Income Dstrbuton n a Neocassca Growth Mode * Stephen J. Turnovsy Unversty of Washngton, Seatte Ceca García-Peñaosa CNRS and GREQAM March 26 Abstract: We examne the evouton of the

More information

GRADIENT METHODS FOR BINARY INTEGER PROGRAMMING

GRADIENT METHODS FOR BINARY INTEGER PROGRAMMING Proceedns of the 4st Internatona Conference on Computers & Industra Enneern GRADIENT METHODS FOR BINARY INTEGER PROGRAMMING Chen-Yuan Huan¹, Ta-Chun Wan² Insttute of Cv Avaton, Natona Chen Kun Unversty,

More information

MACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION

MACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION MACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION R. SEULIN, F. MERIENNE and P. GORRIA Laboratore Le2, CNRS FRE2309, EA 242, Unversté

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

An artificial Neural Network approach to monitor and diagnose multi-attribute quality control processes. S. T. A. Niaki*

An artificial Neural Network approach to monitor and diagnose multi-attribute quality control processes. S. T. A. Niaki* Journal of Industral Engneerng Internatonal July 008, Vol. 4, No. 7, 04 Islamc Azad Unversty, South Tehran Branch An artfcal Neural Network approach to montor and dagnose multattrbute qualty control processes

More information

BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr

BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeong-bn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

An Analysis of Dynamic Severity and Population Size

An Analysis of Dynamic Severity and Population Size An Analyss of Dynamc Severty and Populaton Sze Karsten Wecker Unversty of Stuttgart, Insttute of Computer Scence, Bretwesenstr. 2 22, 7565 Stuttgart, Germany, emal: Karsten.Wecker@nformatk.un-stuttgart.de

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Gender Classification for Real-Time Audience Analysis System

Gender Classification for Real-Time Audience Analysis System Gender Classfcaton for Real-Tme Audence Analyss System Vladmr Khryashchev, Lev Shmaglt, Andrey Shemyakov, Anton Lebedev Yaroslavl State Unversty Yaroslavl, Russa vhr@yandex.ru, shmaglt_lev@yahoo.com, andrey.shemakov@gmal.com,

More information

CHAPTER 14 MORE ABOUT REGRESSION

CHAPTER 14 MORE ABOUT REGRESSION CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp

More information

Texture Analysis and Modified Level Set Method for Automatic Detection of Bone Boundaries in Hand Radiographs

Texture Analysis and Modified Level Set Method for Automatic Detection of Bone Boundaries in Hand Radiographs Texture Analyss and Modfed Level Set Method for Automatc Detecton of Bone Boundares n Hand Radographs Syaful Anam Graduate School of Scence and Engneerng Yamaguch Unversty Yamaguch, Japan Department of

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Using an Adaptive Fuzzy Logic System to Optimise Knowledge Discovery in Proteomics

Using an Adaptive Fuzzy Logic System to Optimise Knowledge Discovery in Proteomics Usng an Adaptve Fuzzy Logc System to Optmse Knowledge Dscovery n Proteomcs James Malone, Ken McGarry and Chrs Bowerman School of Computng and Technology Sunderland Unversty St. Peter s Way, Sunderland,

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Traffic-light a stress test for life insurance provisions

Traffic-light a stress test for life insurance provisions MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax

More information

The Application of Fractional Brownian Motion in Option Pricing

The Application of Fractional Brownian Motion in Option Pricing Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com

More information

Design and Development of a Security Evaluation Platform Based on International Standards

Design and Development of a Security Evaluation Platform Based on International Standards Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Design of Output Codes for Fast Covering Learning using Basic Decomposition Techniques

Design of Output Codes for Fast Covering Learning using Basic Decomposition Techniques Journal of Computer Scence (7): 565-57, 6 ISSN 59-66 6 Scence Publcatons Desgn of Output Codes for Fast Coverng Learnng usng Basc Decomposton Technques Aruna Twar and Narendra S. Chaudhar, Faculty of Computer

More information

Airport Investment Risk Assessment under Uncertainty

Airport Investment Risk Assessment under Uncertainty Word Academy of Scence, Engneerng and Technoogy Internatona Journa of Mathematca, Computatona, Physca, Eectrca and Computer Engneerng Vo:8, No:9, 2014 Arport Investment Rs Assessment under Uncertanty Eena

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

On-Line Trajectory Generation: Nonconstant Motion Constraints

On-Line Trajectory Generation: Nonconstant Motion Constraints 2012 IEEE Internatona Conference on Robotcs and Automaton RverCentre, Sant Pau, Mnnesota, USA May 14-18, 2012 On-Lne Trajectory Generaton: Nonconstant Moton Constrants Torsten Kröger Abstract A concept

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn

More information

XAC08-6 Professional Project Management

XAC08-6 Professional Project Management 1 XAC08-6 Professona Project anagement Ths Lecture: Tte s so manager shoud ncude a s management pan a document that gudes any experts agree Some faure project to Ba, ba, ba, ba Communcaton anagement Wee

More information

Evaluation of Coordination Strategies for Heterogeneous Sensor Networks Aiming at Surveillance Applications

Evaluation of Coordination Strategies for Heterogeneous Sensor Networks Aiming at Surveillance Applications Evaluaton of Coordnaton Strateges for Heterogeneous Sensor Networs Amng at Survellance Applcatons Edson Pgnaton de Fretas, *, Tales Hemfarth*, Carlos Eduardo Perera*, Armando Morado Ferrera, Flávo Rech

More information

Learning with Imperfections A Multi-Agent Neural-Genetic Trading System. with Differing Levels of Social Learning

Learning with Imperfections A Multi-Agent Neural-Genetic Trading System. with Differing Levels of Social Learning Proceedngs of the 4 IEEE Conference on Cybernetcs and Intellgent Systems Sngapore, 1-3 December, 4 Learnng wth Imperfectons A Mult-Agent Neural-Genetc Tradng System wth Dfferng Levels of Socal Learnng

More information

Study of Cloud Services Recommendation Model Based on Chord Ring

Study of Cloud Services Recommendation Model Based on Chord Ring Internatona Journa of New Technoogy and Research (IJNTR) ISSN:2454-4116 Voue-2 Issue-2 February 2016 Pages 01-05 Study of Coud Servces Recoendaton Mode Based on Chord Rng Chen L Qng-Tao Wu Jng Chen Abstract

More information

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate

More information

An Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks

An Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks 2007 Internatonal Conference on Convergence Informaton Technology An Adaptve and Dstrbuted Clusterng Scheme for Wreless Sensor Networs Xnguo Wang, Xnmng Zhang, Guolang Chen, Shuang Tan Department of Computer

More information

Business Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2

Business Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2 Busness Process Improvement usng Mult-objectve Optmsaton K. Vergds 1, A. Twar 1 and B. Majeed 2 1 Manufacturng Department, School of Industral and Manufacturng Scence, Cranfeld Unversty, Cranfeld, MK43

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM BARRIOT Jean-Perre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jean-perre.barrot@cnes.fr 1/Introducton The

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Intra-day Trading of the FTSE-100 Futures Contract Using Neural Networks With Wavelet Encodings

Intra-day Trading of the FTSE-100 Futures Contract Using Neural Networks With Wavelet Encodings Submtted to European Journal of Fnance Intra-day Tradng of the FTSE-00 Futures Contract Usng eural etworks Wth Wavelet Encodngs D L Toulson S P Toulson Intellgent Fnancal Systems Lmted Sute 4 Greener House

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers Journal of Computatonal Informaton Systems 7: 13 (2011) 4740-4747 Avalable at http://www.jofcs.com A Load-Balancng Algorthm for Cluster-based Mult-core Web Servers Guohua YOU, Yng ZHAO College of Informaton

More information

A Fast Incremental Spectral Clustering for Large Data Sets

A Fast Incremental Spectral Clustering for Large Data Sets 2011 12th Internatonal Conference on Parallel and Dstrbuted Computng, Applcatons and Technologes A Fast Incremental Spectral Clusterng for Large Data Sets Tengteng Kong 1,YeTan 1, Hong Shen 1,2 1 School

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Realistic Image Synthesis

Realistic Image Synthesis Realstc Image Synthess - Combned Samplng and Path Tracng - Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random

More information

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part

More information

A Multi-mode Image Tracking System Based on Distributed Fusion

A Multi-mode Image Tracking System Based on Distributed Fusion A Mult-mode Image Tracng System Based on Dstrbuted Fuson Ln zheng Chongzhao Han Dongguang Zuo Hongsen Yan School of Electroncs & nformaton engneerng, X an Jaotong Unversty X an, Shaanx, Chna Lnzheng@malst.xjtu.edu.cn

More information

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem REVISTA DE MÉTODOS CUANTITATIVOS PARA LA ECONOMÍA Y LA EMPRESA (12) Págnas 5 38 Dcembre de 2011 ISSN: 1886-516X DL: SE-2927-06 URL: http://wwwupoes/revmetcuant/artphp?d=51 Branch-and-Prce and Heurstc Coumn

More information

Testing and Debugging Resource Allocation for Fault Detection and Removal Process

Testing and Debugging Resource Allocation for Fault Detection and Removal Process Internatonal Journal of New Computer Archtectures and ther Applcatons (IJNCAA) 4(4): 93-00 The Socety of Dgtal Informaton and Wreless Communcatons, 04 (ISSN: 0-9085) Testng and Debuggng Resource Allocaton

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

A COLLABORATIVE TRADING MODEL BY SUPPORT VECTOR REGRESSION AND TS FUZZY RULE FOR DAILY STOCK TURNING POINTS DETECTION

A COLLABORATIVE TRADING MODEL BY SUPPORT VECTOR REGRESSION AND TS FUZZY RULE FOR DAILY STOCK TURNING POINTS DETECTION A COLLABORATIVE TRADING MODEL BY SUPPORT VECTOR REGRESSION AND TS FUZZY RULE FOR DAILY STOCK TURNING POINTS DETECTION JHENG-LONG WU, PEI-CHANN CHANG, KAI-TING CHANG Department of Informaton Management,

More information

A Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification

A Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification IDC IDC A Herarchcal Anomaly Network Intruson Detecton System usng Neural Network Classfcaton ZHENG ZHANG, JUN LI, C. N. MANIKOPOULOS, JAY JORGENSON and JOSE UCLES ECE Department, New Jersey Inst. of Tech.,

More information

Expressive Negotiation over Donations to Charities

Expressive Negotiation over Donations to Charities Expressve Negotaton over Donatons to Chartes Vncent Contzer Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh, PA 523, USA contzer@cs.cmu.edu Tuomas Sandhom Carnege Meon Unversty 5000 Forbes Avenue Pttsburgh,

More information