• Journal of Sensor Science and Technology
• /
• v.21 no.3
• /
• pp.217-222
• /
• 2012

Optical coherence tomography(OCT) is a noninvasive optical imaging tool for biomedical applications. OCT can provide depth resolved two/three dimensional morphological images on biological samples. In this paper, we integrated an OCT system that was composed of an SLED(Superluminescent Light Emitting Diode, ${\lambda}_0$=1305 nm bandwith= 141 nm), a reference arm adopting a rapid scanning optical delay line(RSOD) to get high speed imaging, and a sample arm that used a micro electro mechanical systems(MEMS) scanning mirror. The sample arm contained a compact probe for imaging dental structures. The performance of the system was evaluated by imaging in-vivo human teeth with dental calculus, and the results indicated distinct appearance of dental calculus from enamel, gum or decayed teeth. The developed probe and system could successfully confirm the presence of dental calculus with a very high spatial resolution($6{\mu}m$).

• Journal of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.363-379
• /
• 2016

Motivated mainly by certain interesting recent extensions of the generalized hypergeometric function [Integral Transforms Spec. Funct. 23 (2012), 659-683] and the second Appell function [Appl. Math. Comput. 219 (2013), 8332-8337] by means of the incomplete Pochhammer symbols $({\lambda};{\kappa})_{\nu}$ and $[{\lambda};{\kappa}]_{\nu}$, we introduce here the family of the incomplete generalized ${\tau}$-hypergeometric functions $2{\gamma}_1^{\tau}(z)$ and $2{\Gamma}_1^{\tau}(z)$. The main object of this paper is to study these extensions and investigate their several properties including, for example, their integral representations, derivative formulas, Euler-Beta transform and associated with certain fractional calculus operators. Further, we introduce and investigate the family of incomplete second ${\tau}$-Appell hypergeometric functions ${\Gamma}_2^{{\tau}_1,{\tau}_2}$ and ${\gamma}_2^{{\tau}_1,{\tau}_2}$ of two variables. Relevant connections of certain special cases of the main results presented here with some known identities are also pointed out.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.800-807
• /
• 2008

We introduce some well-known approaches to formalization and automatization of the meta-theory of a programming language with binders. They represent the trends in POPLmark Challenge. We demonstrate some characteristics of each approach by showing how to formalize some basic notations and concepts of Lambda-calculus using the proof assistant Coq.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.06a
• /
• pp.77-86
• /
• 2002

The aim of this study is to construct a formal semantic representation of the korean adverbial phrase(AdvP) composed of NP of t imp and of the adverbial particle OE. This AdvP establishes various relations between the time indicated by NP and the time of the event described by the sentence, depending on the type of th first and the aspectual property of the second. To represent formally the semantic functions of this AdvP, we used lambda-calculus and unification grammar in the way proposed by Renaud(1996).

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.658-666
• /
• 2004

Separable systems are defined in term rewriting systems, respecting the notion of separability in the λ-calculus. In this research, we generalize separable systems of term rewriting systems, which was studied in restrictive systems such as constructive systems. We also associate separability with index-transitivity and with forward branching Separability is identified with forward branching, and strong sequentiality with index-transitivity satisfies separability. These are such good properties that enable us to describe the procedure of pattern-matching as an index tree, which is a sort of automata, and to transform separable systems into a constructor system with a simple pattern. Separable systems, in particular, can be translated into the λ-calculus. This research can serve a theoretical basis which allows functional languages to be explained by the λ-calculus, since functional languages such as ML and Haskell belong to a subclass of separable systems.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.733-745
• /
• 1995

This study is aimed at construction of a translator for a functional programming language. For this goal we define a functional programming language which has lazy semantics and develop a translator for it. The execution model selected is the G-machine-based combinator graph reduction. The translator is composed of 4 phases and translates a source program to a C program. The first phase of the translator translates a source program to a enriched lambda- calculus graph, the second phase transforms a lambda-calculus graph into supercombinators, the third phase translates supercombiantors to a G program and the last phase translates the G program to a C program. The final result of the translator, a C program, is compiled to an executable program by C compiler. The translator is implemented in C using compiler development tools such as TACC and Lex, under the UNIX environments. In this paper we present the design and implementation techniques for developing the translator and show results by executing some test problems.

• Kyungpook Mathematical Journal
• /
• v.55 no.4
• /
• pp.953-967
• /
• 2015

In this article, by making use of a linear multiplier fractional differential operator $D^{{\delta},m}_{\lambda}$, we introduce a new subclass of spiral-like functions. The main object is to provide some subordination results for functions in this class. We also find sufficient conditions for a function to be in the class and derive Fekete-$Szeg{\ddot{o}}$ inequalities.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.1
• /
• pp.25-34
• /
• 1998

There are two major method for expressing parallelim in functional languages. The one is the strictness analysis and the other the annotation. The strictness analysis is a method that a compiler detects parallelism and expresses the detected information in the object program. The annotation is a method that a programmer detects parallelism and expresses in the source program. This study is on the annotation and is aimed at construction of a translator for a functional language which has an annotation syntax. The translator translates a source program to enriched lambda-calculus graphs. The translator is implemented in C using compiler development tools such as YACC and Lex, under UNIX environments. In this paper we present the design and implementation techniques for developing the front-end of the translator.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.244-251
• /
• 2009

We present a transformation which converts open-code multi-staged programs into closed ones. Staged computation, which explicitly divides a computation into separate stages, is a unifying framework for existing program generation systems. Because a multi-staged program generates another program, which can also generate a third program and on, the implementation of a multi-staged language is not straightforward. Dynamic binding of (lexically free) variables in code also makes the implementation of a multi-staged language hard. By converting each code into code of function which takes environment for free variables as its argument and giving an actual environment at the code-composition site, we can transform a open-code program into a closed-code one. Combining with Davies and Pfenning's method, our closed-code-conversion enables the implementation of the unstaged language to be useful for executing multi-staged programs. We also prove the correctness of our conversion: the converted program is equivalent to the original program, and the converted program does not have open code.