An optimal boundary fair scheduling

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

Fair value measurement: Is the debate around level II and level III assets and liabilities relevant

Double Degree. A Work Project presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA- School of Business and Economics and a Masters Degree in Business Engineering from Louvain school of Management

Benefits, challenges, and limitations of fair trade as a social justice movement

This thesis answers some important questions about how Fair Trade is experienced and perceived by some Northern sellers, consumers, activists, advocates, practitioners, and an importer. As it relates to sellers, I focus only on small scale independent businesses (i.e. I do not include large corporate businesses in my interview sample). Fair Trade works to establish a dignified livelihood for many producers in the South. Some of the most important actors in the Fair Trade movement are the people who buy, sell, and/or advocate for Fair Trade in the North. Fair Trade is largely a consumer movement which relies on the purchase of Fair Trade products. Without consumers purchasing Fair Trade products, retailers providing the products for sale, and activists raising awareness of Fair Trade, the movement, as it is presently constituted, would be non-existent. This qualitative research is based on 19 in-depth i.nterviews with nine interviewees involved with Fair Trade in Canada. I focus on benefits, challenges, and limitations of Fair Trade in the context of their involvement with it. I describe and analyze how people become involved with Fair Trade, what motivates them to do so, what they hope to achieve, and the benefits of being involved. I also describe and analyze how people understand and deal with any challenges and limitations associated with their involvement with Fair Trade. I also explore whether involvement with Fair Trade influences how people think about other products that they purchase and, if so, in what ways. I focus mainly on the commodity of coffee, but my discussion is not limited to this single commodity. Interviewees' experiences with and participation in Fair Trade vary in terms of their level of involvement and interest in the broader Fair Trade movement (as opposed to just participating in the market component). This research reveals that while Fair Trade is a small movement, sellers, consumers, and activists have had much success in the advancement of Fair Trade. While challenges have not deterred interviewees from continuing to participate in Fair Trade, analysis and explanation of such challenges provides the opportunity for Fair Trade practitioners to develop effective solutions in an effort to meet the needs of various Fair Trade actors.

Liquidity, institutional ownership and regulation fair disclosure

There is a body of academic literature addressing two issues of importance for leveling the playing field for all classes of investors: 1) the impact of institutional investors on liquidity; and 2) the impact of Regulation Fair Disclosure on institutional investors and liquidity. Our study addresses both issues with the purpose of attaining a better understanding and explanation of this relationship. We classify institutional ownership according to Bushee's (1998, 2001) methodology; transient institutions, dedicated institutions and quasi-indexers. Our results indicate that while transient institutions and quasi-indexers have a positive impact on liquidity, dedicated institutional ownership is negatively associated with liquidity. This result is consistent with prior theoretical studies. We also find that the effectiveness ofthe Regulation Fair Disclosure in improving liquidity is limited to firms with higher transient institutional ownership, whereas quasi-indexed institutions have not been significantly affected by the regulations. In fact, the liquidity of firms is lower for firms with higher dedicated institutional holdings, which is evidence of the "chilling effect".

Fair of Nations (1906)

Official program "Fair of Nations" for the benefit of the Niagara Falls General Hospital.

Fair Copyright for Canada: Lessons for Online Social Movements from the First Canadian Facebook Uprising

Despite their growing importance, the political effectiveness of social media remains understudied. Drawing on and updating resource mobilization theory and political process theory, this article considers how social media make “political engagement more probable,” and the determinants of success for online social movements. It does so by examining the mainstreaming of the Canadian “user rights” copyright movement, focusing on the Fair Copyright for Canada Facebook page, created in December 2007. This decentralized, grassroots, social media-focused action – the first successful campaign of its kind in Canada and one of the first in the world – changed the terms of the Canadian copyright debate and legitimized Canadian user rights. As this case demonstrates, social media have changed the type and amount of resources needed to create and sustain social movements, creating openings for new groups and interests. Their success, however, remains dependent on the political context within which they operate.

Fair Production and Allocation of an Excludable Nonrival Good

We study fairness in economies with one private good and one partially excludable nonrival good. A social ordering function determines for each profile of preferences an ordering of all conceivable allocations. We propose the following Free Lunch Aversion condition: if the private good contributions of two agents consuming the same quantity of the nonrival good have opposite signs, reducing that gap improves social welfare. This condition, combined with the more standard requirements of Unanimous Indifference and Responsiveness, delivers a form of welfare egalitarianism in which an agent's welfare at an allocation is measured by the quantity of the nonrival good that, consumed at no cost, would leave her indifferent to the bundle she is assigned.

Fair Allocation of Production Externalities: Recent Results

We survey recent axiomatic results in the theory of cost-sharing. In this litterature, a method computes the individual cost shares assigned to the users of a facility for any profile of demands and any monotonic cost function. We discuss two theories taking radically different views of the asymmetries of the cost function. In the full responsibility theory, each agent is accountable for the part of the costs that can be unambiguously separated and attributed to her own demand. In the partial responsibility theory, the asymmetries of the cost function have no bearing on individual cost shares, only the differences in demand levels matter. We describe several invariance and monotonicity properties that reflect both normative and strategic concerns. We uncover a number of logical trade-offs between our axioms, and derive axiomatic characterizations of a handful of intuitive methods: in the full responsibility approach, the Shapley-Shubik, Aumann-Shapley, and subsidyfree serial methods, and in the partial responsibility approach, the cross-subsidizing serial method and the family of quasi-proportional methods.

El día de San Valentín, o La linda doncella de Perth : Saint Valentine's Day or the fair maid of Perth

UANL

The fair god or, the last of the tzins a tale of the conquest of México

UANL

Paying for Higher Education: Are Top-Up Fees Fair?

This paper considers four institutional models for funding higher education in the light of principles of fairness and meritocracy, with particular reference to the debate in the UK over ‘top-up fees’. It concludes that, under certain plausible but unproven assumptions, the model the UK government has adopted is fairer and more meritocratic than alternatives, including, surprisingly, the Graduate Tax.

Fair Sets of Some Classes of Graphs

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed

Olimpismo y fair play

Las actas incluyen un cuestionario sobre tolerancia y fair play en el deporte de la Fundaci??n Holandesa para el Deporte, la Tolerancia y el Fair Play