• Journal of Power Electronics
• /
• v.11 no.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.

• Journal of Power System Engineering
• /
• v.14 no.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.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.709-726
• /
• 2018

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.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.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.511-524
• /
• 2023

An L(p₁, p₂, p₃, . . . , p_m)-labeling of a graph G is an assignment of non-negative integers, called as labels, to the vertices such that the vertices at distance i should have at least pi as their label difference. If p₁ = 4, p₂ = 3, p₃ = 2, p₄ = 1, then it is called a L(4, 3, 2, 1)-labeling which is widely studied in the literature. A L(4, 3, 2, 1)-path coloring of graphs, is a labeling g : V (G) → Z⁺ such that there exists at least one path P between every pair of vertices in which the labeling restricted to this path is a L(4, 3, 2, 1)-labeling. This concept was defined and results for some simple graphs were obtained by the same authors in an earlier article. In this article, we study the concept of L(4, 3, 2, 1)-path coloring for complete bipartite graphs, 2-edge connected split graph, Cartesian product and join of two graphs and prove an existence theorem for the same.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.469-473
• /
• 2013

Let G = (V, E) be a graph and k be a positive integer. A $k$-dominating set of G is a subset $S{\subseteq}V$ such that each vertex in $V{\backslash}S$ has at least $k$ neighbors in S. A Roman $k$-dominating function on G is a function $f$ : V ${\rightarrow}$ {0, 1, 2} such that every vertex ${\upsilon}$ with $f({\upsilon})$ = 0 is adjacent to at least $k$ vertices ${\upsilon}_1$, ${\upsilon}_2$, ${\ldots}$, ${\upsilon}_k$ with $f({\upsilon}_i)$ = 2 for $i$ = 1, 2, ${\ldots}$, $k$. In the paper titled "Roman $k$-domination in graphs" (J. Korean Math. Soc. 46 (2009), no. 6, 1309-1318) K. Kammerling and L. Volkmann showed that for any graph G with $n$ vertices, ${{\gamma}_{kR}}(G)+{{\gamma}_{kR}(\bar{G})}{\geq}$ min $\{2n,4k+1\}$, and the equality holds if and only if $n{\leq}2k$ or $k{\geq}2$ and $n=2k+1$ or $k=1$ and G or $\bar{G}$ has a vertex of degree $n$ - 1 and its complement has a vertex of degree $n$ - 2. In this paper we find a counterexample of Kammerling and Volkmann's result and then give a correction to the result.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.521-526
• /
• 2014

In this study, closed-cell aluminum foam with an initial crack was investigated to produce an axial load-time graph. Using the 10-kN Landmarks of MTS Corporation, a 15-mm/min velocity of mode I shape was applied to the aluminum foam specimen using the displacement control method. ABAQUS 6.10 simulation was used to model and analyze the identical model in three dimensions under conditions identical to those of the experiment. The energy release rate was calculated on the basis of an axial load-displacement graph obtained from the experiment and a transient image of the crack length, and then an FE model was analyzed on the basis of this fracture energy condition. The relation between load and displacement was discussed; it was found that the aluminum foam deformed somewhat less than the adhesive layer owing to the difference in elastic modulus.

• Journal of the Korean Institute of Educational Facilities
• /
• v.24 no.4
• /
• pp.15-24
• /
• 2017

This paper aims to investigate in what extent subject-centered clusters are different from one another in terms of message system, which is composed of curriculum, pedagogy and evaluation. For this, Bernstein's pedagogic transmission code(i.e., classification and framing) and school typology(i.e., open-type or close-type) have been explored, and then applied into Shimin Junior School, Japan, in order to find out substantial characteristics between subject-centered clusters. In this case study, VGA(visibility graph analysis), as one of syntactical methodologies in space syntax theory, has been used to measure to what degree they are actually different. Throughout in-depth investigation of spatial configurations, it can be said that the square of clusters is strongly connected and integrated very well, so that it acts as an anchor place for school life within a cluster. However, it works in different ways according to message systems. In the subjects like Japanese and Science whose message system are characterized by strong classification and strong framing, integration values are relatively low, and this means that it is hard to expect cross-referencing activities through the subject squares. On the contrary, the subject of Social Studies defined by weak classification and weak framing shows the highest mean integration values, and this can be expected that there are inter-changeable learning activities in the square.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.509-516
• /
• 2021

The transitive signature scheme is a technique that can be very useful when authenticating edges in a graph that is transitively closed. In other words, when there is an authentication value for an edge (i, j) and an authentication value for an edge (j, k), the authentication value for the edge (i, k) can also be calculated immediately without any separate authentication procedure through a transitive signature. In this paper, we propose the first identity-based transitive signature scheme. Our scheme is based on the lattice problem.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1507-1511
• /
• 1987

This paper proposes a NAND-NAND logic sequential Programmable Logic Array (PLA) using CMOS technology, and test generation methods about stuck-open faults. By using LSSD (Level Sensitive Scan Design) method instead of Flip-Flops in Sequential PLA, the complex test problems of sequential logic are simplified. After generating the test sets using connection graph, regular test sequences and all transistor faults detection method in PLA are proposed. Finally, by programming these algorithms in PASCAL at VAX 8700 and adopting these to pratical CMOS Sequential PLA circuits, we proved the effectiveness of this design.