• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.367-369
• /
• 1986

Guaranteed cost control is a method applicable to a class of systems with uncertain parameters that guarantees an upper bound of the cost functional. This paper is concerned with a matrix decomposition technique used to yield a reasonable upper bound of the cost functional for a finite-time LQ regulator problem. The uncertain linear systems dealt with in this paper are described by a set of state equations of single-input phase-variable canonical form which contain unknown but bounded uncertain parameters.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.283-290
• /
• 2003

Andras Bezdek proved that if a convex n-gon and n points are given, then the points and the sides of the polygon can be renumbered so that at least[${\frac{n}{3}}$] triangles spanned by the ith point and the ith side (i = 1,2,...n) are mutually non-overlapping. In this paper, we show that at least [${\frac{n}{2}}$] mutually non-overlapping triangles can be constructed. This lower bound is best possible.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 가을 학술발표논문집 Vol.29 No.2 (1)
• /
• pp.46-48
• /
• 2002

사용자에게 서비스 할 데이터가 많을 경우 여러 볼륨에 저장해서 처리해야 할 경우가 발생한다. 볼륨이 여러 개일 경우 효과적이고 효율적인 접근 방법이 필요하다. 본 논문에서는 SHORE 저장 시스템을 이용할 경우에 효과적이고 효율적인 접근 방법을 알아보고자 한다. single thread, multi thread, multi process, socket을 이용한 접근 방법을 살펴보고 multi thread를 이용하는 방법이 가장 효율적인 것을 실험 결과를 통해서 보인다. SHORE thread는 CPU bound에 관련된 job이 많은 경우는 process를 사용했을 때에 비해 큰 효과가 없으나 I/O bound에 관련에 것일 경우는 multi process를 사용한 것과 비슷한 효과가 있음을 알 수 있다.

• 한국정밀공학회지
• /
• 제12권6호
• /
• pp.27-36
• /
• 1995

This paper covers algorithms to determine a machine assignment strategy to locations on a single straight track by minimizing the total backtrack distance. Three different algorithms ar presented: an efficient heuristic procedure, the branch-and-bound algorithm, and the nerual network approach. Simulation results show that the proposed algorithms have potential power to design an on-line optimizer.

• Biotechnology and Bioprocess Engineering:BBE
• /
• 제4권1호
• /
• pp.72-77
• /
• 1999

An antibody containing a genetically engineered lipid group at the N-termunus and a hexahistidinyl tag at the C-terminus (Lpp-scF-His6) was immobilized in an oriented manner on the surface of liposome. Liposomes, consisting of antibody and phosphatidyl-choline, have been prepared and imaged by AFM. For AFM visualization, the resulting liposomes were bound on the surface of mica by two different mechanisms. The histidine tags present in the antibody molecules of the immonuliposome were anchored to the NiCl2 treated mica surface. Alternatively, the immunoliposomes were immunochemically bound on antigen-coated mica surface. Both approaches yielded liposomes which were clearly imaged without damage by AFM in ambient condition.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.13-20
• /
• 2012

This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

• 경영과학
• /
• 제30권2호
• /
• pp.133-141
• /
• 2013

In this paper, we considers the outsourcing decision problem in a single machine scheduling problem. The decision problem is to determine for each job whether to be processed on an in-house manufacturing or external facilities(outsourcing). Moreover, this paper considers a situation where each job has a due date. The objective of the problem is to minimize the outsourcing cost, subject to the due date constraints. The considered problem is proved to be NP-hard. Some solution properties and valid inequalities are derived, and an effective lower bound is derived based on the LP-relaxation. The results of experimental tests are presented to evaluate the performance of the suggested lower bound.

• 대한수학회보
• /
• 제60권5호
• /
• pp.1181-1199
• /
• 2023

For solving complex symmetric positive definite linear systems, we propose a single step real-valued (SSR) iterative method, which does not involve the complex arithmetic. The upper bound on the spectral radius of the iteration matrix of the SSR method is given and its convergence properties are analyzed. In addition, the quasi-optimal parameter which minimizes the upper bound for the spectral radius of the proposed method is computed. Finally, numerical experiments are given to demonstrate the effectiveness and robustness of the propose methods.

• 한국전기전자재료학회논문지
• /
• 제14권6호
• /
• pp.445-454
• /
• 2001

The stochiometric mix of evaporating materials for the CuInSe$_2$ single crystal thin films was prepared from horizontal furnace. To obtain the single crystal thin films, CuInSe$_2$ mixed crystal was deposited on thoroughly etched semi-insulating GaAs(100) substrate by the Hot Wall Epitaxy(HWE) system. The source and substrate temperature were 62$0^{\circ}C$ and 41$0^{\circ}C$, respectively. The crystalline structure of single crystal thin films was investigated by the photoluminescence and double crystal X-ray diffraction (DCXD). The carrier density and mobility of CuInSe$_2$ single crystal thin films measured from Hall effect fby van der Pauw method are 9.62x10$^{16}$ cm$^{-3}$ , 296$\textrm{cm}^2$/V.s at 293 K, respectively. From the photocurrent spectrum by illumination of perpendicular light on the c-axis of the CuInSe$_2$ single crystal thin film we have found that he values of spin orbit splitting ΔSo and the crystal field splitting ΔCr were 6.1 meV and 175.2 meV at 10K, respectively. From the photoluminescence measurement on CuInSe$_2$ single crystal thin film we observed free excition (Ex) existing only high quality crystal and neutral bound exiciton (D$^{\circ}$,X) having very strong peak intensity. Then, the full-width-at-half-maximum(FWHM) and binding energy of neutral donor bound excition were 7meV and 5.9meV, respectivity. by Haynes rule, an activation energy of impurity was 50 meV.