• Journal of KIISE
• /
• v.44 no.1
• /
• pp.78-83
• /
• 2017

Finding the densest subgraphs from social networks, such that people in the subgraph are in a particular community or have common interests, has been a recurring problem in numerous studies undertaken. However, these algorithms focused only on finding the single densest subgraph. We suggest a heuristic algorithm of the bottom-up type, which finds the densest subgraph by increasing its size from a given starting node, with the repeated addition of adjacent nodes with the maximum degree. Furthermore, since this approach matches well with parallel processing, we further implement a parallel algorithm on the MapReduce framework. In experiments using various graph data, we confirmed that the proposed algorithm finds the densest subgraphs in fewer steps, as compared to other related studies. It also scales efficiently for many given starting nodes.

• Journal of the military operations research society of Korea
• /
• v.35 no.2
• /
• pp.77-86
• /
• 2009

The encounter probability graph is measured by the chance(in percent) that a vehicle, blindly moving through a minefield, will detonate a mine. The encounter probability graph versus minefield density is presented in ROK and US Army field manual but this graph is baseless because these data had not been presented as those of live mobility or wargame. In this paper, we verified this graph building procedure model as using computer program. The result values of program are almost like those of graph. Therefore this model for our to suggest have validation, verification that a modeling demand and we convince that this model will be useful for calculating encounter probability of multiple vehicles.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.31-34
• /
• 2003

본 연구에서는 연속형 확률밀도함수의 그래프를 표현하기 위한 하나의 방법으로 보간점을 이용하는 문제에 대해 살펴보고자 한다. 이를 위해 최적화 기법을 이용하여 보간점의 수와 위치를 선택하는 알고리즘을 제안하고, 제안한 방법을 이용하여 확률밀도함수의 그래프를 구현한다.

• Korean Journal of Food Science and Technology
• /
• v.37 no.3
• /
• pp.418-424
• /
• 2005

The physicochemical properties of raw noodle flours (n = 11) commercially produced from Australian Standard White (ASW) (Group 1, n = 8) and blonds (Group 2, n = 3) of ASW and Australian hard, western white or hard red winter were investigated. Protein and ash contents were lower in Group 1. The tristimulus color values, mean particle size, flour swelling volume (FSV) and rheological parameters of farinograph and extensigraph were not different between two flour groups. Peak viscosity measured with Rapid Visco Analyzer was higher in Group 1. The protein content was positively correlated with mean particle size, dough stability and dough extensibility, and negatively correlated with FSV and peak viscosity. The FSV wag positively correlated with the peak viscosity. The rheological parameters of dough did not show any correlations with FSV and peak viscosity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.5
• /
• pp.468-574
• /
• 1991

In construction of breadth-frist tree, the communication complexity can be reduced by efficent synchronization schemes based on several threshold values, We determine several new threshold values by considering the graph density represented as lognm, where n and m are the number of nodes and links., repectively. When thesethreshold values are used in the synchroization method for constructing distrbuted bradth-first search tree, we can obtain a more efficient algorithm in sparse graphs, and also, this algorithm has vthe same performance for communication complexity in dense graphs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.432-436
• /
• 2010

Finding communities from network data including social networks can be done by clustering the nodes of the network as densely interconnected groups, where keeping interconnection between groups sparse. To exploit a clustering algorithm for community detection task, we need a well-defined similarity measure between network nodes. In this paper, we propose a new similarity measure named "Common Neighborhood Sub-graph density" and combine the similarity with affinity propagation, which is a recently devised clustering algorithm.

• Applied Biological Chemistry
• /
• v.41 no.5
• /
• pp.367-371
• /
• 1998

The characteristics of four samples of noodle flours milled from Australian Standard White(ASW) wheat were compared with one sample of noodle flour prepared from a blend of hard red winter(HRW) and western white(WW) American wheats. The ASW flours had lower content of protein and ash. Farinograms revealed that the absorption of the ASW flours was slightly higher than that of the HRW-WW flour. The mixing time, however, showed no difference between ASW flours and HRW-WW flour. The stability and the mechanical tolerance index were different among ASW flours, which were lower than HRW-WW flour. The ratios of resistance to extention determined by extensigraph for ASW flours were higher except one flour than HRW-WW flour. The flours showed characteristic mean particle sizes, which may reflect the differences in hardness of wheat used in the flour production. Farinograph indices showed no correlations with protein content and extensigraph indices. The amylograph peak viscosity was inversely correlated with the protein content (p<0.05).

• Journal of the Korean earth science society
• /
• v.40 no.6
• /
• pp.639-653
• /
• 2019

The purpose of this study is to investigate the science gifted students' level of interpreting the oceanic graph and of understanding the oceanic physical concept through analyzing the Temperature-Salinity (T-S) diagram and inferring the SOFAR (SOund Fixing And Ranging) channel. A total of 106 gifted students in the 3rd year of a science gifted high school, using T-S diagrams published in one of the journals of Oceanology, developed descriptive questions asking the depth of the SOFAR channel to conduct the quantitative and qualitative analysis of graph interpretation ability. As a result, there was a big difference in the level of graphs interpretation and concepts understanding for each science gifted students such as interpreting, modeling, and converting, and exposed their alternative concepts about water temperature, salinity, and density. The results of this study will be used to understand the levels of science gifted students' graph interpretation in oceanology, and to provide the basic data for improving the teaching and learning methods of oceanology and also provide basic data for teaching material development related to graph analysis.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.99-111
• /
• 2012

The log-density ratio of the conditional densities of the predictors given the response variable provides useful information for variable selection in the logistic regression model. In this paper, we consider the predictors that are needed and how they should be included in the model. If the conditional distributions are skewed, the distributions can be considered as gamma distributions. Under this assumption, linear and log terms are generally included in the model. The log-odds graph is a very useful graphical tool in this study. A graphical study is presented which shows that if the conditional distributions of x|y for the two groups overlap significantly, we need both the linear and quadratic terms. On the contrary, if they are well separated, only the linear or log term is needed in the model.

• The Journal of Society for e-Business Studies
• /
• v.20 no.2
• /
• pp.155-166
• /
• 2015

RWR (Random Walk with Restart) is frequently used by many graph-based ranking algorithms, but it does not consider a signed graph where edges may have negative weight values. In this paper, we apply the Balance Theory by F. Heider to RWR over a signed graph and propose a novel RWR, Balanced Random Walk (BRW). We apply the proposed technique into the domain of recommendation system, and show by experiments its effectiveness to filter out the items that users may dislike. In order to provide the reasonable performance of BRW in the domain, we modify the existing Top-k algorithm, BCA, and propose a new algorithm, Bicolor-BCA. The proposed algorithm yet requires employing a threshold. In the experiment, we show how threshold values affect both precision and performance of the algorithm.