• Tuberculosis and Respiratory Diseases
• /
• v.47 no.2
• /
• pp.218-230
• /
• 1999

Background: Craniofacial anatomic abnormalities related to structural narrowing of the upper airway have been reported in patients with obstructive sleep apnea syndrome. In this study, we evaluated the craniofacial anatomic characteristics of Korean patients with obstructive sleep apnea syndrome, and the role of cephalometric analysis in the prediction of abnormal breathing during sleep. Methods: Thirty-nine patients with obstructive sleep apnea syndrome(OSAS), 39 simple snorers(simple snorers) and 20 controls(control) had cephalometric analysis using the technique of Riley et al, and underwent standardized polysomnographic recordings. Different variables, including sex, body mass index, cephalometric and polysomnographic data, were statistically analyzed. Results: Pm-UPW and V-LPW distances were significantly shorter in OSAS when compared with simple snorers or control. PAS in simple snorers was shorter than in control. ANS-Gn distance in OSAS was significantly longer than in control. PNS-P distance in OSAS or simple snorers was significantly longer than in control. MP-H distance in OSAS was significantly longer than in simple snorers or control and MP-H distance in simple snorers was also longer than in control. NL/Pm-P angle in OSAS was lesser than in control. MP-H distance in OSAS or in the combined groups of OSAS and simple snorers was significantly correlated with apneahypopnea index(AHI). PNS-P distance in the combined groups of OSAS and simple snorers was correlated with AHI. In male of all subjects, body mass index was significantly correlated with PNS-P or MP-H distance. Conclusion: Cephalometric analysis can be useful tool in determining the craniofacial anatomic abnormalities in patients with obstructive sleep apnea syndrome. Cephalometric parameters, especially MP-H distance, can be useful for predicting frequency of narrowing or obstruction of upper airway during sleep.

• Kyungpook Mathematical Journal
• /
• v.54 no.3
• /
• pp.471-476
• /
• 2014

Let R be a ring. A right R-module M is PS-injective if every R-homomorphism $f:aR{\rightarrow}M$ for every principally small right ideal aR can be extended to $R{\rightarrow}M$. We investigate, in this paper, rings whose simple singular modules are PS-injective. New characterizations of semiprimitive rings and semisimple Artinian rings are given.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.39-51
• /
• 2009

This study matters the design and implementation of an intelligent information search engine that is based on the $R^2SS$(Reverse Really Simple Syndication). Apart from to the previous method, where the user inputs the RSS address that one intends and obtains limited RSS information, the user just types in the information that one appoints to acquire the RSS information of standard documents that the user is interested among several RSS addresses by a Reverse RSS(Really Simple Syndication) method, which is drawn by the automated RSS address collection server in realtime. Through the proposed $R^2SS$(Really Reverse Simple Syndication) based intelligent information search engine, time can be significantly saved along with obtaining information with good quality, furthermore, it has the effects of having a personal secretary.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.655-672
• /
• 2011

Let $C^r$[0,t] be the function space of the vector-valued continuous paths x : [0,t] ${\rightarrow}$ $R^r$ and define $X_t$ : $C^r$[0,t] ${\rightarrow}$ $R^{(n+1)r}$ and $Y_t$ : $C^r$[0,t] ${\rightarrow}$ $R^{nr}$ by $X_t(x)$ = (x($t_0$), x($t_1$), ..., x($t_{n-1}$), x($t_n$)) and $Y_t$(x) = (x($t_0$), x($t_1$), ..., x($t_{n-1}$)), respectively, where 0 = $t_0$ < $t_1$ < ... < $t_n$ = t. In the present paper, with the conditioning functions $X_t$ and $Y_t$, we introduce two simple formulas for the conditional expectations over $C^r$[0,t], an analogue of the r-dimensional Wiener space. We establish evaluation formulas for the analogues of the analytic Wiener and Feynman integrals for the function $G(x)=\exp{{\int}_0^t{\theta}(s,x(s))d{\eta}(s)}{\psi}(x(t))$, where ${\theta}(s,{\cdot})$ and are the Fourier-Stieltjes transforms of the complex Borel measures on ${\mathbb{R}}^r$. Using the simple formulas, we evaluate the analogues of the conditional analytic Wiener and Feynman integrals of the functional G.

• Solar Energy
• /
• v.19 no.3
• /
• pp.101-113
• /
• 1999

