• 대한건축학회논문집:계획계
• /
• 제35권1호
• /
• pp.47-54
• /
• 2019

This study proposes a new ERAM model with building population weighting. Previous studies of applying weightings on ERAM model on the scale of urban space were focused on the relationship between the street and the human behavior. However, this study focuses on the influences that buildings give to human behavior and develops a building population weighted ERAM model. This research starts by analyzing ERAM model to its basic compositions, which are adjacency matrix and row vector. It applies building population weighting to the row vector, while previous studies put weightings in the adjacency matrix. Building population weighted ERAM model calculates the building population weighting based on GIS data, which provides objective and massive data of buildings in the urban scale. For the verification of the model, Insa-dong and Myeong-dong were analyzed with both ERAM model and building population weighted ERAM model. The results were analyzed through the correlation test with actual pedestrian population data of the two districts. As a result, the explanation ability of building population weighted ERAM model for the pedestrian population turned out to be higher than the ERAM model. Since building population weighted ERAM model has the structure that can be combined with other weighted ERAM models, it is expected to develop a multi-weighted ERAM model with better explanation ability as a further study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1556-1559
• /
• 1987

In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

• 한국전자통신학회논문지
• /
• 제5권3호
• /
• pp.239-244
• /
• 2010

본 논문은 최소연결 사변형 그래프 G의 인접행렬을 연구하고 여기서 우리는 그래프 G에 대한 |E(G)|상에서 상한을 얻고 그 얻어진 상한에 대한 또 다른 그래프를 얻는다. 더욱이 우리는 임계연결로 덮힌 사변형 그래프 G에 대한 |E(G)|의 상한을 얻는다.

• 대한수학회보
• /
• 제59권3호
• /
• pp.685-695
• /
• 2022

The minimum number of complete bipartite subgraphs needed to partition the edges of a graph G is denoted by b(G). A known lower bound on b(G) states that b(G) ≥ max{p(G), q(G)}, where p(G) and q(G) are the numbers of positive and negative eigenvalues of the adjacency matrix of G, respectively. When equality is attained, G is said to be eigensharp and when b(G) = max{p(G), q(G)} + 1, G is called an almost eigensharp graph. In this paper, we investigate the eigensharpness and almost eigensharpness of lexicographic products of some graphs.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.725-737
• /
• 2024

This article introduces the concepts of Energy and Laplacian Energy (LE) of Domination in Hesitancy fuzzy graph (DHFG). Also, the adjacency matrix of a DHFG is defined and proposed the definition of the energy of domination in hesitancy fuzzy graph, and Laplacian energy of domination in hesitancy fuzzy graph is given.

• 대한공간정보학회지
• /
• 제24권1호
• /
• pp.89-98
• /
• 2016

본 연구에서는 축척과 갱신 주기가 상이한 이종의 공간 데이터 셋을 융합하기 위하여 사용자의 개입을 최소화하면서 다대다 관계에도 적용이 가능한 기하학적 방법론 기반의 면 객체 자동 매칭 방법을 제안하였다. 이를 위하여 첫째, 포함함수가 0.4 이상인 객체(노드)는 인접행렬에서 에지로 연결되었고, 이들 인접행렬의 곱을 반복적으로 수행하여 다대다 관계를 포함하는 후보 매칭 쌍을 선정하였다. 다대다 관계인 면 객체들은 알고리즘으로 생성된 convex hull로 단일 면 객체로 변환하였다. 기하학적 매칭을 위하여, 매칭 기준을 설정하고, 이들을 유사도 함수를 이용하여 유사도를 계산하였다. 다음으로 변환된 유사도와 CRITIC 방법으로 도출된 가중치를 선형 조합하여 형상 유사도를 계산하였다. 마지막으로 훈련자료에서 모든 가중치에 대한 정확도와 재현율을 나타낸 PR 곡선의 교차점인 EER로 임계값을 선정하고, 이 임계값을 기준으로 매칭 유무를 판별하였다. 제안된 방법을 수치지도와 도로명 주소기본도에 적용한 결과, 일부 다대다 관계에서 잘못 매칭되는 경우를 시각적으로 확인할 수 있었으나, 통계적 평가에서 정확도, 재현율, F-measure가 각각 0.951, 0.906, 0.928로 높게 나타났다. 이는 제안된 방법으로 이종의 공간 데이터 셋을 자동으로 매칭하는데 그 정확도가 높음을 의미한다. 그러나 일부 오류가 발생한 다대다 관계인 후보 매칭 쌍을 정확하게 정량화하기 위해서 포함함수나 매칭 기준에 대한 연구가 진행되어야 할 것이다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제7권2호
• /
• pp.142-148
• /
• 2015

