Service and Network Management Interworking in Future Wireless Systems
|
|
- Wilfred Hodges
- 5 years ago
- Views:
Transcription
1 Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering and Computer Science Diviion of Communication Electronic and Information Engineering Telecommunication Laboratory 9 Heroon Polytechneiou Street Zographou 5773 Athen GREECE Tel: Fax: vttounto@telecom.ntua.gr Abtract. The need for eamle communication in future wirele network impoe the development of ditributed management ytem in which we can ditinguih between different buine entitie the Service and Network Provider. Such a highly dynamic environment enable the Service Provider to aociate with multiple Network Provider and chooe the bet one according to uer atifaction and network reward criteria. In thi direction thi paper preent a Service Management Sytem from the SP perpective (SP-SMS). The SP-SMS can be eparated into two plane namely the ervice and network reource plane and three layer the Seion Configuration Layer the Local Planning Layer and the Global Planning Layer. Our tudy focue on the Local Planning Layer and the role of the related component which are introduced to decribe the functionality of thi layer. Through repreentative reult we demontrate the uperiority of the propoed model in term of utiliation and aggregate revenue. Introduction The liberaliation of telecommunication market and the ucce of future wirele ytem require the proviion of ophiticated and demanding ervice. The attainment of eamle communication impoe the adaptability of ervice requirement to the characteritic of the involved network without violating the limitation of phyical infratructure. The ue of uch ervice and application uually require a minimum Quality of Service (QoS) but the adoption of flexible reource allocation mechanim come up a an extremely challenging and intereting perpective. It i obviou that a ditributed decentralied architecture for future wirele cellular ytem i abolutely neceary to come up with tringent application requirement and dynamically varying able reource. The ditinction between different entitie in uch ytem enable the coupling of difficult radio infratructure with the adaptability and calability of multimedia ervice characteritic. In thi direction the introduction of Service Provider (SP) and Network Provider (NP) entitie contribute to an efficient and apiring approach to the problem. E. Gregori et al. (Ed.): NETWORKING 00 LNCS 345 pp Springer-Verlag Berlin Heidelberg 00
2 900 V. Tountopoulo et al. The carcity of the radio reource and the veratility of the environment condition i.e. the time-variant traffic load mobility level and interference condition lead to degradation on the quality level of the offered ervice. Thu the competition between variou SP and NP enable the effective exploitation of the cellular infratructure a well a the atifaction of uer demand and requirement. The cope of thi paper i to preent part of the functional architecture of a Service Management Sytem from the SP perpective (SP-SMS) focuing on the functionality of the Local Planning Layer. Such a ytem enable the dynamic cooperation of an SP with the mot appropriate NP in term of uer atifaction and cot efficiency in a competitive environment. More pecifically it addree the problem of Service Configuration and Network Provider Selection (SCNPS) which will be introduced a part of the local planning layer component logic. The ret of the paper i organied a follow: Section preent the general aumption for a future wirele management ytem regarding the policie of SP and NP. Section 3 focue on the functionality at the local planning layer giving a mathematical approach to the SCNPS problem. Section 4 preent a et of reult for the evaluation of the propoed architecture. Finally Section 5 include concluding remark. Sytem Model Thi ection preent briefly the objective of the different entitie (SP and NP) in a future wirele cellular ytem. It alo give the general tructure of the propoed management ytem and decribe the functionality of the involved layer.. SP Objective and Policie The SP role i to provide uer with a et of ervice. Each SP ha a volume of uer who have been ubcribed to ome or all the ervice able in thi SP and have been orted out into clae (uer clae) according to their preference in priority acce to ervice. Each ubcriber ha been aociated with a ervice uage profile which model the behaviour exhibited by a typical ubcriber of the uer cla with repect to a pecific ervice. The uer of each cla have a et of permiible quality level aociated with each ervice offered from the SP. Each quality level ha been aigned a maximum tolerable price (tariff) and a utility meaure. Thi factor i ued to expre the preference of a uer cla to ome quality level with repect to other permiible one. It i aumed that the information regarding permiible quality level maximum price utility level etc. i tored in the profile of the different uer clae. Of the main objective of an SP i to determine a reference quality level for a given ervice which repreent the minimum bandwidth required for the upport of thi ervice. During a eion the SP can allocate the ervice to a higher quality level if thi i acceptable. On the other hand the SP i reponible for the accommodation of uer to the mot appropriate NP according to quality and cot criteria which can ecure at leat the reference quality level for the upport of the elected ervice.
3 Service and Network Management Interworking in Future Wirele Sytem 90. NP Policie The accomplihment of the SP role require the co-operation with NP. The NP role i to offer the network-level connectivity neceary for upporting the ervice. Within a portion of the ervice area each NP can upport up to a certain number of SP ubcriber per quality level and impoe a tariff for the proviion of a ervice at a quality level. The tariff are determined by the NP policie taking into account parameter uch a the managed network tatu the volume of reource that the SP ue (either globally or in a pecific area of the network) the area of the network and the time zone..3 SP-SMS Deign Without loing generality we examine the SP-SMS management ytem from the perpective of a ingle SP. Figure how the general framework of a future wirele management ytem depicting clearly the ditinction between the different plane and layer decribed below. A future wirele management ytem can be claified into two plane the ervice plane and the network reource plane. Both SP and NP are involved in the ervice plane. Through the functionality that i framed therein the SP i enabled to find in each ervice area portion and time zone the target quality level and the bet NP for each ervice and uer cla. The SP-SMS cover the SP-related part of the ervice plane. The network reource plane involve only NP. At thi plane the NP manage the reource of the network infratructure o a to meet the agreement having been etablihed with SP. Thi plane can rely on legacy network management ytem. In thi repect the ervice plane functionality of the NP can be een a a neceary extenion to legacy network management ytem. The extenion will enable the interworking with SP and the promotion of the NP infratructure. A it can be een from figure the SP-SMS i tructured into three layer namely the Seion Configuration Layer the lower one at the SP-SMS hierarchy the Local Planning Layer and the Global Planning Layer. Each layer contain a component type which can be differentiated from the other component type of the other layer by the time cale and the ervice area portion on which it operate. It hould be noted here that the component of the SP-SMS co-operate with correponding entitie of the NP that fall within the ervice plane. In the ret of thi ubection we decribe the functionality of the different component. The SP Seion Configuration Component (SP-SCC) are enabled to handle with the incoming eion. They are reponible for the monitoring of the network performance and the notification for the modification of the network configuration when thi i needed. Each SP-SCC control a ubet of the ervice area and i controlled by the component of the higher layer. The SP-SCC configuration pecifie for each ervice and uer cla the target quality level that hould be offered by the NP the bet one that can offer the target quality level and the maximum demand volume that each of them can accommodate.
4 90 V. Tountopoulo et al. */%$/Ã3/$* &03(76 63ÃÃ*3& HUYLFHÃ3ODQHÃ)XQFWLRQDOLW\ÃRIÃ63 6HUYLF HÃ3ODQ H */%$/Ã3/$* /$<(5 /&$/Ã3/$ & $ * &03(76 6 3Ã Ã/3& 6(59 9&(Ã$5($ &(Ã$5($Ã357ÃL Ã357ÃL /&$/Ã3/$*Ã/$<(5 66(66Ã&)*85$7 *85 &0 &03( Ã 3ÃÃ6& && & 6(59 9&(Ã$5($ &(Ã$5($Ã357ÃL Ã357ÃL 6( 66 &)*85$7Ã/$<(5 (7:5.Ã359'(5ÃÃ3Ã Ã 6(59&(Ã3/$(Ã)8&7$/ Ã)8&7$/7< 7< &9(5 &9(5*Ã6(59&( &(Ã$5($Ã357ÃL Ã357ÃL (7: (7: 5.Ã359'(5ÃÃ3 3Ã 6(59&(Ã3/$ 9&(Ã3/$(Ã)8&7$/7< &9(5*Ã6(59&(Ã$5 *Ã6(59&(Ã$5($Ã357 ($Ã3 57ÃL ÃL (7:5.Ã359'(5ÃÃ3Ã Ã (7:5.Ã5(685&(Ã3/$(Ã)8&7$/7< 7< &9(5*Ã6(59&( &(Ã$5($Ã357ÃL Ã357ÃL (7:5.Ã359'(5ÃÃ3Ã 3Ã (7: 5.Ã5(685&(Ã3/$(Ã)8&7$/7< 8&7$/7< &9(5*Ã6(59&(Ã$5 *Ã6(59&(Ã$5($Ã357 ($Ã3 57ÃL ÃL HWZ RUNÃ5HVRX UFHÃ3ODQH 5$'Ã$'Ã);('Ã0$$*(' (7: 5.Ã6(*0(7Ã)Ã3Ã & 9(5* Ã 6(5 9&( Ã$ 5( $Ã 357Ã L 5$'Ã$'Ã) ;('Ã0$$*( ' (7:5.Ã6(*0(7Ã) Ã3Ã &9(5*Ã6(59&(Ã$5($Ã357ÃL 6(59&(Ã$5($Ã357ÃL Fig.. Layer component and high-level ditribution pattern in the management framework The SP Local Planning Component (SP-LPC) control the counterpart portion of the ervice area a the SP-SCC. They are reponible for the reconfiguration of the SP-SCC a it i decribed in ection 3. Finally the SP Global Planning Component (SP-GPC) focu over large ubet or the entire ervice area and ait the component in the underlying layer in accomplihing their role by providing global policie and information. 3 Local Planning Layer Thi ection decribe the functionality of the Local Planning Layer of the SP-SMS and the role of it component. More pecifically it addree the problem of Service Configuration and Network Provider Selection (SCNPS) in order to clarify the concept of thi layer in a future wirele management ytem. Firt we preent the poible tructure of the management ytem introducing the input parameter for our model and then we give a mathematical preentation of the problem. 3. High-Level Decription of the SP-LPC Functionality (SCNPS Problem) Without lo of generality we focu on a portion of the ervice area denoted a i. A it ha been tated above there i an SP to control thi area which can be aociated
5 Service and Network Management Interworking in Future Wirele Sytem 903 with a et of NP denoted a NP. In ervice area i we aume that the SP can offer a et S of ervice to a et UC of uer clae which have been ubcribed to the ervice S. We alo define a et Q uc of permiible quality level for the ervice which can be acceed by the ubcriber of cla uc UC. In the uer profile it ha been defined that the maximum acceptable price and the correponding utility meaure when the ervice i offered to the uer of cla uc at quality level q ( q We aume that each Q uc ) are c uc q NP u and uc q repectively. np can accommodate the pecification of the et of ervice S. There are two apect that can configure the policy of an np. Firt the maximum network traffic load volume L max ( np) that the network provider can upport in the ervice area portion i. Second the et of tariff c ( np q) that the np will impoe for the upport of ervice at quality level q ( q Q ). uc UC Thee tariff can depend on the network tatu the reource ued by the SP the area of the network and the time zone. Uer that are found in ervice area portion i end eion requet to the controlling SP-SCC (SP-SCC- i ). In repone to the eion requet the SP-SCC- i indicate the target quality level q and the bet np for each ervice. The SP-SCC- i reply i traightforward baed on the uer information and on it configuration that ha been done by the SP-LPC- i. The SP-SCC- i monitor whether it configuration i appropriate for the ervice demand. In thi repect the SP-SCC- i monitor the demand volume per ervice and uer cla uc a well a the actual quality level NP in the area i. In cae the SP-SCC- i identifie that it Q uc offered by the configuration i not appropriate for handling the demand for one or more ervice of the et S it invoke the SP-LPC- i and requet a modification. In repone to the SP-SCC- i invocation the SP-LPC- i mut apply the SCNPS problem for modifying the SP-SCC- i configuration. The ervice demand pattern can be modelled through a vector D = { d ( uc) ( uc) ( S UC )}. Each element of the vector d ( uc) correpond to the demand for ervice that originate from the uer of cla uc and hould be accommodated by the SP within the ervice area portion i and time zone. uc 3. Mathematical Formulation of the SCNPS Problem The SCNPS problem ha two general objective. Firt to compute an allocation of the ervice demand pattern to quality level A QL = { ql ( uc) ( uc)
6 904 V. Tountopoulo et al. ( S )}. Each element of the allocation ( uc) UC ql ( ql ( uc) Q uc ) i the target quality level at which the uer of cla uc hould acce ervice for the pecific time zone and ervice area portion. The econd objective of the SCNPS problem i to compute an allocation of the ervice demand pattern to network A { r ( np uc) ( np uc) NP S. Each provider = NP element of the allocation r ( np uc) ( )} UC denote the part of the demand for ervice correponding to the uer of cla uc that hould be atified by network provider ). Network provider np hould atify the ervice demand np ( np NP portion at the elected quality level ( uc) d ( uc). ql. It hold that r ( np uc) The objective function that hould be optimied by the allocation i denoted a ( ) OF A A QL NP and i aociated with the utility meaure and the cot achieved by the allocation. Our target i to maximie thi objective function which can be expreed a: ( ) = OF A A QL NP d S uc UC ( uc) u ( ) r( uc np) c( np ql( uc) ) uc ql uc S uc UC np NP The allocation (elected quality level and network provider) hould repect ome et of contraint. The firt one impoe the atifaction of the ervice demand pattern and it can be expreed a: np NP r ( np uc) = d( uc) ( uc) ( S UC ) () The econd et of contraint guarantee that the capacity limitation of the elected NP will not be violated. In thi point we introduce the function L ( np A A QL NP ) which repreent the load that will be impoed on network provider np ( np NP ) a a reult of the allocation A QL and A NP. So: ( np ) ( np) L A A QL NP L max np () NP (3) Another et of contraint hould guarantee that the tariff that will be impoed to the uer hould be compliant with the pecification in their profile. Thi can be expreed a ( np ql( uc) ) < c ( ) ( uc) ( S UC ) c uc q uc np NP ( np uc) 0) : ( r > (4)
7 Service and Network Management Interworking in Future Wirele Sytem 905 Here it hould be noted that the olution of allocation of the ervice demand to quality level and network provider will be forwarded to the SP-SCC- i SP-GPC and the ervice plane mechanim of the choen NP. The SP-SCC- i will ue thi new olution for continuing the work at the eion configuration layer. The SP-GPC will update it global view of the manner in which uer are erved and ervice are provided in the ervice area. The whole problem a it wa decribed in thi ection may have the graphical preentation of figure. 6HUYLFHÃ3ODQHÃPHFKDQLVPVÃRIÃWKHÃ63 636&&L 63/3&L 63*3&L GHQWLILFDWLRQÃRIÃ ORZÃSHUIRUPDQFH )RUPXODWLRQÃRIÃ6&36ÃSUREOHP 6HWÃRIÃDYDLODEOHÃ3V 5HVRXUFHÃHVWLPDWLRQ 7DULIIÃH[FKDQJH HJRWLDWLRQÃSKDVH 3 Ã H I ÃWK V ÃR P LV Q D K F H ÃP H Q OD Ã3 H LF Y U H 6 6ROXWLRQÃRIÃ6&36ÃSUREOHP PSOHPHQWDWLRQÃRIÃ WKHÃ6&36ÃVROXWLRQ Fig.. Decription of the Local Planning Layer functionality 4 Reult In thi ection we intend to preent a et of reult for the evaluation of the propoed management technique. More pecifically we analye the problem of NP election for the upport of ervice in a future wirele cellular ytem addreing two major poible olution the degradation in the quality of offered ervice and the binding of reource from alternative network provider. Thee olution are evaluated according to the objective function a it wa decribed in the previou ection. Thi function imulate the behaviour of the SP according to the policie of the able NP a well a it take into conideration the uer preference a they have been tored in their profile. Finally we evaluate the reult uing the concept of channel utiliation which can be defined a CU = (-P)*A/n where P i the blocking probability A i the offered load and n i the number of channel.
8 906 V. Tountopoulo et al. For the purpoe of thi paper we aume that the SP can chooe between two NP np and np repectively in order to engage reource for the upport of a pecific kind of ervice which i not appropriately erved within a portion of the ervice area. Thi ervice can be related to two quality level denoted a QL and QL repectively both of them correponding to % blocking probability. During the ubcription of a uer to a certain uer cla of the SP the SP become aware of the uer profile and it can therefore etimate a utility meaure for the allocation of the uer to a pecific quality level. Table ummarize ome typical value for the input parameter of the SCNPS problem. Table. SP and NP policie for the SCNPS problem Bit Rate Utility Meaure Cot /Tariff UC UC NP NP (Kbp) QL QL It hould be noted here that we take into conideration the tructure of a CDMA cellular ytem with typical value of the channel bandwidth f = 5MHz and chip rate CR = Mcp. We alo make the aumption that the SP ha initially bound 6 channel from the cheapet NP. All uer who have already entered the ytem have been accommodated to np which appear to be cheaper than np and they have been allocated at the high quality level QL. In an intance of time the offered load in the area which i approximately OfferedLoad = Erlang and can be hared equally to both of clae that i Tr UC = 6Erlang and 5 blocking probability which mean that the Tr UC = 6Erlang perform a % SP SCC i ha to requet for a modification in configuration. There are two poible olution: œ np ha no more reource to allocate o the SP determine to degrade the quality in low priority uer. In thi cae the new traffic in the area will be modified to OfferedLoad NEW = 8. 5Erlang. Then the objective function value i: OF = 3.5. œ The SP can buy reource from np. Our target i to keep the blocking probability at B = %. For thi reaon we need to tranfer an amount of traffic from the low priority cla UC to np in order to keep all of them in the high quality level. From Erlang B table we can ee that for 6 channel and B = % the offered load in np mut be approximately 9 Erlang from which an amount of 6 Erlang refer to the traffic of UC and 3 Erlang to the traffic of UC. The ret 3 Erlang
9 Service and Network Management Interworking in Future Wirele Sytem 907 of the traffic of UC will be erved from np. Thu the objective function will become: OF = 36. We now examine the effect of the tariff policy of np in the objective function. On figure 3 we have declared 5 cheme of different tariff policie for np and the repective objective function for the cae that the SP buy reource from that NP. On the ame figure we have depicted the objective function for the cae of degrading the quality in low priority uer which remain a i for all cheme ince the alteration in the tariff policy of np have no effect on that cae. A it i illutrated from thi figure the olution of buying reource from an alternative NP (SP-SMS approach) keeping all the connection in the high quality level i uperior than the other one that implie the degradation of the low priority connection in order to keep all of them in the ame NP. Only if the difference between the cot policie of the variou able NP exceed a threhold the propoed olution i not profitable. Thi threhold implie that the cae of degradation the low priority uer i preferable from SP perpective when np become at about 350% more expenive than np. However it would be afe to ay that thi threhold eem difficult to be reached unle in very carce circumtance. Objective Function Cae of buying reource from NP Cae of degrading the quality in low priority uer 0.5/.5 3.5/ /.5 5.5/ /3.5 Cot Policy of NP (QL /QL ) Fig. 3. The objective function v. the cot policy of np We now examine the effect of utility meaure on the SCNPS problem. Specifically we aume that the SP revenue by allocating UC toql and QL i
10 908 V. Tountopoulo et al. 5 and 0 unit repectively. We alo aume that the cot value for np are c ( np QL )=.5 and c ( np QL )= 0.75 and for np are c ( np QL )= 3 and c ( np QL )=.5. Thi mean that we have aumed a reaonable cenario for the tariff policie of the able NP which implie a double cot policy of np regarding np. Figure 4 depict the objective function for 4 cenario of the utility meaure and for the allocation of UC to repective quality level. From thi figure we can conclude that when the utility meaure of uer clae for quality level i high the SP-SMS lead to better performance. A the utility meaure decreae the SP-SMS logic give wore reult than the degradation cae when the uer ha no trong interet for the quality level. Objective Function Cae of buying reource from NP Cae of degrading the quality in low priority uer 0 5/.5 4.5/.5 4/.5 3.5/.5 Utility Meaure for UC (QL /QL ) Fig. 4. The objective function v. the utility meaure of UC From NP perpective we examine the impact of the above cenario in the channel utiliation. The reult can be found on table. From it we can conclude that the capability of choice between different NP for the upport of a et of ervice in a pecific area i much more preferable than the degradation in the quality of the offered ervice that ome uer experience. The channel utiliation i better for each NP eparately a well a the ytem a a whole.
11 Service and Network Management Interworking in Future Wirele Sytem 909 Table. Channel Utiliation for the cae under tudy Channel Utiliation NP NP Cae Cae Concluion The main feature of the future wirele cellular ytem i the intelligence and flexibility in the proviion of ervice. In thi repect we preented in thi paper a Service Management Sytem from the SP perpective which ha been claified into three layer and enable the SP to co-operate with a et of able NP in order to find the mot appropriate one according to cot-effective and uer-atifaction criteria. The SP-SMS deal with the incoming eion and allocate uer requet to different quality level according to the ability of reource. In cae of low performance within a ervice area portion there i an invocation for modification in it configuration. The objective of the management ytem i to find the bet allocation of the ervice demand to quality level and able NP. The olution of the SCNPS problem mut be communicated to the ret of SP-SMS layer and the ervice plane mechanim of the aociated NP. Reference. S. Trigila A. Mullery M. Campolargo J. Hunt Service architecture and ervice creation for integrated broadband communication Computer Communication Vol. 8 No S. Trigila K. Raatikainen B. Wind P. Reynold Mobility in long-term ervice architecture and ditributed platform IEEE Peronal Commun. Vol. 5 No. 4 Aug Management model for telecommunication Feature topic in the IEEE Commun. Mag. March V.Garg D.Ne-Cohn T.Power L.Schenkel Direction for element manager and network manager IEEE Commun. Mag. October IST project MONASIDRE (Management of network and ervice in a diverified radio environment) Web ite Feb IST project SHUFFLE (An agent baed approach to controlling reource in UMTS) Web ite Jan J.-T.Park J.-W.Baek J.W.-K.Hong Management of ervice level agreement for multimedia Internet ervice uing a utility model IEEE Commun. Mag. Vol. 39 No. 5 May U. Varhney Recent advance in wirele networking IEEE Computer Vol. 33 No. 6 June A.K.Talukdar B.R.Badrinath A.Acharya Rate adaptation cheme in network with mobile hot Proc. ACM/IEEE MobiCom 98 pp Oct.998
12 90 V. Tountopoulo et al. 0. Sunghyun Choi and Kang G. Shin "Location/Mobility-Dependent Bandwidth Adaptation in QoS-Senitive Cellular Network" Proc. IEEE Vehicular Technology Conference October 00. Deign of broadband multiervice network Feature topic in the IEEE Commun. Mag. Vo. 36 No. 5 May 998
SLA 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 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 informationETSI TS V ( )
TS 122 153 V14.4.0 (2017-05) TECHNICAL SPECIFICATION Digital cellular telecommunication ytem (Phae 2+) (GSM); Univeral Mobile Telecommunication Sytem (UMTS); LTE; Multimedia priority ervice (3GPP TS 22.153
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 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 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 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 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 informationPerformance 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 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 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 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 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 informationDistributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II
IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
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 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 informationSIMIT 7. Profinet IO Gateway. User Manual
SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion
More informationAspects of Formal and Graphical Design of a Bus System
Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science
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 informationTask-based Adaptation for Ubiquitous Computing
IEEE Tranaction on Sytem, Man, and Cybernetic, Part C: Application and Review Special Iue on Engineering Autonomic Sytem, to appear Tak-baed Adaptation for Ubiquitou Computing João Pedro Soua, Vahe Poladian,
More informationDiverse: Application-Layer Service Differentiation in Peer-to-Peer Communications
Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
More informationA Basic Prototype for Enterprise Level Project Management
A Baic Prototype for Enterprie Level Project Management Saurabh Malgaonkar, Abhay Kolhe Computer Engineering Department, Mukeh Patel School of Technology Management & Engineering, NMIMS Univerity, Mumbai,
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 informationThe development of the South African ehealth Strategy assessed against the recommendations of the WHO/ITU ehealth Strategy Toolkit
The development of the South African ehealth Strategy aeed againt the recommendation of the WHO/ITU ehealth Strategy Toolkit Roemary Foter PhD a,b a ehealth Strategy and Policy Diviion, Medical Reearch
More informationSoftware Agent (SA) to guarantee QoS for multi constrain applications in all-ip networks
Software Agent (SA) to guarantee QoS for multi contrain application in all-ip network Kazi Khaled Al-Zahid and Mituji Matumoto GITS, Waeda Univerity 94 Waeda Univ. Bldg. A-308, 1011Okuboyama Nihitomida
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 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 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 informationSCHEDULE DOCUMENT CONNECT MPLS SERVICES PUBLIC NODE4 LIMITED 17/07/2017
SCHEDULE DOCUMENT CONNECT MPLS SERVICES PUBLIC NODE4 LIMITED 17/07/017 SCHEDULE DOCUMENT CONNECT MPLS SERVICES Additional term, Service Decription & Service Level Agreement for ConnectMPLS Service 1. SERVICE
More informationChapter S:II (continued)
Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt
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 informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
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 informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationDesign of a Stewart Platform for General Machining Using Magnetic Bearings
eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented
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 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 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 informationCombining Web Usage Mining and Fuzzy Inference for Website Personalization
Combining Web Uage Mining and Fuzzy Inference for Webite Peronalization Olfa Naraoui and Chritopher Petene Dept. of Electrical and Computer Engineering 206 Engineering Science Bldg. The Univerity of Memphi
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
More informationACTIVE PIPES: SERVICE COMPOSITION FOR PROGRAMMABLE NETWORKS
ACTIVE PIPES: SERVICE COMPOSITION FOR PROGRAMMABLE NETWORKS Ralph Keller, Jeyahankher Ramamirtham, Tilman Wolf, Bernhar Plattner [keller plattner]@tik.ee.ethz.ch [jai wolf]@arl.wutl.eu Computer Engineering
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationEthernet Peer-To-Peer Communication With Model 353 And Procidia i pac Controllers
iemen Energy & utomation pplication ata Ethernet Peer-To-Peer Communication With odel 353 nd Procidia ipac Controller 353-113 Rev. 1 July Ethernet i a leading form of network communication that i often
More informationModelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity
Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,
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 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 informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationOptimal Peer-to-Peer Technique for Massive Content Distribution
1 Optimal Peer-to-Peer Technique for Maive Content Ditribution Xiaoying Zheng, Chunglae Cho and Ye Xia Computer and Information Science and Engineering Department Univerity of Florida Email: {xiazheng,
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 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 informationStress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling
Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation
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 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 informationTesting Structural Properties in Textual Data: Beyond Document Grammars
Teting Structural Propertie in Textual Data: Beyond Document Grammar Felix Saaki and Jen Pönninghau Univerity of Bielefeld, Germany Abtract Schema language concentrate on grammatical contraint on document
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
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 informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationMulticast with Network Coding in Application-Layer Overlay Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 1, JANUARY 2004 1 Multicat with Network Coding in Application-Layer Overlay Network Ying Zhu, Baochun Li, Member, IEEE, and Jiang Guo Abtract
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More informationRadio Technologies in Automation - Background and Status -
Radio Technologie in Automation - Background and Statu - Gerhard Hammer Siemen AG Siemen AG 2008 Content Trend in Indutrial Automation Indutrial Automation Requirement Claification of Wirele Application
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 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 informationWeb Page Recommendation Approach Using Weighted Sequential Patterns and Markov Model
Global Journal of Computer Science and Technology Volume 2 Iue 9 Verion.0 April 202 Type: Double Blind Peer Reviewed International Reearch Journal Publiher: Global Journal Inc. (USA) Online ISSN: 0975-472
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
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 informationResearch Article Real-Time Communications in Large-Scale Wireless Networks
Hindawi Publihing Corporation International Journal of Digital Multimedia Broadcating Volume 2008, Article ID 586067, 16 page doi:10.1155/2008/586067 eearch Article eal-time Communication in Large-Scale
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 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 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 informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
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 informationMulticlass Road Sign Detection using Multiplicative Kernel
Proceeding of the Croatian Computer Viion Workhop, Year 1 Multicla Road Sign Detection uing Multiplicative Kernel Valentina Zadrija Mireo d. d. Zagreb, Croatia valentina.zadrija@mireo.hr Siniša Šegvić
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationA QoS-aware Service Composition Approach based on Semantic Annotations and Integer Programming
A QoS-aware Service Compoition Approach baed on Semantic Annotation and Integer Programming I. INTRODUCTION Service Oriented Architecture (SOA) i a widely adopted paradigm for developing ditributed application
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
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 CLUSTERING-BASED HYBRID REPLICA CONTROL PROTOCOL FOR HIGH AVAILABILITY IN GRID ENVIRONMENT
Journal of Computer Science 10 (12): 2442-2449, 2014 ISSN: 1549-3636 2014 R. Latip et al., Thi open acce article i ditributed under a Creative Common Attribution (CC-BY) 3.0 licene doi:10.3844/jcp.2014.2442.2449
More informationADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR
ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR A. P. Mullery and R. F. Schauer Thoma J. Waton Reearch Center International Buine Machine Corporation Yorktown Height, New York R. Rice International Buine Machine
More informationESRP Storage Program EMC Celerra NS-120 (1,500 User) Mailbox Resiliency Storage Solution for Microsoft Exchange 2010
ESRP Stora Program EMC Celerra NS-12 (1, Uer) Mailbox Reilien Stora Solution for Microoft Exchan 21 Teted with: ESRP Stora Verion 3. Teted Date: 3/2/21 EMC Corporation Corporate Headquarter Hopkinton,
More informationModeling and Analysis of Slow CW Decrease for IEEE WLAN
Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,
More informationPractical Analog and Digital Filter Design
Practical Analog and Digital Filter Deign Artech Houe, Inc. Le Thede 004 Thi text i dedicated to my wife who keep me grounded, and to my grandchildren who know no bound. Content Preface xi Chapter Introduction
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 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 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 informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
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 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 informationESRP Storage Program EMC VNXe3100 (500 User) Mailbox Resiliency Storage Solution for Microsoft Exchange 2010
ESRP Stor Program EMC VNXe31 (5 Uer) Mailbox Reilie Stor Solution for Microoft Exchan 21 Teted with: ESRP Stor Verion 3. Teted Date: 4/25/211 EMC Corporation Corporate Headquarter Hopkinton, MA 1748-913
More informationESRP Storage Program EMC Celerra NX4 (500 User) Mailbox Resiliency Storage Solution for Microsoft Exchange 2010
ESRP Stor Program EMC Celerra NX4 (5 Uer) Mailbox Reilie Stor Solution for Microoft Exchan 21 Teted with: ESRP Stor Verion. Teted Date: 6/25/21 EMC Corporation Corporate Headquarter Hopkinton, MA 1748-91
More informationResearch Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks
International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,
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 information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.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 information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationPriority-Based Distribution Trees for Application-Level Multicast
Priority-Baed Ditribution Tree for Application-Level Multicat Jürgen Vogel, Jörg Widmer, Dirk Farin, Martin Mauve, Wolfgang Effelberg Praktiche Informatik IV, Univerity of Mannheim, Germany vogel, widmer,
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 information