• 아태비즈니스연구
• /
• 제14권1호
• /
• pp.411-426
• /
• 2023

Purpose - The purpose of this study was to explore and diagnose the characteristics and behavioural patterns of rural tourists after COVID-19 using decision tree analysis to classify and identify key segmentation groups. Design/methodology/approach - The CHAID algorithm was used as the analysis technique for the decision tree. The explanatory variables used in the analysis of each decision tree model were demographic variables and rural tourism usage behaviour and perception variables, and the target variables were the preferences of rural tourists' activities after COVID-19. From the Rural Tourism 2020 survey data, 614 samples with rural tourism experience were extracted and used in the analysis. Findings - The variables that significantly explained the preference for each type of rural tourism activity after COVID-19 were rural tourism safety perception, repeated visits to the region, rural tourism priority activity, rural tourism accommodation experience, gender, age group, marital status, occupation, and education level. Among them, rural tourism safety perception was the most important explanatory variable in each analysis model. Research implications or Originality - Overall, to promote rural tourism, it is necessary to enhance the safety image of rural tourism, strengthen loyalty programs for repeat visitors, and develop customized products that reflect the preferred trends of rural tourism.

• 대한원격탐사학회지
• /
• 제39권5_1호
• /
• pp.669-681
• /
• 2023

과일 나무의 생육을 평가하는 중요한 지표인 엽록소 함량을 추정하는데 비교적 많은 노동력의 투입이 요구되고 오랜 시간이 소요되는 기존의 파괴 조사 대신 비파괴적 조사 방식인 원격탐사기술을 적용하기 위한 연구가 시도되고 있다. 이 연구에서는 2년(2021, 2022) 간 무인기 기반의 초분광 영상을 이용하여 배나무 잎의 엽록소 함량을 비파괴적으로 추정하는 연구를 수행하였다. 영상 처리로 추출된 배나무 캐노피(canopy)의 단일 band 반사율은 시간 변화에 따라 불안정한 복사 효과를 최소화하기 위해 밴드비화(band rationing) 되었다. 밴드비(band ratios)를 입력 변수로 머신러닝 알고리즘인 elastic-net, k-nearest neighbors (KNN)과 support vector machine을 사용하여 추정(calibration, validation) 모델들을 개발하였다. Full band ratios 기반 추정 모델들의 성능과 비교하여 계산 비용 절감과 재현성 향상에 유리한 key band ratios를 선정하였다. 결과적으로 모든 머신러닝 모델에서 full band ratios를 이용한 calibration에 coefficient of determination (R²)≥0.67, root mean squared error (RMSE)≤1.22 ㎍/cm², relative error (RE)≤17.9%)와 validation에 R²≥0.56, RMSE≤1.41 ㎍/cm², RE≤20.7% 성능을 비교하였을 때, key band ratios 네 개가 선정되었다. 머신러닝 모델들 사이에 validation 성능에는 비교적 큰 차이가 없어 calibration 성능이 가장 높았던 KNN 모델을 기준으로 삼았으며, 그 key band ratios는 710/714, 718/722, 754/758, 758/762 nm가 선정되었다. Calibration에서 R²=0.80, RMSE=0.94 ㎍/cm², RE=13.9%와 validation에서 R²=0.57, RMSE=1.40 ㎍/cm², RE=20.5%를 나타내었다. Validation의 기준으로 한 성능 결과는 배나무 잎 엽록소 함량을 추정하기에 충분하지 않았지만, 앞으로의 연구에 기준이 될 key band ratios를 선정했다는 것에 의미가 있다. 추후 연구에서는 추정 성능을 향상하기 위해 지속적으로 추가 데이터세트를 확보하여 선정된 key band ratios의 신뢰성 검증과 함께 실제 과원에 재현 가능한 추정 모델로 고도화할 필요가 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.85-88
• /
• 2002

In this paper, the proposed watermark algorithm is based on energy distribution of the subband coefficients in the frequency domain and edge of the original image in the spacial domain. Out of these information, the KeyMap which decides the embedded position of watermark is produced. And then the binary watermark is embedded into the wavelet coefficient of LL3 subband using KeyMap and LFSR(Linear Feedback Shift Register).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• 한국컴퓨터정보학회논문지
• /
• 제22권2호
• /
• pp.81-87
• /
• 2017

