DESPRE COMPLEMENTAREA METODELOR JEFFERSON, ADAMS, WEBSTER ŞI HUNTINGTON-HILL

Size: px
Start display at page:

Download "DESPRE COMPLEMENTAREA METODELOR JEFFERSON, ADAMS, WEBSTER ŞI HUNTINGTON-HILL"

Transcription

1 DESPRE COMPLEMENTAREA METODELOR JEFFERSON ADAMS WEBSTER ŞI HUNTINGTON-HILL Dr hab prof unv Ion BOLUN ASEM Sunt propuse compementăr de depăşre a stuaţor în care foosrea metodeor Jefferson Adams Webster ş Huntngton-H de uare a deczor coectve mutopţonae prn votare cu reprezentare proporţonaă nu permte obţnerea souţe scontate Cuvnte-chee: uarea de decz metodă votare reprezentare proporţonaă stuaţe compementare 1 Introducere La uarea de decz coectve mutopţonae prn votare cu reprezentare proporţonaă se foosesc or s-au foost asemenea metode (regu votur-decze ) ca: Jefferson [2] propusă în 1792 Webster [1 2] propusă în 1832 Huntngton-H [2] propusă în 1911 şa În aceaş scop în 1822 a fost propusă [2] ş metoda Adams Cee ma cunoscute practc prvnd foosrea sstemeor de votare sunt probab cee ce ţn de scrutnee eectorae De aceea în contnuare aspectee abordate prvnd asemenea ssteme se vor cerceta fără a dmnua dn unversatate prn prsma scrutneor eectorae cu reprezentare proporţonaă de ste de partd (coaţ bocur) Fe: M număru tota de mandate în organu eectv; n număru de partde care au atns sau depăşt pragu eectora; V număru tota de votur exprmate vaab pentru cee n partde; V număru de votur exprmate în favoarea partduu x număru de mandate ce se aocă partduu = 1 n Toate cee patru metode nomnazate ma sus au a bază găsrea unu astfe de dvzor Q * ca suma vaoror rapoarteor V /Q* = 1 n rotunjte până a întreg obţnând şru de vaor x = 1 n să satsfacă egatatea x 1 + x x n = M Deosebrea dntre ee constă doar în modatatea rotunjr până a întreg a acestor rapoarte: prn psă a metoda Jefferson prn adaos a metoda Adams în mod ordnar a metoda Webster ş în baza mede geometrce a metoda Huntngton-H După cum este demonstrat în [3] în unee cazur de exempu a vaor V egae pentru două sau ma mute partde se poate întâmpa ca un asemenea dvzor Q* să nu exste Aceasta însă nu înseamnă că în aşa cazur nu poate f obţnută souţa scontată determnată de vaore respectve ae mărmor x = 1n Doar că în acest scop sunt necesare operăr ABOUT COMPLEMENTATION OF JEFFERSON ADAMS WEBSTER AND HUNTINGTON- HILL METHODS HabDr Professor Ion BOLUN ASEM Compementaton to avod stuatons n whch the use of Jefferson Adams Webster and Huntngton- H methods when takng coectve mut optona decsons by votng wth proportona representaton does not ead to the desred souton are proposed Key words: takng decsons method votng proportona representaton stuaton compementaton 1 Introducton When takng coectve mut optona decsons by votng wth proportona representaton are beng used or were used such methods ( votes-decson rues) as: Jefferson [2] proposed n 1792 Webster [1 2] proposed n 1832 Huntngton-H [2] proposed n 1911 etc Wth the same am n 1822 the Adams method was proposed too [2] The most known practces wth reference to the use of votng systems are probaby the ones reated to eectons Therefore further the addressed aspects referrng the ndces of dsproportonaty w be nvestgated (not harmng the unversaty) through the party-sts (bocks coatons) eectons wth proportona representaton Let: M number of seats n the eectve body; n number of partes that have reached or exceeded the representaton threshod; V tota vad votes cast for the n partes; V tota vad votes cast for party x number of seats to be aocated to party = 1 n A the four nomnated methods are based on the retreve of a such dvsor Q * that the sum of ratos V /Q* = 1n vaues rounded to ntegers obtanng the set of vaues x = 1 n w satsfy the equaty x 1 + x x n = M The dstncton between them conssts n the modaty of roundng to nteger of these ratos ony: down at Jefferson method up at Adams method n the ordnary mode at Webster method and basng on geometry average at Huntngton-H method As shown n [3] n some cases by exampe at vaues of V equa for two or more partes t may happen that such a dvsor Q* does not exst Ths s not to say that n such cases the expected souton determned by the respectve vaues of quanttes x = 1n cannot be obtaned But n ths purpose addtona operatons are needed Two such procedures are proposed n [3] Both of these procedures sha provde frst the nterva [Q* (-) ; 118 Revsta / Journa ECONOMICA nr 3 (85) 2013

2 supmentare Două asemenea procedur sunt propuse în [3] Ambee aceste procedur prevăd determnarea ma întâ a ntervauu [Q* (-) ; Q* (+) ] sufcent de îngust pentru confrmarea faptuu că dvzoru Q* nu exstă Nu este propus însă cum trebue determnat acest nterva În această ucrare se propun compementăr de depăşre a stuaţor pentru care dvzoru Q* nu exstă fără a f necesară determnarea ntervauu [Q* (-) ; Q* (+) ] Fără a perde dn unversatatea rezutateor se va consdera că au oc negatăţe V 1 V 2 V n negatăţ ce pot f obţnute prn renumerotarea partdeor 2 Metoda Jefferson ş compementarea acestea Metoda Jefferson este descrsă a paş Jefferson ar compementarea acestea constă în înocurea pasuu 3-Jefferson cu ce 3 ş de asemenea paş supmentar 4 ş 5 1 Se cacuează [2] dvzoru standard (în unee ucrăr acesta se numeşte cotă-standard) Q = V/M; apo fecăru partd = 1 n se aocă nţa un număr de mandate ega cu partea întregor raportuu V /Q adcă x = a = V /Q 2 Dacă x 1 + x x n = M atunc dstrburea mandateor s-a încheat fnd proporţonaă 3-Jefferson La metoda Jefferson dacă a 1 + a a n M atunc în mod teratv foosnd ma mute încercăr se găseşte un nou dvzor Q * < Q vaoarea împărţr a care a mărm V rotunjtă până a întreg prn psă ş se va consdera număru de mandate de dstrbut partduu ; vaoarea Q * se va aege astfe ca să abă oc egatatea x 1 + x x n = M Dstrburea mandateor s-a încheat (se poate întâmpa ca un asemenea dvzor Q* să nu exste) 3 ΔM := M (x 1 + x x n ) 4 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a creşterea x cu o untate: Q := V /(x + 1) = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 5 Redstrburea mandateor conform no vaor a mărm Q: 51 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM r ş trecere a pasu 4 52 Atfe xk : = x M k Δ Dstrburea mandateor s-a încheat fnd totuş neproporţonaă Expunerea desfăşurată cu argumentarea obţner no vaor a mărm Q a pasu 4 de compementare a metode Jefferson este următoarea Pasu 4 Reducerea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a creşterea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă mcşorarea cu care cea a mărm Q ar conduce a creşterea x cu o untate: Q* (+) ] narrow enough to confrm that the dvsor Q* does not exst It s not proposed however how to determne ths nterva In ths paper compementatons to overcome stuatons when the dvsor Q* Q* does not exst wthout the need to determne the nterva [Q* (-) ; Q* (+) ] are proposed Wthout osng the unversaty of resuts t w be consdered that take pace nequates V 1 V 2 V n - nequates that can be acheved by renumberng the partes 2 Jefferson method and ts compementaton Jefferson method s descrbed n steps Jefferson and ts compementaton conssts of repacng the step 3-Jefferson wth the step 3 and aso the addtona steps 4 and 5 1 Cacuate [2] the standard dvsor (n some papers t s caed standard quota) Q = V/M then to each party = 1 n to aocate ntay a number of seats equa to the nteger part of the rato V /Q e x = a = V /Q 2 If x 1 + x x n = M then the dstrbuton of seats ended ths beng proportona 3-Jefferson At Jefferson method f a 1 + a a n M then teratvey usng severa attempts t fnds a new dvsor Q * < Q the vaue of the dvson to whch of V rounded down to nteger w be consdered the number of seats to be dstrbuted to party ; the vaue of Q * w be chosen so as to have the equaty x 1 + x x n = M The dstrbuton of seats s competed (t may happen that such a dvsor Q * does not exst) 3 ΔM := M (x 1 + x x n ) 4 Determnng the new vaue of Q and the set G of partes canddates for the ncrease of x by one unt: Q := V /(x + 1) = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } where Qk = Q =1 5 Redstrbuton of seats accordng to the new vaue of Q: 51 If r < ΔM then xk : = x r k ΔM := ΔM r and proceed to step 4 52 Otherwse xk : = x M k Δ Dstrbuton of seats ended ths beng however non proportona The detaed exposure wth arguments for obtanng the new vaue of Q n step 4 of compementng the Jefferson method s the foowng Step 4 Decreasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the ncrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the decreasng wth whch of Q woud ead to the ncrease of x wth one unt: Revsta / Journa ECONOMICA nr 3 (85)

