• The Korean Journal of Applied Statistics
• /
• v.18 no.1
• /
• pp.137-146
• /
• 2005

Neural network is one of the most notable technique. It usually provides more powerful forecasting models than the traditional time series techniques. Employing the Ensemble technique in forecasting model, one should provide a initial distribution. Usually the uniform distribution is assumed so that the initialization is noninformative. However, it would be expected a sequential informative initialization based on data rather than the uniform initialization gives further reduction in forecasting error. In this note, a modified Ensemble algorithm using sequential initial probability is developed. The sequential distribution is designed to have much weight on the recent data.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.11
• /
• pp.404-416
• /
• 1983

This paper is concerned with the design automation of the sequential machines. The operations of sequential machine can be diveded into two types such as synchronous and asynchronous sequential machine and their realization is treated in separate mode. But, in order to integrate logic circuits in high volume, mixed mode sequential machine uses common circuitry that consists of gates and flip-flops. Proposed sequential machine can be designed by several method, which are hard-wired implementation, firmware realization by PLA and ROM. And then onr example shows the differnces among three design mothods. Finally, computer algorithm(called MINIPLA) is discussed for various application of mixed-mode sequential machine.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.6
• /
• pp.669-678
• /
• 2009

Real-time image georeferencing technologies are required to generate spatial information promptly from the image sequences acquired by a multi-sensor system. We thus derive a sequential adjustment algorithm based on the combined adjustment model. By adopting the sequential adjustment model, we develop a sequential AT(Aerial Triangulation) algorithm to georeference image sequences in real-time. The proposed algorithm enables to perform AT rapidly with the minimum computation at the current stage by using the results computed at the previous stage whenever a new image is added. Experiments with simulated data were conducted to verify the effectiveness of the proposed algorithm. The results of the experiments show that the georeferencing of each image took very short time and its accuracy was determined within ${\pm}4cm$ on the ground control points comparing to the results of the existing simultaneous AT.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.166-172
• /
• 2005

With the development of RAIM techniques for single failure, increasing interest has been shown in the multiple failure problem. As a result, numerous approaches have been used in attempts to tackle this problem. This paper considers the two failure problem with total least squares (TLS) technique, a solution that has rarely been addressed because TLS requires an immense number of computations. In this paper, the special form of the observation matrix H, (that is, one column is exactly known) is exploited so as to develop an algorithm in a sequential form, thereby reducing computational load. The algorithm permits the advantages of TLS without the excessive computational burden. The proposed algorithm is verified through a numerical simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2627-2631
• /
• 2003

With the development of RAIM techniques for single failure, there has been increasing interest in the multiple failure problem. There have been many approaches to tackle the problem from various points of view. This paper approaches to two failure problem with total least squares (TLS) technique, which has rarely been addressed because TLS requires a great number of computations. In this paper, the special form of the observation matrix H, that is, one column is exactly known, is exploited so as to develop an algorithm in a sequential form, which reduces computational burden. The algorithm makes us enjoy the advantages of TLS without much computational burden. The proposed algorithm is verified through a numerical simulation.

• Journal of the Optical Society of Korea
• /
• v.18 no.6
• /
• pp.777-782
• /
• 2014

This paper proposes an RGB to RGBY color conversion algorithm for liquid crystal display (LCD) using RGW pixel structure with two-field (yellow and blue) sequential driving method. The proposed algorithm preserves the hue and saturation of the original color by maintaining the RGB ratio, and it increases the luminance. The performance of the proposed RGBY conversion algorithm is verified using the MATLAB simulation with 24 images of Kodak lossless true color image suite. The simulation results of average color difference CIEDE2000 (${\delta}E^*_{00}$) and scaling factor are 0.99 and 1.89, respectively. These results indicate that the average brightness is increased 1.89 times compared to LCD using conventional RGB pixel structure, without increasing the power consumption and degrading the image quality.

• Journal of electromagnetic engineering and science
• /
• v.12 no.2
• /
• pp.148-154
• /
• 2012

In this paper, we propose an algorithm to conserve resources of the common control channel in a cognitive radio network by rejecting the redundant users using cooperative spectrum sensing. The proposed scheme is investigated under the paradigm of active spectrum sensing and a sequential detection technique. The algorithm is based on the J-divergence between the hypotheses of non primary user operation and the otherwise case. We select the most significant eigenvalues, which primarily affect the global statistical test. For the case where interference is from a secondary system transmission, a match filter is first employed to remove the degradation, and then the proposed algorithm is employed to remove the cooperative sensing nodes. Numerical results are provided and compared with conventional cases in order to validate the performance of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

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

Generating test patterns for asynchronous sequential circuits remains to be a very difficult problem. There are few algorithms for this problem, and previous works cut feedback loops, and insert synchronous flip-flops in the feedback loops during ATPG. The conventional algorithms are similar to the algorithms for synchronous sequential circuits. This means that the conventional algorithms generate test patterns by modeling asynchronous sequential circuits as synchronous sequential circuits. So, test patterns generated by those algorithms nay not detect target faults when the test patterns are applied to the asynchronous sequential circuit under test. In this paper an algorithm is presented to generate test patterns for asynchronous sequential circuits. Test patterns generated by the algorithm can detect target faults for asynchronous sequential circuits with the minimal possibility of critical race problem and oscillation. And it is guaranteed that the test patterns generated by the algorithm will detect target faults.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.29-36
• /
• 2009

Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, is an important data mining problem with broad applications. Since a sequential pattern in DNA sequences can be a motif, we studied to find sequential patterns in DNA sequences. Most previously proposed mining algorithms follow the exact matching with a sequential pattern definition. They are not able to work in noisy environments and inaccurate data in practice. Theses problems occurs frequently in DNA sequences which is a biological data. We investigated approximate matching method to deal with those cases. Our idea is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call approximated pattern. The existing PrefixSpan algorithm can successfully find sequential patterns in a long sequence. We improved the PrefixSpan algorithm to find approximate sequential patterns. The experimental results showed that the number of repeats from the proposed method was 5 times more than that of PrefixSpan when the pattern length is 4.