• Title/Summary/Keyword: Adjacency Graph

Search Result 58, Processing Time 0.018 seconds

Formation of Scenarios for The Development of The Tourism Industry of Ukraine With The Help of Cognitive Modeling

  • Shelemetieva, Tetiana;Zatsepina, Nataly;Barna, Marta;Topornytska, Mariia;Tuchkovska, Iryna
    • 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.

Development of deep learning structure for complex microbial incubator applying deep learning prediction result information (딥러닝 예측 결과 정보를 적용하는 복합 미생물 배양기를 위한 딥러닝 구조 개발)

  • Hong-Jik Kim;Won-Bog Lee;Seung-Ho Lee
    • Journal of IKEEE
    • /
    • v.27 no.1
    • /
    • pp.116-121
    • /
    • 2023
  • In this paper, we develop a deep learning structure for a complex microbial incubator that applies deep learning prediction result information. The proposed complex microbial incubator consists of pre-processing of complex microbial data, conversion of complex microbial data structure, design of deep learning network, learning of the designed deep learning network, and GUI development applied to the prototype. In the complex microbial data preprocessing, one-hot encoding is performed on the amount of molasses, nutrients, plant extract, salt, etc. required for microbial culture, and the maximum-minimum normalization method for the pH concentration measured as a result of the culture and the number of microbial cells to preprocess the data. In the complex microbial data structure conversion, the preprocessed data is converted into a graph structure by connecting the water temperature and the number of microbial cells, and then expressed as an adjacency matrix and attribute information to be used as input data for a deep learning network. In deep learning network design, complex microbial data is learned by designing a graph convolutional network specialized for graph structures. The designed deep learning network uses a cosine loss function to proceed with learning in the direction of minimizing the error that occurs during learning. GUI development applied to the prototype shows the target pH concentration (3.8 or less) and the number of cells (108 or more) of complex microorganisms in an order suitable for culturing according to the water temperature selected by the user. In order to evaluate the performance of the proposed microbial incubator, the results of experiments conducted by authorized testing institutes showed that the average pH was 3.7 and the number of cells of complex microorganisms was 1.7 × 108. Therefore, the effectiveness of the deep learning structure for the complex microbial incubator applying the deep learning prediction result information proposed in this paper was proven.

Twitter Following Relationship Analysis through Network Analysis and Visualization (네트워크 분석과 시각화를 통한 트위터 팔로우십 분석)

  • Song, Deungjoo;Lee, Changsoo;Park, Chankwon;Shin, Kitae
    • 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.

An improved Bellman-Ford algorithm based on SPFA (SPFA를 기반으로 개선된 벨만-포드 알고리듬)

  • Chen, Hao;Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.721-726
    • /
    • 2012
  • In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

Semi-automatic 3D Building Reconstruction from Uncalibrated Images (비교정 영상에서의 반자동 3차원 건물 모델링)

  • Jang, Kyung-Ho;Jang, Jae-Seok;Lee, Seok-Jun;Jung, Soon-Ki
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1217-1232
    • /
    • 2009
  • In this paper, we propose a semi-automatic 3D building reconstruction method using uncalibrated images which includes the facade of target building. First, we extract feature points in all images and find corresponding points between each pair of images. Second, we extract lines on each image and estimate the vanishing points. Extracted lines are grouped with respect to their corresponding vanishing points. The adjacency graph is used to organize the image sequence based on the number of corresponding points between image pairs and camera calibration is performed. The initial solid model can be generated by some user interactions using grouped lines and camera pose information. From initial solid model, a detailed building model is reconstructed by a combination of predefined basic Euler operators on half-edge data structure. Automatically computed geometric information is visualized to help user's interaction during the detail modeling process. The proposed system allow the user to get a 3D building model with less user interaction by augmenting various automatically generated geometric information.

  • PDF

Rate-distortion based image segmentation using recursive merging (반복적 병합을 이용한 율왜곡 기반 영상 분할)

  • 전성철;임채환;김남철
    • Journal of Broadcast Engineering
    • /
    • v.4 no.1
    • /
    • pp.44-58
    • /
    • 1999
  • In this paper, a rate-distortion based image segmentation algorithm is presented using a recursive merging with region adjacency graph (RAG). In the method, the dissimilarity between a pair of adjacent regions is represented as a Lagrangian cost function considered in rate-distortion sense. Lagrangian multiplier is estimated in each merging step, a pair of adjacent regions whose cost is minimal is searched and then the pair of regions are merged into a new region. The merging step is recursively performed until some termination criterion is reached. The proposed method thus is suitable for region-based coding or segmented-based coding. Experiment results for 256x256 Lena show that segmented-based coding using the proposed method yields PSNR improvement of about 2.5 - 3.5 dB. 0.8 -1.0 dB. 0.3 -0.6 dB over mean-difference-based method. distortion-based method, and JPEG, respectively.

  • PDF

A Reexamination on the Influence of Fine-particle between Districts in Seoul from the Perspective of Information Theory (정보이론 관점에서 본 서울시 지역구간의 미세먼지 영향력 재조명)

  • Lee, Jaekoo;Lee, Taehoon;Yoon, Sungroh
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.109-114
    • /
    • 2015
  • This paper presents a computational model on the transfer of airborne fine particles to analyze the similarities and influences among the 25 districts in Seoul by quantifying a time series data collected from each district. The properties of each district are driven with the model of a time series of the fine particle concentrations, and the calculation of edge-based weights are carried out with the transfer entropies between all pairs of the districts. We applied a modularity-based graph clustering technique to detect the communities among the 25 districts. The result indicates the discovered clusters correspond to a high transfer-entropy group among the communities with geographical adjacency or high in-between traffic volumes. We believe that this approach can be further extended to the discovery of significant flows of other indicators causing environmental pollution.

Image Restoration and Segmentation for PAN-sharpened High Multispectral Imagery (PAN-SHARPENED 고해상도 다중 분광 자료의 영상 복원과 분할)

  • Lee, Sanghoon
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.6_1
    • /
    • pp.1003-1017
    • /
    • 2017
  • Multispectral image data of high spatial resolution is required to obtain correct information on the ground surface. The multispectral image data has lower resolution compared to panchromatic data. PAN-sharpening fusion technique produces the multispectral data with higher resolution of panchromatic image. Recently the object-based approach is more applied to the high spatial resolution data than the conventional pixel-based one. For the object-based image analysis, it is necessary to perform image segmentation that produces the objects of pixel group. Image segmentation can be effectively achieved by the process merging step-by-step two neighboring regions in RAG (Regional Adjacency Graph). In the satellite remote sensing, the operational environment of the satellite sensor causes image degradation during the image acquisition. This degradation increases variation of pixel values in same area, and results in deteriorating the accuracy of image segmentation. An iterative approach that reduces the difference of pixel values in two neighboring pixels of same area is employed to alleviate variation of pixel values in same area. The size of segmented regions is associated with the quality of image segmentation and is decided by a stopping rue in the merging process. In this study, the image restoration and segmentation was quantitatively evaluated using simulation data and was also applied to the three PAN-sharpened multispectral images of high resolution: Dubaisat-2 data of 1m panchromatic resolution from LA, USA and KOMPSAT3 data of 0.7m panchromatic resolution from Daejeon and Chungcheongnam-do in the Korean peninsula. The experimental results imply that the proposed method can improve analytical accuracy in the application of remote sensing high resolution PAN-sharpened multispectral imagery.