• Communications for Statistical Applications and Methods
• /
• v.11 no.3
• /
• pp.609-617
• /
• 2004

To present graph of probability densities, many softwares and graphical tools use methods that link points or straight lines. However, the methods can't display exactly and smoothly the graph and are not efficient from the viewpoint of process time. One method to overcome these shortcomings is utilizing interpolation methods. In these methods, selecting the number and location of knots is an important factor. This article proposes an algorithm to select knots for graphically presenting densities and implements graph components based on the algorithm.

• Journal of Acupuncture Research
• /
• v.30 no.1
• /
• pp.1-11
• /
• 2013

Objectives : The 7-zone-diagnostic system is a device for predetermining bodily locations by measuring the energy of the living body. The purpose of this study is to examine correlations between gastroscopy results and zone-5 data from the 7-zone-diagnostic system. Methods : This study was carried out with data from gastroscopy procedures. It involved 115 patients who had been diagnosed with gastritis, esophagitis, or gastric ulcers. These patients were divided into three groups according to the different patterns of zone-5 factors AA, FL2 and FL1. Group A was made up of patients for whom the red bar graph of zone-5 was higher than the normal range for factor AA. Group B was made up of patients for whom the red bar graph of zone-5 was within the normal range for factor AA. Group C was made up of patients for whom the red bar graph of zone-5 was lower than the normal range for factor AA. Group D E and F were made up of same way as group A B and C for factor FL2. Group G H and I were made up of same way as group A B and C for factor FL1. After the collection of gastroscopy results and data on zone-5 from the 7-zone-diagnostic system, the data was analyzed statistically. Results : 1. Group D had a higher ratio of medication than group E, and this result was statistically significant. 2. Group D G had a higher ratio of medication than group E G and group E H, and this result was statistically significant. 3. Group G had a higher ratio of esophagitis than group H, and this result was statistically significant. 4. A Group B H had a higher ratio of esophagitis than group B G, group C G, and group C H, and this result was statistically significant. 5. The medication group had a high score on the function index than the non-medication group, and this result was statistically significant. Conclusions : This study suggests that there is a slight correlation between gastroscopy results and zone-5 data from the 7-zone-diagnostic system. The research resulted in significant data that are helpful for diagnosing digestive system problems through the use of the 7-zone-diagnostic system.

• 한국태양에너지학회:학술대회논문집
• /
• 2012.03a
• /
• pp.419-424
• /
• 2012

This paper discusses the state-of-the-art techniques in real-time state estimation for the Smart Microgrids. The most popular method used in traditional power system state estimation is a Weighted Least Square(WLS) algorithm which is based on Maximum Likelihood(ML) estimation under the assumption of static system state being a set of deterministic variables. In this paper, we present a survey of dynamic state estimation techniques for Smart Microgrids based on Belief Propagation (BP) when the system state is a set of stochastic variables. The measurements are often too sparse to fulfill the system observability in the distribution network of microgrids. The BP algorithm calculates posterior distributions of the state variables for real-time sparse measurements. Smart Microgrids are modeled as a factor graph suitable for characterizing the linear correlations among the state variables. The state estimator performs the BP algorithm on the factor graph based the stochastic model. The factor graph model can integrate new models for solar and wind correlation. It provides the Smart Microgrids with a way of integrating the distributed renewable energy generation. Our study on Smart Microgrid state estimation can be extended to the estimation of unbalanced three phase distribution systems as well as the optimal placement of smart meters.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.283-291
• /
• 2007

A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.6
• /
• pp.647-655
• /
• 2014

To perform long-term sewer monitoring, It is important to understand the nature of the wastewater flow that occurs at the point on early stage of the monitor and to prevent in advance a problem which may caused. We can infer the flow properties and external factors by analyzing the scatter graph obtained from the measured data flow rate monitoring data since an field external factor affecting the sewage flow is reflected in the flow rate monitoring data. In this study, Selecting the three points having various external factors, and we Inferred the sewer flow characteristics from depth-velocity scatter graph and determined the analysis equation for the dry-weather flow rate data. At the'point 1' expected non-pressure flow, we were able to see the drawdown effect caused by the free fall in the manhole section. At the'point 2', existed weir and sediments, there was backwater effect caused by them, and each of size calculated from the scatter graph analysis were 400 mm and 130 mm. At the'Point 3', there is specific flow pattern that is coming from flood wave propagation generated by the pump station at upstream. In common, adequate equations to explain the dry weather flow data are flume equation and modified manning equation(SS method), and the equations had compatibility for explaining the data because all of $R^2$ values are over 0.95.

• Water for future
• /
• v.9 no.1
• /
• pp.101-105
• /
• 1976

This Study is developed in order to determine the probability of a raintall depth of short duration in Seoul as considering the profect life and the factor of safety of hydraulic structures. The raw annual maximum rainfall data are selected from 1915 to 1974 about short duration (10min-120min.) in Seoul. The selected data are treated by frequency analysis, and the hypothesis that the distribution fuction of the raw data is normal Distribution is performed by chi-square test that signifcance level has 5%. With the parameters (mean and standard deviation) of the accepted distribution function, the probabilitn of a rainfall depth can be easily determined on the graph which is made on this paper.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.33-38
• /
• 2014

This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.1045-1067
• /
• 2022

Given a graph G, a {1, 3, …, 2n-1}-factor of G is a spanning subgraph of G, in which each degree of vertices is one of {1, 3, …, 2n-1}, where n is a positive integer. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of G to guarantee that G contains a {1, 3, …, 2n-1}-factor. Then we determine an upper bound on the distance spectral radius of G to ensure that G has a {1, 3, …, 2n-1}-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.