Colour-texture analysis of paintings using ICA filter banks

Size: px
Start display at page:

Download "Colour-texture analysis of paintings using ICA filter banks"

Transcription

1 Colour-texture nlysis of pintings using ICA filter nks Nnne vn Noord Tilurg University, Wrndeln 2, 5037 AB Tilurg, The Netherlnds Eri Postm Tilurg University, Wrndeln 2, 5037 AB Tilurg, The Netherlnds Ell Hendriks Vn Gogh Museum, Postus 75366, 1070 AJ Amsterdm, The Netherlnds Keywords: olour-texture nlysis, independent omponent nlysis, imge segmenttion, olour Astrt In humn nd omputer vision, the nlysis of visul texture is of pivotl relevne for ojet reognition nd sene understnding. The nlysis of texture defined y oth intensity nd olour vritions ontriutes to the utomti lssifition in stellite imges, medil imges, or food proessing. Biologilly motivted studies hve proposed Independent Component Anlysis (ICA) s model for the nlysis of olour texture in humn vision. To im of this pper is to determine the effetiveness of ICA for olour texture nlysis in omputer vision. The effetiveness of ICA on the segmenttion of pintings is ssessed in unsupervised nd supervised settings. The results re enourging nd suggest ICA to e suitle sis for olour texture nlysis. 1. Introdution Both in iologil nd rtifiil vision systems, visul texture provides n importnt ue for the reognition of ojets nd senes (Tueryn & Jin, 1993). Visul texture refers to the visul pperne of, for instne, textile or surfes. Texture nlysis enles the mesurement nd quntifition of visul texture. Two ommon pplitions of texture nlysis re texture lssifition nd texture segmenttion. In texture lssifition, imges or imge pthes re lssified into useful lsses. For instne, the texture of Copy- Appering in Proeedings of BENELEARN right 2013 y the uthor(s)/owner(s). piees of fruit my e lssified ording to the type of fruit. In texture segmenttion imges re sudivided into similrly-textured regions. For instne, texture segmenttion n e used to utomtilly sudivide stellite imges into different regions. Although texture is trditionlly nlysed y onsidering the sptil vrition in pixel intensity (grey sle vlues) (Tueryn & Jin, 1993), the pplition exmples given underline the ft tht most nturl textures re defined in terms of oth intensity nd olour (see, e.g., (Cheng et l., 2001)). Suh textures re lled olour textures (Drimren & Wheln, 2001). In reent yers, olour texture nlysis eme n tive reserh field. The min hllenge in this field is to find n effetive wy to integrte intensity nd olour ues in olour texture nlysis (Fernndez & Vnrell, 2012; Wng et l., 2011). The urrent study is prt of reserh projet tht ims to support pinting onservtors in their ssessments of the geing of pints. Pintings onsist of different types of pigment pplied to nvs. A highresolution digitl reprodution of pinting n e onsidered to form mixture of olour texture omponents, orresponding to the vrious pigments, rush strokes, nd the nvs. From signl- or imgeproessing perspetive, the prolem of reovering the omponents is so-lled lind soure seprtion prolem (Kleinsteuer & Shen, 2012). A widely used lgorithm for lind soure seprtion is Independent Component Anlysis (ICA) (Hyvärinen & Oj, 2000). ICA is onerned with finding n unmixing mtrix y whih mixed signl n e deomposed into its soure signls. Whtler, Lee, & Sejnowski (2001) showed tht ICA is iologilly plusile method for the nlysis of nt-