Nowadays wine is increasingly enjoyed by a wider range of consumers, and wine certification and quality assessment are key elements in supporting the wine industry to develop new technologies for both wine making and selling processes. There have been many attempts to construct a more methodical approach to the assessment of wines, but most of them rely on objective decision rather than subjective judgement. In this paper, we propose a data mining approach to predict human wine taste preferences that is based on easily available analytical tests at the certification step. We used sequential forward selection and decision tree for this purpose. Experiments with the wine quality dataset from the UC Irvine Machine Learning Repository demonstrate the accuracies of 76.7% and 78.7% for red and white wines respectively.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.27-37
• /
• 2005

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed, A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolution strategy on RSTP based upon the Prim algorithm was presented. The computational results show that the evolution strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolution strategy is about 11%, which is almost similar to that of optimal solutions.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.1056-1064
• /
• 2003

The Euclidean steiner tree problem (ESTP) is to find a minimum-length euclidean interconnection of a set of points in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set steiner points, and the ESTP is NP-complete. The ESTP has received a lot of attention in the literature, and heuristic and optimal algorithms have been proposed. In real field, heuristic algorithms for ESTP are popular. A key performance measure of the algorithm for the ESTP is the reduction rate that is achieved by the difference between the objective value of the ESTP and that of the MST without steiner points. In recent survey for ESTP, the best heuristic algorithm showed around $3.14\%$ reduction in the performance measure. We present a evolution programming (EP) for ESTP based upon the Prim algorithm for the MST problem. The computational results show that the EP can generate better results than already known heuristic algorithms.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
• /
• pp.949-952
• /
• 2005

RS 시스템의 가장 큰 특징은 일대 다수의 그룹 및 지령 통신방식이다. TRS 시스템의 구성은 여러개의 그룹으로 구성되며, 각 그룹은 업무내용에 관련된 유사한 목적을 가진 사용자들의 단말기로 구성된다. 다양한 형태의 공격에 노출될 수 있으며, 대규모 통신을 위한 키 분배 혹은 설정에 많은 문제점을 가질 수 있다. 본 고에서는 TRS 상에서 안전한 통신을 수행하는데 있어 필수 요소인 회의용 키 분배 방식을 고찰한다. 본 방식은 통신 회수를 줄이면서도 사용자 인증을 수행할 수 있는 효율적인 Tree 기반의 회의용 키 분배 방식을 제안한다.

• 중소기업융합학회논문지
• /
• 제4권4호
• /
• pp.19-23
• /
• 2014

Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use the Group Key (GK) for encrypting and decrypting messages while providing enough security to protect against passive attacks. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH assumes all members have an equal computing power. One of the characteristics of distributed computing and grid environments is heterogeneity; the member can be at a workstation, a laptop or even a mobile computer. Member reordering in the TDGH protocol could potentially lead to an improved protocol; such reordering should capture the heterogeneity of the network as well as latency. This research investigates dynamic reordering mechanisms to consider not only the overhead involved but also the scalability of the proposed protocol.

• 정보보호학회논문지
• /
• 제16권1호
• /
• pp.97-104
• /
• 2006

이동 멀티캐스트 환경에서 다수의 이동 호스트가 안전하고 효율적인 멀티캐스트를 실현하기 위해서는 호스트의 이동성 및 무선 영역의 특성을 반영하는 키관리 방법이 요구된다. 본 논문에서는 이동 네트워크 구조를 반영한 KTMM 과 WSMM을 제안한다. 호스트의 이동에 따른 핸드오프와 그룹 멤버쉽 변화로 인한 키갱신을 처리하는 키 관리 구조 및 프로토콜을 설명하고, 실험을 통하여 데이터 전송, 멤버의 가입, 멤버의 탈퇴, 핸드오프 등으로 인해 발생하는 지연 시간을 서로 비교하여 각 방법의 장단점을 분석한다.