• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.515-530
• /
• 2022

A factor graph and belief propagation can be used for finding stochastic values of link weights in biological networks. However it is not easy to follow the process of use and so we presented the process with a toy network of three nodes in our prior work. We extend this work more generally and present numerical example for a network of 100 nodes.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.325-331
• /
• 2010

Let a and b be nonnegative integers with 2 $\leq$ a < b, and let G be a Hamiltonian graph of order n with n > $\frac{(a+b-5)(a+b-3)}{b-2}$. An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if $\delta(G)\;\geq\;\frac{(a-1)n+a+b-3)}{a+b-3}$ and $\delta(G)$ > $\frac{(a-2)n+2{\alpha}(G)-1)}{a+b-4}$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.6 no.3
• /
• pp.8-11
• /
• 1969

In the precision measurement of the voltage standing wave ratio (VSWR) or reflection coefficient by means of the slotted line technique, one of the important factors is the maximum error due to the discontinuities and multi-reflection in the slotted line. Particularly, this error becomes a critical factor when the VSWR or the reflection coefficient to be measured is very small. In this paper, the exact expression of this error is obtained by means of the Signal flow graph method.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.255-263
• /
• 2017

This paper proposes a graph-theatrical approach to optimize spatial reuse by adopting a technique that quantizes the channel information into single bit sub-messages. First, we introduce an interference graph to model the network topology. Based on the interference graph, the computational requirements of the algorithm that computes the optimal spatial reuse factor of each user are reduced to quasilinear time complexity, ideal for practical implementation. We perform a resource allocation procedure that can maximize the efficiency of spatial reuse. The proposed spatial reuse scheme provides advantages in beamforming systems, where in the interference with neighbor nodes can be mitigated by using directional beams. Based on results of system level measurements performed to illustrate the physical interference from practical millimeter wave wireless links, we conclude that the potential of the proposed algorithm is both feasible and promising.

• Journal of Acupuncture Research
• /
• v.25 no.4
• /
• pp.71-80
• /
• 2008

Objectives : The 7-zonediagnostic system is a diagnostic device to predetermine bodily locations by measuring the energy of body. This study was to investigate the relation between the different patterns of Zone 4 of Factor AA in VEGA DFM 722 (VEGA, Germany), 7-zone-diagnositic system and heart rate variability. Methods : We made three groups according to the Factor AA patterns of VEGA DFM 722. The Factor AA pattern of Group A is that the red bar graph of zone 4 was higher than the normal range. The Factor AA patterns of Group B was that the red bar graph of zone 4 was located at the normal range. The Factor AA patterns of Group C was that the red bar graph of zone 4 was lower than the normal range. We investigated how to difference of the index of heart rate variability(HRV, LX-3202, LAXTHA, Korea) according to each groups. Results : Complexity, HRV-index, RMSSD, SDSD values of Group B were higher than other Groups. pNN50 values of Group B were lower than other groups. And Ln(TP), Ln(VLF), Ln(LF), Ln(HF) values of Group B were higher than other groups. Conclusions : We presumed that Group B was healthier than other groups for the stress.

• Journal of Korean Elementary Science Education
• /
• v.31 no.3
• /
• pp.386-397
• /
• 2012

The purpose of this study was to find a way to improve the science textbook graph through analyzing teachers' interpretation process with eye movement tracking when they try to read the science textbook graph. Participants in this project were 10 elementary school teachers while bar graphs, line graphs, pie charts in 2007 revision science textbooks were used as materials. SMI (SensoMotoric Instruments)' iView X TM RED 120 Hz was used in order to collect eye movement data. Although subjects paid attention to the title of the graph at first, the consequence of the eye fixation was changed by the composition of the graph in case of the rest of areas. In particular, the flow of visual attention and fixation time were affected by the form and configuration of the graph. The diversity of graph construction caused confusion in interpreting graphs; the manner of presenting title, the difference of background colors, size of characters, the name of X-axis and Y-axis. Out results showed that the conformation of graphs as well as the presentation of each factor should be composed in accordance with the educational purpose for helping users to easier understanding.

• Journal of the Korean Geosynthetics Society
• /
• v.14 no.4
• /
• pp.1-9
• /
• 2015

According to national regulations and its commentary, such as Rivers Design Criteria & Commentary (KWRA, 2009), Foundation Structure Guideline and its Commentary(MLTM, 2014 and KGS, 2009), the integrity evaluation of river levee includes slope stability evaluation of both riverside/protected low-land and piping stability evaluation with respect to foundation and levee body along with water level conditions. In this case the design hydro-graph can be the most important input factor for the integrity evaluation, however it is fact that the national regulations do not provide any proper determination methods regarding hydro-graph. The authors thus executed an integrity evaluation of sluice gate in levee by changing each hydro-graph factor, including rising ordinary water level, lasting flood water level, falling water level, and flood frequency, in order to suggest a determination method of reasonable hydro-graph. As a result, the authors suggested that at least over 57 hours of rising ordinary water level and over 53 hours of lasting flood water level should be considered for the design hydro-graph of sluice gate in levee at Mun-san-jae.

• Journal of Acupuncture Research
• /
• v.27 no.2
• /
• pp.1-10
• /
• 2010

Objectives : The 7-zone-diagnostic system is a diagnostic device to predetermine bodily locations by measuring the energy of body. This study was to investigate the relation between the different patterns of Zone 2 of Factor AA in CP-6000A (VEGA, Germany), 7-zone-diagnostic system and the factors of Bell's Palsy. Methods : This study was carried out with the data from factors of Bell's Palsy(age, sex, period after onset, postauricular pain, season which the disease happen, contributing factor). We made three groups according to the different patterns of Zone 2 of Factor AA in CP-6000A. The Factor AA pattern of Group A is that the red bar graph of zone 2 were lower than the normal range. The Factor AA pattern of Group B was that the red bar graph of zone 2 was the normal range. The Factor AA pattern of Group C was that the red bar graph of zone 2 was higher than the normal range. After collecting the data about factors of Bel's Palsy to correspond with conditions of each group were selected, the data was analyzed statistically. Results : The values of number of patient and period after onset of group A was higher than group B and C. The values of ratio of postauricular pain of group B and C was higher than group A. The season of disease happened of group A is spring and winter, group B is winter and group C is summer and autumn. The contributing factor of disease happened of group A is none, and group B and C is stress and clod. Conclusions : In Bell's Palsy, it is thought that the red bar graph of zone 2 is lower, the group have lower energy(虛) and the energy has a character of cold(寒), and zone 2 is higher, the group has the higher energy(實) and the energy has a character of fire(熱).

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1347-1358
• /
• 2010

An upright drawing of a planar graph G on k layers is a planar straight-line drawing of G, where the vertices of G are placed on a set of k horizontal lines, called layers and no two adjacent vertices are placed on the same layer. There is a previously known algorithm that decides in linear time whether a planar graph admits an upright drawing on k layers for a fixed value of k. However, the constant factor in the running time of the algorithm increases exponentially with k and makes it impractical even for k = 3. In this paper, we give a linear-time algorithm to examine whether a biconnected planar graph G admits an upright drawing on three layers and to obtain such a drawing if it exists. We also give a necessary and sufficient condition for a tree to have an upright drawing on three layers. Our algorithms in both the cases are much simpler and easier to implement than the previously known algorithms.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1613-1622
• /
• 2008

Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.