• Journal of the Korean Chemical Society
• /
• v.12 no.2
• /
• pp.61-64
• /
• 1968

Compressibility and expansibility of activation, ${\Delta}K^{\neq}\;and\;{\Delta}E^{\neq},$ are defined with the use of general principles that an activation parameter is the difference in partial molar quantities of the parameter for the transition and initial state. Two related parameters, (${\partial}{\Delta}H^{\neq}/{\partial}P)_{\gamma}\;and\;{\Delta}W^{\neq}(=P{\Delta}V^{\neq}),$ are also derived. Simpler interpretation of the existing kinetic data are possible with these activation parameters, while other derivations lead to complicated expressions of no practical significance.

• Korean Journal of Mathematics
• /
• v.9 no.2
• /
• pp.157-164
• /
• 2001

We construct an operad which is called the mapping class group operad. Its structure map is induced by the attachings of surfaces. The similar operad was constructed by Tillmann in order prove that ${\Gamma}^+_{\infty}$ is an infinite loop space. Our operad is rather simpler and easier to deal with.

• The Journal of the Korean dental association
• /
• v.50 no.4
• /
• pp.180-188
• /
• 2012

Cone beam computed tomography(CBCT) machines recently developed in Korea, being designed for imaging hard tissues of the oral and maxillofacial region. I reported a brief overview of CBCT system, in comparison with coventional computed tomography(CT) system. CBCT provides high resolution, simpler image acquisition, lower dose and cost alternative to conventional CT, promising to revolutionize the practice of oral and maxillofacial radiology.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.573-584
• /
• 2016

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. Such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them T-functions are probably invertible transformations and are very useful in stream ciphers. In this paper we will characterize a secure trinomial on ${\mathbb{Z}}_{2^n}$ which generates an n-bit word sequence without consecutive elements of period $2^n$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1259-1268
• /
• 1995

This note presents the robust root clustering problem of interval systems whose characteristic equation might be given as either a family of interval polynomials or a family of polytopes. Corresponding to damping ratio and robustness margin approximately, we consider a certain class of D-region such as parabola, left-hyperbola, and ellipse in complex plane. Then a simpler D-stability criteria using rational function mapping is presented and prove. Without .lambda. or .omega. sweeping calculation, the absolute criteria for robust D-stability can be determined.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.209-212
• /
• 1996

In this paper, we propose to re-size images using an oblique projection operator instead of the orthogonal one in order to obtain faster, simpler, and more general algorithms. The main advantage is that it becomes perfectly feasible to use higher order models(e.g., splines of degree n 3). We develop the theoretical background and present a simple and practical implementation procedure that uses B-splines. Experiments show that the proposed algorithm consistently outperforms the standard interpolation method and that it essentially provides the same performance as the optimal procedure (least squares solution) with considerably less computations.

• Korea-Australia Rheology Journal
• /
• v.21 no.2
• /
• pp.143-146
• /
• 2009

Breakthrough of high Weisenberg number problem is related with keeping the positive definiteness of the conformation tensor in numerical procedures. In this paper, we suggest a simple method to preserve the positive definiteness by use of vector decomposition of the conformation tensor which does not require eigenvalue problem. We also derive the constitutive equation of tensor-logarithmic transform in simpler way than that of Fattal and Kupferman and discuss the comparison between the vector decomposition and tensor-logarithmic transformation.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1319-1322
• /
• 2003

We present a web document summarizer, simpler more condense than the existing ones, of a search engine. This summarizer generates summaries with a statistic-based summarization method using Clustering or MMR technique to reduce redundancy in the results, and that generates summaries using Perfect Link Graph. We compare the results with the summaries generated by human subjects. For the comparison, we use FScore. Our experimental results verify the accuracy of the summarization methods.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.463-469
• /
• 2001

An algorithm is presenter for generating the most probable states in decreasing order of probability of each unit. The proposed new algorithm in this note is compared with the existing methods regarding memory requirement and execution time. Our method is simpler and, judging from the computing experiment, it requires less memory size than the previously known methods and takes comparable execution time to previous methods for an acceptable level of criterion.

• MALSORI
• /
• no.46
• /
• pp.127-143
• /
• 2003

This paper presents segmental labeling conventions proposed by SiTEC (Speech Information Technology Engineering Center) 2002 and proposes a new directions of a revision for a simpler version. The paper also reviews one of the prosody labelling conventions for Korean, K-ToBI convention(ver. 3.1) and proposes a couple of modifications and suggestions.