KSII Transactions on Internet and Information Systems (TIIS)
/
v.16
no.2
/
pp.480-502
/
2022
This work assesses the degree of satisfaction tourists receive as final recipients in a tourism destination based on the fact that satisfied tourists can make a significant contribution to the growth and continuous improvement of a tourism business. The work considers Pokhara, the tourism capital of Nepal as a prefecture of study. A stratified sampling methodology with open-ended survey questions is used as a primary source of data for a sample size of 1019 for both international and domestic tourists. The data collected through a survey is processed using a data mining tool to perform multi-dimensional analysis to discover information patterns and visualize clusters. Further, supervised machine learning algorithms, kNN, Decision tree, Support vector machine, Random forest, Neural network, Naive Bayes, and Gradient boost are used to develop models for training and prediction purposes for the survey data. To find the best model for prediction purposes, different performance matrices are used to evaluate a model for performance, accuracy, and robustness. The best model is used in constructing a learning-enabled model for predicting tourists as satisfied, neutral, and unsatisfied visitors. This work is very important for tourism business personnel, government agencies, and tourism stakeholders to find information on tourist satisfaction and factors that influence it. Though this work was carried out for Pokhara city of Nepal, the study is equally relevant to any other tourism destination of similar nature.
Md. Abdur Rauf Sarkar;Salim Sarkar;Md Shohel Ul Islam;Fatema Tuz Zohra;Shaikh Mizanur Rahman
Genomics & Informatics
/
v.21
no.3
/
pp.36.1-36.19
/
2023
The LIM domain-containing proteins are dominantly found in plants and play a significant role in various biological processes such as gene transcription as well as actin cytoskeletal organization. Nevertheless, genome-wide identification as well as functional analysis of the LIM gene family have not yet been reported in the economically important plant sorghum (Sorghum bicolor L.). Therefore, we conducted an in silico identification and characterization of LIM genes in S. bicolor genome using integrated bioinformatics approaches. Based on phylogenetic tree analysis and conserved domain, we identified five LIM genes in S. bicolor (SbLIM) genome corresponding to Arabidopsis LIM (AtLIM) genes. The conserved domain, motif as well as gene structure analyses of the SbLIM gene family showed the similarity within the SbLIM and AtLIM members. The gene ontology (GO) enrichment study revealed that the candidate LIM genes are directly involved in cytoskeletal organization and various other important biological as well as molecular pathways. Some important families of regulating transcription factors such as ERF, MYB, WRKY, NAC, bZIP, C2H2, Dof, and G2-like were detected by analyzing their interaction network with identified SbLIM genes. The cis-acting regulatory elements related to predicted SbLIM genes were identified as responsive to light, hormones, stress, and other functions. The present study will provide valuable useful information about LIM genes in sorghum which would pave the way for the future study of functional pathways of candidate SbLIM genes as well as their regulatory factors in wet-lab experiments.
Journal of The Korean Society of Integrative Medicine
/
v.12
no.2
/
pp.155-166
/
2024
Purpose : This study aims to identify key factors for predicting dropout risk at the university level and to provide a foundation for policy development aimed at dropout prevention. This study explores the optimal machine learning algorithm by comparing the performance of various algorithms using data on college students' dropout risks. Methods : We collected data on factors influencing dropout risk and propensity were collected from N University. The collected data were applied to several machine learning algorithms, including random forest, decision tree, artificial neural network, logistic regression, support vector machine (SVM), k-nearest neighbor (k-NN) classification, and Naive Bayes. The performance of these models was compared and evaluated, with a focus on predictive validity and the identification of significant dropout factors through the information gain index of machine learning. Results : The binary logistic regression analysis showed that the year of the program, department, grades, and year of entry had a statistically significant effect on the dropout risk. The performance of each machine learning algorithm showed that random forest performed the best. The results showed that the relative importance of the predictor variables was highest for department, age, grade, and residence, in the order of whether or not they matched the school location. Conclusion : Machine learning-based prediction of dropout risk focuses on the early identification of students at risk. The types and causes of dropout crises vary significantly among students. It is important to identify the types and causes of dropout crises so that appropriate actions and support can be taken to remove risk factors and increase protective factors. The relative importance of the factors affecting dropout risk found in this study will help guide educational prescriptions for preventing college student dropout.
Park, Wan-Hyeok;Ko, Dongwook W.;Kwon, Tae-Sung;Nam, Youngwoo;Kwon, Young Dae
Journal of Korean Society of Forest Science
/
v.107
no.4
/
pp.486-496
/
2018
Pine wilt disease (PWD) in Gyeonggi province was first detected in Gwangju in 2007, and ever since has caused extensive damage. Insect vector and host tree in Gyeonggi province are Monochamus saltuarius and Pinus koraiensis, respectively, which are different from the southern region that consist of Monochamus alternatus and Pinus densiflora. Consequently, spread and mortality characteristics may be different, but our understanding is limited. In this research, we utilized the spatial data of newly infected trees in Gyeonggi province from 2008 to 2015 to analyze how it is related to various environmental and human factors, such as elevation, forest type, and road network. We also analyzed the minimum distance from newly infected tree to last year's closest infected tree to examine the dispersal characteristics based on new outbreak locations. Annual number of newly infected trees rapidly increased from 2008 to 2013, which then stabilized. Number of administrative districts with infected trees was 5 in 2012, 11 in 2013, and 15 in 2014. Most of the infected trees was Pinus koraiensis, with its proportion close to 90% throughout the survey period. Mean distance to newly infected trees dramatically decreased over time, from 4,111 m from 2012 to 2013, to approximately 600 m from 2013 to 2014 and 2014 to 2015. Most new infections occurred in higher elevation over time. Distance to road from newly infected trees continuously increased, suggesting that natural diffusion dispersal is increasingly occurring compared to human-influenced dispersal over time.
Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.
An, Ji Hong;Lim, Chi Hong;Jung, Song Hie;Kim, A Reum;Woo, Dong Min;Lee, Chang Seok
Journal of Korean Society on Water Environment
/
v.33
no.5
/
pp.511-524
/
2017
This study was carried out for the purpose of creating a restoration plan to improve the ecological quality of the Changwon and Nam streams. Based upon the results of comprehensive diagnostic assessment, restoration priority was given to the upstream reach, where conservation status is relatively superior. Restoration level was usually determined to practice active restoration as conservation, and the states of both Changwon and Nam streams were not so good. Restoration plans, by reach, were classified into "upstream", "midstream", and "downstream" were suggested in both terms of horizontal section frame and vegetation-based on the result of diagnostic assessment and the reference information. "Upstream", "mid-stream" and the "downstream" of Changwon and Nam streams were classified into "small-gravel- mountainous", "small-sand-plain", and "small-clay-plain streams" respectively (based on scale, and substrate and slope of river bed). The spatial arrangement of vegetation was laid out in diagram form by reflecting micro-topography and the water level of the horizontal section of river. Information regarding species composition was recommended as dominant species, which appear frequently in three vegetation zones composed of herbaceous plants, shrubs and trees and sub-tree- dominated zones divided by reflecting disturbance regime, depending on position on the horizontal section of river. Moreover, there have been prepared not only plans to improve the terrestrial ecosystems around the streams but also plans to create ecological networks, which can serve to improve the ecologic quality of the whole regional environment by serving to connect streams and terrestrial ecosystems, a process probably necessary and definitely recommended to realize true (genuine) restoration. Plans for ecological parks and networks were prepared by mimicking the species composition of Alnus japanica community, Zelkova serrata community, Carpinus laxiflora community, Quercus aliena community, and Q. serrata community.
Recognizing a basal group in a taxon is one of the most important factors involved in understanding the evolutionary history of that group of life. Many botanists have suggested a sister to all other angiosperms to understand the origin and rapid diversification of angiosperms based on morphological and fossil evidence. Recent technical advances in molecular biology and the accumulation of molecular phylogenetic data have provided evidence of the extant basal-most angiosperm which is a sister to all other angiosperms. Although it is still arguable, most plant taxonomists agree that Amborella trichopoda Baill., a species (monotypic genus and monotypic family) distributed in New Caledonia, is a sister to all other extant angiosperms based on evidence from the following molecular approaches: 1) classical phylogenetic analyses based on multiple genes (or DNA regions), 2) analyses of a tree network of duplicated gene families, and 3) gene-structural evidence. As an alternative hypothesis with relatively minor evidence, some researchers have also suggested that Amborella and Nymphaeaceae form a clade that is a sister to all other angiosperms. Debate regarding the basal-most angiosperms is still ongoing and is currently one of the hot issues in plant evolutionary biology. We expect that sequencing of the whole genome of Amborella as an evolutionary model plant and subsequent studies based on this genome sequence will provide information regarding the origin and rapid diversification of angiosperms, which is Darwin's so called abominable mystery.
The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.
The Journal of the Institute of Internet, Broadcasting and Communication
/
v.20
no.2
/
pp.1-11
/
2020
As an important basic building block of the smart grid environment, smart meter provides real-time electricity consumption information to the utility. However, ensuring information security and privacy in the smart meter data aggregation process is a non-trivial task. Even though the secure data aggregation for the smart meter has been a lot of attention from both academic and industry researchers in recent years, most of these studies are not secure against internal attackers or cannot provide data integrity. Besides, their computation costs are not satisfactory because the bilinear pairing operation or the hash-to-point operation is performed at the smart meter system. Recently, blockchains or distributed ledgers are an emerging technology that has drawn considerable interest from energy supply firms, startups, technology developers, financial institutions, national governments and the academic community. In particular, blockchains are identified as having the potential to bring significant benefits and innovation for the electricity consumption network. This study suggests a distributed, privacy-preserving, and simple secure smart meter data aggregation system, backed up by Blockchain technology. Smart meter data are aggregated and verified by a hierarchical Merkle tree, in which the consensus protocol is supported by the practical Byzantine fault tolerance algorithm.
Park, Yong-Hun;Yoon, Jong-Hyun;Seo, Bong-Min;Kim, June;Yoo, Jae-Soo
Journal of KIISE:Databases
/
v.36
no.2
/
pp.99-111
/
2009
In wireless sensor networks, various schemes have been proposed to store and process sensed data efficiently. A Data-Centric Storage(DCS) scheme assigns distributed data regions to sensors and stores sensed data to the sensor which is responsible for the data region overlapping the data. The DCS schemes have been proposed to reduce the communication cost for transmitting data and process exact queries and range queries efficiently. Recently, KDDCS that readjusts the distributed data regions dynamically to sensors based on K-D tree was proposed to overcome the storage hot-spots. However, the existing DCS schemes including KDDCS suffer from Query Hot-Spots that are formed if the query regions are not uniformly distributed. As a result, it causes reducing the life time of the sensor network. In this paper, we propose a new DCS scheme, called TPDCS(Time-Parameterized DCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed. data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the life time of sensor networks. It is shown through various experiments that our scheme outperform the existing schemes.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.