2 Colour-texture nlysis of pintings using ICA filter nks url senes nd tht ICA, when pplied to olour imges, yields integrted representtions of intensity nd olour informtion. Suh ICA representtions my e invoked s filter nks for olour texture nlysis (Jenssen & Eltoft, 2003; Chen et l., 2006). While filter nks for imge (or texture) segmenttion ommonly onsist of pre-defined Gor or Wvelet filters (Ni et l., 2013; Fn, 2012; Jin & Frrokhni, 1991; Wng et l., 2011). ICA-sed filter nks hve een shown to outperform Gor filters (Chen et l., 2006). To im of this pper is to determine the effetiveness of ICA for olour texture nlysis in oth n unsupervised nd supervised setting. Unsupervised ICAsed olour texture segmenttion hs een studied efore (Cheng et l., 2003), ut the uthors report only qulittive results. To the est of our knowledge, we re the first to study ICA-sed olour texture nlysis in supervised nd quntittive setting. The outline of the reminder of the ppers is s follows; in Setion 2 the ICA method is desried. Then, in Setion 3 the experimentl setup is desried, detiling the dtset, experiments nd evlution proedure. The experimentl results re presented in Setion 4 nd the disussion of the results nd onlusions re given in Setion Independent Component Anlysis for olour texture nlysis Our method for performing Independent Component Anlysis to olour texture nlysis onsists of two steps: (1) finding the independent omponents nd tret them s filters, nd (2) onvolving the ICA filters with n imge. In this work the fixed-point lgorithm FstICA y Hyvärinen nd Oj (2000) is used for ll ICA opertions. ICA is vrint of ftor nlysis tht diretly finds the independent omponents of ny non-gussin distriution (Hyvärinen & Oj, 1997) Finding the independent omponents The underlying ssumption of ICA is tht olletion of oserved signls or vetors x onsist of sttistilly independent omponents (Hyvärinen & Oj, 1997). These omponents re denoted y s, nd n e found y mens of liner trnsformtion of the oservtions x with weight mtrix W; s = Wx. (1) Although the weight mtrix W nd the independent omponents s re unknown, the mixing model n e rewritten s x = As, (2) where A represents the mixing mtrix. It is possile to estimte oth the mixing mtrix A nd the omponents s from the oserved signls x using n unsupervised lerning proedure. A is otined suh tht its (pseudo)inverse W multiplied y x i is n estimte of s i. In this work ICA is pplied to otin filter nk g i, onsisting of size D D 3 filters. A weight mtrix W is lerned for eh imge I i y pplying ICA to olletion of rndomly smpled pthes of size D D 3. Eh olletion onsists of fixed mount of 50, 000 imge pthes, smpled from its respetive imge I i. The resulting filter nk is onstruted y reshping eh row of weight mtrix W into D D 3 filter Convolving the ICA filters with n imge The otined filter nks re pplied y onvolving eh imge I i with its respetive filter nk g i s follows; G i (x, y, z) = I i (x, y, z) g i. (3) The outome of the onvolution n e summed ross ll dimensions in order to lulte the energy distriution s follows; f i = N M y=1 x=1 z=1 P G i (x, y, z). (4) The energy vlue desries how strong the intertion of filter is with the imge t given lotion. The energy distriution for two similr res is expeted to e more similr thn the energy distriution of two dissimilr res. The resulting feture mtrix f i onsists of MN g i mtrix, where eh row desries the energy distriution ross olour hnnels for given pixel. The size of the filter nk depends on how mny independent omponents re hosen. For our experiments we vried the numer of independent omponents depending on the olour spe nd for omprility to other results. 3. Experimentl setup The experimentl evlution of our ICA-sed olour texture nlysis method is performed y segmenting pinting into pints nd primed-nvs regions. Both

3 Colour-texture nlysis of pintings using ICA filter nks Figure 1. Duigny s Grden y Vn Gogh (1890). n unsupervised nd supervised setting will e exmined Dtset The dtset is extrted from digitl reprodution of pinting y Vn Gogh: Duigny s Grden, m pinting tht ws reted in Figure 1 shows reprodution of Duigny s Grden. The key hrteristi of this pinting is tht the primednvs is visile in some res of the pinting. Ground truth on these primed-nvs lotions is ville in the form of n imges-sized msk onsisting of inry lel for eh pixel of the imge of Duigny s Grden. The dtset onsists of rndom seletion of 50, 000 D D pthes (D = 8). The imges in I i onsist of two typil res of size , exmples shown in Figure 2, ropped from the high-resolution imge of Duigny s Grden Unsupervised setting We employ two unsupervised methods: k-mens lustering (Cheng et l., 2003) nd grph-sed lustering (Felzenszwl & Huttenloher, 2004), see lso (Peng et l., 2013). We pply k-mens lustering to the energy distriution f i otined y onvolving n imge with the filter nk. The vlue of k determines the extent of the segmented regions (lrge for low vlues of k nd smll for high vlues of k). Segmenting n imge in few lrge regions will often result in high rell, due to mny of the ground lyer pixels eing enpsulted inside the sme region. However, lrge regions re lso muh more orse, nd will thus ontin mny unwnted pixels, resulting in low preision. The enefit of hving few lrge regions is tht it is trivil to mnully selet the est regions. In our experiments, k ws set to 5, 10, nd 100. The grph-sed lustering method hs three djustle prmeters; σ, t nd min. The first prmeter σ is used to smooth the imge using Gussin filter efore segmenting it. The seond prmeter t whih is used to determine the sle of oservtion, higher vlue of t will result in lrger omponents. The third prmeter min is used during post-proessing to enfore minimum region size, preventing too mny smll regions. All experiments were performed with the reommended vlues of 0.8 for σ nd 20 for min. The vlue of t is vried etween the reommended vlue of 500 nd the, in preliminry experiments determined to e pproprite, vlue of Supervised setting Supervised lgorithms mke use of trining dt, or leled dt in order to lern model tht desries the dt nd llows for preditions to e mde out unseen smples. A supervised lssifier opertes y lerning mpping, for eh instne, of the fetures to the provided lel. For the experiments onduted the instnes re represented y single pixels. For eh instne the ground-truth is noted y inry lel, inditing whether or not it is prt of the ground lyer. The fetures onsist of the energy distriution f i. Idelly lssifier n e trined on suset of the dtset nd n e used to urtely segment n entire imge. Severl supervised lssifiers re evluted using stndrd k-fold ross vlidtion pproh whih divides the dt in trining nd test set Clssifiers Three lssifiers were used in order to tkle the prolem t hnd, nmely the MATLAB implementtions of the k-nerest neighour (k-nn), nive Byes, nd RUSBoost lssifiers. k-nn ssigns the unseen smples the (mjority) lel of the k nerest neighouring smples in the trining set (Hstie et l., 2003). For ll experiments desried in this pper the vlue of k ws kept t 1. Nive Byes is proilisti lssifier tht ssigns lels to unseen smple y using Byes rule (Hstie et l., 2003). RUSBoost is n ensemle lerner tht employs wek lerner, tree, nd is prtiulrly well-suited for deling with lss imlne (Seiffert et l., 2010). RUSBoost omines the AdBoost oosting proedure with rndom under-smpling in order to overome lss imlne, results re otined using 10,

