• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.223-226
• /
• 1998

In the Input Buffer Switch using the intial stage FIFO memory structure, It has pointed the Throughput limitation to the percent of 58.6 due to HOL(Head of Line) blocking in the DBP(Dedicated Buffer with Pointer) method, During that time, To overcome these problems, The prior papers have proposed the complicated Arbitration algorithms and Non-FIFO memory structures. and These showed the improved Throughput. But, Now, To design high speed ATM Switch which need to the tens of Giga bit/s or the tens of Tera bit/s. It has more difficulty in proceeding the priority of majority and the complicated Cell Scheduling, because of the problem in operating the control speed of the ratio of N to scanning each port and scheduling the Cell. In this paper, To overcome these problems, We could show more the improved performance than the existing DBP Window policy to design high speed ATM Switch.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.23-35
• /
• 2005

This paper aims to develop a practical finite capacity MRP (FCMRP) system based on the needs of an automotive parts manufacturing company in Thailand. The approach includes a linear goal programming model to determine the optimal start time of each operation to minimize the sum of penalty points incurred by exceeding the goals of total earliness, total tardiness, and average flow-time considering the finite capacity of all work centers and precedence of operations. Important factors of the proposed FCMRP system are penalty weights and dispatching rules. Effects of these factors on the performance measures are statistically analyzed based on a real situation of an auto-part factory. Statistical results show that the dispatching rules and penalty weights have significant effects on the performance measures. The proposed FCMRP system offers a good tradeoff between conflicting performance measures and results in the best weighted average performance measures when compared to conventional forward and forward-backward finite capacity scheduling systems.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.27 no.2
• /
• pp.177-188
• /
• 2024

The strategic UAV for theater level ISR(Intelligence, Surveillance and Reconnaissance) mission typically has numerous ground targets over area of responsibility(AOR) or area of operation(AO). It is necessary to automatically incorporate these multitude of ground targets into mission planning process in order to collect ISR images before actual flight mission. In addition, weather information such as wind direction and/or velocity may have significant impacts on the qualities of collected sensor images, especially in SAR(Synthetic Aperture Radar) images. Thus weather factors in the operation altitude should also be considered in the mission planning stage. In this study, we propose a novel mission planning scheme based on target scheduling and deviation correction method incorporating weather factors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.175-182
• /
• 2011

This paper presents a novel eight-parallel 128/256-point mixed-radix multi-path delay commutator (MRMDC) FFT/IFFT processor for orthogonal frequency-division multiplexing (OFDM) systems. The proposed FFT architecture can provide a high throughput rate and low hardware complexity by using an eight-parallel data-path scheme, a modified mixed-radix multi-path delay commutator structure and an efficient scheduling scheme of complex multiplications. The efficient scheduling scheme can reduce the number of complex multipliers at the second stage from 88 to 40. The proposed FFT/IFFT processor has been designed and implemented with the 90nm CMOS technology. The proposed eight-parallel FFT/IFFT processor can provide a throughput rate of up to 27.5Gsample/s at 430MHz.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.3
• /
• pp.77-86
• /
• 2012

We consider the capacitated lot-sizing and scheduling problem for a paper remanufacturing system that produces several types of corrugated cardboards. The problem is to determine the lot sizes as well as the sequence of lots for the objective of minimizing the sum of setup and inventory holding costs while satisfying the demand and the machine capacity over a given planning horizon. In particular, the paper remanufacturing system has sequence-dependent setup costs that depend on the type of product just completed and on the product to be processed. Also, the setup state at one period can be carried over to the next period. An integer programming model is presented to describe the problem. Due to the complexity of the problem, we modify the existing two-stage heuristics in which an initial solution is obtained and then it is improved using a multi-pass interchange method. To show the performances of the heuristics, computational experiments were done using the real data, and a significant amount of improvement is reported.

• Proceedings of the KSR Conference
• /
• 1999.11a
• /
• pp.46-53
• /
• 1999

As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.49-56
• /
• 2010

