### Table A.3.1. Countries with Gender Quotas or Reservations Country Policy Argentina 30% of candidates Armenia 5% of party lists for PR elections Belgium 1/3 of candidates Bolivia 35% of candidates for Chamber; 30% for Senate Bosnia and Herzegovina 1/3 of candidates Brazil 30% of candidates China around 30% seats reserved?

2005

### Table 4 Exogenously imposed tariff-rate quota

"... In PAGE 7: ...vi TABLES Table 1 12 Beef, veal, pork, lamb, mutton, and poultry meat: Apparent consumption, by years, 1993-98 Table 2 16 Payments under the Wool Act Table 3 83 Exogenous policy changes under the hypothetical re-enactment of the Wool Act Table4 86 Exogenously imposed tariff-rate quota Table 5 86 Lamb meat imports under different tariffs Table 6 88 Equilibrium quantities and prices under different scenarios ... ..."

### Table 2: Comparing CMP Cache Partitioning Policies

"... In PAGE 3: ... This mechanism can be implemented with a modified cache replacement policy to ensure that the number of blocks used by a thread at a cache set level does not exceed its way quota. Cache partitioning proposals differ mainly in their optimization goals and partitioning policies, which are compared in Table2 . To avoid exhaustive search, cache partitioning algorithms use heuris- tics to prioritize capacity allocation according to the miss rate and speedup characteristics of co-scheduled threads.... ..."

### Table 3 Policy Instrument Levels Induced by an Optimal Policy when Not Only Bread Grains Farmers Welfare Matters - Perfect Competition

"... In PAGE 10: ... In order to redistribute efficiently welfare to farmers as well as upstream and downstream industries government would use a higher floor price for a specific quota and a lower floor price for quantities which exceed the quota. Compared to the actually observed policy the higher floor price P QD would be 9% lower (2%), the reduced floor price P E would be 3% (6%) lower and Q Q would be 33% higher (18% lower) in the case of perfect (i m - perfect) competition ( Table3 and Table 4). The co -responsibility levy is not used.... ..."

### Table 4 Policy Instrument Levels Induced by an Optimal Policy when Not Only Bread Grains Farmers Welfare Matters - Imperfect Competition

"... In PAGE 10: ... In order to redistribute efficiently welfare to farmers as well as upstream and downstream industries government would use a higher floor price for a specific quota and a lower floor price for quantities which exceed the quota. Compared to the actually observed policy the higher floor price P QD would be 9% lower (2%), the reduced floor price P E would be 3% (6%) lower and Q Q would be 33% higher (18% lower) in the case of perfect (i m - perfect) competition (Table 3 and Table4 ). The co -responsibility levy is not used.... ..."

### Table 16: Change tasks associated with the quota aspect.

2003

"... In PAGE 8: ...able 15: Summary change tasks and impact on the prefetching aspect....................................... 75 Table16 : Change tasks associated with the quota aspect.... In PAGE 86: ....2.3.1 Quota Change Task Summary Table16 summarizes quota change task activity. The three change tasks associated with quota cover a range where one involves a new function in the IC where the quota aspect would already apply (QUO_CT3), one involves changes to both IC and A (QUO_CT1), and one arguably would not have happened in the aspect-oriented implementation (not shown, QUO_CT2).... ..."

Cited by 2

### Table 1: Characteristic Function and Quota Solutions by Game

2004

"... In PAGE 2: ... The quota solution is a solution concept for character- istic function form games, just as the Nash equilibrium is one for normal form games. Table1 shows the quota values for players A, B, and C in all 5 games. Kahan and Rapoport (1974) consider for each player the mean reward as a member of the winning coalition (MRAC).... ..."

Cited by 1

### Table 1: Axioms of BPA ; quot;(A)

1995

