In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

We describe an algorithm to approximate the minimizer of an elliptic functional in the form ∫ Ω j(x, u,∇u) on the setC of convex functions u in an appropriate functional spaceX . Such problems arise for instance in mathematical economics [4]. A special case gives the convex envelope u∗∗ 0 of a given function u0. Let (Tn) be any quasiuniform sequence of meshes whose diameter goes to zero, and In...

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...

This paper concerns two-hop communication over relay-assisted Block fading channel. It is assumed there is not a direct link between the transmitter and the affiliated destination and the communication occurs in two hops through the use of a relay, where the amplify and forward (AF) strategy is employed at this node. In this case, in a Rayleigh block fading channel, the optimal weight function ...

In Korean and Japanese some sentences are to be found which contain more than one nominative-NP. Such constructions are called ‘multiple-subject constructions’ or ‘double-subject constructions’. They do not only raise a question about their syntactic and semantic nature but also cause such problems as structural changes in MT. They must be considered in designing an MT-System between two typolo...

We present algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subject to geometric constraints, such as those derived from two-dimensional NMR experiments. Other applications include searching out the full range of conformations available to a molecule such as cyclic configurations....

In this work we present the first practical ( 1 e − ǫ ) -approximation algorithm to maximise a general non-negative submodular function subject to a matroid constraint. Our algorithm is based on combining the decreasing-threshold procedure of Badanidiyuru and Vondrak (SODA 2014) with a smoother version of the measured continuous greedy algorithm of Feldman et al. (FOCS 2011). This enables us to...