• 반도체디스플레이기술학회지
• /
• 제1권1호
• /
• pp.21-28
• /
• 2002

This paper presents a dynamic modeling and a robust PID controller design process for the wire bonder head assembly. For modeling elements, the system is divided into electrical part, magnetic part, and mechanical part. Each part is modeled using the bond graph method. The PID controller is used for high speed/high accuracy position control of the wire bonder assembly. The Taguchi method is used to obtain the more robust PID gain combinations than conventional one. This study makes use of an L18 array with three parameters varied on three levels. Results of simulations and experimental show that the designed PID controller provides a improved ratio of signal to noise and a reduced sensitivity improved to the conventional PID controller.

• Journal of Electrical Engineering and Technology
• /
• 제9권3호
• /
• pp.848-858
• /
• 2014

In this paper the construction of a model that represents the behavior of an Electric Vehicle is described. Both the mechanical and the electric traction systems are represented using Multi-Bond Graph structural approach suited to model large scale physical systems. Then the model of the controllers, represented with a functional approach, is included giving rise to an integrated model which exploits the advantages of both approaches. Simulation and experimental results are aimed to illustrate the electromechanical interaction and to validate the proposal.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.747-753
• /
• 2001

This paper presents a dynamic modeling and a robust PID controller design process for the wire bonder head assembly. For the modeling elements, the system is divided into electrical system, magnetic system, and mechanical system. Each system is modeled by using the bond graph method. The PID controller is used for high speed/high accuracy position control of the wire bonder assembly. The Taguchi method is used to evaluate the more robust PID gain combinations. This study makes use of an L18 array with three parameters varied on three levels. Computer simulations and experimental results show that the designed PID controller provides more improved signal to noise ratio and reduced sensitivity than the conventional PID controller.

• Journal of Power Electronics
• /
• 제11권4호
• /
• pp.439-448
• /
• 2011

In this work the Multi-Domain model of an electric vehicle is developed. The electric domain model consists on the traction drive and allows including faults associated with stator winding. The thermal model is based on a spatial discretization. It receives the power dissipated in the electric domain, it interacts with the environment and provides the temperature distribution in the induction motor. The mechanical model is a half vehicle model. Given that all models are obtained using the same approach (Bond Graph) their integration becomes straightforward. This complete model allows simulating the whole system dynamics and the analysis of electrical/mechanical/thermal interaction. First, experimental results are aimed to validate the proposed model. Then, simulation results illustrate the interaction between the different domains and highlight the capability of including faults.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2007년도 춘계학술대회 논문집
• /
• pp.315-316
• /
• 2007

• 동력기계공학회지
• /
• 제14권3호
• /
• pp.77-82
• /
• 2010

In general, the control valves are essential components in hydraulic systems. Structural changes within the valves remain a challenge because many parameters of valve tend to interact in terms of static and dynamic performance. Therefore, the valve characteristics is applied directly to the stability of hydraulic system. Inner structure of the valve which is used mainly in the industries is made up poppet type and spool type. This paper made a description of the method for numerical analysis and modeling of the valve with a built-in moving part of four-type. Based on the physical parameters of the valves, a numerical model of objected valve is developed using the bond graph method. It is to verified the results that the moving part of four-type has an effect on pressure and flow characteristics. Also, It is analyzed the results which has an effect on response characteristic by angular of poppet valve face and inertia variation of the valve with a built-in moving part. In the results, it is confirmed that the rising and settling time vary with the shape of moving part in valve.

• 한국자동차공학회논문집
• /
• 제9권3호
• /
• pp.100-107
• /
• 2001

The main goals of the automotive suspension systems are to isolate roadway unevenness from the tire and to improve vehicle stability. To overcome the performance limitation of the passive systems the active systems which completely replace the passive spring and damper elements with a force generating actuator has been studied. However, application of the system has been limited because it has required a significant amount of power. Recently, alternative systems which retain passive elements but include active elements have been developed to reduce the power required. Those systems are mostly focused on the control system which compresses the spring-damper directly. In this study, a new type of power efficient control system which makes the spring-damper unit slide in side way is studied. After constructing the control system including dynamic modeling and motion control, two types of alternative control systems are compared in view of power consumption and dynamic attitudes such as roll responses as well as heave responses. Also, a half car bond graph model is developed to show clearly the significant differences in performances between two control systems.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제11권1호
• /
• pp.154-164
• /
• 2019

A rotor dynamic analysis is mandatory for stability and design optimization of submerged propellers and turbines. An accurate simulation requires a proper consideration of fluid-induced reaction forces. This paper presents a bi-directional coupling of a bond graph method solver and an unsteady vortex lattice method solver where the former is used to model the rotor dynamics of the power train and the latter is used to predict transient hydrodynamic forces. Due to solver coupling, determination of hydrodynamic coefficients is obsolete and added mass effects are considered automatically. Additionally, power grid and structural faults like grid fluctuations, eccentricity or failure could be investigated using the same model. In this research work a fast, time resolved dynamic simulation of the complete power train is conducted. As an example, the rotor dynamics of a tidal stream turbine is investigated under two inflow conditions: I - shear flow, II - shear flow + water waves.

• 한국정밀공학회지
• /
• 제13권7호
• /
• pp.90-99
• /
• 1996

In the area of assembly process of micro-chips and electronic parts on the printed circuit board, surface mounting device(SMD) is used as a fundamental tool. Generally speaking, the motion of the SMD is based on the ball screw system operated by any type of actuators. The ball screw system is a mechanical transformed which converts the mechanical rotational motion to the translational one. Also, this system could be considered as an efficient motion device against mechanical backlash and friction. Therefore a dynamic modeling and state sensitivity analysis of the ball screw system in SMD have to be done in the initial design stage. In this paper, a simple mathematical dynamic model for this system and the sensit- ivity analysis are mentioned. Especially, the bond graph approach is used for graphical modeling of the dynamic system before analysis stage. And the direct differentiation method is used for the state sensit- ivity analysis of the system. Finally, some trends for the state variables with respect to the design variables could be suggested for the better design and faster operating based on the results of dynamic and state sensitivity.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.