• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.267-270
• /
• 2001

A lot of efforts have been made to analyze the performance of the vehicle equipped with automatic transmission through simulation. It might be necessary to understand the different types of transmissions, i.e., different power flows, for different models. If there is a module that can be applied to different types of automatic transmission, it could be helpful to transmission-related engineers. This study has started up from this idea. The common bond graph has been obtained from several types of the automatic transmission. The overall generalized equations and kinematic constraint equations have been derived using virtual power sources on common bond graph. They are used to derive state equations and constraints. These equations have been applied as an application to the vehicle equipped with two simple planetary gear set type of Ravigneaux gear type automatic transmission. The state equation, kinematic constraints, and dynamic constraints have been derived in every gear and shift operation using overall generalized equations and kinematic constraint equations. Simulations for constraint speed running, standing-start running, rolling-start running, and LA-4 mode have been conducted to analyze the performance of the vehicle powertrain using GVPS(Generalized Vehicle Powertrain Simulation) program wit pull down menus.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1896-1907
• /
• 1998

확장된 마크흐름선도(EMFG: Extednded Mark Flow Graph)는 기존의 MFG를 개선한 그래프로서, 회로변수식에 의해 실제회로로 쉽게 구현가능하므로 이산제어시스템의 모델링과 설계 및 구현의 강력한 도구로 사용될 수 있다. 본 논문은 EMFG의 트랜지션들이 점화하는 과정 및 트랜지션들이 점화완료하였을 때 각 박스들의 마크수 변화를 부울함수식과 벡터를 사용하여 표현하였다. 또한 시스템의 상태변화를 쉽게 판단할 수 있게 하는 EMFG의 동작알고리듬을 제안하였으며, 제안된 알고리듬은 3-비트 증가계수기를 설계한 EMFG와 시간트랜지션이 포함된 가상의 EMFG에서 잘 수행되었다. EMFG의 동작이 부울함수로 해석가능해짐으로 인해 시스템의 분석 및 설계가 용이하며 컴퓨터를 이용한 자동화된 시스템의 분석과 설계가 가능하다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1765-1770
• /
• 2006

본 논문에서는 반도체 fab 라인의 물류 설비를 event graph로 모델링 하는 방법론을 제안하고 있다. 최근 반도체 fab 라인 같은 대표적인 자본 집약적 제조라인에서는 운영단계에서 투입 계획, PM schedule 및 operation rule 등을 변화시켜 가며 평가 및 검증해 볼 수 있는 what-if simulation을 위한 line simulator의 필요성이 점점 높아지고 있다. 그러나 상용 simulator는 각 제조라인의 특성에 맞게 customization하는데 많은 시간과 비용이 소요될 뿐만 아니라 특성을 반영하는데 한계가 있다. 따라서 이러한 line simulator를 개발할 때 근간이 되는 설비의 simulation model이 필요하다. 이 때 설비들은 생산(processing) 및 물류(handling) 설비로 나눌 수 있는데, 본 논문에서는 반도체 fab 라인의 물류 설비 모델링 방법을 제시하고 실제 물류 설비를 모델링 해 봄으로써 그 효용성을 알아본다.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.6
• /
• pp.90-101
• /
• 1996

Determination of assembly sequence of components is a key issue in assembly operation. Although a number of articles dealing with assembly sequence determination have appeared, an efficient and general methodology for complex products has yet to appear. The objective of this paper is to present the problems and models used to generate assembly sequence from design data. An essential idea of this research is to acquire a finite number of voxels from any complex geometric entity, such as 3D planar polygons, hollow spheres, cylinders. cones, tori, etc. In order to find a feasible assembly sequence, the following four steps are needed: (1) The components composing of an assembly product are identified and then the geometric entities of each component are extracted. (2) The geometric entities extracted in the first step are translated into a number of voxels. (3) All the mating or coupling relations between components are found by considering relations between voxels. (4) The components to be disassembled are determined using CCGs (Component Coupling Graph).

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.521-524
• /
• 1988

This paper describes BSDL(Behavioral/Structural Description Language), CDTF(Control Data Text File) and state synthesizer built for use in ICSC(InCheon Silicon Compiler). BSDL describes structral and behaviral specifications of an ASIC(Application Specific IC) for digital system design. ICSC's paser generates CDTF consists of if-then-else, arithmetic and data transfer statement according to each BSDL statement. State synthesizer generates CCG(Control Constraint Graph) in consideration of execution of statement and generates VCG (Variable Constraint Graph) in consideration use of variable generation and use of variable. Also, it involves allocating algorithm operation nodes in the data path and the control path to machine states with minimum state number and as small area as possible.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.226-229
• /
• 1987

This paper was aimed to, using a new data structure, develop a set of algorithms to execute the output function of Digital System. These functions were represented as directed, acyclic graphs. by applying many restrictions on vertices on graph, the efficient manipulation of boolean function was accomplished. The results were as follows; 1. A canonical representation of a boolean function was created by the reduction algorithm. 2. The operation of two functions was accomplished using t he apply algorithm, according to the binary operator. 3. The arguments having 1 as the value nf function were enumerated using the satisfy algorithm. 4. Composing TTL 74181 4-bit ALU and 74182 look-ahead carry generator, the ALU having 4-bit and 16-bit as word size was implemented.

• The Pure and Applied Mathematics
• /
• v.26 no.3
• /
• pp.177-188
• /
• 2019

Suppose G is a molecular graph with edge set E(G). The hyper-Zagreb index of G is defined as $HM(G)={\sum}_{uv{\in}E(G)}[deg_G(u)+deg_G(v)]^2$, where $deg_G(u)$ is the degree of a vertex u in G. In this paper, all chemical trees of order $n{\geq}12$ with the first twenty smallest hyper-Zagreb index are characterized.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.364-370
• /
• 2011

The Hilbert transform performs a role to transform band pass signals into low pass signals in wireless communication systems. The operation of Hilbert transform is based on a convolution process which is required adding and multiplying calculations. When the Hilbert transform is designed and hardware-implemented at gate level, the adding and multiplying operation requires a high power consumption and a occupation of wide area on a chip. So the results of adding and multiplying operation cause to degrade the performance of implemented system. In this paper, the new Hilbert transformer is proposed, which has a low hardware complexity by application of MAG(Minimum Adder Graph) algorithm. The proposed Hilbert transformer was simulated in ISE environment of Xilinx and showed the reduction of hardware complexity comparing with the number of gate in the conventional Hilbert transformer.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.877-882
• /
• 2005

The definition of multi-coupled operation is that coupled two trainsets is able to be operated one trainset identically. That is to say, the one driver, coupled two trainsets can operate the traction and braking system, control vehicle doors, phanto-graph, HVAC and passenger room lighting system etc, such as one trainset controlling. This study will provide high speed train design engineer with introducing multi-coupled operation system electrically and presentation automatic complex coupler mechanism, and then this paper will be applied to design next generation high speed train system such as Jun-la/Ho-nam line