4 Colour-texture nlysis of pintings using ICA filter nks () () Figure 2. Imge regions I () nd I () extrted from Duigny s Grden 50 nd 100 lerners Evlution The evlution of our olour texture nlysis method is split into n evlution proedure for the unsupervised setting nd one for the supervised setting. Unsupervised setting. The unsupervised setting my yield more thn two different regions. For instne, k-mens lssifier results in segmenttion into k different regions, lthough our tsk requires only inry segmenttion into nvs nd non-nvs regions. To del with this issue, we inlude only suset of the k regions, nmely those tht ontriute to the overll performne. A region ontriutes to the performne when the numer of true positives for region (rtp ) is greter thn the numer of flse positives for tht region (rf p ) multiplied y. As suh the solution to finding the est omintion of ll regions ri, rest eomes rest = {r 0 < (rtp rf p )}. (5) The vlue of ws optimised in preliminry experiments yielding vlue of Supervised setting. Two ommonly used mesures for evluting the performne of lssifition systems in supervised setting re preision nd rell, whih re lso used to evlute segmenttion performne (Mrtin et l., 2004). Preision is mesure of the orretness of the lssifition. Fewer mistkes led to higher preision. Rell is mesure of ompleteness. The preision of generted segmenttion is lulted y dividing the numer of pixels orretly lssified s ground lyer (true positives) y the totl numer of pixels lssified s ground lyer (true positive + flse tp positive), preision = tp+f p. Rell is lulted y dividing the true positives y the true positives nd the numer of ground lyer pixels tht were not lssified tp s suh (flse negtives), rell = tp+f n. As joint mesure of preision nd rell, we use the F mesure, whih is the (hrmoni) men of preision nd rell: F = 2 (preision rell)/(preision + rell). 4. Results We strt the presenttion of results y showing n exmple of the filter nk otined y pplying ICA to our dtset. Figure 3 is otined y reshping eh row of mtrix W into n-dimensionl filter (where n denotes the numer of olour hnnels). Evidently, the filters pture sptil nd olour informtion from the dtset Unsupervised results The results for the unsupervised experiments re presented in Tles 1 nd 2, for Figures 2() nd 2(), respetively. The fetures tht served s input for the unsupervised experiments were otined using filter nk of 64 filters, lerned from RGB pthes. For the initil experiments we hve hosen n under-omplete sis of 64 rther thn 192 independent omponents in order to filitte fir omprison with the results otined on grey sle imges. For the k-mens lgorithm lrger vlue of k results in higher F-sore nd preision. In the se of I the rell does not hnge muh when hnging the vlue of k. While for I smller vlues of k give etter result. A possile explntion for this n e found in the differene etween the imge regions. The perfor-

