• 대한수학회보
• /
• 제36권3호
• /
• pp.579-588
• /
• 1999

In this paper we study the connections between right quasi-duo rings and 2-primal rings, including several counterexamples for answers to some questions that occur naturally in the process. Actually we concern following three questions and modified ones: (1) Are right quasi-duo rings 2-primal$\ulcorner$, (2) Are formal power series rings over weakly right duo rings also weakly right duo\ulcorner and (3) Are 2-primal rings right quasi-duo\ulcorner Moreover we consider some conditions under which the answers of them may be affirmative, obtaining several results which are related to the questions.

• 대한수학회보
• /
• 제46권3호
• /
• pp.521-534
• /
• 2009

In this paper we present new large-update primal-dual interior point algorithms for $P_*$ linear complementarity problems(LAPS) based on a class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{1}{\sigma}}(e^{{\sigma}(1-t)}-1)$, p $\in$ [0, 1], ${\sigma}{\geq}1$. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*$ LAPS. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*$ LAPS have $O((1+2+\kappa)n^{{\frac{1}{p+1}}}lognlog{\frac{n}{\varepsilon}})$ complexity bound. When p = 1, we have $O((1+2\kappa)\sqrt{n}lognlog\frac{n}{\varepsilon})$ complexity which is so far the best known complexity for large-update methods.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.24-29
• /
• 1996

If the LP problem doesn't have the optimal soultion uniquely, the solution fo the primal-dual barrier method converges to the interior point of the optimal face. Therefore, when the optimal vertex solution or the optimal basis is required, we have to perform the additional procedure to recover the optimal basis from the final solution of the interior point method. In this paper the exisiting methods for recovering the optimal basis or identifying the optimal solutions are analyzed and the new methods are suggested. This paper treats the two optimal basis recovery methods. One uses the purification scheme and the simplex method, the other uses the optimal face solutions. In the method using the purification procedure and the simplex method, the basic feasible solution is obtained from the given interior solution and then simplex method is performed for recovering the optimal basis. In the method using the optimal face solutions, the optimal basis in the primal-dual barrier method is constructed by intergrating the optimal solution identification technique and the optimal basis extracting method from the primal-optimal soltion and the dual-optimal solution.

• 대한수학회논문집
• /
• 제25권4호
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• 한국경영과학회지
• /
• 제11권2호
• /
• pp.37-50
• /
• 1986

In combining dispersed optimization models, either primal or dual(or both) decomposition method widely used as an organizing device. Interpreting the methods economically, the concepts of price and resource-directive coordination are generally well accepted. Most of deomposition/ integration methods utilize either primal information of dual information, not both, from subsystems, while some authors have developed mixed decomposition approaches employing two master problems dealing primal and dual proposals separately. In this paper a hybrid decomposition method is introduced, where one hybrid master problem utilizes the underlying relationships between primal and dual information from each subsystem. The suggested method is well justified with respect to the flexibility in information flow pattern choice (some prices and other quantities) and to the compatibility of subdivision's optimum to the systemwide optimum, that is often lacking in conventional decomposition methods such as Dantzig-Wolfe's. A numerical example is also presented to illustrate the suggested approach.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.3-11
• /
• 1993

We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity.

• Korean Journal of Mathematics
• /
• 제27권1호
• /
• pp.141-150
• /
• 2019

In this article we investigate the structure of rings in which lower nilradicals coincide with upper nilradicals. Such rings shall be said to be quasi-2-primal. It is shown first that the $K{\ddot{o}}the^{\prime}s$ conjecture holds for quasi-2-primal rings. So the results in this article may provide interesting and useful information to the study of nilradicals in various situations. In the procedure we study the structure of quasi-2-primal rings, and observe various kinds of quasi-2-primal rings which do roles in ring theory.

• Journal of Animal Science and Technology
• /
• 제55권5호
• /
• pp.373-380
• /
• 2013

