• 한국자동차공학회논문집
• /
• 제6권4호
• /
• pp.66-75
• /
• 1998

In many case of optimal design and sensitivity analysis, obtaining of transfer function between input and output variables is a difficult and time-consuming problem. The bond graph modeling is a method that is used for making it easy to analyze complex systems composed of mechanical and electrical parts. It gives us a simple and systematic tool to get state-space equations easily. And we can obtain the transfer function graphically using bond graph and Mason's rule. This paper shows how bond graphs are converted to block diagram and how Mason's rule is applied. And the simple direct method to obtain transfer function from bond graph is introduced. As a example, induction of transfer function of electric power steering composed of mechanical and electrical parts will be done.

• Nuclear Engineering and Technology
• /
• 제29권6호
• /
• pp.433-443
• /
• 1997

In this work, an analytic approach to the dependability of software in the operational phase is suggested with special attention to the hardware fault effects on the software behavior : The hardware faults considered are memory faults and the dependability measure in question is the reliability. The model is based on the simple reliability theory and the graph theory which represents the software with graph composed of nodes and arcs. Through proper transformation, the graph can be reduced to a simple two-node graph and the software reliability is derived from this graph. Using this model, we predict the reliability of an application software in the digital system (ILS) in the nuclear power plant and show the sensitivity of the software reliability to the major physical parameters which affect the software failure in the normal operation phase. We also found that the effects of the hardware faults on the software failure should be considered for predicting the software dependability accurately in operation phase, especially for the software which is executed frequently. This modeling method is particularly attractive for the medium size programs such as the microprocessor-based nuclear safety logic program.

• 대한수학회보
• /
• 제61권3호
• /
• pp.585-595
• /
• 2024

We show that a pseudo-Anosov map constructed as a product of the large power of Dehn twists of two filling curves always has a geodesic axis on the curve graph of the surface. We also obtain estimates of the stable translation length of a pseudo-Anosov map, when two filling curves are replaced by multicurves. Three main applications of our theorem are the following: (a) determining which word realizes the minimal translation length on the curve graph within a specific class of words, (b) giving a new class of pseudo-Anosov maps optimizing the ratio of stable translation lengths on the curve graph to that on Teichmüller space, (c) giving a partial answer of how much power is needed for Dehn twists to generate right-angled Artin subgroup of the mapping class group.

• Korean Journal of Mathematics
• /
• 제30권2호
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.

• 한국멀티미디어학회논문지
• /
• 제24권9호
• /
• pp.1251-1260
• /
• 2021

This paper discusses missing data processing using simple moving average (SMA) and kalman filter. Also SMA and kalman predictive value are made a comparative study. Time series analysis is a generally method to deals with time series data in photovoltaic field. Photovoltaic system records data irregularly whenever the power value changes. Irregularly recorded data must be transferred into a consistent format to get accurate results. Missing data results from the process having same intervals. For the reason, it was imputed using SMA and kalman filter. The kalman filter has better performance to observed data than SMA. SMA graph is stepped line graph and kalman filter graph is a smoothing line graph. MAPE of SMA prediction is 0.00737%, MAPE of kalman prediction is 0.00078%. But time complexity of SMA is O(N) and time complexity of kalman filter is O(D²) about D-dimensional object. Accordingly we suggest that you pick the best way considering computational power.

• 대한수학회지
• /
• 제54권3호
• /
• pp.847-865
• /
• 2017

For a finite or an infinite set X, let $2^X$ be the power set of X. A class of simple graph, called strong Boolean graph, is defined on the vertex set $2^X{\setminus}\{X,{\emptyset}\}$, with M adjacent to N if $M{\cap}N={\emptyset}$. In this paper, we characterize the annihilating-ideal graphs $\mathbb{AG}(R)$ that are blow-ups of strong Boolean graphs, complemented graphs and preatomic graphs respectively. In particular, for a commutative ring R such that AG(R) has a maximum clique S with $3{\leq}{\mid}V(S){\mid}{\leq}{\infty}$, we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a complemented graph, if and only if R is a reduced ring. If assume further that R is decomposable, then we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a blow-up of a pre-atomic graph. We also study the clique number and chromatic number of the graph $\mathbb{AG}(R)$.

• 호남수학학술지
• /
• 제32권4호
• /
• pp.769-776
• /
• 2010

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. For a connected graph G, $G^p$ (p > 1) is the graph obtained from G by adding the edges (u, v) to G whenever 2 $\leq$ dist(u, v) $\leq$ p in G. And the pebbling exponent of a graph G to be the least power of p such that the pebbling number of $G^p$ is equal to the number of vertices of G. We compute the pebbling number of fourth power of paths so that the pebbling exponents of some paths are calculated.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권9호
• /
• pp.413-422
• /
• 2002

In a power plant, disturbance detection and diagnosis are massive and complex problems. Once a disturbance occurs, it can be either persistent, self cleared, cleared by the automatic controllers or propagated into another disturbance until it subsides in a new equilibrium or a stable state. In addition to the Physical complexity of the power plant structure itself, these dynamic behaviors of the disturbances further complicate the fault monitoring and diagnosis tasks. A data structure called a disturbance interrelation analysis graph(DIAG) is proposed in this paper, trying to capture, organize and better utilize the vast and interrelated knowledge required for power plant disturbance detection and diagnosis. The DIAG is a multi-layer directed AND/OR graph composed of 4 layers. Each layer includes vertices that represent components, disturbances, conditions and sensors respectively With the implementation of the DIAG, disturbances and their relationships can be conveniently represented and traced with modularized operations. All the cascaded disturbances following an initial triggering disturbance can be diagnosed in the context of that initial disturbance instead of diagnosing each of them as an individual disturbance. DIAG is applied to a typical cooling water system of a thermal power plant and its effectiveness is also demonstrated.

• 동력기계공학회지
• /
• 제6권3호
• /
• pp.71-77
• /
• 2002

In this study, a dynamic model of proportional pressure control valve using the bond graph and a predictive controller are presented in the form of dynamic matrix control which is concerned with a design method of digital controller for the electro hydraulic servo system. The bond graph can be utilized for all types of systems which involve power and energy, and it is applied to a propotional pressure control valve in this study. Recently, many researchers suggested that better control performance could be obtained by means of the predictive controls with future reference input, future control output and future control error. The Predictive controller is very practical because the controller can be easily applicable to a personal computer or a microprocessor. This study investigates through numerical simulations that hydraulic system with the predictive controller shows very good control performances.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.689-701
• /
• 2021

The purpose of this paper is to optimize the number of source places required for the unique representation of the destination using the tools of graph theory. A subset S of vertices of a graph G is called a rational resolving set of G if for each pair u, v ∈ V - S, there is a vertex s ∈ S such that d(u/s) ≠ d(v/s), where d(x/s) denotes the mean of the distances from the vertex s to all those y ∈ N[x]. A rational resolving set is called minimal rational resolving set if no proper subset of it is a rational resolving set. In this paper we study varieties of minimal rational resolving sets defined on the basis of its complements and compute the minimum and maximum cardinality of such sets, respectively called as lower and upper rational metric dimensions for power of a path P_n analysing various possibilities.