• Journal of information and communication convergence engineering
• /
• 제17권3호
• /
• pp.198-204
• /
• 2019

In this study, the author introduces a supply-chain management (SCM) solution that connects suppliers, manufacturers, customers, and other companies within a transactional relationship to enable efficient inventory management and timely product supply, which ultimately maximizes corporate profits. This proposed solution exploits Fourth Industrial Revolution technologies, such as artificial intelligence (AI) and the Internet of Things (IoT), which provide solutions to complex management issues generated by the broader market. The goal of the current study was to develop an advanced and intelligent smart SCM solution that complies with logistics standards, to enhance the visibility, safety, and efficiency of a supply chain made up of manufacturers and suppliers. This smart SCM solution aims at maximizing corporate profits through efficient inventory management and timely supply of products, and solves the complex management problems caused by operating within a wide range of markets.

• 대한수학회지
• /
• 제54권5호
• /
• pp.1557-1571
• /
• 2017

The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

• 한국국방경영분석학회지
• /
• 제14권1호
• /
• pp.33-41
• /
• 1988

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• 한국국방경영분석학회지
• /
• 제13권2호
• /
• pp.33-41
• /
• 1987

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• 한국결정성장학회지
• /
• 제29권6호
• /
• pp.294-297
• /
• 2019

New insights about macro-step formation has been investigated. The phenomena of surface instability caused by the interaction between step flow and fluid flow was describe in mechanical way. The rotation of the seed crystal in a clockwise direction was applied with a speed varied from 30 to 200 rpm during the TSSG process on the Si- and C-faces 4H-SiC. The macro-steps were formed along the two specific directions at different locations on the crystal for each, i.e., [10-10] or [01-10] directions or both. From the results, it is suggested that the macro-steps were generated from the micro-steps by interaction between step flow and fluid flow during the rotation of seed crystal. Furthermore, The fluid flow could be effective to control the micro- and/or macro-step behavior during solution growth.

• 정보학연구
• /
• 제3권2호
• /
• pp.73-85
• /
• 2000

본 논문에서는 여러가지 상이한 메세지를 전송하는 정보통신 네트워크의 효율적인 해법을 개발하였다. 이 문제는 네트워크 이론에서의 전형적인 다품종 네트워크로의 전환이 가능하다. 이러한 문제는 문제의 크기에 따라 계산의 복잡도가 지수적으로 증가하는 대표적인 NP-완전문제이다. 본 논문에서 개발된 해법은 전통적인 라그랑지 이완법을 보완한 것으로 다음과 같이 구성된다. 우선 우수한 초기 실현가능해(good initial feasible solution)를 얻을 수 있는 휴리스틱 방법을 개발하고 초기 실현가능해가 얻어지면 이를 이용하여 초기 쌍대변수(이완된 제약식에 붙게되는 라그랑지 승수)를 추정한다. 대개의 경우 쌍대 변수를 임의로 0으로 설정하고 해법을 수행하는데, 이 경우 쌍대 최적해와의 차이가 많이 나게되므로 비효율이 발생할 수 있다. 쌍대 최적해를 얻은 후 원문제의 실현가능조건을 위배하는 경우에는 재할당 방법(re-allocation method)를 통해 원문제의 실현가능조건을 충족하도록 한다. 해법의 성능(효율성) 테스트 결과 저자들이 개발한 해법이 수행속도 면에서 상업용 팩키지와 기존의 효율적인 해법들에 비하여 매우 우수하다는 결과를 얻을 수 있었다. 또한 본 해법은 최적해를 보장하지 않지만 최적해와의 차이가 평균 2% 미만의 근사 최적해를 얻을 수 있었다.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2008년도 International Meeting on Information Display
• /
• pp.928-931
• /
• 2008

Using 4,4'4"-tris(N-carbazolyl)-triphenylamine (TCTA) small molecule interlayer, we have fabricated efficient green PHOLED by solution process. The maximum current and power efficiency values of 33.7 cd/A and 19.6 lm/W are demonstrated, respectively. Results reveal a way to fabricate the PHOLED using TCTA interlayer by solution process, promising for efficient and simple manufacturing.

• 한국안전학회지
• /
• 제12권1호
• /
• pp.122-128
• /
• 1997

A new approach, called "two-phase approach", has been proposed In this study. Using this approach to solve MONLP(multiobjective nonlinear programming problem), the solution process is divied into two phase. In the first phase, the min-operator is used to aggregate the membership degree of fuzzy goals and constraints. In the second phase, the $\gamma$-operator is used to test and find an efficient solution in the sense of nondominated. It has been shown that no matter what the solution of the problem is unique or not, an efficient solution can be always obtained at the second phase. The proposed approach can be applied to industrial safety problem with multiobjective problems. On the basis of proposed approach, an illustrative numerical example is presented.presented.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1994년도 봄 학술발표회 논문집
• /
• pp.105-112
• /
• 1994

In a local vibration analysis of a large steel frame, a large eigenvalue problem results. Due to computer storage and the expense of a complete solution, it is desirable to minimize the size of the resulting matrices. A new and efficient method of local vibration analysis for large steel frames is presented. It reduces the order of dynamic matrices by dynamic condensation method. Examples are given for local vibration of a plane frame. Results are compared to the complete solution of the full eigenvalue problem.