• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1951-1966
• /
• 2020

Recent advancements in mobile device technology have enabled real-time positioning so that mobile patterns of people and favorable locations can be identified and related researches have become plentiful. One of the fields of research is the relationship between the object properties and the favored location to visit. The object properties of a person include personality, which is a major property jobs, income, gender, and age. In this study, we analyzed the relationship between the human personality and the preference of the location to visit. We used Spearman's Rank correlation coefficient, one of the many methods that can be used to determine the correlation between two variables. Instead of using actual data values, Spearman's Rank correlation coefficient deals with the ranks of the two data sets. In our research, the personality and the location data sets are used. Our personality data is ranked in five ranks and the location data is ranked in 8 ranks. Spearman's Rank correlation coefficient showed better results compared to Pearson linear correlation coefficient and Kendall rank correlation coefficient. Using Spearman's correlation coefficient, the degree of the relationship between the personality and the location preference is found to be 43%.

• Transactions of the Korean hydrogen and new energy society
• /
• v.30 no.2
• /
• pp.178-187
• /
• 2019

Due to the increasing demand of high rank coal, the use of low rank coal, which has economically advantage, is rising in various industries using carbonaceous solid fuels. In addition, the severe disaster of global warming caused by greenhouse gas emissions is becoming more serious. The Republic of Korea set a goal to reduce greenhouse gas emissions by supporting the use of biomass from the Paris International Climate Change Conference and the 8th Basic Plan for Electricity Supply and Demand. In line with these worldwide trends, this paper focuses on investigating the combustibility of high rank coal Carboone, low rank coal Adaro from Indonesia, Baganuur from Mongolia and, In biomass, wood pellet and herbaceous type Kenaf were simulated as kinetic reactivity model. The accuracy of the pore development model were compared with experimental result and analyzed using carbon conversion and tau with grain model, random pore model, and flexibility-enhanced random pore model. In row lank coal and biomass, FERPM is well-matched kinetic model than GM and RPM to using numerical simulations.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.4 s.152
• /
• pp.554-566
• /
• 2006

The purpose of this paper is to understand the ethnic characteristics of official uniforms of Qing(淸)) by comparing the rank systems of official uniforms of Ming(명(明)) and Qing(淸)) dynasties. As research documents, Dai-Ming-Huidian(大明會典)) and Qing-Huidian-Tu(淸明會圖)) have been used. This research shows that there are many traditional characteristics of Manchurians (滿族)) in the official uniforms of Qing(淸)) dynasty. The characteristics are as follows: First, Qing dynasty made their own official uniform based on the traditional Manchurians(滿族)) costume, and added rank system on it. Second, Qing dynasty used the animal's leather as the material of official uniforms and distinguished the level of the uniforms according to the rerity value of rareness, color, and warmth of the leather. Third, Qing dynasty used pearls produced in Manchuria as the highest level, as opposed to jades and rhinoceros horns of Ming. Fourth, Qing dynasty eliminated the animal's rank system of twelve patterns which had been used for whole history of China, but the Emperor is the only man who is able to use twelve patterns. Qing dynasty made her own pattern system of standstill/moving dragons and standstill/moving pythons. Fifth, Qing dynasty used the rank system by colors in the order of yellow, red, and blue consistently over various official uniforms, while Ming used different color orders for different uniforms.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.235-244
• /
• 1996

Ranked-set sampling is useful when measurements are destructive or costly to obtain but ranking of the observations is rel-atively easy. The Wilcoxon signed rank test statistic based on the ranked-set sample is considered. We compared the asymptotic relative efficiencies of the RSS Wilcoxon signed rank test statistics with respect to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic. Throughout the ARE's the proposed test statistic is superior to the SRS Wilcoxxon signed rank test statistic and the RSS sign test statistic.

• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.581-589
• /
• 2006

We characterize the linear operators which preserve the factor rank of integer matrices. That is, if $\mathcal{M}$ is the set of all $m{\times}n$ matrices with entries in the integers and min($m,n$) > 1, then a linear operator T on $\mathcal{M}$ preserves the factor rank of all matrices in $\mathcal{M}$ if and only if T has the form either T(X) = UXV for all $X{\in}\mathcal{M}$, or $m=n$ and T(X)=$UX^tV$ for all $X{\in}\mathcal{M}$, where U and V are suitable nonsingular integer matrices. Other characterizations of factor rank-preservers of integer matrices are also given.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1841-1850
• /
• 2014

It is known that the ranks of the semigroups $\mathcal{SOP}_n$, $\mathcal{SPOP}_n$ and $\mathcal{SSPOP}_n$ (the semigroups of orientation preserving singular self-maps, partial and strictly partial transformations on $X_n={1,2,{\ldots},n}$, respectively) are n, 2n and n + 1, respectively. The idempotent rank, defined as the smallest number of idempotent generating set, of $\mathcal{SOP}_n$ and $\mathcal{SSPOP}_n$ are the same value as the rank, respectively. Idempotent can be seen as a special case (with m = 1) of m-potent. In this paper, we investigate the m-potent ranks, defined as the smallest number of m-potent generating set, of the semigroups $\mathcal{SOP}_n$, $\mathcal{SPOP}_n$ and $\mathcal{SSPOP}_n$. Firstly, we characterize the structure of the minimal generating sets of $\mathcal{SOP}_n$. As applications, we obtain that the number of distinct minimal generating sets is $(n-1)^nn!$. Secondly, we show that, for $1{\leq}m{\leq}n-1$, the m-potent ranks of the semigroups $\mathcal{SOP}_n$ and $\mathcal{SPOP}_n$ are also n and 2n, respectively. Finally, we find that the 2-potent rank of $\mathcal{SSPOP}_n$ is n + 1.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.71-81
• /
• 2010

We characterize linear operators that preserve sets of matrix ordered pairs which satisfy extreme cases with respect to maximal column rank inequalities of matrix multiplications over semirings.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.45-50
• /
• 2018

This research paper describes how to summarize music lyrics using the TextRank algorithm. This method can summarize music lyrics as important lyrics. Therefore, we recommend music more effectively than analyzing the number of words and recommending music.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.169-171
• /
• 2003

웹에서의 검색 방법에는 크게 Text-Based 기법과 Link-Based 기법이 있다. 본 논문은 그 중에서 Link-Based 기법의 하나인 PageRank 알고리즘에 대해 연구 하고자 한다. 이 PageRank 알고리즘은 각 페이지의 중요성을 수치로 계산하는 방법이다. 하지만 이 알고리즘에서는 페이지에서 페이지로 링크를 따라갈 확률의 값을 일정하게 주어서 모든 페이지의 값을 획일적으로 계산하였기 때문에 각 페이지의 검색 효율성에 문제가 있다고 판단하여, 이를 해결하고자 본 논문은 페이지사이의 유사도를 측정하여 유사도에 따라 링크를 따라가는 확률 값인 Damping factor값을 다르게 부여하여 검색의 효율성을 높였다. 이를 위하여 두 가지 방법의 실험을 통하여 구현, 증명하였다.