• Journal of Environmental Science International
• /
• v.20 no.4
• /
• pp.427-434
• /
• 2011

This study characterized the full range of vegetation in a upland wetland (marshland) in Korea. Classified community types were used to describe vegetation at the marshland and adjacent areas. The communities contained 44 species of vascular plants and all species were identified into four plant community types. The Rhododendron yedoense f. poukhanense type and Lespedeza cyrtobotrya type had a high representation infacultative upland species (FU) and obligate upland species (OU), respectively. The monocot type was dominant in marshland by Miscanthuns saccharifloruc and contained 14 species. Together the three areas contained four species, with the strongest indicator species being Ranunculus acris var. nipponicus, Rhododendron yedoense f. poukhanense, Hemerocallis fulva, and Miscanthuns sinensis var. purpurascens. Shannon-Weaver index of diversity also varied among the community types (F = 18.9, df = 2), with the types FU having significantly higher value (3.467) than the others (1.125 for type FW and 1.239 for type OU).

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1265-1283
• /
• 2019

We develop a framework to construct geometric representations of finite groups G through the correspondence between real toric spaces $X^{\mathbb{R}}$ and simplicial complexes with characteristic matrices. We give a combinatorial description of the G-module structure of the homology of $X^{\mathbb{R}}$. As applications, we make explicit computations of the Weyl group representations on the homology of real toric varieties associated to the Weyl chambers of type A and B, which show an interesting connection to the topology of posets. We also realize a certain kind of Foulkes representation geometrically as the homology of real toric varieties.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.531-543
• /
• 2022

The article proposed a new type of data relationship: Positive Boolean dependencies by groups on block and slice in the database model of block form, where instead of considering value pairs, we consider a group of p values (p ≥ 2). From this new concept, the article stated and demonstrated the equivalence of the three types of deduction, namely: deduction by logic, deduction by block with groups, deduction by block has no more than p elements with groups. Operations on blocks or slices performed for index attributes on blocks, the properties related to this new concept as theorem the equivalen of the three types of deduction, closure of set positive Boolean dependencies by groups and representation and tight representation set of positive Boolean dependencies by groups when the block degenerated into relation are true in the relational database model and also stated and proven in this paper.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1521-1536
• /
• 2017

This paper introduces a representation style of variable binding using dependent types when formalizing meta-theoretic properties. The style we present is a variation of the Coquand-McKinna-Pollack's locally-named representation. The main characteristic is the use of dependent families in defining expressions such as terms and formulas. In this manner, we can handle many syntactic elements, among which wellformedness, provability, soundness, and completeness are critical, in a compact manner. Another point of our paper is to investigate the roles of free variables and constants. Our idea is that fresh constants can entirely play the role of free variables in formalizing meta-theories of first-order predicate logic. In order to show the feasibility of our idea, we formalized the soundness and completeness of LJT with respect to Kripke semantics using the proof assistant Coq, where LJT is the intuitionistic first-order predicate calculus. The proof assistant Coq supports all the functionalities we need: intentional type theory, dependent types, inductive families, and simultaneous substitution.

• Journal of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.227-274
• /
• 2001

In this paper we intended to discuss the following topics: (1) Notation, generalities, Markov processes. The close relationship between (generators of) Markov processes and the martingale problem is exhibited. A link between the Korovkin property and generators of Feller semigroups is established. (2) Feynman-Kac semigroups: 0-order regular perturbations, pinned Markov measures. A basic representation via distributions of Markov processes is depicted. (3) Dirichlet semigroups: 0-order singular perturbations, harmonic functions, multiplicative functionals. Here a representation theorem of solutions to the heat equation is depicted in terms of the distributions of the underlying Markov process and a suitable stopping time. (4) Sets of finite capacity, wave operators, and related results. In this section a number of results are presented concerning the completeness of scattering systems (and its spectral consequences). (5) Some (abstract) problems related to Neumann semigroups: 1st order perturbations. In this section some rather abstract problems are presented, which lie on the borderline between first order perturbations together with their boundary limits (Neumann type boundary conditions and) and reflected Markov processes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.851-860
• /
• 1990

This paper presents a recognition method which interprets 3-D object in terms of several silhouettes of quadtree and octree. Object representation used in object matching should be invariant with respect to locatin and orientation of the object. Generalized octree is projected on to image plane along the principal axes. Regular octree is made from orthogonal directions, but generalized octree is independent to viewing directions. Recognition process is achieved in two-stage matching. The quadtrees and octrees of unknown object with minimum dissimilarities are matched with the quadtrees and octrees of the models. So as to verify efficiency of 3-D object representation and accuracy of object recognition, experiments are performed for 14 different type of geometrical models and its results have been shown.

• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• pp.75-77
• /
• 1994

This paper presents a method of obtaining transmission network equivalents from the network's driving-point admittance characteristic. Proposed method is based on modal decomposition representation for the large-scale interconnected system. As a result, Norton-type of discrete-time filter model can be generated. It can reproduce the driving-point admittance characteristic of the network. Furthermore proposed model can be implemented into the EMTP in a direct manner. The simulation results with the full system representation and the developed equivalent system showed a good agreement.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.34-39
• /
• 2002

This paper proposed a kind of software component specification method based on XML. We define a document type definition(DTD) of software component specification for the XML representation of a component. The semantic relationship of the component elements in diagrams of component specification must be Presented by the XML tag. This paper also designs the supporting tool for the representation of the software component specification.

• The Mathematical Education
• /
• v.45 no.1 s.112
• /
• pp.105-121
• /
• 2006

The purpose of this study is to investigate preservice secondary mathematics teachers' knowledge about graphical representation and provide implications for better mathematics teaching and learning in our schools. For this purpose, sixty-three preservice teachers were selected and given diverse graphical representation problems of y=1, y=x, x=0, $x^2+y^2=1$. All preservice teachers completed two types of questionnaires. First type is about constructing the graphs of the above each equation, and the second one is to make them find the appropriate graphs from given examples of the each equation. The results indicated that all the participant pre service teachers were unable to construct graphs in terms of various dimensions and various direction of coordinate axis. All of the participants represented the graph of each equation on only two-dimensional coordinate system. In addition, some preservice teachers believed that the axis of coordinates have to be x-axis on horizontal line and y-axis on vertical line. From this study, it is implicated that pre service teacher education program needs to provide the experience of representing the graphs of equation in terms of various dimensions and various direction of coordinate axis so as to develop their future students the flexibility and creativity in mathematical thinking especially in the area of space perception.