3 41 Se determnă δ conform formue 41 Determnng δ accordng to the formua δ := Q V /(x + 1) = 1 n (1) δ := Q V /(x + 1) = 1 n (1) obţnute dn condţa evdentă V /(Q δ ) = x + 1 (2) obtaned from the evdent condton V /(Q δ ) = x + 1 (2) Astfe cea ma mare vaoare a mărm Q < Q care deja conduce a creşterea x cu o untate faţă de Thus the hghest vaue of Q < Q whch aready eads to the ncrease of x by one to the use of Q s foosrea mărm Q este Q = Q δ = V /(x + 1) = 1 n (3) Q = Q δ = V /(x + 1) = 1 n (3) 42 δ := mn{δ 1 δ 2 δ n } to whch 42 δ := mn{δ 1 δ 2 δ n } cărea î corespunde corresponds Q := max{q 1 Q 2 Q n } = V max 1 n x + = 1 (4) Este uşor de observat că regua (4) de determnare a no vaor a mărm Q ş respectv a partduu cărua trebue aocat următoru mandat este smară regu votur-decze a metode d Hondt [1] Astfe metoda Jefferson compementată presupune aocarea nţaă fecăru partd = 1 n a unu număr de mandate ega cu vaoarea raportuu V /Q rotunjtă până a întreg prn psă adcă x = a = V /Q ; apo dacă a 1 + a a n M atunc consecutv pentru unee partde se măreşte x cu o untate în ordnea determnată de regua (4) adcă de fecare dată se măreşte x cu o untate pentru partdu cu cea ma mare vaoare a raportuu V /(x + 1) până va avea oc egatatea x 1 + x x n = M Metoda descrsă concde cu agortmu respectv propus în [4] 3 Metoda Adams ş compementarea acestea Metoda Adams este descrsă a paş Adams ar compementarea acestea constă în înocurea pasuu 3-Adams cu ce 3 ş de asemenea paş supmentar 4 ş 5 1 Se cacuează [2] dvzoru standard Q = V/M; apo fecăru partd = 1 n se aocă nţa un număr de mandate ega cu vaoarea raportuu V /Q rotunjtă până a întreg prn adaos adcă x = g = V /Q 2 Dacă g 1 + g g n = M atunc dstrburea mandateor s-a încheat fnd proporţonaă 3-Adams La metoda Adams dacă g 1 + g g n M atunc în mod teratv foosnd ma mute încercăr se găseşte un nou dvzor Q * > Q vaoarea împărţr a care a mărm V rotunjtă până a întreg prn adaos ş se va consdera număru de mandate de dstrbut partduu ; vaoarea Q * se va aege astfe ca să abă oc egatatea x 1 + x x n = M Dstrburea mandateor s-a încheat (se poate întâmpa ca un asemenea dvzor Q* să nu exste) 3 ΔM := M (x 1 + x x n ); evdent are oc ΔM < 0 4 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a mcşorarea x cu o untate: Q := V / 1) = 1 n ; Q := mn{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 5 Redstrburea mandateor conform no vaor a mărm Q: Q := max{q 1 Q 2 Q n } = V max 1 n x + = 1 (4) It s easy to see that the rue (4) of determnng the new vaue of Q and respectvey of the party to whch to aocate the next seat s smar wth the "vote-decson" rue of the d'hondt method [1] So the compemented Jefferson method nvoves the nta aocaton to each party = 1 n of a number of seats equa to the vaue of rato V /Q rounded down to nteger e x = a = V /Q ; after f a 1 + a a n M then consecutve for some partes x ncreases by one n the order determned by rue (4) e every tme x ncreases by one for the party wth the hghest vaue of rato V /(x + 1) t t w take pace the equaty x 1 + x x n = M The descrbed method concdes wth the agorthm proposed n [4] 3 Adams method and ts compementaton Adams method s descrbed n steps Adams and ts compementaton conssts of repacng the step 3-Adams wth the step 3 and aso the addtona steps 4 and 5 1 Cacuate [2] the standard dvsor Q = V/M; then to each party = 1 n to aocate ntay a number of seats equa to the nteger part of the rato V /Q rounded up to nteger e x = g = V /Q 2 If g 1 + g g n = M then the dstrbuton of seats ended ths beng proportona 3-Adams At Adams method f g 1 + g g n M then teratvey usng severa attempts t fnds a new dvsor Q * > Q the vaue of the dvson to whch of V rounded up to nteger w be consdered the number of seats to be dstrbuted to party ; the vaue of Q * w be chosen so as to have the equaty x 1 + x x n = M The dstrbuton of seats s competed (t may happen that such a dvsor Q * does not exst) 3 ΔM := M (x 1 + x x n ); evdenty t takes pace ΔM < 0 4 Determnng the new vaue of Q and the set G of partes canddates for the decreasng of x by one unt: Q := V / 1) = 1 n ; Q := mn{q 1 Q 2 Q n }; G := {k 1 k 2 k r } where Q = Q =1 k 5 Redstrbuton of seats accordng to the new vaue of Q: 120 Revsta / Journa ECONOMICA nr 3 (85) 2013

4 51 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM + r ş trecere a pasu 4 52 Atfe xk : = x M k Dstrburea mandateor s-a încheat Expunerea desfăşurată cu argumentarea obţner no vaor a mărm Q a pasu 4 de compementare a metode Adams este următoarea Pasu 4 Creşterea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a mcşorarea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă creşterea cu care a mărm Q ar conduce a mcşorarea x cu o untate: 41 Se determnă δ conform formue δ := V /(x 1) Q = 1 n (5) obţnute dn condţa evdentă V /(Q + δ ) = x 1 (6) Astfe cea ma mcă vaoare a mărm Q > Q care deja conduce a mcşorarea x cu o untate faţă de foosrea mărm Q este Q = Q + δ = V /(x 1) = 1 n (7) 42 δ := mn{δ 1 δ 2 δ n } cărea î corespunde Q := mn{q 1 Q 2 Q n } = V mn (8) = 1 n x 1 Astfe metoda Adams compementată presupune aocarea nţaă fecăru partd = 1 n a unu număr de mandate ega cu vaoarea raportuu V /Q rotunjtă până a întreg prn adaos adcă x = g = V /Q ; apo dacă g 1 + g g n M atunc consecutv pentru unee partde se mcşorează x cu o untate în ordnea determnată de regua (8) adcă de fecare dată se mcşorează x cu o untate pentru partdu cu cea ma mcă vaoare a raportuu V /(x 1) până va avea oc egatatea x 1 + x x n = M 4 Metoda Webster ş compementarea acestea Metoda Webster este descrsă a paş Webster ar compementarea acestea constă în înocurea pasuu 3-Webster cu ce 3 ş de asemenea paş supmentar Se cacuează [2] dvzoru standard Q = V/M; apo fecăru partd = 1 n se aocă nţa un număr de mandate ega cu partea întregor raportuu V /Q adcă x = a = V /Q dacă V /Q a < 05 sau cu x = a + 1 dacă V /Q a 05 Astfe x a vaoare egaă cu vaoarea raportuu V /Q rotunjtă până a întreg în mod ordnar 2 Dacă x 1 + x x n = M atunc dstrburea mandateor s-a încheat 3-Webster La metoda Webster dacă x 1 + x x n M atunc în mod teratv foosnd ma mute încercăr se găseşte un nou dvzor Q * astfe ca suma vaoror rapoarteor V /Q* = 1 n rotunjte până a întreg în mod ordnar obţnând un nou şr de vaor x = 1 n să fe 51 If r < ΔM then xk : = x r k ΔM := ΔM + r and proceed to step 4 52 Otherwse xk : = x M k Dstrbuton of seats ended The detaed exposure wth arguments for obtanng the new vaue of Q n step 4 of compementng the Adams method s the foowng Step 4 Increasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the decrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the nreasng wth whch of Q woud ead to the decrease of x wth one unt: 41 Determnng δ accordng to the formua δ := V /(x 1) Q = 1 n (5) obtaned from the evdent condton V /(Q + δ ) = x 1 (6) Thus the hghest vaue of Q > Q whch aready eads to the decrease of x by one to the use of Q s Q = Q + δ = V /(x 1) = 1 n (7) 42 δ := mn{δ 1 δ 2 δ n } to whch corresponds Q := mn{q 1 Q 2 Q n } = V mn (8) = 1 n x 1 Thus the compemented Adams method nvoves the nta aocaton to each party = 1 n of a number of seats equa to the vaue of rato V /Q rounded up to nteger e x = g = V /Q ; after f g 1 + g g n M then consecutve for some partes x decreases by one n the order determned by rue (8) e every tme x decreases by one for the party wth the owest vaue of rato V /(x 1) t t w take pace the equaty x 1 + x x n = M 4 Webster method and ts compementaton Webster method s descrbed n steps Webster and ts compementaton conssts of repacng the step 3-Webster wth the step 3 and aso the addtona steps Cacuate [2] the standard dvsor Q = V/M; then to each party = 1 n to aocate ntay a number of seats equa to the nteger part of rato V /Q e x = a = V /Q f V /Q a < 05 or equa to x = a + 1 f V /Q a 05 Thus x takes a vaue equa to the vaue of rato V /Q rounded to nteger n an ordnary mode 2 If x 1 + x x n = M then the dstrbuton of seats ended 3-Webster At Webster method f x 1 + x x n M then teratvey usng severa attempts t fnds a new such dvsor Q * < Q that the sum of ratos V /Q* = 1n vaues rounded to nteger n an ordnary mode obtanng a new set of vaues x = 1 n be equa wth M e x 1 + x x n = M The dstrbuton Revsta / Journa ECONOMICA nr 3 (85)

5 egaă cu M adcă x 1 + x x n = M Dstrburea mandateor s-a încheat (se poate întâmpa ca un asemenea dvzor Q* să nu exste) 3 ΔM := M (x 1 + x x n ) Dacă ΔM < 0 atunc trecere a pasu 6 4 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a creşterea x cu o untate: Q := 2V /(2x + 1) = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 5 Redstrburea mandateor conform no vaor a mărm Q a ΔM > 0: 51 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM r ş trecere a pasu 4 52 Atfe xk : = x M k Δ Dstrburea mandateor s-a încheat 6 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a mcşorarea x cu o untate: Q := 2V /(2x 1) = 1 n ; Q := mn{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 7 Redstrburea mandateor conform no vaor a mărm Q a ΔM < 0: 71 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM + r ş trecere a pasu 6 72 Atfe xk : = x M k Dstrburea mandateor s-a încheat Expunerea desfăşurată cu argumentarea obţner no vaor a mărm Q a paş 4 ş 6 de compementare a metode Webster este următoarea Pasu 4 Reducerea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a creşterea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă mcşorarea cu care a mărm Q ar conduce a creşterea x cu o untate: 41 Se determnă δ conform formue δ : = Q 2V /(2x + 1) = 1 n (9) obţnute dn condţa evdentă V /(Q δ ) = x + 1/2 (10) Astfe cea ma mare vaoare a mărm Q < Q care deja conduce a creşterea x cu o untate faţă de foosrea mărm Q este Q = Q δ = 2V /(2x + 1) = 1 n (11) 42 δ := mn{δ 1 δ 2 δ n } cărea î corespunde Q := max{q 1 Q 2 Q n } = V 2max (12) = 1n 2x + 1 Dn (12) este uşor de observat că regua de determnare a no vaor a mărm Q ş respectv a partduu cărua trebue aocat următoru mandat este smară regu votur-decze a metode Santeof seats s competed (t may happen that such a dvsor Q * does not exst) 3 ΔM := M (x 1 + x x n ) If ΔM < 0 then proceed to step 6 4 Determnng the new vaue of Q and the set G of partes canddates for the ncrease of x by one unt: Q := 2V /(2x + 1) = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } where Qk = Q =1 5 Redstrbuton of seats accordng to the new vaue of Q at ΔM > 0: 51 If r < ΔM then xk : = x r k ΔM := ΔM r and proceed to step 4 52 Otherwse xk : = x M k Δ Dstrbuton of seats ended 6 Determnng the new vaue of Q and the set G of partes canddates for the decrease of x by one unt: Q := 2V /(2x 1) = 1 n ; Q := mn{q 1 Q 2 Q n }; G := {k 1 k 2 k r } where Qk = Q =1 7 Redstrbuton of seats accordng to the new vaue of Q at ΔM < 0: 71 If r < ΔM then xk : = x r k ΔM := ΔM + r and proceed to step 6 72 Otherwse xk : = x M k Dstrbuton of seats ended The detaed exposure wth arguments for obtanng the new vaue of Q n steps 4 and 6 of compementng the Webster method s the foowng Step 4 Decreasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the ncrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the decreasng wth whch of Q woud ead to the ncrease of x wth one unt: 41 Determnng δ accordng to the formua δ : = Q 2V /(2x + 1) = 1 n (9) obtaned from the evdent condton V /(Q δ ) = x + 1/2 (10) Thus the hghest vaue of Q < Q whch aready eads to the ncrease of x by one to the use of Q s Q = Q δ = 2V /(2x + 1) = 1 n (11) 42 δ := mn{δ 1 δ 2 δ n } to whch corresponds Q := max{q 1 Q 2 Q n } = V 2max (12) = 1n 2x + 1 It s easy to see from (12) that the rue (4) of determnng the new vaue of Q and respectvey of the party to whch to aocate the next seat s smar wth the "vote-decson" rue of the Sante-Laguë 122 Revsta / Journa ECONOMICA nr 3 (85) 2013

6 Laguë [1] Pasu 6 Creşterea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a mcşorarea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă creşterea cu care a mărm Q ar conduce a mcşorarea x cu o untate: 61 Se determnă δ conform formue δ : = 2V /(2x 1) Q = 1 n (13) obţnute dn condţa evdentă V /(Q + δ ) = x 1/2 (14) Astfe cea ma mcă vaoare a mărm Q > Q care deja conduce a mcşorarea x cu o untate faţă de foosrea mărm Q este Q = Q + δ = 2V /(2x 1) = 1 n (15) 62 δ := mn{δ 1 δ 2 δ n } cărea î corespunde Q := mn{q 1 Q 2 Q n } = V 2mn 1 n 2x = 1 (16) Astfe metoda Webster compementată presupune aocarea nţaă fecăru partd = 1 n a unu număr de mandate ega cu vaoarea raportuu V /Q rotunjtă până a întreg în mod ordnar adcă x = a = V /Q dacă V /Q a < 05 sau x = a + 1 dacă V /Q a 05) Apodacă x 1 + x x n M atunc: (a) a x 1 + x x n < M consecutv pentru unee partde se măreşte x cu o untate în ordnea determnată de regua (12) adcă de fecare dată se măreşte x cu o untate pentru partdu cu cea ma mare vaoare a raportuu V /(2x + 1) până va avea oc egatatea x 1 + x x n = M; (b) a x 1 + x x n > M consecutv pentru unee partde se mcşorează x cu o untate în ordnea determnată de regua (16) adcă de fecare dată se mcşorează x cu o untate pentru partdu cu cea ma mcă vaoare a raportuu V /(2x 1) până va avea oc egatatea x 1 + x x n = M 5 Metoda Huntngton-H ş compementarea acestea Metoda Huntngton-H este descrsă a paş Huntngton-H ar compementarea acestea constă în înocurea pasuu 3-Huntngton-H cu ce 3 ş de asemenea paş supmentar Se cacuează [2] dvzoru standard Q = V/M; apo fecăru partd = 1 n se aocă nţa un număr de mandate ega cu partea întregor raportuu V /Q adcă x = a = V /Q dacă V /Q < a ( a sau x = a + 1 dacă V /Q a ( a Astfe x a vaoare egaă cu vaoarea raportuu V /Q rotunjtă până a întreg în baza mede geometrce respectve 2 Dacă x 1 + x x n = M atunc dstrburea mandateor s-a încheat 3-Huntngton-H La metoda Huntngton-H dacă x 1 + x x n M atunc în mod teratv foosnd ma method [1] Step 6 Increasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the decrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the ncreasng wth whch of Q woud ead to the decrease of x wth one unt: 61 Determnng δ accordng to the formua δ : = 2V /(2x 1) Q = 1 n (13) obtaned from the evdent condton V /(Q + δ ) = x 1/2 (14) Thus the owest vaue of Q > Q whch aready eads to the decrease of x by one to the use of Q s Q = Q + δ = 2V /(2x 1) = 1 n (15) 62 δ := mn{δ 1 δ 2 δ n } to whch corresponds Q := mn{q 1 Q 2 Q n } = V 2mn 1 n 2x = 1 (16) Thus the compemented Webster method nvoves the nta aocaton to each party = 1 n of a number of seats equa to the vaue of rato V /Q rounded to nteger n an ordnary mode e x = a = V /Q f V /Q a < 05 or x = a + 1 f V /Q a 05) After f x 1 + x x n M then: (a) at x 1 + x x n < M consecutve for some partes x ncreases by one n the order determned by rue (12) e every tme x ncreases by one for the party wth the hghest vaue of rato V /(2x + 1) t t w take pace the equaty x 1 + x x n = M; (b) at x 1 + x x n > M consecutve for some partes x decreases by one n the order determned by the rue (16) e every tme x decreases by one for the party wth the owest vaue of rato V /(2x 1) t t w take pace the equaty x 1 + x x n = M 5 Huntngton-H method and ts compementaton Huntngton-H method s descrbed n steps Huntngton-H and ts compementaton conssts of repacng the step 3-Huntngton-H wth the step 3 and aso the addtona steps Cacuate [2] the standard dvsor Q = V/M; then to each party = 1 n to aocate ntay a number of seats equa to the nteger part of rato V /Q e x = a = V /Q f V /Q < a ( a + 1) or x = a + 1 f V /Q a ( a + 1) Thus x takes a vaue equa to the vaue of rato V /Q rounded to nteger n base of the respectve geometrc mean 2 If x 1 + x x n = M then the dstrbuton of seats ended 3-Huntngton-H At Huntngton-H method f x 1 + x x n M then teratvey usng severa attempts t fnds a new such dvsor Q * that the sum of Revsta / Journa ECONOMICA nr 3 (85)

7 mute încercăr se găseşte un nou dvzor Q * astfe ca suma vaoror rapoarteor V /Q* = 1 n rotunjte până a întreg în baza mede geometrce respectve obţnând un nou şr de vaor x = 1 n să fe egaă cu M adcă x 1 + x x n = M Dstrburea mandateor s-a încheat (se poate întâmpa ca un asemenea dvzor Q* să nu exste) 3 ΔM := M (x 1 + x x n ) Dacă ΔM < 0 atunc trecere a pasu 6 4 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a creşterea x cu o untate: Q := V / x = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 5 Redstrburea mandateor conform no vaor a mărm Q a ΔM > 0: 51 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM r ş trecere a pasu 4 52 Atfe xk : = x M k Δ Dstrburea mandateor s-a încheat 6 Determnarea no vaor a mărm Q ş a muţm G de partde pretendente a mcşorarea x cu o untate: Q := V / x = 1 n ; Q := mn{q 1 Q 2 Q n }; G := {k 1 k 2 k r } unde Qk = Q =1 7 Redstrburea mandateor conform no vaor a mărm Q a ΔM < 0: 71 Dacă r < ΔM atunc xk : = x r k ΔM := ΔM + r ş trecere a pasu 6 72 Atfe xk : = x M k Dstrburea mandateor s-a încheat Expunerea desfăşurată cu argumentarea obţner no vaor a mărm Q a paş 4 ş 6 de compementare a metode Huntngton-H este următoarea Pasu 4 Reducerea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a creşterea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă mcşorarea cu care a mărm Q ar conduce a creşterea x cu o untate: 41 Se determnă δ conform formue δ := Q V / x = 1 n (17) obţnute dn condţa evdentă V /(Q δ ) = x (18) Astfe cea ma mare vaoare a mărm Q < Q care deja conduce a creşterea x cu o untate faţă de foosrea mărm Q este Q = Q δ = V / x = 1 n (19) 42 δ := mn{δ 1 δ 2 δ n } cărea î corespunde ratos V /Q* = 1 n vaues rounded to nteger n base of the respectve geometrc mean obtanng a new set of vaues x = 1 n be equa wth M e x 1 + x x n = M The dstrbuton of seats s competed (t may happen that such a dvsor Q * does not exst) 3 ΔM := M (x 1 + x x n ) If ΔM < 0 then proceed to step 6 4 Determnng the new vaue of Q and the set G of partes canddates for the ncrease of x by one unt: Q := V / x = 1 n ; Q := max{q 1 Q 2 Q n }; G := {k 1 k 2 k r } where Qk = Q =1 5 Redstrbuton of seats accordng to the new vaue of Q at ΔM > 0: 51 If r < ΔM then xk : = x r k ΔM := ΔM r and proceed to step 4 52 Otherwse x : = x + 1 = 1 ΔM k Dstrbuton of seats ended 6 Determnng the new vaue of Q and the set G of partes canddates for the decrease of x by one unt: Q := V / x ( = 1 n ; Q := mn{q 1 Q 2 x Q n }; G := {k 1 k 2 k r } where Qk = Q =1 7 Redstrbuton of seats accordng to the new vaue of Q at ΔM < 0: 71 If r < ΔM then xk : = x r k ΔM := ΔM + r and proceed to step 6 72 Otherwse xk : = x M k Dstrbuton of seats ended The detaed exposure wth arguments for obtanng the new vaue of Q n steps 4 and 6 of compementng the Huntngton-H method s the foowng Step 4 Decreasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the ncrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the decreasng wth whch of Q woud ead to the ncrease of x wth one unt: 41 Determnng δ accordng to the formua δ := Q V / x = 1 n (17) obtaned from the evdent condton V /(Q δ ) = x + 1) (18) Thus the hghest vaue of Q < Q whch aready eads to the ncrease of x by one to the use of Q s Q = Q δ = V / x = 1 n (19) 42 δ := mn{δ 1 δ 2 δ n } to whch corresponds Q := max{q 1 Q 2 Q n } = V max (20) = 1 n x ( + 1 ) x k 124 Revsta / Journa ECONOMICA nr 3 (85) 2013

8 Q := max{q 1 Q 2 Q n } = V max (20) = 1 n x ( + 1 ) x Pasu 6 Creşterea mărm Q cu cea ma mcă vaoare δ = δ j = mn{δ 1 δ 2 δ n } care deja conduce a mcşorarea x cu o untate pentru un sngur partd ce j sau pentru câteva partde cu vaor ae δ egae cu δ j Ac δ este vaoarea mnmă creşterea cu care a mărm Q ar conduce a mcşorarea x cu o untate: 61 Se determnă δ conform formue δ :=V / x Q = 1 n (21) obţnute dn condţa evdentă V /(Q + δ ) = x (22) Astfe cea ma mcă vaoare a mărm Q > Q care deja conduce a mcşorarea x cu o untate faţă de foosrea mărm Q este Q = Q + δ = V / x = 1 n (23) 62 δ := mn{δ 1 δ 2 δ n } cărea î corespunde Q := mn{q 1 Q 2 Q n } = V mn (24) = 1 n x ( 1 ) x Astfe metoda Huntngton-H compementată presupune aocarea nţaă fecăru partd = 1 n a unu număr de mandate ega cu vaoarea raportuu V /Q rotunjtă până a întreg în baza mede geometrce respectve adcă x = a = V /Q dacă V /Q < a sau x = a + 1 dacă V /Q ( a a ( a ; apo dacă x 1 + x x n M atunc: (a) a x 1 + x x n < M consecutv pentru unee partde se măreşte x cu o untate în ordnea determnată de regua (20) adcă de fecare dată se măreşte x cu o untate pentru partdu cu cea ma mare vaoare a raportuu V / x până va avea oc egatatea x 1 + x x n = M; (b) a x 1 + x x n > M consecutv pentru unee partde se mcşorează x cu o untate în ordnea determnată de regua (24) adcă de fecare dată se mcşorează x cu o untate pentru partdu cu cea ma mcă vaoare a raportuu V / x până va avea oc egatatea x 1 + x x n = M 6 Concuz Pentru fecare dn metodee Jefferson Adams Webster ş Huntngton-H de uare a deczor coectve mutopţonae prn votare cu reprezentare proporţonaă sunt propuse compementăr de depăşre a stuaţor în care foosrea metodeor nomnazate nu permte obţnerea souţe scontate dn cauza că nu exstă nc un dvzor Q* respectv Compementăre ncud acţun de modfcare consecutvă a vaor dvzoruu Q ş a muţm G de partde pretendente a modfcarea (mărrea sau mcşorarea în funcţe de stuaţe) treptată a număruu de mandate a cărora cu o untate până a Step 6 Increasng the sze of Q wth the owest vaue δ = δ j = mn{δ 1 δ 2 δ n } whch aready eads to the decrease of x by one for a snge party the j one or for severa partes wth vaues of δ equa to δ j Here δ s the mnmum vaue the ncreasng wth whch of Q woud ead to the decrease of x wth one unt 61 Determnng δ accordng to the formua δ :=V / x Q = 1 n (21) obtaned from the evdent condton V /(Q + δ ) = x (22) Thus the owest vaue of Q > Q whch aready eads to the decreasng of x by one to the use of Q s Q = Q + δ = V / x = 1 n (23) 62 δ := mn{δ 1 δ 2 δ n } to whch corresponds Q := mn{q 1 Q 2 Q n } = V mn (24) = 1 n x ( 1 ) x So the compemented Huntngton-H method nvoves the nta aocaton to each party = 1n of a number of seats equa to the vaue of rato V /Q rounded to nteger n base of the respectve geometrc mean e x = a = V /Q f V /Q < a ( + 1) or x = a + 1 f V /Q a a ( a + 1) After f x 1 + x x n M then: (a) at x 1 + x x n < M consecutve for some partes x ncreases by one n the order determned by the rue (20) e every tme x ncreases by one for the party wth the hghest vaue of rato V / x ( t t w take pace the equaty x 1 x + x x n = M; (b) at x 1 + x x n > M consecutve for some partes x decreases by one n the order determned by the rue (24) e every tme x decreases by one for the party wth the owest vaue of rato V / x t t w take pace the equaty x 1 + x x n = M; 6 Concusons For each of the Jefferson Adams Webster and Huntngton-H methods of mutoptona coectve decson-makng by votng wth proportona representaton are proposed compementary actons to overcome stuatons n whch the use of mentoned methods can not gve the desred souton because the respectve dvsor Q* does not exst Compementaton ncudes actons of consecutve modfcaton of the dvsor Q vaue and of the set G of partes canddates for the graduay change (ncrease or decrease dependng on the stuaton) by one unt of the number of seats t the satsfyng of the condton of equaty Revsta / Journa ECONOMICA nr 3 (85)

9 satsfacerea condţe de egatate a număruu sumar x 1 + x x n de mandate aocate ceor n partde cu număru M de mandate dsponbe between the summary number of seats x 1 + x x n aocated to the n partes and the number M of avaabe seats Refernţe bbografce / Bbographc references: 1 GALLAGHER M Proportonaty Dsproportonaty and Eectora Systems In: Eectora Studes (1991) 10:1 pp TANNENBAUM P Excursons n Modern Mathematcs Seventh Edton Pearson p 3 BOLUN I Despre echvaenţa metodeor Jefferson ş dhondt ş respectv a ceor Webster ş Sante- Laguë În: Compettvtatea ş novarea în economa cunoaşter confer şt ntern sept 2012 Vo II Chşnău: Edtura ASEM 2012 p BOLUN I Mnmzaton of dsproportonaty n PR votng systems In: Internatona Workshop on Integent Informaton Systems: Proceedngs IIS sept 2011 Chşnău: Inst of Mathematcs and Computer Scence 2011 p Revsta / Journa ECONOMICA nr 3 (85) 2013

A finite difference method for heat equation in the unbounded domain

A finite difference method for heat equation in the unbounded domain Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy

More information

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He

More information

L-Edge Chromatic Number Of A Graph

L-Edge Chromatic Number Of A Graph IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma

More information

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows: APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

MAKING A DECISION WHEN DEALING WITH UNCERTAIN CONDITIONS

MAKING A DECISION WHEN DEALING WITH UNCERTAIN CONDITIONS Luca Căbulea, Mhaela Aldea-Makng a decson when dealng wth uncertan condtons MAKING A DECISION WHEN DEALING WITH UNCERTAIN CONDITIONS. Introducton by Luca Cabulea and Mhaela Aldea The decson theory offers

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

Sampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING

Sampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING Samplng heory MODULE VII LECURE - 3 VARYIG PROBABILIY SAMPLIG DR. SHALABH DEPARME OF MAHEMAICS AD SAISICS IDIA ISIUE OF ECHOLOGY KAPUR he smple random samplng scheme provdes a random sample where every

More information

n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem

n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem n-step cyce nequates: facets for contnuous n-mxng set and strong cuts for mut-modue capactated ot-szng probem Mansh Bansa and Kavash Kanfar Department of Industra and Systems Engneerng, Texas A&M Unversty,

More information

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA RESEARCH ARTICLE MOELING FIXE OS BETTING FOR FUTURE EVENT PREICTION Weyun Chen eartment of Educatona Informaton Technoogy, Facuty of Educaton, East Chna Norma Unversty, Shangha, CHINA {weyun.chen@qq.com}

More information

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem V. DEMENKO MECHANICS OF MATERIALS 05 LECTURE Mohr s Method for Cacuaton of Genera Dspacements The Recproca Theorem The recproca theorem s one of the genera theorems of strength of materas. It foows drect

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Cyclic Codes BCH Codes

Cyclic Codes BCH Codes Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

7 ECUAŢII ALGEBRICE ŞI TRANSCENDENTE

7 ECUAŢII ALGEBRICE ŞI TRANSCENDENTE 7 ECUAŢII ALGEBRICE ŞI TRANSCENDENTE 7 Separarea rădăcnlor Ecuaţe algebrcă dacă ( este polnom Ecuaţa transcendentă în caz contrar ( = Rădăcnă apromatvă valoare ξ apropată de valoarea eactă ξ Denţ neechvalente:

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

On the Power Function of the Likelihood Ratio Test for MANOVA

On the Power Function of the Likelihood Ratio Test for MANOVA Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

HMMT February 2016 February 20, 2016

HMMT February 2016 February 20, 2016 HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,

More information

On quasiperfect numbers

On quasiperfect numbers Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng

More information

Image Classification Using EM And JE algorithms

Image Classification Using EM And JE algorithms Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

ON THE QUATERNARY QUADRATIC DIOPHANTINE EQUATIONS (II) NICOLAE BRATU 1 ADINA CRETAN 2

ON THE QUATERNARY QUADRATIC DIOPHANTINE EQUATIONS (II) NICOLAE BRATU 1 ADINA CRETAN 2 ON THE QUATERNARY QUADRATIC DIOPHANTINE EQUATIONS (II) NICOLAE BRATU 1 ADINA CRETAN ABSTRACT This paper has been updated and completed thanks to suggestions and critics coming from Dr. Mike Hirschhorn,

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Chapter 6. Rotations and Tensors

Chapter 6. Rotations and Tensors Vector Spaces n Physcs 8/6/5 Chapter 6. Rotatons and ensors here s a speca knd of near transformaton whch s used to transforms coordnates from one set of axes to another set of axes (wth the same orgn).

More information

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO

More information

Turbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH

Turbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant

More information

Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix

Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix 6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Assignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.

Assignment 5. Simulation for Logistics. Monti, N.E. Yunita, T. Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Answers Problem Set 2 Chem 314A Williamsen Spring 2000

Answers Problem Set 2 Chem 314A Williamsen Spring 2000 Answers Problem Set Chem 314A Wllamsen Sprng 000 1) Gve me the followng crtcal values from the statstcal tables. a) z-statstc,-sded test, 99.7% confdence lmt ±3 b) t-statstc (Case I), 1-sded test, 95%

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic

A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic parametrc Lnear Programmng Mode Descrbng Bandwdth Sharng Poces for BR Traffc I. Moschoos, M. Logothets and G. Kokknaks Wre ommuncatons Laboratory, Dept. of Eectrca & omputer Engneerng, Unversty of Patras,

More information

COXREG. Estimation (1)

COXREG. Estimation (1) COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards

More information

Experiment 1 Mass, volume and density

Experiment 1 Mass, volume and density Experment 1 Mass, volume and densty Purpose 1. Famlarze wth basc measurement tools such as verner calper, mcrometer, and laboratory balance. 2. Learn how to use the concepts of sgnfcant fgures, expermental

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

Neural network-based athletics performance prediction optimization model applied research

Neural network-based athletics performance prediction optimization model applied research Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students.

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students. Exampe: Suppose we want to bud a cassfer that recognzes WebPages of graduate students. How can we fnd tranng data? We can browse the web and coect a sampe of WebPages of graduate students of varous unverstes.

More information

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2]. Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland

More information

Quantitative Evaluation Method of Each Generation Margin for Power System Planning

Quantitative Evaluation Method of Each Generation Margin for Power System Planning 1 Quanttatve Evauaton Method of Each Generaton Margn for Poer System Pannng SU Su Department of Eectrca Engneerng, Tohoku Unversty, Japan moden25@ececetohokuacjp Abstract Increasng effcency of poer pants

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Journal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.

Journal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co. Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by

More information

arxiv:hep-th/ v3 31 May 2008

arxiv:hep-th/ v3 31 May 2008 RFSC 04-01 Revsed arxv:hep-th/040105v3 31 May 008 A PROOF OF THE ODD PERFECT NUMBER CONJECTURE Smon Davs Abstract. It s suffcent to prove that there s an excess of prme factors n the product of repunts

More information

Optimization of JK Flip Flop Layout with Minimal Average Power of Consumption based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA

Optimization of JK Flip Flop Layout with Minimal Average Power of Consumption based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA Journa of mathematcs and computer Scence 4 (05) - 5 Optmzaton of JK Fp Fop Layout wth Mnma Average Power of Consumpton based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA Farshd Kevanan *,, A Yekta *,, Nasser

More information

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

Suggested solutions for the exam in SF2863 Systems Engineering. June 12,

Suggested solutions for the exam in SF2863 Systems Engineering. June 12, Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled

More information

find (x): given element x, return the canonical element of the set containing x;

find (x): given element x, return the canonical element of the set containing x; COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:

More information

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle Lower bounds for the Crossng Number of the Cartesan Product of a Vertex-transtve Graph wth a Cyce Junho Won MIT-PRIMES December 4, 013 Abstract. The mnmum number of crossngs for a drawngs of a gven graph

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Interference Agnment and Degrees of Freedom Regon of Ceuar Sgma Channe Huaru Yn 1 Le Ke 2 Zhengdao Wang 2 1 WINLAB Dept of EEIS Unv. of Sc.

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Exercises of Chapter 2

Exercises of Chapter 2 Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Complex Numbers Alpha, Round 1 Test #123

Complex Numbers Alpha, Round 1 Test #123 Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test

More information

On the size of quotient of two subsets of positive integers.

On the size of quotient of two subsets of positive integers. arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,

More information

Voting Games with Positive Weights and. Dummy Players: Facts and Theory

Voting Games with Positive Weights and. Dummy Players: Facts and Theory Appled Mathematcal Scences, Vol 10, 2016, no 53, 2637-2646 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/ams201667209 Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

G : Statistical Mechanics

G : Statistical Mechanics G25.2651: Statstca Mechancs Notes for Lecture 11 I. PRINCIPLES OF QUANTUM STATISTICAL MECHANICS The probem of quantum statstca mechancs s the quantum mechanca treatment of an N-partce system. Suppose the

More information

Achieving Optimal Throughput Utility and Low Delay with CSMA-like Algorithms: A Virtual Multi-Channel Approach

Achieving Optimal Throughput Utility and Low Delay with CSMA-like Algorithms: A Virtual Multi-Channel Approach Achevng Optma Throughput Utty and Low Deay wth SMA-ke Agorthms: A Vrtua Mut-hanne Approach Po-Ka Huang, Student Member, IEEE, and Xaojun Ln, Senor Member, IEEE Abstract SMA agorthms have recenty receved

More information

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

Decision-making and rationality

Decision-making and rationality Reslence Informatcs for Innovaton Classcal Decson Theory RRC/TMI Kazuo URUTA Decson-makng and ratonalty What s decson-makng? Methodology for makng a choce The qualty of decson-makng determnes success or

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

SPATIAL KINEMATICS OF GEARS IN ABSOLUTE COORDINATES

SPATIAL KINEMATICS OF GEARS IN ABSOLUTE COORDINATES SATIAL KINEMATICS OF GEARS IN ABSOLUTE COORDINATES Dmtry Vasenko and Roand Kasper Insttute of Mobe Systems (IMS) Otto-von-Guercke-Unversty Magdeburg D-39016, Magdeburg, Germany E-ma: Dmtr.Vasenko@ovgu.de

More information

Associative Memories

Associative Memories Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete

More information

Boostrapaggregating (Bagging)

Boostrapaggregating (Bagging) Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

k p theory for bulk semiconductors

k p theory for bulk semiconductors p theory for bu seconductors The attce perodc ndependent partce wave equaton s gven by p + V r + V p + δ H rψ ( r ) = εψ ( r ) (A) 4c In Eq. (A) V ( r ) s the effectve attce perodc potenta caused by the

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department

More information

PHY688, Statistical Mechanics

PHY688, Statistical Mechanics Department of Physcs & Astronomy 449 ESS Bldg. Stony Brook Unversty January 31, 2017 Nuclear Astrophyscs James.Lattmer@Stonybrook.edu Thermodynamcs Internal Energy Densty and Frst Law: ε = E V = Ts P +

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Inthem-machine flow shop problem, a set of jobs, each

Inthem-machine flow shop problem, a set of jobs, each THE ASYMPTOTIC OPTIMALITY OF THE SPT RULE FOR THE FLOW SHOP MEAN COMPLETION TIME PROBLEM PHILIP KAMINSKY Industra Engneerng and Operatons Research, Unversty of Caforna, Bereey, Caforna 9470, amnsy@eor.bereey.edu

More information

LNG CARGO TRANSFER CALCULATION METHODS AND ROUNDING-OFFS

LNG CARGO TRANSFER CALCULATION METHODS AND ROUNDING-OFFS CARGO TRANSFER CALCULATION METHODS AND ROUNDING-OFFS CONTENTS 1. Method for determnng transferred energy durng cargo transfer. Calculatng the transferred energy.1 Calculatng the gross transferred energy.1.1

More information