Institutions and Mechanisms for Internal Conflict Resolution: Legal and Non-Legal Means in Resolving Dispute and Attaining Justice in Malaysia

Seeking justice is a noble cause and dispensing justice is an obligation that the state must fulfill. Under the doctrine of separation of powers courts exist to protect people and their rights, to guarantee fairness and justice for all. The task to combat injustices, produce a just ordering of society, ensure a fair distribution of material and legal resources, safeguard the rule of law, promote equality, ensure proportionality in punishment, and protect entitlements and legitimate expectations should not be put on the shoulders of judges and courts only. It must be spread out and shared by other institutions and by whatever means availabl

Selective Fair Scheduling over Fading Channels

Imposing fairness in resource allocation incurs a loss of system throughput, known as the Price of Fairness ($PoF$). In wireless scheduling, $PoF$ increases when serving users with very poor channel quality because the scheduler wastes resources trying to be fair. This paper proposes a novel resource allocation framework to rigorously address this issue. We introduce selective fairness: being fair only to selected users, and improving $PoF$ by momentarily blocking the rest. We study the associated admission control problem of finding the user selection that minimizes $PoF$ subject to selective fairness, and show that this combinatorial problem can be solved efficiently if the feasibility set satisfies a condition; in our model it suffices that the wireless channels are stochastically dominated. Exploiting selective fairness, we design a stochastic framework where we minimize $PoF$ subject to an SLA, which ensures that an ergodic subscriber is served frequently enough. In this context, we propose an online policy that combines the drift-plus-penalty technique with Gradient-Based Scheduling experts, and we prove it achieves the optimal $PoF$. Simulations show that our intelligent blocking outperforms by 40$\%$ in throughput previous approaches which satisfy the SLA by blocking low-SNR users

Sum Rate Maximizing Multigroup Multicast Beamforming under Per-antenna Power Constraints

A multi-antenna transmitter that conveys independent sets of common data to distinct groups of users is herein considered, a model known as physical layer multicasting to multiple co-channel groups. In the recently proposed context of per-antenna power constrained multigroup multicasting, the present work focuses on a novel system design that aims at maximizing the total achievable throughput. Towards increasing the system sum rate, the available power resources need to be allocated to well conditioned groups of users. A detailed solution to tackle the elaborate sum rate maximization multigroup multicast problem under per-antenna power constraints is therefore derived. Numerical results are presented to quantify the gains of the proposed algorithm over heuristic solutions. Besides Rayleigh faded channels, the solution is also applied to uniform linear array transmitters operating in the far field, where line-ofsight conditions are realized. In this setting, a sensitivity analysis with respect to the angular separation of co-group users is included. Finally, a simple scenario providing important intuitions for the sum rate maximizing multigroup multicast solutions is elaborated.Comment: Submitted to IEEE GlobeCom 2014, Austin, TX. arXiv admin note: substantial text overlap with arXiv:1406.7699, arXiv:1406.755

Defenses to International Antitrust Suits: An Aggregate Approach

Part I of this Comment will discuss briefly the cases in which the defenses have been asserted. Part I will examine the underlying policies of each defense. In Part II of this Comment each of the defenses will be applied separately to the facts of a recent antitrust case, In re Uranium Antitrust Litigation. Finally, in Part III, the application of the separatist approach to those facts will be critiqued, and an alternative approach to the defenses will be discussed