A Fast Incremental Spectral Clustering for Large Data Sets
|
|
- Gilbert West
- 8 years ago
- Views:
Transcription
1 th 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 of Computer Scence, Unversty of Scence and Technology of Chna 2 School of Computer Scence, Unversty of Adelade, Australa Abstract Spectral clusterng s an emergng research topc that has numerous applcatons, such as data dmenson reducton and mage segmentaton. In spectral clusterng, as new data ponts are added contnuously, dynamc data sets are processed n an on-lne way to avod costly re-computaton. In ths paper, we propose a new representatve measure to compress the orgnal data sets and mantan a set of representatve ponts by contnuously updatng Egen-system wth the ncdence vector. Accordng to these extracted ponts we generate nstant cluster labels as new data ponts arrve. Our method s effectve and able to process large data sets due to ts low tme complexty. Expermental results over varous real evolutonal data sets show that our method provdes fast and relatvely accurate results. Index Terms Spectral Clusterng, Incremental, Egen-Gap, Representatve Pont I. INTRODUCTION Spectral clusterng uses nformaton contaned n the spectrum of data affnty matrx to detect the structure of data dstrbutons. Recently, t has become ncreasngly popular both for ts fundamental advantages over tradtonal algorthms [6] and for ts smplcty n mplementaton wth standard lnear algebra methods [2], [5]. It has been used n varous applcatons rangng from data dmenson reducton to computer vson, mage segmentaton and speech recognton. The classcal algorthms usually have to make explct assumptons over the data sets before mplementaton, (e.g., EM algorthm assume that the data sets are as the law of Gaussan mxture models [1]). Therefore, these methods usually fal when data sets are arranged n a more complex stuaton [3], [4]. Compared wth these algorthms, spectral clusterng can acheve surprsngly good results by analyzng the spectrum of data set. Before the mplementaton of spectral clusterng, we need to construct a smlarty matrx and compute ts correspondng spectrum. Obvously, t s computatonally expensve and the stuaton s more severe when facng mass data. Therefore, t s necessary to compress the data sets and apply spectral clusterng n an on-lne way to avod costly re-computaton as data evolves. However, almost all exstng spectral clusterng methods are off-lne and wthout use of data compresson. Hence, t becomes dffcult to apply spectral clusterng when data sets are large and evolvng. In response to the above problems, there are manly two knds of solutons. One reles on smulatng the change of Ths paper was partally supported by the "100 Talents" Project of Chnese Academy of Scences, NSFC grant #622307, and Provncal Natural Scence Fund of Anhu # Q52. The correspondng author s Hong Shen. Egen-system to avod re-computaton as new data ponts arrve: In [8], an ncremental spectral clusterng algorthm s proposed to handle the changes among the objects. The measure ntroduces an ncdence vector to represent the nsert/delete of data ponts and contnuously updates the Egen-system by analyzng the approxmate relatons between the changes of egenvalues and egenvectors. It acheves a good accuracy, however suffers from beng uncertan of convergence, workng only wth a constant number of clusters. The other reles on extractng representatve ponts to compress data set: In [9], a self-adapton algorthm s proposed to nspect the clusters as new data ponts are added. Instead of computng the affnty matrx of all entres, t only mantans a few representatve data ponts, and hence works more effectvely. However, use of only one representatve data pont n each cluster may ntroduce sgnfcant errors. In general, these methods have clustered the data sets ncrementally n dfferent ways, but have not acheved the desred effcency. In ths paper, we propose an ncremental spectral clusterng algorthm to deal wth evolvng large data sets by extendng the NJW spectral clusterng algorthm [1]. Our algorthm effcently assgns nstant cluster labels to newly arrvng data accordng to the representatve sets estmated by our proposed measure and updates Egen-system [6] wth the ncdence vector [7] to detect the change of cluster number. Compared wth re-computaton of the soluton n NJW, our algorthm acheves a smlar accuracy at a much lower computatonal cost. The rest of the paper s organzed as follows. In Secton II, we gve some background knowledge used n the NJW algorthm. In Secton III, we ntroduce our ncremental spectral clusterng algorthm. The expermental results are reported n Secton IV followed by concludng remarks. II. PRELIMINARIES Frst, we state some notaton used n ths paper. Scrpted letters, such as ξ and φ, represent sets. Captal letters, such as L and W, represent matrces. Lower case letters n vector forms, such as v and u j, represent column vectors. And we use subscrpts to ndex the elements n matrces and vectors. In addton, egenvalues are lsted n ascendng order, and the frst k egenvectors represent the egenvectors correspondng to the k smallest egenvalues /11 $ IEEE DOI /PDCAT
2 A. NJW Spectral Clusterng Algorthm The NJW algorthm whch s one of the most common spectral clusterng algorthms ntroduces a partcular manner to use the frst k egenvectors and gve condtons under whch the algorthm can be expected to do well. It can be outlnes as follows usng the notaton n [2]. Algorthm 1 NJW algorthm Input : Affnty matrx W R n n, number k of clusters to construct. 1) Compute Laplacan matrx L = D W ; D s a dagonal matrx wth D = n j=1 W j 2) Compute the frst k egenvectors u 1,...,u k of egenproblem Lu = λdu; let Z R n k be the matrx contanng the vectors u 1,...,u k. 3) Cluster y 1,...,y n by K-means algorthm nto clusters c 1,...,c k ; y correspondng to the -th row of Z. Output : Clusters A 1,...,A k wth A ={j y j c }. As nput to algorthm, the constructon of affnty matrx s very mportant. We use the k-nearest neghbor graph to construct the smlarty matrx and use the Gaussan smlarty functon to measure the smlarty of each pont [2]: ( ( )) d (s,s j ) 2 A j =exp 2σ 2 (1) It s smple to work wth, results n a sparse affnty matrx whose frst k egenvectors can be effcent computed. However, t s computatonal expensve to resolve the generalzed egenvalue system as new data ponts comng. By analyzng the spectrum of the Laplacan Matrx constructed by all data entres, the orgnal data can be compressed nto a certan number of representatve ponts. B. Incdence Vector As new data comng, t s necessary to represent the dynamc changes n Laplacan matrx. A soluton was proposed n [8] that ntroduced ncdence vector to update Egen-system. Defnton 1. An ncdence vector c j rj s a column vector wth two nonzero elements: -th element equal to c j and j-th element c j, ndcatng data pont and j havng a smlarty c j. In addton, we let R be the matrx contans all the ncdence vectors as column n any order. Obvously, there are at most ( n 2 n ) /2 columns n R f the affnty matrx W s generated by a full connected graph. ( Fortunately, the actual columns n R s far less than n 2 n ) /2, snce W s sparse. Proposton 2. Laplacan matrx L = D W can be decomposed as L = RR T [10]. And f data ponts v and v j have a smlarty change Δc j correspondng to the ncdence vector Δcj rj, the new graph Laplacan L can be decomposed as L = R R T where R = [R, Δc j rj ]. Consder a new comng data pont v l, t can be smply decomposed nto a serous of ncdence vectors added n R. However, t s worth to note that after updatng R, the matrxes W, D, and L are expected to change ether. Acccordng to Pro. 2 the ncrement of L and D wth respect to Δc j rj can be expressed as: ΔL = L L = RR T T R R = Δc j rj T rj (2) ΔD = Δc j dag{m j } (3) where m j s a column vector whose -th and j-th elements equal to 1 whle others equal to 0.Snce the frst order approxmate soluton of λ can be computed as: Δλ = xt (ΔL λδd) x T x T Dx (4) we can further specfed Eq. (4) accordng to Eq. (2) and Eq. (3) wth ncdence vector Δc j r j as: x ( T r j rj T Δλ =Δc λdag {v j} ) x j x T Dx (5) C. Egen-gap It s a general problem to choose the number of clusters for all clusterng algorthms and there are varous of methods devsed for ths problem. Here, we adopt the Egen-gap heurstc [11] whch s partcularly desgned for spectral clusterng. It s known that the frst k egenvalues s exact 0, whle there s a gap between λ k and λ k+1 whch s called Egen-gap n k completely dsconnected clusters. Smlar stuatons exst wth regard to general case accordng to the matrx perturbaton theory. Therefore, the number of clusters k can be detected by Egen-gap and expressed as follows: k =argmn(max(g )) (6) where g = λ +1 λ for =1,...n 1; n s the number of data ponts. D. Representatve Measurement Analyss There are several of methods to compute the central or representatve ponts n a cluster. However, these methods are mostly based on densty, dstance or propnquty and are not applcable to reflect the complex relatonshp of ponts n clusters generated by spectral clusterng. Here, we heurstcally llustrate the relevance of ponts. Consder the case of k-connected components whose vertces are ordered accordng to the cluster they belong to. Thus, the affnty matrx s block dagonal, and the same s true for L L 1 0 L =... 0 L k where each L s a connected Laplacan graph whch has a egenvalue 0 wth constant one egenvector. We know that the frst k egenvectors of L are pecewse constant wth correspondng egenvalues 0. Hence, 0 s a 2
3 repeated egenvector wth multplcty k. Thus the Egen-solver could be any set of orthogonal vectors spannng the same space as the frst k egenvectors of L. In [3], the author defned a cost functon as: n k Xj 2 J = (7) M 2 =1 j=1 where M =max j X j. By mnmzng J wth cluster number k, t recover the rotaton whch best algns the columns of X wth canoncal coordnate system. Furthermore, mnmzng J means ncorporate as few columns as possble to contan bgger data gap, that s, reserve marked ndcator whle reduce napparent one. It s accord wth our clusterng target and gve some expresson to the label nformaton of correspondng ponts. A smlar result comes up n general case wth perturbed data. Therefore, t s reasonable for us to measure the representatveness of ponts use a smlar cost functon. III. OUR PROPOED METHOD By estmatng ponts n every cluster wth our proposed measurement, we compress the orgnal data nto a set of representatve ponts. Then, nstant cluster labels can be generated accordng to these extracted representatve ponts as new data ponts added. However, as new data contnuously come, the orgnal representatve ponts may not be able to represent ts cluster very well. Hence, we apply ncdence vector to update the change of data n the form of Egen-system to keep a newest set of representatve ponts. In ths secton, we wll dscuss these problems n detal. A. Extractng Representatve Ponts and ts Number 1) Representatve Measurement: When we get the result of clusters after applyng the NJW algorthm, t makes sense to analyss the representatveness of each pont n submanfold. There are many general algorthms desgned for ths problem [12], however, most of them are based on dstance, densty or mode estmaton. Hence, t can t reflect nternal and external relatons between clusters. For ths purpose, we defne a new cost functon to measure the representatve relablty of each cluster accordng to ts egenvectors. Inspred by (7), we defne the representatve relablty R of pont v n cluster C j as: R = k X 2 j M 2 j=1 where M =max j X j and a better representatve pont has a smaller magntude of R. Fg. 1 shows a toy example of a graph evolves from (a) to (b), as a new type data pont D accompany wth an edge BD added. In Fg. 1(a), the representatve pont should be B; whle n Fg. 1(b) the representatve of pont should be A. That s to say, the measure of Eq. (8) s prefer to choose ponts wth more smlarty nternal clusters and less smlarty external clusters. Hence, the connecton wth other clusters wll reduce ts representatve relablty. (8) B A 0.4 C (a) Before evolved D B A C (b) After evolved Fgure 1: A toy example of ncremental data. The dash lne are edge to be added 2) The number of Representatve Ponts: The next problem s to select the number of representatve ponts. We want to choose enough number of ponts to represent a cluster whle at the same tme reducng t as much as possble to avod redundant computaton. Thus, we can solve ths problem by analyzng the Egen-gap of each cluster and fx the number by Eq. (6). Furthermore, f there s a partcular demand on tme and certan error s allowed, we can approxmate the spectrum of each sub-cluster C j wth the correspondng columns and rows of Z. Where Z s the spectrum of the whole data sets and denoted the reduced matrx as Z Cj R Cj Cj. Thus the approxmate egenvalues of cluster C can be approxmate express as: λ Cj = x C T j Lx Cj x Cj T (9) Dx Cj where x Cj correspondng to the -th column of S Cj. Snce then, we can use Eq. (6) to detect the number of representatve ponts. B. Updatng Representatve Sets and Re-ntalzng the Algorthm when Cluster Number Changes As new data comng ncrementally, the error s accumulatng. Ths s also a problem n many other algorthms. Here we re-ntalze the NJW algorthm to avod a collapse. Then, there comes a queston that when to apply the re-ntalzaton step. We can smply apply the step when a certan preset number of ponts have been added, however, a constant number can hardly competent snce the added data may have much dfferent smlarty connecton wth orgnal data ponts. Hence, we except to gan a better result by contnuously detect the change of cluster number n an approxmate way. The current cluster number can be detected by Egen-gap as: k = argmn(max(λ +1 λ )) = argmn(max((λ +1 +Δλ +1 ) (λ +Δλ ))) = argmn(max (g +(Δλ +1 Δλ ))) (10) Thus, we can get the current number of cluster k by Eq. (10) and (5) and apply the re-ntalzaton step whle k k. In III-A, we have chosen k representatve ponts by analyzng the Egen-gap of cluster C. Consder that a new comer D 3
4 data assgned to C but wthout change the magntude of k. In ths stuaton, the prevous extracted representatve ponts stll work snce there s nothng new type ponts generated. However, when the number of k ncrease, the prevous extracted ponts can hardly make t. Therefore, we adopt a smlar strategy as the above dscusson of re-ntalzaton step and solve ths problem by smply addng the pont whch have aroused the change of k to representatve sets. C. A Fast Incremental Spectral Clusterng Algorthm for Large Data Set 1) The Algorthm: Summarze Secton III-A and III-B, we propose a new ncremental spectral clusterng algorthm and descrbe t as follows: Algorthm 2 A Fast Incremental Spectral Clusterng Algorthm Input: Number of clusters k, affnty matrx W R n n at tme t. New comer data ponts v l after t. 1) Apply Algorthm 1 wth parameter k, W and generate k clusters as C 1...C k. Noted X as the matrx contans the frst k egenvectors as columns and Z contans all. 2) For each cluster C, compute the representatve relablty R j of every pont v j C accordng to Eq. (8), and choose the frst k C ponts to represent cluster C noted as C. k C s computed by Eq. (6) where the correspondng parameter λ C s gven by Eq. (9). Note that the frst k C ponts means the ponts correspondng to the k C smallest R j. 3) For every new added pont v l, compute the average dstance Ds from v l to cluster C j and assgn v l to cluster C m whch gve the smallest value of Ds: ɛc d (v l,v ) j Ds = C j 4) Compute the current cluster number k accordng to Eq. (10) where the change of egenvector s gven by Eq. (5) n the form of ncdence vector. If k k, then go back to step 1 to re-ntalze the algorthm wth k = k, otherwse contnue. 5) Compute the current number of C m s representatve ponts k C m smlar as step 4. If k C m >k Cm then add v l to C m, otherwse contnue. 6) Go to step 3. Output: Instant cluster lables of ponts v l. 2) Dscussons: It s known that compute the spectrum of a standard matrx needs O ( ( ) n 3) operatons, t can be furthermore reduce to O n 3 2 f the Laplacan matrx s sparse. However, the computatonal cost stll very hgh. Hence, NJW algorthm may fal when data scale s large or new data comes too frequently. On the contrary, our algorthm may success. It s fast and relatve accuracy. Here, we shortly analyss the tme complexty to llustrate t. It needs O (n) operatons to compute the ( representatve ) ponts n each cluster as ntalzaton and O ñ 3 2 operatons to generate cluster labels and update representatve sets as new data come, where n and ñ denote the number of data set and representatve set respectvely. ñ s usually much smaller than n and relatve stable, hence, our method s effectve and able to process large data sets. IV. EXPERIMENTS A. Parameter Settngs As mentoned before, we use k-nearest neghbor graph to construct the sparse affnty matrx. However, t may lead to non-symmetrc matrx. Fortunately, we can make t symmetrc by smply settng both W j and W j as the smlarty of v and v j, f ether W j or W j s non-zero. In ths experment, we adopt the Gaussan smlarty functon to measure local neghborhoods between ponts and ts parameter σ s selected n a self-turnng way suggested n [3]. Moreover, we employ ARPACK (a varant of Lanczos method) to compute the spectrum of D 1 L and choose k =20to construct k-nearest neghbor graph. B. Data Sets The data set s a collecton of about 810,000 documents whch s known as RCV1 (Reuters Corpus Volume I) [14]. It s manually categorzed nto 350 classes and splt nto 23, 139 tranng documents and 781, 256 test documents. We use the category codes based on ndustres vocabulary and preprocess the data sets by removng document wth mult-labeled and categores wth less than 500 documents. Thus, we get about 200,000 documents n 103 categores. In ths experment, we extract a subset ϕ from the 200,000 documents to ntalze our algorthm and smulate the ncrement of data sets by add data ponts to ϕ from the rest of 200,000 documents. C. Qualty Measure We estmate our algorthm by computng Clusterng Accuracy (CA) and Normalzed Mutual Informaton (NMI) between labels generated by our algorthm and the real one [13] : =n =1 CA =max δ (y,map(c )) map n where n denote the number of documents, y and c denote the real label and generated label of document v respectvely. Functon δ (y, c) equals 1 f y = c, equals 0 otherwse. Permutaton functon map ( ) maps each generated label to real one and the optmzed mappng functon can be found n [15]. The magntude of CA s between 0 and 1, whle a hgher score of CA means a better clusterng qualty. NMI = k =1 ( ) k j=1 n n nj jlog n nj ( n ) ( log n n j n jlog nj n where n denote the number of documents, n and n j denote the magntude of documents n cluster and category j, and n j denotes the mutual documents both n category and cluster j. The magntude of NMI s between 0 and 1, whle a hgher score of NMI means a better clusterng qualty. ) 4
5 0.55 Modfed NJW Increnmental spectal clusterng 8 Modfed NJW Increnmental spectal clusterng Modfed NJW Increnmental spectal clusterng NMI 0.4 Accuracy Tme Number of ponts (a) NMI 0.1 Number of ponts (b) Accuracy 1 Number of ponts (c) Tme Fgure 2: A clusterng qualty and runtme comparson between K-means, Modfed NJW and Alg. 2 usng the RCV1 data set. For Alg. 2, we use 3000 ponts as ntalzaton and ncrementally add another 3000 ponts n the rest of data set. For K-means, each value s mean of 10 replcates. D. Results Fg. 2(a) and Fg. 2(b) shows the NMI and CA score usng RCV1 data set. Both of the results confrm that our algorthm acheves a relatve good clusterng qualty between NJW and K-means. Although the value of NMI and AC may drop gradually wth the ncrease of added ponts, t could rectfy by the automatc re-ntalzaton operaton of Alg. 2. Furthermore, t would perform much better wth the ncrease number of ponts whch s crucal for large data sets. Fg. 2(c) reports the runtme usng the RCV1 data set. It can be seen that the runtme of Alg. 2 s close to K-means and much less than NJW. In addton, the ncrease of runtme s not so sharp as NJW as new ponts added. On the contrary, t become relatve stable and approach to K-means. Hence, compared wth recomputaton by NJW, t acheves smlar accuracy but wth much lower computatonal cost. V. CONCLUSIONS A fast ncremental spectral clusterng algorthm for large data set s proposed n ths paper. It extends the NJW algorthm to handle dynamc data and ncorporates a new strategy of measurement to compress the orgnal data sets wth a certan number of representatve ponts. Instead of evaluatng the whole data set, by ncrementally keepng a representatve sets, the algorthm generates nstant cluster labels as new ponts come. Therefore, the algorthm s fast and can be effcently appled to large data sets. Moreover, by analyzng Egen-gap n the form of ncdence vectors, the change of cluster number can be detected automatcally. Expermental results over a number of real evolutonal data sets llustrate our methods provde fast and relatve accurate results. [2] von Luxburg U. (2007). A tutoral on spectral clusterng. Stat. Comput. 17, [3] L. Zelnk-Manor and P. Perona. Self-tunng spectral clusterng. In L. K. Saul, Y. Wess, and L. Bottou, edtors, Advances n Neural Informaton Processng Systems 17, pages MIT Press, Cambrdge, MA, [4] J. Sh, J. Malk, Normalzed cuts and mage segmentaton, IEEE Transactons on Pattern Analyss and Machne Intellgence 22 (8) (2000) [5] F. Bach and M. Jordan. Learnng spectral clusterng. In Proc. of NIPS- 16. MIT Press, [6] F. R. K. Chung. Spectral Graph Theory. Amercan Mathematcal Socety, [7] B. Bollobas, Modern Graph Theory, Sprnger, New York, [8] H. Nng, W. Xu, Y. Ch, Y. Gong, and T. Huang. Incremental spectral clusterng wth applcaton to montorng of evolvng blog communtes. In SIAM Int. Conf. on Data Mnng, [9] C. Valgren, T. Duckett, and A. Llenthal. Incremental spectral clusterngand ts applcaton to topologcal mappng. In Proc. IEEE Int. Conf. onrobotcs and Automaton, pages , 2007 [10] F.R.K. Chung, Spectral Graph Theory, n: CBMS Regonal Conference Seres n Mathematcs, vol. 92, Amercan Mathematcal Socety, Provdence, RI, [11] Bhata, R.: Matrx Analyss. Sprnger, New York (1997) [12] D. Chaudhur, C.A. Murthy, and B.B. Chaudhur, Fndng a Subset of Representatve Ponts n a Data Set, IEEE Trans. Systems, Man, and Cybernetcs, vol. 24, no. 9, pp , [13] Wen-Yen Chen, Yangqu Song, Hongje Ba, Chh-Jen Ln, and Edward Y. Chang. Parallel Spectral Clusterng n Dstrbuted Systems. IEEE Transactons on Pattern Analyss and Machne Intellgence,2010. [14] D. D. Lews, Y. Yang, T. G. Rose, and F. L. RCV1: A new benchmark collecton for text categorzaton research. Journal of Machne Learnng Research, 5: , [15] L. Lovasz, M. Plummer, Matchng Theory, Akadema Kado, North- Holland, Budapest, REFERENCES [1] A.Y. Ng, M.I. Jordan, Y. Wess, On spectral clusterng: analyss and an algorthm, n: T.G. Detterch, S. Becker, Z. Ghahraman (Eds.), Proceedngs of the Advances n Neural Informaton Processng Systems, MIT Press, Cambrdge, MA, 2002, pp
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 informationFace 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 informationThe 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 informationAn 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 information8.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 informationOut-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering
Out-of-Sample Extensons for LLE, Isomap, MDS, Egenmaps, and Spectral Clusterng Yoshua Bengo, Jean-Franços Paement, Pascal Vncent Olver Delalleau, Ncolas Le Roux and Mare Oumet Département d Informatque
More informationWhat 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"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 informationL10: 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 informationVision 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 informationHow To Know The Components Of Mean Squared Error Of Herarchcal Estmator S
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
More informationForecasting 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 informationForecasting 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 informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationModule 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 informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationbenefit 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 informationLoop 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 informationFault 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 informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationPAS: 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 information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationwhere the coordinates are related to those in the old frame as follows.
Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product
More informationDEFINING %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 informationRecurrence. 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 informationA Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing
A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure
More informationMining Multiple Large Data Sources
The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of
More informationDistributed Multi-Target Tracking In A Self-Configuring Camera Network
Dstrbuted Mult-Target Trackng In A Self-Confgurng Camera Network Crstan Soto, B Song, Amt K. Roy-Chowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
More informationThe 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 informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationOn-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More information320 The Internatonal Arab Journal of Informaton Technology, Vol. 5, No. 3, July 2008 Comparsons Between Data Clusterng Algorthms Osama Abu Abbas Computer Scence Department, Yarmouk Unversty, Jordan Abstract:
More informationCluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms
Internatonal Journal of Appled Informaton Systems (IJAIS) ISSN : 2249-0868 Foundaton of Computer Scence FCS, New York, USA Volume 7 No.7, August 2014 www.jas.org Cluster Analyss of Data Ponts usng Parttonng
More informationBayesian Cluster Ensembles
Bayesan Cluster Ensembles Hongjun Wang 1, Hanhua Shan 2 and Arndam Banerjee 2 1 Informaton Research Insttute, Southwest Jaotong Unversty, Chengdu, Schuan, 610031, Chna 2 Department of Computer Scence &
More informationDetecting Global Motion Patterns in Complex Videos
Detectng Global Moton Patterns n Complex Vdeos Mn Hu, Saad Al, Mubarak Shah Computer Vson Lab, Unversty of Central Florda {mhu,sal,shah}@eecs.ucf.edu Abstract Learnng domnant moton patterns or actvtes
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationFeature 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 informationPerformance Analysis and Coding Strategy of ECOC SVMs
Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.67-76 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationWeb Object Indexing Using Domain Knowledge *
Web Object Indexng Usng Doman Knowledge * Muyuan Wang Department of Automaton Tsnghua Unversty Bejng 100084, Chna (86-10)51774518 Zhwe L, Le Lu, We-Yng Ma Mcrosoft Research Asa Sgma Center, Hadan Dstrct
More informationAn 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 informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationA 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 informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationA Dynamic Load Balancing for Massive Multiplayer Online Game Server
A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,
More informationA heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
More informationSemantic Link Analysis for Finding Answer Experts *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 28, 51-65 (2012) Semantc Lnk Analyss for Fndng Answer Experts * YAO LU 1,2,3, XIAOJUN QUAN 2, JINGSHENG LEI 4, XINGLIANG NI 1,2,3, WENYIN LIU 2,3 AND YINLONG
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationData Visualization by Pairwise Distortion Minimization
Communcatons n Statstcs, Theory and Methods 34 (6), 005 Data Vsualzaton by Parwse Dstorton Mnmzaton By Marc Sobel, and Longn Jan Lateck* Department of Statstcs and Department of Computer and Informaton
More informationDocument image template matching based on component block list
Pattern Recognton Letters 22 2001) 1033±1042 www.elsever.nl/locate/patrec Document mage template matchng based on component block lst Hanchuan Peng a,b,c, *, Fuhu Long b, Zheru Ch b, Wan-Ch Su b a Department
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationAn 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 informationFast degree elevation and knot insertion for B-spline curves
Computer Aded Geometrc Desgn 22 (2005) 183 197 www.elsever.com/locate/cagd Fast degree elevaton and knot nserton for B-splne curves Q-Xng Huang a,sh-mnhu a,, Ralph R. Martn b a Department of Computer Scence
More informationImproved SVM in Cloud Computing Information Mining
Internatonal Journal of Grd Dstrbuton Computng Vol.8, No.1 (015), pp.33-40 http://dx.do.org/10.1457/jgdc.015.8.1.04 Improved n Cloud Computng Informaton Mnng Lvshuhong (ZhengDe polytechnc college JangSu
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationLaddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems
Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE
More informationECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble
1 ECE544NA Fnal Project: Robust Machne Learnng Hardware va Classfer Ensemble Sa Zhang, szhang12@llnos.edu Dept. of Electr. & Comput. Eng., Unv. of Illnos at Urbana-Champagn, Urbana, IL, USA Abstract In
More informationRealistic 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 informationWhen Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services
When Network Effect Meets Congeston Effect: Leveragng Socal Servces for Wreless Servces aowen Gong School of Electrcal, Computer and Energy Engeerng Arzona State Unversty Tempe, AZ 8587, USA xgong9@asuedu
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationAbstract. Clustering ensembles have emerged as a powerful method for improving both the
Clusterng Ensembles: {topchyal, Models jan, of punch}@cse.msu.edu Consensus and Weak Parttons * Alexander Topchy, Anl K. Jan, and Wllam Punch Department of Computer Scence and Engneerng, Mchgan State Unversty
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationDesign 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 informationAssessing Student Learning Through Keyword Density Analysis of Online Class Messages
Assessng Student Learnng Through Keyword Densty Analyss of Onlne Class Messages Xn Chen New Jersey Insttute of Technology xc7@njt.edu Brook Wu New Jersey Insttute of Technology wu@njt.edu ABSTRACT Ths
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationProject 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 informationLogistic 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 information21 Vectors: The Cross Product & Torque
21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationProceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001
Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 5-9, 2001 LIST-ASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James
More informationAn interactive system for structure-based ASCII art creation
An nteractve system for structure-based ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract Non-Photorealstc Renderng (NPR), whose am
More informationAn 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 informationPERRON FROBENIUS THEOREM
PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()
More informationHallucinating Multiple Occluded CCTV Face Images of Different Resolutions
In Proc. IEEE Internatonal Conference on Advanced Vdeo and Sgnal based Survellance (AVSS 05), September 2005 Hallucnatng Multple Occluded CCTV Face Images of Dfferent Resolutons Ku Ja Shaogang Gong Computer
More informationMaster s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks
Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationDaily Mood Assessment based on Mobile Phone Sensing
2012 Nnth Internatonal Conference on Wearable and Implantable Body Sensor Networks Daly Mood Assessment based on Moble Phone Sensng Yuanchao Ma Bn Xu Yn Ba Guodong Sun Department of Computer Scence and
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationCOMPRESSED NETWORK MONITORING. Mark Coates, Yvan Pointurier and Michael Rabbat
COMPRESSED NETWORK MONITORING Mark Coates, Yvan Ponturer and Mchael Rabbat Department of Electrcal and Computer Engneerng McGll Unversty 348 Unversty Street, Montreal, Quebec H3A 2A7, Canada ABSTRACT Ths
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationA Programming Model for the Cloud Platform
Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna luxaodongxht@qq.com
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationOnline Inference of Topics with Latent Dirichlet Allocation
Onlne Inference of Topcs wth Latent Drchlet Allocaton Kevn R. Cann Computer Scence Dvson Unversty of Calforna Berkeley, CA 94720 kevn@cs.berkeley.edu Le Sh Helen Wlls Neuroscence Insttute Unversty of Calforna
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Sequential Optimizing Investing Strategy with Neural Networks
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sequental Optmzng Investng Strategy wth Neural Networks Ryo ADACHI and Akmch TAKEMURA METR 2010 03 February 2010 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE
More informationDynamic Fleet Management for Cybercars
Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.
More informationTexture 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 informationA 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 informationFREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES
FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan
More informationPerformance Management and Evaluation Research to University Students
631 A publcaton of CHEMICAL ENGINEERING TRANSACTIONS VOL. 46, 2015 Guest Edtors: Peyu Ren, Yancang L, Hupng Song Copyrght 2015, AIDIC Servz S.r.l., ISBN 978-88-95608-37-2; ISSN 2283-9216 The Italan Assocaton
More informationGender 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 informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationAn Algorithm for Data-Driven Bandwidth Selection
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 25, NO. 2, FEBRUARY 2003 An Algorthm for Data-Drven Bandwdth Selecton Dorn Comancu, Member, IEEE Abstract The analyss of a feature space
More informationRobust 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 informationApplication of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance
Applcaton of Quas Monte Carlo methods and Global Senstvty Analyss n fnance Serge Kucherenko, Nlay Shah Imperal College London, UK skucherenko@mperalacuk Daro Czraky Barclays Captal DaroCzraky@barclayscaptalcom
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More information