• Journal of the Korean Society of Costume
• /
• v.61 no.10
• /
• pp.135-150
• /
• 2011

The ranking belts for Joseon dynasty officials that are based on references and relics are studied in this paper in terms of architecture, detailed names, and structural changes according to different time. Officials' uniforms consist of hats, clothes, belts, and shoes. Among these, the belt is an important sign that represents the wearer's ranking. The ranking belts of the Joseon dynasty which were brought from Ming at the late stage of the Koryo dynasty became classified as the following four classes : Seo-dai(a rhinoceros' horn, 犀帶), Gum-dai(gold, 金帶), Eun-dai(silver, 銀帶), and Heug-gag-dai(black horn, 黑角帶). A ranking belt consists of a basic belt body and a plaque that represents the wearer's rank. A plaque consists of 20 plates: three front-center plates that represent the Sam-tai(三台) constellation, six front-side plates that represent the Namduyug constellation(南斗六星), seven back plates that represent the Big Dipper(北斗七星), left side Bo(輔), right side Pil(弼), and a couple of Tamie at both ends. The architecture of the belt body; the basic frame for ranking belts, shows some differences between the former and the latter periods of the Joseon dynasty. In the former period, the belt had a pair of a buckle so that the wearers were able to adjust the belt size. But later, the belt didn't have the buckles to adjust the belt size and consequently it only performed a locking or unlocking function. Therefore, the belts in the latter period were longer than normal and one size fit all. In addition to the functional change of buckles, the shapes of the ranking belts show changes from the round shape to the square shape as time goes on.

• The Journal of Aerospace Industry
• /
• s.66
• /
• pp.45-56
• /
• 2003

Airlines service is very important so as to overcome the rapid environmental changes of the air transportation market at home and abroad. Author investigates the impact of Determinants on the performance of airlines in all the world. Three variables of performance measurement were used : revenue, net profit, and passengers. Data analyses were based on service ranking, financial and passenger information of the world's top 50 Airlines collected from Business Traveller, World Air Transport Statistics and Airline Business. The findings of this study could be summarized as follows : Service ranking was not related to the airlines performances such as revenue, net profit, passengers and so fourth. But airlines size(employees, fleet size) was related to the airlines performances such as passengers and revenue passenger.

• Journal of Nutrition and Health
• /
• v.28 no.8
• /
• pp.791-799
• /
• 1995

Agreement between open question and closed question on portion size of a food frequency questionnaire was assessed for the influence by the restricted choices in closed question on estimated nutrient intakes and agreement of ranking individuals. Dietary intakes of 361 subjects in a rural country, Yang-pyeung Gun were obtained using a interview method. The results are as follows ; 1) Nutrients intakes calculated from closed question on portion size were lower than those calculated from open question on portion size. 2) For most nutrients the percentage of Korean RDA were significantly lower with closed question than open question. 3) Correlation coefficient of nutrient intakes and food intakes obtained by two methods were higher than 0.6 for all nutrients and food items. 4) For each nutrient, misclassification into extreme quartiles was less than 1 percent. 5) These data indicate that closed question on portion size can provide the corresponding information as open question if food frequency questionnarie is used for the ranking of individuals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1454-1466
• /
• 2016

This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.

• The Korean Journal of Applied Statistics
• /
• v.30 no.6
• /
• pp.1015-1025
• /
• 2017

Bayesian personalized ranking (BPR) is a state-of-the-art recommendation system techniques for implicit feedback data. Unfortunately, there might be a loss of information because the BPR model considers only the binary transformation of implicit feedback that is non-binary data in most cases. We propose a modified BPR method using a level of confidence based on the size or strength of implicit feedback to overcome this limitation. The proposed method is useful because it still has a structure of interpretable models for underlying personalized ranking i.e., personal pairwise preferences as in the BPR and that it is capable to reflect a numerical size or the strength of implicit feedback. We propose a computation algorithm based on stochastic gradient descent for the numerical implementation of our proposal. Furthermore, we also show the usefulness of our proposed method compared to ordinary BPR via an analysis of steam video games data.

• Safety and Health at Work
• /
• v.13 no.2
• /
• pp.207-212
• /
• 2022

Background: The public now imposes higher demands on the government than in the past, which has created the role overload faced by low-ranking government employees in China. This research investigates the relationship between role overload and health among low-ranking government employees and explores the mediating effects of burnout. Methods: It draws on a survey of 2064 low-ranking government employees by probability proportionate to size sampling in China's Shandong Province. Structural equation modeling (SEM) methods are used to analyze the data. Results: Both role overload and burnout were found to have negative effects on low-ranking government employees' health; however, the associations varied among the three age groups (less than 36, between 36 and 45, and over 45). Those over 45 reported the highest level of both physical and psychological health, while the youngest age group (less than 36) reported the lowest level of health. Role overload has a direct influence on health among government employees over 45 but not among those below 45. Burnout's mediating effects between role overload and health are significant among all age groups, but most significant among the youngest civil servants below 36. Conclusions: The findings evidenced that both role overload and burnout affect low-ranking government employees' self-reported physical and psychological health. In addition, the effect of age differences in coping with role stressors and burnout should be considered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.5 no.1
• /
• pp.45-51
• /
• 1979

This paper presents a heuristic solution procedure for the quadratic assignment problem, ranking procedure, which can handle the case where not all of the facilities have the same size of area. The ranking procedure is found more efficient than two other existing heuristic procedures from results of computational experience. Based on the out-patients flow pattern and the procedure developed, an improved layout of the three existing general hospitals is developed with the objective of minimizing the total distance travelled by patients in the central and the out-patient clinic.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.47-53
• /
• 2016

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%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.143-146
• /
• 2015

Software Defined Network (SDN) separates control plane and data plane to achieve benefits such as centralized management, centralized provisioning, lower device cost and more flexibility. In SDN, scalability is an important issue. Centralized controller can be a bottle neck and many research tried to solve this issue on the control plan. However, scalability issue does not only happen in the control plane, but also happen in the data plane. In the data plane, flow table is an important component and its size is limited. In a large network operated by SDN technology, the performance of the network can be highly degraded because of the size limitation of a flow table. In this paper, we propose a ranking-based flow replacement method, Flow Table Management (FTM), to overcome this problem.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.71-77
• /
• 2015

This paper implements an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks and performance analyzes of the algorithm. Existing algorithm has a time complexity problem which is increasing performance time by network size. This problem also causes ranking process in large-scale workflow-supported social networks. To solve such problems, this paper conducts comparison analysis on the existing algorithm and estimated results by applying estimated-driven RankCCWSSN(Rank Closeness Centrality Workflow-supported Social Network). The RankCCWSSN algorithm proved its time-efficiency in a procedure about 50% decrease.