• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.321-324
• /
• 2017

버블정렬 그래프는 자료를 정렬하는 버블정렬 기법을 수학적 모델인 그래프로 모델링한 것이다. 버블정렬 그래프 Bn는 분지수 n, 라우팅 경로 길이 ${\frac{n(n-1)}{2}}$, 망비용 $O(n^3)$이다. 본 연구에서는 버블정렬 그래프의 망비용을 개선하기 위한 방법으로 버블정렬 그래프의 분지수 개수를 대략 ${\frac{1}{2}}$ 정도 줄인 제약조건을 제시한다. 이러한 제약 조건을 갖는 버블정렬 그래프는 임의의 노드 U에서 V까지 라우팅을 위해 연결된 그래프임을 증명한다.

• 전자공학회논문지C
• /
• 제35C권4호
• /
• pp.30-37
• /
• 1998

In this paper, we propose a test generation method for large scale sequential circuits based on circuit partitioning to increase the size of circuits that the implicit product machine traversal (IPMT) method can handle. Our method paratitions a circuit under test into subset circuits with only single output, and performs a partial scan design using the state transtition cost that represents a degree of the connectivity of the subset circuit. The IPMT method is applied to the partitioned partial scan circuits in test generation. Experimental results for ISCAS89 benchmark circuits with more thatn 50 flip-flops show that our method has generated test patterns with almost 100% fault coverage at high speed by use of 34%-73% scanned flip-flops.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.660-663
• /
• 2003

The advanced computer network technology enables connectivity of computers through an open network environment. There has been growing numbers of security threat to the networks. Therefore, it requires intrusion detection and prevention technologies. In this paper, we propose a network based intrusion detection model using Fuzzy Cognitive Maps(FCM) that can detect intrusion by the Denial of Service(DoS) attack detection method adopting the packet analyses. A DoS attack appears in the form of the Probe and Syn Flooding attack which is a typical example. The Sp flooding Preventer using Fuzzy cognitive maps(SPuF) model captures and analyzes the packet information to detect Syn flooding attack. Using the result of analysis of decision module, which utilized FCM, the decision module measures the degree of danger of the DoS and trains the response module to deal with attacks. The result of simulating the "KDD ′99 Competition Data Set" in the SPuF model shows that the Probe detection rates were over 97 percentages.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.533-544
• /
• 2013

The multiplicative version of Wiener index (${\pi}$-index), proposed by Gutman et al. in 2000, is equal to the product of the distances between all pairs of vertices of a (molecular) graph G. In this paper, we first present some sharp bounds in terms of the order and other graph parameters including the diameter, degree sequence, Zagreb indices, Zagreb coindices, eccentric connectivity index and Merrifield-Simmons index for ${\pi}$-index of general connected graphs and trees, as well as a Nordhaus-Gaddum-type bound for ${\pi}$-index of connected triangle-free graphs. Then we study the behavior of ${\pi}$-index upon the case when removing a vertex or an edge from the underlying graph. Finally, we investigate the extremal properties of ${\pi}$-index within the set of trees and unicyclic graphs.

• 한국통신학회논문지
• /
• 제26권10B호
• /
• pp.1399-1408
• /
• 2001

본 논문에서는 삼각형 메쉬(triangular mesh)로 이루어진 3차원 모델의 연결 정보(connectivity data)와 형상 정보(geometry data)를 삼각형 팬(triangle fan) 구조에 기반하여 효율적으로 압축하는 부호화 기법을 제안한다. 첫째로, 연결 정보의 무손실 부호화로 꼭지점 차수 왜곡(vertex degree warping) 기법을 제안한다. 기존의 알고리듬이 연결 정보와 형상 정보를 분리하여 부호화하는데 반해 제안하는 알고리듬은 연결 정보를 부호화하는데 형상 정보를 이용하여 압축 효율을 높인다. 둘째로, 형상 정보를 압축하기 위해 이중 평행사변형 예측(dual parallelogram prediction) 기법을 제안한다. 삼각형 팬 구조를 이용함으로써 기존의 삼각형 스트립(triangle strip) 기반의 알고리듬보다 정확한 형상 예측이 가능하고, 예측 오차가 작아지게 된다. 다양한 3차원 메쉬 모델에 대한 모의 실험을 통하여 제안하는 알고리듬이 기존의 알고리듬보다 우수한 압축 성능을 나타냄을 확인하다.

• Journal of Information Technology Applications and Management
• /
• 제19권4호
• /
• pp.213-225
• /
• 2012

The identified research result can be outlined more specifically as follows: first, informativeness of SNS was giving positive impact to some degree on the user satisfaction; second, connectivity of SNS was giving very positive impact on the user satisfaction; third, accessibility was giving very positive impact on the user satisfaction; forth, usability of SNS was giving very positive impact on the user satisfaction; fifth, amusement of SNS was giving very positive impact on the user satisfaction; the satisfaction level of SNS users gave positive impact on the further intention of SNS users. It was identified, however, that interactiveness of SNS was the factor that did not give much impact on the user satisfaction. This result comes from the analysis that SNS is convenient to actively explore and get further information that users wish to find, while they are insufficient in function to provide the information other users require or exchange information among users through the SNS.

• Journal of Electrical Engineering and Technology
• /
• 제13권2호
• /
• pp.998-1007
• /
• 2018

The advent of Wireless Sensor Networks (WSN) has led to their use in numerous applications. Sensors are autonomous in nature and are constrained by limited resources. Designing an autonomous topology with criteria for economic and energy conservation is considered a major goal in WSN. The proposed honey-hive clustering consumes minimum energy and resources with minimal transmission delay compared to the existing approaches. The honey-hive approach consists of two phases. The first phase is an Intra-Cluster Min-Max Discrepancy (ICMMD) analysis, which is based on the local honey-hive data gathering technique and the second phase is Inter-Cluster Frequency Matching (ICFM), which is based on the global optimal data aggregation. The proposed data aggregation mechanism increases the optimal connectivity range of the sensor node to a considerable degree for inter-cluster and intra-cluster coverage with an improved optimal energy conservation.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 2010년도 제22회 한글 및 한국어 정보처리 학술대회
• /
• pp.94-99
• /
• 2010

This paper is to present how a network between words is formed. Not only have we looked at the distributivity, frequency and strength in connections between related words, but we have also presented some way to shed lights on what this network means to linguistic and social studies. The target source is morpho-analysis components of Trends 21 corpus which cover all newspaper articles from lour major newspapers, including Chosun, Joongang, Donga, and Hankyoreh, issued between 2000 and 2008. Based on nodes, links, and their connectivity indexes - density, degree, and centralizations, we have been able to retrieve and cluster related words forming the network with 20 event nouns. To reduce noise, we have considered the words whose t-score is above 1.64. By conducting both network and statistical analyses, we have presented the network of each event noun.

• International Journal of Computer Science & Network Security
• /
• 제21권9호
• /
• pp.103-108
• /
• 2021

The emergence of new technologies and their implementation by different manufacturers of electronic devices are experiencing an ascending trend. Most of the time, these protocols are expected to reach a certain degree of maturity, and electronic equipment manufacturers use simplified communication standards and interfaces that have already reached maturity in terms of their development such as ModBUS, KNX or CAN. This paper proposes an IoT solution of the Smart Home type based on an Analysis and Prediction System. A data acquisition component was implemented and there was defined an algorithm for the analysis and prediction of actions based on the values collected from the data update component and the data logger records.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권2호
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.