• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.801-811
• /
• 1996

Let $Z^d$ denote the set of all d-tuples of integers$(d \geq 1, a positive integer)$. The points in $Z^d$ will be denoted by $\underline{m},\underline{n}$, etc., or sometime, when necessary, more explicitly by $(m_1, m_2, \cdots, m_d)$, $(n_1, n_2, \cdots, n_d)$ etc. $Z^d$ is partially ordered by stipulating $\underline{m} \underline{<}\underline{n} iff m_i \leq n_i$ for each i, $1 \leq i \leq d$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.571-574
• /
• 2005

This paper gives some sufficient conditions for a given polyhedral set which is represented as a set of linear inequalities to be positive D-invariant for uncertain linear discrete-time systems in the case such that the systems matrices depend linearly on uncertain parameters whose ranges are given intervals. Further, the results will be applied to uncertain linear continuous systems in the sense of the above by using Euler approximation.

• Journal of the Korean Statistical Society
• /
• v.16 no.2
• /
• pp.71-79
• /
• 1987

The linear and quadratic log contrast model with mixtures on the strictly positive simplex, $$ x_{q-1} = {(x_1, \cdots, x_q):\sum x_, = 1 and \delta \leq \frac{x_i}{x_j} \leq \frac{1}{\delta} for all i,j},$$ are considered. Using the invariance arguments, symmetric D-optimal designs are investigated. The class of symmetric D-optimal designs for the linear log contrasts model is given. Any D-optimal design for the quadratic log contrast model is shown to metric D-optimal designs for q=3 and 4 cases are given.