Thermodynamic performance of a simple Rankine cycle, regenerative Rankine cycle, and Kalina cycle for Ocean thermal Energy Conversion(OTEC) is evaluated under the same condition with various working fluids. The evaporator and condenser are modeled by a UA and LMTD method while the turbine and pump are modeled by considering isentropic efficiencies. As for the working fluids, R22, R134a, R32, propylene, ammonia are used for the Rankine cycles while ammonia/water and R32/R134a mixtures are used for Kalina cycle. Calculated results show that newly developed fluids such non-ozone depleting refrigerants as R134a and R32 perform as well as R22 and ammonia. The regenerative Rankine cycle showed a 1.2 to 2.8% increase in energy efficiency as compared to the simple Rankine cycle while the Kalina cycle with ammonia/water mixture showed a 1.8% increase in energy efficiency. The efficiency of the Kalina cycle with R32/R134a mixtures is the same as that of a simple Rankine cycle using R22. Therefore, the regenerative Rankine cycle turns out to be best choice for OTEC applications.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.5 no.1
• /
• pp.13-16
• /
• 2000

Simple procedures have been devised for purifying recombinant human interleukin-2 (hIL-2), which was expressed in Escberichia coli using sequences of glucagon molecules and enterokinase cleavage site as an N-terminus fusion partner. The insoluble aggregates of recombinant fusion protein produced in E. coli cytoplasm were easily dissolved by simple alkaline pH shift $(8\rightarrow12\rightarrow8)$. Following enterokinase cleavage, the recombinant hIL-2 was finally purified by one-step reversed-phase HPLC with high purity. The ease and high efficiency of this simple purification process seem to mainly result from the role of used glucagon fusion partner, which could be applied to the production of other therapeutically important proteins.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.407-419
• /
• 2009

The simple non-associative algebra $N(e^{A_S},q,n,t)_k$ and its simple sub-algebras are defined in the papers [1], [3], [4], [5], [6], [12]. We define the non-associative algebra $\overline{WN_{(g_n,\mathfrak{U}),m,s_B}}$ and its antisymmetrized algebra $\overline{WN_{(g_n,\mathfrak{U}),m,s_B}}$. We also prove that the algebras are simple in this work. There are various papers on finding all the derivations of an associative algebra, a Lie algebra, and a non-associative algebra (see [3], [5], [6], [9], [12], [14], [15]). We also find all the derivations $Der_{anti}(WN(e^{{\pm}x^r},0,2)_B^-)$ of te antisymmetrized algebra $WN(e^{{\pm}x^r}0,2)_B^-$ and every derivation of the algebra is outer in this paper.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.167-172
• /
• 1994

For a given $C^{*}$-dynamical system (A, G, .alpha.) with a G-simple $C^{*}$-algebra A (that is A has no proper .alpha.-invariant ideal) many authors have studied the simplicity of a $C^{*}$-crossed product A $x_{\alpha{r}}$ G. In [1] topological freeness of an action is shown to guarantee the simplicity of the reduced $C^{*}$-crossed product A $x_{\alpha{r}}$ G when A is G-simple. In this paper we investigate the pure infiniteness of a simple $C^{*}$-crossed product A $x_{\alpha}$ G of a purely infinite simple $C^{*}$-algebra A and a topologically free action .alpha. of a finite group G, and find a sufficient condition in terms of the action on the spectrum of the multiplier algebra M(A) of A. Showing this we also prove that some extension of a topologically free action is still topologically free.

• Genomics & Informatics
• /
• v.20 no.3
• /
• pp.35.1-35.9
• /
• 2022

Microsatellites or simple sequence repeats are motifs of 1 to 6 nucleotides in length present in both coding and non-coding regions of DNA. These are found widely distributed in the whole genome of prokaryotes, eukaryotes, bacteria, and viruses and are used as molecular markers in studying DNA variations, gene regulation, genetic diversity and evolutionary studies, etc. However, in vitro microsatellite identification proves to be time-consuming and expensive. Therefore, the present research has been focused on using an in-house built java pipeline to identify, analyse, design primers and find related statistics of perfect and compound microsatellites in the seven complete genome sequences of coronavirus, including the genome of coronavirus disease 2019, where the host is Homo sapiens. Based on search criteria among seven genomic sequences, it was revealed that the total number of perfect simple sequence repeats (SSRs) found to be in the range of 76 to 118 and compound SSRs from 01 to10, thus reflecting the low conversion of perfect simple sequence to compound repeats. Furthermore, the incidence of SSRs was insignificant but positively correlated with genome size (R² = 0.45, p > 0.05), with simple sequence repeats relative abundance (R² = 0.18, p > 0.05) and relative density (R² = 0.23, p > 0.05). Dinucleotide repeats were the most abundant in the coding region of the genome, followed by tri, mono, and tetra. This comparative study would help us understand the evolutionary relationship, genetic diversity, and hypervariability in minimal time and cost.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.