• Macromolecular Research
• /
• v.14 no.5
• /
• pp.565-572
• /
• 2006

Recombinant human bone morphogenic protein-2 (rhBMP-2), which is known as one of the major local stimuli for osteogenic differentiation, was immobilized on the surface of hyaluronic acid (HA)-modified poly$(\varepsilon-caprolactone)$ (PCL) (HA-PCL) scaffolds to improve the attachment, proliferation, and differentiation of human bone marrow stem cells (hBMSCs) for bone tissue engineering. The rhBMP-2 proteins were directly immobilized onto the HA-modified PCL scaffolds by the chemical grafting the amine groups of proteins to carboxylic acid groups of HA. The amount of covalently bounded rhBMP-2 was measured to 1.6 pg/mg (rhBMP/HA-PCL scaffold) by using a sandwich enzyme-linked immunosorbant assay. The rhBMP-2 immobilized HA-modified-PCL scaffold exhibited the good colonization, by the newly differentiated osteoblasts, with a statistically significant increase of the rhBMP-2 release and alkaline phosphatase activity as compared with the control groups both PCL and HA-PCL scaffolds. We also found enhanced mineralization and elevated osteocalcin detection for the rhBMP-2 immobilized HA-PCL scaffolds, in vitro.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1221-1230
• /
• 1997

In this study, the performance of a parallel file system(N-PFS), which is inplemented using conventional disks as disk arrays on a Workstation Cluster, is analyzed by using analytical method and adtual values in experiments.N-PFS can be used as high-performance file sever in small-scale server systems and effciently pro-cess massive data I/Os such as multimedia and scientifid data. In this paper, an analytical model was suggested and the correctness of the suggested was verified by analyzing the experimental values on a system.The result of the appropriate stping unit for processing massive data of the Workstation Cluster with 8 disks is 64-128Kbytes and the maximum throughput on it is 15.8 Mbytes/ses.In addition, the performance of parallel file system on massive data is bounded by the time required to copy data between buffers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.3
• /
• pp.66-75
• /
• 2017

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.6
• /
• pp.20-26
• /
• 2002

This paper deals with the guaranteed cost control problems for a class of discrete-time linear uncertain systems with time-varying delay. The uncertain systems under consideration depend on time-varying norm-bounded parameter uncertainties. We address the existence condition and the design method of the memoryless state feedback control law such that the closed loop system not only is quadratically stable but also guarantees an adequate level of performance for all admissible uncertainties. Through some changes of variables and Schur complement, It is shown that the sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.

• 전자공학회논문지 IE
• /
• v.46 no.2
• /
• pp.33-45
• /
• 2009

In this paper, the implementation of the backward movement control of a truck-trailer type mobile robot using fuzzy model based control scheme considering the practical constraints, computing time-delay and quantization is presented. We propose the fuzzy feedback controller whose output is delayed with unit sampling period and predicted. The analysis and the design problem considering the computing time-delay become very easy because the proposed controller is syncronized with the sampling time. Also, the stability analysis is made when the quantization exists in the implementation of the fuzzy control architectures and it is shown that if the trivial solution of the fuzzy control system without quantization is asymptotically stable, then the solutions of the fuzzy control system with quantization are uniformly ultimately bounded. The experimental results are shown to verify the effectiveness of the proposed scheme.

• 전자공학회논문지 IE
• /
• v.47 no.3
• /
• pp.35-40
• /
• 2010

In this paper, we propose an algorithm to improve the precision of initial carrier-frequency offset estimation for multiband-OFDM (MB-OFDM) UWB system which is considering the quantization-noise effect. In the general OFDM system, the two adjacent and repeated preamble symbols are used for the initial carrier-frequency synchronization while the performance of the frequency-offset estimation is bounded by quantization effect generated from analog-to-digital conversion at the receiver. This paper proposes a method in which one-symbol interval between two adjacent preamble symbols for the initial frequency synchronization is extended to multiple-symbol interval between non-adjacent symbols in an extent that phase ambiguity does not occur. In this paper, we also present '6' as optimal multiple symbol interval for the MB-OFDM system with 30 preamble symbols on 3-band hopping and with 4-bit A/D conversion at the receiver. Under the channel environments for the MB-OFDM UWB system, the simulation results show that the proposed estimation algorithm can achieve the initial estimation in offset precision less than 5 ppm.

• Journal of Environmental Policy
• /
• v.8 no.3
• /
• pp.163-180
• /
• 2009

This study attempts to investigate the preference uncertainty of respondents involved in stating their Willingness to Pay (WTP). For the Contingent Valuation Method (CVM) survey, we employed two approaches using two split samples. The respondents of one sample were given the opportunity to express intensity of preference through Multi-bounded Discrete Choice (MBDC) WTP questions, while those in the other sample were given Dichotomous Choice (DC) WTP questions. By incorporating the two elicited degrees of preference uncertainty into examining the WTP responses, we compared the two approaches. In comparing the DC model with the MBDC model, the mean WTP for the DC model was similar to PRYES in the MBDC Model. We concluded that the MBDC model estimates the various mean WTP while considering the preference uncertainty.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.549-554
• /
• 2012

In this paper, we consider the optimal fuzzy filter of nonlinear discrete-time with estimation error variance constraint. First, the Takagi and Sugeno(T-S) fuzzy model is employed to approximate the nonlinear system. Next, the error state is mean square bounded, and the steady state variance of the estimation error of each state is not more than the individual predefined value. It is shown that, the addressed problem can be carried out by solving linear matrix inequality(LMI) and some algebraic quadratic matrix inequalities. Finally, some examples are provided to illustrate the design procedure and expected performance through simulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.160-167
• /
• 2009

This paper describes how to protect the personal information of a biometric reference provider wherein biometric reference and personally identifiable information are bounded in a biometric system. To overcome the shortcomings of the simple personal authentication method using a password, such as identify theft, a biometric system that utilizes physical and behavioral characteristics of each person is usually adopted. In the biometric system, the biometric information itself is personal information, and it can be used as an unique identifier that can identify a particular individual when combining with the other information. As a result, secure protection methods are required for generating, storing, and transmitting biometric information. Considering these issues, this paper proposes a method for ensuring confidentiality and integrity in storing and transferring personally identifiable information that is used in conjunction with biometric information, by extending the related X9.84 standard. This paper also outlines the usefulness of the proposition by defining a standard format represented by ASN.1, and implementing it.