• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.296-298
• /
• 1992

Presented in this paper is a generalized norm bound for the continuous and discrete algebraic Riccati equations. The generalized norm bound provides a lower bound of the Riccati solutions specified by any kind of submultiplicative matrix norms including the spectral, Frobenius and $\ell_1$ norms.

• Journal of the Korean Statistical Society
• /
• 제22권1호
• /
• pp.1-12
• /
• 1993

An approach to make the information bound sharper in median-unbiased estimation, based on an analogue of the Cramer-Rao inequality developed by Sung et al. (1990), is introduced for continuous densities with a nuisance parameter by considering information quantities contained both in the parametric function of interest and in the nuisance parameter in a linear fashion. This approach is comparable to that of improving the information bound in mean-unbiased estimation for the case of two unknown parameters. Computation of an optimal weight corresponding to the nuisance parameter is also considered.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.60-64
• /
• 1997

In a fuzzy relation equation R=U=T, we find the bounde by U* and U* of the equation where U* is lower bound and U* is upper bound.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• 대한수학회보
• /
• 제57권4호
• /
• pp.933-943
• /
• 2020

Let M be a Fano manifold, and H^🟉(M; ℂ) be the quantum cohomology ring of M with the quantum product 🟉. For 𝜎 ∈ H^🟉(M; ℂ), denote by [𝜎] the quantum multiplication operator 𝜎🟉 on H^🟉(M; ℂ). It was conjectured several years ago [7,8] and has been proved for many Fano manifolds [1,2,10,14], including our cases, that the operator [c₁(M)] has a real valued eigenvalue 𝛿₀ which is maximal among eigenvalues of [c₁(M)]. Galkin's lower bound conjecture [6] states that for a Fano manifold M, 𝛿₀ ≥ dim M + 1, and the equality holds if and only if M is the projective space ℙⁿ. In this note, we show that Galkin's lower bound conjecture holds for Lagrangian and orthogonal Grassmannians, modulo some exceptions for the equality.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.533-539
• /
• 2012

The performance analysis of wireless geolocation in a non-line-of-sight (NLOS) environment is a very important issue. Since Cramer-Rao lower bound (CRLB) determines the physical impossibility of the variance of an unbiased estimator being less than the bound, many studies presented the performance analysis in terms of CRLB. Several CRLBs for time-of-arrival (TOA), pseudo-range TOA, angle-of-arrival (AOA), and signal strength (SS) based positioning methods have been derived for NLOS environment. However, the performance analysis of time difference of arrival (TDOA) and TDOA/SS based geolocation techniques in a NLOS environment is still an opening issue. This paper derives the CRLBs of TDOA and TDOA/SS based positioning methods for NLOS environment. In addition, theoretical analysis proves that the derived CRLB for TDOA is the same as that of pseudo-range TOA and the TDOA/SS scheme has a lower CRLB than the TDOA (or SS) scheme.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.347-361
• /
• 2022

Two virtual knot diagrams are said to be equivalent, if there is a sequence S of Reidemeister moves and virtual moves relating them. The difference of writhes of the two virtual knot diagrams gives a lower bound for the number of the first Reidemeister moves in S. In previous work, we introduced a polynomial q_K(t) for a virtual knot diagram K which gave a lower bound for the number of the third Reidemeister moves in the sequence S. In this paper we define a new polynomial from a coloring of a virtual knot diagram. Using this polynomial, we give a lower bound for the number of the second Reidemeister moves in S. The polynomial also suggests the design of the sequence S.

• Food Science and Biotechnology
• /
• 제16권2호
• /
• pp.183-186
• /
• 2007

The type of mixed gel network of $\kappa$-carrageenan/agar was determined by applying rheological principles. Apparent Young's modulus of the mixed gels was mathematically analyzed with (a) simply adding the moduli of two component gels, (b) phase-separated type's upper and lower bound models, (c) interpenetrating type's logarithmic model. The experimental data fitted the estimates from the operation (a). Whereas, as for the models (b), the experimental values in the agar-rich region fitted the estimates of the upper bound model, but in the $\kappa$-carrageenan-rich region slightly deviated from those of the lower bound model. It reflected an evidence of a phase-separated type, although it was not typical, that there must be data good-fit in the agar-rich and $\kappa$-carrageenan-rich regions with the upper and lower bound models, respectively. Experimental values disagreed with estimates of the model (c). Gel time was analyzed to evince the phase-separated type. As agar concentrations increased at a fixed amount of $\kappa$-carrageenan, gel time gradually decreased and then sharply increased and decreased again. The pattern of such change in gel time also represented a typical behavior of phase-separated type's mixed gels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2074-2093
• /
• 2022

RSA is known as one of the best techniques for securing secret information across an unsecured network. The private key which is one of private parameters is the aim for attackers. However, it is exceedingly impossible to derive this value without disclosing all unknown parameters. In fact, many methods to recover the private key were proposed, the performance of each algorithm is acceptable for the different cases. For example, Wiener's attack is extremely efficient when the private key is very small. On the other hand, Fermat's factoring can quickly break RSA when the difference between two large prime factors of the modulus is relatively small. In general, if all private parameters are not disclosed, attackers will be able to confirm that the private key is unquestionably inside the scope [3, n - 2], where n is the modulus. However, this scope has already been reduced by increasing the greatest lower bound to [d_il, n - 2], where d_il ≥ 3. The aim of this paper is to decrease the least upper bound to narrow the scope that the private key will remain within this boundary. After finishing the proposed method, the new scope of the private key can be allocated as [d_il, d_ir], where d_ir ≤ n - 2. In fact, if the private key is extremely close to the new greatest lower bound, it can be retrieved quickly by performing a brute force attack, in which d_ir is decreased until it is equal to the private key. The experimental results indicate that the proposed method is extremely effective when the difference between prime factors is close to each other and one of two following requirement holds: the first condition is that the multiplier of Euler totient function is very close to the public key's small value whereas the second condition is that the public key should be large whenever the multiplier is far enough.

• 대한화장품학회:학술대회논문집
• /
• 대한화장품학회 2003년도 IFSCC Conference Proceeding Book I
• /
• pp.570-577
• /
• 2003

The importance of cornified envelope (CE)-bound lipids to epidermal barrier function is increasingly being recognized. In the present study, we intentionally damaged the cornified layer of hairless mice by ultraviolet irradiation and sodium dodecyl sulfate (SDS) treatment, and assessed the changes in epidermal barrier function by measuring Trans Epidermal Water Loss (TEWL). We also measured changes in the amount of CE-bound lipids using thin layer chromatography (TLC). The results showed that both treatments increased TEWL and decreased CE-bound lipids (omega-hydroxy cerami de and omega-hydroxy acid). In addition, investigation of the chronological changes in TEWL revealed an inverse relationship between TEWL and CE-bound lipids, and a correlation between CE-bound lipids and epidermal barrier function. We then measured the amount of CE-bound lipids in the cheek and the medial side of the upper arm in humans. The results showed that because the cheek receives external stimulation on a daily basis, the amount of CE-bound lipids was significantly lower, while the level of TEWL was higher. These observations, together with those from the animal study, indicate that CE-bound lipids are related to epidermal barrier function.