• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.32
• /
• pp.145-154
• /
• 1994

In this paper, monitoring processor in a circuit switched network is considered. Monitoring processor monitors communication links, and offers a grade of service in each link to controller. Such an information is useful for an effective maintenance of system. Two links with nonsymmetric system Parameters are considered. each link is assumed independent M/M/1/1 type. The Markov process is introduced to compute busy and idle portions of monitoring processor and monitored rate of each link. Inter-idle times and inter-monitoring times of monitoring processor between two links are respectively computed. A recursive formula is introduced to make computational procedure rigorous.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.326-334
• /
• 1990

A monitoring process of a communication network with two links is analyzed. The Markov process is introduced to compute busy and idle portions of monitoring processor and monitored rate of each link. Inter-idle times and inter-monitoring ties of monitoring processor between two links are respectively computed. A recursive formula is introduced to make the computational procedure rigorous.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1405-1417
• /
• 2018

The aim of this work is to introduce several different volume computational methods of graph polytopes associated with various types of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and most useful to compute the volume of the graph polytope for an arbitrary finite simple graph.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.937-942
• /
• 2009

In this paper, a continuous-time risk process in an insurance business is considered, where the premium rate is constant and the claim process forms a compound Poisson process. We say that a ruin occurs if the surplus of the risk process becomes negative. It is practically impossible to calculate analytically the ruin probability because the theoretical formula of the ruin probability contains the recursive convolutions and infinite sum. Hence, many authors have suggested approximation formulas of the ruin probability. We introduce a new approximation formula of the ruin probability which extends the well-known De Vylder's and exponential approximation formulas. We compare our approximation formula with the existing ones and show numerically that our approximation formula gives closer values to the true ruin probability in most cases.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.2 s.233
• /
• pp.247-252
• /
• 2005

This research presents a three-dimensional modeling technique for a flexible sheet. A relative coordinate formulation is used to represent the kinematics of the sheet. The three-dimensional flexible sheet is modeled by multi-rigid bodies interconnected by out-of-plane joints and plate force elements. A parent node is designated as a master body and is connected to the ground by a floating joint to cover the rigid motion of the flexible sheet in space. Since the in-plane deformation of a sheet such as a paper and a film is relatively small, compared to out-of-plane deformation, only the out-of-plane deformation is accounted for in this research. The recursive formulation has been adopted to solve the equations of motion efficiently. An example is presented to show the validity of the proposed method.

• Journal of Mechanical Science and Technology
• /
• v.19 no.spc1
• /
• pp.305-311
• /
• 2005

This research presents a three-dimensional modeling technique for a flexible sheet. A relative coordinate formulation is used to represent the kinematics of the sheet. The three-dimensional flexible sheet is modeled by multi-rigid bodies interconnected by out-of-plane joints and plate force elements. A parent node is designated as a master body and is connected to the ground by a floating joint to cover the rigid motion of the flexible sheet in space. Since the in-plane deformation of a sheet such as a paper and a film is relatively small, compared to out-of-plane deformation, only the out-of-plane deformation is accounted for in this research. The recursive formulation has been adopted to solve the equations of motion efficiently. An example is presented to show the validity of the proposed method.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.573-576
• /
• 2005

This research presents a three-dimensional modeling technique for a flexible sheet. A relative coordinate formulation is used to represent the kinematics of the sheet. The three-dimensional flexible sheet is modeled by multi-rigid bodies interconnected by out-of-plane joints and plate force elements. A parent node is designated as a master body and is connected to the ground by a floating joint to cover the rigid motion of the flexible sheet in space. Since the in-plane deformation of a sheet such as a paper and a film is relatively small, compared to out-of-plane deformation, only the out-of-plane deformation is accounted for in this research. The recursive formulation has been adopted to solve the equations of motion efficiently. An example is presented to show the validity of the proposed method.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• Nuclear Engineering and Technology
• /
• v.56 no.6
• /
• pp.2266-2273
• /
• 2024

A machine learning platform is proposed for the diagnosis of a severe accident progression in a nuclear power plant. To predict the key parameters for accident management including lost signals, a long short term memory (LSTM) network is proposed, where multiple accident scenarios are used for training. Training and test data were produced by MELCOR simulation of the Fukushima Daiichi Nuclear Power Plant (FDNPP) accident at unit 3. Feature variables were selected among plant parameters, where the importance ranking was determined by a recursive feature elimination technique using RandomForestRegressor. To answer the question of whether a reduced order ML model could predict the complex transient response, we performed a systematic sensitivity study for the choices of target variables, the combination of training and test data, the number of feature variables, and the number of neurons to evaluate the performance of the proposed ML platform. The number of sensitivity cases was chosen to guarantee a 95 % tolerance limit with a 95 % confidence level based on Wilks' formula to quantify the uncertainty of predictions. The results of investigations indicate that the proposed ML platform consistently predicts the target variable. The median and mean predictions were close to the true value.