• Title/Summary/Keyword: and rank

Search Result 3,817, Processing Time 0.041 seconds

Joseons Badge System for Military Ranks and Practices (조선시대 무관의 길짐승흉배제도와 실제)

  • Lee, Eun-Joo
    • Journal of the Korean Society of Costume
    • /
    • v.58 no.5
    • /
    • pp.102-117
    • /
    • 2008
  • This study shows the badge system for military officials of Joseon dynasty. The badge system for military officials of the 15th century consists of rank badges with tiger and leopard for the first and second ranks and rank badges with bear for the third rank. According to the code of laws, military officials are supposed to wear the rank badges with four different kinds of animals in Joseon dynasty. However, the badge system shown in the code of laws sometimes does not match with the badges in practices. Based on the literature, remaining badges and the badges in portraits, six different kinds of badges with animals are found : First, rank badges with tiger and leopard were used until the late 16th century. Second, rank badges with tiger were found in the period between the early 17th century and the latter 18th century. Third, rank badges with Haechi were found in the early 17th century. Fourth, rank badges with lions can be found in remains of the mid 17th century, the literature and the portrait of the late 18th century. Finally, the rank badges with double leopards or with single leopard were found from a portrait dated the late of 18th century to the last period of Joseon dynasty.

Linear Operators which Preserve Pairs on which the Rank is Additive

  • Beasley, LeRoy B.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.2
    • /
    • pp.27-30
    • /
    • 1998
  • Let A and B be $m{\times}n$ matrices. A linear operator T preserves the set of matrices on which the rank is additive if rank(A+B) = rank(A)+rank(B) implies that rank(T(A) + T(B)) = rankT(A) + rankT(B). We characterize the set of all linear operators which preserve the set of pairs of $n{\times}n$ matrices on which the rank is additive.

  • PDF

STRONG PRESERVERS OF SYMMETRIC ARCTIC RANK OF NONNEGATIVE REAL MATRICES

  • Beasley, LeRoy B.;Encinas, Luis Hernandez;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1503-1514
    • /
    • 2019
  • A rank 1 matrix has a factorization as $uv^t$ for vectors u and v of some orders. The arctic rank of a rank 1 matrix is the half number of nonzero entries in u and v. A matrix of rank k can be expressed as the sum of k rank 1 matrices, a rank 1 decomposition. The arctic rank of a matrix A of rank k is the minimum of the sums of arctic ranks of the rank 1 matrices over all rank 1 decomposition of A. In this paper we obtain characterizations of the linear operators that strongly preserve the symmetric arctic ranks of symmetric matrices over nonnegative reals.

Spanning column rank 1 spaces of nonnegative matrices

  • Song, Seok-Zun;Cheong, Gi-Sang;Lee, Gwang-Yeon
    • Journal of the Korean Mathematical Society
    • /
    • v.32 no.4
    • /
    • pp.849-856
    • /
    • 1995
  • There are some papers on structure theorems for the spaces of matrices over certain semirings. Beasley, Gregory and Pullman [1] obtained characterizations of semiring rank 1 matrices over certain semirings of the nonnegative reals. Beasley and Pullman [2] also obtained the structure theorems of Boolean rank 1 spaces. Since the semiring rank of a matrix differs from the column rank of it in general, we consider a structure theorem for semiring rank in [1] in view of column rank.

  • PDF

BEYOND THE CACTUS RANK OF TENSORS

  • Ballico, Edoardo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.5
    • /
    • pp.1587-1598
    • /
    • 2018
  • We study additive decompositions (and generalized additive decompositions with a zero-dimensional scheme instead of a finite sum of rank 1 tensors), which are not of minimal degree (for sums of rank 1 tensors with more terms than the rank of the tensor, for a zero-dimensional scheme a degree higher than the cactus rank of the tensor). We prove their existence for all degrees higher than the rank of the tensor and, with strong assumptions, higher than the cactus rank of the tensor. Examples show that additional assumptions are needed to get the minimally spanning scheme of degree cactus +1.

