• Title/Summary/Keyword: Variant

Search Result 1,899, Processing Time 0.047 seconds

A comparative study about the variant form of the Chinese character in the five sorts of old maps drawing outside of the four main gates of old Seoul including DeDongYei-jido (고지도(古地圖) 경조(京兆) 사대문(四大門)밖 지역 한자 이체자(異體字) 비교 연구)

  • Lee, Kyeong-Won
    • Cross-Cultural Studies
    • /
    • v.21
    • /
    • pp.213-254
    • /
    • 2010
  • The goal of this thesis is to make a comparative study about the variant form of the Chinese character in the five sorts of old maps drawing outside of the main gates of old map including DeDongYei-jido. The main task of this thesis can be classified under three heads - (1) introducing the literature of comparative study in the five sorts of old maps including DeDongYei-jido (2) classification of variant form in the five sorts of old maps (3) characteristic of variant form in the five sorts of old maps. In this thesis, aspect of variant form is classified under six head - (1) variation of the whole shape of the character (2) taking place the variation in both sides of Chinese character (3) taking place the variation in part (4) taking place variation in the strokes of the Chinese character (5) misusing different characters (6) changing different characters. This thesis explains some characteristic of variant form - (1) simplification of the shape of characters (2) using the Hou-qi-zi(後起字, Chinese character which is actually the same but made the next) (3) replacing the overlapped both sides of Chinese character with omit mark (4) a wrongly written character (5) discovering the variant form such as variant form of 廣, 广 variant form of 廛, variant form of 院 which was not recorded in Chinese literature. From now on, there should be some collections of variant form of Korean style and study. we are going to have to standardize aspect of variation and rule of variant form in old maps until we have to make some ways to recognize the block letter.

An Approach to a Formal Linearization toy Time-variant Nonlinear Systems using Polynomial Approximations

  • Komatsu, Kazuo;Takata, Hitoshi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.52.2-52
    • /
    • 2002
  • In this paper we consider an approach to a formal linearization for time-variant nonlinear systems. A time-variant nonlinear sysetm is assumed to be described by a time-variant nonlinear differential equation. For this system, we introduce a coordinate transformation function which is composed of the Chebyshev polynomials. Using Chebyshev expansion to the state variable and Laguerre expansion to the time variable, the time-variant nonlinear sysetm is transformed into the time-variant linear one with respect to the above transformation function. As an application, we synthesize a time-variant nonlinear observer. Numerical experiments are included to demonstrate the validity of...

  • PDF

COMPLEXITY OF THE SCHEDULING LANGUAGE RSV

  • KIM POK-SON;KUTZNER ARNE;PARK TAEHOON
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.181-195
    • /
    • 2006
  • Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

A Term-based Language for Resource-Constrained Project Scheduling and its Complexity Analysis

  • Kutzner, Arne;Kim, Pok-Son
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.20-28
    • /
    • 2012
  • We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

A study on Unifying Hanja Variant Groups of Korea and China for LGR (Label Generation Rule) of Internet Top-Level Hangeul Hanja Domain

  • Kim, Kyongsok
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.7-21
    • /
    • 2018
  • The author studied the process of unifying Hanja variant groups of Korea and China for LGR (Label Generation Rule) of Internet Top-Level Hangeul Hanja Domain and possible confusion between Hangeul syllable and Hanja character. Among 3518 Chinese variant groups, Korea and China need not review variant groups which include no or just one Korean Hanja character. Korea and China reviewed 304 Chinese variant groups (9% of the 3518 Chinese variant groups) which include two or more Korean Hanja characters. By doing so, Korea and China succeeded in efficiently unifying variant groups. Unification process of variant groups which is the main core of Korea-China coordination and almost final unification result is summarized in this paper. In addition, the author analyzed systematically whether some Hanja character could be confused with a Hangeul syllable and obtained a good result which was not expected at the beginning. Probably this kind of systematic analysis has not been performed in the past and seems the first attempt, which is one of the contributions of this paper. The author also reviewed how to express K-LGR in XML for submission to ICANN.

Design and Implementation of GPU Based Time-Variant Volume Rendering Program and User-Friendly Transfer Function Editor (GPU 기반의 Time-Variant 볼륨 렌더링 프로그램과 사용자 친화적인 전이함수 에디터의 설계 및 구현)

  • Lee, Joong-Youn;Hur, Young-Ju;Koo, Gee-Bum
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.1025-1030
    • /
    • 2007
  • 여러 학계와 산업계로부터 인체영상과 같은 정적인 볼륨 데이터뿐만 아니라, 유체 흐름과 같은 동적으로 움직이는 Time-Variant 볼륨 데이터에 대한 실시간 렌더링의 요구가 계속되고 있다. 일반적으로 Time-Variant 데이터는 그 크기가 정적 볼륨 데이터의 수배에서 수백 배에 이르러, 이를 실시간으로 가시화하는 데에 많은 어려움이 있어왔다. 한편, PC 그래픽스 하드웨어의 급격한 발전에 따라 슈퍼컴퓨터나 다수의 컴퓨터들을 이용한 병렬/분산 렌더링으로나 가능했던 Time-Variant 볼륨 데이터의 실시간 볼륨 렌더링을 한대의 일반 PC에서 수행하려는 시도가 계속되고 있다. GPU의 꼭지점 및 프래그먼트 쉐이더(vertex & fragment shader)는 수치 계산에 최적화된 벡터 연산과 사용자 프로그래밍 기능으로 빠른 볼륨 렌더링을 일반 PC에서도 가능하게 했다. 본 논문에서는 GPU를 이용해서 Time-Variant 볼륨 데이터를 빠르게 가시화하고, 이렇게 개발한 GPU 볼륨 렌더링 프로그램을 사용자가 사용하기 편리하도록 사용자 친화적인 유저 인터페이스를 설계하고 구현하였다. 특히, 시간에 따라 동적으로 변화해야 하는 전이함수를 최대한 편리하게 생성할 수 있도록 전이함수 에디터에 중점을 두었다.

  • PDF

