• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.113-120
• /
• 2013

This paper proposes an algorithm that proves an NP-complete 4-color theorem by employing a linear time complexity where $O(n)$. The proposed algorithm accurately halves the vertex set V of the graph $G=(V_1,E_1)$ into the Maximum Independent Set (MIS) $\bar{C_1}$ and the Minimum Vertex Cover Set $C_1$. It then assigns the first color to $\bar{C_1}$ and the second to $\bar{C_2}$, which, along with $C_2$, is halved from the connected graph $G=(V_2,E_2)$, a reduced set of the remaining vertices. Subsequently, the third color is assigned to $\bar{C_3}$, which, along with $C_3$, is halved from the connected graph $G=(V_3,E_3)$, a further reduced set of the remaining vertices. Lastly, denoting $C_3$ as $\bar{C_4}$, the algorithm assigns the forth color to $\bar{C_4}$. The algorithm has successfully obtained the chromatic number ${\chi}(G)=4$ with 100% probability, when applied to two actual map and two planar graphs. The proposed "four color algorithm", therefore, could be employed as a general algorithm to determine four-color for planar graphs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.157-164
• /
• 2011

It is very difficult problem to factorize composite number. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$(mode $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$). Fermat's algorithm that is base of congruence of squares finds $a^2-b^2=n$. This paper proposes the method to find $a^2-b^2=kn$, ($k=1,2,{\cdots}$). It is supposed $b_1$=0 or 5 to be surely, and b is a double number. First, the proposed method decides $k$ by getting kn that satisfies $b_1=0$ and $b_1=5$ about $n_2n_1$. Second, it decides $a_2a_1$ that satisfies $a^2-b^2=kn$. Third, it figures out ($a,b$) from $a^2-b^2=kn$ about $a_2a_1$ as deciding $\sqrt{kn}$ < $a$ < $\sqrt{(k+1)n}$ that is in $kn$ < $a^2$ < $(k+1)n$. The proposed algorithm is much more effective in comparison with the conventional Fermat algorithm.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.371-380
• /
• 2006

This paper utilizing model picture of finished clothes in fashion design field various material (textile fabrics) doing Draping directly can invent new design, and do not produce direction sample or poetic theme width and confirm clothes work to simulation. Also, construct database about model and material image and embodied system that can confirm Mapping result by real time. And propose clothes simulation system to dress to 3D human body model of imagination because using several cloth pieces first by process to do so that can do simulation dressing abstracted poetic theme width to 3D model here. Proposed system creates 3D model who put clothes by physical simulation that do fetters to mass-spring model after read 3D human body model file and 2D foundation pattern file. System of this treatise examines collision between triangle that compose human body model for realistic simulation and triangle that compose clothes and achieved reaction processing. Because number of triangle to compose human body is very much, this collision examination and reaction processing need much times. To solve this problem, treatise that see could create realistic picture by method to diminish collision public prosecutor and reaction processing number, and could dress clothes to imagination human body model within water plant taking advantage of Octree space sharing techniques.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.9
• /
• pp.209-216
• /
• 2019

Publish-subscribe communication model is popular for various type of distributed applications because of its loosely coupled style connections. Among the various architecture style for publish-subscribe system, peer-to-peer architecture has been used for the mission critical application domain since it provides high scalability and real-timeness. On the other hand, to utilize the bandwidth of given networks, message filtering is frequently used to reduce the number of messages on the system. Even if P2P provides superior scalability, it is hard to apply filtering to the its messaging system because the filtering process should be done on the peer-side in P2P architecture that are usually done on the broker server in conventional pub/sub architecture. In this paper, we propose a hierarchical subscription management structure as well as message forwarding scheme for efficient data dissemination. Our proposed scheme reduces the number of received messages by filter-out un-wanted messages and offloading the message dissemination work to other subscribers to enhance the messaging throughput.

• Journal of the Korean earth science society
• /
• v.42 no.1
• /
• pp.65-75
• /
• 2021

Over the past decade, the number of national geoparks has rapidly increased, and 13 areas are currently designated as geoparks. After Jeju Island (2010), Cheongsong (2017), Mudeungsan (2018), and Hantangang River (2020) National Geoparks were listed as UNESCO Global Geoparks. Despite the continuous increase in the number of national geoparks and UNESCO global geoparks, the public interest in geoparks and the effect of regional economic development by geoparks are not yet very significant. Some geopark management organizations have developed geopark characters to appeal to the public through intimacy and friendliness, utilizing parks for education and tourism. However, the characters are not being utilized properly due to a lack of plannings, expertise, storytelling, and management. For geopark characters, which have been neglected since development, to perform their original roles, content production based on appropriate budget compilation and analysis of consumption trends in the character market is necessary. Instead of merely using geopark characters, geopark characters should be loved by the public, as well as local residents.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.30 no.4
• /
• pp.431-435
• /
• 1985

Nine hybrid rices crossed between Korean cytoplasmic-genetic male sterile rices having the WA cytoplasm and the Korean restorer lines or varieties, HR1619A/Nampungbyeo, HR1619A/Gayabyeo, HR1619A/Line234, TongilA/Nampungbyeo, TongilA/Cheongcheongbyeo, Suwon 296A/Line 209, Suwon 296A/Line 237, Suwon 296A/Line 252 and Line 201A/Line 234, and their parents were grown at Yeungnam University in 1984. The rough rice yield of the hybrids Line 201A/Line 234, TongilA/Nampungbyeo and HR1619A/Nampungbyeo were 939, 927 and 900 Kg/10a respectively. The heterosis(F$_1$/Midparent) of the above three hybrids was 40%, 20% and 19%, the heterobeltiosis(F$_1$/Better parent) was 36%, 17% and 10%, and the standard heterosis (F$_1$/Standard variety, Cheongcheongbyeo) was 19%, 17% and 14% respectively. The hybrids HR1619A/ Gayabyeo and Suwon 296A/Line 237 showed negative heterosis in grain yield. Significant heterobeltiosis for grain number per panicle was found while less or no heterobeltiosis was observed in panicle number per hill, 1000-grain weight and grain fertility. The bacterial leaf blight disease reaction of the hybrids tested was almost the same as that of one parent at least. The amylose content of the hybrids was medium to low the same as their parents. The protein content and alkali digestion value of the hybrids were almost the same as their parents.

