A Participation Incentive Market Mechanism for Allocating Heterogeneous Network Services
|
|
- Cameron Wilcox
- 6 years ago
- Views:
Transcription
1 A Partcpato Icetve Maret Mechasm for Allocatg Heterogeeous Networ Servces Juog-S Lee ad Boleslaw K. Szymas * Noa Research Ceter, Palo Alto, CA USA * Resselaer Polytechc Isttute, Troy, NY 280, USA Eml: juog-s.lee@oa.com, * szymas@cs.rp.edu Abstract Ths paper studes a aucto based allocato of etwor resources for short-term cotracts for heterogeeous etwor servces. The combatoral wer selecto yelds the optmal resources allocato a sgle-roud aucto for heterogeeous resources. However, the recurrg ature of aucto for etwor servces causes least wealthy bdders to ext the aucto as they persstetly lose uder the tradtoal combatoral wer selecto that focuses oly o reveue maxmzato. Such exts decrease prce competto ad may cause a collapse of the sellg prces ad reveues of etwor servce provders. We troduce ad evaluate a ovel wer selecto strategy for auctog of heterogeeous etwor servces. The proposed strategy prevets collapse of the sellg prces ad the auctoeer reveues, stablzes aucto maret, ad ehaces socal welfare by allowg larger subset of users to become occasoal wers of aucto rouds tha the tradtoal combatoral wer selecto does. I. INTRODUCTION Approprate prcg mechasms ecourage customers to choose servce levels adequate to ther eeds, ad acheve effcet etwor resource allocato Qualty of Servce (QoS eabled etwors. Hece, they are regarded as a effcet soluto to the cogesto cotrol, servce admsso cotrol, far allocato of etwor resources, ad reveue maxmzato. For these reasos, they costtute a essetal compoet of dyamcally adaptable servce maagemet framewors for the sale ad delvery of a wde rage of etwor servces. Several prcg mechasms for sellg multple classes of etwor servces or allocatg shared etwor resources QoS eabled etwors have bee proposed [-7]. I may exstg etwor servce marets, fxed prcg (.e., flat rate prcg or statc tme-dfferetal prcg mechasms have bee used because of ther smplcty. However, the flat rate prcg caot optmze reveue of etwor servce provder because customer s demad dose ot follow a step fucto, but rather gradually shft from o- to off-pea. Accordgly, uder-utlzato of etwor resources arses whe demad s low ad uder-prcg happes whe demad s hgh []. Dyamc prcg mechasms that adapt to cotuously chagg etwor codtos are more effcet maagg etwor resources. Addtoally, such prcg mechasms, prce tself becomes a mportat sgal for etwor maagemet. I such dyamc prcg evromets, however, the servce provder s prce decso ad customer s budget plag are dffcult. A aucto ca mtgate such complextes sce prces auctos emerge a decetralzed way based o the customer s wllgess to pay. Addtoally, auctos are easy to uderstad, ad ca supports automatc egotato process [9]. Geerally, aucto for etwor servces should be regarded as recurrg because etwor servce provders allocate etwor resource repeatedly to satsfy recurret requests of customers []. I a sgle-roud aucto for heterogeeous etwor servces, the combatoral wer selecto of the Geeralzed Vcrey Aucto (GVA mechasm maxmzes reveue of the etwor servce provder by selectg the combato of wers that maxmzes the auctoeer s reveue [8]. However, applyg the tradtoal GVA mechasm to a recurrg aucto for heterogeeous etwor servces results a evtable bdder drop problem that s caused by paradox of cetve compatble mechasm recurrg aucto []. Such dropped bdders decrease the log-term demad for etwor servces, ad, cosequetly, lower the etwor servce provder s reveue. I ths paper, we propose a ew aucto based etwor resource prcg mechasm for QoS eabled heterogeeous etwor servces. Ths mechasm focuses o stablzg reveue of etwor servce provder. The ext secto aalyzes aucto marets for heterogeeous etwor servces ad descrbes the tradtoal GVA mechasm for heterogeeous etwor servces. I secto III, observed challegg problems are dscussed. I Secto IV, the proposed ew aucto based etwor resource allocato mechasm s preseted ad verfed by varous smulato expermets descrbed secto V. Fally, the paper cocludes wth a summary of ts cotrbutos ad our future wor gve secto VI. II. GVA FOR HETEROGENEOUS NETWORK SERVICES QoS eabled heterogeeous etwor servces ca be regarded as a aucto maret whch there s oe etwor servce provder actg as a auctoeer ad may customers partcpatg as bdders. The traded etwor servces are varous elastc etwor applcatos, such as real-tme voce ad vdeo applcatos that requre dfferet fxed amout of etwor resources to acheve desred qualty of servce (QoS. Hece, such a maret, bdders request dfferet amout of etwor resources for ther etwor servces. Aucto for such etwor servces s recurrg, because, from the etwor servce provder s pot of vew, a allocato of etwor
2 resources eeded for a servce s made for a specfc tme oly. Oce the servce s completed, these resources become free ad the etwor servce provder eeds to offer them to the customers aga. From the bdder pot of vew, etwor servces are requested repeatedly for specfc tme tervals. The resources such as badwdth eeded for etwor servces caot be stored warehouse for future sale, ad leavg them uused decreases ther utlzato, so they are pershable []. I cocluso, QoS eabled heterogeeous etwor servce maret requres a recurrg aucto whch bdders (.e., customers request dfferet amout of tme-sestve, pershable etwor resources recurretly for specfc tme tervals. I such a recurrg aucto, bdders demad for etwor resources, bds, ad the umber of avalable etwor resource uts may be dfferet each aucto roud. The combatoral wer selecto s the optmal strategy for etwor resource allocato a sgle roud. It eumerates all possble combatos of bdders, that we wll deote as C, where =,...,2, because 2 combatos of bdders are possble. We wll also deote the set of dexes of all feasble combatos as F. We call combato C feasble f the etwor resources that are requested by bdders C are avalable, that s f: r j R t, ( j C where r j deotes the vector of etwor resource uts requested by bdder j, ad R t deotes the vector of avalable etwor resource uts at tme t. The etwor servce provder selects the combato of bdders C m that maxmzes the sum of products of bds ad requested umbers of etwor resources (.e., maxmzes the resultg reveue amog all feasble combatos of bdders. Hece, the wer selecto the GVA mechasm ca be defed as: max b r (2 C To defe the prce of etwor resources for the wers selected GVA, we deote by x * the vector of wers (f bdder s a wer, x * =, otherwse, x * = 0. Let x * deote the vector of the optmal combato of bdders wthout bdder partcpatg the aucto. The prce of etwor resources for wer s computed by deductg the sum of products of bds ad requested umbers of etwor resources for all other bdders (except bdder x * from such a sum for all bdders x * [8]. Hece, the prce G( b of etwor resources for wer s computed as: G( b = = b r x * = b r x * (3 Based o the prcg rule of Eq. (3, the GVA mechasm s cetve compatble because truthful bd (.e., a bd represetg the true valuato of the resource by the bdder maxmzes the bdder s expected utlty [8]. The followg example llustrates the descrbed combatoral wer selecto ad prcg of the GVA mechasm. Example : There are four bdders B, B2, B3 ad B4, ad oe etwor servce provder. There are three etwor resource uts avalable. B, B2, B3 ad B4 request, 2, ad 2 etwor resource uts for ther desred etwor servces wth bds (.e., true valuatos of $3, $5, $6 ad $8 for a etwor resource utespectvely. I the GVA mechasm, bdder B3 ad B4 are selected as wers. Based o prcg rule of Eq. (3, bdder B3 pays ($9 - $6 / = $3 for each etwor resource ut whle bdder B4 pays ($6 - $6 / 2 = $5 per ut. III. CHALLENGES ARISING IN TRADITIONAL GVA The combatoral wer selecto of GVA has desrable features such as the optmal dyamc prcg ad egotato mechasms for effcet etwor resource allocato. Yet applyg t short-term cotract marets for heterogeeous etwor servces ca cause maret prce collapse because of the recurrg ature of etwor resource allocatos ad pershable ature of etwor resources. I a recurret aucto, bdders lear from prevous aucto results, ad try to adapt to the maret codtos. Hece, the combatoral wer selecto s optmal oly for a sgle roud of aucto as t focuses solely o reveue maxmzato (.e., t oly cosders curret bds durg resource allocato. As the result, t ca cause starvato for the etwor resources amog the least wealthy bdders (.e., bdders wth low true valuatos of resources the recurrg aucto because the true valuatos of bdders defe ther maxmum bds. Sce the wealth of bdders s dstrbuted uevely amog the bdders, such wer selecto strategy wll reward oly the bdders wth the hghest wealth (.e., the hghest true valuatos. The cetve compatblty of GVA mechasm maes t easy for a bdder who persstetly lost the prevous aucto rouds to coclude that hs true valuato s ot large eough to ever become a wer oce the wers of the aucto starts to repeat (each wer of a aucto roud may sp several subsequet rouds sce her demad for servces may be satsfed for a whle. Whe ths happes, there s o cetve for persstet losers of the aucto to partcpate the future aucto rouds. Cosequetly, they drop from the aucto ad fd other ways to satsfy ther demad for the desred etwor servces. Such a drop the umber of bdders decreases the prce competto the aucto ad may ultmately result reveue collapse of the etwor servce provder. I short, GVA mechasm, the bdders who do ot w for several rouds may drop out of the aucto after they coclude that t s mpossble for them to w ths aucto maret. I the log ru, oly bdders who belog to oe of the optmal combatos of subsequet aucto rouds are left the aucto maret. The, for at least oe
3 aucto roud, the left ad rght terms of Eq. (3 wll become equal, that s * * b r x = b r x for wth x * = (4 = = Hece, based o the prcg of GVA gve by Eq. (3, the resultg prce of etwor resource for each selected wer becomes zero. Wth all partcpats becomg wers sooer or later, the aucto s o loger cetve compatble, because lowerg the bd does ot mae the bdder elgble for wg, but merely delays hs wg roud. Hece, the bdders may decrease ther bds below ther true valuatos, thereby trggerg collapse of reveues for the etwor servce provder. We call ths pheomeo a paradox of the cetve compatble mechasm recurrg aucto because by achevg the goal of motvatg the bdders to bd ther true valuatos, the mechasm, whe appled to a recurrg aucto, vtes the maret collapse after oly several rouds of aucto. Our prevous research demostrated ad evaluated the reveue collapse caused by the bdder drop problem o-cetve compatble recurrg aucto mechasms [-2]. The followg example llustrates t the cetve compatble recurrg GVA aucto. Let s cosder Example of secto II aga. Example 2: Bdders B3 ad B4 are selected as wers ad pay $3 ad $5 for a etwor resource utespectvely. If those bdders partcpate every aucto roud, bdders B ad B2 have o cetve to partcpate the aucto ad drop out of t. Whe bdders B3 ad B4 are selected as wers after such a drop, ther paymets become $6 $6 = $0 for bdder B3 ad ($6 $6 / 2 = $0 for bdder B4. Therefore, the reveue of etwor servce provder collapses to zero. More terestg case arses f all bdders sp a roud after each w. The, bdders B3 ad B4 are wg odd umbered aucto rouds, payg $3 ad $5 for a etwor resource ut, respectvely, whle bdders B ad B2 w eve umbered aucto rouds, but pay $0 for allocated resources. All bdders w regardless of the value of ther bds, so they may decrease ther bds. For example, bdders B3 ad B4 may woder f payg $3 or $5 per ut of resource s worth avodg watg a aucto roud for the w. As the result, bds wll reflect the true valuato of oe-roud delay of access to resources stead of the true valuato of ever accessg the resources ad the reveue of the servce provder wll be accordgly lowereflectg ths dfferece true valuatos. IV. NETWORK SERVICE ALLOCATION USING PI-GVA Applyg a recurret aucto to short-term cotract-based heterogeeous etwor servces requres resolvg bdder drop problem to prevet maret collapse. To acheve ths goal, we troduce the Partcpato Icetve Geeralzed Vcrey Aucto (PI-GVA wth oe tme sealed bddg. Our addtoal desg goals clude preservg cetve compatblty ad low egotato cost of the GVA mechasm. A. Networ Resource Allocato Strategy To prevet bdder drop problem from arsg, the PI-GVA mechasm rewards bdders for partcpato a roud of recurret aucto through the wg score S r ( b [2] that s used, stead of a bd, for selectg wers. The bddg score of bdder roud r s defed as: b =, (5 S r ( b p w where b deotes the average bd of bdder utl roud r, p,r represets the cumulatve umber of rouds whch the bdder partcpated up to ad cludg roud r, w,r stads for the cumulatve umber of ws utl roud r, ad s a costat that cotrols the effect of bd values o the wg score. Sce ( b p / represets the expected umber of ws, the wg score S r ( b measures the dfferece betwee the expected ad real umbers of ws at roud r for bdder. The hgher the wg score s, the more below bdder s expectatos wgs are ad therefore the hgher the probablty of hm droppg out of the aucto s. I each aucto roud, the PI-GVA mechasm selects as wers the combato of bdders for whch the sum of wg scores of all selected bdders s the largest. Hece, the etwor resource allocato strategy (.e., the wers selecto strategy usg PI-GVA s b max ( b = max ( p w (6 F F C C I each aucto roud, the feasble etwor resource allocato s restrcted by the resource costrat defed by Iequalty ( ad the wg score costrat defed as follows: b ( b > for C (7 The wg score costrat requres that the wg score of each wer s hgher tha zero; a bdder eeds to ear eough expected ws before the real w ca happe. By Eq. (5, the partcpato of a loser the last aucto roud s rewarded drectly by creasg her wg score for the curret ad future aucto rouds. The creased wg score mproves the bdder s chaces to w the future aucto rouds. Therefore, the PI-GVA mechasm cotrols bdder drop problem by ecouragg bdders partcpato future aucto rouds. Sce the cumulatve average bd b s used the Eq. (5, decreasg a bd durg a aucto roud decreases the expected umber of ws, eve f the bdder partcpates every aucto roud, thereby decreasg hs wg score. Hece, the PI-GVA mechasm ecourages the bdders to eter ever hgher or at least the same bds durg recurrg aucto.
4 The coeffcet cotrols effect of the average bd o the wg score. If s creased, the effect of bd value s dmshed, mprovg the chace of wg by the bdders wth lower bds. Reversely, f s decreased, the effect of bd value s creased ad the chace of wg wth lower bds s decreased. Therefore, the optmal strategy for decdg the value of coeffcet depeds o etwor servce provder s goals. I ths paper, based o varous expermetato results, we set equal to the rato of tal average bds of all bdders to the umber of wers (wth ths value of, the sum of all wg scores remas costat f all bdders partcpate all rouds wth uchaged bds; ths selecto maes t also easy to satsfy the wg score costrat defed by Iequalty (7. B. Prcg Networ Resources To descrbe the prcg rule of the proposed PI-GVA mechasm, we deote by x the vector of wers defed by the PI-GVA wer selecto strategy expressed Eq. (6 (f bdder s a wer, x =, otherwse, x = 0, whle x deotes the vector of such wers whe bdder s removed from the aucto roud. The prcg rule of the PI- GVA mechasm s a modfcato of the tradtoal prcg rule of GVA. The prce s establshed a two-step procedure. The frst step s to compute the paymet wg score I ( b of the selected wer wth the average bd b, accordg to the followg equato: (8 I ( b = ( b r x ( b r x = Hece, the paymet wg score of wer s computed by deductg the sum of products of wg scores ad requested umbers of resources of all wers, except bdder, x from such sum for all wers x. From the paymet wg score of the selected wer defed Eq. (8 ad the wg score fucto defed Eq. (5, the paymet G ( b of wer for a etwor resource ut s computed as: G(b = I (b b (9 r S(b Ths prcg rule guaratees that the paymet of each wer s lower tha hs bd. = C. Optmal Strateges of Bdders The bdder s optmal strategy PI-GVA mechasm ca be defed from two perspectves: the bd value ad the partcpato level. I aucto for heterogeeous etwor servces, each bdder tres to choose the bd that maxmzes the utlty fucto U(b defed as: U(b = (t G(b q(b, (0 where t deotes the true valuato of a resource ut by bdder, G(b s the prce pad for each etwor resource ut ad q(b stads for the probablty of wg aucto roud r. Based o the prcg rule defed by Eq. (9, the utlty fucto of Eq. (0 ca be rewrtte as: I( b b U ( b = ( t G( b q( b = ( t q( b r ( b As show the Appedx, creasg the bd creases the proft factor (t G(b of the above utlty fucto. Moreover, creasg the bd ether creases or matas the probablty of wg q(b. Therefore, bddg the true valuato maxmzes each bdder s expected utlty fucto U(b because the true valuato s the upper boud of the bd of each bdder. I terms of partcpato, the proft factor (t G(b s a creasg fucto whle the probablty of wg q(b s a o-decreasg fucto of the umber of rouds whch the bdder partcpated. Hece, creasg bdder s partcpato aucto rouds creases the expected utlty of ths bdder. Therefore, the domat bdder s strategy uder PI-GVA mechasm s to partcpate as may rouds as eeded to w ad to bd each of those rouds the true valuato of the etwor servce ut. The detaled proof of the optmalty of ths strategy s gve the Appedx. V. EXPERIMENTATION To evaluate the proposed PI-GVA mechasm, we performed smulato-based expermets. I those expermets, we compared the followg two aucto mechasms for short-term cotract maret for heterogeeous etwor servces: ( the Tradtoal Geeralzed Vcrey Aucto (TGVA descrbed secto II as GVA; (2 the Partcpato Icetve Geeralzed Vcrey Aucto (PI-GVA troduced secto IV. A. Expermetato Setup There are 5 bdders who are also customers ad a auctoeer who s also the etwor servce provder. I each aucto roud, 0 etwor resource uts are traded for short-term use by customers requestg etwor servces. Each bdder requests dfferet umber of etwor resource uts to satsfy her desred qualty of servce for heterogeeous etwor servces. Hece, each bdder requests the desred umber of uts of etwor resources ad bds how much he s wllg to pay for each requested ut of etwor resource. The desred umber of uts s uformly dstrbuted betwee [, 3]. Ths umber remas costats over the etre smulato. I addto to the perceved trsc value of the traded etwor resources, the wealth of each bdder lmts her wllgess to pay ad mpacts her true valuato of the uts of etwor resource. For smplcty, we cosder oly the dstrbuto of the customer s true valuatos here. We use three stadard dstrbutos of true valuatos wth mea 5: the expoetal dstrbuto, the uform dstrbuto over the rage [, 9], ad the Gaussa dstrbuto. Hece, wthout loss of geeralty, we ca assume that the average prce of etwor resource ut s 5. Based o
5 Fg. The average sellg prce of etwor resource ut these true value dstrbutos, each bdder bds her true valuato uder each aucto mechasm to maxmze her expected utlty the recurrg aucto sce the two aucto mechasms beg compared are cetve compatble. To model bdder drop behavor, we troduce a cocept of the Tolerace to Cosecutve Losses, abbrevated as TCL. It deotes the maxmum umber of cosecutve losses that a customer ca tolerate before extg a aucto [7]. Ths oto captures the bdders lmted tolerace to loses before they ext the aucto cocludg that ther true valuatos prevet them from ever becomg a wer ths aucto. Hece, f the cosecutve losses exceed the bdder s TCL, the bdder exts the aucto. We assume, that the bdders who exted, ever retur aga to the curret aucto maret. TCL of each customer s uformly dstrbuted over the rage of [2, 6]. Based o these settgs, each smulato s executed for 2000 aucto rouds. At the ed, we measure for each mechasm the reveue of etwor servce provder ad the bdder retag ablty as measured by the umber of remag actve bdders. To estmate reveues of etwor servce provder, we measure the average sellg prce of etwor resource ut at the ed of every 50 rouds over the etre recurrg aucto. To compute the bdder retag ablty, we measure the percetage of users dropped each compared mechasm at the ed of the recurrg aucto. B. Expermetato Results As show the Fg., all three dstrbutos of bdders wealth (.e., the dstrbutos of true valuatos, TGVA caot prevet collapse of the sellg prce for a etwor resource ut as a result of bdders droppg out of the aucto. The combatoral wer selecto strategy of TGVA focuses o bds oly so t excludes the lower true valuato bdders from ever becomg wers. Cosequetly, those bdders drop out of the aucto after TCL rouds, decreasg prce competto. Fally, oly bdders who at least occasoally become wers rema the aucto ad the resultg sellg prces drop for those bdders to zero based o the prcg rule of TGVA. Ths pheomeo llustrates the paradox of cetve compatble mechasm recurrg aucto. Therefore TGVA, the bdder drop s the sole cause of reveue collapse the recurrg aucto. I cotrast to TGVA, the combatoral wer selecto based o wg score of Eq. (5 the proposed PI-GVA mechasm allocates etwor resources effcetly ad yet prevets bdders drop out of the aucto, thereby matag prce competto ad stablzg the sellg prce of etwor resource uts at about $5. Table. Percetage of dropped users Uform Expoetal Gaussa TGVA 73.33% 73.33% 66.67% PI-GVA 40.00% 46.67% 40.00% I terms of actve bdder retag level, Table shows that the proposed PI-GVA mechasm retas over 50% of the tally actve user throughout the etre recurrg aucto. Oly the bdders wth very low true valuatos are preveted from ever wg by the wer selecto based o wg score of Eq. (5. Yet, TGVA, about 70% of bdders drop out of the aucto. Hece, the proposed PI-GVA mechasm acheves hgher socal welfare because more users beeft from the etwor resource allocatos. VI. CONCLUSIONS AND FUTURE WORKS The combatoral wer selecto of the GVA mechasm allocates resources to bdders optmally for a sgle roud of a aucto. However, the recurrg ature of aucto for etwor resource allocato may cause bdder drop resultg from the paradox of cetve compatble mechasm recurrg aucto. Therefore, desgg aucto based dyamc prcg mechasms for heterogeeous etwor servces, the addtoal pheomeo, bdder droppg, should be cosdered. We troduced the PI-GVA mechasm that provdes a ovel combatoral wer selecto strategy. The proposed strategy prevets bdder drop by provdg cetve for bdder s partcpato each aucto roud whch results eough bdders remag the aucto to eep the prces stable the maret. I our future wor, we wll attempt to desg more effcet bdder drop cotrol algorthms ad wll exted our study to the case whch dropped bdders retur to the aucto. APPENDIX Lemma : The proft factor (t G (b of the utlty fucto of Eq. (0 s a creasg fucto of bd value b. Proof: The proft factor (t G(b ca be rewrtte as (t (I (b b r S(b. Note that the paymet wg
6 score I (b of bdder does ot depedet o bd b (see Eq. (9 ad the requred umber of etwor resource uts r ad true valuato t ca be regarded as costats. Hece, the proft factor ca be flueced oly by a fracto ( b ( b. Hece, to prove Lemma, we eed to show that creasg the bd decreases ths fracto. Ideed, we have: b ( b α w (A- = + > ( b + α ( b + α b ( b + α ( p, r w where bd cremet α > 0. Iequalty (A- s true because b, α,, ad w,r are always larger tha zero, ad the curret wg score S r ( b s also larger tha zero thas to the wg score costra of Iequalty (7. Therefore, creasg the bd creases the proft factor (t G(b. Lemma 2: The probablty of wg q(b the utlty fucto of bdder s a o-decreasg fucto of bd b. Proof: I aucto roud r, the wg score coeffcet, the cumulatve umber of ws w,r, ad the umber of rouds whch bdder partcpated p,r ca be regarded as costats. Hece, creasg bd b creases the wg score. The PI- GVA mechasm ras bdders the decreasg order of ther wg scores gve by Eq. (5. Hece, creasg wg score of a bdder wll ether mprove or mata the ra of ths bdder. Sce the PI-GVA combatoral wer selecto strategy of Eq. (6 maxmzes the sum of wg scores of wers, the followg three cases are possble terms of probablty of wg whe a bdder crease hs bd. Case ( Ra of bdder s mproved ad hs probablty of wg s creased (e.g., the bdder ow outras aother bdder the optmal combato wth the same resource request, so the former replaces the latter as the wer. Case (2 Ra of bdder s mproved but there s o chage hs probablty of wg (e.g., the bdder was elgble to be a part of optmal combato because of resource costrats, so hs mproved ra does ot gve hm ay advatage. Case (3 Ra of bdder s uchaged, ad there s o chage hs probablty of wg. I all of three cases, the probablty of wg caot decrease wheever a bdder creases hs bd. Addtoally, the creased wg score wll carry over to future aucto rouds. Hece eve f the creased wg score does ot chage probablty of wg by the bdder the curret aucto roud, t stll may crease the probablty of wg the log ru. Based o Lemmas ad 2, we coclude that by creasg hs bd, bdder creases hs expected utltyu(b. Addtoally, each bdder s bd s lmted by hs true valuato. Hece, bddg each bdder s true valuato maxmzes the bdder s expected utlty the proposed PI-GVA mechasm. I short, PI-GVA s a cetve compatble mechasm. From the partcpato pot of vew, creasg the umber of rouds whch bdder partcpates decreases the fracto (b S(b of the proft factor (t G(b. Hece, t creases the resultg proft factor. Addtoally, creasg the umber of rouds whch bdder partcpates creases the wg score thas to partcpato cetve defed Eq. (5. As show Lemma 2 proof, creasg the wg score creases or matas the probablty of wg by the bdder. Hece, the probablty q(b of wg by bdder s odecreasg fucto of umber of rouds p, whch bdder r partcpates. Therefore, creasg umber of rouds whch the bdder partcpates creases hs expected utlty U(b. I cocluso, the bdder s optmal strategy the PI-GVA mechasm s to bd hs true valuato ad to partcpate as may aucto rouds as possble. ACKNOWLEDGMENT Ths research s cotug through partcpato of B.K. Szymas the Iteratoal Techology Allace sposored by the U.S. Army Research Laboratory ad the U.K. Mstry of Defece. REFERENCES [] S. Ju ad V. Prav, Smart Pay Access Cotrol va Icetve Algmet, IEEE J. Selected Areas Commucatos, 24(5:05-060, Jue [2] W. X ad S. Heg, Prcg Networ Resource for Adaptve Applcatos, IEEE/ACM Trasactos o Networg, 4(3:506-59, Jue [3] H. Ara, T. Eva ad W. Tom, A etwor prcg game for selfsh traffc, Proc. 24 th Aual ACM Symp. Prcples of Dstrbuted Computg, pp , May [4] S. Shaotta ad R. at, Ecoomcs of etwor prcg wth multple ISPs, Proc. IEEE INFOCOM 2005, Mam, FL, pp , March [5] C. Courcoubets ad R. Weber, Prcg Commucato Networs Ecoomcs, Techology ad Modellg. Wley, [6] A. Surea ad P.R. Wurma, Applyg the geeralzed Vcrey aucto to prcg relable multcasts, Proc. It. Worshop Iteret Chargg ad QoS Techologes (ICQT, pp , Oct [7] L.A. DaSlva, Prcg of QoS-Eabled Networs: A Survey, IEEE Commucatos Surveys & Tutorals, 3(2, [8] M. Bchler, The Future of e-marets: Multdmesoal Maret Mechasm. Cambrdge Uversty Press, 200. [9] R. McAfee ad P.J. McMlla, Aucto ad Bddg, J. Ecoomc Lterature, 25: , 997. [0] J.G. Rley ad W.F. Samuelso, Optmal Aucto, The Amerca Ecoomc Revew, 7(3:38 392, Ju. 98. [] J. S. Lee ad B. K. Szymas, A Novel Aucto Mechasm for Sellg Tme-Sestve E-Servces, Proc. 7 th It. IEEE Cof. E-Commerce Techology (CEC, Much, pp , [2] J.-S. Lee ad B.K. Szymas, "Auctos as a Dyamc Prcg Mechasm for e-servces", Servce Eterprse Itegrato, Cheg Hsu (ed., Kluwer, New Yor, pp. 3-56, 2006.
OPTIMAL BUS DISPATCHING POLICY UNDER VARIABLE DEMAND OVER TIME AND ROUTE LENGTH
OPTIMAL BUS DISPATCHING POLICY UNDER VARIABLE DEMAND OVER TIME AND ROUTE LENGTH Amal S. Kumarage, Professor of Cvl Egeerg, Uversty of Moratuwa, Sr Laka H.A.C. Perera, Cetral Egeerg Cosultacy Bureau, Sr
More informationShort Note: Merging Secondary Variables for Geophysical Data Integration
Short Note: Mergg Secodary Varables for Geophyscal Data Itegrato Steve Lyster ad Clayto V. Deutsch Departmet of Cvl & Evrometal Egeerg Uversty of Alberta Abstract Multple secodary data from geophyscal
More informationA New Mathematical Model for a Redundancy Allocation Problem with Mixing Components Redundant and Choice of Redundancy Strategies
Appled Mathematcal Sceces, Vol, 2007, o 45, 222-2230 A New Mathematcal Model for a Redudacy Allocato Problem wth Mxg Compoets Redudat ad Choce of Redudacy Strateges R Tavakkol-Moghaddam Departmet of Idustral
More informationDYNAMIC BROADCAST SCHEDULING IN ASYMMETRIC COMMUNICATION SYSTEMS: PUSH AND PULL DATA BASED ON SCHEDULING INDEX AND OPTIMAL CUT-OFF POINT YUFEI GUO
DYNAMIC BROADCAST SCHEDULING IN ASYMMETRIC COMMUNICATION SYSTEMS: PUSH AND PULL DATA BASED ON SCHEDULING INDEX AND OPTIMAL CUT-OFF POINT by YUFEI GUO Preseted to the Faculty of the Graduate School of The
More informationK-Map 1. In contrast, Karnaugh map (K-map) method provides a straightforward procedure for simplifying Boolean functions.
K-Map Lesso Objectves: Eve though Boolea expressos ca be smplfed by algebrac mapulato, such a approach lacks clear regular rules for each succeedg step ad t s dffcult to determe whether the smplest expresso
More informationThe optimization of emergency resource-mobilization based on harmony search algorithm
Avalable ole www.ocpr.com Joural of Chemcal ad Pharmaceutcal Research, 04, 6(7):483-487 Research Artcle ISS : 0975-7384 CODE(USA) : JCPRC5 The optmzato of emergecy resource-moblzato based o harmoy search
More informationAssignment#4 Due: 5pm on the date stated in the course outline. Hand in to the assignment box on the 3 rd floor of CAB.
MATH Assgmet#4 Due: 5pm o the date stated the course outle. Had to the assgmet box o the 3 rd floor of CAB.. Let deote the umber of teror regos of a covex polygo wth sdes, dvded by all ts dagoals, f o
More informationSixth Edition. Chapter 7 Point Estimation of Parameters and Sampling Distributions Mean Squared Error of an 7-2 Sampling Distributions and
3//06 Appled Statstcs ad Probablty for Egeers Sth Edto Douglas C. Motgomery George C. Ruger Chapter 7 Pot Estmato of Parameters ad Samplg Dstrbutos Copyrght 04 Joh Wley & Sos, Ic. All rghts reserved. 7
More informationA CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS. K. Thaga. Department of Statistics University of Botswana, Botswana
A CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS K. Thaga Departmet of Statstcs Uversty of Botswaa, Botswaa thagak@mopp.ub.bw ABSTRACT Stadard cotrol charts wth cotrol lmts determed by the mea ad stadard
More informationProposed an Adaptive Bitrate Algorithm based on Measuring Bandwidth and Video Buffer Occupancy for Providing Smoothly Video Streaming
(IJACSA) Iteratoal Joural of Advaced Computer Scece ad Applcatos, ol. 9, No. 2, 218 Proposed a Adaptve Btrate Algorthm based o Measurg Badwdth ad deo Buffer Occupacy for Provdg Smoothly deo Streamg Saba
More informationModule 6. Channel Coding. Version 2 ECE IIT, Kharagpur
Module 6 Chael Codg Lesso 36 Coded Modulato Schemes After readg ths lesso, you wll lear about Trells Code Modulato; Set parttog TCM; Decodg TCM; The modulated waveform a covetoal ucoded carrer modulato
More informationA New Aggregation Policy for RSS Services
A New Aggregato Polcy for RSS Servces Youg Geu Ha Sag Ho Lee Jae Hw Km Yaggo Km 2 School of Computg, Soogsl Uversty Seoul, Korea {youggeu,shlee99,oassdle}@gmal.com 2 Dept. of Computer ad Iformato Sceces,
More informationDistributed Online Matching Algorithm For Multi-Path Planning of Mobile Robots
Proect Paper for 6.854 embers: Seugkook Yu (yusk@mt.edu) Sooho Park (dreameo@mt.edu) Dstrbuted Ole atchg Algorthm For ult-path Plag of oble Robots 1. Itroducto Curretly, we are workg o moble robots whch
More informationDISTRIBUTION VOLTAGE MONITORING AND CONTROL UTILIZING SMART METERS
4 th Iteratoal Coferece o Electrcty Dstrbuto Glasgow, -5 Jue 07 DISTRIBUTION VOLTAGE MONITORING AND CONTROL UTILIZING SMART METERS Yoshhto. KINOSHITA Kazuor. IWABUCHI Yasuyuk. MIYAZAKI Toshba Japa Toshba
More informationSAIDI MINIMIZATION OF A REMOTE DISTRIBUTION FEEDER. Kai Zou, W. W. L. Keerthipala and S. Perera
SAIDI INIIZATIN F A RETE DISTRIBUTIN FEEDER Ka Zou, W. W.. Keerthpala ad S. Perera Uversty of Wollogog School of Electrcal ad Computer Telecommucato Egeerg Wollogog, NSW 2522, Australa Abstract Dstrbuto
More informationOn the Techniques for Constructing Even-order Magic Squares using Basic Latin Squares
Iteratoal Joural of Scetfc ad Research Publcatos, Volume, Issue 9, September 0 ISSN 50-353 O the Techques for Costructg Eve-order Magc Squares usg Basc Lat Squares Tomba I. Departmet of Mathematcs, Mapur
More informationThe Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic
Sesors 205, 5, 954-9559; do:0.3390/s508954 Artcle OPEN ACCESS sesors ISSN 424-8220 www.mdp.com/joural/sesors The Balaced Cross-Layer Desg Routg Algorthm Wreless Sesor Networks Usg Fuzzy Logc Ng L *, José-Ferá
More informationVALUATION OF REACTIVE POWER ZONAL CAPACITY PAYMENTS
VALUATION OF REACTIVE POWER ZONAL CAPACITY PAYMENTS Pablo Frías, Davd Soler ad Tomás ómez Isttuto de Ivestgacó Tecológca of Uversdad Potfca Comllas Madrd, Spa pablo.fras@t.upco.es, soera@upco.es, tomas.gomez@t.upco.es
More informationLong Number Bit-Serial Squarers
Log Number Bt-Seral Squarers E. Chaotaks, P. Kalvas ad K. Z. Pekmestz are th the Natoal Techcal Uversty of Athes, 7 73 Zographou, Athes, Greece. E-mal: lchaot, paraskevas, pekmes@mcrolab.tua.gr Abstract
More informationA Novel Bandwidth Optimization Manager for Vehicle Controller Area Network, CAN, System
A Novel Badwdth Optmzato Maager for Vehcle Cotroller Area Network, CAN, System Y WANG, Z-y YOU, L-hu HUI Guzhou Normal Uversty, Guyag, Guzhou 550001, Cha Abstract Ths paper cosders the badwdth lmtato of
More informationLecture6: Lossless Compression Techniques. Conditional Human Codes
ecture6: ossless Compresso Techques Codtoal uma Codes -Cosder statoary dscrete arov process, = { s, s, s } wth codtoal pmfs P P s s wth,, tates o Ps/so.9.5.5 Ps/s.5.8.5 Ps/s.5.5.6 -The margal probabltes
More informationFrequency Assignment for IEEE Wireless Networks
Frequecy Assgmet for IEEE 8 Wreless Networks K K Leug Bell Labs, Lucet Techologes Murray Hll, NJ 7974 k@bell-labscom Byoug-Jo J Km AT&T Labs Research Mddletow, NJ 7748 macsbug@researchattcom Abstract The
More informationOPTIMIZATION AND OPERATIONS RESEARCH Vol. III - Mechanism Theory - Matthew O. Jackson
MECHANISM THEORY Matthew O. Jackso Staford Uversty, Staford, Calfora, 94305, USA. Keywords: mechasm, mechasm desg, domat strategy, publc goods, aucto, bargag, Bayesa equlbrum, Bayesa cetve compatblty,
More informationDistributed Joint AP Grouping and User Association for MU-MIMO Networks
IEEE INFOCOM 2018 - IEEE Coferece o Computer Commucatos Dstrbuted Jot AP Groupg ad User Assocato for MU-MIMO Networks Wagkt Wog S.-H. Gary Cha Departmet of Computer Scece ad Egeerg The Hog Kog Uversty
More informationOptimal Power Allocation in Zero-forcing MIMO-OFDM Downlink with Multiuser Diversity
Optmal Power Allocato Zero-forcg IO-OFD Dowl wth ultuser Dversty Peter W. C. Cha ad oger S.. Cheg Abstract hs paper cosders the optmal power allocato for a multuser IO-OFD dowl system usg zero-forcg multplexg
More informationLECTURE 4 QUANTITATIVE MODELS FOR FACILITY LOCATION: SERVICE FACILITY ON A LINE OR ON A PLANE
LECTUE 4 QUANTITATIVE MODELS FO FACILITY LOCATION: SEVICE FACILITY ON A LINE O ON A PLANE Learg objectve 1. To demostrate the quattatve approach to locate faclt o a le ad o a plae 6.10 Locatg Faclt o a
More informationDescriptive Statistics
Math 3 Lecture I Descrptve tatstcs Descrptve statstcs are graphcal or umercal methods utlsed to summarze data such a way that mportat features of the sample ca be depcted. tatstcs: tatstcs s cocered wth
More informationAn Improved DV-Hop Localization Algorithm Based on the Node Deployment in Wireless Sensor Networks
Iteratoal Joural of Smart Home Vol. 9, No. 0, (05), pp. 97-04 http://dx.do.org/0.457/jsh.05.9.0. A Improved DV-Hop Localzato Algorthm Based o the Node Deploymet Wreless Sesor Networks Jam Zhag, Ng Guo
More informationGeneration Reliability Evaluation in Deregulated Power Systems Using Game Theory and Neural Networks
Smart Grd ad Reewable Eergy, 212, 3, 89-95 http://dx.do.org/1.4236/sgre.212.3213 Publshed Ole May 212 (http://www.scrp.org/joural/sgre) 1 Geerato Relablty Evaluato Deregulated Power Systems Usg Game Theory
More informationRedundancy-Allocation in Pharmaceutical Plant Deepika Garg*, Kuldeep Kumar**,G.L.Pahuja***
Deepka Garg et. al. / Iteratoal Joural of Egeerg Scece ad Techology Vol. 2(5), 200, 088-097 Redudacy-Allocato Pharmaceutcal Plat Deepka Garg*, Kuldeep Kumar**,G.L.Pahua*** *RESEARCH SCHOLAR,DEPT. OF MATHEMATICS,N.I.T.,KURUKSHETRA
More informationCHAPTER-4 WIDE BAND PASS FILTER DESIGN 4.1 INTRODUCTION
CHAPTER-4 WIDE BAND PASS FILTER DESIGN 4. INTRODUCTION The bad pass flters suested last chapter are hav the FBW less tha the 2%. I cotrast of that ths chapter deals wth the des of wde bad pass flter whch
More informationEvolutionary Algorithm With Experimental Design Technique
Evolutoary Algorthm Wth Expermetal Desg Techque Qgfu Zhag Departmet of Computer Scece Uversty of Essex Wvehoe Park Colchester, CO4 3SQ Uted Kgdom Abstract: - Major steps evolutoary algorthms volve samplg
More informationStatic games: Coordination and Nash equilibrium
Statc game: Coordato ad Nah equlbrum Lecture Game Theory Fall 204, Lecture 2 3.0.204 Dael Spro, ECON3200/4200, Lecture 2 Ratoalzablty about Narrowg dow the belef I have ad the other player may have by
More informationPerformance Comparison of Two Inner Coding Structures in Concatenated Codes for Frequency-Hopping Spread Spectrum Multiple-Access Communications
Iteratoal Joural o Recet ad Iovato Treds Computg ad Commucato IN: 31-8169 Volume: 3 Issue: 741-745 erformace Comparso of Two Ier Codg tructures Cocateated Codes for Frequecy-Hoppg pread pectrum Multple-Access
More informationGeometric Distribution as a Randomization Device: Implemented to the Kuk s Model
It. J. Cotem. Math. Sceces, Vol. 8, 03, o. 5, 43-48 HIKARI Ltd, www.m-hkar.com Geometrc Dstrbuto as a Radomzato Devce: Imlemeted to the Kuk s Model Sarjder Sgh Deartmet of Mathematcs Texas A&M Uversty-Kgsvlle
More informationOptimal Packetization Interval for VoIP Applications Over IEEE Networks
145 Afrca Joural of Iformato ad Commucato Techology, Vol. 2, No. 4, December 2006 Optmal Packetzato Iterval for VoIP Applcatos Over IEEE 802.16 Networks Sheha Perera Departmet of Electrcal & Computer Egeerg
More informationExam. Real-time systems, basic course, CDT315. Grading: Swedish grades: ECTS grades:
6 Exam eal-tme systems, basc course, 35 eacher: amr Isovc Phoe: 0 3 73 Exam durato: 08:30 3:30 Help alloed: Pots: calculator ad a laguage dctoary 48 p Gradg: Sedsh grades: ES grades: Importat formato:
More informationA Two Objective Model for Location-Allocation in a Supply Chain
AmrHosse Nobl, Abolfazl Kazem,Alreza Alejad/ TJMCS Vol. 4 No. 3 (22) 392 4 The Joural of Mathematcs ad Computer Scece Avalable ole at http://www.tjmcs.com The Joural of Mathematcs ad Computer Scece Vol.
More information5. Random Processes. 5-3 Deterministic and Nondeterministic Random Processes
5. Radom Processes 5- Itroducto 5- Cotuous ad Dscrete Radom Processes 5-3 Determstc ad Nodetermstc Radom Processes 5-4 Statoary ad Nostatoary Radom Processes 5-5 rgodc ad Noergodc Radom Processes 5-6 Measuremet
More informationEfficient Utilization of FlexRay Network Using Parameter Optimization Method
Iteratoal Joural of Egeerg ad Techology, Vol. 8, No. 6, December 2016 Effcet Utlzato of FlexRay Network Usg Parameter Optmzato Method Y. X. Wag, Y. H. Xu, ad Y. N. Xu Abstract FlexRay s a hgh rate of bus
More informationBER ANALYSIS OF V-BLAST MIMO SYSTEMS UNDER VARIOUS CHANNEL MODULATION TECHNIQUES IN MOBILE RADIO CHANNELS
202 Iteratoal Coferece o Computer Techology ad Scece (ICCTS 202) IPCSIT vol. 47 (202) (202) IACSIT Press, Sgapore DOI: 0.7763/IPCSIT.202.V47.24 BER ANALYSIS OF V-BLAST MIMO SYSTEMS UNDER VARIOUS CANNEL
More informationOptimal Reliability Allocation
Optmal Relablty Allocato Wley Ecyclopeda of Operatos Research ad Maagemet Scece Yashwat K. Malaya Computer Scece Dept. Colorado State Uversty, Fort Colls CO 80523 malaya@cs.colostate.edu Phoe: 970-49-703,
More informationJournal of Network and Computer Applications
Joural of Network ad Computer Applcatos 34 (2011) 1263 1271 Cotets lsts avalable at SceceDrect Joural of Network ad Computer Applcatos joural homepage: www.elsever.com/locate/jca A bddg model ad cooperatve
More informationFault-Tolerant Small Cells Locations Planning in 4G/5G Heterogeneous Wireless Networks
1 Fault-Tolerat Small Cells Locatos Plag G/G Heterogeeous Wreless Networks Tamer Omar 1, Zakha Abchar, Ahmed E. Kamal 3, J. Morrs Chag ad Mohammad Aluem 1 Departmet of Techology Systems, East Carola Uversty,
More informationApplied Statistics and Probability for Engineers, 6 th edition December 31, 2013 CHAPTER 6. Section 6-1
Appled Statstcs ad Probablty for Egeers, 6 th edto December 31, 013 CHAPTER 6 Secto 6-1 6-1. No, usually ot. For eample, f the sample s {, 3} the mea s.5 whch s ot a observato the sample. 6-3. No, usually
More informationAdaptive QoS Control for Real-time Video Communication over Wireless Channels
Adaptve QoS Cotrol for Real-tme Vdeo Commucato over Wreless Chaels Dapeg Wu Y. Thomas Hou Wewu Zhu Zhha He Ya-Q Zhag Abstract Robust trasmsso of real-tme vdeo over wreless chaels s a challegg problem.
More informationConsecutiveness Loss-Aware Routing and Spectrum Assignment Algorithm in Flexible Bandwidth Optical Networks
0 7 Iteratoal ICST Coferece o Commucatos ad Networkg Cha (CHINACOM) Cosecutveess Loss-Aware Routg ad Spectrum Assgmet Algorm Flexble Badwd Optcal Networks Xbo Wag Yogl Zhao Jawe Zhag Xaosog Yu Je Zhag
More informationPROVIDING high-rate and reliable communications is an
1764 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 12, DECEMBER 26 OMAR: Utlzg Multuser Dversty Wreless Ad Hoc Networks Jafeg Wag, Studet Member, IEEE, Hogqag Zha, Studet Member, IEEE, Yuguag Fag,
More informationThermometer-to-binary Encoder with Bubble Error Correction (BEC) Circuit for Flash Analog-to-Digital Converter (FADC)
Thermometer-to-bary Ecoder wth Bubble Error Correcto (BEC) Crcut for Flash Aalog-to-Dgtal Coverter (FADC) Bu Va Heu, Seughyu Beak, Seughwa Cho +, Jogkook Seo ±, Takyeog Ted. Jeog,* Dept. of Electroc Egeerg,
More informationOptimal Bidding Strategy in Competitive Market Using GA & BFA: A Comparative Study
Iteratoal Joural of Egeerg Research ad Developmet e-issn: 2278-067X, p-issn: 2278-800X, www.jerd.com Volume 3, Issue 6 (September 2012), PP. 83-94 Optmal Bddg Strategy Compettve Market Usg GA & BFA: A
More informationK-sorted Permutations with Weakly Restricted Displacements
K-sorted Permutatos wth Weakly Restrcted Dsplacemets Tg Kuo Departmet of Marketg Maagemet, Takmg Uversty of Scece ad Techology Tape 5, Tawa, ROC tkuo@takmg.edu.tw Receved February 0; Revsed 5 Aprl 0 ;
More informationAn ANOVA-Based GPS Multipath Detection Algorithm Using Multi-Channel Software Receivers
A ANOVA-Based GPS Multpath Detecto Algorthm Usg Mult-Chael Software Recevers M.T. Breema, Y.T. Morto, ad Q. Zhou Dept. of Electrcal ad Computer Egeerg Mam Uversty Oxford, OH 4556 Abstract: We preset a
More informationA New and Efficient Proposed Approach to Find Initial Basic Feasible Solution of a Transportation Problem
Amerca Joural of Appled Mathematcs ad Statstcs, 27, Vol., No. 2, 4-6 Avalable ole at http://pubs.scepub.com/ajams//2/3 Scece ad Educato Publshg DOI:.269/ajams--2-3 A New ad Effcet Proposed Approach to
More informationMultiset Permutations in Lexicographic Order
Webste: www.jetae.com ISSN 2250-2459, ISO 9001:2008 Certfed Joural, Volume 4, Issue 1, Jauary 2014 Multset Permutatos Lexcographc Order Tg Kuo Departmet of Marketg Maagemet, Takmg Uversty of Scece ad Techology,
More informationSpeculative Completion for the Design of High-Performance Asynchronous Dynamic Adders
I: 1997 IEEE Iteratoal Symposum o Advaced Research Asychroous Crcuts ad Systems ( Asyc97 Symposum), Edhove, The Netherlads Speculatve Completo for the Desg of Hgh-Performace Asychroous Dyamc Adders Steve
More informationVoltage Contingency Ranking for IEEE 39-Bus System using Newton- Raphson Method
WSEAS TRANSACTIONS o OWER SSTEMS Haer m, Asma Meddeb, Souad Chebb oltage Cotgecy Rag for IEEE 39-Bus System usg Newto- Raphso Method HAER MII, ASMA MEDDEB ad SOUAD CHEBBI Natoal Hgh School of Egeers of
More informationJoint Centralized Power Control and Cell Sectoring for Interference Management in CDMA Cellular Systems in a 2D Urban Environment
Wreless Sesor Network, 010,, 599-605 do:10.436/ws.010.8071 Publshed Ole August 010 (http://www.scrp.org/joural/ws) Jot Cetralzed Power Cotrol ad Cell Sectorg for Iterferece Maagemet CDMA Cellular Systems
More informationSimulation of rainfall-runoff process by artificial neural networks and HEC-HMS model (case study Zard river basin)
Proceedgs of The Fourth Iteratoal Ira & Russa Coferece 43 Smulato of rafall-ruoff process by artfcal eural etworks ad HEC-HMS model (case study Zard rver bas Mehrdad Akbarpour MSc. Graguate, Water Structures
More informationSwitching Angle Design for Pulse Width Modulation AC Voltage Controller Using Genetic Algorithm and Distributed Artificial Neural Network
Swtchg Agle Desg for Pulse Wdth Modulato AC Voltage Cotroller Usg Geetc Algorthm ad Dstrbuted Artfcal Neural Network Pattarapor Jtta, Somyot Katwadvla ad Atthapol Ngaoptakkul Abstract. Ths paper proposes
More informationSIMPLE RANDOM SAMPLING
UIT IMPL RADOM AMPLIG mple Radom amplg tructure. Itroducto Obectves. Methods of electo of a ample Lottery Method Radom umber Method Computer Radom umber Geerato Method.3 Propertes of mple Radom amplg Merts
More informationAvailable online at (Elixir International Journal) Electrical Engineering. Elixir Elec. Engg. 37 (2011)
3908 Belal Mohammad Kalesar et al./ Elxr Elec. Egg. 37 (0) 3908-395 Avalable ole at www.elxrpublshers.com (Elxr Iteratoal Joural) Electrcal Egeerg Elxr Elec. Egg. 37 (0) 3908-395 Optmal substato placemet
More informationOPTIMAL DG PLACEMENT FOR MAXIMUM LOSS REDUCTION IN RADIAL DISTRIBUTION SYSTEM USING ABC ALGORITHM
teratoal Joural of Revews Computg 009-00 JRC & LLS. All rghts reserved. JRC SSN: 076-338 www.jrc.org E-SSN: 076-3336 OPTMAL PLACEMENT FOR MAXMUM LOSS REDUCTON N RADAL DSTRBUTON SYSTEM USNG ABC ALGORTHM
More informationInfinite Series Forms of Double Integrals
Iteratoal Joural of Data Evelopmet Aalyss ad *Operatos Research*, 4, Vol., No., 6- Avalable ole at http://pubs.scepub.com/jdeaor/// Scece ad Educato Publshg DOI:.69/jdeaor--- Ifte Seres Forms of Double
More informationA HIGH ACCURACY HIGH THROUGHPUT JITTER TEST SOLUTION ON ATE FOR 3GBPS AND 6GBPS SERIAL-ATA
A HIGH ACCURACY HIGH THROUGHPUT JITTER TEST SOLUTION ON ATE FOR 3GBPS AND 6GBPS SERIAL-ATA Yogqua Fa, Y Ca ad Zeljko Zlc LSI Corporato 0 Amerca Parkway NE, Alletow, Pesylvaa 809 Emal: y.ca@ls.com Departmet
More informationEnhancing Topology Control Algorithms in Wireless Sensor Network using Non-Isotropic Radio Models
IJCSNS Iteratoal Joural of Computer Scece ad Network Securty, VOL.6 No.8B, August 6 5 Ehacg Topology Cotrol Algorthms Wreless Sesor Network usg No-Isotropc Rado Models Ma.Vctora Que ad Wo-Joo Hwag Departmet
More informationFault-Tolerant Small Cells Locations Planning in 4G/5G Heterogeneous Wireless Networks
Ths artcle has bee accepted for publcato a future ssue of ths joural, but has ot bee fully edted. Cotet may chage pror to fal publcato. Ctato formato: DOI 10.1109/TVT.016.613, IEEE Trasactos o Vehcular
More information606. Research of positioning accuracy of robot Motoman SSF2000
606. Research of postog accuracy of robot Motoma SSF2000 A. Klkevčus, M. Jurevčus 2, V. Vekters 3, R. Maskeluas 4, J. Stakūas 5, M. Rybokas 6, P. Petroškevčus 7 Vlus Gedmas Techcal Uversty, Departmet of
More informationStudy of algorithms to optimize frequency assignment for autonomous IEEE access points
IJCSI Iteratoal Joural of Computer Scece Issues, Vol. 7, Issue 5, September 1 ISSN (Ole): 1694-814 64 Study of algorthms to optmze frequecy assgmet for autoomous IEEE 8.11 access pots Mchael Fsterbusch
More informationFlow-Through-Queue based Power Management for Gigabit Ethernet Controller 1
Flow-Through-Queue based Power Maagemet for Ggabt Etheret Cotroller 1 Hwsug Jug Ady Hwag Massoud Pedram Dept. of Electrcal Egeerg Uversty of Souther Calfora Eterprse Networkg Group Broadcom Corporato Dept.
More informationWLAN Design: A Distributed Approach
WLAN Desg: A Dstrbuted Approach Ala Mc Gbey, Mart Klepal, Drk Pesch The Cetre for Adaptve Wreless Systems Cork Isttute of Techology Cork, Irelad Ala.McGbey@ct.e, Mart.Klepal@ct.e, Drk.Pesch@ct.e Abstract
More informationA Signal Driven Adaptive Resolution Short-Time Fourier Transform
Iteratoal Joural of Iformato ad Commucato Egeerg 5:3 009 A Sgal Drve Adaptve Resoluto Short-Tme Fourer Trasform Saeed Ma Qasar, Lauret Fesquet ad Marc Reaud Abstract The frequecy cotets of the o-statoary
More informationReliability Allocation
Relablty Allocato Yashwat K. Malaya omputer Scece Dept. olorado State Uversty Fort olls O 80523 USA malaya@cs.colostate.edu Phoe: 970-49-703, 970-49-2466 Abstract---A system s geerally desged as a assembly
More informationMemetic Algorithm-Based Multi-Objective Coverage Optimization for Wireless Sensor Networks
Sesors 204, 4, 20500-2058; do:0.3390/s420500 Artcle OPEN ACCESS sesors ISSN 424-8220 www.mdp.com/joural/sesors Memetc Algorthm-Based Mult-Objectve Coverage Optmzato for Wreless Sesor Networks Zh Che,2,3,
More informationComparison of Measurement and Prediction of ITU-R Recommendation P.1546
Comparso of Measuremet ad Predcto of ITU-R Recommedato P.546 Chag-Hoo Lee *, Nam-Ryul Jeo *, Seog-Cheol Km *, Jug-m Lm * Isttute of New Meda ad Commucatos, Seoul Natoal Uversty, Cosoldated Mateace Depot,
More informationAn ID-based Proxy Authentication Protocol Supporting Public Key Infrastructure
A ID-based Proxy Authetcato Protocol Supportg Publc Key Ifrastructure Shuh-Pyg Sheh, Shh-I Huag ad Fu-She Ho Departmet of Computer Scece ad Iformato Egeerg, ABSTRACT The advatage of the ID-based authetcato
More informationAn Evolutionary Stochastic Approach for Efficient Image Retrieval using Modified Particle Swarm Optimization
(IJACSA) Iteratoal Joural of Advaced Computer Scece ad Applcatos, A Evolutoary Stochastc Approach for Effcet Image Retreval usg Modfed Partcle Swarm Optmzato Hads Hedar Departmet of Computer Egeerg Raz
More informationCEDAR: A Low-latency and Distributed Strategy for Packet Recovery in Wireless Network
: A Low-latecy ad Dstrbuted Strategy for Pacet Recovery Wreless Networ Chex Qu*, Hayg She*, Sohraab Solta, Kara Sapra*, Hao Jag ad Jaso Hallstrom *Departmet of Electrcal ad Computer Egeerg, Clemso Uversty,
More informationUCAIPM: Ubiquitous Computing Agile Information Protection Mechanism
CAIPM: bqutous Computg Agle Iformato Protecto Mechasm Daoqg Su, ad Qyg Cao Abstract I order to mprove the securty of ubqutous computg system, CAIPM, a ew ovel ubqutous computg agle formato protecto mechasm
More informationForecasting the UK/EU and JP/UK trading signals using Polynomial Neural Networks
Iteratoal Joural of Computer Iformato Systems ad Idustral Maagemet Applcatos (IJCISIM) ISSN 5-7988 Vol. (9), pp. 7 http://www.mrlabs.org/jcsm Forecastg the UK/EU ad JP/UK tradg sgals usg Polyomal Neural
More informationDesign of Fuzzy-Sliding Mode Control with the Self Tuning Fuzzy Inference Based on Genetic Algorithm and Its Application
58 ICASE: The Isttute of Cotrol, Automato ad Systems Egeers, KOREA Vol. 3, No. 1, March, 2001 Desg of Fuzzy-Sldg Mode Cotrol wth the Self Tug Fuzzy Iferece Based o Geetc Algorthm ad Its Applcato Seok-Jo
More informationSVD-based Collaborative Filtering with Privacy
SVD-based Collaboratve Flterg wth Prvacy Husey Polat Departmet of Electrcal Egeerg ad Computer Scece Syracuse Uversty, 121 L Hall Syracuse, NY 13244-1240, USA Phoe: +1 315 443 4124 hpolat@ecs.syr.edu Welag
More informationMeasures of variation or measures of spread: is a descriptive measure that describes how much variation or spread there is in a data set.
Secto.6 Meaure o Dpero Meaure o varato or meaure o pread: a decrptve meaure that decrbe how much varato or pread there a data et. Wh th mportat? Whch Catheter IV mauacturer would ou preer to ue or purchag
More informationThe Use of Genetic Algorithms in Validating the System Model and Determining Worst-case Transients in Capacitor Switching Simulation Studies
The Use of Geetc Algorthms Valdatg the System Model ad Determg Worst-case Trasets Capactor Swtchg Smulato Studes Mlade Kezuovc, Fellow, IEEE Yua Lao, Studet Member, IEEE Texas A&M Uversty Departmet of
More informationAn Enhanced Posterior Probability Anti-Collision Algorithm Based on Dynamic Frame Slotted ALOHA for EPCglobal Class1 Gen2
Joural of Commucatos Vol. 9,. 0, October 204 A Ehaced Posteror Probablty At-Collso Algorthm Based o Dyamc Frame Slotted ALOHA for EPCglobal Class Ge2 Lta Dua,Wewe Pag 2, ad Fu Dua 2 College of Iformato
More informationDual-Module Data Fusion of Infrared and Radar for Track before Detect
JOURAL OF COMPUTERS, VOL. 7, O. 2, DECEMBER 22 286 Dual-Module Data Fuso of Ifrared ad Radar for Trac before Detect Afu ZHU orth Cha Uversty of Water Resources ad Electrc Power Uversty,Zhegzhou, P.R.Cha
More informationZigbee wireless sensor network localization evaluation scheme with weighted centroid method
Zgbee wreless sesor etwork localzato evaluato scheme wth weghted cetrod method Loesy Thammavog 1, Khamphog Khogsomboo 1, Thaadol Tegthog 2 ad Sathapor Promwog 2,* 1 Departmet of Electrocs ad Telecommucato
More informationA Spectrally Efficient Frequency Division Multiplexing Based Communications System M. R. D. Rodrigues and I. Darwazeh
IOWo'03, 8th Iteratoal OFDM-Workshop, Proceedgs, Hamburg, DE, Sep 24-25, 2003 (Prepublcato draft) A Spectrally Effcet Frequecy Dvso Multplexg Based Commucatos System M. R. D. Rodrgues ad I. Darwazeh Laboratory
More informationPattern-based shortterm prediction of urban congestion propagation and automatic response
Predctg urba cogesto patters 227 Patter-based shortterm predcto of urba cogesto propagato ad automatc respose Fredrch Maer, Robert Brau, Frtz Busch, Techsche Uerstät Müche, Paul Mathas, Semes AG, I&S ITS.
More informationDistributed Generation Planning Strategy with Load Models in Radial Distribution System
Iteratoal Joural of Computer ad Electrcal Egeerg, Vol., No. 3, August 29 93-863 strbuted Geerato lag Strategy wth oad odels Radal strbuto System eepedra Sgh, eveder Sgh ad K S Verma Abstract Ths paper
More informationFormulation and Analysis of an Approximate Expression for Voltage Sensitivity in Radial DC Distribution Systems
Eerges 015, 8, 996-9319; do:10.3390/e809996 Artcle OPEN ACCESS eerges ISSN 1996-1073 www.mdp.com/joural/eerges Formulato ad Aalyss of a Approxmate Expresso for Voltage Sestvty Radal DC Dstrbuto Systems
More informationFAULT LOCATION ALGORITHM FOR PRIMARY DISTRIBUTION FEEDERS BASED ON VOLTAGE SAGS
FAULT LOCATION ALGORITHM FOR PRIMARY DITRIBUTION FEEDER BAED ON VOLTAGE AG Rodrgo A. F. Perera, Mlade Kezuovc 2 ad José R.. Matova Uversdade Estadual Paulsta FEI/UNEP Ilha oltera, ão Paulo, Brazl 2 Texas
More informationTrack Tension Optimization for Stair-Climbing of a Wheelchair Robot with Variable Geometry Single Tracked Mechanism
Proceedgs of the 2011 I Iteratoal Coferece o Robotcs ad Bommetcs December 7-11, 2011, Phuket, Thalad Track Teso Optmzato for Star-Clmbg of a heelchar Robot wth Varable Geometry Sgle Tracked Mechasm Suyag
More informationShort Term Load Forecasting using Multiple Linear Regression
Short Term Load Forecastg usg Multple Lear Regresso N. Amral, C.S. Özvere, D Kg Uversty of Abertay Dudee, UK Abstract I ths paper we preset a vestgato for the short term (up 4 hours load forecastg of the
More informationEconomic Load Dispatch Based on a Hybrid Particle Swarm Optimization
Ecoomc Load Dspatch Based o a Hybrd artcle Swarm Optmzato Jog-Bae ar, K-Sog Lee, Joog-R Sh, Gyu-Ha Choe, Kwag Y. Lee Abstract Ths paper presets a ew approach to ecoomc load dspatch (ELD) problems usg a
More informationFairness of High-Speed TCP Protocols with Different Flow Capacities
JOURNAL OF NETWORKS, VOL. 4, NO. 3, MAY 9 63 Faress of Hgh-Speed TP Protocols wth Dfferet Flow apactes Rachd Mbarek, Mohamed Tahar Be Othma*, Salem Nasr *Seor Member, IEEE ollege of omputer, Qassm Uversty,
More informationAn Anycast Routing Algorithm Based on Genetic Algorithm
A Aycast Routg Algorthm Based o Geetc Algorthm CHUN ZHU, MIN JIN Computer Scece ad Iformato Techology College Zhejag Wal Uversty No.8, South Q ahu Road, Ngbo P.R.CHINA http://www.computer.zwu.edu.c Abstract:
More informationBiswarup Das, Dept. of Electrical Engineering, Indian Institute of Technology, Roorkee, India
Detecto ad Type Idetfcato Ucompesated ad Seres Compesated Trasmsso Le Usg Dscrete Wavelet Trasform Bhargav Vyas, Dept. of Electrcal Egeerg, Ida Isttute of Techology, Roorkee, Ida Rudra Prakash Maheshwar,
More informationCS519K: M ULTIMEDIA SYSTEMS STUDENT PROJECTS DATE ANNOUNCED: OCTOBER 25, 2002 DUE DATE:
CS519K: M ULTIMEDIA SYSTEMS STUDENT PROJECTS DATE ANNOUNCED: OCTOBER 25, 2002 DUE DATE: DECEMBER 5, 2002, 11:59PM Basc gropg: Groups of 2 studets each; (or dvdual 1-member groups) There are 6 projects.
More informationAllocating Travel Times Recorded from Sparse GPS Probe Vehicles into Individual Road Segments
Avalable ole at www.scecedrect.com SceceDrect Trasportato Research Proceda 25C (207) 223 2226 www.elsever.com/locate/proceda World Coferece o Trasport Research - WCTR 206 Shagha. 0-5 July 206 Allocatg
More informationInformation Theory and Coding
Iformato heory ad Codg Itroducto What s t all aout? Refereces: C..hao, A Mathematcal heory of Commucato, he Bell ystem echcal Joural, Vol. 7, pp. 379 43, 63 656, July, Octoer, 948. C..hao Commucato the
More information