• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.274-277
• /
• 2000

Linear discriminant analysis (LDA) is a basic tool of pattern recognition, and it is used in extensive fields, e.g. face identification. However, LDA is poor at adaptability since it is a batch type algorithm. To overcome this, a new algorithm of online LDA is proposed in the present paper. It is experimentally shown that the new algorithm is about two times faster than the previously proposed algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.385-386
• /
• 2020

In this paper, we propose a collaborative filtering recommendation algorithm based on the LDA2Vec topic model. By extracting and analyzing the article's content, calculate their semantic similarity then combine the traditional collaborative filtering algorithm to recommend. This approach may promote the system's recommend accuracy.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.387-388
• /
• 2020

As the utilization of microservice architectural style in diverse applications are increasing, the microservice deployment cost became a concern for many companies. We propose an approach to reduce the deployment cost by generating an algorithm which minimizes the cost of basic operation of a physical machine and the cost of resources assigned to a physical machine. This algorithm will produce optimal resource allocation and deployment location based on genetic algorithm process.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.235-240
• /
• 2009

This paper combines various detection techniques and analyzes their performances in detecting the transmission information of the D-STTD scheme that uses, in parallel, the STTD scheme known as the Alamouti code. The D-STTD scheme adopts one of the STTD schemes for transmission to acquire diverse effects and uses another form of STTD for multiplexing effects. Due to the multiplexing effect that transmits different data, it is difficult to apply D-STTD to the conventional STTD combining technique. This paper combines the D-STTD system with linear algorithm, SIC algorithm and OSIC algorithm known as multiplexing detection scheme based on MMSE scheme. And we propose the detection scheme of the D-STTD using MAP algorithm and analyze the performance of each system. The simulation results showed that the detector using iterative algorithm has better performance than Linear MMSE Detector. Especially, we can show that the detector using MAP algorithm outperforms conventional detector.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.16-25
• /
• 2005

In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.51-60
• /
• 2016

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.457-460
• /
• 1989

In this paper, an improvement of the EBP(error back propagation) learning speed using an acceleration algorithm is described. Using an acceleration algorithm known as the Partan method in the gradient search algorithm, learning speed is 25% faster than the original EBP algorithm in the simulaion results.

• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.45-50
• /
• 1988

Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.317-320
• /
• 2004

The exponential back-off algorithm doubles the back-off size after each collision without considering network traffic status, which causes degradation of system performance. In this paper, we propose a linear random back-off mechanism which dynamically selects the back-off window size based on the channel status which includes the number of active stations and collisions to significantly increase the protocol capacity. We present an analytical model for the saturated throughput of our linear random back-off algorithm. Simulation results show that performance can be substantially enhanced if binary exponential back-off algorithm is replaced by a linear back- off algorithm.