A Cross Time Slot Partial Interference Alignment Scheme in Two-Cell Relay Heterogeneous Networks

The interference of a two-cell two-hop multi-input–multi-output (MIMO) heterogeneous network where the cell-center user (CCU) coexists with the cell-edge user (CEU) is complex to characterize and costly to suppress. In downlink, the CEU is assumed to be served by a half-duplex relay with amplify-and-forward mode. To suppress the intra-cell and inter-cell interference, a cross time slot partial interference alignment (TPIA) scheme, which aligns the interference terms generated in different sub-time slots to the same subspace, is proposed in this paper. Furthermore, the feasibility condition of antenna configuration is analyzed. Simulation results indicate that the TPIA scheme outperforms other existing conventional techniques in achievable sum degrees of freedom and sum-rate performance.

The Feasibility of Human Rights

To be justifiable, the demands of a conception of human rights and global justice must be such that (a) they focus on the protection of extremely important human interests and (b) their fulfillment is feasible. This chapter provides a discussion of (b), the Feasibility Condition. It presents, first, a general account of the relation between moral desirability, feasibility and obligation within a conception of justice. Next, it provides an analysis of the notion of feasibility. This idea is in fact quite complex, including different types, domains, and degrees. The chapter concludes by identifying several ways in which we can respond to alleged circumstances of infeasibility regarding the fulfillment of basic socioeconomic human rights against severe poverty.

An improved three-step method for solving the interval linear programming problems

Feasibility condition, which ensures that the solution space does not violate any constraints, and optimality condition, which guarantees that all points of the solution space are optimal, are very significant conditions for the solution space of interval linear programming (ILP) problems. Among the existing methods for ILP problems, the best-worst cases (BWC) method and two-step method (TSM) do not ensure feasibility condition, while the modified ILP (MILP), robust TSM (RTSM), improved TSM (ITSM), and three-step method (ThSM) guarantee feasibility condition, whose solution spaces may not be completely optimal. We propose an improved ThSM (IThSM) for ILP problems, which ensures both feasibility and optimality conditions, i.e., we introduce an extra step to optimality.