• BMB Reports
• /
• v.44 no.4
• /
• pp.250-255
• /
• 2011

In multicellular organisms, including humans, understanding expression specificity at the tissue level is essential for interpreting protein function, such as tissue differentiation. We developed a prediction approach via generated sequence features from overrepresented patterns in housekeeping (HK) and tissue-specific (TS) genes to classify TS expression in humans. Using TS domains and transcriptional factor binding sites (TFBSs), sequence characteristics were used as indices of expressed tissues in a Random Forest algorithm by scoring exclusive patterns considering the biological intuition; TFBSs regulate gene expression, and the domains reflect the functional specificity of a TS gene. Our proposed approach displayed better performance than previous attempts and was validated using computational and experimental methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.2
• /
• pp.33-44
• /
• 1986

This research is concerned with group scheduling problems in multi-stage manufacturing system with dependent setup time. The objective of the research is to develop and evaluate a heuristic algorithm for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems with sequence dependent group setup time. The group scheduling heuristic algorithm is developed and evaluated by comparisons with twenty-seven problems with the known optimum solutions and 144,000 random schedules of a large variety problems. The results indicate that the proposed heuristic algorithm gets the same optimum solutions for the problems and also provides the good solutions in comparison with the random schedules of the large variety problems. A numerical example is given to illustrate the heuristic algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.295-303
• /
• 1997

Let ${X_k : k = 1, 2, \cdots}$ be a sequence of independent, identically distributed integer-valued random variables with common distribution function F.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.551-558
• /
• 2006

We establish a weak law of large numbers for sequence of random elements with values in p-uniformly smooth Banach space. Our result is more general and stronger than some well-known ones.

• Communications for Statistical Applications and Methods
• /
• v.4 no.3
• /
• pp.859-862
• /
• 1997

In this paper a general result on almost sure properties is proved for a sequence of exchangeable random variables. Some known results follow from the theorem as special cases.

• Honam Mathematical Journal
• /
• v.33 no.3
• /
• pp.393-405
• /
• 2011

In this paper we obtain the complete moment convergence for an array of rowwise extended negative orthant dependent random variables. By using the result we can prove the complete moment convergence for some positively orthant dependent sequence satisfying the extended negative orthant dependence.

• Journal of the Korean Statistical Society
• /
• v.25 no.3
• /
• pp.303-311
• /
• 1996

We consider the discrete time randomly perturbed systems on sep-arable Banach space given by $X_{n+1};=;{Gamma}_{n+1}(X_n);+;{epsilon}_{n+1}$ where {${Gamma}_n$} is a sequence of random functions and {${epsilon}_n$} is a sequence of disturbances Sufficient conditions for non-ergodicity of {$X_n$} are obtained.

• Journal of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.45-55
• /
• 2016

Let {$X_n,n{\geq}1$} be a sequence of negatively superadditive dependent random variables. In the paper, we study the strong law of large numbers for general weighted sums ${\frac{1}{g(n)}}{\sum_{i=1}^{n}}{\frac{X_i}{h(i)}}$ of negatively superadditive dependent random variables with non-identical distribution. Some sufficient conditions for the strong law of large numbers are provided. As applications, the Kolmogorov strong law of large numbers and Marcinkiewicz-Zygmund strong law of large numbers for negatively superadditive dependent random variables are obtained. Our results generalize the corresponding ones for independent random variables and negatively associated random variables.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3152-3165
• /
• 2012

Wireless sensor networks (WSN) often employ asynchronous MAC scheduling, which allows each sensor node to wake up independently without synchronizing with its neighbor nodes. However, this asynchronous scheduling may not deal with collisions due to hidden terminals effectively. Although most of the existing asynchronous protocols exploit a random back-off technique to resolve collisions, the random back-off cannot secure a receiver from potentially repetitive collisions and may lead to a substantial increase in the packet latency. In this paper, we propose a new collision resolution algorithm called Transient Coordinator (TC) for asynchronous WSN MAC protocols. TC resolves a collision on demand by ordering senders' transmissions when a receiver detects a collision. To coordinate the transmission sequence both the receiver and the collided senders perform handshaking to collect the information and to derive a collision-free transmission sequence, which enables each sender to exclusively access the channel. According to the simulation results, our scheme can improve the average per-node throughput by up to 19.4% while it also reduces unnecessary energy consumption due to repetitive collisions by as much as 91.1% compared to the conventional asynchronous MAC protocols. This demonstrates that TC is more efficient in terms of performance, resource utilization, and energy compared to the random back-off scheme in dealing with collisions for asynchronous WSN MAC scheduling.

• Journal of the Korean Mathematical Society
• /
• v.42 no.5
• /
• pp.949-957
• /
• 2005

For weighted sum of a sequence {X, X$\_{n}$, n $\geq$ 1} of identically distributed, negatively orthant dependent random variables such that |r| > 0, has a finite moment generating function, a strong law of large numbers is established.