• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.89-96
• /
• 2015

In this paper, time-frequency analysis algorithms, empirical mode decomposition and local mean decomposition, are reviewed and their applications to nonlinear and nonstationary real-world data are discussed. In addition, their generic extensions to complex domain are addressed for the analysis of multichannel data. Simulations of these algorithms on synthetic data illustrate the fundamental structure of the algorithms and how they are designed for the analysis of nonlinear and nonstationary data. Applications of the complex version of the algorithms to the synthetic data also demonstrate the benefit of the algorithms for the accurate frequency decomposition of multichannel data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.144-147
• /
• 2001

In ATM Network, many algorithms have been proposed for rate-based ABR flow control. The object of these algorithms is to turn around from cell loss and to use the unused bandwidth by ABR Traffic. These Algorithms are applied to control ABR Traffic by EFCI and ER switches. In this paper, we apply these algorithms to the various stale networks and analysis the characteristics of the algorithms and then attempt to show the loss rate of each algorithms. As the result we compare and analysis the efficiency of them.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.109-118
• /
• 2023

Energy awareness is an essential design flaw in wireless sensor network. Clustering is the most highly regarded energy-efficient technique that offers various benefits such as energy efficiency and network lifetime. Clusters create hierarchical WSNs that introduce the efficient use of limited sensor node resources and thus enhance the life of the network. The goal of this paper is to provide an analysis of the various energy efficient clustering algorithms. Analysis is based on the energy efficiency and network lifetime. This review paper provides an analysis of different energy-efficient clustering algorithms for WSNs.

• 한국정보교육학회:학술대회논문집
• /
• 2004.08a
• /
• pp.236-241
• /
• 2004

Algorithms is defined "step-by-step procedure for accomplishing a task that we wish to complete." Algorithms has much educational values. Already many scholar is making researches about paper-and-pencil algorithms in mathematic education. The purpose of this paper is to propose a study on the direction of teaching algorithms with analysis of algorithms

• ETRI Journal
• /
• v.38 no.3
• /
• pp.540-550
• /
• 2016

Spectral clustering is a powerful tool for exploratory data analysis. Many existing spectral clustering algorithms typically measure the similarity by using a Gaussian kernel function or an undirected k-nearest neighbor (kNN) graph, which cannot reveal the real clusters when the data are not well separated. In this paper, to improve the spectral clustering, we consider a robust similarity measure based on the shared nearest neighbors in a directed kNN graph. We propose two novel algorithms for spectral clustering: one based on the number of shared nearest neighbors, and one based on their closeness. The proposed algorithms are able to explore the underlying similarity relationships between data points, and are robust to datasets that are not well separated. Moreover, the proposed algorithms have only one parameter, k. We evaluated the proposed algorithms using synthetic and real-world datasets. The experimental results demonstrate that the proposed algorithms not only achieve a good level of performance, they also outperform the traditional spectral clustering algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.4
• /
• pp.99-114
• /
• 2002

Improved algorithms for elliptic scalar multiplication secure against side-channel attacks, such as timing and power analysis, are presented and analyzed. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple $\pm$1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. More specifically, we propose concrete signed binary and window algorithms based on the proposed $\pm$ 1-signed encoding and analyze their security and performance. The proposed algorithms are shown to be more robust and efficient than previous algorithms.

• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.204-209
• /
• 2023

Dynamic Bandwidth Allocation (DBA) methods in telecommunication network & systems have emerged with mechanisms for sharing limited resources in a rapidly growing number of users in today's access networks. Since the DBA research trends are incredibly fast-changing literature where almost every day new areas and terms continue to emerge. Co - citation analysis offers a significant support to researchers to distinguish intellectual bases and potentially leading edges of a specific field. We present the visualization based analysis for DBA algorithms in telecommunication field using mainstream co-citation analysis tool-CiteSpace and web of science (WoS) analysis. Research records for the period of decade (2009-2018) for this analysis are sought from WoS. The visualization results identify the most influential DBA algorithms research studies, journals, major countries, institutions, and researchers, and indicate the intellectual bases and focus entirely on DBA algorithms in the literature, offering guidance to interested researchers on more study of DBA algorithms.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.2199-2200
• /
• 2006

Reliable frequency estimation is important for active power control, load shedding and generator protection. Thereby, frequency estimation is researched and some algorithms is proposed. This paper analyzed strength and weakness of each algorithms through comparative analysis of frequency estimation. Used algorithms are Zero Crossing detection, Discrete Fourier Transformation, Least Error Squares.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.567-568
• /
• 2006

Reliable frequency estimation is important for active power control, load shedding and generator protection. Thereby, frequency estimation is researched and some algorithms is proposed. This paper analyzed strength and weakness of each algorithms through comparative analysis of frequency estimation. Used algorithms are Zero Crossing detection, Discrete Fourier Transformation, Least Error Squares.

• Proceedings of the KIEE Conference
• /
• 2006.07b
• /
• pp.1233-1234
• /
• 2006

Reliable frequency estimation is important for active power control, load shedding and generator protection. Thereby, frequency estimation is researched and some algorithms is proposed. This paper analyzed strength and weakness of each algorithms through comparative analysis of frequency estimation. Used algorithms are Zero Crossing detection, Discrete Fourier Transformation, Least Error Squares.