A New Approach to Design Variant BOM applying Coordinate Concept (좌표개념을 활용한 Variant BOM 설계의 새로운 접근법)

  • Yu Jin-Seon;Lee Hyeong-Gon;Park Jin-U
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.328-332
    • /
    • 2006
  • 소비자의 요구가 다양해지면서 많은 기업들이 관리해야 할 제품의 종류가 지난 몇 년간 급격히 늘어났다. 이에 한 제품에 대해 다양한 품목군을 유지해야 할 필요성이 제기되었으며, 전통적인 BOM(Bill of Material)으로 다양한 제품을 표현하기에는 막대한 양의 데이터가 발생하여 관리상의 어려움이 생기며, 데이터의 구성에도 중복성의 문제가 발생하게 되는 등의 한계가 드러남에 따라 다양한 제품군을 자체적으로 반영할 수 있는 Variant BOM의 개념 및 설계 방법론이 주목을 받고 있다. Variant BOM은 동일한 제품군에 대해 일부 구성품을 달리하여 구현한 다양한 제품을 반영하는 BOM의 한 종류로서 산업에서의 활용도가 높은 편이나, 여기에도 데이터의 중복성이나 Variant의 정도가 많아지면 관리에 어려움이 생기는 등의 몇 가지 단점을 내포하고 있다. 본 연구에서는 Variant Bill of Material을 대상으로 기존 연구들의 문제점을 분석하고 이를 해결하기 위하여 BOM에 좌표개념을 도입한 새로운 접근법을 제시한다. 이를 통해 BOM의 Structure와 Part를 분리시켰고, Linking Table을 통해 Structure와 Part를 연결하여 기존의 Variant BOM에 있던 문제들을 해결하였다.

  • PDF

RELTSYS: A computer program for life prediction of deteriorating systems

  • Enright, Michael P.;Frangopol, Dan M.
    • Structural Engineering and Mechanics
    • /
    • v.9 no.6
    • /
    • pp.557-568
    • /
    • 2000
  • As time-variant reliability approaches become increasingly used for service life prediction of the aging infrastructure, the demand for computer solution methods continues to increase. Effcient computer techniques have become well established for the reliability analysis of structural systems. Thus far, however, this is largely limited to time-invariant reliability problems. Therefore, the requirements for time-variant reliability prediction of deteriorating structural systems under time-variant loads have remained incomplete. This study presents a computer program for $\underline{REL}$iability of $\underline{T}$ime-Variant $\underline{SYS}$tems, RELTSYS. This program uses a combined technique of adaptive importance sampling, numerical integration, and fault tree analysis to compute time-variant reliabilities of individual components and systems. Time-invariant quantities are generated using Monte Carlo simulation, whereas time-variant quantities are evaluated using numerical integration. Load distribution and post-failure redistribution are considered using fault tree analysis. The strengths and limitations of RELTSYS are presented via a numerical example.

Structural Identification of a Non-Glycosylated Variant at Ser126 for O-Glycosylation Site from EPO BRP, Human Recombinant Erythropoietin by LC/MS Analysis

  • Byeon, Jaehee;Lim, Yu-Ri;Kim, Hyong-Ha;Suh, Jung-Keun
    • Molecules and Cells
    • /
    • v.38 no.6
    • /
    • pp.496-505
    • /
    • 2015
  • A variant peak was detected in the analysis of RP-HPLC of rHu-EPO, which has about 7% relative content. Fractions of the main and the variant peaks were pooled separately and further analyzed to identify the molecular structure of the variant peak. Total mass analysis for each peak fraction using ESI-TOF MS shows differences in molecular mass. The fraction of the main peak tends to result in higher molecular masses than the fraction of the variant. The detected masses for the variant are about 600-1000 Da smaller than those for the main peak. Peptide mapping analysis for each peak fraction using Asp-N and Glu-C shows differences in O-glycopeptide profiles at Ser126. The O-glycopeptides were not detected in the fraction of the variant. It is concluded that the variant peak is non-O-glycosylated rHu-EPO and the main peak is fully O-glycosylated rHu-EPO at Ser126.

Effects of k-Casein Variants on Milk Yield and Composition in Dairy Cattle

  • Chung, Eui-Ryong;Chung, Ku-Young
    • Food Science of Animal Resources
    • /
    • v.25 no.3
    • /
    • pp.328-332
    • /
    • 2005
  • The effect of k-casein (k-CN) variant on milk production traits (milk yield, fat yield, protein yield, fat percentage and protein percentage) was estimated for 568 Holstein cows in the first lactation. The k-CN valiant were determined by PCR-RFLP (restriction fragment length polymorphism) technique at the DNA level. Single trait linear model was used for the statistical analysis of the data. Result of this study indicated that k-CN variant affected significantly milk yield (P<0.05) and protein yield (P<0.01). Animals with the BB variant produced 622kg milk more and had protein yield higher by 32kg compared with animals with the AA variant No associations between the k-CN variants and other milk production trait were found. Therefore, milk and protein yield may be improved through milk protein typing by increasing the frequencies of k-CN B variant in dairy cattle population. In cheese making, it will be also preferable to have milk with the B variant of k-CN, which gives higher yield having a better quality than the A variant milk.