• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.60-67
• /
• 2014

This paper considers an inbound ordering and outbound dispatching problem for multi-products and multi-vehicles in a third-party distribution center. The demands are dynamic over a discrete and finite time horizon, and replenishing orders are shipped in various transportation modes and the freight cost is proportional to the number of vehicles used. Any mixture of products is loaded onto any type of vehicles. The objective of the study is to simultaneously determine the inbound lot-sizes, the outbound dispatching sizes, and the types and numbers of vehicles used to minimize total costs, which consist of inventory holding cost and freight cost. Delivery time window is one of the general dispatching policies between a third-party distribution center and customers in practice. In the policy, each demand of product for a customer must be delivered within the time window without penalty cost. We derive mixed integer programming models for the dispatching policy with delivery time windows and on-time delivery dispatching policy, respectively and analyze the effect on a dispatching policy with delivery time windows by comparing with on-time delivery dispatching policy using various computational experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.3
• /
• pp.173-181
• /
• 2016

This paper deals with the single-hoist and multiple-products scheduling problem. Although a mixed integer linear programming model for the problem was developed earlier, a branch-and-bound based heuristic algorithm is proposed in this paper to solve the big-size problems in real situation. The algorithm is capable of handling problems incorporating different product types, jobs in the process, and tank capacities. Using a small example problem the procedure of the heuristic algorithm is explained. To assess the performance of the heuristic we generate a bigger example problem and compare the results of the algorithm proposed in this paper with the optimal solutions derived from the mathematical model of earlier research. The comparison shows that the heuristic has very good performance and the computation time is sufficiently short to use the algorithm in real situation.

• Journal of the Korean Institute of Navigation
• /
• v.8 no.1
• /
• pp.1-16
• /
• 1984

The economical property of a shipping enterprise, as well as other transportation industries, is determined by the difference between the freight earned and expense paid. This study can be regarded as a division of optimizing ship allocation to routes under the integrated port transport system. Fleet planning and scheduling require complicated allocations of cargoes to ships and ships to routes in order to optimize the given criterion function for a given forecast period. This paper deals with the optimum ship allocation problem minimizing the operating cost of ships in a shipping company. Optimum fleet operating for a shipping enterprise is very important, since the marine transportation is a form of large quantity transport requiring long-term period, and there is a strong possibility to bring about large amount of loss in operation resulting from a faulty ship allocation. Where there are more than one loading and discharging ports, and a variety of ship's ability in speed, capacity, operating cost etc., and when the amount of commodities to be transported between the ports has been determined, then the ship's schedule minimizing the operating cost while satisfying the transport demand within the predetermined period will be made up. First of all a formula of ship allocation problems will be established and then will be constructed to solve an example by the Integer Programming application after consideration of the ship's ability, supply and demand of commodity, amount of commodity to be transported, operating costs of each ship etc. This study will give good information on deciding intention for a ship oprator or owner to meet the computerization current with shiping management.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.4
• /
• pp.81-86
• /
• 2023

Recently, demand for embedded systems requiring low power and high specifications has been increasing, and RISC-V processors are being widely applied. RISC-V, a RISC-based open instruction set architecture (ISA), has been developed and researched by UC Berkeley and other researchers since 2010. RV32I ISA is sufficient to support integer operations such as addition and subtraction instructions, but M-extension should be defined for multiplication and division instructions. This paper proposes an RV32I, RV32IM processor, and indicates benchmark performance scores compared to an existing processor. Additionally, A non-stalling method was proposed to support a 2-stage pipelined DSP multiplier to the 5-stage pipelined RV32IM processor. Proposed RV32I and RV32IM processors satisfied a maximum operating frequency of 50 MHz on Artix-7 FPGA. The performance of the proposed processors was verified using benchmark programs from Dhrystone and Coremark. As a result, the Coremark benchmark results of the proposed processor showed that it outperformed the existing RV32IM processor by 23.91%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.25-44
• /
• 2010

