Firewall Packet Filtering Optimization using Statistical Traffic Awareness Test
|
|
- Antony Pope
- 6 years ago
- Views:
Transcription
1 Firewall Packet Filtering Optimization uing Statitical Traffic Awarene Tet Zouheir Trabel Liren Zhang and Safaa Zeidan Faculty of Information Technology UAE Univerity Al-Ain, UAE {trabel lzhang, Abtract. In thi paper, we preent a mechanim that utilize network traffic behavior and packet filtering tatitic to improve firewall performance. The propoed mechanim allow optimizing the filtering rule order and their correponding field order upon certain threhold qualification following the divergence of the traffic behavior. The current and previou traffic window tatitic are ued to check the ytem tability uing Chi-Square Tet. The achieved gain in proceing time compared to related mechanim i due to minimizing the overhead correponding to the frequency of updating the ecurity policy rule/field tructure. Keyword: Packet Claification, Rule Order, Rule-field Order, Sytem Stability, Chi-quare Tet. 1 Introduction In thi paper, we propoe a mechanim to optimize firewall early acceptance path a well a early rejection path. Baed on traffic tatitic, a deciion i made regarding whether or not there i a need to reorder the rule and/or rule-field order. The propoed mechanim i baed on the following three optimization level: 1) Filtering rule are reordered in a decending manner according to their packet matching hitogram. Thi will yield to fater packet filtering time for the next imilar traffic (optimization in the acceptance path). ) Rule-field are reordered in a decending manner according to their packet not matching hitogram. Thi will reduce the time needed for tuple comparion (optimization in the rejection path). 3) The firewall will continue filtering packet uing certain rule and rule-field order under a certain threhold qualification (the ytem tability deciion). Thi will reduce the time needed for the reordering proce and updating the firewall ecurity policy tructure. The three optimization level will minimize the total packet filtering time and therefore the firewall performance will be improved ignificantly. The paper i organized a follow: Section dicue the related work. Section 3 preent the mathematical model of the propoed mechanim. Section 4 evaluate the adfa, p. 1, 011. Springer-Verlag Berlin Heidelberg 011
2 firewall performance againt the propoed mechanim. Finally, Section 5 conclude the paper. Related Work The mot early reearch work on firewall focu on the improvement of packet earching time uing variou mechanim including hardware-baed olution [6, 7], pecialized data tructure [8, 9, 5, 10, 11, 1], and heuritic [5]. Reearch work in [17, 3, 4, 13 and 14] focu on the tatitical filtering cheme to improve the average packet filtering time. The tructure of earching by taking into account the packet flow dynamic i introduced in [3, 14, 15, 16]. The idea of firewall optimization through early packet rejection wa introduced in [1,, 3, 1and 18]. In [1] early packet rejection i done through rule- field ordering. In [] early packet rejection i done through multilevel filtering proce including field and interection filtering module. In [3] a new approach named FVSC i propoed to optimize the rejection path. PBER technique in [18] i conidered a a generalization of FVSC [3] it find hort cut for both accepted and rejected packet. In [1] a binary earch on prefix length algorithm i applied to every policy filtering field along with the property of playing the earch tree node while maintaining the min-node at high level for early packet rejection. The mot relative to thi paper i reearch work dealing with rule reordering which fall into two categorie: Rule reordering including dependency a in[16, 3,] thee reearch work give an approximation of the optimal rule order. Dijoint Rule reordering a in [4, 5]. Up to our knowledge all reearch work done in the field of firewall optimization through rule reordering, emphai on the importance of rule field reordering in early packet rejection. In [1] we were the firt to propoe the idea of rule-field reordering and focu on it major effect in reducing the overall packet proceing time. 3 PROPOSED WORK In thi paper, we ue the Firewall Deciion Tree Tool (FDT) decribed in [6]. FDT tool releae the dependency relation between rule. A a reult, the filtering rule can be reordered according to their matching frequencie. The mathematical model in thi paper i baed on rule and rule-field hitogram propoed in [1]. A mechanim named Dynamic Rule and Rule-Field Ordering (DR- RFO) i propoed in [1]. In which the reordering proce i carried out at the end of each network traffic window. Thu, in thi paper we propoe a mechanim named Dynamic Rule and Rule-Field Ordering with Deciion Tet (DR-RFOD) to organize the reordering proce according to the ytem tability tet. Since the propoed work in thi paper ue the rule and rule-field hitogram, we will decribe them in more detail in the following ection. Then we will dicu the deciion regarding the rule/rule-field reordering procee.
3 3.1 Mathematical model Hitogram of rule matching probability and field not matching probability. Conidering that packet matching tet in firewall i baed on a ecurity policy with N rule, excluding the default Deny rule. Each rule conit of a maximum number of M field, excluding the action field. A N M matrix vector F( repreent the ecurity policy, that i: 1) F(1,1)... F(1,... F(1, M1) F( F( 1)... F(... F( Mi ) N) F( N,1)... F( N,... F( N, M N ) (1) Where iϵ{1,,,n} and j ϵ{1,,,m i } are the indice for rule and field repectively. Let a w, ( l and b w, ( l repreent the tatu of the l th packet matching and not matching an active field F( in rule, repectively. Where w (w ϵ{1,,,w}), ( ϵ{1,,,s}) and l(l ϵ{1,,,l}) are the window, egment and packet indice, repectively. During the proce, when the l th packet matche the field F( in the rule, the tate value of a w, ( l i incremented by 1, while b w, ( l remain no change. That i: aw, l aw, l1 1 bw, l bw, l1 By contrat, when the l th packet doe not match the field F(in the rule, the tate of b w, ( l i incremented by 1, while a w, ( l remain no change. That i: () aw, l aw, l1 bw, l bw, l1 1 (3) Note that if the l th packet i not teted for the field F( in the rule, the tate value of a w, ( l and b w, ( l remain no change. That i: a b w, w, l l a b w, w, Let C w, (=a w, (M i ) and D w, (=b w, ( preent the number of packet in the th egment matching rule i=1,,,n and not matching field F( j=1,,,mi contained in on egment ba repectively. Therefore, the probability of packet matching rule on egment bai can be defined a: P r l1 l1 w, C ( for 1 i N (4) C (, (5) L w
4 Likewie, the probability of packet not matching field F( j=1,,,mi in the rule on egment bai can be defined a: Pr D w, Dw, (1,1) L Dw, (1, j1 L Dw, (1, k) 1 k Dw, ( 1) Mi1 Dw, ( i 1, k) k1 Dw, M i 1 j1 Dw, ( i 1, k) Dw, k) k1 k1 for i 1, j 1 for i 1, j M1 for i N, j 1 for i N, j Mi (6) More explanation can be found in [1]. At the end of each window there will be an average probability for each rule and field which give u a further indication of the importance of that rule or field, that i: Pr Pr Where P r R w ( ) ( F j ) ) ( C ( i )) S Pr w, i ) w = 1 S for 1 i N (7) S Pr =1 i ) = w ( D ( j )) w, ( and P r F w F( in in the w th window, repectively. S for 1 i N,1 j Mi (8) ( are the average probabilitie for and Reordering Deciion. A-Statitical rule reordering deciion. Aume that the firewall conit of N filtering Rule with certain order in the previou window (w-1) th. We want to know if thi order will be changed or not in the w th window. Firt let u introduce ome notation to be ued in Table 1. Table 1. Previou and current ituation for policy filtering Rule. State(k) R 1 R R N Total Previou(w-1) n (w-1), 1 E (w-1),1 Current(w) n w,1 E w,1 n (w-1), E (w-1), n w, E w, n (w-1),n E (w-1),n n w,n E w,n Total C 1 C C N T Let n (w-1),i and n w,i (oberved value) are the number of matched packet by Rule in the (w-1) th and w th window, repectively. To know if there i a ignificant T (w-1) T w
5 difference between the oberved and expected value we ue the Chi-quare tet to tet the equality of two multinomial ditribution. That i: w N ( nk, i - Εk, i ) ( Rule ( N)) (9) E k( w1) i1 k, i where E k,i i the expected number of packet to be matched by in the current or previou window. That i: Tk Ci Ek, i for k w,( w 1)} (10) T If p_value ( ( Rule ( N)),dF)<α The ytem i not table and there i a need to reorder the ecurity policy rule according to hitogram of packet matching on window bai in decending order. The new rule ditribution will be computed uing the following equation, where 1 ( P _ value ) : P r ( ) w Pr ( ) w (1 ) P r ( ) w1 (11) Otherwie, if p_value ( ( Rule ( N)),dF)>α The ytem i table, no need to reorder the rule. The ame previou rule order will be ued for the next window and the rule hitogram will be renewed uing the above equation. The probability of the current window i given more weight. By doing thi the behavior of the traffic in the previou window will not be ignored and will have relatively le effect than the traffic behavior in the current window. A a reult the new computed average probabilitie would allow producing a better optimized rule ordering for the next window traffic. Thi procedure will be followed for each rule field. B)Statitical policy rule-field reordering deciion. Here, we dicu whether to decide to reorder the policy rule field or not uing the number of packet non-matching field F( in rule Where i ϵ{1,,,n}, j ϵ{1,,,m i }. So the ame concept of chi-quare ued in the previou ection will be applied for field of each rule in the ecurity policy a hown in table. That i: Where m k, j w Mi ( mk, j - Εk, j ) ( F( ) (1) E k( w1) j1 k, j (oberved) i the number of non-matched packet by F( in, k refer to the current or previou ituation. E k,j i the expected number of packet non matching F( in in the current or previou window. That i: TkC j Ek, j for k w,( w1)} (13) T
6 Table. Previou and current ituation for policy filtering Field for Rule R i. State(k) F 1 F F Mi Total Previou(w-1) m (w-1), 1 E (w-1),1 Current(w) m w,1 E w,1 m (w-1), E (w-1), m w, E w, m (w-1),mi E (w-1),mi m w,mi E w,mi Total C 1 C C Mi T ( F( ) i If p_value ( ),df)<α There i a need to reorder the field in according to hitogram of packet non matching F( in on window bai in decending order. The new F( ditribution in will be computed uing the following equation, where 1 ( P _ value ). P r F Pr F (1 ) Pr F w w w1 T (w-1) (14) Otherwie, if p_value ( χ ( F( j )) i ),df)>α no need to reorder the field in. Rule and rule-field reordering procee are independent of each other. Depending on ( Rule ( N)) and ( F( ) tet, the ytem may change the rule order without changing the field order and vice vera or changing only ome rule field order. The following algorithm how the main operation of the tatitical module. In Algorithm 1 the buildup of the candidate rule lit that are independent and equivalent to the original ecurity policy uing FDT tool take place a well a getting the initial rule and rule-field probabilitie to tart with after training the ytem S 0 egment. Algorithm i reponible for packet filtering proce uing function tuple_comparaion(l). Then it compute rule and rule-field tatitic (Line 1-13) and calculate the correponding egment probabilitie (Line 14-15). Line (18-19) compute the average rule and rule-field probability on window bai. ( F( ) and ( Rule ( N)) are computed in (Line 5-38). Alo, the reordering proce for rule-field and rule i done in a decending manner according to current average probability baed on if tatement in line 30 and 37. The current rulefield and rule average probability are computed in (Line 9 and 36). In (Line 38-4) the previou tate variable are updated to be ued in the next traffic window. Algorithm 1: Startup Phae 1: <SP> FDT(Policy Rule) : 0 1 3:l 0 1 4:repeat 5: iniialize(a 0,b 0) 6: whilel 0<=L 0 do 7: l 0 get_pak(f 0) 8: tuple_comparaion(l w) 9: l 0 l : end while 11: no_mat_r lat_field(a) 1: no_nonmat_f r r_field(b) T w
7 13: pr prob_rule (no_mat_r ) 14: pfield r prob_field(no_nonmat_f r) 15: : until 0=S 0 17: avgpr 0 avg(um(pr 0) 0=1:S0) 18: avgpfield r0 avg(um(pfield r0) 0=1:S0) 19: previou_r 0 um(no_mat_r 0) 0=1:S0 0: previou_rfield r0 um(no_nonmat_f r0) 0=1:S0 1: previou_avgpr 0 avgpr 0 : previou_avgpfield r0 avgpfield r0 Algorithm : Sytem Stability 1:w 1 : 1 3:repeat 4: l 1 5: repeat 6: iniialize(a,b) 7: whilel<=ldo 8: l w get_pak(f w) 9: tuple_comparaion(l w) 10: l l+1 11: end while 1: no_mat_r lat_field(a) 13: no_nonmat_f r r_field(b) 14: pr prob_rule (no_mat_r ) 15: pfield r prob_field(no_nonmat_f r) 16: +1 17: until=s 18: avgpr avg(um(pr ) =1:S ) 19: avgpfield r avg(um(pfield r) =1:S ) 0: //*current tate*// 1: current_r um(no_mat_r ) =1:S : current_rfield r um(no_nonmat_f r) =1:S 3: current_avgpr avgpr 4: current_avgpfield r avgpfield r 5://*Rule-Field tability tet*// 6: foreachr ϵ R 7: p_value r chi_quare(previou_rfield r, current_rfield r) 8: δ r 1- p_value r 9: current_avgpfield r (1- δ r)* current_avgpfield r + δ r * previou_avgpfield r 30: ifp_value r<α 31: Rule r reorder(rule r, current_avgpfield r) 3: end if 33: end for 34://*Rule tability tet*// 35: p_value R chi_quare(previou_r, current_r) 36: current_avgpr (1- δ r)* current_avgpr + δ r * previou_ avgpr 37: ifp_value R< α reorder(r, current_avgpr) 38: end if
8 Rule Order 39: /*update the previou tate*/ 40: previou_r current_r 41: previou_rfield r current_rfield r 4: previou_avgpr current_avgpr 43: previou_avgpfield r current_avgpfield r 44: w w +1 45:untilw=W 4 Evaluation 4.1 DR-RFOD v DR-RFO In order to evaluate the performance of the propoed mechanim, an algorithm that dynamically change the order of the rule and rule-field according to ytem tability ha been implemented uing MATLAB programming environment. Thi experiment i done uing 0 filtering rule and 00 traffic window each of 1000 packet. Thee number are ued jut to make it eay to trace the rule and field ordering poition proce uing both DR-RFO and DR-RFOD mechanim. DR-RFOD v DR-RFO according to rule reordering proce. The algorithm in DR-RFO and DR-RFOD mechanim tart optimizing the rule poition after treating the econd window. In DR-RFO mechanim poition of the rule are updated dynamically after treating each window. On the other hand, in DR- RFOD mechanim poition of the rule are updated dynamically according to eq. (9) and eq. (11) after ytem tability tet. Fig.1 compare the evolution in R1 a an example uing DR-RFO and DR-RFOD mechanim. The horizontal contant line in the figure how the correponding window for DR-RFOD mechanim where the ytem wa table according to eq. (9) and no rule reordering proce i done Rule 1 DRFO DRFOD Window No. Fig. 1. Evolution in R1 uing DR-RFO and DR-RFOD.
9 CumulativeExeTime() Field Order DR-RFOD v DR-RFO according to rule-field reordering proce. The ame concept ued in rule reordering proce will be ued in rule-field reordering proce. In DR-RFO mechanim poition of the rule-field are updated dynamically after treating each window. On the other hand, in DR-RFOD mechanim poition of the rule-field are updated dynamically according to eq. (1) and eq. (14) after ytem tability tet. Fig. compare the evolution for field Source-IP in R1 a an example uing DR-RFO and DR-RFOD mechanim. 9 8 Field Source-IP in R1 DRFO DRFOD Window No. Fig.. Evolution in Field Source-Port in R1 uing DR-RFO and DR-RFOD. Fig. 3 how the cumulative proceing time for DR-RFO and DR-RFOD for different value of α. For α=0.005, the gain for uing DR-RFOD for 00 traffic window i (), while for α=0.05 the gain i18.855() DRFD for different alfa v DRF DRF DRFD Alfa=0.5 DRFD Alfa=0.05 DRFD Alfa= Window No. Fig. 3. Cumulative proceing time for DR-RFOD v DR-RFO for different α value.
10 ExeTime() 4. The effect of error preciion (α) on DR-RFOD mechanim Thi experiment tudie the effect of different α value in the cumulative execution time and the number of rule/rule-field reordering proce. Fig.4 give an idea about the execution time needed for each of the 00 window for different α value Execution time for different Alfa Alfa=0.5 Alfa=0.05 Alfa= Window No. Fig. 4. Execution time for DR-RFOD for different α value. Table 3 compare different value of α and their correponding number of rule/rule-field reordering proce. When α decreae: 1) The frequency of the reordering proce i alo decreaed thi i becaue for a given computed χ, decreaing the value of α will increae χ α ending with χ α >computed χ and therefore no need for reordering. ) The cumulative execution time increae. Thi i becaue in fact when we decide not to reorder we might keep the ytem running with a non-efficient configuration (order) for longer time and therefore it might take longer execution time than when we reorder often epecially if the cot of re-ordering i mall and thi depend on the number of rule and rule-field in the ecurity policy. Table 3. The effect of different alfa in reordering frequency and cumulative proceing time α No. Reordering Rule/Field Cumulative Proceing Time ()DR-RFOD R RF Total ()
11 5 Concluion In thi paper, we have propoed a mechanim to improve firewall packet filtering time through optimizing the order of ecurity policy filtering rule and rule-field. The propoed mechanim i baed on reordering rule and rule-field according to packet matching and non-matching hitogram, repectively. The current and previou traffic window tatitic are ued to check the ytem tability uing Chi-Square Tet. If the ytem tability tet indicate that the firewall i table the ame current rule and/or rule-field order are ued for filtering the next traffic window. Otherwie, an update of the rule and/or rule-field order tructure i required for filtering the next traffic window. The propoed mechanim give better cumulative execution time compared to DR-RFO mechanim. Alo, the effect of α on the cumulative proceing time and on the frequency of the reordering proce ha been dicued. In future work, we intend to invetigate the effect of dynamically changing the traffic window ize, and improve the propoed mathematical model to take into conideration ecurity policy with dependent rule. 6 Acknowledgment The author acknowledge the upport of NRF Foundation and Emirate Foundation through reearche grant 1T03 and 009/161, repectively. 7 Reference 1. Z. Trabel L. Zhang and S. Zeidan. Packet Flow Hitogram to Improve Firewall Efficiency. In ICICS, December 011. Z. Trabel S. zeidan. Multilevel Early Packet Filtering Technique baed on Traffic Statitic and Splay Tree for Firewall Performance Improvement. In ICC, June K. Lan and J. Heidemann. On the correlation of internet flow characteritic. Technical Report ISI-TR-574, USC/ISI, A. El-Atawy, T. Samak, E. Al-Shaer and H.Li. Uing online traffic tatitical matching for optimizing packet filtering performance. IEEE INFOCOM 07, page , P. Gupta and N. McKeown. Algorithm for packet claification. IEEE Network, 15():4 3, F. Baboecu and G. Varghee. Scalable packet claification. In ACM SIGCOMM 01, A. J. McAulay and P. Franci. Fat routing table lookup uing CAM. In IEEE INFOCOM 93, March V. Srinivaan, Subhah Sur and George Varghee. Packet claification uing tuple pace earch. In Computer ACM SIGCOMM Communication Review, page , October A. Feldmann and S. Muthukrihnan. Tradeoff for packet claification. In IEEE INFOCOM 00, March P. Gupta and N. McKeown. Packet claification uing hierarchical intelligent cutting. In Interconnect VII, Augut 1999.
12 11. E. Cohen and C. Lund. Packet claification in large ip: deign and evaluation of deciion tree claifier. In SIGMETRICS 05:Proceeding of the 005 ACM SIGMETRIC international conferenceon Meaurement and modeling of computer ytem, page 73 84, New York, NY, USA, 005. ACM Pre. 1. Thoma Y. C. Woo. A modular approach to packet claification: Algorithm and reult. In IEEE INFOCOM 00, page 113 1, March P. Gupta, B. Prabhakar, and S. Boyd. Near optimal routing lookup with bounded wort cae performance. In IEEE INFOCOM 00, L. Kencl and C. Schwarzer. Traffic-adaptive packet filtering of denial of ervice attack. In WOWMOM 06: The 006 International Sympoium on on World of Wirele, Mobile and Multimedia Network, page , Wahington, DC, USA, S. Acharya, M. Abliz, B. Mill and T.F. Znat Optwall: a hierarchical traffic-aware firewall, Proceeding of 14th Annual Network & Ditributed Sytem Security Sympoium (NDSS), San Diego, US, February H. Hamed and E. Al-hear: Dynamic Rule-ordering optimization for High-peed Firewall Filtering. In ASIACC 06, March 1-4, 006, Tuipe Taiwam. 17. H. Hamed, A. El-Atawy, and E. Al-Shaer. On Dynamic Optimization of Packet Matching in High-Speed Firewall, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 4, NO. 10, OCTOBER E. Al-Shear, A. El-Atawy, T. Tran: Adaptive Early Packet filtering for Defending firewall againt DoS Attack. In Proceeding of IEEE INFOCOM, pp. 1-9, M. Waldvogel, G. Varghee, J. Turner, B. Plattner. Scalable High Speed IP Routing Lookup. In Proceeding of the ACM SIGCOMM (SIGCOMM 97), pp. 5-36, D. Sleator, R. Tarjan. Self Adjuting Binary Search Tree. Journal of the ACM, 3(3), pp , N. Nej A. Bouhououla: Dynamic Scheme for Packet Claification Uing Splay tree, Information Aurance and Security, pp. 1-9, H. Hamed, A. El-Atawy, and E. Al-Shaer. Adaptive tatitical optimization technique for firewall packet filtering. In IEEE INFOCOM 06, April I. Motherole and M. Reed. Optimizing Rule Order for a Packet Filtering Firewall. In SAR- SSI, W. Wang, H. Chen, J. Chen and B. Liu. Firewall rule Ordering baed on tatitical Model. In International Conference on Computer Enginnering and Technology, W. Wang, R. J W. Chen, B. Chen and Z. Li. Firewall Rule Sorting Baeb on Markov Model. In proceding of the International Sympoium on Data Privacy and E-Comerce, A. Liu and M.Gouda. Complete redundancy detection in firewall. In proceding of 19 th Annual IFIP Conference on Data and Application Security, Augut 005.
Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationThe Implementation of an Adaptive Mechanism in the RTP Packet in Mobile Video Transmission
2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Pre, Singapore DOI: 10.7763/IPCSIT.2012.V52.91 The Implementation of an Adaptive
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationA TOPSIS based Method for Gene Selection for Cancer Classification
Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationA Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract
A Boyer-Moore Approach for Two-Dimenional Matching Jorma Tarhio Computer Science Diviion Univerity of California Berkeley, CA 94720 Abtract An imple ublinear algorithm i preented for two-dimenional tring
More informationOn combining Learning Vector Quantization and the Bayesian classifiers for natural textured images
On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationOn Peer-to-Peer Media Streaming Λ
On eer-to-eer Media Streaming Λ Dongyan Xu y, Mohamed Hefeeda, Suanne Hambruch, Bharat Bhargava Department of Computer Science urdue Univerity, Wet Lafayette, IN 797 fdxu, hefeeda, eh, bbg@c.purdue.edu
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationIntegration of Digital Test Tools to the Internet-Based Environment MOSCITO
Integration of Digital Tet Tool to the Internet-Baed Environment MOSCITO Abtract Current paper decribe a new environment MOSCITO for providing acce to tool over the internet. The environment i built according
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationAnalytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compensation
Analytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compenation A. J. Healey Profeor and Director Center for AUV Reearch Naval Potgraduate School Monterey, CA 93953 healey@me.np.navy.mil
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationComputer Aided Drafting, Design and Manufacturing Volume 25, Number 3, September 2015, Page 10
Computer Aided Drafting, Deign and Manufacturing Volume 5, umber 3, September 015, Page 10 CADDM Reearch of atural Geture Recognition and Interactive Technology Compatible with YCbCr and SV Color Space
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationData Mining with Linguistic Thresholds
Int. J. Contemp. Math. Science, Vol. 7, 22, no. 35, 7-725 Data Mining with Linguitic Threhold Tzung-Pei Hong Department of Electrical Engineering National Univerity of Kaohiung Kaohiung, Taiwan, R.O.C.
More information( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1
A new imultaneou ource eparation algorithm uing frequency-divere filtering Ying Ji*, Ed Kragh, and Phil Chritie, Schlumberger Cambridge Reearch Summary We decribe a new imultaneou ource eparation algorithm
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationResearch on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function
016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationA Handover Scheme for Mobile WiMAX Using Signal Strength and Distance
A Handover Scheme for Mobile WiMAX Uing Signal Strength and Ditance Mary Alatie, Mjumo Mzyece and Anih Kurien Department of Electrical Engineering/French South African Intitute of Technology (F SATI) Thwane
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationDifferentially Private Histogram Publication
Differentially Private Hitogram Publication Jia Xu, Zhenjie Zhang, Xiaokui Xiao, Yin Yang, Ge Yu College of Information Science & Engineering, Northeatern Univerity, China xujia,yuge@ie.neu.edu.cn Advanced
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationKINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL
KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL Raffaele Di Laora Univerity of Napoli Parthenope raffaele.dilaora@uniparthenope.it Emmanouil Rovithi Intitute of Engineering Seimology and
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More informationCOLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
XI International Conference on Computational Platicity. Fundamental and Application COMPLAS XI E. Oñate, D.R.J. Owen, D. Peric and B. Suárez (Ed) COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
More informationWeb Science and additionality
Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationShira L. Broschat b) School of Electrical Engineering and Computer Science, Washington State University, Pullman, Washington
Invere imaging of the breat with a material claification technique Charle W. Manry, Jr. a) Department of the Navy, SPAWARSYSCEN D851 (PL-MR), 53560 Hull Street, San Diego, California 92152-5001 Shira L.
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS Ranges
American Journal of Applied Science 4 (5): 300-306, 2007 ISSN 1546-9239 2007 Science Publication Correponding Author: Parallel Approache for Interval Analyi of Variable Statitic in Large and Spare Linear
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationAn Algebraic Approach to Adaptive Scalable Overlay Network Monitoring
An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationSemi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
Syracue Univerity SUFAC lectrical ngineering and Computer Science echnical eport College of ngineering and Computer Science 8-1991 Semi-Ditributed Load Balancing for aively Parallel ulticomputer Sytem
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More information(A)ATSR RE-ANALYSIS FOR CLIMATE - CLOUD CLEARING METHODOLOGY
(A)ATSR RE-ANALYSIS FOR CLIMATE - CLOUD CLEARING METHODOLOGY Chri Old, Chri Merchant Univerity of Edinburgh, The Crew Building, Wet Main Road, Edinburgh, EH9 3JN, United Kingdom Email: cold@ed.ac.uk Email:
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationAnalysis of Surface Wave Propagation Based on the Thin Layered Element Method
ABSTACT : Analyi of Surface Wave Propagation Baed on the Thin ayered Element Method H. AKAGAWA 1 and S. AKAI 1 Engineer, Technical Centre, Oyo Corporation, Ibaraki, Japan Profeor, Graduate School of Engineering,
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationUsing Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images
2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationPerformance Evaluation of search engines via user efforts measures
IJCSI International Journal of Computer Science Iue, Vol. 9, Iue 4, No, July 01 www.ijcsi.org 437 Performance Evaluation of earch engine via uer effort meaure Raeh Kumar Goutam 1 and Sanay K. Dwivedi 1
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More information