• Archives of Pharmacal Research
• /
• 제19권6호
• /
• pp.502-506
• /
• 1996

Protein X is one of the subunits of pyruvate dehydrogenase complex. The biological role of this protein has not been fully elucidated, mainly because of the difficulty in its dissociation from the tightly bound dihydrolipoamide acetyltransferase-protein X subcomplex. We have found that the detachment of protein X from acetyltransferase subunit can be easily accomplished by the cycles of freezing and thawing proces. Several lines of evidence including sodium dodecyl sulfate-polyacrylamide gel electrophoresis, N-terminal amino acid sequence analysis and acetylation with $[2^{14}C]$ pyruvate confirmed that the purified protein is protein X. The purified intact form of protein X was acetylated by $[2^{14}C]$ pyruvate in the presence of py-ruvate dehydrogenase subunit.The acetylation efficiency of this protein was lower than that of acetyltransferase and was not affected by the presence of acetyltransferase.

• 한국산업정보학회논문지
• /
• 제8권4호
• /
• pp.94-100
• /
• 2003

본 논문에서는k개 성분들이 지수분포를 따르는 병렬시스템에서 하나의 성분이 고장났을 때 나머지성분들의 수명분포에 영향을 줄 때 주어진 시각 t 에서 시스템의 신뢰도, 위험함수, 평균잔여수명, 신뢰도에 대한 최우추정량과 최소분산불편추정량을 제시하고 그리고 모의실험을 통하여 추정량들의 효율성을 연구한다.

• 전기학회논문지
• /
• 제58권10호
• /
• pp.1911-1915
• /
• 2009

The problem of determining the proper capacity of electric vehicle charging station is studied in the presented paper. Based on the expected arrival rate and the expected charging time, we calculate the proper capacity that guarantees electric vehicles get service better than a given lower bound which is termed the loss of charging probability. The problem is studied by using certain queueing models. We first formulate the problem as a queueless model of type M/M/n/n, known as the Erlang loss system. And then the M/M/n/K type queueing model is formulated to consider the parking space constraint. Results of the study may be used for designing the electric vehicle charging station.

• Industrial Engineering and Management Systems
• /
• 제1권1호
• /
• pp.29-45
• /
• 2002

In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. We propose a numeric model and an algorithm in order to compute the first two moments of inter-departure process. Entropy enables us to examine the convergence of this process and to derive measurable relations of this process. Also, lower bound on the variance of inter-departure process plays an important role in proving the existence and uniqueness of an optimal solution for a numeric model and deriving the convergence order of augmented Lagrange multipliers method applied to a numeric model. Through these works, we confirm some structural properties and numeric examples how the validity and applicability of our study.

• 한국IT서비스학회지
• /
• 제9권3호
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

• 대한전기학회논문지
• /
• 제38권11호
• /
• pp.913-921
• /
• 1989

본논문에서는 임의의 영점들을 갖는 이산시간 선형시불변계통의 극배치 간접적응제어기 설계문제를 다루었다.외부입력은 persistent excitation 조건을 만족하고, 주어진 계통의 분자다항식과 분모 다항식에 의해 정해지는 Sylevester resultant 행렬식의 하한을 안다는 가정하에, 전체 폐루우계통이 대국적으로 안정함을 보였다. 간접적응제어시 발생되는 추정된 계통의 가제어성 문제는 파라미터 교정방법을 확장시켜 해결하였다. 2차 플랜트에 대한 전산기 simulation을 통하여 본논문의 제어알고리즘의 유용성을 확인하였다.

• 대한산업공학회지
• /
• 제25권2호
• /
• pp.254-265
• /
• 1999

We consider two stage hybrid flowshop scheduling problem when there are two non-identical parallel machines at the first stage, and only one machine at the second stage. Several well-known sequence-first allocate-second heuristics are considered first. We then propose an allocate-first sequence-second heuristic to find minimum makespan schedule. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated by comparing with easily computable lower bound. The proposed heuristic algorithm as well as the existing heuristics are evaluated by simulation in four cases which have different processing time distribution, and it is found that the proposed algorithm is more effective in every case.

• 한국정보처리학회논문지
• /
• 제4권10호
• /
• pp.2571-2580
• /
• 1997

본 연구에서는 자원의 수가 한정된 상태에서 동작 알고리즘의 수행을 마치기 위한 자원제약 스케쥴링 방법을 다루었다. 특히, 제한된 자원제약하에서 연산이 할당되는 제어스텝의 최하한값을 구하기 위한 지연 스케쥴링 방법을 제안하였다. 스케쥴링 문제에 대하여 연산의 멀티싸이클과 기능적 파이프라이닝을 고려하였으며 스케쥴링 문제에 대한 최적의 결과를 얻기 위해 선형정수계획법을 이용하였다. 5차 디지털 웨이브 필터 DFG를 실험 대상으로 하여 본 연구의 효용성을 입증하였다.

• Kyungpook Mathematical Journal
• /
• 제57권1호
• /
• pp.145-161
• /
• 2017

If a virtual knot diagram can be transformed to another virtual one by a finite sequence of crossing changes, Reidemeister moves and virtual moves then the two virtual knot diagrams are said to be homotopic. There are infinitely many homotopy classes of virtual knot diagrams. We give necessary conditions by using polynomial invariants of virtual knots for two virtual knots to be homotopic. For a sequence S of crossing changes, Reidemeister moves and virtual moves between two homotopic virtual knot diagrams, we give a lower bound for the number of crossing changes in S by using the affine index polynomial introduced in [13]. In [10], the first author gave the q-polynomial of a virtual knot diagram to find Reidemeister moves of virtually isotopic virtual knot diagrams. We find how to apply Reidemeister moves by using the q-polynomial to show homotopy of two virtual knot diagrams.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2010년도 한국컴퓨터종합학술대회논문집 Vol.37 No.1(C)
• /
• pp.49-52
• /
• 2010

본 논문에서는 윤곽선 이미지 매칭에서 회전-불변 거리를 계산하는 효율적 방법을 제안한다. 회전-불변 거리 계산은 이미지 시계열을 한 칸씩 회전하면서 매번 유클리디안 거리를 계산해야 하는 고비용의 연산이다. 본 논문에서는 엔빌로프 기반 하한을 사용하여 불필요한 회전-불변 거리 계산을 크게 줄이는 효율적인 해결책을 제시하다. 이를 위해, 먼저 질의 시퀀스 대상의 엔빌로프 작성과 이의 하한 개념을 제시한다.다음으로, 엔빌로프 기반 하한을 회전-불변 거리 계산에 사용하면 많은 수의 회전-불변 거리계산을 줄일 수 있음을 보인다. 실험 결과, 제안한 엔빌로프 기반 매칭 기법은 기존 기법에 비해 최대 수배에서 수십배까지 매칭 성능을 향상시킨 것으로 나타났다.