본 연구는 한우의 생체상태에서 부분육 생산량 예측모형을 개발하고자 실시하였다. 농협중앙회 한우개량사업소에서 후대 검정한 한우 거세우 874두의 24개월령에 측정된 체척자료를 통하여 24개월령에 도축된 부분육 중량과 수율을 예측하는 모형을 발굴하였다. 부분육은 대분할 중량과 수율을 이용하였으며, 부분육 수율은 도체중 대비 생산량으로 구하였다. 부분육 형질에 영향하는 환경효과 분석을 위하여 범주형 변량과 공변량을 각각 도축일, 도축일령으로 하였다. 분산분석 결과 부분육 중량과 수율 모두 도축일 효과가 유의하였으며 (P<0.01), 도축일령 효과는 우둔중량만 유의성 (P<0.05)을 나타냈다. 상관분석 결과에서는 안심, 등심 및 갈비의 중량은 흉위와 각각 0.54, 0.74 및 0.80의 높은 상관관계를 나타냈으므로 흉위가 커지면 선호도가 높은 안심, 등심 및 갈비의 중량도 증가될 것으로 사료된다. 등지방두께는 갈비를 제외한 모든 부분육 수율과부의 상관관계 (-0.22~-0.44)를 나타냈다. 안심의 수율은 체고(0.07), 십자부고 (0.07)를 제외한 나머지 체척형질들과 부의 상관관계를 나타냈으며, 등심의 수율은 흉폭 (0.03), 고장 (0.06), 곤폭 (0.03)을 제외한 나머지 체척형질들과 부의 상관을 나타냈다. 갈비의 수율과 흉위는 0.21의 정의 상관을 나타냈다. 부분육 생산량 예측을 위한 회귀모형에서 설명변량으로 10개의 체척 값을 이용하였다. 회귀분석은 회귀식의 유의성이 인정되는 범위에서 회귀모형의 적합도를 나타내는 결정계수의 값이 가장 높고 $C_p$ 값이 가장 적은 시점에서 변수를 선택하였으며, 분석결과 10가지의 체척치 중 체고, 체장, 고장, 좌골폭 및 흉위가 안심과 등심의 생산량 예측에 중요한 형질인 것으로 나타났다. 특히 흉위는 모든 부분육 중량을 추정하는 회귀식에 설명변량으로 선택이 되었다.

• 한국측량학회지
• /
• 제38권6호
• /
• pp.623-633
• /
• 2020

사람들이 실내공간에서 소비하는 시간이 증가함에 따라, 실내공간을 대상으로 하는 서비스들에 대한 수요가 지속적으로 증가하고 있다. 실내공간정보 서비스를 제공하기 위해서는 실내공간정보를 구축하는 것이 우선적으로 이루어져야 하며 본 연구에서는 기 구축되어 있는 BIM (Building Information Management) 데이터로부터 실내공간정보 국제표준 데이터인 IndoorGML을 생성하는 방법을 제안하였는데 대표적인 BIM 데이터 자료인 IFC (Industry Foundation Class) 데이터를 IndoorGML로 변환하기 위하여 IFC 객체들의 특성을 조사하고, IndoorGML로 변환이 필요한 객체들을 선별하였으며 실내공간의 표현과 내부통행에 제약을 주는 객체로 구분하였다. 또한 개발된 변환도구를 이용하여 빔서버(BIMserver) 깃헙(github)에서 제공하는 데이터 셋 일부와 서울시립대학교 21세기관 IFC모델을 IndoorGML의 PrimalSpaceFeatures 데이터로 구축하는 실험을 수행하였다. 각각의 IFC 데이터를 IndoorGML로 변환한 결과 기하정보를 손실 없이 IndoorGML문서가 생성되었으며, IndoorGML이 가지고 있는 특징인 NavigableBoundary가 정확하게 생성되는 결과를 보였다. 추후, 다양한 형태의 IfcStair 객체를 변환하는 방법에 대한 추가적인 연구가 필요하며, 프라이멀 스페이스(PrimalSpace) 데이터를 이용하여 듀얼 스페이스(DualSpace) 데이터인 MultiLayeredGraph를 자동 생성하는 방법에 대한 개발이 필요하다.

• 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.