• Journal of the Semiconductor & Display Technology
• /
• v.21 no.1
• /
• pp.85-90
• /
• 2022

In this paper, an asynchronous nonvolatile memory module using a self-diagnosis function was designed. For the system to work, a lot of data must be input/output, and memory that can be stored is required. The volatile memory is fast, but data is erased without power, and the nonvolatile memory is slow, but data can be stored semi-permanently without power. The non-volatile static random-access memory is designed to solve these memory problems. However, the non-volatile static random-access memory is weak external noise or electrical shock, data can be some error. To solve these data errors, self-diagnosis algorithms were applied to non-volatile static random-access memory using error correction code, cyclic redundancy check 32 and data check sum to increase the reliability and accuracy of data retention. In addition, the possibility of application to an asynchronous non-volatile storage system requiring reliability was suggested.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.605-618
• /
• 2018

The main goal of this paper is to study an extension of random summations of independent and identically distributed random variables when the number of summands in random summation is a partial sum of n independent, identically distributed, non-negative integer-valued random variables. Some characterizations of random summations are considered. The central limit theorems and weak law of large numbers for extended random summations are established. Some weak limit theorems related to geometric random sums, binomial random sums and negative-binomial random sums are also investigated as asymptotic behaviors of extended random summations.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.795-805
• /
• 2008

The aim of this paper is to extend the "classical degenerate convergence criterion" and the Feller weak law of large numbers to double adapted arrays of random variables.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.852-856
• /
• 2004

The present paper establishes a necessary and sufficient condition for weak convergence for weighted sums of compactly uniformly integrable level-continuous fuzzy random variables as a generalization of weak laws of large numbers for sums of fuzzy random variables.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.209-213
• /
• 2002

We study maximal second moment inequality and derive complete convergence for weighted sums of asymptotically almost negatively associated(AANA) random variables by applying this inequality. 2000 Mathematics Subject Classification : 60F05

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.18-21
• /
• 2003

We propose some properties of fuzzy conditional expectation of hybrid number the addition of fuzzy number and random variable using Cartesian product distance for ${\alpha}$-level sets.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.33-36
• /
• 1997

We prove a uniform strong law of large numbers for sequences of fuzzy random variables.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.287-298
• /
• 2004

In this paper we derive complete convergences for weighted sums of asymptotically almost negatively associated random variables.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.9-14
• /
• 2022

This paper presents a subset sum problem (SSP) algorithm which takes the time complexity of O(nlogn). The SSP can be classified into either super-increasing sequence or random sequence depending on the element of Set S. Additive algorithm that runs in O(nlogn) has already been proposed to and utilized for the super-increasing sequence SSP, but exhaustive Brute-Force method with time complexity of O(n2ⁿ) remains as the only viable algorithm for the random sequence SSP, which is thus considered NP-complete. The proposed subtractive algorithm basically selects a subset S comprised of values lower than target value t, then sets the subset sum less the target value as the Residual r, only to remove from S the maximum value among those lower than t. When tested on various super-increasing and random sequence SSPs, the algorithm has obtained optimal solutions running less than the cardinality of S. It can therefore be used as a general algorithm for the SSP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.