In this paper, a joint PHY-MAC layer optimized resource allocation scheme for OFDMA based micro base stations is investigated. We propose cross-layer optimized two-stage resource allocation scheme including cross-layer functional description and control information flow between PHY-MAC layers. The proposed two-stage resource allocation scheme consists of a user grouping stage and a resource allocation stage. In the user grouping stage, users are divided into a macro base station user group and a micro base station user group based on the PHY-MAC layer characteristics of each user. In the resource allocation stage, a scheduling scheme and an allotment of resources are determined. In the proposed scheme, diversity and adaptive modulation and coding (AMC) schemes are exploited as schedulers. Simulation results demonstrate that the proposed scheme increases the average cell throughput about 40~80 % compared to the conventional system without micro base stations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1076-1084
• /
• 2012

In the CS/CB(Coordinated Scheduling/Beamforming) scheme, the cell edge user throughput is increased by selecting MIMO (Multiple Input Multiple Output) precoders which can minimize the interferences from adjacent base stations (BSs). However, in current LTE(Long Term Evolution) systems, the serving cell is selected in the initialization stage by using the synchronization signals and cell specific reference signals transmitted by adjacent BSs with a single antenna. The selected BS in the initialization stage may not be the best one since the MIMO precoding gain has not been considered in the cell selection stage. In this paper, a new cell selection technique is proposed for LTE systems with MIMO precoder by taking into account the effect of the precoder in the initialization stage. The proposed technique enables a user equipment (UE) in the cell boundary to select the serving BS by using the information (channel rank, effective channel capacity, and effective SINR(Signal to Interference plus Noise Ratio)) acquired from cell specific reference signals of candidate BSs. It is verified by computer simulation that the proposed technique can increase the channel capacity significantly in the multi-cell environments, compared with the conventional CS/CB scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.783-787
• /
• 2008

IEEE 802.16/WiBro, one of the representative Broadband Wireless Access (BWA) systems, defines QoS negotiation between BS and SS and five service classes to guarantee QoS for flows. The five service classes are UGS, ertPS, rtPS, nrtPS, and BE, but the standard does not define how to provide services to flows according to the service classes. Existing research works have been studied about the scheduler architecture to effectively utilize the IEEE 802.16/WiBro systems. These works use the original packet scheduling algorithm for service classes. However, it is necessary to consider bandwidth allocation mechanisms in scheduling algorithms since bandwidth allocation mechanisms are different according to service classes. Especially, bandwidth allocation mechanisms should be considered for the scheduling of rtPS class since rtPS class uses the polling mechanism that takes time to allocate bandwidth and has the minimum latency constraint. Therefore, we propose two stage dropping scheme for rtPS class that is sensitive to latency, and thus it reduces the wasted resources and provides efficient service to rtPS class.

• Journal of Preventive Medicine and Public Health
• /
• v.39 no.4
• /
• pp.346-352
• /
• 2006

Objectives: The purposes of this study were to propose a screening schedule for the early detection of breast cancer among Korean women, as based on the statistical model, and to compare the efficacy of the proposed screening schedule with the current recommendations. Methods: The development of the screening schedule for breast cancer closely followed the work of Lee and Zelen (1998). We calculated the age-specific breast cancer incidence rate from the Korea Central Cancer Registry (2003), and then we estimated the scheduling of periodic examinations for the early detection of breast cancer, using mammography, and based on the threshold method. The efficacy of the derived screening schedule was evaluated by the schedule sensitivity. Results: For estimating the screening schedule threshold method, we set the threshold value as the probability of being in the preclinical stage at age 35, the sensitivity of mammography as 0.9 and the mean sojourn time in the preclinical stage as 4 years. This method generated 14 examinations within the age interval [40, 69] of 40.0, 41.3, 42.7, 44.1, 45.4, 46.7, 48.0, 49.3, 51.0, 53.2, 55.3, 57.1, 59.0 and 63.6 years, and the schedule sensitivity was 75.4%. The proposed screening schedule detected 85.2% (74.5/87.4) of the cases that could have been detected by annual screening, but it required only about 48.7% (14.0/30.0) of the total number of examinations. We also examined the threshold screening schedules for a range of sensitivities of mammography and the mean sojourn time in the preclinical stage. Conclusions: The proposed screening schedule for breast cancer with using the threshold method will be helpful to provide guidelines for a public health program for choosing an effective screening schedule for breast cancer among Korean women.