The main purpose of this squib is to provide a new principled account for variation of canonical sentence structure in Korean and Japanese based on the linguistic data commonly observed in some dialects of Korean and Japanese. Unlike the English case in which Comp(lementizer) such as 'that' in an embedded clause freely drops as far as the ECP (Lasnik & Saito 1992) is obeyed, some dialects of both Korean and Japanese show interesting linguistic data very different from those of English, thereby leading us to reasonably doubt the traditionally-accepted paradigm of the canonical sentence structure of CP for all languages. In this squib I propose, based on Korean & Japanese dialects and by developing the Minimal Structure Principle (MSP) ($Bo{\check{s}}kovi{\acute{c}}$ 1997, p. 25), that the cannonical structure of a sentence is not fixed, from the beginning at all, to be one single maximal category, CP. Instead, it should be decided to be either CP or IP, based on the feature of [${\pm}$markedness] and MSP, and the marked (or non-cannonical) embedded sentence needs to satisfy ECP for adjacency (or feature-licensing by the matrix verb in the MP terminology).

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.8-16
• /
• 2021

The tourism industry is influenced by a large number of factors that affect the development scenarios of the tourism in different ways. At the same time, tourism is an important component of the national economy of any state, forms its image, investment attractiveness, is a source of income and a stimulus for business development. The aim of the article is to conduct an empirical study to identify the importance of cognitive determinants in the development of tourism. The study used general and special methods: systems analysis, synthesis, grouping, systematization, cognitive modeling, cognitive map, pulse method, predictive extrapolation. Target factors, indicators, and control factors influencing the development of tourism in Ukraine are determined and a cognitive model is built, which graphically reflects the nature of the influence of these factors. Four main scenarios of the Ukrainian tourism industry are established on the basis of creating a matrix of adjacency of an oriented graph and forecast modeling based on a scenario approach. The practical significance of the obtained results lies in the possibility of their use to forecast the prospects of tourism development in Ukraine, the definition of state policy to support the industry that will promote international and domestic tourism.

• 한국전자거래학회지
• /
• 제25권3호
• /
• pp.131-145
• /
• 2020

전 세계적으로 SNS(social network service) 사용자와 사용 시간이 매년 증가하고 있으며, SNS의 영향력 또한 점점 커져가고 있다. 이에 따라 SNS는 일상적인 의사결정에서부터 기업의 경영활동에 이르기까지 광범위하게 영향을 미치고 있다. 따라서 SNS를 적절히 분석하는 것은 매우 의미 있는 작업이 될 수 있는데, 이에 많은 연구들이 SNS에서의 다양한 활동과 관계를 들여다보려는 많은 노력들을 하고 있다. 본 연구에서는 대표적인 SNS 서비스 가운데 하나인 트위터를 이용해서 SNS 팔로잉 관계를 분석하고자 한다. 즉, 기존의 SNS 분석과는 달리 두 개 계정이 공통으로 팔로잉하는 계정들을 추출하고 시각화 함으로써 해당 계정들의 관심사를 분석하고자 한다. 이를 위해서 마이크로소프트 액셀 매크로를 사용해 공통 팔로잉 계정을 추출하였으며, 인접행렬를 이용해 추출된 계정들 간의 관계를 정의하였다. 또한 팔로잉 관계 분석을 용이하게 하기 위해 방향 그래프를 이용해 시각화 하였으며, 이 같은 시각화에는 R 프로그래밍을 사용하였다.