5 Colour-texture nlysis of pintings using ICA filter nks Tle 2. Results of unsupervised lgorithms on imge I Method k-mens grph-sed Setting k=5 k = 10 k = 100 t = 350 t = 500 F-sore preision rell () Figure 3. Exmple of ICA filter nk otined for D = 8. Tle 1. Results of unsupervised lgorithms on imge I Method k-mens grph-sed Setting k=5 k = 10 k = 100 t = 350 t = 500 F-sore preision rell mne of the grph-sed lgorithm improves with the lower t vlue. While the performne with the reommended vlue (t = 500) is on pr with k-mens (with k = 100), the lower vlue (t = 350) results in etter segmenttion. In Figure 4() the grey-sle result of the segmenttion using k-mens with k = 100 is shown, whih t first glne ppers to e more omplex thn the olour result of the grph-sed lgorithm shown in Figure 4(). However, every region in the output of the grph-sed lgorithm hs rndomly-ssigned lel, whih mens tht identil setions of the imge in different lotions will e leled differently. This is not the se for the k-mens lgorithm tht lels identil setions in onsistent wy. () Figure 4. Segmenttion result of Figure 2(), () is the outome of k-mens with k = 100, () is the outome of the grph-sed lgorithm. Eh setion is indited y unique olour Supervised results The results for the supervised experiments re presented in Tle 3 nd 4, for Figures 2() nd 2(), respetively. As with the results presented in Setion 4.1 the results shown in Tle 3 nd Tle 4 re the result of onvolutions with filters otined from the 64 independent omponents lerned from RGB imge pthes. The performne of the first lssifier, RUSBoost, is out the sme for oth imges. Inresing the numer of lerners, the min RUSBoost prmeter, results in lower rell, inditing tht upsling the numer of of lerners will eventully result in lower performne. Similrly to RUSBoost the height of the F-

6 Colour-texture nlysis of pintings using ICA filter nks Tle 3. Results of supervised lssifiers on imge I Clssifier RUSBoost(10) RUSBoost(50) RUSBOOST(100) Nive Byes 1-NN F-sore preision rell Tle 4. Results of supervised lssifiers on imge I Clssifier RUSBoost(10) RUSBoost(50) RUSBoost(100) Nive Byes 1-NN F-sore preision rell sore for Nive Byes stems lrgely from the high rell, with the preision eing very low. Inditing neither lssifier is le to urtely distinguish etween the different lsses nd thus ssigns the ground-lyer lel to too lrge regions. The preision nd rell of the k-nn lssifier re very similr, resulting in the highest F-sore mongst ll lssifiers onsidered. While the rell is lower ompred to the other lssifiers the higher preision indites tht the k-nn lssifier is ple of distinguishing etween the mjority of the ground-lyer pixels nd the rest of the pinting. 5. Disussion Figure 5. Imge region I extrted from Duigny s Grden Tle 5. F-sores of the preliminry supervised experiments. Pure refers to results without ny PCA preproessing, PCA(10) re results otined on the 10 remining fetures fter PCA. Filters Colour spe Grey ICA RGB LAB Grey Log-Gor LAB While the presented results re enourging we feel tht two points re not dequtely delt with, whih we ddress y presenting seletion of preliminry results of our ongoing experiments. The first point onerns the influene of the type of imge on the performne. In our urrent investigtions we employ imge regions, suh s I, shown in Figure 5. This imge hs stronger distintion etween the primed-nvs nd pint lyers thn imges I nd I. The seond point is the impt of type of filter nk, olour spes, nd numer of fetures, on segmenttion performne. In our studies we fous on new filter nks, suh s Log-Gor filters (Field, 1987), dditionl olour spes (e.g., grey-sle nd CIELAB), nd dimensionlity redution (using PCA). To provide n impression of how these vritions ffet the segmenttion performne, Tle 5 shows the results otined with the k-nn lssifier. The results Ii Pure PCA(10) on imge I re muh etter thn those on the other two imge regions. We suspet tht this is due to the greter distintion etween the lyers present in this imge, used y the inresed thikness of the pints pplied in this re, ompletely msking the underlying nvs. The Log-Gor filters generlly perform etter thn he ICA filters to degree tht depends on the settings. Dimensionlity redution is detrimentl for the Log-Gor filters, ut not for ICA. These preliminry results hint t diretions for future study. 6. Conlusion Our experiments show tht ICA in supervised setting yields etter results thn in n unsupervised set-

