• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.830-839
• /
• 2009

In this paper, we address a near maximum likelihood (ML) scheme for the decoding of multiple input multiple output systems. Based on the metric-first search method and by employing Schnorr-Euchner enumeration and branch length thresholds, the proposed scheme provides reduced computational complexity. The proposed scheme is shown by simulation to have lower computational complexity than other near ML decoders while maintaining the bit error rate close to the ML performance.

• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.11-17
• /
• 2013

In this paper, the information security requirements in the mobile ad-hoc network(MANET) are presented, and the algorithm to establish the protection node(gateway) is proposed to prevent the distributed denial of service(DDoS). The information security technology and security threats in the MANET are presented, and protection node is decided to minimize the total cost through the sending nodes and receiving nodes by way of protection node. To set up the protection node, the minimization algorithms of maximum cost and the average cost between the protection node and receiving nodes are compared with the optimal solutions, in which optimal solution is found out by all enumeration method. From the results, the total cost between the sending and receiving nodes is minimized under the average cost minimization algorithm rather than the using of the maximum cost.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2003.11a
• /
• pp.581-584
• /
• 2003

It is important to know phase offsets of PN (Pseudo Noise) sequences in spread spectrum communications since the acquisition is equivalent to make a phase offset between a receiving PN sequence and a PN sequence of local PN generator be identical. In this paper, a phase offset enumeration method for PN sequences with error detection, and its application to the synchronization are proposed. The phase offset enumeration far an n-tuple PN sequence and its error detection are performed when one period of the sequence is received. Once the phase offset of the receiving sequence is calculated, we can easily accomplish the synchronization by initializing shift registers of a local PN generator according to the phase offset value. The mean acquisition time of the proposed synchronization method is derived analytically, and we see that the method acquires very fast acquisition in the high SNR (Signal-to- Noise Ratio) environment.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.353-375
• /
• 2006

In this paper we establish a counting method for the Green classes of the Birget-rhodes expansion of finite groups. As an application of the results, we derive explicit enumeration formulas for the Green classes for finite groups of order pq and a finite cyclic group of order $p^m$, where p and q are arbitrary given distinct prime numbers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.4 no.4
• /
• pp.1-13
• /
• 1981

This paper analyses the efficiency of performance measures from the point of total cost on the accuracy of due date around various measures of performance be in mainly use in the flow shop scheduling theory. For this purpose, complete enumeration method for small problems seems to be the only possible means of evaluation and analysis. Using of the above technique, calculates the 800 Scheduling Problems, and represents it by the cumulative distributions.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1281-1289
• /
• 2016

Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1595-1604
• /
• 2017

We give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i$, j, k, $l{\leq}n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.29-37
• /
• 1985

This paper studies a production-inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system. The integrated production-inventory model is formulated wth a nonlinear mixed integer programming problem. An algorithm is developed by utilizing the finite explicit enumeration method. The algorithm guarantees to generate an optimal policy for minimizing the total annual variable cost. A mumerical example involving 15 raw materials is given to illustrate the recommended solution procedure.

• Proceedings of the Korean Society for Applied Microbiology Conference
• /
• 2005.06a
• /
• pp.319-322
• /
• 2005

• International Journal of Reliability and Applications
• /
• v.4 no.1
• /
• pp.13-26
• /
• 2003

This paper presents a comparative study of a few commonly used maintenance scheduling methods for small utilities that consists solely of thermal generating plants. Two deterministic methods and a stochastic method are examined. The deterministic methods employ the leveling of reserve capacity criterion, of which one uses a heuristic rule to level the deterministic equivalent load obtained by using the product of the unit capacity and its corresponding forced outage rate. The stochastic method simulates the leveling of risk criterion by using the peak load carry capacity of available units. The results indicate that for the size and type of the maintenance scheduling problem described In this study, the stochastic method does not produce a schedule which is significantly better than the deterministic methods.