• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.55-65
• /
• 1995

Existing multiple-row downdating algorithms have adopted a CFD(Cholesky Factor Downdating) that recursively downdates one row at a time. The CFD based algorithm requires 5/2p $n^{2}$ flops(floating point operations) downdating a p$\times$n observation matrix $Z^{T}$ . On the other hands, a HCFD(Hybrid CFD) based algorithm we propose in this paper, requires p $n^{2}$＋6/5 $n^{3}$ flops v hen p$\geq$n. Such a HCFD based algorithm factorizes $Z^{T}$ at first, such that $Z^{T}$ = $Q_{z}$ RT/Z, and then applies the CFD onto the upper triangular matrix Rt/z, so that the total number of floating point operations for downdating $Z^{T}$ would be significantly reduced compared with that of the CFD based algorithm. Benchmark tests on the Sun SPARC/2 and the Tolerant System also show that performance of the HCFD based algorithm is superior to that of the CFD based algorithm, especially when the number of rows of the observation matrix is large.rge.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.151-160
• /
• 2012

Most of the distributed high-dimensional indexing structures provide a reasonable search performance especially when the dataset is uniformly distributed. However, in case when the dataset is clustered or skewed, the search performances gradually degrade as compared with the uniformly distributed dataset. We propose a method of improving the k-nearest neighbor search performance for the distributed vector approximation-tree based on the strongly clustered or skewed dataset. The basic idea is to compute volumes of the leaf nodes on the top-tree of a distributed vector approximation-tree and to assign different number of bits to them in order to assure an identification performance of vector approximation. In other words, it can be done by assigning more bits to the high-density clusters. We conducted experiments to compare the search performance with the distributed hybrid spill-tree and distributed vector approximation-tree by using the synthetic and real data sets. The experimental results show that our proposed scheme provides consistent results with significant performance improvements of the distributed vector approximation-tree for strongly clustered or skewed datasets.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.9
• /
• pp.702-713
• /
• 2003

The importance of protection for data and information is increasing by the rapid development of information communication and network. And the concern for protecting private information is also growing due to the increasing demand for lots of services by users. Asymmetric cryptosystem is the mainstream in encryption system rather than symmetric cryptosystem by above reasons. But asymmetric cryptosystem is restricted in applying fields by the reason it takes more times to process than symmetric cryptosystem. In this paper, encryption system which executes authentication works of asymmetric cryptosystem by means of symmetric cryptosystem. The proposed cryptosystem uses an algorithms combines that combines block cipherment with stream cipherment and has a high stability in aspect of secret rate by means of transition of key sequence according to the information of plaintext while symmetric/asymmetric cryptosystem conducts encipherment/deciphermeent using a fixed key. Consequently, it is very difficult to crack although unauthenticator acquires the key information. So, the proposed encryption system which has a certification function of asymmetric cryptosystem and a processing time equivalent to symmetric cryptosystems will be highly useful to authorize data or exchange important information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.967-974
• /
• 2017

In this paper, we propose an inter-symbol interference (ISI) estimation scheme based on the maximum a posteriori (MAP) algorithm for faster-than-Nyquist (FTN) systems. Unfortunately, the ISI estimator based on the MAP algorithm requires relatively high computational complexity. To reduce the complexity of the MAP based ISI estimator, we propose a hybrid ISI estimation scheme based on the MAP and successive interference cancellation (SIC) algorithms. The proposed scheme not only offers good ISI estimation performances but also requires reasonably low complexity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.17 no.1
• /
• pp.1-9
• /
• 2016

In this paper, for the improvement of quality of service(QoS) performance of heterogeneous networks, multi-cell scheduling is proposed. In order to implement the proposed algorithm, for the recognition of the impact on the throughput performance of users, macro-pico-cells that form distributed architecture were proposed. In operating heterogeneous networks, considering the centralized structure, a macro-RRH(Remote Radio Head) deployment scenario was proposed. For interference mitigation of the proposed system, by applying the optional sub-frame, through CQI(Channel Quality Indicator) measurement for each sub-frame period, constraint conditions were measured according to system situations. For the simplification, the pattern of the same ABS muting was assumed. In the above two multi-cell environments, the algorithm of high-speed load balancing maintenance was proposed.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.81-92
• /
• 1998

