Prediction of Time Series Using RBF Neural Networks: A New Approach of Clustering
|
|
- Cory Nelson
- 6 years ago
- Views:
Transcription
1 138 The Intenational Aab Jounal of Infomation Technology, Vol. 6,. 2, Apil 2009 Pediction of Time Seies Using RBF Neual Netwoks: A New Appoach of Clusteing Mohammed Awad 2, Hécto Pomaes 1, Ignacio Rojas 1, Osama Salameh 2 and Mai Hamdon 2 1 Depatment of Compute Achitectue and Technology, Univesity of Ganada, Spain 2 Faculty of Infomation Technology, Aab Ameican Univesity, Palestine Abstact: In this pape, we deal with the poblem of time seies pediction fom a given set of input/output data. This poblem consists of the pediction of futue values based on past and/o pesent data. We pesent a new method fo pediction of time seies data using adial basis functions. This appoach is based on a new efficient method of clusteing of the centes of the adial basis function neual netwok; it uses the eo committed in evey cluste using the eal output of the adial basis function neual netwok tying to concentate moe clustes in those input egions whee the eo is bigge and move the clustes instead of just the input values of the I/O data. This method of clusteing, impoves the pefomance of the time seies pediction system obtained, compaed with othe methods deived fom taditional algoithms. Keywods: Clusteing, time seies pediction, RBF neual netwoks. Received Apil 21, 2007; accepted Decembe 14, Intoduction Time seies is widely used in many aspects of ou lives. Daily tempeatue, electical load and ive flood foecasting [21], etc. The poblem consists of pedicting the next value of a seies known up to a specific time, using the known past values of the seies. Basically, time seies pediction can be consideed a modeling poblem. The fist step is establishing a mapping between inputs/outputs. Usually, the mapping is nonlinea and chaotic. Afte such a mapping is set up, futue values ae pedicted based on past and cuent obsevations [16, 21]. Radial Basis Function Neual Netwoks (RBFNNs) ae chaacteized by a tansfe function in the hidden unit laye having adial symmety with espect to a cente [9]. The basic achitectue of an RBFNN is a 3- laye netwok as in Figue 1. The output of the net is given by the following expession: m F ( x, Φ, w ) = φ ( x ) w (1) i= 1 whee Φ = { φ i : i= 1,..., m} ae the basis functions set and w i the associate weights fo evey Radial Basis Function (RBF). The basis function φ can be calculated as a Gaussian function using the following expession: (,, ) exp x φ x c c = i i (2) whee c is the cental point of the function φ, is its adius and x is the input vecto. x 1. x m φ 1 φ 2 φ m w 2 Figue 1. Radial basis function netwok. A common leaning method fo RBFNNs is clusteing. Evey cluste has a cente, which can be chosen as the cente of a new RBF. The RBF centes can be obtained by many clusteing algoithms. These algoithms ae classified as unsupevised clusteing algoithms such as k-means [6], fuzzy c-means [2], enhanced LBG [19], and supevised clusteing algoithms such as the Clusteing fo Function Appoximation method (CFA) [3], the Conditional Fuzzy Clusteing algoithm (CFC) [11] and the Altenating Cluste Estimation method (ACE) [18] etc. The clusteing algoithm obtains the cluste centes by attempting to minimize the total squaed eo incued in epesenting the data set by the m cluste centes. Howeve, the clusteing algoithm can only achieve a local optimal solution, which depends on the initial locations of cluste centes. A consequence of this local optimality is that some initial centes can become stuck in egions of the input domain with few o no input pattens. This wastes esouces and esults in a local optimal netwok. w 1 wm Σ F(X)
2 Pediction of Time Seies Using RBF Neual Netwoks: A New Appoach of Clusteing 139 RBFNNs ae univesal appoximatos and thus best suited fo function appoximation poblems. In geneal an appoximato is said to be univesal if it can appoximate any continuous function on a compact set to a desied degee of pecision. The technique of finding the suitable numbe of adial functions is vey complex since we must be caeful of not poducing excessively lage netwoks which ae inefficient and sensitive to ove-fitting and exhibit poo pefomances. Figue 2 pesents a functional appoximation using seveal RBFs with diffeent values of the adius, whee is the adius of RBF. Figue 2. Function appoximation using RBFNNs. In this pape we pesent a new method of clusteing the centes of RBFs fo the pediction of time seies and a new efficient clusteing method fo the initialization of the centes of the RBF netwok, this method uses the taget output of the RBFN to migate and fine-tune the clustes instead of just the input values of the I/O data. This method calculates the eo committed in evey cluste using the eal output of the RBFN tying to concentate moe clustes in those input egions whee the eo is bigge, thus attempting to homogenize the contibution to the eo of evey cluste. The oganization of the est of this pape is as follows. Section 2 pesents an oveview of the poposed algoithm. In section 3, we pesent in detail the poposed algoithm fo the detemination of the pseudo-optimal RBF paametes. Then, in section 4 we show some esults that confim the pefomance of the poposed methodology. Some final conclusions ae dawn in section Poposed Appoach As mentioned befoe, the poblem of time seies pediction consists of the pediction of futue values based on past and/ o pesent values. A time seies is a sequence of vectos, x(t), t = 0,1,, whee t epesents elapsed time. Theoetically, x may be a value which vaies continuously with t, such as tempeatue. In pactice, fo any given system, x will be sampled to give a seies of discete data points, equally spaced in time [7]. Fomally this can be stated as: find a function x( t+ d) = f ( x( t)) such as to obtain an estimate of x at time t + d, fom the N time steps back fom time t, so that: x( t+ d) = f( x( t)), x( t 1),..., x( t N+ 1) (3) The accuacy of the pediction pocess is measued by a cost function which takes into account the eo between the output of the RBFNN and the eal output. In this pape, the cost function we ae going to use is the so-called malized/root Mean Squaed Eo (N/RMSE). This pefomance index is defined as: NRMSE = y f x y y P P 2 2 ( i ( i)) / ( i ) i= 1 i= 1 (4) whee y is the mean of the eal output, and p is the data numbe. The objective of ou algoithm is to incease the density of clustes in the input domain aeas whee the eo committed in evey cluste using the eal output of the RBFN is bigge. The RBFNN is completely specified by choosing the following paametes: the numbe m of adial basis functions, the centes c of evey RBF, the adius, and the weights w. The numbe of RBFs is a citical choice. In ou algoithm we have used a simple incemental method to detemine the numbe of RBFs. We will stop adding new RBFs when the time seies pediction eo falls below a cetain taget eo. As to the est of the paametes of the RBFNN, in section 3 we pesent a new clusteing technique. Figue 4 pesents a flowchat with the geneal desciption of the poposed appoach. Figue 3. The distotion befoe the migation. Figue 4. The distotion afte the migation. 3. Paamete Adjustment of the RBFNN The locality popety inheent to the RBF allows us to use a clusteing algoithm to obtain the RBF centes. Clusteing algoithms may get stuck in a local minimum ignoing a bette placement of some of the clustes, i.e., the algoithm is tapped in a local minimum which is not the global one. Fo this eason we need a clusteing algoithm capable to solve this local minimum poblem. To avoid this poblem we
3 140 The Intenational Aab Jounal of Infomation Technology, Vol. 6,. 2, Apil 2009 endow ou supevised algoithm with a migation technique. This modification allows the algoithm to escape fom local minimum and to obtain a pototype allocation independent of the initial configuation. To optimize the othe paametes of the RBFNN (the adius and the weights w) we used well-known heuistics; the k-neaest Neighbou technique (knn) [10] fo the initialization of the adius of each RBF, Singula Value Decomposition (SVD) [13] to diectly optimize the weights. Finally, the levenbeg-maquadt algoithm is to fine-tune the obtained RBFNN [8]. Theefoe, in this section we will concentate on the poposed clusteing algoithm. In Figue 4, we show a flowchat epesenting the geneal desciption of ou clusteing algoithm. As can be seen fom this figue, the initial values of the clustes ae calculated using the k-means clusteing algoithm followed by a local displacement pocess which locally minimizes the distotion (D) within each cluste. In Figue 3 we can see the initial distotion distibution fo the case of 6 equally distibuted RBFs, which is the fist configuation whose appoximation eo falls unde the taget eo. Figue 4 epesents the same infomation when the clusteing pocess has ended. We can now see the advantage that we expect fom the fact of making each cluste to have an equal contibution to the total distotion, which is the objective of the poposed clusteing algoithm. The distotion is defined as: m 2 xi c j Eij j= 1 xi C j D= (5) m E j= 1 xi C j whee m is the numbe of RBFs (clustes), c j is the cente of cluste C j and E ij is the eo committed by the net when the input vecto x i belongs to cluste C j. E= y f ( x, Φ, w) ij (6) In the local displacement of the cluste centes, we stat by making a had patition of the taining set, just as in the k-means algoithm. The second step of the pocess of local displacement is the calculation of the eo of the RBFNN using the the K-neaest neighbous algoithm to initiate the adii and the singula value decomposition to calculate the weights of the RBFs.This is caied out by an iteative pocess that updates each cluste cente as the weighted mean of the taining data belonging to that cluste and we epeat this pocess until the total distotion of the net eaches a minimum. cm= Eim xi / Eim (7) xi Cm xi Cm D Initiate the Clustes using K-means Pefom Local Displacement of the Clustes D ant D Pefom Migation of the Clustes Pefom Local Displacement of the Clustes Calculate the Distotion D D D / D < ε? a n t Retun the final Clustes Cj Figue 5. Geneal desciption of the poposed clusteing algoithm. Afte this pocess we must update the cluste centes in ode to minimize the total distotion. The algoithm stops when the value of the distotion is less than the value of a theshold ε. Figue 6 pesents a flowchat with the geneal desciption of the local displacement pocess. D Pefom the Patition of the Taining set Calculate the Eo of the RBFN, using (KNN) to initiate the Radius and (SVD) to calculate the weight of the RBFN D ant D Update the Clustes Calculate the Eo of the RBFN, using (KNN) to initiate the Radius and (SVD) to calculate the weight of the RBFN Pefom the Patition of the Taining set. Calculate the Distotion D D D / D < ε? ant Retun the new Cluste Cj Figue 6. Local displacement of the clustes. The migation pocess migates clustes fom the bette zones towad those zones whee the eo is wose, thus attempting to make equal thei contibution to the total distotion. Ou main hypothesis is that the best initial cluste configuation will be the one that equalizes the eo committed by evey cluste. The pobability of
4 Pediction of Time Seies Using RBF Neual Netwoks: A New Appoach of Clusteing 141 choosing a given cluste invesely popotional to what we call the utility of that cluste, which is defined as: U = D / D j= 1,..., m (8) j j In this way, the poposed algoithm selects one cluste that has utility less than one and moves this cluste to the zone neaby a new selected cluste having utility moe than one as shown in Figue 7. This migation step is necessay because the local displacement of clustes only moves clustes in a local manne. Calculate the Distotion Dj and the Utility Uj, Select all the Clustes that they have U < 1 Calculate the pobability of evey Cluste that has U<1 U Has maximum pobability. min Any cluste with U< 1? Select one (U<1) using oulette wheel selection Select all the Clustes that have (U > 1) bibliogaphy fo this benchmak poblem (including ou poposed appoach). Mackey-glass time seies geneated with the following expession: ds( t) s( t - t ) = a. - b s( t) 10 dt 1 + s ( t - t ) (9) whee x(t) is the value of the time seies at time t. The time seies was constucted with paamete values a = 0.2 and b = 0.1. Hee, initial conditions used in ou test bench ae set as s (0) = 1.2 and s( t ) = 0 when t < 0, doing t = samples of the Mackey-glass time seies ae depicted Figue 8. The fist 500 points ae used as a taining set and the last 500 ae used as the test set. The tables pesent esults of the nomalized oot mean-squae eo NRMSE test obtained by testing set of 500 test points afte the application of the Levenbeg Maquadt method. As can be seen fom the Tables 1 and 2, the poposed algoithm eaches bette pediction eo. Calculate the pobability of evey Cluste that has U>1 U Has maximum pobability. max Any cluste with U > 1? Select one (U>1) using the oulette wheel selection Move the selected cluste with (U<1) to the zone of the cluste selected with (U>1). Used K-means to epatition the data Figue 8. Mackey- glass time seies. Confim the migation Pefom Local Displacement of the Clustes Calculate the Distotion Dj Has the Distotion impoved? Stop the Migation Figue 7. The migation pocess. Reject the Migation 4. Example of the Poposed Pocedue Expeiments have been pefomed to test the poposed algoithm. The system is simulated in MATLAB 7.0 unde Windows XP with pocesso Pentium IV unning at 2.4 Ghz. In this section we attempt a shottem and lage-tem pediction of the algoithm pesented in the above section with egad to the Mackey-glass time seies data [5]. The Mackey-glass time seies is commonly used to test the pefomance of neual netwoks [5]. The seies is a chaotic time seies making it an ideal epesentation of the nonlinea oscillations of many physiological pocesses [17]. To make the compaisons with ealie wok, we chose the paametes pesented in [4]. Figue 8 shows the Mackey- glass time seies. Tables 1 and 2 compaes the pediction accuacy of diffeent computational paadigms pesented in the 4.1. Shot-Tem Pediction Following the conventions established to pedict this time seies in shot-tem, the execution of the algoithm is consideed to look fo netwoks that pedict the value s(s+6) fom cuent value s(t) and of past values s(s-6), s(s-12), and s(s-18), using values of taining of the fom [ s( t- 18), s( t- 12), s( t- 6), s( t); s( t+ 6) ] (10) The NRMSE of the points pedicted by the algoithms is shown in Table 1. It is clea that the poposed algoithm has pedicted the time seies in shot-tem with much geate accuacy than othe algoithms. Figue 9. Pediction step 85, with 20 RBF.
5 142 The Intenational Aab Jounal of Infomation Technology, Vol. 6,. 2, Apil 2009 Table 1. Compaison esult of the pediction eo of diffeent methods fo pediction step 6 (500 test data). Method m RMSE test Lineal model pediction Auto Regessive model Cascade coelation NN th -ode polynomial Back-Pop NN Kim and Kim (GA A & Fuzzy System) [3] ANFIS & Fuzzy Svstem [3] New RBFNs Stuctue [16] Pomaes [13] González [7] Rivas [15] Ou Appoach 5MFs MFs MFs ules RBF ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± Lage-Tem Pediction In lage-tem, the execution of the algoithm is consideed to look fo netwoks that pedict the value s(s+85) fom cuent value s(t) and of past values s(s- 6), s(s-12), and s(s-18), using values of taining of the fom [ st ( - 18), st ( - 12), st ( - 6), s(); t st ( + 85) ] (11) 5. Conclusion In this pape, a new modified appoach is pesented to pedict chaotic time seies. We have poposed an algoithm of clusteing especially suited fo function appoximation poblems. This method calculates the eo committed in evey cluste using the eal output of the RBFNN, and not just an appoximate value of that output, tying to concentate moe clustes in those input egions whee the appoximation eo is bigge, thus attempting to homogenize the contibution to the eo of evey cluste. Simulations, in this pape have demonstated that the poposed method poduces moe accuate pediction. This algoithm is easy to implement and is supeio in both pefomance and computation time to othe algoithms. Table 2. Compaison esult of the pediction eo of diffeent methods fo pediction step 85 (500 test data). Method m NRMSE test RAN-P-GQRD [1] Fuzzy system [1] Whitehead [20] González [7] Rivas [15] Ou Appoach Refeences ± ± ± ± ± ± ± ± ± ± ± ± ± ± ± [1] Besini H., Duchateau A., and Badshaw N., Using Incemental Leaning Algoithms in the Seach fo Minimal Effective Fuzzy Models, in Poceedings of 6 th Intenational Confances on Fuzzy Systems, Bacelona, pp , [2] Bezdek C., Patten Recognition with Fuzzy Objective Function Algoithms, Plenum, New Yok, [3] Duda O. and Hat E., Patten Classification and Scene Analysis, Wiley, New Yok, [4] Fank J., Davey N., and Hunt P., Time Seies Pediction and Neual Netwoks, Hatfield, UK, [5] Gonzalez J., Rojas I., and Pomaes H., A New Clusteing Technique fo Function Appoximation, IEEE Tansaction Neual Netwoks, vol. 13, no. 1, pp , [6] González J., Identificación y Optimización de Redes de Funciones de Base Radiales Paa Apoximación Funcional, PHD Thesis, Univesity of Ganada, [7] Kanjilal P. and Banejee N., On the Application of Othogonal Tansfomation fo the Design and Analysis of Feedfowad Netwoks, IEEE Tansactions on Neutal Netwoks, vol. 6, no. 2, pp , [8] Kim D. and Kim C., Foecasting Time Seies with Genetic Fuzzy Pedictoensemble, IEEE
6 Pediction of Time Seies Using RBF Neual Netwoks: A New Appoach of Clusteing 143 Tansactions on Fuzzy Systems, vo1. 5, no. 4, pp , [9] Mackey C. and Glass L., Oscillation and Chaos in Physiological Contol Systems, Science Repot, [10] Maquadt W., An Algoithm fo Least-Squaes Estimation of nlinea Inequalities, SIAM Jounal on Applied Mathematics, vol. 11, no. 4, pp , [11] Moody E. and Daken C., Fast Leaning in Netwoks of Locally Tuned Pocessing Units, Compute Jounal Neual Computation, vol. 2, no. 1, pp , [12] O L., Regulaization in the Selection of Radial Basis Function Centes, Compute Jounal Neual Computation, vol. 7, no. 3, pp , [13] Pedycz W., Conditional Fuzzy C-means, Patten Recognition Lettes, vol. 17, no. 2, pp , [14] Pomaes H., Nuevo Metodología Paa El Diseño Automático De Sistemas Difusos, PHD Thesis, Univesity of Ganada, [15] Rivas A., Diseño Y Optimización de Redes de Funciones de Base Radial Mediante Técnicas Bioinspiadas, PHD Thesis, Univesity of Ganada, [16] Rojas I., Pomaes H., Gonzalez J., and Ros A., A New Radial Basis Function Netwoks Stuctue: Application to Time Seies Pediction, in Poceedings of IEEE-INNS- ENNS Intenational Joint Confeence on Neual Netwoks (IJCNN-2000), Italy, pp , [17] Rosipal R., Koska M., and Fakas I., Pediction of Chaotic Time-Seies with a Resouce Allocating RBF Netwok, Compute Jounal Neual Pocessing Lettes, vol. 7, no. 3, pp. 1-13, [18] Runkle A. and Bezdek C., Altenating Cluste Estimation: A New Tool fo Clusteing and Function Appoximation, IEEE Tansactions on Fuzzy Systems, vol. 7, no. 3, [19] Russo M. and Patanè G., Impoving the LBG Algoithm, Lectue tes in Compute Science, vol. 1606, no. 4, pp , [20] Whitehead A. and Choate D., Coopeative- Competitive Genetic Evolution of Radial Basis Function Centes and Widths fo Time Seies Pediction, IEEE Tansactions on Neual Netwoks, vol. 7, no. 4, pp , [21] Xiaoyu L., Bing K., and Simon Y., Time Seies Pediction Based on Fuzzy Pinciples, Heidelbeg, Floida, Mohammed Awad eceived the BSc degee in industial automation engineeing in 2000, fom the Palestine Polytechnic Univesity and the PhD degee in 2005, fom the Univesity of Ganada, Spain. He is cuently assistant pofesso in the Faculty of Infomation Technology and Chai of the Depatment of compute Infomation Technology at the Aab Ameican Univesity, Palestine. Hécto Pomaes eceived the MSc degee in electonic engineeing in 1995, the MSc degee in physics in 1997, and the PhD degee in 2000, all fom the Univesity of Ganada, Ganada, Spain. He is cuently an associate pofesso in the Depatment of Compute Achitectue and Compute Technology at the Univesity of Ganada. Ignacio Rojas eceived the MSc degee in physics and electonics in 1992 and the PhD degee in 1996, both fom the Univesity of Ganada, Spain. He was at the Univesity of Dotmund, Gemany, as invited eseache fom 1993 to Osama Salameh eceived the MSc degee in compute engineeing in 1990 and the PhD degee in 1996, fom Odessa State Polytechnic Univesity, Ukaine. He is cuently assistant pofesso in the Faculty of Infomation Technology and acting dean of the same faculty at the Aab Ameican Univesity, Palestine. His cuent aeas of eseach inteest include atificial neual netwoks and aspect oiented softwae development. Mai Hamdon is cuently a student in Aab Ameican Univesity in the Depatment of Compute Science. He aea of inteests includes algoithms and atificial Intelligent.
7 144 The Intenational Aab Jounal of Infomation Technology, Vol. 6,. 2, Apil 2009
Controlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationOptical Flow for Large Motion Using Gradient Technique
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationEffects of Model Complexity on Generalization Performance of Convolutional Neural Networks
Effects of Model Complexity on Genealization Pefomance of Convolutional Neual Netwoks Tae-Jun Kim 1, Dongsu Zhang 2, and Joon Shik Kim 3 1 Seoul National Univesity, Seoul 151-742, Koea, E-mail: tjkim@bi.snu.ac.k
More informationA Two-stage and Parameter-free Binarization Method for Degraded Document Images
A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and
More informationHigh performance CUDA based CNN image processor
High pefomance UDA based NN image pocesso GEORGE VALENTIN STOIA, RADU DOGARU, ELENA RISTINA STOIA Depatment of Applied Electonics and Infomation Engineeing Univesity Politehnica of Buchaest -3, Iuliu Maniu
More informationGeneralized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences
Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationA Recommender System for Online Personalization in the WUM Applications
A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based
More informationFrequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters
Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using
More informationLecture # 04. Image Enhancement in Spatial Domain
Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency
More informationMulti-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples
Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits
More informationANN Models for Coplanar Strip Line Analysis and Synthesis
200 IJCSNS Intenational Jounal of Compute Science and Netwok Secuity, VOL.8 No.10, Octobe 2008 Models fo Coplana Stip Line Analysis and J.Lakshmi Naayana D.K.Si Rama Kishna D.L.Patap Reddy Chalapathi Institute
More informationAn Optimised Density Based Clustering Algorithm
Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,
More informationAccurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen
Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationSlotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System
Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet
More informationTransmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design
Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced
More informationA Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components
A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,
More informationA New Finite Word-length Optimization Method Design for LDPC Decoder
A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology
More informationCommunication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
More informationA ROI Focusing Mechanism for Digital Cameras
A ROI Focusing Mechanism fo Digital Cameas Chu-Hui Lee, Meng-Feng Lin, Chun-Ming Huang, and Chun-Wei Hsu Abstact With the development and application of digital technologies, the digital camea is moe popula
More informationA Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform
A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad
More informationSignal integrity analysis and physically based circuit extraction of a mounted
emc design & softwae Signal integity analysis and physically based cicuit extaction of a mounted SMA connecto A poposed geneal appoach is given fo the definition of an equivalent cicuit with SMAs mounted
More informationA Generalized Profile Function Model Based on Artificial Intelligence
Manuscipt eceived Jul., 28; evised Sep. 7, 28 A Genealized Pofile Function Model Based on Atificial Intelligence PERO RADONJA, SRDJAN STANKOVIC 2, and DRAGANA DRAZIC Institute of Foesty, 3 Kneza Viseslava
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationXFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers
XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio
More informationA New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE
5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai
More informationTopological Characteristic of Wireless Network
Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences
More informationCombinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments
Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile
More informationCLUSTERED BASED TAKAGI-SUGENO NEURO-FUZZY MODELING OF A MULTIVARIABLE NONLINEAR DYNAMIC SYSTEM
Asian Jounal of Contol, Vol. 7, No., pp. 63-76, June 5 63 -Bief Pape- CLUSTERED BASED TAKAGI-SUGENO NEURO-FUZZY MODELING OF A MULTIVARIABLE NONLINEAR DYNAMIC SYSTEM E. A. Al-Gallaf ABSTRACT This eseach
More informationTitle. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information
Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220
More informationSpiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks
Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition
More informationAnd Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,
(IJCSIS) Intenational Jounal of Compute Science and Infomation Secuity, Efficient Candidacy Reduction Fo Fequent Patten Mining M.H Nadimi-Shahaki 1, Nowati Mustapha 2, Md Nasi B Sulaiman 2, Ali B Mamat
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationAnalysis of uniform illumination system with imperfect Lambertian LEDs
Optica Applicata, Vol. XLI, No. 3, 2011 Analysis of unifom illumination system with impefect Lambetian LEDs JIAJIE TAN 1, 2, KECHENG YANG 1*, MIN XIA 1, YING YANG 1 1 Wuhan National Laboatoy fo Optoelectonics,
More informationAn Extension to the Local Binary Patterns for Image Retrieval
, pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
More informationIllumination methods for optical wear detection
Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical
More informationInput Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer
Using the Gow-And-Pune Netwok to Solve Poblems of Lage Dimensionality B.J. Biedis and T.D. Gedeon School of Compute Science & Engineeing The Univesity of New South Wales Sydney NSW 2052 AUSTRALIA bbiedis@cse.unsw.edu.au
More informationConservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery
Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in
More informationHISTOGRAMS are an important statistic reflecting the
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe
More informationImage Registration among UAV Image Sequence and Google Satellite Image Under Quality Mismatch
0 th Intenational Confeence on ITS Telecommunications Image Registation among UAV Image Sequence and Google Satellite Image Unde Quality Mismatch Shih-Ming Huang and Ching-Chun Huang Depatment of Electical
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationCellular Neural Network Based PTV
3th Int Symp on Applications of Lase Techniques to Fluid Mechanics Lisbon, Potugal, 6-9 June, 006 Cellula Neual Netwok Based PT Kazuo Ohmi, Achyut Sapkota : Depatment of Infomation Systems Engineeing,
More informationNew Algorithms for Daylight Harvesting in a Private Office
18th Intenational Confeence on Infomation Fusion Washington, DC - July 6-9, 2015 New Algoithms fo Daylight Havesting in a Pivate Office Rohit Kuma Lighting Solutions and Sevices Philips Reseach Noth Ameica
More informationA Novel Automatic White Balance Method For Digital Still Cameras
A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing
More informationBehavioral Modeling of a C-Band Ring Hybrid Coupler Using Artificial Neural Networks
RADIOENGINEERING, VOL. 19, NO. 4, DECEMBER 010 645 Behavioal Modeling of a C-Band Ring Hybid Couple Using Atificial Neual Netwoks Edem DEMIRCIOGLU 1, Muat H. SAZLI 1 R&D Satellite Design Depatment, Tuksat
More informationApproximating Euclidean Distance Transform with Simple Operations in Cellular Processor Arrays
00 th Intenational Wokshop on Cellula Nanoscale Netwoks and thei Applications (CNNA) Appoximating Euclidean Distance Tansfom with Simple Opeations in Cellula Pocesso Aas Samad Razmjooei and Piot Dudek
More informationObstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor
Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,
More informationA Neuro-Fuzzy System for Modelling of a Bleaching Plant
A Neuo-Fuzzy System fo Modelling of a Bleaching Plant R. P. Paiva a A. Douado a B. Duate b a CISUC Cento de Infomática e Sistemas da Univesidade de Coimba Depatamento de Engenhaia Infomática, PÓLO II da
More informationFast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry
Univesity of Wollongong Reseach Online Faculty of Infomatics - Papes (Achive) Faculty of Engineeing and Infomation Sciences 2010 Fast quality-guided flood-fill phase unwapping algoithm fo thee-dimensional
More informationSCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS
SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),
More informationResearch Article. Regularization Rotational motion image Blur Restoration
Available online www.jocp.com Jounal of Chemical and Phamaceutical Reseach, 6, 8(6):47-476 Reseach Aticle ISSN : 975-7384 CODEN(USA) : JCPRC5 Regulaization Rotational motion image Blu Restoation Zhen Chen
More informationA General Characterization of Representing and Determining Fuzzy Spatial Relations
7 The Intenational Aab Jounal of Infomation Technolog A Geneal Chaacteization of Repesenting and Detemining Fuzz Spatial Relations Lui Bai and Li Yan 2 College of Infomation Science and Engineeing, Notheasten
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationDrag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design
Vol.2, Issue.3, May-June 2012 pp-1253-1259 ISSN: 2249-6645 Dag Optimization on Rea Box of a Simplified Ca Model by Robust Paamete Design Sajjad Beigmoadi 1, Asgha Ramezani 2 *(Automotive Engineeing Depatment,
More informationPROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS
Poceedings of the ASME 215 Dynamic Systems and Contol Confeence DSCC215 Octobe 28-3, 215, Columbus, Ohio, USA DSCC215-999 PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS Jaeyeon Lee
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationThree-Dimensional Aerodynamic Design Optimization of a Turbine Blade by Using an Adjoint Method
Jiaqi Luo e-mail: jiaqil@uci.edu Juntao Xiong Feng Liu e-mail: fliu@uci.edu Depatment of Mechanical and Aeospace Engineeing, Univesity of Califonia, Ivine, Ivine, CA 92697-3975 Ivan McBean Alstom Powe
More informationData mining based automated reverse engineering and defect discovery
Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue
More informationConcomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution
Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants
More informationClass 21. N -body Techniques, Part 4
Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.
More informationMobility Pattern Recognition in Mobile Ad-Hoc Networks
Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif
More informationModelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set
Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;
More informationLinear Ensembles of Word Embedding Models
Linea Ensembles of Wod Embedding Models Avo Muomägi Univesity of Tatu Tatu, Estonia avom@ut.ee Kaiit Sits Univesity of Tatu Tatu, Estonia kaiit.sits@ut.ee Sven Lau Univesity of Tatu Tatu, Estonia swen@math.ut.ee
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationPerformance Optimization in Structured Wireless Sensor Networks
5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame
More informationDynamic Topology Control to Reduce Interference in MANETs
Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationKeith Dalbey, PhD. Sandia National Labs, Dept 1441 Optimization & Uncertainty Quantification
SAND 0-50 C Effective & Efficient Handling of Ill - Conditioned Coelation atices in Kiging & adient Enhanced Kiging Emulatos hough Pivoted Cholesky Factoization Keith Dalbey, PhD Sandia National Labs,
More informationSeveral algorithms exist to extract edges from point. system. the line is computed using a least squares method.
Fast Mapping using the Log-Hough Tansfomation B. Giesle, R. Gaf, R. Dillmann Institute fo Pocess Contol and Robotics (IPR) Univesity of Kalsuhe D-7618 Kalsuhe, Gemany fgieslejgafjdillmanng@ia.uka.de C.F.R.
More informationCOMPARISON OF CHIRP SCALING AND WAVENUMBER DOMAIN ALGORITHMS FOR AIRBORNE LOW FREQUENCY SAR DATA PROCESSING
COMPARISON OF CHIRP SCALING AND WAVENUMBER DOMAIN ALGORITHMS FOR AIRBORNE LOW FREQUENCY SAR DATA PROCESSING A. Potsis a, A. Reigbe b, E. Alivisatos a, A. Moeia c,and N. Uzunoglu a a National Technical
More informationClustering Interval-valued Data Using an Overlapped Interval Divergence
Poc. of the 8th Austalasian Data Mining Confeence (AusDM'9) Clusteing Inteval-valued Data Using an Ovelapped Inteval Divegence Yongli Ren Yu-Hsn Liu Jia Rong Robet Dew School of Infomation Engineeing,
More informationA New Graphical Multivariate Outlier Detection Technique Using Singular Value Decomposition
Intenational Jounal of Engineeing Reseach & echnology (IJER) ISSN: 78-08 Vol. Issue 6, August - 0 A New Gaphical Multivaiate Outlie Detection echnique Using Singula Value Decomposition Nishith Kuma, Mohammed
More informationBUPT at TREC 2006: Spam Track
BUPT at TREC 2006: Spam Tac Zhen Yang, Wei Xu, Bo Chen, Weian Xu, and Jun Guo PRIS Lab, School of Infomation Engineeing, Beijing Univesity of Posts and Telecommunications, 100876, Beijing, China yangzhen@pis.edu.cn
More informationInformation Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes
CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues
More informationPrioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
More informationImprovement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1
Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica
More informationColor Interpolation for Single CCD Color Camera
Colo Intepolation fo Single CCD Colo Camea Yi-Ming Wu, Chiou-Shann Fuh, and Jui-Pin Hsu Depatment of Compute Science and Infomation Engineeing, National Taian Univesit, Taipei, Taian Email: 88036@csie.ntu.edu.t;
More informationSTUDIES ON IMPROVING TEXTURE SEGMENTATION PERFORMANCE USING GENERALIZED GAUSSIAN MIXTURE MODEL INTEGRATING DCT AND LBP
Jounal of Theoetical and Applied Infomation Technology 3 st Octobe 206. Vol.92. No.2 2005-206 JATIT & LLS. All ights eseved. ISSN: 992-8645 www.jatit.og E-ISSN: 87-395 STUDIES ON IMPROVING TEXTURE SEGMENTATION
More informationCardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions
Cadiac C-Am CT SNR Enhancement by Combining Multiple Retospectively Motion Coected FDK-Like Reconstuctions M. Pümme 1, L. Wigstöm 2,3, R. Fahig 2, G. Lauitsch 4, J. Honegge 1 1 Institute of Patten Recognition,
More informationFifth Wheel Modelling and Testing
Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les
More informationAnnales UMCS Informatica AI 2 (2004) UMCS
Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a
More informationParallel processing model for XML parsing
Recent Reseaches in Communications, Signals and nfomation Technology Paallel pocessing model fo XML pasing ADRANA GEORGEVA Fac. Applied Mathematics and nfomatics Technical Univesity of Sofia, TU-Sofia
More informationLink Prediction in Heterogeneous Networks Based on Tensor Factorization
Send Odes fo Repints to epints@benthamscience.ae 36 The Open Cybenetics & Systemics Jounal, 204, 8, 36-32 Open Access Link Pediction in Heteogeneous Netwoks Based on Tenso Factoization Piao Yong,2*, Li
More informationEffective Missing Data Prediction for Collaborative Filtering
Effective Missing Data Pediction fo Collaboative Filteing Hao Ma, Iwin King and Michael R. Lyu Dept. of Compute Science and Engineeing The Chinese Univesity of Hong Kong Shatin, N.T., Hong Kong { hma,
More informationMULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION
Intenational Achives of the Photogammety Remote Sensing and Spatial Infomation Sciences Volume XXXIX-B3 2012 XXII ISPRS Congess 25 August 01 Septembe 2012 Melboune Austalia MULTI-TEMPORAL AND MULTI-SENSOR
More informationElastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD
The 3d Intenational Confeence on Design Engineeing and Science, ICDES 1 Pilsen, Czech Repulic, August 31 Septeme 3, 1 Elastohydodynamic Luication Analysis of Jounal Beaings Using CAD Toshihio OZASA *1,
More informationINFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM
INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300
More informationE.g., movie recommendation
Recommende Systems Road Map Intodction Content-based ecommendation Collaboative filteing based ecommendation K-neaest neighbo Association les Matix factoization 2 Intodction Recommende systems ae widely
More informationOn the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks
On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New
More information