• Journal of Korean Neurosurgical Society
• /
• v.66 no.6
• /
• pp.690-702
• /
• 2023

Objective : To analyze the outcomes of coil embolization (CE) for unruptured intracranial aneurysm (UIA) according to region and hospital size based on National Health Insurance Service data in South Korea. Methods : The incidence of complications, including intracranial hemorrhage (ICRH) and cerebral infarction (CI), occurring within 3 months and the 1-year mortality rates in UIA patients who underwent CE in 2018 were analyzed. Hospitals were classified as tertiary referral general hospitals (TRGHs), general hospitals (GHs) or semigeneral hospitals (sGHs) according to their size, and the administrative districts of South Korea were divided into 15 regions. Results : In 2018, 8425 (TRGHs, 4438; GHs, 3617; sGHs, 370) CEs were performed for UIAs. Complications occurred in 5.69% of patients seen at TRGHs, 13.48% at GHs, and 20.45% at sGHs. The complication rate in TRGHs was significantly lower than that in GHs (p=0.039) or sGHs (p=0.005), and that in GHs was significantly lower than that in sGHs (p=0.030). The mortality rates in TRGHs, GHs, and sGHs were 0.81%, 2.16%, and 3.92%, respectively, with no significant difference. Despite no significant difference in the mortality rates, the complication rate significantly increased as the number of CE procedures per hospital decreased (p=0.001; rho=-0.635). Among the hospitals where more than 30 CEs were performed for UIAs, the incidence of CIs (p=0.096, rho=-0.205) and the mortality rates (3 months, p=0.048, rho=-0.243; 1 year, p=0.009, rho=-0.315) significantly decreased as the number of CEs that were performed increased and no significant difference in the incidence of post-CE ICRH was observed. Conclusion : The complication rate in patients who underwent CE for UIA increased as the hospital size and physicians' experience in conducting CEs decreased. We recommend nationwide quality control policies CEs for UIAs.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.101-109
• /
• 2011

The Riemann's zeta function $\zeta(s)$ has been known as answer for a number of primes $\pi$(x) less than given number x. In prime number theorem, there are another approximation function $\frac{x}{lnx}$,Li(x), and R(x). The error about $\pi$(x) is R(x) < Li(x) < $\frac{x}{lnx}$. The logarithmic integral function is Li(x) = $\int_{2}^{x}\frac{1}{lnt}dt$ ~ $\frac{x}{lnx}\sum\limits_{k=0}^{\infty}\frac{k!}{(lnx)^k}=\frac{x}{lnx}(1+\frac{1!}{(lnx)^1}+\frac{2!}{(lnx)^2}+\cdots)$. This paper shows that the $\pi$(x) can be represent with finite Li(x), and presents generalized prime counting function $\sqrt{{\alpha}x}{\pm}{\beta}$. Firstly, the $\pi$(x) can be represent to $Li_3(x)=\frac{x}{lnx}(\sum\limits_{t=0}^{{\alpha}}\frac{k!}{(lnx)^k}{\pm}{\beta})$ and $Li_4(x)=\lfloor\frac{x}{lnx}(1+{\alpha}\frac{k!}{(lnx)^k}{\pm}{\beta})}k\geq2$ such that $0{\leq}t{\leq}2k$. Then, $Li_3$(x) is adjusted by $\pi(x){\simeq}Li_3(x)$ with ${\alpha}$ and error compensation value ${\beta}$. As a results, this paper get the $Li_3(x)=Li_4(x)=\pi(x)$ for $x=10^k$. Then, this paper suggests a generalized function $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$. The $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$ function superior than Riemann's zeta function in representation of prime counting.

• Sleep Medicine and Psychophysiology
• /
• v.12 no.2
• /
• pp.117-121
• /
• 2005

Objectives: The purpose of this study was to assess the difference of subjective daytime sleepiness level between primary insomnia patients and healthy control subjects. We also investigated the relationship between subjective daytime sleepiness level and variables of nocturnal polysomnograghic sleep architecture of insomnia patients. Method: Total subjects were 87 patients with primary insomnia diagnosed with polysomnography and 88 normal controls. The daytime sleepiness level in each group was measured by Korean version of Epworth Sleepiness Scale (ESS). The correlations of ESS score and nocturnal polysomnographic variables were calculated in the patient group. Results: Patients with insomnia had the lower ESS scores than the control group. In patients group, the ESS score showed significant negative correlations with total sleep time, sleep efficiency%, and stage 2 sleep time%. The ESS score also showed significant positive correlations with number of awakenings, number of awakenings more than 2 minutes, and wake after sleep onset time. Conclusions: Insomnia patients showed lower level of subjective daytime sleepiness that may indicate their higher alertness comparing to control subjects. Daytime sleepiness of patients with insomnia was associated with polysomnographic variables including total sleep time, sleep efficiency%, stage 2 sleep time% and disrupted continuity of nocturnal sleep.