• Journal of the Korea Furniture Society
• /
• v.26 no.2
• /
• pp.179-185
• /
• 2015

A study was carried out to observe the 1% aqueous safranine solution flow speed in longitudinal and radial directions of softwood G. biloba, ring-porous wood A. altissima, and diffuse- porouswood D. kaki. In radial direction, ray cells and in longitudinal direction tracheids, vessel and wood fiber were considered for the measurement of liquid penetration speed at less than 12% moisture contents (MC). The length, lumen diameter, pit diameter, end wall pit diameter and the numbers of end wall pits determined for the flow rate. The liquid flow in the those cells was captured via video and the capillary flow rate in the ones were measured. Vessel in hardwood species and tracheids in softwood was found to facilitate prime role in longitudinal penetration. Radial flow speed was found highest in ray parenchyma of G. biloba. Anatomical features like the length and diameter, end-wall pit numbers of ray parenchyma were found also responsible fluid flow differences. On the other hand, vessel and fiber structure affected the longitudinal flow of liquids. Therefore, the average liquid penetration depth in longitudinal tracheids of G. biloba was found the highest among all cells considered in D. kaki and A. altissima.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.699-706
• /
• 2014

As XML documents are getting bigger and more complex, a keyword-based search method that does not require structural information is needed to search these large XML documents. In order to use this method, not only all keywords expressed as nodes in the XML document must be labeled for indexing but also structural information should be well represented. However, the existing labeling methods either have very simple information of XML documents for index or represent the structural information which is difficult to deal with the increase of XML documents' size. As the size of XML documents is getting larger, it causes either the poor performance of keyword search or the exponential increase of space usage. In this paper, we present the Repetitive Prime Labeling Scheme (RPLS) in order to improve the problem of the existing labeling methods for keyword-based search of large XML documents. This method is based on the existing prime number labeling method and allows a parent's prime number to be used at a lower level repeatedly so that the number of prime numbers being generated can be reduced. Then, we show an experimental result of the comparison between our methods and the existing methods.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1397-1404
• /
• 2018

For a connected graph G, an r-maximum edge-coloring is an edge-coloring f defined on E(G) such that at every vertex v with $d_G(v){\geq}r$ exactly r incident edges to v receive the maximum color. The r-maximum index $x^{\prime}_r(G)$ is the least number of required colors to have an r-maximum edge coloring of G. In this paper, we show how the r-maximum index is affected by adding an edge or a vertex. As a main result, we show that for each $r{\geq}3$ the r-maximum index function over the graphs admitting an r-maximum edge-coloring is unbounded and the range is the set of natural numbers. In other words, for each $r{\geq}3$ and $k{\geq}1$ there is a family of graphs G(r, k) with $x^{\prime}_r(G(r,k))=k$. Also, we construct a family of graphs not admitting an r-maximum edge-coloring with arbitrary maximum degrees: for any fixed $r{\geq}3$, there is an infinite family of graphs ${\mathcal{F}}_r=\{G_k:k{\geq}r+1\}$, where for each $k{\geq}r+1$ there is no r-maximum edge-coloring of $G_k$ and ${\Delta}(G_k)=k$.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.621-628
• /
• 2011

The redactable signature scheme was introduced by Johnson and others in 2002 as a mechanism to support disclosing verifiable subdocuments of a signed document. In their paper, a redactable signature based on RSA was presented. In 2009, Nojima and others presented a redactable signature scheme based on RSA. Both schemes are very efficient in terms of storage. However, the schemes need mechanisms to share random prime numbers, which causes huge time consuming computation. Moreover, the public key in the scheme of Johnson and others is designed to be used only once. In this paper, we improve the computational efficiency of these schemes by eliminating the use of a random prime sharing mechanism while sustaining the storage efficiency of them. The size of our signature scheme is the same as that of the standard RSA signature scheme plus the size of the security parameter. In our scheme, the public key can be used multiple times, and more efficient key management than the scheme of Johnson and others is possible. We also prove that the security of our scheme is reduced to the security of the full domain RSA signature scheme.

• Communications of the Korean Mathematical Society
• /
• v.23 no.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 Service Research and Studies
• /
• v.5 no.2
• /
• pp.71-81
• /
• 2015

The RSA public key encryption algorithm, a few, key generation, factoring, the Euler function, key setup, a joint expression law, the application process are serial indexes. The foundation of such algorithms are mathematical principles. The first concept from mathematics principle is applied from how to obtain a minority. It is to obtain a product of two very large prime numbers, but readily tracking station the original two prime number, the product are used in a very hard principles. If a very large prime numbers p and q to obtain, then the product is the two $n=p{\times}q$ easy station, a method for tracking the number of p and q from n synthesis and it is substantially impossible. The RSA encryption algorithm, the number of digits in order to implement the inverse calculation is difficult mathematical one-way function and uses the integer factorization problem of a large amount. Factoring the concept of the calculation of the mod is difficult to use in addition to the problem in the reverse direction. But the interests of the encryption algorithm implementation usually are focused on introducing the film the first time you use encryption algorithm but we have to know how to go through some process applied to the field work This study presents a field force applied encryption process scheme based on public key algorithms attribute diagnosis.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.737-744
• /
• 2018