7 Colour-texture nlysis of pintings using ICA filter nks ting. This finding is not surprising, euse using the ground truth for modeling texturl differenes yields stronger model. More importntly, the k-nn performne otined with ICA is resonle nd results otined when nlysing olour texture outperform those otined on grey-sle texture. While Log-Gor filters show etter results in the setting without PCA, with PCA the ICA filters outperform the Log-Gor filters. Whih is notle s PCA drstilly redues the mount of time required y the lssifier. As we extend the method to the entire pinting, the size of the dtset inreses y ftor of 40, whih would put the required time well over wht would e fesile for ny prtil pplition. Furthermore, there is no differene etween the grey sle nd olour Log-Gor settings, whih implies tht the Log-Gor method does not effiiently inorporte the dditionl hromti informtion. Although we hve otined resonle performne on olour texture nlysis tsk using n ICA filter nk, there re two points of onern. First, it is unler to wht extent the omplexity of the tsk influenes the performne. A omprle experiment on pinting with less fine-grined distintion etween lyers would help in nswering this question. Seond, the inry leling of the trining dt might not hve een detiled enough for the lssifiers to lern ler distintion. Further experiments re required to determine whether riher leling of the trining dt would improve performne. Notwithstnding these onerns, our results re enourging nd suggest ICA to e suitle sis for olour texture nlysis. Future reserh will fous on exploring wys to improve lssifition performne y experimenting with onditionl rndom fields, other olour spes nd n extended dtset. We expet tht inorporting n intertive user feedk model will improve performne s well s e prtil solution to otin leled trining dt with reltively little effort. Aknowledgments The reserh reported in this pper is performed s prt of the REVIGO projet, funded y NWO in the ontext of the Siene4Arts reserh progrm. The uthors thnk the nonymous reviewers for their helpful omments. Referenes Chen, X.-w., Zeng, X., & vn Alphen, D. (2006). Multi-lss feture seletion for texture lssifition. Pttern Reognition Letters, 27, Cheng, H. D., Jing, X. H., Sun, Y., & Wng, J. L. (2001). Color imge segmenttion: Advnes nd prospets. Pttern Reognition, 34, Cheng, J., Chen, Y.-W., Lu, H., & Zeng, X.-Y. (2003). Color- nd texture-sed imge segmenttion using lol feture nlysis pproh. Pro. SPIE 5286, Third Interntionl Symposium on Multispetrl Imge Proessing nd Pttern Reognition, Drimren, A., & Wheln, P. F. (2001). Experiments in olour texture nlysis. Pttern Reognition Letters, 22, Fn, J. (2012). Feture lerning sed multi-sle wvelet nlysis for texturl imge segmenttion. In D. Jin nd S. Lin (Eds.), Advnes in omputer siene nd informtion engineering, vol. 168 of Advnes in Intelligent nd Soft Computing, Springer Berlin Heidelerg. Felzenszwl, P. F., & Huttenloher, D. P. (2004). Effiient grph-sed imge segmenttion. Interntionl Journl of Computer Vision, 59, Fernndez, S. A., & Vnrell, M. (2012). Texton theory revisited: g-of-words pproh to omine textons. Pttern Reognition, 45, Field, D. J. (1987). Reltions etween the sttistis of nturl imges nd the response properties of ortil ells. J. Opt. So. Am. A, 4, Hstie, T., Tishirni, R., & Friedmn, J. H. (2003). The Elements of Sttistil Lerning. Springer. Correted edition. Hyvärinen, A., & Oj, E. (1997). A fst fixed-point lgorithm for independent omponent nlysis. Neurl Computing Surveys, 9, Hyvärinen, A., & Oj, E. (2000). Independent omponent nlysis: lgorithms nd pplitions. Neurl Networks, 13, Jin, A. K., & Frrokhni, F. (1991). Unsupervised texture segmenttion using gor filters. Pttern Reognition, 24, Jenssen, R., & Eltoft, T. (2003). Independent omponent nlysis for texture segmenttion. Pttern Reognition, 36,

8 Colour-texture nlysis of pintings using ICA filter nks Kleinsteuer, M., & Shen, H. (2012). Blind soure seprtion with ompressively sensed liner mixtures. IEEE Signl Proessing Letters, 19, Mrtin, D. R., Fowlkes, C. C., & Mlik, J. (2004). Lerning to detet nturl imge oundries using lol rightness, olor, nd texture ues. IEEE Trnstions on Pttern Anlysis nd Mhine Intelligene, 26, Ni, W., Go, X., & Yn, W. (2013). Sr imge segmenttion sed on gor filter nk nd tive ontours. In J. Yng, F. Fng nd C. Sun (Eds.), Intelligent siene nd intelligent dt engineering, vol of Leture Notes in Computer Siene, Springer Berlin Heidelerg. Peng, B., Zhng, L., & Zhng, D. (2013). A survey of grph theoretil pprohes to imge segmenttion. Pttern Reognition, 46, Seiffert, C., Khoshgoftr, T. M., Vn Hulse, J., & Npolitno, A. (2010). Rusoost: A hyrid pproh to lleviting lss imlne. IEEE Trnstions on Systems, Mn, nd Cyernetis, Prt A, 40, Tueryn, M., & Jin, A. K. (1993). texture nlysis. In C. H. Chen, L. F. Pu nd P. S. P. Wng (Eds.), Hndook of pttern reognition & omputer vision, hpter Texture nlysis, River Edge, NJ, USA: World Sientifi Pulishing Co., In. Whtler, T., won Lee, T., & Sejnowski, T. J. (2001). The hromti struture of nturl senes. The Journl of the Optil Soiety of Ameri A, 18, Wng, X.-Y., Wng, T., & Bu, J. (2011). Color imge segmenttion using pixel wise support vetor mhine lssifition. Pttern Reognition, 44,

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

