• Journal of the Korean Statistical Society
• /
• v.36 no.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.

• International Commerce and Information Review
• /
• v.12 no.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.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8C
• /
• pp.765-770
• /
• 2003

In this paper, the complete weight enumerator of the Delsarte-Goethals code over Z$_4$ is obtained. This code is divided into 3 cases and the complete weight enumerator of each case is calculated. During this weight enumeration, the blown distribution of exponential sums and binary weight distribution of the sub-codes are used. By combining this result and MacWilliams identity, the complete weight enumerator of the Goethals code over Z$_4$can be easily obtained. This result is also used for finding 3-designs from the Goethals and Delsarte-Goethals codes over Z$_4$.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.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
• /
• v.11 no.2
• /
• pp.247-255
• /
• 2000

Usually, partailly balanced incomplete block design have been used a parametric design that make blocks of complete diallel cross. For that we use triangular PBIBD as parametric design, we have to find triangular PBIBD with corresponding parameters. Using the theorem that dual design of balanced incomplete block design with special parameters becomes triangular PBIBD, we can design block complete diallel cross without finding new triangular PBIBD. In this paper, we provided the plan and design satisfying such block complete diallel crosses.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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
• /
• v.18 no.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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• 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.