• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.111-119
• /
• 2023

In this paper, we investigate the feasibility of functional programming in the Scala language. The main issue is to what extent Scala is able to handle major properties of functional programming such as lambda expression, high-order functions, generic types, algebraic data types, and monads. For this purpose, we implement an interpreter of an imperative language. In this implementation, the same functional programming techniques are applied to both Haskell and Scala languages, and then these two versions of implementations are compared and analyzed. The abstract syntax tree of an imperative language is expressed as algebraic data types with generics and enum classes in Scala, and the state transition of imperative languages is implemented by using state monad. Extension and given, new features of Scala, are used as well.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.1
• /
• pp.27-38
• /
• 2007

This paper describes a multiresidual approximation method for scattered volumetric data modeling. The approximation method employs a volumetric NURBS or VNURBS as a data interpolating function and proposes two multiresidual methods as a data modeling algorithm. One is called as the residual series method that constructs a sequence of VNURBS functions and their algebraic summation produces the desired approximation. The other is the residual merging method that merges all the VNURBS functions mentioned above into one equivalent function. The first one is designed to construct wavelet-type multiresolution models and also to achieve more accurate approximation. And the second is focused on its improvement of computational performance with the save fitting accuracy for more practical applications. The performance results of numerical examples demonstrate the usefulness of VNURBS approximation and the effectiveness of multiresidual methods. In addition, several graphical examples suggest that the VNURBS approximation is applicable to various applications such as surface modeling and fitting problems.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.35-48
• /
• 2005

An architectural framework is developed for integrating geospatial and temporal data with relational information from which a spatio-temporal data warehouse (STDW) system is built. In order to implement the STDW, a generic conceptual model was designed that accommodated six dimensions: spatial (map object), temporal (time), agent (contractor), management (e.g. planting) and tree species (specific species) that addressed the 'where', 'when', 'who', 'what', 'why' and 'how' (5W1H) of the STDW information, respectively. A formal algebraic notation was developed based on a triplet schema that corresponded with spatial, temporal, and relational data type objects. Spatial object structures and spatial operators (spatial selection, spatial projection, and spatial join) were defined and incorporated along with other database operators having interfaces via the generic model.

• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.1009-1018
• /
• 2012

Persistence homology (a type of methodology in computational algebraic topology) can be used to capture the topological characteristics of functional data. To visualize the characteristics, a persistence diagram is adopted by plotting baseline and the pairs that consist of local minimum and local maximum. We use the bottleneck distance to measure the topological distance between two different functions; in addition, this distance can be applied to multidimensional scaling(MDS) that visualizes the imaginary position based on the distance between functions. In this study, we use handwriting data (which has functional forms) to get persistence diagram and check differences between the observations by using bottleneck distance and the MDS.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.555-561
• /
• 2009

In lieu of section profile data, a fitting of the bored tunnel shape is more significant confirmation for maintenance of a tunnel. Before the permit on the completion of a tunnel, deformation of the completed tunnel with respect to the design model are considered. And deformation can be produced at continuously along the entire of the tunnel section. This study firstly includes an analysis of algebraic approach and test it with an observed field data. And then a number of methods, line search method, genetic algorithm, and pattern search methods, are compared with the 3D tunnel shape fitting. Algebraic methods can solve a simple circular cylinder type as like a railway tunnel. However, a more complex model (compound circular curve and non circular) as like a highway tunnel has to be solved with soft computing tools in the cause of conditional constraints. The genetic algorithm and pattern search methods are computationally more intensive, but they are more flexible at a complex condition. The line search method is fastest, but it needs a narrow bounds of the initial values.

• The Korean Journal of Applied Statistics
• /
• v.8 no.1
• /
• pp.51-60
• /
• 1995

Given an $n \times p$ data matrix, if we add the $p_s$ variables somewhat different nature than the p variables to this matrix, we have a new $n \times (p+p_s)$ data matrix. Because of these $p_s$ variables, the traditional principal component analysis can't provide its efficient results. In this study, to improve this problem we review the supplementary principal component analysis putting $p_s$ variables to supplementary variable. This technique is based on the algebraic and geometric aspects of the traditional principal component analysis. So we provide a type of statistical data analysis for the records of eight teams and fourteen fields of the 1982-1992 Korean Pro Baseball Data based on the supplementary principal component analysis and the traditional principal component analysis. And we compare the their results.

• Journal of the Korean Mathematical Society
• /
• v.40 no.5
• /
• pp.901-920
• /
• 2003

The notion of infinitely near singular points, classical in the case of plane curves, has been generalized to higher dimensions in my earlier articles ([5], [6], [7]). There, some basic techniques were developed, notably the three technical theorems which were Differentiation Theorem, Numerical Exponent Theorem and Ambient Reduction Theorem [7]. In this paper, using those results, we will prove the Finite Presentation Theorem, which the auther believes is the first of the most important milestones in the general theory of infinitely near singular points. The presentation is in terms of a finitely generated graded algebra which describes the total aggregate of the trees of infinitely near singular points. The totality is a priori very complex and intricate, including all possible successions of permissible blowing-ups toward the reduction of singularities. The theorem will be proven for singular data on an ambient algebraic shceme, regular and of finite type over any perfect field of any characteristics. Very interesting but not yet apparent connections are expected with many such works as ([1], [8]).

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.267-278
• /
• 2009

As a survey-type article, the paper reviews the recent results on a (generalized) universal covering space in digital covering theory. The recent paper [19] established the generalized universal (2, k)-covering property which improves the universal (2, k)-covering property of [3]. In algebraic topology it is well-known that a simply connected and locally path connected covering space is a universal covering space. Unlike this property, in digital covering theory we can propose that a generalized universal covering space has its intrinsic feature. This property can be useful in classifying digital covering spaces and in studying a shortest k-path problem in data structure.

• International Journal of Automotive Technology
• /
• v.6 no.4
• /
• pp.375-381
• /
• 2005

This paper presents linear algebraic equations in the form of recursive formula to compute elastokinematic characteristics of a suspension system. Conventional methods of elastokinematic analysis are based on nonlinear kinematic constrant equations and force equilibrium equations for constrained mechanical systems, which require complicated and time-consuming implicit computing methods to obtain the solution. The proposed linearized elastokinematic equations in the form of recursive formula are derived based on the assumption that the displacements of elastokinematic behavior of a constrained mechanical system under external forces are very small. The equations can be easily computerized in codes, and have the advantage of sharing the input data of existing general multi body dynamic analysis codes. The equations can be applied to any form of suspension once the type of kinematic joints and elastic components are identified. The validity of the method has been proved through the comparison of the results from established elastokinematic analysis software. Error estimation and analysis due to piecewise linear assumption are also discussed.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.2
• /
• pp.313-324
• /
• 1992

Two-dimensional Navier-Stokes code has been developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system, then mapped into a generalized body-fitted coordinate system. All direction of viscous terms are incorporated and turbulent effects are modeled using the Baldwin-Lomax algebraic model. Equation are discretized using finite difference method on the C-type grids and solved using implicit LU-ADI decomposition scheme. Calculations are made at a VKI turbine cascade flow in a transonic wind-tunnel and compared to experimental data. Present numerical scheme is shown to be in good agreement with the previous experimental results and simulates the two-dimensional viscous flow phenomena.