More information

[SYLWAN., 158(6)]. ISI

[SYLWAN., 158(6)]. ISI The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI

More information

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal

CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING

SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Chpter 17 SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Frnk Eihinger Institute for Progrm Strutures nd Dt Orgniztion (IPD) Universit-t Krlsruhe (TH), Germny eihinger@ipd.uk.de Klemens B-ohm Institute for

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Profile Based Sub-Image Search in Image Databases

Profile Based Sub-Image Search in Image Databases Profile Bsed Su-Imge Serh in Imge Dtses Vishwkrm Singh 1, Amuj K. Singh 2 Deprtment of Computer Siene, University of Cliforni, Snt Brr, USA 1 vsingh@s.us.edu, 2 muj@s.us.edu Astrt Su-imge serh with high

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1 Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE 24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR

More information

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition

More information

Single-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing

Single-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing SASIMI 2010 Proeedings (R3-8) Single-Lyer Trunk Routing Using 45-Degree Lines within Critil Ares for PCB Routing Kyosuke SHINODA Yukihide KOHIRA Atsushi TAKAHASHI Tokyo Institute of Tehnology Dept. of

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

An Approach to Filter the Test Data for Killing Multiple Mutants in Different Locations

An Approach to Filter the Test Data for Killing Multiple Mutants in Different Locations Interntionl Journl of Computer Theory nd Engineering, Vol. 5, No. 2, April 2013 An Approh to Filter the Test Dt for Killing Multiple Mutnts in Different Lotions Ngendr Prtp Singh, Rishi Mishr, Silesh Tiwri,

More information

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,

More information

Minimal Memory Abstractions

Minimal Memory Abstractions Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

Tiling Triangular Meshes

Tiling Triangular Meshes Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding Triple/Qudruple Ptterning Lyout Deomposition vi Novel Liner Progrmming nd Itertive Rounding Yio Lin, Xioqing Xu, Bei Yu, Ross Bldik nd Dvid Z. Pn ECE Dept., University of Texs t Austin, Austin, TX USA

More information

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup COSC 6374 Prllel Computtion Communition Performne Modeling (II) Edgr Griel Fll 2015 Overview Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition Impt of olletive ommunition

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

Lecture 13: Graphs I: Breadth First Search

Lecture 13: Graphs I: Breadth First Search Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry

More information

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing

More information

INTEGRATED WORKFLOW ART DIRECTOR

INTEGRATED WORKFLOW ART DIRECTOR ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures

More information

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model

More information

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its

More information

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs Lesson6: Modeling the We s grph Unit5: Liner Alger for grphs Rene Pikhrdt Introdution to We Siene Prt 2 Emerging We Properties Rene Pikhrdt Institute CC-BY-SA-3. for We Siene nd Tehnologies Modeling the

More information

Tracking Hidden Agents Through Shadow Information Spaces

Tracking Hidden Agents Through Shadow Information Spaces Trking Hidden Agents Through Shdow Informtion Spes Jingjin Yu Steven M. LVlle jyu@uiu.edu lvlle@uiu.edu Deprtment of Computer Siene University of Illinois Urn, IL 601 USA Astrt This pper ddresses prolems

More information

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS LETKF compred to 4DVAR for ssimiltion of surfce pressure oservtions in IFS Pu Escrià, Mssimo Bonvit, Mts Hmrud, Lrs Isksen nd Pul Poli Interntionl Conference on Ensemle Methods in Geophysicl Sciences Toulouse,

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Can Pythagoras Swim?

Can Pythagoras Swim? Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify

More information

Selecting the Most Highly Correlated Pairs within a Large Vocabulary

Selecting the Most Highly Correlated Pairs within a Large Vocabulary Seleting the Most Highl Correlted Pirs within Lrge Voulr Koji Umemur Deprtment of Computer Siene Toohshi Universit of Tehnolog umemur@tutistutjp Astrt Ourene ptterns of words in douments n e epressed s

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother

More information

Enterprise Digital Signage Create a New Sign