"... In PAGE 3: ... The process x y starts executing process x, and upon termination thereof starts the execution of process y. These operators are axiomatized by the axioms from Table1 . In these axioms the variables x, y and z denote arbitrary processes.... In PAGE 6: ...heorem 2.2.4 (Elimination) The process algebra IWD quot;(A; EID; E) has the elimination prop- erty for the process algebra BPA ; quot;(A). Proof The term rewrite system associated with the axioms A3-A7 from Table1 and the axioms from Tables 3 and 4 and the additional rewriting rules from Table 6 is strongly normalizing. This can be proven with the method of the lexicographical path ordering [KL80, Klo92].... In PAGE 10: ... The deduction rules of the term deduction system T(IWE quot;(A; EID; E)) are given by the deduction rules of T(IW quot;(A; EID; E)) and the deduction rules from Table 10. x # hx; Ei # x a ! x0 hx; Ei a ! hx0; E [ E(x)i x y # hx; Ei hy; Fi # x y a ! z hx; Ei hy; Fi a ! hz; E [ F [ E(x) [ E(y)i hx; Ei #; hy; Fi # hx; Ei kiw hy; Fi # x k(E[E(x))\(F[E(y)) iw y a ! z hx; Ei kiw hy; Fi a ! hz; E [ F [ E(x) [ E(y)i Table1 0: Structured Operational Semantics of labelled processes De nition 2.3.... In PAGE 16: ...= quot; f ( ) = f (c(p; q; m)) = c(f (p); f (q); m) f (a x) = f (a) f (x) f (x + y) = f (x) + f (y) Table1 1: Entity Renaming function on processes In Table 12 the entity renaming operator on processes is extended to labelled processes. Note that also the entity component of a labelled process is renamed with respect to the mapping f.... In PAGE 16: ... Note that also the entity component of a labelled process is renamed with respect to the mapping f. f (hx; Ei) = h f (x); ff (e) j e 2 Egi Table1 2: Entity Renaming function on labelled processes In order to remove all internal actions on entities we are not interested in, we substitute the empty process quot; for them. The entities for which we remove the internal actions are given by rng(f).... In PAGE 16: ... This operator is taken from [Vra91]. quot;I( quot;) = quot; quot;I( ) = quot;I(a x) = quot;I(x) if a 2 I quot;I(a x) = a quot;I(x) if a 62 I quot;I(x + y) = quot;I(x) + quot;I(y) Table1 3: Renaming atomic actions into quot; In Table 14 the operator for removing internal communications is extended to labelled pro- cesses. By renaming actions into quot; it can be the case that entity information is removed completely from the process expression.... In PAGE 17: ...= h quot;I(x); E [ E(x)i Table1 4: Removing internal communications from labelled processes x vf y i quot;Int(rng(f))(y) = quot;Int(rng(f))( f (x)) Table 15: f-Re nement A and the right-hand side Interworking B. Semantically these Interworkings are represented by A =hc(p1; p2; m3) iwc(p2; q1; m1) iwc(q1; q2; m4) iwc(q2; q1; m5) iwc(q1; p2; m2) iwc(p2; p1; m6); ?i B =hc(p; q; m1) iwc(q; p; m2); ?i Elimination of the iw yields the following equations A =hc(p1; p2; m3) c(p2; q1; m1) c(q1; q2; m4) c(q2; q1; m5) c(q1; p2; m2) c(p2; p1; m6); fp1;p2; q1; q2gi B =hc(p; q; m1) c(q; p; m2); fp; qgi The re nement mapping f is given by f(p1) = f(p2) = p and f(q1) = f(q2) = q.... In PAGE 17: ...= h quot;I(x); E [ E(x)i Table 14: Removing internal communications from labelled processes x vf y i quot;Int(rng(f))(y) = quot;Int(rng(f))( f (x)) Table1 5: f-Re nement A and the right-hand side Interworking B. Semantically these Interworkings are represented by A =hc(p1; p2; m3) iwc(p2; q1; m1) iwc(q1; q2; m4) iwc(q2; q1; m5) iwc(q1; p2; m2) iwc(p2; p1; m6); ?i B =hc(p; q; m1) iwc(q; p; m2); ?i Elimination of the iw yields the following equations A =hc(p1; p2; m3) c(p2; q1; m1) c(q1; q2; m4) c(q2; q1; m5) c(q1; p2; m2) c(p2; p1; m6); fp1;p2; q1; q2gi B =hc(p; q; m1) c(q; p; m2); fp; qgi The re nement mapping f is given by f(p1) = f(p2) = p and f(q1) = f(q2) = q.... In PAGE 17: ...ake the mapping f with empty domain. Then x is an f-re nement of x. Proposition 4.3 (Transitivity) For all closed labelled processes x, y, and z we have x v y and y v z implies x v z x v y i 9f:EID!EID x vf y Table1 6: Entity re nement... ..."

Cited by 1