• The Journal of Information Systems
• /
• v.9 no.1
• /
• pp.235-255
• /
• 2000

Facing in very rapidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.19 no.1
• /
• pp.94-100
• /
• 2010

Nowadays, several nontraditional machining(NTM) processes are widely used to machine a complex and accurate shape part of hard materials, such as titanium, ceramics, high strength temperature resistant and refractory materials which are difficult to machine and having high strength, hardness, toughness. Machining of these complex shapes in such materials by traditional machining processes are very difficult. The NTM processes is important in the areas of micro- and nano scale machining, where high accuracy and superior surface characteristics are required, which can only be achieved using these NTM processes. So, for effective selection of different NTM processes, careful decision making for a given NTM application is often necessary. An appropriate NTM process for a given material and shape condition is very difficult for the novice engineers. In this paper, an expert system based on an analytic network process(ANP) is suggested for a best selection of NTM process in a NTM application considering an prior interdependency effect among various factors.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.53-62
• /
• 1994

Complex decision-making problems are often characterized by multicriteria phenomena and fuzziness inherent in the structure of information and therefore suitable scientific solution methods. Especially, when similar dependent criteria are introduced, the problems become more complex. This paper presents a fuzzy intersectional dependence relation model for this kind of multicriteria decision-making problems. The model we propose is based on the fuzzy relation from fuzzy systems theory. In ths case of introducing similar dependent criteria, the rank reversal by distortion of weights is hard to occur by our proposed method. A numerical example is presented to illustrate the use of the model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.268-271
• /
• 2011

본 논문에서는 지상파 3D HDTV 방송 서비스를 제공하기 위하여 기존의 유럽형 HDTV 방송 서비스인 DVB-T2 전송 시스템의 채널 부호군을 연구하고, 이 시스템의 외부 부호(Outer Code)로 쓰이는 BCH 부호의 경판정(Hard Decision)을 통한 복호를 연판정(Soft Decision)을 통한 복호로 수정함으로써 성능에 미치는 영향에 대해 살펴보았다. 또한 기존의 DVB-T2 전송시스템의 성능을 살펴보고, 이를 바탕으로 기존의 외부 부호(Outer Code)인 BCH 부호와 내부 부호(Inner Code)인 LDPC 부호의 조합을 연판정이 가능하고 복호하는 블록(Block)의 길이가 더 짧아진 BTC(Block Turbo Code)부호와 LDPC 부호와의 조합으로 바꿈으로써 기존의 DVB-T2 전송 시스템보다 블록 오류율이 낮아짐을 확인하였다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.211-214
• /
• 1998

TCM(Trellis-Coded Modulation)은 대역폭과 전력이 제한된 채널환경에서 채널부호화 기술과 변조기술을 결합시켜 대역폭의 증가없이 에러정정능력을 개선시키는 통신 기술이다. 본 논문에서는 TCM 신호의 복호시 사용되는 Viterbi decoder에서 traceback depth의 감소에 따른 BER(Bit Error Rate)의 증가를 개선하기 위해 수신부에서 설정하는 traceback depth를 주기로 blocking하여 TCM encoder의 입력시퀀스에 zero padding bits를 추가시키는 새로운 알고리듬을 제안한다. 모의실험결과, traceback depth가 50인 hard decision의 경우 약 2~2.5dB, 4-level soft decision과 8-level soft decision의 경우 약 0.3~2dB의 coding gain을 얻을 수 있었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.1
• /
• pp.53-73
• /
• 2002

The launch of a new business is crucial to the future growth and profitability of a company. A new business project typically requires a large amount of resources while it has a high possibility of failure. The evaluation of new business opportunities is therefore quite a critical decision-making to companies. This evaluation includes screening of a large number of criteria at a time which often makes desision-making very complicated. Management should evaluate the business alternatives in a sound and consistent manner that is hard to achieve because the new business evaluation is a typical semi/unstructured decision-making problem. The difficulty in such an evaluation will increase if it is required for management to consider both quantitative and qualitative criteria simultaneously. Under these circumstances, this study has proposed a decision-making framework that utilizes analytical hierarchy process(AHP). This study has identified a set of criteria essential to the new business evaluation and suggested a systematic framework for it. Both qualitative and quantitative evaluations are incorporated into the single framework in this study.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.9-15
• /
• 1990

A soft-decision decoding algorithm for linear binary block codes is proposed, for minimizing the block error probability. To compare the proposed algorithm with already established decoding methods, computer simulations are performed for the (7,4)Hamming code and the (23,12) Golay code. The average number of hard-decision decoding is always less then 2, and approaches to 1 when the signal to noise ratio is sufficiently large. These results show that the proposed algorithm reduces the decoding complexity.

• Korean Management Science Review
• /
• v.30 no.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.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2000.11a
• /
• pp.45-63
• /
• 2000

Facing in very repidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in Korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision. We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.275-288
• /
• 1997

The container transportation problem is a kind of generalized pickup and delivery problem(GPDP), and a typical NP-hard problem of which polynomial algorithm has not yet been developed. In this problem, trucks have to transport containers from origins to destinations, while have to satisfy several restrictions such as request time, cargo closing time, driver's break time. In this paper, we present a straightforward heuristic and a user-interactive truck dispatching system which supports decision makers.