• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.533-540
• /
• 2006

This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

• Asian-Australasian Journal of Animal Sciences
• /
• v.30 no.2
• /
• pp.149-153
• /
• 2017

Objective: This study was to determine the relationship between estimated breeding value and phenotype information after farrowing when juvenile selection was made in candidate pigs without phenotype information. Methods: After collecting phenotypic and genomic information for the total number of piglets born by Landrace pigs, selection accuracy between genomic breeding value estimates using genomic information and breeding value estimates of best linear unbiased prediction (BLUP) using conventional pedigree information were compared. Results: Genetic standard deviation (${\sigma}_a$) for the total number of piglets born was 0.91. Since the total number of piglets born for candidate pigs was unknown, the accuracy of the breeding value estimated from pedigree information was 0.080. When genomic information was used, the accuracy of the breeding value was 0.216. Assuming that the replacement rate of sows per year is 100% and generation interval is 1 year, genetic gain per year is 0.346 head when genomic information is used. It is 0.128 when BLUP is used. Conclusion: Genetic gain estimated from single step best linear unbiased prediction (ssBLUP) method is by 2.7 times higher than that the one estimated from BLUP method, i.e., 270% more improvement in efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1092-1099
• /
• 2006

Future wireless communication systems will employ spatial multiplexing with multiple antennas at both transmitter and receiver to take advantage of larger capacity gains as compared to the systems that use a single antenna. However, in order to reduce higher hardware costs and computational burden, it will require an efficient transmit-receive antenna selection algorithm, which we propose in this paper. Through simulation and comparative analysis of various existing methods and the one we propose in this paper, the algorithm we propose was validated as nearer to the optimal selection technique than existing nearly optimal antenna selection schemes.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.162-171
• /
• 2015

This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.1
• /
• pp.11-22
• /
• 2023

In this paper, we propose an efficient satellite selection method for multi-constellation GNSS. The number of visible satellites has increased dramatically recently due to multi-constellation GNSS. By the increased availability, the overall GNSS performance can be improved. Whereas, due to the increase of the number of visible satellites, the computational burden in implementing advanced processing such as integer ambiguity resolution and fault detection can be increased considerably. As widely known, the optimal satellite selection method requires very large computational burden and its real-time implementation is practically impossible. To reduce computational burden, several sub-optimal but efficient satellite selection methods have been proposed recently. However, these methods are prone to the local optimum problem and do not fully utilize the information redundancy between different constellation systems. To solve this problem, the proposed method utilizes the inter-system biases and geometric assignments. As a result, the proposed method can be implemented in real-time, avoids the local optimum problem, and does not exclude any single-satellite constellation. The performance of the proposed method is compared with the optimal method and two popular sub-optimal methods by a simulation and an experiment.

• Genomics & Informatics
• /
• v.21 no.3
• /
• pp.28.1-28.13
• /
• 2023

Mild cognitive impairment (MCI) is a clinical syndrome characterized by the onset and evolution of cognitive impairments, often considered a transitional stage to Alzheimer's disease (AD). The genetic traits of MCI patients who experience a rapid progression to AD can enhance early diagnosis capabilities and facilitate drug discovery for AD. While a genome-wide association study (GWAS) is a standard tool for identifying single nucleotide polymorphisms (SNPs) related to a disease, it fails to detect SNPs with small effect sizes due to stringent control for multiple testing. Additionally, the method does not consider the group structures of SNPs, such as genes or linkage disequilibrium blocks, which can provide valuable insights into the genetic architecture. To address the limitations, we propose a Bayesian bi-level variable selection method that detects SNPs associated with time of conversion from MCI to AD. Our approach integrates group inclusion indicators into an accelerated failure time model to identify important SNP groups. Additionally, we employ data augmentation techniques to impute censored time values using a predictive posterior. We adapt Dirichlet-Laplace shrinkage priors to incorporate the group structure for SNP-level variable selection. In the simulation study, our method outperformed other competing methods regarding variable selection. The analysis of Alzheimer's Disease Neuroimaging Initiative (ADNI) data revealed several genes directly or indirectly related to AD, whereas a classical GWAS did not identify any significant SNPs.

• Journal of Korean Society for Quality Management
• /
• v.13 no.2
• /
• pp.29-36
• /
• 1985

The problem of selecting the gamma population with the largest mean out of k gamma populations, each of which has the same shape parameter is considered. An elimination type two-stage procedure is proposed which guarantees the same probability requirement using the indifference-zone approach as does the single-stage procedure of Gibbons, Olkin and Sobel (1977). The two-stage procedure has the highly desirable property that the expected total number of observations required by the procedure is always less than that of the corresponding single-stage procedure regardless of the configuration of the population parameters.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.597-602
• /
• 1987

In this paper, an adaptive observe based upon the exponentially weighted least-squares method is implemented in the design of a model reference adaptive controller for an unknown time-invariant discrete single-input single-output linear plant. A method of selecting the state variable filter is proposed. In this scheme, all the past data are weithted exponentially with the weighting coefficient.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.156-159
• /
• 1986

In this paper, we discribed characteristics of two buffer which are limited area in packet communication networks, we selected JSQ(Join the Shortest Queue) method for buffrt management and compared it with single, random methods. The blocking probabilities of massage using JSQ method is decreased about (2.5 times) in compared with that of single queue method and (0.5 times) in random selection method. This results could be used in designing packet switching communication networks.