• Journal of Periodontal and Implant Science
• /
• v.51 no.1
• /
• pp.18-29
• /
• 2021

Purpose: The aim of this study was to compare the characteristic expression patterns of advanced periodontitis in 2 cohort data sets analyzed using different microarray platforms, and to identify differentially expressed genes (DEGs) through a meta-analysis of both data sets. Methods: Twenty-two patients for cohort 1 and 40 patients for cohort 2 were recruited with the same inclusion criteria. The 2 cohort groups were analyzed using different platforms: Illumina and Agilent. A meta-analysis was performed to increase reliability by removing statistical differences between platforms. An integrative meta-analysis based on an empirical Bayesian methodology (ComBat) was conducted. DEGs for the integrated data sets were identified using the limma package to adjust for age, sex, and platform and compared with the results for cohorts 1 and 2. Clustering and pathway analyses were also performed. Results: This study detected 557 and 246 DEGs in cohorts 1 and 2, respectively, with 146 and 42 significantly enriched gene ontology (GO) terms. Overlapping between cohorts 1 and 2 was present in 59 DEGs and 18 GO terms. However, only 6 genes from the top 30 enriched DEGs overlapped, and there were no overlapping GO terms in the top 30 enriched pathways. The integrative meta-analysis detected 34 DEGs, of which 10 overlapped in all the integrated data sets of cohorts 1 and 2. Conclusions: The characteristic expression pattern differed between periodontitis and the healthy periodontium, but the consistency between the data sets from different cohorts and metadata was too low to suggest specific biomarkers for identifying periodontitis.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.525-552
• /
• 2021

In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.

• Journal of the Chungcheong Mathematical Society
• /
• v.8 no.1
• /
• pp.153-159
• /
• 1995

In this paper, we study the inclusion realtion between recursive sets. And we prove that if $\overline{R(f)}{\backslash}R(f)$ is not empty, then it is infinite, and we characterize the necessary and sufficent condition for which $\overline{R(f)}{\backslash}R(f)$ is countable.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.278-283
• /
• 1998

The interval approach to the linguistic expression coding nears us to the human idea. Thus, what seems "weak" for a person can appear very weak for another person or for the same person in others circumstances. However, the utilization of intervals is not restrained to the cases of linguistic expression coding. Indeed, the interval can facilitate the solution of several problems.

• Bulletin of the Korean Chemical Society
• /
• v.15 no.3
• /
• pp.221-227
• /
• 1994

The barrier heights of the internal rotations for ethyl halides calculated by ab initio methods differ from those of experiments by more than 0.2 kcal/mol. The use of basis sets larger than the $6-31G^{\ast}$ set and the inclusion of correlation do not improve the agreement between the calculated and experimental values. The zero-point vibration corrections are substantial in the HF calculations with $6-31G^{\ast}$ basis sets, but become negligible in the MP2 calculations with $6-311G^{{\ast}{\ast}}$ basis sets for $C_2H_5F\;and\;C_2H_5Cl$. It is shown that the rigid rotor approximation and the assumed shape of the potential curve as a cos2${\theta}$ curve could also be the sources of discrepancies between calculated and experimental values. Higher order perturbation corrections narrow the gap between experimental and theoretical values, but there still remains about 10% overestimate of 0.3 kcal/mol. Optimized geometries from the HF and MP2 calculations are in good agreement with those from experiments. Dipole moments calculated from the MP2 densities show slightly better agreement with experiments than those from the HF densities.

• Journal of the Korean Geotechnical Society
• /
• v.31 no.12
• /
• pp.59-69
• /
• 2015

This study examined the magnitude and distribution of earth pressure on the support system in a jointed rock mass due to the different joint sets as well as varying the rock type and joint condition (joint shear strength and joint inclination angle). Based on a physical model test and its numerical simulation, a series of numerical parametric analyses were conducted using a discrete element method. The results showed that the induced earth pressure was affected significantly by a joint set depending on the inclusion of the joint inclination angle, which induces a joint sliding condition, but the number of joint sets alone was not important, even though the earth pressure could be increased slightly as the number of joint sets is increased. In addition, the study results were compared with Peck's earth pressure for soil ground, which indicated that the earth pressure in a jointed rock mass could be considerably different from that in soil ground. The study suggests that the effects of joint sets as well as rock type and joint condition are important factors affecting the earth pressure in a jointed rock mass and they should be considered when designing a support system in a jointed rock mass.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.165-170
• /
• 2023

This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn²).

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.347-351
• /
• 1998

Dynamic programming is applicable to any situation where items from several groups must be combined to form an entity, such as a composite investment or a transportation route connecting several districts. The most desirable entity is constructed in stages by forming sub-entities that are candidates for inclusion in the most desirable entity are retained, and all other sub-entities are discarded. In the paper, the fuzzy dynamic programming is applied to the situation where each investment in the set has the following characteristics : the amount to be invested has several possible values, and the rte of return varies with the amount invested. Each sum that may be invested represents a distinct level of investment , and the investment therefore has multiple levels. A numeric example constructing a combination of multilevel investments is given in the paper.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1691-1701
• /
• 2018

New inclusion sets are obtained for the eigenvalues of real matrices for which the all 1's vector is an eigenvector, i.e., the constant row-sum real matrices. A number of examples are provided. This paper builds upon the work of the authors in [7]. The results of this paper are in terms of $Ger{\check{s}}gorin$ discs of the second type. An application of the main theorem to bounding the algebraic connectivity of connected simple graphs is obtained.