An Entropy-based Method for Attack Detection in Large Scale Network
|
|
- Chester Barrett
- 6 years ago
- Views:
Transcription
1 INT J COMPUT COMMUN, ISSN Vol.7 (2012), No. 3 (Septembe), pp An Entopy-based Method fo Attack Detection in Lage Scale Netwok T. Liu, Z. Wang, H. Wang, K. Lu Ting Liu SKLMS Lab and MOE KLNNIS Lab, Xi an Jiaotong Univesity Xi an, Shaanxi, , P.R.China tingliu@mail.xjtu.edu.cn Zhiwen Wang, Haijun Wang, Ke Lu MOE KLNNIS Lab, Xi an Jiaotong Univesity Xi an, Shaanxi, , P.R.China wzw@mail.xjtu.edu.cn {hjwang,klu}@sei.xjtu.edu.cn Abstact: Intusion Detection System (IDS) typically geneates a huge numbe of alets with high false ate, especially in the lage scale netwok, which esult in a huge challenge on the efficiency and accuacy of the netwok attack detection. In this pape, an entopy-based method is poposed to analyze the numeous IDS alets and detect eal netwok attacks. We use Shannon entopy to examine the distibution of the souce IP addess, destination IP addess, souce theat and destination theat and datagam length of IDS alets; employ Renyi coss entopy to fuse the Shannon entopy vecto to detect netwok attack. In the expeiment, we deploy the Snot to monito pat of Xi an Jiaotong Univesity (XJTU) campus netwok including 32 C-class netwok (moe than 4000 uses), and gathe moe than 40,000 alets pe hou on aveage. The entopy-based method is employed to analyze those alets and detect netwok attacks. The expeiment esult shows that ou method can detect 96% attacks with vey low false alet ate. Keywods: Netwok Secuity, Entopy-based, IDS, Shannon Entopy, Renyi Coss Entopy. 1 Intoduction Netwok attacks ae defined as the opeations that disupt, deny, degade, o destoy infomation esident in compute netwoks o the netwoks themselves. In ecent yeas, moe and moe netwok attacks theatened the eliability and QoS of Intenet, compomised the infomation secuity and pivacy of uses. KSN (Kaspesky Secuity Netwok) ecoded 73 million Intenet bowses attacks on thei uses in 2009, and that numbe skyocketed to 580,371,937 in 2010 [1]. Symantec epoted that they ecoded 3 billion attacks fom thei global senso and client [2]. Intusion Detection System (IDS) is used to monito and captue intusions into compute and netwok systems which attempt to compomise thei secuity [3]. With the development of netwoks, a lage numbe of compute intusions occu evey day and IDSs have become a necessay addition to the secuity infastuctue of nealy evey oganization. Howeve, IDSs still suffe fom two poblems: 1) lage amount of alets. In fact, moe than 1 million alets ae geneated by Snot each day in ou eseach; 2) high false alets ate. Gina investigated the extent of false alets poblem in Snot using the 1999 DARPA IDS evaluation data, and found that 69% of total geneated alets ae consideed to be false alets [4]. These poblems esult in a huge challenge on the efficiency and accuacy of the netwok attack detection. Seveal methods have been applied to esolve the poblems of lage amount of alets and high false ate. Pietaszek used the adaptive alet classifie to educe false alets, which is tained with lots of labeled Copyight c by CCC Publications
2 510 T. Liu, Z. Wang, H. Wang, K. Lu past alets [5]. Wheeas, it is difficult to label lage volume alets geneated in lage-scale netwok. In ode to educe the false alams, Mina popose the extend DPCA to standadize the obsevations accoding to the estimated means [6]. Spathoulas and Katsikas popose a post-pocessing filte based on the statistical popeties of the input alet set [7]. Cisa employ EWMA to detect attacks by analyzing the intensity of alets [3]. In ou eseach, 32 C-class subnets ae monitoed by Snot and moe than 1 million alets ae geneated evey day. Theefoe, we popose a method to spot anomalies which is moe toleable fo the opeato athe than educe false alets. In infomation theoy, entopy is a measue of the uncetainty associated with a andom vaiable, which is widely used to analyze the data and detect the anomalies in infomation secuity. Lakhina et al ague that the distibutions of packet featues (IP addesses and pots) obseved in flow taces eveal both the pesence and stuctue of a wide ange of anomalies. Using entopy as a summaization tool to analyze taffic fom two backbone netwoks, they found that it enables highly sensitive detection of a wide ange of anomalies, augmenting detections by volume-based methods [8]. Bauckhoff ind that entopy-based summaizations of packet and flow counts ae affected less by sampling than volume-based method in lage netwoks [9]. A. Wagne and B Plattne applied entopy to detect wom and anomaly in fast IP netwoks [10]. Relative entopy and Renyi coss entopy can be used to evaluate the similaity of diffeent distibutions. Yan et al use a taffic matix to epesent netwok state, and use Renyi coss entopy to analyze matix taffic and detect anomalies athe than Shannon entopy. The esults show Renyi coss entopy based method can detect DDoS attacks at the beginning with highe detection ate and lowe false ate than Shannon entopy based method [11]. Gu et al poposed an appoach to detect anomalies in the netwok taffic using Maximum Entopy estimation and elative entopy [12]. The packet distibution of the benign taffic was estimated using Maximum Entopy famewok and used as a baseline to detect the anomalies. In this pape, an entopy-based method is poposed to detect netwok attack. The Shannon entopy and Renyi coss entopy ae employed to analyze the distibution chaacteistics of alet featues and detect netwok attack. The expeimental esults unde actual netwok data show that this method can detect netwok attack quickly and accuately. The est of the pape is oganized as follows: the method is intoduced in Section 2, and the expeimental esults ae shown in Section 3. Section 4 is the conclusion and futue wok. 2 Methodology In this pape, Snot is used to monito the netwok and five statistical featues of the Snot alet ae selected. The Shannon entopy is used to analyze the distibution chaacteistics of alet that eflect the egulaity of netwok status. When the monitoed netwok uns in nomal way, the entopy values ae elatively smooth. Othewise, the entopy value of one o moe featues would change. The Renyi coss entopy of these featues is calculated to measue the netwok status and detect netwok attacks. 2.1 Snot Alet and Featue Selection Each Snot alet consists of tens of attibutions, such as timestamp, souce IP addess (sip), souce pot, destination IP addess ( dip), destination pot, pioity, datagam length and potocol, etc. Suppose thee ae n alets geneated in time inteval t. The alets set in time inteval t is denoted as Alet(t) = {alet 1, alet 2,..., alet n }. Assuming thee ae m distinct sip and k distinct dip in Alet(t), we can geneate the distinct souce IP addesses set (SIP) and distinct destination IP addesses set (DIP): S IP = {sip 1, sip 2,..., sip m }, DIP = {dip 1, dip 2,..., dip k }.
3 An Entopy-based Method fo Attack Detection in Lage Scale Netwok 511 Suppose the numbe of alets come fom sip i is snum i, and the numbe of alets send to dip i is dnum i. The alet numbe of each souce IP (S NUM) and destination IP (DNUM) can be calculated: S NUM = {snum 1, snum 2,..., snum m }, DNUM = {dnum 1, dnum 2,..., dnum k }. Thee ae 4 default pioities of Snot alet: 1, 2, 3 and 4. The theat seveity gadually weakens fom 1 to 4(high, medium, low, info). In ode to stengthen the theat degee of high seveity alets, the theat degee of the alet i is denoted as theat i = 5 (4 pioity alet i ) in pesent wok. Suppose the theat degee sum of all alets come fom sip i is stheat i, and the theat degee sum of all alets send to dip i is dtheat i. The theat degee of each souce IP (S T HREAT) and destination IP (DT HREAT) can be calculated: S T HREAT = {stheat 1, stheat 2,..., stheat m }, DT HREAT = {dtheat 1, dtheat 2,..., dtheat k }. The datagam length is the size of the packet that beaks the alam ules of Snot. We seach the distinct datagam length of all alets, and geneate the datagam length set DGMLEN = {dgmlen 1, dgmlen 2,..., dgmlen x }, whee x is the numbe of the distinct datagam length of all alets. Suppose the numbe of alets whose datagam length equal to dgmlen i is dgmnum i. The alet numbe with diffeent datagam length can be calculated: DGMNUM = {dgmnum 1, dgmnum 2,..., dgmnum x }. Above 5 featues (S NUM, DNUM, S T HREAT, DT HREAT, DGMNUM) ae selected to evaluate the alets and detect attacks. 2.2 Shannon Entopy-based Featue Analysis Shannon entopy is used as measues of infomation and uncetainty [13]. Fo a dataset X = {x 1, x 2, x 3,..., x n }, each data item x belongs to a class x C x. The entopy of X elative to C x is defined as n H(X) = p i log 2 p i (1) whee p i is the pobability of x i in X. The distibution chaacteistics of five featues ae analyzed using Shannon entopy. The entopies of S NU M and DNU M in time inteval t can be calculated H(S ip t ) = H(Dip t ) = The entopy of S T HREAT and DT HREAT can be calculated: H(S theat t ) = m m (snum i /n) log(snum i /n) (2) k (dnum i /n) log(dnum i /n) (3) theat_o f _sip(i) sum_theat ( ) theat_o f _sip(i) log sum_theat (4)
4 512 T. Liu, Z. Wang, H. Wang, K. Lu H(Dtheat t ) = k theat_o f _dip(i) sum_theat ( ) theat_o f _dip(i) log sum_theat whee theat_o f _sip(i) is the theat sum of the alets fom sip i, theat_o f _dip(i) is the theat sum of the alets to dip i, and sum_theat is the theat sum of all the alets in ALERTS which can be calculated using n sum_theat = theat i (6) The entopy of datagam length is H(Dgmlen t ) = x (dgmnum i /n) log(dgmnum i /n) (7) Afte calculating the entopies of above featues, we can use an entopy vecto V(t) = [H(S ip t ), H(Dip t ), H(S theat t ), H(Dtheat t ), H(Dgmlen t )] to epesent the netwok status of time inteval t. 2.3 Renyi Coss Entopy-based Attack Detection The Renyi entopy, a genealization of Shannon entopy, is a measue fo quantifying the divesity, uncetainty o andomness of a system. The Renyi entopy of ode α is defined as H α (P) = 1 1 α log 2 p α (8) whee 0 < α < 1, P is a discete stochastic vaiable, and p is the distibution function of P [14]. Highe values of α, appoaching 1, giving a Renyi entopy which is inceasingly detemined by consideation of only the highest pobability events. Lowe values of α, appoaching zeo, giving a Renyi entopy which inceasingly weights all possible events moe equally, egadless of thei pobabilities. The special case α 1 gives the Shannon entopy. The Renyi coss entopy of ode α is deived as I α (p, q) = 1 1 α log 2 p α q α 1 whee p and q ae two discete vaiables, p and q ae thei distibution functions [14]. If α = 0.5, the Renyi coss entopy is symmetic, which means I α (p, q) = I α (q, p). In the est of the pape, when efeing to the coss entopy we mean the symmetic case I 0.5 (p, q) = 2 log 2 p q (10) The Renyi coss entopy is used to fuse the values of diffeent featues. As mentioned above, we use an entopy vecto V(t) = [H(S ipt), H(Dipt), H(S theatt), H(Dtheatt), H(Dgmlent)] to epesent the netwok status of time t, thus the netwok status can be viewed as a time seies of entopy vecto V(1), V(2),..., V(t). Befoe calculating Renyi coss entopy, V(t) is unitized to whee V(t) = [ H(S ip t ), H(Dip t ), H(S theat t ), H(Dtheat t ), H(Dgmlen t )] (11) H(S ip t ) = H(S ip t )/H sum H(S theat t ) = H(S theat t )/H sum H(Dip t ) = H(Dip t )/H sum (12) H(Dtheat t ) = H(Dtheat t )/H sum H(Dgmlen t ) = H(Dgmlen t )/H sum (5) (9)
5 An Entopy-based Method fo Attack Detection in Lage Scale Netwok 513 and Hsum = H(S ip t ) + H(Dip t ) + H(S theat t ) + H(Dtheat t ) + H(Dgmlen t ). To detemine if thee is any change in the netwok at time t compae with pevious time t 1, we use the following equation to calculate the Renyi coss entopy of V(t) and V(t 1) I 0.5 ( V(t), V(t 1)) = 2 log 2 p (t 1)p (t) (13) We set η as the theshold of I0.5 ( V(t 1), V(t)) to test whethe thee is a change. The choice of theshold η is netwok dependent and it can be set as expeience. Since ou pupose is to detect netwok attack, it is not enough to compae netwok status of time t to its pevious time t 1, unless we make sue that no attack occus in time t 1. Thus, the aveage of the latest n nomalized Shannon Entopies is employed to eplace the t 1, called V(t, n) V(t, n) = 1 n n V(t i) (14) Then, we calculate the Renyi coss entopy of V(t) and V(t, n), and netwok attack is detected if its absolute is geate than η. I 0.5 ( V(t, n), V(t)) = 2 log 2 p (t, n)p (t) (15) 3 Expeiment Results 3.1 Data Collection In the eseach, we have used Snot to monito 32 C-class subnets in the Xi an Jiaotong Univesity campus netwok fo two weeks, which include moe than 4,000 uses. In this pape, we select the alets gatheed in Thee ae 862,284 alets with 65 signatues, which come fom 42,473 distinct souce IP addesses and send to 11,790 distinct destination IP addesses. Figue 1: The statistical esults of alets ( ). As shown in Fig.1, fou statistical featues of alets display the tend as the people living customs and habits (the time inteval set as 5 seconds). Few alets ae geneated in the middle night; then, moe alets ae detected fom 8:00 to 10:00 when students get up successively; the alets keep the same tend fom 10:00 to 23:30; the alets collapse at last 30 minutes, since netwok constaint due to the domitoy administating ules. At the same time, the statistical featues change abuptly in some time intevals. In geneal, these abnomal upheavals ae the sign of the faults o netwok attacks.
6 514 T. Liu, Z. Wang, H. Wang, K. Lu We select two alets sets in diffeent time peiod as taining and test data set: Taining data set includes 170,516 alets geneated fom 10:00 to 14:00. These alets come fom 13,148 IP addesses and send to 7,570 IP addesses. By analyzing these alets manually, we identify 87 host scan attacks, 5 pot scan attacks, 1 DoS attack and 1 host intusion. Test data set includes 578,389 alets geneated fom 14:00 to 23:30. These alets come fom 29,327 IP addesses and send to 10,590 IP addesses. By analyzing these alets manually, we identify 203 host scan attacks, 7 pot scan attacks, 6 DoS attack, 3 host intusion and 1 wom attack. 3.2 Entopy-based Attack Detection The taining data is evaluated by Shannon entopy, as shown in Fig. 2 (a). We emove the alets associated to tue attacks, which called as Attack Alet. The emaindes ae called as Flase Alet. We e-evaluate the Noise Alet in the taining data set, as shown in Fig. 2 (b). The Shannon entopies ae elatively smooth when no attack occus; othewise, one o some of the values would change abuptly. (a) All alets (b) False alets Figue 2: Shannon entopy. Although the Shannon entopies eflect the egulaity of netwok status, it is difficult to detect attack diectly by using five fixed thesholds. Because the Shannon entopy value vaies with the activities of end uses even the netwok uns in nomal way. In ou expeiment, the Renyi coss entopy is used to fuse the Shannon entopy of five statistical featues to detect attack. As shown in Fig. 3, we calculate the Renyi coss entopy of the alets in tain data set using (13). It is clealy shown that 1) the Renyi coss entopy will change shaply when the netwok ae attacked, see Fig. 3 (a); 2) the Renyi coss entopy will be close to 0 without the lage-scale netwok attacks and failues, see Fig. 3 (b). Thus, it is easy to detect attack using fixed theshold. In the expeiments, when η detect = 0.016, 84 attacks can be detected fom 94 attacks with 11 false detections. 81 host scan attacks can be detected fom 87 host scans. The missed scan attacks last fo a elative long time and with small scan density. 1 pot scan is detected fom 5 pot scans. 1 host intusion and 1 DoS attack ae detected successfully. Accoding to (14) and (15), the n and η ae impotant fo the accuacy of attack detection. In the expeiments, we set η base = { 0.001, 0.002, 0.003,..., 0.04} and n = {5, 10, 15,..., 200}. Fo each combination of η base and n, the taining data is analyzed in the following method. Fistly, each V(t) is unitized to V(t) using (11) and (12); Secondly, the Shannon entopy can be calculated using (14). Its unitized fom is V(t, n). Finally, V(t) is compaed with V(t, n) using (15) to calculate Renyi coss entopy value.
7 An Entopy-based Method fo Attack Detection in Lage Scale Netwok 515 (a) All alets (b) False alets Figue 3: Renyi coss entopy. In the expeiment, ROC (Receive Opeating Chaacteistic) is used to descibe the detection esults. ROC is a gaphical plot of tue positive ate and false positive ate [15]. Fig. 4(a) shows the ROC cuve of detection esults in taining data, whee the size of NTS n and base theshold η base equals (5, 0.005), (50, 0.02) and (100, 0.04) sepaately. When detection theshold η detect comes to 0, almost all the time intevals ae detected as netwok attack. Thus, the detection false positive ate and hit ate ae both nea 100%. A detection esult with high hit ate and low false ate is consideed to be a good esult. In this case, the ROC cuve is plotted at the top left cone, and the AUC value (Aea Unde ROC Cuve) has lage value. In this pape, we use AUC value to evaluate the detection esults. The best combination of n and?base can be obtained using taining data. As shown in Fig. 4(b), the AUC values of all the combinations ae calculated, and the highest AUC is when n = 95 and η base = (a) ROC (b) AUC Figue 4: Detection esult on taining data set. 3.3 Testing The test data set is analyzed to detect the attacks using entopy-based method. As shown in Fig. 5, 211 attacks can be detected fom 220 attacks (detection ate is as high as 96%) with 8 false detections. 197 host scan attacks can be detected fom 203 host scans. 4 pot scans ae detected fom 7 pot scans. 3 host intusions, 1 wom attack and 6 DoS attacks ae detected successfully.
8 516 T. Liu, Z. Wang, H. Wang, K. Lu Figue 5: Attack detection esults on test data set. 4 Conclusion In this pape, a new netwok attack detection method based on entopy is poposed. The souce IP, destination IP, alet teat and alet datagam length ae selected fom tens of Snot alet attibutions. The Shannon entopy is used to analyze the alets to measue the egulaity of cuent netwok status. The Renyi coss entopy is employed to fuzz the Shannon entopy on diffeent featues to detect netwok attacks. In the expeiments, the netwok taffic of moe than 4000 uses in 32 C-class netwok ae monitoed using Snot alets, geneated fom 10:00 to 23:30 Dec , ae selected and sepaated into taining data set and test data set. The expeiments show that the Renyi coss entopy value is nea 0 when the netwok uns in nomal, othewise the value will change abuptly when attack occus. The attack detection ate of entopy method is as high as 96% with only 8 false alets. In next step, moe alets fom diffeent time segments will be collected to test ou method and an attack classification method will be consideed. Acknowledgment This wok was suppoted by the National Natual Science Foundation ( , , ), National Science Fund fo Distinguished Young Scholas ( ) and the Fundamental Reseach Funds fo the Cental Univesities. Bibliogaphy [1] A. Gostev, "Kaspesky Secuity Bulletin. Malwae Evolution 2010," Kaspesky, [2] M. Fossi, G. Egan, K. Haley, E. Hohnson, T. Mack and A. Et, "Symantec Global Intenet Secuity Theat Repot Tends fo 2010," Symantec, [3] P. Cisa, S. Bosnjak and S. M. Cisa, "EWMA Algoithm in Netwok Pactice," Intenational Jounal of Computes, Communications & Contol, vol.5, pp , [4] G. C. Tjhai, M. Papadaki, S. M. Funell and N. L. Clake, in Lectue Notes in Compute Science (including subseies Lectue Notes in Atificial Intelligence and Lectue Notes in Bioinfomatics), Tuin, Italy, 2008, pp [5] T. Pietaszek, "Using Adaptive Alet Classification to Reduce False Positives in Intusion Detection- Recent Advances in Intusion Detection," vol.3224, pp , 2004.
9 An Entopy-based Method fo Attack Detection in Lage Scale Netwok 517 [6] J. Mina and C. Vede, "Fault detection fo lage scale systems using Dynamic Pincipal Components Analysis with adaptation," Intenational Jounal of Computes, Communications & Contol, vol.2, pp , [7] G. P. Spathoulas and S. K. Katsikas, in th Intenational Confeence on Systems, Signals and Image Pocessing, IWSSIP 2009, Chalkida, Geece, [8] A. Lakhina, M. Covella and C. Diot, in Compute Communication Review, New Yok, United States, 2005, pp [9] D. Bauckhoff, B. Tellenbach, A. Wagne, M. May and A. Lakhina, in Poceedings of the ACM SIGCOMM Intenet Measuement Confeence, IMC, Rio de Janeio, Bazil, 2006, pp [10] A. Wagne and B. Plattne, in Poceedings of the Wokshop on Enabling Technologies: Infastuctue fo Collaboative Entepises, WET ICE, Linkoeping, Sweden, 2005, pp [11] R. Yan and Q. Zheng, "Using Renyi coss entopy to analyze taffic matix and detect DDoS attacks," Infomation Technology Jounal, vol.8, pp , [12] Y. Gu, A. McCallum and D. Towsley, "Detecting anomalies in netwok taffic using maximum entopy estimation," in Poc Poceedings of the 5th ACM SIGCOMM confeence on Intenet Measuement, pp. 32. [13] C. E. Shannon, "A mathematical theoy of communication," SIGMOBILE Mob. Comput. Commun. Rev., vol.5, pp. 3-55, [14] C. E. Pfiste and W. G. Sullivan, "Renyi entopy, guesswok moments, and lage deviations," IEEE Tansactions on Infomation Theoy, vol.50, pp , [15] A. P. Badley, "The use of the aea unde the ROC cuve in the evaluation of machine leaning algoithms," Patten Recognition, vol.30, pp , 1997.
IP 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 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 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 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 informationControlled 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 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 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 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 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 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 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 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 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 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 informationAssessment of Track Sequence Optimization based on Recorded Field Operations
Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment
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 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 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 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 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 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 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 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 informationTopic -3 Image Enhancement
Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking
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 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 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 informationExtract Object Boundaries in Noisy Images using Level Set. Final Report
Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous
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 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 informationThe EigenRumor Algorithm for Ranking Blogs
he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy
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 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 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 informationA Comparative Impact Study of Attribute Selection Techniques on Naïve Bayes Spam Filters
A Compaative Impact Study of Attibute Selection Techniques on Naïve Bayes Spam Filtes J. R. Méndez, I. Cid, D. Glez-Peña, F. Fdez-Riveola, M. Rocha 2 Dept. Infomática, Univesity of Vigo, Escuela Supeio
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 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 informationAUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY
AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY Chistophe Waceman (1), William G. Pichel (2), Pablo Clement-Colón (2) (1) Geneal Dynamics Advanced Infomation Systems, P.O. Box 134008 Ann Abo
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 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 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 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 informationCryptanalysis of Hwang-Chang s a Time-Stamp Protocol for Digital Watermarking
Cyptanalysis of Hwang-Chang s a Time-Stamp Potocol fo Digital Watemaking *Jue-Sam Chou, Yalin Chen 2, Chung-Ju Chan 3 Depatment of Infomation Management, Nanhua Univesity Chiayi 622 Taiwan, R.O.C *: coesponding
More informationAPPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE
APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE 1 YAROSLAVTSEV A.F., 2 Al-THUNEIBAT S.A., 3 AL TAWALBEH N.A 1 Depatment of Netwoking, SSUTI, Novosibisk, Russia
More informationCOLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE
COLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE Slawo Wesolkowski Systems Design Engineeing Univesity of Wateloo Wateloo (Ont.), Canada, NL 3G s.wesolkowski@ieee.og Ed Jenigan
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 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 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 informationModeling spatially-correlated data of sensor networks with irregular topologies
This full text pape was pee eviewed at the diection of IEEE Communications Society subject matte expets fo publication in the IEEE SECON 25 poceedings Modeling spatially-coelated data of senso netwoks
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 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 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 informationMethod of controlling access to intellectual switching nodes of telecommunication networks and systems
ISSN (e): 2250 3005 Volume 05 Issue 05 ay 2015 Intenational Jounal of Computational Engineeing eseach (IJCE) ethod of contolling access to intellectual switching nodes of telecommunication netwoks and
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 informationIP Multicast Simulation in OPNET
IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok
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 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 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 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 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 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 informationThe Internet Ecosystem and Evolution
The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee
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 informationSeparability and Topology Control of Quasi Unit Disk Graphs
Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,
More informationModeling Spatially Correlated Data in Sensor Networks
Modeling Spatially Coelated Data in Senso Netwoks Apoova Jindal and Konstantinos Psounis Univesity of Southen Califonia The physical phenomena monitoed by senso netwoks, e.g. foest tempeatue, wate contamination,
More informationA Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.
A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of
More informationMultidimensional Testing
Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of
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 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 informationEmbeddings into Crossed Cubes
Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability
More informationHierarchically Clustered P2P Streaming System
Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.
More informationarxiv: v2 [physics.soc-ph] 30 Nov 2016
Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity
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 informationSimulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM
J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on
More informationA Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation
A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801
More informationDecentralized Trust Management for Ad-Hoc Peer-to-Peer Networks
Decentalized Tust Management fo Ad-Hoc Pee-to-Pee Netwoks Thomas Repantis Vana Kalogeaki Depatment of Compute Science & Engineeing Univesity of Califonia, Riveside Riveside, CA 92521 {tep,vana}@cs.uc.edu
More informationAN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE
AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationErasure-Coding Based Routing for Opportunistic Networks
Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant
More information3D Hand Trajectory Segmentation by Curvatures and Hand Orientation for Classification through a Probabilistic Approach
3D Hand Tajectoy Segmentation by Cuvatues and Hand Oientation fo Classification though a Pobabilistic Appoach Diego R. Faia and Joge Dias Abstact In this wok we pesent the segmentation and classification
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 informationIntroduction to Engineering Seismology Lecture 18
Lectue 18: Intoduction to GIS, Integation of hazad paametes on GIS platfom; Final zonation map pepaation with case study of Bangaloe Topics Geogaphical Infomation System (GIS) Analytic Hieachy Pocess (AHP)
More informationSecure Collaboration in Mediator-Free Environments
Secue Collaboation in Mediato-Fee Envionments Mohamed Shehab School of Electical and Compute Engineeing Pudue Univesity West Lafayette, IN, USA shehab@pudueedu Elisa Betino Depatment of Compute Sciences
More information(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)
1 Multi Path PERT Ankit Singh and A. L. Naasimha Reddy Electical and Compute Engineeing Depatment, Texas A&M Univesity; email: eddy@ece.tamu.edu. Abstact This pape pesents a new multipath delay based algoithm,
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 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 informationMesh Simplification Using Vertex Clustering Based on Principal Curvature
Intenational Jounal of Multimedia and Ubiquitous Engineeing, pp.99-110 http://dx.doi.og/10.1457/ijmue.015.10.9.11 Mesh Simplification Using Vetex Clusteing Based on Pincipal Cuvatue Zhen Hua, Zilong Huang
More informationEvent-based Location Dependent Data Services in Mobile WSNs
Event-based Location Dependent Data Sevices in Mobile WSNs Liang Hong 1, Yafeng Wu, Sang H. Son, Yansheng Lu 3 1 College of Compute Science and Technology, Wuhan Univesity, China Depatment of Compute Science,
More informationModule 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.
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 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 informationStrictly as per the compliance and regulations of:
Global Jounal of HUMAN SOCIAL SCIENCE Economics Volume 13 Issue Vesion 1.0 Yea 013 Type: Double Blind Pee Reviewed Intenational Reseach Jounal Publishe: Global Jounals Inc. (USA) Online ISSN: 49-460x &
More informationDUe to the recent developments of gigantic social networks
Exploing Communities in Lage Pofiled Gaphs Yankai Chen, Yixiang Fang, Reynold Cheng Membe, IEEE, Yun Li, Xiaojun Chen, Jie Zhang 1 Abstact Given a gaph G and a vetex q G, the community seach (CS) poblem
More informationWIRELESS sensor networks (WSNs), which are capable
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. XX, NO. XX, XXX 214 1 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang, Kuan
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 informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationDetecting Compromised Routers via Packet Forwarding Behavior
MIZRAK LAYOUT 2/14/08 4:11 PM Page 2 Detecting Compomised Routes via Packet Fowading Behavio Alpe T. Mizak, VMwae Stefan Savage and Keith Mazullo, UCSD Abstact While it is widely undestood that ciminal
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 informationQuality Aware Privacy Protection for Location-based Services
In Poceedings of the th Intenational Confeence on Database Systems fo Advanced Applications (DASFAA 007), Bangkok, Thailand, Apil 9-, 007. Quality Awae Pivacy Potection fo Location-based Sevices Zhen Xiao,,
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More information