• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.141-147
• /
• 1992

This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6 ${\leq}$ n ${\leq}$ 4). Medium sized random problems (10 ${\leq}$ n ${\leq}$ 30) are also generated and examined. The computational results are compared and discussed for the three heuristics.

• Communications for Statistical Applications and Methods
• /
• v.22 no.5
• /
• pp.507-518
• /
• 2015

It is not easy to select a linear mixed model since the main interest for model building could be different and the number of parameters in the model could not be clearly defined. In this paper, performance of conditional Akaike Information Criteria and its bias-corrected version are compared with marginal Bayesian and Akaike Information Criteria through a simulation study. The results from the simulation study indicate that bias-corrected conditional Akaike Information Criteria shows promising performance when candidate models exclude large models containing the true model, but bias-corrected one prefers over-parametrized models more intensively when a set of candidate models increases. Marginal Bayesian and Akaike Information Criteria also have some difficulty to select the true model when the design for random effects is nested.

• Journal of the military operations research society of Korea
• /
• v.18 no.1
• /
• pp.32-46
• /
• 1992

One of the problems we frequently face during the ROK and US Combined operations is the English Military abbreviations because they often causes a lot of confusion. Many military abbreviations we generated, changed, and disappeared, so it is very hard to figure out their meaning sometimes. This system is designed to make it easier to register, alter, and find out English abbreviations through hypermedia techniques, which is utilizing nonsequential and direct search system similar to human sensory organs. So this enables us to keep up with the latest abbreviations. It is also designed to overcome mutual communications barriers by audio-visual aids through the graphic and phonetic functions of the program, and to test users via a random selection of questions.

• Journal of Ocean Engineering and Technology
• /
• v.27 no.5
• /
• pp.36-42
• /
• 2013

We present the optimum design for the cross-sectional(sizing) and shape optimization of truss structures with natural frequency constraints. The optimum design method used in this paper employs continuous design variables and the Harmony Search Algorithm(HSA). HSA is a meta-heuristic search method for global optimization problems. In this paper, HSA uses the method of random number selection in an update process, along with penalty parameters, to construct the initial harmony memory in order to improve the fitness in the initial and update processes. In examples, 10-bar and 72-bar trusses are optimized for sizing, and 37-bar bridge type truss and 52-bar(like dome) for sizing and shape. Four typical truss optimization examples are employed to demonstrate the availability of HSA for finding the minimum weight optimum truss with multiple natural frequency constraints.

• Journal of the Korean Physical Society
• /
• v.73 no.9
• /
• pp.1219-1224
• /
• 2018

We investigate the evolutionary dynamics and the phase transitions of the island model which consists of subdivided populations of individuals confined to two islands. In the island model, the population is subdivided so that migration acts to determine the evolutionary dynamics along with selection and genetic drift. The individuals are assumed to be haploid and to be one of two species, X or Y. They reproduce according to their fitness values, die at random, and migrate between the islands. The evolutionary dynamics of an individual based model is formulated in terms of a master equation and is approximated by using the diffusion method as the multidimensional Fokker-Planck equation (FPE) and the coupled non-linear stochastic differential equations (SDEs) with multiplicative noise. We analyze the infinite population limit to find the phase transitions from the monomorphic state of one type to the polymorphic state to the monomorphic state of the other type as we vary the ratio of the fitness values in two islands and complete the phase diagram of our island model.

• Journal of information and communication convergence engineering
• /
• v.19 no.3
• /
• pp.136-141
• /
• 2021

Research on wireless sensor networks has focused on the monitoring and characterization of large-scale physical environments and the tracking of various environmental or physical conditions, such as temperature, pressure, and wind speed. We propose a stochastic mobility model that can be applied to a MANET (Mobile Ad-hoc NETwork). environment, and apply this mobility model to a newly proposed clustering-based routing protocol. To verify its stability and durability, we compared the proposed stochastic mobility model with a random model in terms of energy efficiency. The FND (First Node Dead) was measured and compared to verify the performance of the newly designed protocol. In this paper, we describe the proposed mobility model, quantify the changes to the mobile environment, and detail the selection of cluster heads and clusters formed using a fuzzy inference system. After the clusters are configured, the collected data are sent to a base station. Studies on clustering-based routing protocols and stochastic mobility models for MANET applications have shown that these strategies improve the energy efficiency of a network.

• Genomics & Informatics
• /
• v.18 no.4
• /
• pp.41.1-41.8
• /
• 2020

We provide an algorithm for the construction and analysis of autocorrelation (information) functions of gene nucleotide sequences. As a measure of correlation between discrete random variables, we use normalized mutual information. The information functions are indicative of the degree of structuredness of gene sequences. We construct the information functions for selected gene sequences. We find a significant difference between information functions of genes of different types. We hypothesize that the features of information functions of gene nucleotide sequences are related to phenotypes of these genes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.707-710
• /
• 2004

In the case of terrestrial DMB(Digital Multimedia Broadcasting) system that offers mobile multimedia broadcasting services, transmission error must be considered. Although DMB transmission system provides the error protection functions of convolution coding and Reed-Solomon (204,188,t=8) coding, additional error resilience video coding methods are needed to satisfy the requirement of BER lower than $10^{-8}$. In this thesis, we propose and evaluate effective error resilience coding schemes using the MPEG-4 redundant slice for MPEG-4 video services in the DMB environment. In this scheme, we analyze the drift error caused by transmission error based on the random noise concept and the redundant slice selection algorithm that selects the most influential slice in the view of the drift error increment.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.271-287
• /
• 2019

The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.5
• /
• pp.662-665
• /
• 2020

Energy Efficiency in any WSN (Wireless Sensor Network) is a critical issue to elongate the life of the batteries equipped in sensors. LEACH(Low Energy Adaptive Clustering Hierarchy) is one of the mostly used routing algorithms which reduce the amount of transmitted data and save the energy in the network. In this paper, a new technique to select channels in routing algorithms is suggested and compared with the LEACH, ALEACH and PEGASIS. This technique forms clusters depending upon the node density as the deployement of the nodes is random. As a result, the proposed algorithm presents the better performance of the energy efficiency than those of the current algorithms.