• Journal of the Korean Data and Information Science Society
• /
• 제25권5호
• /
• pp.1107-1116
• /
• 2014

In this paper, we review recent developments in network analysis using the graph theory, and introduce ongoing research area with relevant theoretical results. In specific, we introduce basic notations in graph, and conditional and marginal approach in constructing the adjacency matrix. Also, we introduce the Marcenko-Pastur law, the Tracy-Widom law, the white Wishart distribution, and the spiked distribution. Finally, we mention the relationship between degrees and eigenvalues for the detection of hubs in a network.

• 호남수학학술지
• /
• 제27권1호
• /
• pp.115-129
• /
• 2005

In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

• Safety and Health at Work
• /
• 제12권1호
• /
• pp.42-50
• /
• 2021

Introduction: Despite huge investments in new technology and transportation infrastructure, terrible accidents still remain a reality of traffic. Methods: Severe traffic accidents were analyzed from four prevailing modes of today's transportations: sea, air, railway, and road. Main root causes of all four accidents were defined with implementation of the approach, based on Flanagan's critical incident technique. In accordance with Molan's Availability Humanization model (AH model), possible preventive or humanization interventions were defined with the focus on technology, environment, organization, and human factors. Results: According to our analyses, there are significant similarities between accidents. Root causes of accidents, human behavioral patterns, and possible humanization measures were presented with rooted graphs. It is possible to create a generalized model graph, which is similar to rooted graphs, for identification of possible humanization measures, intended to prevent similar accidents in the future. Majority of proposed humanization interventions are focused on organization. Organizational interventions are effective in assurance of adequate and safe behavior. Conclusions: Formalization of root cause analysis with rooted graphs in a model offers possibility for implementation of presented methods in analysis of particular events. Implementation of proposed humanization measures in a particular analyzed situation is the basis for creation of safety culture.

• Journal of Information Processing Systems
• /
• 제14권3호
• /
• pp.709-726
• /
• 2018

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

• 컴퓨터교육학회논문지
• /
• 제9권6호
• /
• pp.41-51
• /
• 2006

비동기 통신 수단으로써의 e-BBS (electronic-Bulletin Board System, 전자게시판)는 협력 학습을 위한 유용한 매체로 알려져 왔다. 그러나 e-BBS의 구조적 분석을 이해하기 위한 이론적 결과는 이직 충분하지 못하다. 그 결과, 복잡한 의사소통 현상을 이해하고 교수자를 도와 학생들을 교육 목적으로 이끌 수 있도록 보조하는 적절한 도구의 부재를 초래하게 되었다. 그로 인해 BBS를 활용하는 교수자는 토의 상황의 구조적, 종합적 이해가 부재한 상태에서 거의 방임적으로 운영하게 된다. 이러한 문제점에 대처하기 위하여 본 논문에서는 BBS의 구조적 이해를 돕기 위한 이론적 토대를 제시하고 그를 바탕으로 토의 활동 참여자의 행동 분석을 위한 계산 모델을 제시하고자 한다. 쌍방향 토의 활동의 형식 표현은 응답 그래프와 연결 그래프의 두 그래프로 이루어지며 분석을 위한 여러 측정치와 통계량이 제시된다. 분석의 결과를 명확하게 제시하기 위하여 유형별로 분류한다.

• 한국멀티미디어학회논문지
• /
• 제3권6호
• /
• pp.674-684
• /
• 2000

병렬처리 과정 중에서 고려되어야할 가장 중요한 점은 프로세서사이에 통신을 어떻게 효율적으로 처리하는가 하는 것이다. 그 중 하나의 접근방법이 익스팬드 그래프를 이용하여 최적의 지연시간을 달성하는 방법이다. 익스팬드 그래프를 기초로 하여 효율적인 네트워크 구성과 수행시간이 빠른 병렬 알고리즘을 개발하기 위한 시도가 이루어져왔다. 병렬알고리즘 수행에서의 중요한 결과인 O(logN)시간의 AKS정렬 알고리즘은 익스팬드를 기초로 한다. 익스팬드 그래프는 다시 집중기(concentrator)와 초집중기(superconcentrator)에 적용될 수 있으며 Margulis가 선형 익스팬드 그래프의 구성하는 방법을 구체적으로 제시한 후 몇 개의 익스팬드가 제시되었다. 그러나 익스팬드 그래프를 이용한 구체적인 구조는 제시하지 않았다. 본 논문에서 hypercube 구조에서의 익스팬드 네트워크 구조를 조사하고 그리고 각 단에서의 확장성을 분석하고 다단으로 확장한다. 본 논문은 hypercube에서의 익스팬드 네크워크의 이론적 분석을 제시한다.

• Korean Chemical Engineering Research
• /
• 제55권4호
• /
• pp.520-529
• /
• 2017

