• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1973-1979
• /
• 2013

The main purpose of this paper is to give the Wintner theorem in unital complete random normed algebras which is a random generalization of the classical Wintner theorem in Banach algebras. As an application of the Wintner theorem in unital complete random normed algebras, we also obtain that the identity operator on a complete random normed module is not a commutator.

• Korean Journal of Mathematics
• /
• v.16 no.2
• /
• pp.157-163
• /
• 2008

Using informations of subsets of divergence points and the relation between members of spectral classes, we give another complete decomposition of spectral classes generated by lower(upper) local dimensions of a self-similar measure on a self-similar Cantor set with full information of their dimensions. We note that it is a complete refinement of the earlier complete decomposition of the spectral classes. Further we study the packing dimension of some uncountable union of distribution sets.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.33-38
• /
• 2002

We prove that blocked complete dialler crosses using balance incomplete block design are A-, D-, E-optimal design. Also, we provide such blocked complete dialled crosses and their average efficiency with table.

• Communications for Statistical Applications and Methods
• /
• v.9 no.2
• /
• pp.337-346
• /
• 2002

Complete diallel crosses using group divisible design with m=2 or n=2 and ${\lambda}_1$<${\lambda}_2$ as parameter designs become A-optimal, D-optimal designs. In case of ${\lambda}_2$=${\lambda}_1$+1, this blocked complete diallel crosses become generalized optimal designs.

• The Pure and Applied Mathematics
• /
• v.29 no.1
• /
• pp.19-29
• /
• 2022

Information systems and decision rules with imprecision and uncertainty in data analysis are studied in complete residuated lattices. In this paper, we introduce the notions of Alexandrov pretopology (precotopology) and join-meet (meet-join) operators in complete co-residuated lattices. Moreover, their properties and examples are investigated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2865-2870
• /
• 2015

Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.143-146
• /
• 2012

Enforcement of private information preservation law the infringement accident which is still caused by despite with private information outflow occurs. The private information outflow avoids finance and to become the fire tube. Analyzes the pattern of private information from search of private information and detection process and the research which it extracts and the research is necessary in about perfection elimination of the private information which is unnecessary. From the research which it sees it researched a pattern extraction research and a complete elimination method in about private information protection and it did the pattern extraction and a complete elimination experiment of private information.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.387-393
• /
• 2004

DNA computing is technology that applies immense parallel castle of living body molecules into information processing technology, and has used to solve NP-complete problems. However, there are problems which do not look for solutions and take much time when only DNA computing technology solves NP-complete problems. In this paper we proposed an algorithm called ACO(Algorithm for Code Optimization) that can efficiently express DNA sequence and create good codes through composition and separation processes as many as the numbers of reaction by DNA coding method. Also, we applied ACO to Hamiltonian path problem of NP-complete problems. As a result, ACO could express DNA codes of variable lengths more efficiently than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for accurate paths in a short time.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.945-955
• /
• 2004

'Complete-case analysis' is easy to carry out and it may be fine with small amount of missing data. However, this method is not recommended in general because the estimates are usually biased and not efficient. There are numerous alternatives to complete-case analysis. One alternative is the single imputation. Some of the most common single imputation methods are reviewed and the performances are compared by simulation studies.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.1
• /
• pp.95-106
• /
• 2005

Complete-case analysis is easy to carry out and it may be fine with small amount of missing data. However, this method is not recommended in general because the estimates are usually biased and not efficient. There are numerous alternatives to complete-case analysis. A natural alternative procedure is available-case analysis. Available-case analysis uses all cases that contain the variables required for a specific task. The EM algorithm is a general approach for computing maximum likelihood estimates of parameters from incomplete data. These methods and multiple imputation(MI) are reviewed and the performances are compared by simulation studies in monotone missing pattern.