• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.75-82
• /
• 2015

Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $O(n^4)$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $O(n^2)$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with ${\kappa}-opt({\kappa}=2,3)$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.290-298
• /
• 1994

In this paper we propose parallel sorting algorithm, taking 0( $n^{n}$ log n) time complexity, 0( $n^{x}$ log n) cost (parallel running time * number of processors) and 0( $n^{1-}$x＋ $n^{x}$ )data movement complexity under the ERWW- PRAM model. The methods for solving these problems similar. Parallel algorithm finds pivot for partitioning the data into ordered subsets of approximately equal size by using encording pointers..

• Asia pacific journal of information systems
• /
• v.15 no.3
• /
• pp.41-64
• /
• 2005

The effects of information quality and the importance of information have been reported in the information Systems(IS) literature. However, little has been learned about the impact of data quality(DQ) on decision performance. Recognizing with this problem, this study explores the effects of contextual DQ on decision performance. To examine them, a laboratory experiment was conducted. Based on two levels of contextual DQ and two levels of task complexity, this study had a $2{\times}2$ factorial design. The dependent variables used to measure the outcomes of decision performance were problem-solving accuracy and time. The results demonstrated that the effects of contextual DQ on decision performance were significant. The findings suggest that decision makers can expect to improve their decision performance by enhancing contextual DQ. This research not only extends a body of research examining the effects of factors that can be tied to human decision-making performance, but also provides empirical evidence to validate and extend DeLone and McLean's IS success model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.9
• /
• pp.1241-1244
• /
• 2020

In this paper, we consider a downlink non-orthogonal multiple access system with a base station and N mobile stations, where we assume that instantaneous channel state information (CSI) is available at the base station. A power allocation scheme is proposed to achieve perfect fairness, which means equal data rates for all mobile stations. However, the power allocation scheme using full CSI requires high complexity. Hence, a simple power allocation scheme with low complexity is proposed by using high signal-to-noise power ratio (SNR) approximation. The simple power allocation scheme can achieve perfect fairness only for high SNR. However, it needs only the best CSI and the simple procedure to obtain power allocation coefficients. From simulation results, we show that the simple power allocation scheme provides remarkable fairness performance at high SNR.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.65-73
• /
• 1997

This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.101-117
• /
• 2024

The purpose of this study is to consider the characteristics perceived by users who utilize MyData services in the financial sector. It aims to examine how these factors influence users' understanding for sustained usage and their resistance to innovation. The research seeks to explore the relationship between users' awareness of characteristics and its impact on both enhancing comprehension for continued usage and addressing users' resistance to innovation. Utilizing a specialized survey agency, we examined the relative effects of innovation resistance factors, such as relative advantage, perceived risks, complexity, clarity and perceived ease of use on MyData service users. Furthermore, this research focuses on employing empirical analysis to validate the relationships between these factors through the survey. The findings of this study suggest that MyData service should dedicate ongoing efforts to minimize user resistance to service utilization. Specifically, it was revealed that among the innovation resistance factors, perceived ease of use, relative advantage, perceived risk, and complexity exert influence in that order.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.155-158
• /
• 1998

IMBE(Improved Multi-Band Excitation) vocoders exhibit good performance at low data rates. The major drawback to IMBE coders is their large computational requirements. In this paper, thus, we propose a new pitch search method that preserves the quality of the IMBE vocoder with reduced complexity. The basic idea is to reduce computation complexity of the pitch searching by using the SAMDF. Applying the proposed method to the IMBE vocoder, we can get approximately 52.02% searching time reduction in the pitch search. There is no difference in voice quality between conventional IMBE and proposed IMBE.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.39-45
• /
• 1999

In this paper we will look at its cryptographic analysis for digital signature and compare it with other complexity measures such as discrete logarithm problem and factorization problem which are based on the security. The paper especially tries to computational complexity so that it can compare and checks the performance analysis, comparison of data size and processing speed through the simulation me

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1899-1902
• /
• 2003

Recently several methods have been developed for the virtual space construction. Generally, most of the methods are geometric-based rendering technic, but they are difficult to construct real-time rendering because of large data. In this paper, we present a three dimension image-based rendering method that enable a constant speed of real-time rendering regardless of object complexity in virtual space. The Proposed method shows good performance for the virtual space construction with high complexity.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.