• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.2
• /
• pp.84-91
• /
• 2002

The progress of information technology triggered the rapid progress of tourism industry and the industry has now grown to be the biggest and the highest value added producing industry. Tourism industry is characterized by its high information dependency and is subject to the frequent changes of schedule. Therefore, dynamic cooperations between the service provider and the service agent is essential. One of the latest trend in information technology is the popular adoption of XML as the standard means of document exchange in the internet environment. This paper proposes a supply chain management system which enhances the productivity and customer satisfaction in the tourism industry by exploiting the exchange of information in XML among the tourism society, which consists of the producer, the agents, and the consumer. This Paper is especially addressed to the applicability of e-SCM for the productivity enhancement in the tourism industry, which is known as the leading service industry in the internet environment.

• IE interfaces
• /
• v.11 no.2
• /
• pp.159-176
• /
• 1998

In the motor manufacturing system with the properties of short delivery and order based production, the process plan is performed individually for each order by the expert of process plan after the completion of the detail design process to satisfy the specification to be required by customer. Also it is hard to establish the standard process plan in reality because part routings and operation times are varied for each order. Hence, the production planner has the problem that is hard to establish the production schedule releasing the job to the factory because there occurs the big difference between the real time to be completed the process plan and the time to be required by the production planner. In this paper, we study the decision supporting system for the process plan based on knowledge base concept. First, we represent the knowledge of process planner as a database model through the modified POI-Feature graph. Then we design and implement the decision supporting system imbedded in the heuristic algorithm in the client/server environment using the ORACLE relational database management system.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.21 no.4
• /
• pp.69-82
• /
• 1994

The purpose of this study is to estimate the probable period of the planting work in consideration of weather factors. The impact degree of weather factors on the control of planting schedule was measured by the possible working days on the basis of weather condition. To establish the weather standard, the researcher analyzed the questionnaires on the manager of planting work and also the meteorological data for 10 years(1983-1992) in Seoul. The results are as follows; $\circled1$ The possible period of the planting work is from March 17 to May 18 Spring and from September 26 to December 15 in Autumn during a year. $\circled2$ The problem working days of the planting work(106-130) days per year) are less than the building construction days(174 days per year), because of handling the living material of plants, specially in summer and winter.

• The Journal of Engineering Research
• /
• v.4 no.1
• /
• pp.35-45
• /
• 2002

This paper deals with the scheduling problems which are the most important subtask in High-Level Synthesis. Especially, we have concentrated our attentions on the data-path scheduling which can get the structural informations from the behavioral algorithm as a first step in synthesis procedure. Suggest Forward scheduling methode is executed the ASAP and ALAP scheduling to use the fifth – order elliptic wave filter of a standard benchmark model, and then it is drawing up T.N matrix table by the number of resource and control-step, using the table extract of the simple than down-limit value of the control-step for the number of given resource to use this table. All of existing list scheduling techniques determine the priority functions first, and then do the operation scheduling, But, the suggested forward scheduling technique does the schedule first, and determines the priority functions if needed in scheduling process.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.739-748
• /
• 2007

The objective of this research study is to develop the permutation-based genetic algorithm for solving the resource-constrained project scheduling problem in construction engineering by incorporating elitism into genetic algorithm. A key aspect of the algorithm was the development of the elitist roulette selection operator to preserve the best individual solution for the next generation so the improved solution can be obtained. Another notable characteristic is the application of the parallel schedule generation scheme to generate a feasible solution to the problem. Case studies with a standard test problem were presented to demonstrate the performance and accuracy of the algorithm. The computational results indicate that the proposed algorithm produces reasonably good solutions for the resource-constrained project scheduling problem.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.992-995
• /
• 2005

Partnering has taken root all over the world as a remedy for the adversarial relation between parties concerned with construction projects. It is deemed to be derived from Keiretsu in Japan where parties related cooperate with one another as a team gaining reputations for completing projects on schedule and budget while maintaining high standard of quality. However, Keiretsu is now being weakened in proportion to the economic recession and there is an important change that needs to happen in the industry. The aims of this study are to find out the essence of Keiretsu by comparing Keiretsu with Partnering and to look for the direction of the reform plan.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.

• Journal of Aerospace System Engineering
• /
• v.12 no.4
• /
• pp.35-48
• /
• 2018

The space qualification has to be conducted by a high level of screening to ensure the design margin of devices, materials, manufacturing processes, units, modules, and subsystem or system. The space qualification according to traditional test standards proposed by US military, NASA and ESA involve high cost and tight schedule due to their conservative requirements. It is necessary to develop a space qualification guideline that is cost-efficient and schedule-optimized for the development of domestic satellites. In this study, as a basic research to develop the space qualification guideline, the articles related to space qualification in test standards document released from military and space agency have been investigated. We are planning to utilize the results as a basic database for establishing the independent tailored space qualification guideline.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.11
• /
• pp.54-64
• /
• 2010

Reed-Solomon (RS) codes are the most widely used error correcting codes in digital communications and data storage. Recently, Sudan found algorithm of list decoder for RS codes. List decoder has larger decoding radius than conventional hard-decision decoding algorithms and return more than one candidate polynomial. But, the algorithm includes interpolation and factorization step that demand massive computations. In this paper, an efficient architecture and processing schedule are proposed. The architecture consists of R-MAC, memories, and control unit. The R-MAC computes both of RC and PU steps that are main part of the factorization algorithm. The proposed architecture can achieve higher hardware utilization efficiency (HUE) and throughput by using efficient processing schedule and memory architecture. Also, the architecture can be designed flexibly with scalability for various applications. We design and synthesize our architecture using Dongbu-Anam $0.18{\mu}m$ standard cell library and the maximum clock frequency is 330MHz.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2006.11a
• /
• pp.45-52
• /
• 2006

Recently The public project ordering in local autonumous entities is a tendency increasing of CM service because of the visible and affirmative effect in the CM which is advanced meanwhile. And, the CM services of project all phase excepts a planning business are performed. To develop CM must be prepared the system plans concerned with the CM application from planning phase, actuality maintenance of CM fee-estimation standard, understanding conversion of participation subjects, the specialization through certification of CM qualification, etc. But, unexpected actuality the problems occurs when the CM business is performing. The purpose of this study are to present the solution to the problems concerned with the design management, design phase VE, additional business by owner, schedule control and establish the plan to perform CM services efficiently in the public sector through analyzing the case of CM application in Susung Culture & Art Center.