• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.15 no.1
• /
• pp.70-75
• /
• 2006

This paper represents a study on disassembly sequence generation system for automobile parts. This system is practically very useful because proper disassembly sequence of end-of-life product becomes crucial as take-back obligations are imposed for environmental reasons. Therefore a disassembly sequence generation system is suggested to automatically derive all the feasible disassembly sequences from the assembly modeling files. As a result, in consideration of the all parts and subassemblies the optimum disassembly sequence is generated. And the optimum disassembly sequence for a certain part or subassembly can be also suggested.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.244-253
• /
• 2001

For more complete process planning, machining sequence determination is critical to attain machining economics. Although many studies have been conducted in recent years, most of them suggests the non-unique machining sequences. When the tool approach directions(TAD) are considered fur a feature, both machining time and number of setups can be reduced. Then, the unique machining sequence can be extracted from alternate(non-unique) sequences by minimizing the idle time between operations within a sequence. This study develops an algorithm to generate the best machining sequence for composite prismatic features in a vertical milling operation. The algorithm contains five steps to produce an unique sequence: a precedence relation matrix(PRM) development, tool approach direction determination, machining time calculation, alternate machining sequence generation, and finally, best machining sequence generation with idle times. As a result, the study shows that the algorithm is effective for a given composite feature and can be applicable fur other prismatic parts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3182-3196
• /
• 2012

In this paper, we present a new LED (Light Emitting Diode) mood lighting system interacting with smartphones based on the generation of different light sequences. In the proposed system, one light sequence is considered to be one unit of the service contents, which is then transmitted through a network and played in an LED lighting system. To this end, we propose a novel generation scheme using a smartphone, and a decoding/playing mechanism in an LED lighting system. The lighting sequences have a fixed period divided into predefined time units. Two modes - basic and interpolation - are supported in each time unit when playing a color sequence. In the basic mode, the color is maintained for the entire time unit, whereas in the interpolation mode the color is interpolated. The sequence is decoded and played in the lighting circuit by changing the duty cycle of a PWM (Pulse Width Modulation) signal. A demonstration system of the overall proposed method was using smartphones, a server and an LED lighting system. The results from this experiment show the validity and applicability of the proposed scheme.

• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.211-216
• /
• 2016

현재 나오는 많은 음성 인식기가 대체로 높은 정확도를 가지고 있더라도, 음성 인식 오류는 여전히 빈번하게 발생한다. 음성 인식 오류는 관련 어플리케이션에 있어 많은 오동작의 원인이 되므로, 음성 인식 오류는 고쳐져야 한다. 본 논문에서는 Trie 기반 사전을 이용한 Guided Sequence Generation을 제안한다. 제안하는 모델은 목표 단어와 그 단어의 문맥을 Encoding하고, 그로부터 단어를 Character 단위로 Decoding하며 단어를 Generation한다. 올바른 단어를 생성하기 위하여, Generation 시에 Trie 기반 사전을 통해 유도한다. 실험을 위해 모델은 영어 TV 가이드 도메인의 말뭉치의 음성 인식 오류를 단순히 Simulation하여 만들어진 말뭉치로부터 훈련되고, 같은 도메인의 음성 인식 문장과 결과로 이루어진 병렬 말뭉치에서 성능을 평가하였다. Guided Generation은 Unguided Generation에 비해 14.9% 정도의 오류를 줄였다.

• Annual Conference on Human and Language Technology
• /
• 2016.10a
• /
• pp.211-216
• /
• 2016

현재 나오는 많은 음성 인식기가 대체로 높은 정확도를 가지고 있더라도, 음성 인식 오류는 여전히 빈번하게 발생한다. 음성 인식 오류는 관련 어플리케이션에 있어 많은 오동작의 원인이 되므로, 음성 인식 오류는 고쳐져야 한다. 본 논문에서는 Trie 기반 사전을 이용한 Guided Sequence Generation을 제안한다. 제안하는 모델은 목표 단어와 그 단어의 문맥을 Encoding하고, 그로부터 단어를 Character 단위로 Decoding하며 단어를 Generation한다. 올바른 단어를 생성하기 위하여, Generation 시에 Trie 기반 사전을 통해 유도한다. 실험을 위해 모델은 영어 TV 가이드 도메인의 말뭉치의 음성 인식 오류를 단순히 Simulation하여 만들어진 말뭉치로부터 훈련되고, 같은 도메인의 음성 인식 문장과 결과로 이루어진 병렬 말뭉치에서 성능을 평가하였다. Guided Generation은 Unguided Generation에 비해 14.9% 정도의 오류를 줄였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1267-1270
• /
• 1997

An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. to generate such sequences for robotic assembly, this paper proposes a method using a genetic algorithm (GA). This method denotes an assembly sequence as an individual, which is assigned a fitness related to the assembly cost. Then, a population consisting of a number of individuals evolves to the next generation through genetic operations of crossover and mutation based upon the fitness of the individuals. The population continues to repetitively evolve, and finally the fittest individual and its corresponding assembly sequence is found. Through case study for an electrical relay, the effectiveness of the proposed method is demonstrated. Also, the performance is evaluated by-comparing with those of previously presented approaches such as a neural-netowork-based method and a simulated annealing method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.1
• /
• pp.133-140
• /
• 2018

In this paper we discover the generation principle of a sequence when the characteristic polynomial of the sequence is a power of a primitive polynomial. With the generation principle, we can rearrange a sequence. Also we get the linear complexity and the required term of the sequence efficiently.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.463-467
• /
• 1992

This paper describes the automatic generation of sequence control programs for DCS(Distributed Control System), PLC(Programable Logic Controller) and so on. Since there is no same manufacturing process, it is difficult to standardize sequence programs. We propose the automatic sequence control program generator which is CAD software using knowledge engineering technique.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.32-37
• /
• 2016

In model-based testing using sequence diagrams, test cases are automatically derived from the sequence diagrams. For the generation of test cases, scenarios need to be found for representing as a sequence diagram, and to extract test paths satisfying the test coverage. However, it is hard to automatically extract test paths from the sequence diagram because a sequence diagram represents loop, opt, and alt information using CombinedFragments. To resolve this problem, we propose a transformation process that transforms a sequence diagram into an activity diagram which represents scenarios as a type of control flows. In addition, we generate test cases from the activity diagram by applying a test coverage concept. Finally, we present a case study for test cases generation from a sequence diagram.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.376-379
• /
• 2003

DNA computing based DNA sequence Is operated through the biology experiment. Biology experiment used as operator causes illegal reactions through shifted hybridization, mismatched hybridization, undesired hybridization of the DNA sequence. So, it is essential to design DNA sequence to minimize the potential errors. This paper proposes method of the DNA sequence generation based evolutionary operation processor. Genetic algorithm was used for evolutionary operation and extra hardware, namely genetic algorithm processor was implemented for solving repeated evolutionary process that causes much computation time. To show efficiency of the Proposed processor, excellent result is confirmed by comparing between fitness of the DNA sequence formed randomly and DNA sequence formed by genetic algorithm processor. Proposed genetic algorithm processor can reduce the time and expense for preparing DNA sequence that is essential in DNA computing. Also it can apply design of the oligomer for development of the DNA chip or oligo chip.