Ko, HyunJung;Jeong, Seok Hee;Lee, Eun Jee;Kim, Hee Sun
Journal of Korean Academy of Nursing
/
v.53
no.6
/
pp.635-651
/
2023
Purpose: This study aimed to identify the main keyword, network structure, and main topics of the national petition related to "nursing" in South Korea. Methods: Data were gathered from petitions related to the national petition in Korea Blue House related to the topic "nursing" or "nurse" from August 17, 2017, to May 9, 2022. A total of 5,154 petitions were searched, and 995 were selected for the final analysis. Text network analysis and topic modeling were analyzed using the Netminer 4.5.0 program. Results: Regarding network characteristics, a density of 0.03, an average degree of 144.483, and an average distance of 1.943 were found. Compared to results of degree centrality and betweenness centrality, keywords such as "work environment," "nursing university," "license," and "education" appeared typically in the eigenvector centrality analysis. Topic modeling derived four topics: (1) "Improving the working environment and dealing with nursing professionals," (2) "requesting investigation and punishment related to medical accidents," (3) "requiring clear role regulation and legislation of medical and nonmedical professions," and (4) "demanding improvement of healthcare-related systems and services." Conclusion: This is the first study to analyze Korea's national petitions in the field of nursing. This study's results confirmed both the internal needs and external demands for nurses in South Korea. Policies and laws that reflect these results should be developed.
A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.
Park, Un-Sik;Choi, Jae-Weon;Yoo, Wan-Suk;Lee, Man-Hyung;Son, Kwon;Lee, Jang-Myung;Lee, Min-Cheol;Han, Sung-Hyun
Journal of Mechanical Science and Technology
/
v.17
no.1
/
pp.11-22
/
2003
In this paper, a method for optimal placement of sensors and actuators is presented by using new measures of modal controllability and observability defined in a balanced coordinate system. The proposed new measures are shown to have a great advantage in practical use when they are used as criteria for selecting the locations of sensors and actuators, since the most controllable and observable locations can be obtained to be identical. In addition, they are more accurate than the measures of Hamdan and Nayfeh in that the effects of the eigenvector norm are considered into the magnitude of measures. In simulations, to verify the effectiveness of the proposed measures and optimal placement method, the closed-loop response of a simply supported flexible beam, in which the number and locations of actuators are determined by using the proposed measures and optimal placement method, has been examined and compared with the case of Hamdan and Nayfeh’s measures.
Generally, traditional approaches to track the target position are to estimate ranges and bearings by 2-D MUSIC (MUltiple 519na1 Classification) method. and to associate estimates of 2-D MUSIC made at different time points with the right targets by JPDA (Joint Probabilistic Data Association) filter in the near field. However, the disadvantages of these approaches are that these have the data association Problem in tracking multiple targets. and that these require the heavy computational load in estimating a 2-D range/bearing spectrum. In case multiple targets are adjacent. the tracking performance degrades seriously because the estimate of each target's Position has a large error. In this paper, we proposed a new tracking algorithm using Position innovations extracted from the senor output covariance matrix in the near field. The proposed algorithm is demonstrated by the computer simulations dealing with the tracking of multiple closing and crossing targets.
KSII Transactions on Internet and Information Systems (TIIS)
/
v.15
no.10
/
pp.3571-3587
/
2021
For accurately analysing and forecasting the social networks of China's political, economic and social power elites, it is necessary to develop a database that collates their information. The development of such a database involves three stages: data definition, data collection and data quality maintenance. The present study recommends distinctive solutions in overcoming the challenges that occur in existing comparable databases. We used organizational and event factors to identify the Chinese power elites to be included in the database, and used their memberships, social relations and interactions in combination with flows data collection methodologies to determine the associations between them. The system can be used to determine the optimal relationship path (i.e., the shortest path) to reach a target elite and to identify of the most important power elite in a social network (e.g., degree, closeness and eigenvector centrality) or a community (e.g., a clique or a cluster). We have used three social network analysis tools (i.e., R, UCINET and NetMiner) in order to find the important nodes in the network. We compared the results of centrality rankings of each tool. We found that all three tools are providing slightly different results of centrality. This is because different tools use different algorithms and even within the same tool there are various libraries which provide the same functionality (i.e., ggraph, igraph and sna in R that provide the different function to calculate centrality). As there are chances that the results may not be the same (i.e. centrality rankings indicating the most important nodes can be varied), we recommend a comparison test using different tools to get accurate results.
KSII Transactions on Internet and Information Systems (TIIS)
/
v.15
no.4
/
pp.1502-1520
/
2021
This paper attempts to investigate Korean youth Not in Education, Employment and Training (NEET) and how daily activities and community participation may influence their positive emotions and job search desire. First, we conducted a focus group interview with 16 NEETs who participated in the Kakao NEET Company project. The project allowed participants to experience employment by founding a virtual company in which each participant selected a daily activity to perform as part of the company's operations. Second, the interview responses were categorized and assigned emotional values using the card sorting technique and multi-dimensional analysis (MDS). A total of 11 emotional values were derived through this process. Finally, a social network analysis was conducted in order to measure the density of relations among the emotional values. Results suggest that immersion, confidence, belongingness were the three highest values evaluated by participants. Furthermore, network diagrams imply that the stronger participants perceived social support and belongingness with others, the stronger their responsibility grew, further leading them to establish steady goals. In particular, the high eigenvector score for "desire for job" suggests that emotional values are sequentially connected to the immersion-social support-responsibility-goal-job desire. This sequence suggests that digital services that are developed with the aim to enhance social values such as the Kakao NEET Project may engender motivation and confidence in youth NEETs. The overall results suggest that a systematic approach to policymaking should be considered in order to provide fundamental solutions and expand opportunities for social participation and emotional comfort, as social isolation due to low self-esteem has been reported as one of the reasons for NEETs' failure in the labor market.
NA Jung-Yul;HAN Snag-Kyu;SEO Jang-Won;NOH Yi-Gn;KANG In-Sik
Korean Journal of Fisheries and Aquatic Sciences
/
v.30
no.2
/
pp.188-202
/
1997
The seasonal variability of the sea surface winds over the last Sea of Korea (Japan Sea) is investigated by means of empirical orthogonal function (EOF) analysis. The combined representation of fields of three climatic variables by empirical orthogonal functions is discussed. The eigenvectors are derived from daily sea level pressure, wind speed and 10-day mean sea surface temperature (SST) during 15 years $(1978\~1992)$. The spatial patterns of the mean pressure are characterized by the high pressure in the western part and the low pressure in the eastern part. The spatial distribution of the standard deviation (SD) of pressure are characterized by max SD of 6.6 mb near the Vladivostok, and minima along the coast of the Japan. In Vladivostok, the maxima of SD of SST and south-north wind (WV) were also occurred. The representation of fields of individual meteorological variables by EOF shows that the first mode of the west-east wind (WU) explain over $47.3\%$ of the variance and the second mode of WU represents $30\%$. Especially, the first mode of the WV explain $70.9\%$ of the variance and their time series coefficients show 1-cpy, 0.5-cpy frequency spectrum. The spatial distribution of the first mode eigenvectors of SST are characterized by maximum near Vladivostok. The combined representation of fields of several variables (pressure, wind, SST) reveals that the first mode magnitudes of the variance of the combined eigenvectors (WU-PR) are increased. By means of this result, the 1-year peak and the 6-months peak are remarkable. In the three combined patterns (wind, pressure, SST), the second mode of the eigenvector (wind) is affected by the SST. Their time coefficients of the first mode show noticeable 1-year peak. The spectral analysis of the second mode shows broad seasonal signal with the period of 4-months and a significant peak of variability at 3-month period.
Purpose: The size of the salad consumption market has expanded since Covid-19, and continuous growth is predicted. Therefore, by extracting influential core purchasers in the salad consumption market and analyzing their purchasing behaviors and consumer types, this study intended to provide basic data for establishing a marketing strategy. Methods: The analysis data is the purchasing data of 576 people who have purchased salads between 2016 and 2020 (panel data of the Rural Development Administration), and in the social network analysis, the centrality structure was analyzed. Results: First, in the results of analyzing the causes of the rapid increase in salad consumption in 2020, it was found that the increase in consumption of new purchasers (n=102) had little effect. The existing consumer type (n = 474), which has been the majority of the salad consumption market so far, were consumers with stable income. However, the results of study indicated that the type of consumers has expanded since low-income class as well as high-income class increased consumption of purchasing salad. Second, in the results of analyzing the types of key purchasers with great influence in the salad consumption market, there was a difference from the results of frequency analysis in age, number of family members, existence/absence of children, and income decile. This suggests that there should be a difference between the type of customers according to the apparent quantitative figure and the actual influential purchasers. Third, in the results of analyzing the salad purchasing behaviors of core purchasers, the purchasing site for existing purchasers was large-scale marts and for new purchasers it was corporate-type supermarkets. Purchases were concentrated on Saturdays for both existing and new purchasers. As for the purchased products, existing purchasers had a high preference for products made of chicken, and new purchasers had a high preference for vegetable/fruit salad. In particular, in the results of purchased products by age group, in the case of 50s and 60s, it was an interesting result that there was a difference between the products purchased by the existing and new purchasers even though they were the same age. Conclusion: When establishing a marketing strategy in the salad consumption market, it is necessary to pay attention to the purchasing behavior of key buyers.
This study was conducted using text mining and network theory to extract useful information for application for occupancy and performance of permit tasks contained in the permit contents from the permit register, which is used only for the simple purpose of recording occupancy permit information. Based on text mining, we analyzed and compared the frequency of vocabulary occurrence and topic modeling in five regions, including Seoul, Gyeonggi, Gyeongsang, Jeolla, Chungcheong, and Gangwon, as well as normalization processes such as stopword removal and morpheme analysis. By applying four types of centrality algorithms, including stage, proximity, mediation, and eigenvector, which are widely used in network theory, we looked at keywords that are in a central position or act as an intermediary in the network. Through a comprehensive analysis of vocabulary appearance frequency, topic modeling, and network centrality, it was found that the 'installation' keyword was the most influential in all regions. This is believed to be the result of the Ministry of Environment's permit management office issuing many permits for constructing facilities or installing structures. In addition, it was found that keywords related to road facilities, flood control facilities, underground facilities, power/communication facilities, sports/park facilities, etc. were at a central position or played a role as an intermediary in topic modeling and networks. Most of the keywords appeared to have a Zipf's law statistical distribution with low frequency of occurrence and low distribution ratio.
Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.