With the increasing popularity of mobile devices, it has become necessary to protect private information and content in these devices. Face recognition has been favored over conventional passwords or security keys, because it can be easily implemented using a built-in camera, while providing user convenience. However, because mobile devices can be used both indoors and outdoors, there can be many illumination changes, which can reduce the accuracy of face recognition. Therefore, we propose a new face recognition method on a mobile device robust to illumination variations. This research makes the following four original contributions. First, we compared the performance of face recognition with illumination variations on mobile devices for several illumination normalization procedures suitable for mobile devices with low processing power. These include the Retinex filter, histogram equalization and histogram stretching. Second, we compared the performance for global and local methods of face recognition such as PCA (Principal Component Analysis), LNMF (Local Non-negative Matrix Factorization) and LBP (Local Binary Pattern) using an integer-based kernel suitable for mobile devices having low processing power. Third, the characteristics of each method according to the illumination va iations are analyzed. Fourth, we use two matching scores for several methods of illumination normalization, Retinex and histogram stretching, which show the best and $2^{nd}$ best performances, respectively. These are used as the inputs of an SVM (Support Vector Machine) classifier, which can increase the accuracy of face recognition. Experimental results with two databases (data collected by a mobile device and the AR database) showed that the accuracy of face recognition achieved by the proposed method was superior to that of other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.569-580
• /
• 2012

In this paper, an enhanced initial ranging algorithm for large-cell coverage fixed wireless communication system is proposed. In typical wireless communication system such as WiBro, because a round-trip delay between a transmitter and a receiver is within one OFDM (Orthogonal Frequency Division Multiplexing) symbol duration, a frequency-domain differential correlation method is generally used. However, the conventional method cannot be applied due to an increase of a maximum time delay in large-cell system. In case of an accumulative differential method, estimation errors can occur because of frequent sign transitions. In this paper, therefore, we propose an algorithm which can estimate a total timing offset in a ranging channel structure for 15 km cell. The proposed method can improve performance by sign comparison based sign error correction rule between the estimated values and using a weighting scheme based on channel correlation, the number of accumulations, and the noise reduction effect in normalization process. Also, it can estimate the integer timing offset of symbol duration by comparing peak-powers after compensating for the fractional timing offset of symbol duration.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.1-8
• /
• 2002

This thesis is about power line communication(PLC) over the low voltage grid. The main advantage with power line communication is the use of an existing infrastructure. The PLC channel can be modeled as having multi-path propagation with frequency-selective fading, typical power lines exhibit signal attenuation increasing with length and frequency. OFDM(Orthogonal Frequency Division Multiplexing) is a modulation technique where multiple low data rate carriers are combined by a transmitter to form a composite high data rate transmission. To implement the multiple carrier scheme using a bank of parallel modulators would not be very efficient in analog hardware. Each carrier in an OFDM is a sinusoid with a frequency that is an integer multiple of a base or fundamental sinusoid frequency. Therefore, each carrier is a like a Fourier series component of the composite signal. In fact, it will be shown later that an OFDM signal is created in the frequency domain, and then transformed into the time domain via the Discrete Fourier Transform(DFT).

• ETRI Journal
• /
• v.28 no.3
• /
• pp.329-336
• /
• 2006

This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

• The Journal of Information Technology
• /
• v.6 no.2
• /
• pp.1-8
• /
• 2003

This paper is about power line communication(PLC) over the low power voltage grid. The main advantage with power line communication is the use of an existing infrastructure. The PLC channel can be modeled as having multi-path propagation with frequency-selective fading, typical power lines exhibit signal attenuation increasing with length and frequency. OFDM(Orthogonal Frequency Division Multiplexing) is a modulation technique where multiple low data rate carriers are combined by a transmitter to form a composite high data rate transmission. To implement the multiple carrier scheme using a bank of parallel modulators would not be very efficient in analog hardware. Each carrier in an OFDM is a sinusoid with a frequency that is an integer multiple of a base or fundamental sinusoid frequency. Therefore, each carrier is a like a Fourier series component of the composite signal. In fact, it will be shown later that an OFDM signal is created in the frequency domain, and then transformed into the time domain via the Discrete Fourier Transform(DFT).

• Journal of Navigation and Port Research
• /
• v.39 no.4
• /
• pp.353-360
• /
• 2015

The offshore oil production requires a huge amount of cost and time accompanied by multiple variables due to the peculiar nature of 'offshore'. And every process concerned is controlled by elaborate series of plans for reducing loss of lives, environment and property. This paper treats an optimization problem for offshore oil production and transportation. We present an offshore production and transportation network to define scope of the problem and construct a mixed integer linear programming model to tackle it. To demonstrate the validity of the optimization model presented, some computational experiments based on hypothetical offshore oil fields and demand markets are carried out by using MS Office Excel solver. The downstream of the offshore production and transportation network ends up with the maritime transportation problem distributing the crude oil produced from offshore fields to demand markets. We used MoDiSS(Model-based DSS in Ship Scheduling) which was built to resolve this maritime transportation problem. The paper concludes with the remark that the results of the study might be meaningfully applicable to the real world problems of offshore oil production and transportation.