• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.59-65
• /
• 2010

This paper proposes a modified heuristic mixed model assembly line (MMAL) balancing algorithm that provides consistent station assignments on a model by model basis as well as on a station by station. Basically, some of single model line balancing techniques are modified and incorporated to be fit into the MMAL. The proposed algorithm is based on N.T. Thomopoulos' [8] method and supplemented with several well proven single model line balancing techniques proposed in the literature until recently. Hoffman's precedence matrix [2] is used to indicate the ordering relations among tasks. Arcus' Rule IX [1] is applied to generate rapidly a fairly large number of feasible solutions. Consequently, this proposed algorithm reduces the fluctuations in operation times among the models as well as the stations and the balance delays. A numerical example shows that the proposed algorithm can provide a good feasible solution in a relatively short time and generate relatively better solutions comparing to other three existing methods.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.55
• /
• pp.243-264
• /
• 2012

This study is aimed to analyze problems related to FTA country of origin of goods verification which is increasing from 2006 and thereby to grope for solution of such problems and seek adequate FTA performance administration. It is found, through comparative analysis and statistics of last 8 FTAs so far Korea has concluded that there are major problems such as excessive verification processing due to complicated country of origin regulation etc. This paper suggests following policies of country of origin administration ; (1) Simplification of FTA country of origin rules (2) reciprocal cooperation between each country's Customs Authorities based on trust (3) rational measurement against corresponding country's Customs Authorities' misbehavior (4) enhancement of transparency in relation to processing rule of country of origin verification (5) securing FTA country of origin verification experts. For these improvements, upcoming FTA shall rule country of origin reasonably, simplification and transparency of rule is needed for established FTAs in relation to FTA performance administration with corresponding countries. Also it is necessary to revise FTA preferential tariff law and its related laws, and carry forward policies in accordance with medium and long term plan.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.99-104
• /
• 2003

In this research, we proposed the mechanism to develop self evolving expert systems (SEES) based on data mining (DM), fuzzy neural networks (FNN), and relational database (RDB)-driven forward/backward inference engine. Most former researchers tried to develop a text-oriented knowledge base (KB) and inference engine (IE). However, thy have some limitations such as 1) automatic rule extraction, 2) manipulation of ambiguousness in knowledge, 3) expandability of knowledge base, and 4) speed of inference. To overcome these limitations, many of researchers had tried to develop an automatic knowledge extraction and refining mechanisms. As a result, the adaptability of the expert systems was improved. Nonetheless, they didn't suggest a hybrid and generalized solution to develop self-evolving expert systems. To this purpose, in this study, we propose an automatic knowledge acquisition and composite inference mechanism based on DM, FNN, and RDB-driven inference. Our proposed mechanism has five advantages empirically. First, it could extract and reduce the specific domain knowledge from incomplete database by using data mining algorithm. Second, our proposed mechanism could manipulate the ambiguousness in knowledge by using fuzzy membership functions. Third, it could construct the relational knowledge base and expand the knowledge base unlimitedly with RDBMS (relational database management systems). Fourth, our proposed hybrid data mining mechanism can reflect both association rule-based logical inference and complicate fuzzy logic. Fifth, RDB-driven forward and backward inference is faster than the traditional text-oriented inference.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.10-19
• /
• 1999

Cellular Automata Neural Systems(CANS) are neural networks based on biological development and evolution. Each neuron of CANS has local connection and acts as a form of pulse according to the dynamics of the chaotic neuron. CANS are generated from initial cells according to the CA rule. In the previous study, to obtain the useful ability of CANS, we make the pattern of initial cells evolve. However, it is impossible to represent all solution space, so we propose an evolving method of CA rule to overcome this defect in this paper. DNA coding has the redundancy and overlapping of gene and is apt for the representation of the rule. In this paper, we show the general expression of CA rule and propose translation method from DNA code to CA rule. The effectiveness of the proposed scheme was verified by applying it to the navigation problem of autonomous mobile robot.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1387-1395
• /
• 2006

This paper considers testing for the ratio of two exponential means. We propose a solution based on a Bayesian decision rule to this problem in which no subjective input is considered. The criterion for testing is the Bayesian reference criterion (Bernardo, 1999). We derive the Bayesian reference criterion for testing the ratio of two exponential means. Simulation study and a real data example are provided.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1004-1007
• /
• 1992

In this paper, we present a solution to the PID tuning problem by optimizing a GPC(General Predictive Control) criterion. The PID structure is ensured by constraning the parameters to a feasible set defined by the discrete-time Euler approximation of the ideal continuous-time PID controller. The algorithm is ectended by incorporating heuristic rules for selection of the significant design parameters. The algorithm has been successfully tested and some results are prewented.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.2
• /
• pp.75-95
• /
• 1989

The study presents the optimum design of B/C midship structure based on the classification society's Rule. The SUMT (Sequential Unconstrained Minimization Technique), using the Direct Search Methods (Hooke and Jeeves, Simplex) is applied to the solution of this nonlinear optimum design problem with constraints. Through the optimum designs of existing ships(60k, 186k, 220k), the amount 0.45-6.18% in weight of their midship structures are obtained on the viewpoint of minimum weight design.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.391-392
• /
• 2007

Changeable biometries has been suggested as a solution to the problems of enhancing privacy. In this paper, we proposed changeable biometrics for face recognition using on ICA based approach. ICA coefficient vector extracted from an input face image. The vector is scrambled randomly and a new face template is generated by addition of a couple of scrambled coefficients. When a transformed template is compromised, it is replaced by a new scrambling rule and addition.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.301-306
• /
• 2000

최근 데이터 웨어하우징의 활발한 구축과 우수고객 확보를 위한 치열한 경쟁으로 데이터 마이닝은 많은 업체의 큰 관심을 끌고있다. 본 연구는 풍부한 알고리즘과 과학적 그래프를 제공하여 사용자로 하여금 최상의 데이터 마이닝 효과를 거둘 수 있도록 Statserver를 핵심 엔진으로 사용한 인터넷 기반의 데이터 마이닝 솔루션 개발에 관한 편이다