• 제목/요약/키워드: Algebraic Data Type

검색결과 15건 처리시간 0.034초

Feasibility Study Of Functional Programming In Scala Language By Implementing An Interpreter

  • Sugwoo, Byun
    • 한국컴퓨터정보학회논문지
    • /
    • 제28권2호
    • /
    • pp.111-119
    • /
    • 2023
  • 본 논문에서는 스칼라 언어의 함수형 프로그래밍 기능의 타당성에 대해서 검토한다. 주된 관심사는 스칼라가 어느 정도까지 람다 식, 고차 함수, 제너릭 타입, 대수적 타입, 모나드 등 함수형 프로그래밍의 주요 특성을 표현할 수 있는 가에 있다. 이 목적을 위하여 명령형 프로그래밍 언어의 인터프리터를 구현한다. 동일한 함수형 프로그래밍 기법을 적용하여 인터프리터를 하스켈과 스칼라로 구현한 다음, 이 두 버전의 구현을 비교 분석한다. 명령형 프로그래밍 언어의 추상 구문트리는 스칼라의 제너릭스를 갖는 대수적 타입과 enum 클래스로서 표현되고, 명령형 프로그래밍의 상태 변환은 상태 모나드를 이용하여 구현된다. 또한 스칼라의 새로운 기능인 extension과 given도 사용된다.

분산형 볼륨 데이터의 VNURBS 기반 다중 잔차 근사법 (Multiresidual approximation of Scattered Volumetric Data with Volumetric Non-Uniform Rational B-Splines)

  • 박상근
    • 한국CDE학회논문집
    • /
    • 제12권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.

시간 공간 통합 본원적 데이터 모델링 및 그 구현에 관한 연구 (Modeling and Implementation for Generic Spatio-Temporal Incorporated Information)

  • 이우기
    • Journal of Information Technology Applications and Management
    • /
    • 제12권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.

  • PDF

Visualization of Bottleneck Distances for Persistence Diagram

  • Cho, Kyu-Dong;Lee, Eunjee;Seo, Taehee;Kim, Kwang-Rae;Koo, Ja-Yong
    • 응용통계연구
    • /
    • 제25권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.

레이저 스캐닝 측점군에 의한 터널 3차원 형상의 재현 (3D Tunnel Shape Fitting by Means of Laser Scanned Point Cloud)

  • 권기욱;이종달
    • 대한토목학회논문집
    • /
    • 제29권4D호
    • /
    • pp.555-561
    • /
    • 2009
  • 굴착된 터널 형상 재현에서 단면의 종단 데이터는 터널의 유지를 위해서는 아주 중요하다. 터널이 완성되기전에 설계된 모델을 고려한 완성된 터널의 변형이 고려되어져야 한다. 그리고 변형은 터널 단면 전체를 따라 연속적으로 나타날 수 있다. 본 연구에서는 먼저 수학적 분석으로 접근하였고, 그것을 관측된 터널단면 데이터에 실험 하였다. 그 다음 선추적 방법, 유전자 알고리즘, 패턴 추적 방법 등으로 3D 터널 형상 재현을 비교하였다. 수학적 방법론은 철도 터널과 같은 간단한 원통형은 쉽게 해결이 되었으나, 도로터널과 같은 더욱 복잡한 모델(복심 곡선형과 비원통형)은 구속된 상태하에서 소프트 컴퓨팅 툴을 가지고 해결할 수 있었다. 유전자 알고리즘과 직접탐색법은 많은 계산 시간이 걸렸으나 복잡한 상태하에서 더욱 유연함을 보였으며, 선추적 방법은 초기값들이 제한된 범위 하에서 가장 빠르게 계산되어졌다.

89-92 한국 프로야구의 각 팀과 부문별 평균 성적에 대한 추가적 주성분분석의 응용 (Application of the supplementary principal component analysis for the 1982-1992 Korean Pro Baseball data)

  • 최용석;심희정
    • 응용통계연구
    • /
    • 제8권1호
    • /
    • pp.51-60
    • /
    • 1995
  • 크기가 $n \times p$인 자료행렬에서 p개의 변수들과 성격이 다소 다른 $p_s$개의 변수를 같이 고려한 크기가 $n \times (p + p_s)$ 자료행렬이 있다 하자. 전통적 주성성분분석은 성격이 다른 변수들로 인하여 효과적인 결과를 제공하지 못한다. 본 논문에서는 이런 점을 개선하기 위해서 성격이 다른 $p_s$개의 변수를 추가변수로 두는 추가적 주성분분석을 소개하려 한다. 이 기법은 전통적 주성분분석의 대수적,기하적인 면을 따른다. 그리고 전통적 주성분분석과 추가적 주성성분분석을 활용한 한국 프로야구의 8개팀과 1982-1992년 동안의 14개의 부문별 기록에 대한 전형적인 자료분석의 한 예를 제시한다. 더불어 두 분석의 결과도 비교하였다.

  • PDF

THEORY OF INFINITELY NEAR SINGULAR POINTS

  • Hironaka, Heisuke
    • 대한수학회지
    • /
    • 제40권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]).

REMARK ON GENERALIZED UNIVERSAL COVERING SPACE IN DIGITAL COVERING THEORY

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제31권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.

ELASTOKINEMATIC ANALYSIS OF A SUSPENSION SYSTEM WITH LINEAR RECURSIVE FORMULA

  • KANG J. S.
    • International Journal of Automotive Technology
    • /
    • 제6권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.

2차원 익렬유동의 Navier-Stokes 해석 (Navier-Stokes Analysis of Two Dimensional Cascade Flow)

  • 정희택;백제현
    • 대한기계학회논문집
    • /
    • 제16권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.