• Journal of Animal Science and Technology
• /
• 제64권1호
• /
• pp.143-154
• /
• 2022

This study was conducted to evaluate the relationship among market weight, slaughter age, yield grade, and primal cut yield in Hanwoo. A total of 403 Hanwoo (Korean native cattle) was assessed for carcass traits such as carcass cold weight, backfat thickness, ribeye area, dressing percentage, yield index, and marbling score. The production yield of the individual major primal cuts of Hanwoo beef was also measured. Carcass cold weight, ribeye area, and backfat thickness, which affect meat quality increased with increased market weight (p < 0.05). The production yield of the ten major primal cuts also increased with increased market weight (p < 0.05). In terms of slaughter age, carcass cold weight, ribeye area, and backfat thickness all increased from 25 months to 28-29 months, and the production yield of all prime cuts also increased with increasing slaughter age. According to the meat yield grade, carcass cold weight and backfat thickness increased from grade A to grade C, although the ribeye area was not affected. The combined findings of the study suggest that slaughtering Hanwoo at the weight of 651-700 kg and 701-750 and age of 28.23 and 29.83 months could be desirable to achieve the best quality and quantity grade of Hanwoo beef. However, the positive correlation of carcass cold weight and backfat thickness, and the negative correlation of the yield index according to primal cuts yield indicated that it is necessary to couple the slaughtering management of cattle with improved genetic and breeding method of Hanwoo to increase the production yield of the major prime cuts of Hanwoo beef.

• 영어영문학
• /
• 제58권1호
• /
• pp.21-42
• /
• 2012

Gloria Naylor's second novel Linden Hills (1985) explores the issues of self-exploration, empowerment, history, and memory by delineating the communal and familial tragedies and the distortion of values prevalent in a prosperous African-American urban community called Linden Hills. Drawing upon the Freud's concept of "primal scene" and "family romance," this paper aims to focus upon the Nedeed family, the founder of Linden Hills, and investigate the compelling traumatogenic force within the family, which is inseparably intertwined with the inversion of values and moral corruption permeating the entire community. The "primal crime" committed by the Nedeed ancestors serves to preserve and perpetuate a tyrannical rule by ruthless patriarchs who reign by underhanded strategies of purposefully neglecting and abusing others, including their own wives. The imprisonment, by Luther Nedeed, of his wife Willa in the family morgue epitomizes the long legacy running in the family-the oppression and burial of the pre-Oedipal, maternal history. Willa's accidental encounter, at the nadir of the family estate and her personal despair, with the faded records of the forgotten and abused Nedeed women exposes the violence-ridden ground of the family's primal scene and the absurdity of family romance the Nedeeds pursued. As the several lines of poem composed by Willie, Willa's male double, show, the hidden, forgotten history of the Nedeed women, in a sense, is the real, which cannot be assimilated to the social symbolic governed by the inhumane patriarchy of the Nedeed family and the success-oriented Linden Hills society. By portraying a catastrophic downfall of the Nedeed family and the futile outcome of its family romance, the ending of Linden Hills conveys implicitly that the contingent symbolic order and its oppressive control, however solid and invincible they may seem, can be toppled down by the real, its nameless forgotten Other.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• 경영과학
• /
• 제11권3호
• /
• pp.1-11
• /
• 1994

Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권1호
• /
• pp.41-53
• /
• 2009

A primal-dual interior point method(IPM) not only is the most efficient method for a computational point of view but also has polynomial complexity. Most of polynomialtime interior point methods(IPMs) are based on the logarithmic barrier functions. Peng et al.([14, 15]) and Roos et al.([3]-[9]) proposed new variants of IPMs based on kernel functions which are called self-regular and eligible functions, respectively. In this paper we define a new kernel function and propose a new IPM based on this kernel function which has $O(n^{\frac{2}{3}}log\frac{n}{\epsilon})$ and $O(\sqrt{n}log\frac{n}{\epsilon})$ iteration bounds for large-update and small-update methods, respectively.

• Korean Journal of Mathematics
• /
• 제22권2호
• /
• pp.279-288
• /
• 2014

The studies of reversible and 2-primal rings have done important roles in noncommutative ring theory. We in this note introduce the concept of quasi-reversible-over-prime-radical (simply, QRPR) as a generalization of the 2-primal ring property. A ring is called QRPR if ab = 0 for $a,b{\in}R$ implies that ab is contained in the prime radical. In this note we study the structure of QRPR rings and examine the QRPR property of several kinds of ring extensions which have roles in noncommutative ring theory.

• 대한수학회보
• /
• 제46권6호
• /
• pp.1051-1060
• /
• 2009

In this paper, we give topological properties of collection of prime ideals in 2-primal near-rings. We show that Spec(N), the spectrum of prime ideals, is a compact space, and Max(N), the maximal ideals of N, forms a compact $T_1$-subspace. We also study the zero-divisor graph $\Gamma_I$(R) with respect to the completely semiprime ideal I of N. We show that ${\Gamma}_{\mathbb{P}}$ (R), where $\mathbb{P}$ is a prime radical of N, is a connected graph with diameter less than or equal to 3. We characterize all cycles in the graph ${\Gamma}_{\mathbb{P}}$ (R).

• 대한수학회보
• /
• 제54권4호
• /
• pp.1281-1291
• /
• 2017

Let R be a strongly 2-primal ring and I a proper ideal of R. Then there are only finitely many prime ideals minimal over I if and only if for every prime ideal P minimal over I, the ideal $P/{\sqrt{I}}$ of $R/{\sqrt{I}}$ is finitely generated if and only if the ring $R/{\sqrt{I}}$ satisfies the ACC on right annihilators. This result extends "D. D. Anderson, A note on minimal prime ideals, Proc. Amer. Math. Soc. 122 (1994), no. 1, 13-14." to large classes of noncommutative rings. It is also shown that, a 2-primal ring R only has finitely many minimal prime ideals if each minimal prime ideal of R is finitely generated. Examples are provided to illustrate our results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.366-368
• /
• 2002

This paper presents a technique that can obtain an optimal solution for the Security-Constrained Economic Dispatch (SCED) problems using the Interior Point Method (IPM) while taking into account of the power flow constraints. The SCED equations are formulated by using only the real power flow equations from the optimal power flow. Then an algorithm is presented that can linearize the SCED equations based on the relationships among generation real power outputs, loads, and transmission losses to obtain the optimal solutions by applying the linear programming (LP) technique. Finally, the application of the Primal Interior Point Method (PIPM) for solving the optimization problem based on the proposed linearized objective function is presented. The results are compared with the Simplex Method and the Promising results ard obtained.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.