• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2019년도 춘계학술대회
• /
• pp.83-86
• /
• 2019

본 연구는 공동연구성과를 고려하여 링크 분석 및 학습을 통해 기대효과가 높은 논문의 공저자 협업관계를 예측하는 방법론을 제시한다. 기존의 공저자 관계는 높은 정확도로 예측됨에도 불구하고 예측된 관계가 얼마나 좋은 관계인지 고려하지 않는 한계점을 보이고 있다. 따라서 본 연구에서는 위의 문제를 해결하기 위해 기대성과에 도움이 되는 공저자 관계 예측 방법을 다음과 같이 3가지 단계로 제안한다. (1) 서지정보 이종 그래프(Heterogeneous graph)를 구축하여 공동연구성과를 측정한다. (2) 공동연구성과를 기반으로 링크를 분석 및 학습한다. (3) 기대성과가 높을 것으로 전망되는 링크를 예측한다. 공동연구성과를 고려한 본 연구는 예측된 공저자 관계에 신뢰도를 높일 수 있을 것으로 기대한다.

• 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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.22-24
• /
• 2021

본 논문은 노드와 엣지로 이루어진 그래프 구성을 통해 신경망을 활용하여 엣지 가중치 예측 방안을 제안하고자 한다. 사회 구성요소 중 하나인 브랜드들의 중요도 높은 전략 중 출점전략에 대해 초점을 맞추어보았다. 본 논문에서는 1) 브랜드 지점들을 노드로 구성하고, 지점 간 관계를 엣지로 구성한다. 그리고 지점 간 실제 도보 및 주행 가능 거릿값을 엣지 가중치로 표현한 그래프를 구성한다. 그리고 2) 엣지를 수치화하여 신경망을 학습해 엣지의 가중치인 지점 간 거릿값을 예측하는 방안을 제안한다. 제안한 방식을 활용함으로 예측되는 특정 브랜드의 출점 범위를 성공적인 브랜드의 출점전략 분석할 시에 활용할 수 있을 것으로 예상한다.

• Journal of applied mathematics & informatics
• /
• 제38권1_2호
• /
• pp.189-200
• /
• 2020

Let G be a simple connected graph with n vertices and m edges. Denote by d₁ ≥ d₂ ≥ ⋯ ≥ d_n > 0 and d(e₁) ≥ d(e₂) ≥ ⋯ ≥ d(e_m) sequences of vertex and edge degrees, respectively. If vertices v_i and v_j are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳_α(G) = ∑_i~j(d_i + d_j)^α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳_α(G) and 𝒳_α-1(G). Then we use it to obtain some new bounds for 𝒳_α(G).

• Journal of applied mathematics & informatics
• /
• 제36권3_4호
• /
• pp.307-315
• /
• 2018

Let G be a simple connected graph with n vertices and m edges, with a sequence of vertex degrees $d_1{\geq}d_2{\geq}{\cdots}{\geq}d_n$ > 0. A vertex-degree topological index, referred to as harmonic index, is defined as $H={\sum{_{i{\sim}j}}{\frac{2}{d_i+d_j}}$, where i ~ j denotes the adjacency of vertices i and j. Lower and upper bounds of the index H are obtained.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.203-205
• /
• 1997

In this paper, we present a useful method of estimating earth resistivity using BP algorithm in Neural-Networks. From this method, equivalent earth resistivity(EER) can be obtained directly using training data composed of field-measured apparent resistivity and probe distance. This approach can reduce errors which is conventionally raised from manual operation of calculating EER. To evaluate its accuracy and convenience, the result of proposed method is compared to that of conventional methods, graphical($\rho$-a graph) and numerical(CDEGS program), respectively.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.378-383
• /
• 1995

Kandil[5] introduced and studied the notion of fuzzy bitopological spaces as a natural generalization of fuzzy topological In [10], Sampath Kumar introduced and studied the concepts of ( i, j)-fuzzy semiopen sets, fuzzy pairwise semicontinuous mappings in the fuzzy bitopological spaces. Also, he defined the concepts of ( i, j)-fuzzy -open sets, ( i, j)-fuzzy preopen sets, fuzzy pairwise -continuous mappings and fuzzy pairwise precontinuous mappings in the fuzzy bitopological spaces and studied some of their basic properties. In this paper, we generalize the concepts of fuzzy -open sets, fuzzy -continous mappings ？ 새 Mashhour, Ghanim and Fata Alla[6] into fuzzy bitopological spaces, We first define the concepts of ( i, j)-fuzzy -open sets and then consider the generalizations of fuzzy pairwise -continuous mappings is obtained Besides many basic results, results related to products and graph of mapping are obtained in the fuzzy bitopological spaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3316-3332
• /
• 2019

In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 2002년도 proceedings of the second asia international conference on tribology
• /
• pp.459-460
• /
• 2002

This article discusses a diagnostics method based on models, and information theory. From an extensive system dynamics bond graph model of a gearbox [1], simulated were various cases germane to this diagnostics approach, including the response of an ideal gearbox, which functions perfectly to designer's specifications, and degraded gearboxes with tooth root cracking. By comparing these cases and constructing a signal flow analogy between the gearbox and a communication channel, Shannon' s information theory [2], including theorems, was applied to the gearbox to assess system health, in terms of ability to function.

• 제어로봇시스템학회논문지
• /
• 제18권7호
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.