LINEAR PRESERVERS OF SYMMETRIC ARCTIC RANK OVER THE BINARY BOOLEAN SEMIRING

  • Beasley, LeRoy B.;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1317-1329
    • /
    • 2017
  • A Boolean rank one matrix can be factored as $\text{uv}^t$ for vectors u and v of appropriate orders. The perimeter of this Boolean rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A Boolean matrix of Boolean rank k is the sum of k Boolean rank one matrices, a rank one decomposition. The perimeter of a Boolean matrix A of Boolean rank k is the minimum over all Boolean rank one decompositions of A of the sums of perimeters of the Boolean rank one matrices. The arctic rank of a Boolean matrix is one half the perimeter. In this article we characterize the linear operators that preserve the symmetric arctic rank of symmetric Boolean matrices.

Implementation of Rank/Select Data Structure using Alphabet Frequency (문자의 빈도수를 고려한 Rank/Select 자료구조 구현)

  • Kwon, Yoo-Jin;Lee, Sun-Ho;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.4
    • /
    • pp.283-290
    • /
    • 2009
  • The rank/select data structure is a basic tool of succinct representations for several data structures such as trees, graphs and text indexes. For a given string sequence, it is used to answer the occurrence of characters up to a certain position. In previous studies, theoretical rank/select data structures were proposed, but they didn't support practical operational time and space. In this paper, we propose a simple solution for implementing rank/select data structures efficiently. According to experiments, our methods without complex encodings achieve nH$_0$ + O(n) bits of theoretical size and perform rank/select operations faster than the original HSS data structure.

Up-Regulation of RANK Expression via ERK1/2 by Insulin Contributes to the Enhancement of Osteoclast Differentiation

  • Oh, Ju Hee;Lee, Na Kyung
    • Molecules and Cells
    • /
    • v.40 no.5
    • /
    • pp.371-377
    • /
    • 2017
  • Despite the importance of the receptor activator of nuclear factor (NF)-kappaB ligand (RANKL)-RANK signaling mechanisms on osteoclast differentiation, little has been studied on how RANK expression is regulated or what regulates its expression during osteoclastogenesis. We show here that insulin signaling increases RANK expression, thus enhancing osteoclast differentiation by RANKL. Insulin stimulation induced RANK gene expression in time- and dose-dependent manners and insulin receptor shRNA completely abolished RANK expression induced by insulin in bone marrow-derived monocyte/macrophage cells (BMMs). Moreover, the addition of insulin in the presence of RANKL promoted RANK expression. The ability of insulin to regulate RANK expression depends on extracellular signal-regulated kinase 1/2 (ERK1/2) since only PD98059, an ERK1/2 inhibitor, specifically inhibited its expression by insulin. However, the RANK expression by RANKL was blocked by all three mitogen-activated protein (MAP) kinases inhibitors. The activation of RANK increased differentiation of BMMs into tartrate-resistant acid phosphatase-positive ($TRAP^+$) osteoclasts as well as the expression of dendritic cell-specific transmembrane protein (DC-STAMP) and d2 isoform of vacuolar ($H^+$) ATPase (v-ATPase) Vo domain (Atp6v0d2), genes critical for osteoclastic cell-cell fusion. Collectively, these results suggest that insulin induces RANK expression via ERK1/2, which contributes to the enhancement of osteoclast differentiation.

SEPARABILITY OF DISTINCT BOOLEAN RANK-1 MATRICES

  • SONG SEOK-ZUN
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.197-204
    • /
    • 2005
  • For two distinct rank-1 matrices A and B, a rank-1 matrix C is called a separating matrix of A and B if the rank of A + C is 2 but the rank of B + C is 1 or vice versa. In this case, rank-1 matrices A and B are said to be separable. We show that every pair of distinct Boolean rank-l matrices are separable.