• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.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)
• /
• v.13 no.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.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.3
• /
• pp.239-244
• /
• 2010

In this paper, we study the adjacency matrix of a minimal connected quadrangular graph G, and then we obtain an upper bound on |E(G)| for such a graph G, and we obtain the graph for which the upper bound is attained. In addition, we obtain an upper bound on |E(G)| for a critical matching covered quadrangular graph G.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.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
• /
• v.42 no.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.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.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
• /
• v.21 no.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.

• The Journal of Society for e-Business Studies
• /
• v.25 no.3
• /
• pp.131-145
• /
• 2020

The numbers of SNS (Social Network Service) users and usage amounts are increasing every year. The influence of SNS is increasing also. SNS has a wide range of influences from daily decision-making to corporate management activities. Therefore, proper analysis of SNS can be a very meaningful work, and many studies are making a lot of effort to look into various activities and relationships in SNS. In this study, we analyze the SNS following relationships using Twitter, one of the representative SNS services. In other words, unlike the existing SNS analysis, our intention is to analyze the interests of the accounts by extracting and visualizing the accounts that two accounts follow in common. For this, a common following account was extracted using Microsoft Excel macros, and the relationship between the extracted accounts was defined using an adjacency matrix. In addition, to facilitate the analysis of the following relationships, a direction graph was used for visualization, and R programming was used for such visualization.