The RSA cryptosystem is a one of the first public-key cryptosystems and is widely used for secure data transmission and electric signature. The security of the RSA cryptosystem is based on the difficulty of factoring large numbers.. Though many studies on finding methods for factoring large numbers are going on, the results of that are all experimental or probabilistic. We, in this paper, construct an algorithm for finding large prime factors of integers without factoring integers using properties of the structure of semigroup of imaginary quadratic order and non-invertible ideal, then propose our methods foe deterministic attack against RSA cryptosystem.

• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.438-447
• /
• 2019

As the IoT-based hyper-connected society grows, public-key cryptosystem such as RSA is frequently used for encryption, authentication, and digital signature. Public-key cryptosystem use very large (safe) prime numbers to ensure security against malicious attacks. Even though the performance of the device has greatly improved, the generation of a large (safe)prime is time-consuming or memory-intensive. In this paper, we propose ET-MR and ET-MR-MR using Euler sieve so it runs faster while using less memory. We present a running time prediction model by probabilistic analysis and compare time and memory of our method with conventional methods. Experimental results show that the difference between the expected running time and the measured running time is less than 4%. In addition, the fastest running time of ET-MR is 36% faster than that of TD-MR, 8.5% faster than that of DT-MR and the fastest running time of ET-MR-MR is 65.3% faster than that of TD-MR-MR and similar to that of DT-MR-MR. When k=12,381, the memory usage of ET-MR is 2.7 times more than that of DT-MR but 98.5% less than that of TD-MR and when k=65,536, the memory usage of ET-MR-MR is 98.48% less than that of TD-MR-MR and 92.8% less than that of DT-MR-MR.

• Journal of the Korea Furniture Society
• /
• v.29 no.1
• /
• pp.1-7
• /
• 2018

A study was carried out to observe the 1% aqueous safranine solution flow speed in longitudinal and radial directions of softwood Metasequoia glyptostroboides, diffuse-porous wood Anthocephalus cadamba and ring-porouswood Fraxinus rhynchophylla. In radial direction, ray cells and in longitudinal direction, tracheids, vessel and wood fiber were considered for the measurement of liquid penetration speed at less than 12% moisture contents (MC). The length, lumen diameter, pit diameter, end wall pit diameter and the numbers of end wall pits determined for the flow rate. The liquid flow in the those cells was captured via video and the capillary flow rate in the ones were measured. Vessel in hardwood species and tracheids in softwood was found to facilitate prime role in longitudinal penetration. Anatomical features like the length and diameter, end-wall pit numbers of ray parenchyma were found also responsible fluid flow differences. On the other hand, vessel and fiber structure affected the longitudinal flow of liquids. Therefore, the average liquid penetration depth in longitudinal tracheids of Metasequoia glyptostroboides was found the highest among all cells considered in Anthocephalus cadamba and Fraxinus rhynchophylla In radial direction, ray parenchyma of Metasequoia glyptostroboides was found the highest depth and the one of Fraxinus rhynchophylla was the lowest. The solution was penetrated lowest depth in the wood fiber of Fraxinus rhynchophylla. The large vessel of Fraxinus rhynchophylla was found the lowest depth among the vessels. The solutin was penetrated to the wood fiber of Anthocephalus cadamba higher than the one of Fraxinus rhynchophylla.

• Journal of the Korea Furniture Society
• /
• v.28 no.1
• /
• pp.88-93
• /
• 2017

A study was carried out to observe the 1% aqueous safranine solution flow speed in longitudinal and radial directions of softwood Larix kaempferi (Lamb.)Carriere, diffuse-porous wood Betula davurica Pall.. and ring-porouswood Castanea crenata S.etZ. In radial direction, ray cells and in longitudinal direction, tracheids, vessel and wood fiber were considered for the measurement of liquid penetration speed at less than 12% moisture contents (MC). The length, lumen diameter, pit diameter, end wall pit diameter and the numbers of end wall pits determined for the flow rate. The liquid flow in the those cells was captured via video and the capillary flow rate in the ones were measured. Vessel in hardwood species and tracheids in softwood was found to facilitate prime role in longitudinal penetration. Anatomical features like the length and diameter, end-wall pit numbers of ray parenchyma were found also responsible fluid flow differences. On the other hand, vessel and fiber structure affected the longitudinal flow of liquids. Therefore, the average liquid penetration depth in longitudinal tracheids of Larix kaempferi was found the highest among all cells considered in Betula davurica and Castanea crenata, In radial direction, ray parenchyma of Larix kaempferi was found the highest depth and the one of Betula davurica was the lowest. The solution was penetrated lowest depth in the wood fiber of Castanea crenata. The large vessel of Castanea crenata was found the lowest depth among the vessels. The solutin was penetrated to the wood fiber of Betula davurica higher than the one of Castanea crenata.