• Korean Management Science Review
• /
• v.30 no.3
• /
• pp.81-97
• /
• 2013

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines. Non-identical setup and processing times are assumed for each machine. A genetic algorithm is proposed to minimize the makespan objective measure. In this paper, a lowerbound and some heuristic algorithms are derived and tested through computational experiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.1-18
• /
• 1993

The family disaggregation model of hierarchical production planning (HPP) is the problem of (0 -1) mixed integer programming that minimizes the total sum of setup costs and inventory holding costs over the planning horizon. This problem is hard in a practical sense since optimal solution algorithms have failed to solve it within reasonable computation times. Thus effective familoy disaggregation algorithm should be developed for HPP. The family disaggregation algorithm developed in this paper consists of the first stage of finding initial solutions and the second stage of improving initial solutions. Some experimental results are given to verify the effectiveness of developed disaggregation algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2016

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

• Bulletin of the Korean Chemical Society
• /
• v.35 no.2
• /
• pp.365-370
• /
• 2014

For real-time monitoring of colloidal nanoparticles (NPs) in aqueous media, a light sheet type dark-field microscopy system combined with a microfluidic concentration gradient generator (${\mu}FCGG$-LSDFM) was developed. Various concentrations of colloidal Au NPs were simultaneously generated with the iFCGG and characterized with the LSDFM setup. The number concentrations and hydrodynamic size distributions were measured via particle counting and tracking analysis (PCA and PTA, respectively) approaches. For the 30 nm Au NPs used in this study, the lower detection limit of the LSDFM setup was 3.6 ng/mL, which is about 400 times better than that of optical density measurements under the same ${\mu}FCGG$ system. Additionally, the hydrodynamic diameter distribution of Au NPs was estimated as $39.7{\pm}12.2nm$ with the PTA approach, which agrees well with DLS measurement as well as the manufacturer's specification. We propose this ${\mu}FCGG$-LSDFM setup with features of automatic generation of NP concentration gradient and real-time monitoring of their physicochemical characteristics (e.g., number concentration, and hydrodynamic size distribution) as an important component of future high-throughput screening or high-content analysis platforms of nanotoxicity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1068-1077
• /
• 2014

In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.

• Progress in Superconductivity
• /
• v.7 no.1
• /
• pp.36-40
• /
• 2005

The problem of fluctuation-induced digital errors in a rapid single flux quantum (RSFQ) circuit has been a very important issue. In this work, we calculated the bit error rate of an RSFQ switch used in superconductive arithmetic logic unit (ALU). RSFQ switch should have a very low error rate in the optimal bias. Theoretical estimates of the RSFQ error rate are on the order of $10^{-50}$ per bit operation. In this experiment, we prepared two identical circuits placed in parallel. Each circuit was composed of 10 Josephson transmission lines (JTLs) connected in series with an RSFQ switch placed in the middle of the 10 JTLs. We used a splitter to feed the same input signal to both circuits. The outputs of the two circuits were compared with an RSFQ exclusive OR (XOR) to measure the bit error rate of the RSFQ switch. By using a computerized bit-error-rate test setup, we measured the bit error rate of $2.18{\times}10^{-12}$ when the bias to the RSFQ switch was 0.398 mA that was quite off from the optimum bias of 0.6 mA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.58-62
• /
• 2007

Recnetly, the demands of QoS(Quality of Service) and the traffic in network is increased. So, H-MPLS(Hierarchical MPLS) network research what guarantees the scalability is in progress. But, the H-MPLS has a problem of increasing of groups and the links of these group's nodes. It happens a problem that is increasing of H-MPLS setup cost. In this paper, We setup the H-MPLS groups. We use NS simulator in order to analyze the performance and traffic transfer times of each H-MPLS groups. In conclusion, we can find out the elevation of the traffic performance, by increasing a amount of links.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.727-731
• /
• 2009

In this paper, we propose a method to generate a free viewpoint image using multi-viewpoint images which are taken by cameras arranged circularly. In past times, we have proposed the method to generate a free viewpoint image based on Ray-Space method. However, with that method, we can not generate a walk-through view seen from a virtual viewpoint among objects. The method we propose in this paper realizes the generation of such view. Our method gets information of the positions of objects using shape from silhouette method at first, and selects appropriate cameras which acquired rays needed for generating a virtual image. A free viewpoint image can be generated by collecting rays which pass over the focal point of a virtual camera. However, when the requested ray is not available, it is necessary to interpolate it from neighboring rays. Therefore, we estimate the depth of the objects from a virtual camera and interpolate ray information to generate the image. In the experiments with the virtual sequences which were captured at every 6 degrees, we set the virtual camera at user's choice and generated the image from that viewpoint successfully.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.386-389
• /
• 2013

In this paper, for signal integrity analysing high-speed signal between a processor and a DDR2 memory, transient analysis is done and eye diagrams are generated using IBIS models of IC chips and S-parameters of transmission line. From the eye diagrams of such high-speed signals as DQ, DQS/DQSb, Clock, Address and Control, signal quality is assured through measuring timing and voltage margins during setup and hold times and verifying that the over-/under-shoot and the cross points of differential signals satisfy their specifications.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.60-67
• /
• 2004

With the fast growth of Internet and a new widespread interest in optical networks, the unparalleled potential of Multi-Protocol Label Switching (MPLS) is leading to further research and development efforts. One of those areas of research is Path Protection Mechanism. It is widely accepted that layer three protection and recovery mechanisms are too slow for today’s reliability requirements. Failure recovery latencies ranging from several seconds to minutes, for layer three routing protocols, have been widely reported. For this reason, a recovery mechanism at the MPLS layer capable of recovering from failed paths in 10’s of milliseconds has been sought. In light of this, several MPLS based protection mechanisms have been proposed, such as end-to-end path protection and local repair mechanism. Those mechanisms are designed for intra-domain recoveries and little or no attention has been given to the case of non-homogenous independent inter-domains. This paper presents a novel solution for the setup and maintenance of independent protection mechanisms within individual domains and merged at the domain boundaries. This innovative solution offers significant advantages including fast recovery across multiple nonhomogeneous domains and high scalability. Detailed setup and operation procedures are described. Finally, simulation results using OPNET are presented showing recovery times of a few milliseconds.