Viscosity data were measured at 298.15 K and 308.15 K for formamide + 1-propanol, 2-propanol, 1-butanol, 2-methyl-1-propanol or 2-methyl-2-propanol mixtures. For an equimolar mixture, deviation in viscosity follows the sequence: 2-methyl-2-propanol >2-methyl-1-propanol>1-butanol>2-propanol>1-propanol. The viscosity data were further analyzed in terms of graph theory. Free energy of activation was also calculated from experimental viscosity data along with previously reported excess volume data. The deviation in viscosity and free energy of activation were fitted to Redlich-Kister polynomial equation. The viscosity data were also correlated by correlations like Grunberg-Nissan, Tamura-Kurata, HindMcLaughlin-Ubbelohde, and Katti-Chaudhari relation. Various adjustable parameters, $G_{12}$, $T_{12}$, $H_{12}$, and $W_{vis}/RT$, of various correlations were used to predict viscosity deviation of binary mixtures. Positive value of $G_{12}$ indicates strong interaction in the studied systems. Grunberg-Nissan relation has lowest deviation among the four correlations for formamide + 1-propanol or 2-propanol mixtures; and for mixtures of formamide with 1-butanol or 2-methyl-1-propanol, TamuraKurata has lowest deviation. Grunberg-Nissan gives lowest deviation for formamide + 2-methyl-2-propanol mixtures.

• Korean Chemical Engineering Research
• /
• 제55권5호
• /
• pp.668-678
• /
• 2017

Intermolecular interactions were studied for binary mixtures of 2-propanol + cyclohexane, n-hexane, benzene, toluene, o-, m- and p-xylenes by measuring ultrasonic speeds (u) over the entire range of composition at 298.15 K and 308.15 K. From these results the deviation in ultrasonic speed was calculated. These results were fitted to the Redlich-Kister equation to derive the binary coefficients along with standard deviations between the experimental and calculated data. Acoustic parameters such as excess isentropic compressibility ($K_s^E$), intermolecular free length ($L_f$) and available volume ($V_a$) were also derived from ultrasonic speed data and Jacobson's free length theory. The ultrasonic speed data were correlated by Nomoto's relation, Van Dael's mixing relation, impedance dependence relation, and Schaaff's collision factor theory. Van Dael's relation gives the best prediction of u in the binary mixtures containing aliphatic hydrocarbons. The ultrasonic speed data and isentropic compressibility were further analyzed in terms of Jacobson's free length theory.

• 인터넷정보학회논문지
• /
• 제22권5호
• /
• pp.27-33
• /
• 2021

With the broad adoption of the Internet of Things (IoT) in a variety of scenarios and application services, management and orchestration entities require upgrading the traditional architecture and develop intelligent models with ultra-reliable methods. In a heterogeneous network environment, mission-critical IoT applications are significant to consider. With erroneous priorities and high failure rates, catastrophic losses in terms of human lives, great business assets, and privacy leakage will occur in emergent scenarios. In this paper, an efficient resource slicing scheme for optimizing federated learning in software-defined IoT (SDIoT) is proposed. The decentralized support vector regression (SVR) based controllers predict the IoT slices via packet inspection data during peak hour central congestion to achieve a time-sensitive condition. In off-peak hour intervals, a centralized deep neural networks (DNN) model is used within computation-intensive aspects on fine-grained slicing and remodified decentralized controller outputs. With known slice and prioritization, federated learning communications iteratively process through the adjusted resources by virtual network functions forwarding graph (VNFFG) descriptor set up in software-defined networking (SDN) and network functions virtualization (NFV) enabled architecture. To demonstrate the theoretical approach, Mininet emulator was conducted to evaluate between reference and proposed schemes by capturing the key Quality of Service (QoS) performance metrics.

• 지능정보연구
• /
• 제26권4호
• /
• pp.67-86
• /
• 2020

추천시스템은 시간이 흐를수록 사용자와 기업에게 점점 더 큰 영향을 주고 있다. 최근 코로나(COVID-19) 팬데믹 현상이 전 세계적으로 일어나면서 세대를 뛰어넘어 E-Commerce의 중요성이 증대되었고 추천시스템은 E-Commerce 활성화의 최중심에 있다. 추천시스템이 개발된 이래로 다수의 알고리즘이 추천시스템의 정확도를 올리는 것에 집중되어 있었고, 추천시스템의 희귀성, 다양성, 우연성 등과 같은 다른 가치들이 간과되고 있다. 본 논문에서는 사용자의 만족도는 추천시스템의 정확도에만 달려있지 않고 다양한 성능을 겸비했을 때 고객에게 만족스러운 추천서비스 경험을 제공할 것이라 생각하여 다양성을 위한 그래프 기반의 추천시스템을 개발하였다. 사용자 네트워크를 구성한 뒤 카테고리를 활용한 무게중심변화를 통해 유사도가 낮은 이질적인 사용자를 찾아 추천상품의 유사성을 낮추는 방식으로 다양성을 도모하였다. 또한, 추천의 다양성은 사용자의 다양성 선호 수준에 따라 상이할 것이라는 가정에 따라 사용자의 다양성 선호 수준을 구별하였고 다양성 모델 성능이 사용자 특성별로 다름을 확인할 수 있었다. 전체 연구 결과, 추천시스템의 정확성과 다양성이 트레이드 오프 관계에 놓여있다는 것을 확인할 수 있었지만 본 연구모델을 통해 근소한 정확도 손실 대비 높은 다양성을 얻을 수 있었다. 본 연구는 그래프 기반의 추천시스템을 통해 사용자의 만족도를 향상시키는 다양성을 실현하였다는 연구적 의의와 사용자 수준을 고려한 추천의 다양성을 적용 결과를 통해 기업의 장기적 이윤을 상승시킬 수 있는 모델 개발이라는 실무적 의의를 꼽을 수 있다.