• 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 Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1908-1924
• /
• 2001

Interoperability and inter-working in the various network and media environment with different technology background is very important to enlarge the opportunity of service access and to increase the competitive power of service. The ITU-T and advanced counties are planning ahead for provision of GII enabling user to access advanced global communication services supporting multimedia communication applications, embracing all modes of information. In this paper, we especially forced the heterogeneity of end user applications for multimedia networking. The heterogeneity has several technical aspects, like different medium access methods, heterogeneous coding algorithms for audio-visual data and so on. Among these elements, we have been itemized bit rate shaping algorithm on the compressed moving video. Previous manipulations of video has been done on the uncompressed signal domain. That is, compressed video should be converted to linear PCM signal. To do such a procedures, we should decode, manipulate and then encode the video to compressed signal once again. The traditional approach for processing the video signa1 has several critical weak points, requiring complexity to implement, degradation of image quality and large processing delay. The bit rate shaping algorithm proposed in this paper process the manipulation of moving video on the completely compressed domain to cope with above deficit. With this algorithms. we could realized efficient video bit rate shaping and the result of software simulation shows that this method has significant advantage than that of pixel oriented algorithms.

• Journal of Korean Society for Geospatial Information Science
• /
• v.11 no.4 s.27
• /
• pp.21-27
• /
• 2003

The rational polynomial coefficients(RPC) model is a generalized sensor model that is used as an alternative for the physical sensor model for IKONOS-2 and QuickBird. As the number of sensors increases along with greater complexity, and as the need for standard sensor model has become important, the applicability of the RPC model is also increasing. The RPC model can be substituted for all sensor models, such as the projective camera the linear pushbroom sensor and the SAR This paper is aimed at generating a RPC model from the physical sensor model of the KOMPSAT-1(Korean Multi-Purpose Satellite) and aerial photography. The KOMPSAT-1 collects $510{\sim}730nm$ panchromatic images with a ground sample distance (GSD) of 6.6m and a swath width of 17 km by pushbroom scanning. We generated the RPC from a physical sensor model of KOMPSAT-1 and aerial photography. The iterative least square solution based on Levenberg-Marquardt algorithm is used to estimate the RPC. In addition, data normalization and regularization are applied to improve the accuracy and minimize noise. And the accuracy of the test was evaluated based on the 2-D image coordinates. From this test, we were able to find that the RPC model is suitable for both KOMPSAT-1 and aerial photography.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.325-338
• /
• 2004

A data warehouse stores information that is collected from multiple, heterogeneous information sources for the purpose of complex querying and analysis. Information in the warehouse is typically stored In the form of materialized views, which represent pre-computed portions of frequently asked queries. One of the most important tasks of designing a warehouse is the selection of materialized views to be maintained in the warehouse. The goal is to select a set of views so that the total query response time over all queries can be minimized while a limited amount of time for maintaining the views is given(maintenance-cost view selection problem). In this paper, we propose an efficient solution to the maintenance-cost view selection problem using a genetic algorithm for computing a near-optimal set of views. Specifically, we explore the maintenance-cost view selection problem in the context of OR view graphs. We show that our approach represents a dramatic improvement in terms of time complexity over existing search-based approaches that use heuristics. Our analysis shows that the algorithm consistently yields a solution that only has an additional 10% of query cost of over the optimal query cost while at the same time exhibits an impressive performance of only a linear increase in execution time. We have implemented a prototype version of our algorithm that is used to evaluate our approach.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.465-475
• /
• 2022

Due to the impact of COVID-19, people are paying attention to convenience and health, and the use of IoT devices to help them is increasing. In order to embed a lightweight security element in IoT devices that need to handle sensitive information even with limited resources, the development of a lightweight S-box is essential. Until 2021, it was common to develop a lightweight 4-bit S-box by a heuristic method, and to develop an extended structure or repeat the same operation for a larger size lightweight S-box. However, in January 2022, a paper that proposed a heuristic algorithm to find an 8-bit S-box with better differential uniformity and linearity than the S-box generated with an MISTY extended structure, although non-bijective, was published [1]. The heuristic algorithm proposed in this paper generates an S-box by adding AND operations one by one. Whenever an AND operation is added, they use a method that pre-removes the S-box for which the calculated differential uniformity does not reach the desired criterion. In this paper, we improve the performance of this heuristic algorithm. By increasing the amount of pre-removal using not only differential uniformity but also other differential property, and adding a process of calculating linearity for pre-removing, it is possible to satisfy not only differential security but also linear security.

• Journal of Periodontal and Implant Science
• /
• v.53 no.3
• /
• pp.233-244
• /
• 2023

Purpose: An implant-supported prosthesis consists of an implant fixture, an abutment, an internal screw that connects the abutment to the implant fixture, and the upper prosthesis. Numerous studies have investigated the microorganisms present on the implant surface, surrounding tissues, and the subgingival microflora associated with peri-implantitis. However, there is limited information regarding the microbiome within the internal screw space. In this study, microbial samples were collected from the supragingival surfaces of natural teeth, the peri-implant sulcus, and the implant-abutment screw hole, in order to characterize the microbiome of the internal screw space in healthy subjects. Methods: Samples were obtained from the supragingival region of natural teeth, the peri-implant sulcus, and the implant screw hole in 20 healthy subjects. DNA was extracted, and the V3-V4 region of the 16S ribosomal RNA was sequenced for microbiome analysis. Alpha diversity, beta diversity, linear discriminant analysis effect size (LEfSe), and network analysis were employed to compare the characteristics of the microbiomes. Results: We observed significant differences in beta diversity among the samples. Upon analyzing the significant taxa using LEfSe, the microbial composition of the implant-abutment screw hole's microbiome was found to be similar to that of the other sampling sites' microbiomes. Moreover, the microbiome network analysis revealed a unique network complexity in samples obtained from the implant screw hole compared to those from the other sampling sites. Conclusions: The bacterial composition of the biofilm collected from the implant-abutment screw hole exhibited significant differences compared to the supra-structure of the implant. Therefore, long-term monitoring and management of not only the peri-implant tissue but also the implant screw are necessary.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• Journal of Wetlands Research
• /
• v.25 no.4
• /
• pp.306-314
• /
• 2023