Enterprise Digital Signage Create a New Sign Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer

More information

Analysis of Fundus Fluorescein Angiogram Based on the Hessian Matrix of Directional Curvelet Sub bands and Distance Regularized Level Set Evolution

Analysis of Fundus Fluorescein Angiogram Based on the Hessian Matrix of Directional Curvelet Sub bands and Distance Regularized Level Set Evolution Originl Artile www.jmss.mui..ir Anlysis of Fundus Fluoresein Angiogrm Bsed on the Hessin Mtrix of Diretionl Curvelet Su nds nd Distne Regulrized Level Set Evolution Asieh Soltnipour 1, Seed Sdri 1,, Hossein

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network

A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network A Fst Dely Anlysis Algorithm for The Hyrid Strutured Clok Network Yi Zou 1, Yii Ci 1,Qing Zhou 1,Xinlong Hong 1, Sheldon X.-D. Tn 2 1 Deprtment of Computer Siene nd Tehnology, Tsinghu University, Beijing,

More information

Asymmetric Visual Hierarchy Comparison with Nested Icicle Plots

Asymmetric Visual Hierarchy Comparison with Nested Icicle Plots symmetri Visul Hierrhy Comprison with Nested Iile Plots Fin ek 1, Frnz-Josef Wiszniewsky 2, Mihel urh 1, Stephn Diehl 2, nd Dniel Weiskopf 1 1 VISUS, University of Stuttgrt, Germny 2 University of Trier,

More information

A distributed edit-compile workflow

A distributed edit-compile workflow Time Synhroniztion nd Logil Cloks Tody 1. The need for time synhroniztion 2. Wll lok time synhroniztion 3. Logil Time: Lmport Cloks COS 418: Distriuted Systems Leture 4 Kyle Jmieson 2 A distriuted edit-ompile

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Comparison of Global Histogram Methods for 2D and 3D Entropy Based Image Segmentation

