• (The)Study of the Eastern Classic
• /
• 제69호
• /
• pp.9-44
• /
• 2017

Seonsaengan(先生案) is the predecessor's lists. The list includes the names of the predecessor, the date of the appointment, the date of return, the previous job, and the next job. Therefore, previous studies on the local recruitment and Jungin (中人) that can not be found in general personnel information of the Joseon dynasty were conducted. However, the status and classification of the list has not been achieved yet. So this study aims to clarify the status, classification and data characteristics of the list. 176 books, are the Joseon dynasty lists of predecessors, remain to this day. These lists are in Jangseogak(47 cases), Kyujanggak(80 cases), the National Library of Korea(24 cases) and other collections(25 cases). Jangseogak has lists of royal government officials, Kyujanggak has lists of central government officials, and the National Library of Korea and other collections have lists of local government officials. However, this paper focuses on accessible Jangseogak list of 47 cases. As I mentioned earlier, the Jangsaegak lists are generally related to the royal government officails. This classification includes 18 central government officials, 5 local government officials, and 24 royal government officails. If the list is classified as contents, it can be classified into six rituals and diplomatic officials, 12 royal government officials, 5 local government officials, 14 royal tombs officials, and 10 royal education officials. Through the information on the list, the following six characteristics can be summarized. First, it can be finded the basic personal information about the recorded person. Second, the period of office and reasons for leaving the office and office can be known. Third, changes in the office system can be confirmed. Fourth, it can be looked at one aspect of the personnel administration system of the Joseon Dynasty through the previous workplace and the next job. Fifth, it is possible to know days that are particularly important for each government. Sixth, the contents of work evaluation can be confirmed. This is the reality of the Joseon Dynasty, which is different from the contents recorded in the Code. Through this, it is possible to look at the personnel administration system of the Joseon Dynasty. However, in order to carry out a precise review, it is necessary to make a database for 176 lists. In addition, if data is analyzed in connection with existing genealogy data, it will be possible to establish a basis for understanding the personnel administration system of the Joseon Dynasty.

• Journal of the Chungcheong Mathematical Society
• /
• 제15권2호
• /
• pp.47-56
• /
• 2003

This note is concerned with some properties of fixed points and periodic points. First, we have constructed a generalized continuous function to give a proof for the fact that, as the reverse of the Sharkovsky theorem[16], for a given positive integer n, there exists a continuous function with a period-n point but no period-m points wherem is a predecessor of n in the Sharkovsky ordering. Also we show that the composition of two transcendental meromorphic functions, one of which has at least three poles, has infinitely many fixed points.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제5권1호
• /
• pp.1-10
• /
• 2001

We investigate the relationship between the 0-tree and other trees in linear nongroup cellular automata. And we show that given a 0-basic path of 0-tree and a nonzero attractor ${\alpha}$ of a multiple attractor linear cellulara automata with two predecessor we construct an ${\alpha}$-tree of that multiple attractor linear cellular automata.

• Journal of Electrical Engineering and Technology
• /
• 제13권1호
• /
• pp.493-500
• /
• 2018

This paper addresses a decentralized observer-based output-feedback formation control problem for multiple unmanned underwater vehicles (UUVs). The complex nonlinear model for a UUV is feedback-linearized. It is assumed that each UUV in the formation exploits only the information regarding itself and the immediate predecessor, which imposes structural constraints on the formation controller gain matrices. The design condition is presented as a two-stage linear matrix inequalities problem. The synthesized controller demonstrates its own advantages through a numerical example.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제10권6호
• /
• pp.1132-1136
• /
• 2006

In this paper, we analyze reachable/nonreachable states of 3-neighborhood cellular automata and propose the algorithm finding the predecessor of a reachable state.

• Bulletin of the Korean Chemical Society
• /
• 제22권1호
• /
• pp.43-45
• /
• 2001

This study simplifies the phenomenological theory of viscosity previously proposed by the present authors. This simplified theory has only two thermodynamic properties and one parameter, as opposed to its predecessor, which has many, allowing for easy calculation of the liquid viscosities. The viscosity of liquid metals, an excellent test for checking the validity of the liquid theory, can be calculated using the equation based on the simplified theory. The calculated results by the current theory turn out to be good for the liquid metals, including sodium, potassium, rubbidium, cesium, lead and mercury.

• Communications of the Korean Mathematical Society
• /
• 제23권4호
• /
• pp.511-528
• /
• 2008

Let (R, m) be a 2-dimensional regular local ring with algebraically closed residue field R/m. Let K be the quotient field of R and $\upsilon$ be a prime divisor of R, i.e., a valuation of K which is birationally dominating R and residually transcendental over R. Zariski showed that there are finitely many simple $\upsilon$-ideals $m\;=\;P_0\;{\supset}\;P_1\;{\supset}\;{\cdots}\;{\supset}\;P_t\;=\;P$ and all the other $\upsilon$-ideals are uniquely factored into a product of those simple ones [17]. Lipman further showed that the predecessor of the smallest simple $\upsilon$-ideal P is either simple or the product of two simple $\upsilon$-ideals. The simple integrally closed ideal P is said to be free for the former and satellite for the later. In this paper we describe the sequence of simple $\upsilon$-ideals when P is satellite of order 3 in terms of the invariant $b_{\upsilon}\;=\;|\upsilon(x)\;-\;\upsilon(y)|$, where $\upsilon$ is the prime divisor associated to P and m = (x, y). Denote $b_{\upsilon}$ by b and let b = 3k + 1 for k = 0, 1, 2. Let $n_i$ be the number of nonmaximal simple $\upsilon$-ideals of order i for i = 1, 2, 3. We show that the numbers $n_{\upsilon}$ = ($n_1$, $n_2$, $n_3$) = (${\lceil}\frac{b+1}{3}{\rceil}$, 1, 1) and that the rank of P is ${\lceil}\frac{b+7}{3}{\rceil}$ = k + 3. We then describe all the $\upsilon$-ideals from m to P as products of those simple $\upsilon$-ideals. In particular, we find the conductor ideal and the $\upsilon$-predecessor of the given ideal P in cases of b = 1, 2 and for b = 3k + 1, 3k + 2, 3k for $k\;{\geq}\;1$. We also find the value semigroup $\upsilon(R)$ of a satellite simple valuation ideal P of order 3 in terms of $b_{\upsilon}$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제15권9호
• /
• pp.1939-1946
• /
• 2011

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et. al introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor CA(Cellular Automata). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is larger than that of Mukhopadhyay et. al [12]. As an application we give an algorithm which generate one-way functions whose security lies on the combinatorial properties of our expander graphs. the one-way function using d-regular graph generated by the 60/102 NBCA is based on the Goldreich's construction [5].

• Journal of KIISE:Information Networking
• /
• 제30권2호
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제14권12호
• /
• pp.2724-2729
• /
• 2010

This paper presents a method of constructing the sequential digital systems over finite fields. We assign all elements in finite fields to digit codes using mathematical properties of finite fields. Also, we discuss the operational characteristics and properties of the building block T-gate which is used to implement the sequential digital systems over finite fields. Then, we implemented sequential digital systems without feed-back. The sequential digital systems without feed-back is constructed as following steps. First, we assign the states in state-transition diagram to state digit codes, then obtain the state function and predecessor table which is explaining the relationship between present states and previous states. Next, we obtained the next-state function from state function and predecessor table. Finally we realize the circuit using T-gate and decoder. The proposed method is more efficiency and systematic than previous method.