• Journal of Physiology & Pathology in Korean Medicine
• /
• v.25 no.2
• /
• pp.334-338
• /
• 2011

Personality is an important factor in diagnosing Sasang constitutions, and has been studied by researchers with various statistical methods. Using these statistical methods, we obtain several clinical factors including significant p-value. In this paper, we applied a graph for analyzing personality questionnaires. The graph can well represent pairwise relations among items from the collected clinical information. In our analysis, we can find several meaningful personality patterns according to Sasang constitutions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.355-361
• /
• 1987

The shuffle-exchange graph is known as a structure to perform the parallel algorithms like Discrete Fourier Transform(DFT), matrix multiplication and sorting. In this paper, the layout for the shuffle-exchange graph is described and this layout places emphasis on the placement of nodes that has the capability to have as small area as possible, have as a small number of crossings as possible, and have as short wires as possible. The algorithm corrdsponding these conditions is proposed and each evaluation factor and the placement of the N-node shuffle-exchange graph is performed with FORTRAN and BASIC program, and these results are calcualted.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.2
• /
• pp.353-363
• /
• 2011

Let k $\geq$ 1 be an integer, and let G be a 2-connected graph of order n with n $\geq$ max{7, 4k+1}, and the minimum degree $\delta(G)$ $\geq$ k+1. In this paper, it is proved that G has a fractional k-factor excluding any given edge if G satisfies max{$d_G(x)$, $d_G(y)$} $\geq$ $\frac{n}{2}$ for each pair of nonadjacent vertices x, y of G. Furthermore, it is showed that the result in this paper is best possible in some sense.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.909-912
• /
• 2010

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

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

A (g, f)-factor F of a graph G is Called a Hamiltonian (g, f)-factor if F contains a Hamiltonian cycle. The binding number of G is defined by $bind(G)\;=\;{min}\;\{\;{\frac{{\mid}N_GX{\mid}}{{\mid}X{\mid}}}\;{\mid}\;{\emptyset}\;{\neq}\;X\;{\subset}\;V(G)},\;{N_G(X)\;{\neq}\;V(G)}\;\}$. Let G be a connected graph, and let a and b be integers such that $4\;{\leq}\;a\;<\;b$. Let g, f be positive integer-valued functions defined on V(G) such that $a\;{\leq}\;g(x)\;<\;f(x)\;{\leq}\;b$ for every $x\;{\in}\;V(G)$. In this paper, it is proved that if $bind(G)\;{\geq}\;{\frac{(a+b-5)(n-1)}{(a-2)n-3(a+b-5)},}\;{\nu}(G)\;{\geq}\;{\frac{(a+b-5)^2}{a-2}}$ and for any nonempty independent subset X of V(G), ${\mid}\;N_{G}(X)\;{\mid}\;{\geq}\;{\frac{(b-3)n+(2a+2b-9){\mid}X{\mid}}{a+b-5}}$, then G has a Hamiltonian (g, f)-factor.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.285-292
• /
• 2014

Intelligent systems are systems that mainly use knowledge rather than data or information. Therefore, knowledge representation is an important factor for intelligent system construction. Conceptual graph is a logical knowledge representation language which has graphical form and it can represent knowledge efficiently. It is, however, cumbersome to use conceptual graphs directly for programming. Various tools were developed to overcome this difficulties. In this paper, we survey on functions and characteristics of conceptual graph tools that can be utilized for constructing intelligent systems by using conceptual graphs. The result of this survey will be very helpful to use conceptual graphs for development of intelligent systems.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• Journal of the Korean Society for information Management
• /
• v.34 no.1
• /
• pp.177-195
• /
• 2017

This study attempts to infer research fronts using factor graph model based on heterogeneous features. The model suggested by this study infers research fronts having documents with the potential to be cited multiple times in the future. To this end, the documents are represented by bibliographic, network, and content features. Bibliographic features contain bibliographic information such as the number of authors, the number of institutions to which the authors belong, proceedings, the number of keywords the authors provide, funds, the number of references, the number of pages, and the journal impact factor. Network features include degree centrality, betweenness, and closeness among the document network. Content features include keywords from the title and abstract using keyphrase extraction techniques. The model learns these features of a publication and infers whether the document would be an RF using sum-product algorithm and junction tree algorithm on a factor graph. We experimentally demonstrate that when predicting RFs, the FG predicted more densely connected documents than those predicted by RFs constructed using a traditional bibliometric approach. Our results also indicate that FG-predicted documents exhibit stronger degrees of centrality and betweenness among RFs.

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.571-578
• /
• 2010

Recently, many social networking services using mobile devices are spread. Also, many studies based on location and time are increasing. However, existing studies have been difficult to resolve queries by place, time, and events. In the paper, we propose time and space modeling method for social services. We propose Human Activity Graph and Quad Relation Factors through time, place, event, and social activity of users, and we design the database scheme for data collect and analysis.