• Journal of the Korean Statistical Society
• /
• 제36권3호
• /
• pp.435-445
• /
• 2007

This paper addresses for the first time the use of complete data information criteria in unsupervised learning of the Naive-Bayes model. A Monte Carlo study sets a large experimental design to assess these criteria, unusual in the Bayesian network literature. The simulation results show that complete data information criteria underperforms the Bayesian information criterion (BIC) for these Bayesian networks.

• 통상정보연구
• /
• 제12권4호
• /
• pp.49-65
• /
• 2010

We have analyzed the trade effect of Korea-EU FTA on the Korean fishery sector, after reviewing the trade pattern and the tariff barriers of fishery sector between Korea-EU. For the trade effects, we have categorized into three cases: 1) the complete tariff elimination of all items, 2) the half tariff reduction on top ten valued items, with complete tariff elimination of other items, and 3) the complete tariff elimination, except unbinding top three valued items. The effect of the complete tariff elimination of all items implies the effect of the full achievement of FTA. For other two cases, these effects imply the effects of the transitional phenomenon of FTA since the complete tariff elimination happens gradually over more than ten years. For the complete elimination of tariff, we found that imports are increased by 1.1 billion dollars which is 12.9% increase in average imports during years 2006-2009. Also, exports are increased by 1.3 billion dollars which is 14.5% increase in average exports during same years.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.289-292
• /
• 1998

Trees are the underlying structure for divide-and-conquer algorithms and the graphs that provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among trees. Therefore, if complete binary trees can be embedded in binomial trees, the algorithms which are provided by complete binary trees can be performed efficiently on the interconnection networks which have binomial trees as their subgraphs or in which binomial trees can be embedded easily. In this paper, we present dilation 2 embedding of complete binary trees in binomial trees.

• 한국통신학회논문지
• /
• 제28권8C호
• /
• pp.765-770
• /
• 2003

이 논문에서 Z$_4$상에서 정의된 Delsarte-Goethals 부호의 완전 무게 분포를 구하였다. 이 부호의 부호어를 3가지 경우로 나눠서 각각의 완전 무게 분포를 구하였으며, 이때 이미 알려진 이 부호의 부분 부호의 지수합 분포 및 이진 무게 분포를 이용하였다. 이 결과와 MacWilliams 항등식을 이용하여 Z$_4$상에서 정의된 Goethals 부호의 완전 무게 분포를 쉽게 구할 수 있다. 또한 이 결과는 Goethals 부호와 Delsarte-Goethals 부호에서 3-design을 찾는데 이용되었다.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.993-1002
• /
• 2004

Imputation procedures such as fully efficient fractional imputation(FEFI) or multiple imputation(MI) can be used to construct complete contingency tables from samples with partially classified responses. Variances of FEFI estimators of population proportions are derived. Simulation results, when data are missing completely at random, reveal that FEFI provides more efficient estimates of population than either multiple imputation(MI) based on data augmentation or complete case analysis, but neither FEFI nor MI provides an improvement over complete-case(CC) analysis with respect to accuracy of estimation of some parameters for association between two variables like $\theta_{i+}\theta_{+i}-\theta_{ij}$ and log odds-ratio.

• Journal of the Korean Data and Information Science Society
• /
• 제11권2호
• /
• pp.247-255
• /
• 2000

완전이면교배를 블록화하는 매개디자인으로는 일반적으로 부분적으로 균형된 불완비 블록계획을 사용한다. 이때 블록화하는 매개디자인으로 삼각형 PBIBD를 사용하기 위해서는 대응되는 모수를 갖는 삼각형 PBIBD를 찾아야 한다. 특정한 모수를 갖는 균형된 불완비 블록계획의 쌍대계획이 삼각형 PBIBD가 되는 성질을 이용하면 삼각형 PBIBD를 새로 찾아야 하는 번거로움 없이 블록 완전이면교배를 설계할 수 있다. 이를 만족하는 블록 완전이면교배를 설계하는 방법과 디자인을 제시하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3733-3755
• /
• 2019

E-cash has its merits comparing with other payment modes. However, there are two problems, which are how to achieve practical/complete tracing and how to achieve it in compact E-cash. First, the bank and the TTP (i.e., trusted third party) have different duties and powers in the reality. Therefore, double-spending tracing is bank's task, while unconditional tracing is TTP's task. In addition, it is desirable to provide lost-coin tracing before they are spent by anyone else. Second, compact E-cash is an efficient scheme, but tracing the coins from double-spender without TTP results in poor efficiency. To solve the problems, we present a compact E-cash scheme. For this purpose, we design an embedded structure of knowledge proof based on a new pseudorandom function and improve the computation complexity from O(k) to O(1). Double-spending tracing needs leaking dishonest users' secret knowledge, but preserving the anonymity of honest users needs zero-knowledge property, and our special knowledge proof achieves it with complete proofs. Moreover, the design is also useful for other applications, where both keeping zero-knowledge and leaking information are necessary.

• Journal of the Korean Data and Information Science Society
• /
• 제18권1호
• /
• pp.185-194
• /
• 2007

The information of covariates are available to do fully efficient fractional imputation(FEFI). The new method, FEFI with logistic regression is proposed to construct complete contingency tables. Jackknife method is used to get a standard errors of log-odds ratio from the completed table by the new method. Simulation results, when covariates have more information about categorical variables, reveal that the new method provides more efficient estimates of log-odds ratio than either multiple imputation(MI) based on data augmentation or complete case analysis.

• 정보보호학회논문지
• /
• 제14권2호
• /
• pp.57-68
• /
• 2004

본 논문에서는 UOWHF의 도메인을 확장하기 위한 새로운 병렬 처리 알고리즘을 제안한다. 제시되는 알고리즘은 non-complete l-ary tree 에 기반을 두고 있으며 현재까지 최적의 키 길이를 가진 유일한 알고리즘인 Shoup 의 알고리즘과 동일한 최적의 키 길이를 가진다. 또한 Sarkar의 결과를 이용하여 본 논문에서 제시되는 알고리즘이 Shoup의 알고리즘과 함께 Sarkar가 제시한 도메인 확장 알고리즘들의 커다란 집합 중에서 가장 최적화된 키 길이를 가짐을 증명한다. 그러나 제안 알고리즘의 병렬처리능력은 complete tree에 기반 한 구성 방법들 보다 약간 비효율적이다. 그러나 만약 l이 점점 커진다면 알고리즘의 병렬처리능력도 complete tree 에 기반 한 방법들에 가까워진다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.