A new hybrid technique using several sub-populations having completely different evolutionary behaviors is proposed to increase the possibility to quickly find the global optimum of continuous optimization problem. It has three sub-populations. Two NPOSA algorithms showing good performance in the problem having a rugged fitness function are applied to two sub-populations and a self-adaptive evolutionary algorithm to the other sub-population. Sub-populations evolve in different manners and the interaction among these sub-populations lead to the global optimum quickly. The efficiency of this technique is verified through benchmark test functions. Finally, the algorithm with three sub-populations has been applied to seek for the optimal camera calibration parameters. After an error function has been defined using measured feature points of a calibration block, it has been shown that the algorithm searches for the camera parameters that minimize the error function.

• Journal of Navigation and Port Research
• /
• v.27 no.2
• /
• pp.185-191
• /
• 2003

The aim of this research is to overall analyze/classify characteristics of Asian major ports. To achieve this aim, we firstly pointed out critical problems on research methodology and research scope which most of previous research have, from related literature review. In order to overcome those problems, major ports in A냠 were selected by the objective indicators, and both algorithms of AHP(Analytic Hierarchical Process) and FCM(Fuzzy C-Means) that revise weakness in previous clustering method were used. Through these hybrid approach, it were found that only 10 ports of 16 major Asian ports had their own phases in Asian major ports. Those 10 ports were classified into 6 port groups, and also membership degree of each port within the 4 port groups and ranking of each ports seer analyzed. Finally, based on results of these analysis, present status and future direction of Busan port were discussed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.566-571
• /
• 2011

As Plug-in Hybrid Vehicle and Electric Vehicle (PHEV/EV) take a greater share in the personal automobile market, their high penetration levels may bring potential challenges to electric utility especially at the distribution level. Thus, there is a need for the flexible charging management strategy to compromise the benefits of both PHEV/EV owners and power grid side. There are many different management methods that depend on the objective function and the constraints caused by the system. In this paper, the schema and dispatching schedule of centralized PHEV/EV charging spot network are analyzed. Also, we proposed and compared three power allocation strategies for centralized charging spot. The first strategy aims to maximize state of vehicles at plug-out time, the rest methods are equalized allocation and prioritized allocation based on vehicles SoC. The simulation results show that each run of the optimized algorithms can produce the satisfactory solutions to response properly the requirement from PHEV/EV customers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.685-692
• /
• 2007

Recent advances in wireless communications and electronics have enabled the development of low-cost, low-power, multi-functional sensors. A typical wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to the WSN. Unlike previous algorithms that consider continuous queries only, HQP supports both continuous queries and ad-hoc queries. Specially. HQP tries to reduce energy consumption of ad-hoc queries by using query results cached at each sensor node which are created during the execution of the previous continuous query. HQP can also exploit a trade-off between energy consumption and data accuracy. We evaluate the performance of HQP under a variety of WSN configurations.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.681-687
• /
• 1998

The paper presents a hybrid mcthod for disambiguation of the verb meaning in the machine translation. The presented verb translation algorithm is to perform the concept-based method and the statistics-based method simultaneously. It uses a collocation dictionary, WordNct and the statistical information extracted from corpus. In the transfer phase of the machine translation, it tries to find the target word of the source verb. If it fails, it refers to Word Net to try to find it by calculating word similarities between the logical constraints of the source sentence and those in the collocation dictionary. At the same time, it refers to the statistical information extracted from corpus to try to find it by calculating co-occurrence similarity knowledge. The experimental result shows that the algorithm performs more accurate verb translation than the other algorithms and improves accuracy of the verb translation by 24.8% compared to the collocation-based method.