Stream sediments are an important component of water quality management because they are receptors of various pollutants such as heavy metals and organic matters emitted from upland sources and can be secondary pollution sources, adversely affecting water environment. To effectively manage the stream sediments, identification of primary sources of sediment contamination and source-associated control strategies will be required. We evaluated the performance of machine learning models in identifying primary sources of sediment contamination based on the physico-chemical properties of stream sediments. A total of 356 stream sediment data sets of 18 quality parameters including 10 heavy metal species(Cd, Cu, Pb, Ni, As, Zn, Cr, Hg, Li, and Al), 3 soil parameters(clay, silt, and sand fractions), and 5 water quality parameters(water content, loss on ignition, total organic carbon, total nitrogen, and total phosphorous) were collected near abandoned metal mines and industrial complexes across the four major river basins in Korea. Two machine learning algorithms, linear discriminant analysis (LDA) and support vector machine (SVM) classifiers were used to classify the sediments into four cases of different combinations of the sampling period and locations (i.e., mine in dry season, mine in wet season, industrial complex in dry season, and　industrial complex in wet season). Both models showed good performance in the classification, with SVM outperformed LDA; the accuracy values of LDA and SVM were 79.5% and 88.1%, respectively. An SVM ensemble model was used for multi-label classification of the multiple contamination sources inlcuding landuses in the upland areas within 1 km radius from the sampling sites. The results showed that the multi-label classifier was comparable performance with sinlgle-label SVM in classifying mines and industrial complexes, but was less accurate in classifying dominant land uses (50~60%). The poor performance of the multi-label SVM is likely due to the overfitting caused by small data sets compared to the complexity of the model. A larger data set might increase the performance of the machine learning models in identifying contamination sources.

• Korean Journal of Biological Psychiatry
• /
• v.5 no.1
• /
• pp.95-101
• /
• 1998

The changes of electroencephalogram(EEG) in patients with dementia of Alzheimer's type are most commonly studied by analyzing power or magnitude in traditionally defined frequency bands. However because of the absence of an identified metric which quantifies the complex amount of information, there are many limitations in using such a linear method. According to the chaos theory, irregular signals of EEG can be also resulted from low dimensional deterministic chaos. Chaotic nonlinear dynamics in the EEG can be studied by calculating the largest Lyapunov exponent($L_1$). The authors have analyzed EEG epochs from three patients with dementia of Alzheimer's type and three matched control subjects. The largest $L_1$ is calculated from EEG epochs consisting of 16,384 data points per channel in 15 channels. The results showed that patients with dementia of Alzheimer's type had significantly lower $L_1$ than non-demented controls on 8 channels. Topographic analysis showed that the $L_1$ were significantly lower in patients with Alzheimer's disease on all the frontal, temporal, central, and occipital head regions. These results show that brains of patients with dementia of Alzheimer's type have a decreased chaotic quality of electrophysiological behavior. We conclude that the nonlinear analysis such as calculating the $L_1$ can be a promising tool for detecting relative changes in the complexity of brain dynamics.

• Tuberculosis and Respiratory Diseases
• /
• v.56 no.4
• /
• pp.393-404
• /
• 2004

Background : Nucleic acid hybridization has become an essential technique in the development of our understanding of gene structure and function. The quantitative analysis of hybridization has been used in the measurement of genome complexity and gene copy number. The filter hybridization assay is rapid, sensitive and can be used to measure RNAs complementary to any cloned DNA sequence. Methods : The authors assessed the accuracy, linearity, correlation coefficient and specificity of the hybridization depending on the added dose(0, 1, 5, and $10{\mu}g$) of non-specific rat spleen RNA to hybridization of surfactant protein A mRNA. Filter hybridization assays were used to obtain the equation of standard curve and thereby to quantitate the mRNA quantitation. Results : 1. Standard curve equation of filter hybridization assay between counts per minute (X) and spleen RNA input (Y) was Y=0.13X-19.35. Correlation coefficient was 0.98. 2. Standard curve equation of filter hybridization assay between counts per minute (X) and surfactant protein A mRNA transcript input (Y) was Y=0.00066X-0.046. Correlation coefficient was 0.99. 3. Standard curve equation of filter hybridization assay between counts per minute (X) and surfactant protein A mRNA transcript input (Y) after the addition of $1{\mu}g$ spleen RNA was Y=0.00056X-0.051. Correlation coefficient was 0.99. 4. Standard curve equation of filter hybridization assay between counts per minute (X) and surfactant protein A mRNA transcript input (Y) after the addition of $5{\mu}g$ spleen RNA was Y=0.00065X-0.088. Correlation coefficient was 0.99. 5. Standard curve equation of filter hybridization assay between counts per minute (X) and surfactant protein A mRNA transcript input (Y) after the addition of $10{\mu}g$ spleen RNA was Y=0.00051X-0.10. Correlation coefficient was 0.99. Conclusions : Comparison of cpm/filter in a linear range allowed accurate and reproducible estimation of surfactant protein A mRNA copy number irrespective of the addition dosage of non-specific rat spleen RNA over the range $0-10{\mu}g$.