Comparison of Global Histogram Methods for 2D and 3D Entropy Based Image Segmentation 9th WSEAS Interntionl Conferene on EVOLUTIONARY COMPUTING (EC 8, Sofi, Bulgri, My 2-4, 28 Comrison of Glol Histogrm Methods for 2D nd 3D Entroy Bsed Imge Segmenttion GEORGI PETROV (, PANAYOT ILIEV (2,

More information

Comparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells*

Comparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells* Comprison etween nmos Pss Trnsistor logi style vs. CMOS Complementry Cells* Rkesh Mehrotr, Mssoud Pedrm Xunwei Wu Dept. of E.E.-Systems Dept. of Eletroni Eng. University of Southern Cliforni Hngzhou University

More information

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees. 428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

Improving the Effectiveness of Self-Organizing Map Networks Using a Circular Kohonen Layer

Improving the Effectiveness of Self-Organizing Map Networks Using a Circular Kohonen Layer Improving the Effetiveness of Self-Orgnizing Mp Networks Using Cirulr Kohonen Lyer M.Y. King *, U.R. Kulkrni, M. Goul, A. Philippkis, R.T. Chi, & E. Turbn Division of Computer Informtion Systems Deprtment

More information

String comparison by transposition networks

String comparison by transposition networks String omprison y trnsposition networks Alexnder Tiskin (Joint work with Peter Krushe) Deprtment of Computer Siene University of Wrwik http://www.ds.wrwik..uk/~tiskin (inludes n extended version of this

More information

DETECTION OF SURFACE AND SUBSURFACE DEFECTS OF APPLES USING STRUCTURED-ILLUMINATION REFLECTANCE IMAGING WITH MACHINE LEARNING ALGORITHMS

DETECTION OF SURFACE AND SUBSURFACE DEFECTS OF APPLES USING STRUCTURED-ILLUMINATION REFLECTANCE IMAGING WITH MACHINE LEARNING ALGORITHMS An ASABE Meeting Presenttion DOI: https://doi.org/10.13031/im.201800536 Pper Numer: 1800536 DETECTION OF SURFACE AND SUBSURFACE DEFECTS OF APPLES USING STRUCTURED-ILLUMINATION REFLECTANCE IMAGING WITH

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

Incremental Design Debugging in a Logic Synthesis Environment

Incremental Design Debugging in a Logic Synthesis Environment Inrementl Design Deugging in Logi Synthesis Environment Andres Veneris Jing Brndon Liu University of Toronto Freesle Semiondutors Dept ECE nd CS High Performne Tools Group Toronto, ON M5S 3G4 Austin, TX

More information

Approximate Joins for Data Centric XML

Approximate Joins for Data Centric XML Approximte Joins for Dt Centri XML Nikolus Augsten 1, Mihel Böhlen 1, Curtis Dyreson, Johnn Gmper 1 1 Fulty of Computer Siene, Free University of Bozen-Bolzno Dominiknerpltz 3, Bozen, Itly {ugsten,oehlen,gmper}@inf.uniz.it

More information

Computational geometry

Computational geometry Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

Spectral Analysis of MCDF Operations in Image Processing

Spectral Analysis of MCDF Operations in Image Processing Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page. 6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem

More information

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over

More information

Lily Yen and Mogens Hansen

Lily Yen and Mogens Hansen SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst

More information

The Profile Editor: Designing a direct manipulative tool for assembling profiles

The Profile Editor: Designing a direct manipulative tool for assembling profiles The Profile Editor: Designing diret mnipultive tool for ssemling profiles Ptrik Budish Institute for Integrted Informtion nd Pulition Systems IPSI Germn Ntionl Reserh Center for Informtion Tehnology GMD

More information

McAfee Network Security Platform

McAfee Network Security Platform Pssive Fil-Open Kit Quik Strt Guide Revision D MAfee Network Seurity Pltform MAfee Network Seurity Pltform IPS Sensors, when deployed in-line, route ll inoming trffi through designted port pir. However,

More information

Inter-domain Routing

Inter-domain Routing COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit

More information

Agilent G3314AA BioConfirm Software

Agilent G3314AA BioConfirm Software Agilent G3314AA BioConfirm Softwre Quik Strt Guide Use this guide to instll nd get strted with the BioConfirm softwre. Wht is BioConfirm Softwre? Agilent G3314AA BioConfirm Softwre lets you onfirm the

More information

Algorithm Design (5) Text Search

Algorithm Design (5) Text Search Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:

More information

Taming Subgraph Isomorphism for RDF Query Processing

Taming Subgraph Isomorphism for RDF Query Processing Tming Sugrph Isomorphism for RDF Query Proessing Jinh Kim # jinh.kim@orle.om Hyungyu Shin hgshin@dl.posteh..kr Wook-Shin Hn wshn@posteh..kr Sungpk Hong # Hssn Chfi # {sungpk.hong, hssn.hfi}@orle.om POSTECH,

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

EVALUATING AND ANALYSING DYNAMIC PLAYLIST GENERATION HEURISTICS USING RADIO LOGS AND FUZZY SET THEORY

EVALUATING AND ANALYSING DYNAMIC PLAYLIST GENERATION HEURISTICS USING RADIO LOGS AND FUZZY SET THEORY 10th Interntionl Soiety for Musi Informtion Retrievl Conferene (ISMIR 09) EVALATING AND ANALYSING DYNAMIC PLAYLIST GENERATION HERISTICS SING RADIO LOGS AND FZZY SET THEORY Kls Bosteels Ghent niversity,

More information

TEMPLATE FOR ENTRY in Encyclopedia of Database Systems: GRID FILE. Yannis Manolopoulos

TEMPLATE FOR ENTRY in Encyclopedia of Database Systems: GRID FILE. Yannis Manolopoulos TEMPLATE FOR ENTRY in Enylopedi of Dtse Systems: GRID FILE Apostolos N. Ppdopoulos Ynnis Mnolopoulos Ynnis Theodoridis Vssilis Tsotrs Deprtment of Informtis Aristotle University of Thessloniki Thessloniki,

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

Journal of Combinatorial Theory, Series A

Journal of Combinatorial Theory, Series A Journl of Comintoril Theory, Series A 0 (0) Contents lists ville t SiVerse SieneDiret Journl of Comintoril Theory, Series A www.elsevier.om/lote/jt Spheril tiling y ongruent pentgons Hongho Go, Nn Shi,

More information

An Efficient 8b/10b Encoder and Decoder Design using Reversible Logic Gates

An Efficient 8b/10b Encoder and Decoder Design using Reversible Logic Gates Interntionl Journl of Eletril Eletronis & Computer Siene Engineering Volume 4, Issue 6 (Deemer, 207) E-ISSN : 2348-2273 P-ISSN : 2454-222 Aville Online t www.ijeese.om An Effiient 8/0 Enoder nd Deoder

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Mixed-Signal Testability Analysis for Data-Converter IPs

Mixed-Signal Testability Analysis for Data-Converter IPs Mixed-Signl Testility Anlysis for Dt-Converter IPs Arldo vn de Krts nd Hns G. Kerkhoff Testle Design nd Testing of Nnosystems Group MESA+ Institute for Nnotehnology 7500AE Enshede, the Netherlnds Emil:

More information

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut

More information