• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.272-277
• /
• 2008

Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.3
• /
• pp.211-217
• /
• 2011

This paper proposes a quasi-optimal linear DOA (Direction-of-Arrival) estimator which is necessary for the development of a real-time robot auditory system tracking moving acoustic source. It is well known that the use of conventional nonlinear filtering schemes may result in the severe performance degradation of DOA estimation and not be preferable for real-time implementation. These are mainly due to the inherent nonlinearity of the acoustic signal model used for DOA estimation. This motivates us to consider a new uncertain linear acoustic signal model based on the linear prediction relation of a noisy sinusoid. Using the suggested measurement model, it is shown that the resultant DOA estimation problem is cast into the NCRKF (Non-Conservative Robust Kalman Filtering) problem [12]. NCRKF-based DOA estimator provides reliable DOA estimates of a fast moving acoustic source in spite of using the noise-corrupted measurement matrix in the filter recursion and, as well, it is suitable for real-time implementation because of its linear recursive filter structure. The computational efficiency and DOA estimation performance of the proposed method are evaluated through the computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.311-316
• /
• 2012

In this paper, a bit-mapping scheme is proposed for partial Chase combining in LDPC-coded systems. Contrary to the previously known bit mapping that assigns the information bits to more reliable channels, the proposed mapping assigns the codeword bits of irregular LDPC codes to distinct Gaussian channels by considering the characteristics of LDPC codes and channels. The recursion equation for partial Chase combining is derived by using the density evolution technique, based on it, the best bit mapping among the various bit-mapping schemes is derived, and the validity of them is confirmed through simulation.

• Bulletin of the Korean Chemical Society
• /
• v.19 no.5
• /
• pp.549-553
• /
• 1998

The structure and layer distribution of cadmium arachidate Langmuir-Blodgett film were analyzed by the small angle X-ray reflectivity measurements using synchrotron radiation. Y-to X type transition was ocurred during the 39th passage of deposition of cadmium arachidate. Based on the measurement of the consumed area of the monolayer, it was determined that about 27.5 layer was deposited. Using the synchrotron X-ray, the reflectivity profile of cadmium arachidate LB film over the wide range of grazing angle was obtained. The X-ray reflectivity profile was analyzed using the recursion formula. By fitting the location and dispersion of the subsidiary maxima between the Bragg peaks of the measured reflectivity profile with that of the calculated reflectivity profile, the average thickness and the distribution of layer thickness were evaluated. The genetic algorithm was adopted to the fitting of reflectivity profile to evaluate the optimum value of the number distribution of layer. Based on the morphology measurement with an atomic force microscopy (AFM), the domain structure and mean roughness of LB films were obtained. The mean roughness value calculated based on the number of layer distribution obtained from the measurement by AFM is consistent with that obtained from X-ray reflectivity analysis.

• Structural Engineering and Mechanics
• /
• v.80 no.6
• /
• pp.711-726
• /
• 2021

This paper presents a multiple parameters-based recursive methodology for the reliability quantification of civil structures subjected to meteorological disasters. Recognizing the challenge associated with characterizing at a single stroke all the meteorological disasters that may hit a structure during its service life, the proposed methodology by contrast features a multiparameter recursive mechanism to describe the meteorological demand of the structure. The benefit of the arrangements is that the essentially inevitable deviation of the practically observed meteorological data from those in the existing model can be mitigated in an adaptive manner. In particular, the implications of potential climate change to the relevant reliability of civil structures are allowed for. The application of the formulated methodology of recursive reliability quantification is illustrated by first considering the reliability quantification of a linear shear frame against simulated strong wind loads. A parametric study is engaged in this application to examine the effect of some hyperparameters in the configured hierarchical model. Further, the application is extended to a nonlinear hysteretic shear frame involving some field-observed cyclone data, and the incompleteness of the relevant structural diagnosis data that may arise in reality is taken into account. Also investigated is another application scenario where the reliability of a building envelope is assessed under hailstone impacts, and the emphasis is to demonstrate the recursive incorporation of newly obtained meteorological data.

• Korean Journal of Agricultural Science
• /
• v.50 no.3
• /
• pp.399-406
• /
• 2023

In this study, we propose a ripe tomato bunch localization method based on convolutional neural networks, to be applied in robotic harvesting systems. Tomato images were obtained from a smart greenhouse at the Rural Development Administration (RDA). The sample images for training were extracted based on tomato maturity and resized to 128 × 128 pixels for use in the classification model. The model was constructed based on four-layer convolutional neural networks, and the classes were determined based on stage of maturity, using a Softmax classifier. The localization of the ripe tomato bunch region was indicated on a class activation map. The class activation map could show the approximate location of the tomato bunch but tends to present a local part or a large part of the ripe tomato bunch region, which could lead to poor performance. Therefore, we suggest a recursive method to improve the performance of the model. The classification results indicated that the accuracy, precision, recall, and F1-score were 0.98, 0.87, 0.98, and 0.92, respectively. The localization performance was 0.52, estimated by the Intersection over Union (IoU), and through input recursion, the IoU was improved by 13%. Based on the results, the proposed localization of the ripe tomato bunch area can be incorporated in robotic harvesting systems to establish the optimal harvesting paths.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.446-449
• /
• 2002

This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet from. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangout text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangout, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent. This paper represents a improved data Compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet form. This document is an example of what your camera-ready manuscript to ITC-CSCC 2002 should look like. Authors are asked to conform to the directions reported in this document.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1485-1492
• /
• 1999

대규모 시스템 명세의 올바름을 검증하기 위한 유한 상태 LTS에 기반을 둔 CTL논리 적용에 있어 가장 큰 문제점은, 시스템 내부의 병렬 프로세스간의 상호작용으로 인한 상태폭발이다. 그러나 Modal mu-calculus 논리를 시스템 안전성 및 필연성 특성 명세에 사용하면, 행위에 의한 순환적 정의가 가능하므로 상태폭발 문제가 해결 가능하다. 본 논문에서는 LTS로 명세화된 통신 프로토콜 시스템 모델의 안전성 및 필연성 특성을 모형 검사 기법에 의해 검증함에 있어, 시제 논리로 사용된 Modal mu-calculus 안전성 및 필연성 논리식과 CTL 의 안전성 및 필연성 논리식의 극한값이 동일함을 두 논리식을 만족하는 상태 집합이 같다는 것을 보임으로써 증명한다. 증명된 결과는 I/O FSM 모델로 표현된 통신 프로토콜의 안전성 및 필연성 검사를 위해 이론적인 기반으로서, 컴퓨터를 이용한 모형검사 기법에 효과적인 방법으로 응용이 가능하다.Abstract In applying CTL-based model checking approach to correctness verification of large state transition system specifications, the major obstacle is the combinational explosion of the state space arising due to interaction of many loosely coupled parallel processes. If, however, the modal mu-calculus viewed as a CTL-based logic with recursion, is used to specify the safety and liveness property of a given system, it is possible to resolve this problem. In this paper, we discuss the problem of verifying communication protocol system specified in LTS, and prove that a logic expression specifying safety and liveness in modal mu-calculus is semantically identical to the maximum value of the expression in CTL. This relation is verified by the proof that the sets of states satisfying the two logic expressions are equivalent. The proof can be used as a theoretical basis for verifying safety and liveness of communication protocols represented as I/O FSM model.

• Journal of the Korean Institute of Gas
• /
• v.18 no.3
• /
• pp.1-12
• /
• 2014

In this paper, we developed an explosion proof type and portable combustible gas leak detector and proposed an algorithm to improve the accuracy for measuring gaseous concentrations. The nation's first we developed an infrared gas leak detector with explosion proof standard(Ex d ib) and improved measuring accuracy by using linearization recursion equation and 2nd Lagrange interpolation polynomial. Together, we advanced their performances and added their easy functions after investigating field demands. To compare our and other company's detectors, we performed measurement tests with eight standard gases made by Korea Gas Safety Corporation. We demonstrated the excellence of our instruments in measuring accuracy other than detecters through experimental results.

• International Journal of CAD/CAM
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2013

Just by adjusting the control points iteratively, progressive iterative approximation (PIA) presents an intuitive and straightforward scheme such that the resulting limit curve (surface) can interpolate the original data points. In order to obtain more flexibility, adjusting only a subset of the control points, a new method called local progressive iterative approximation (LPIA) has also been proposed. But to this day, there are two problems about PIA and LPIA: (1) Only an approximation process is discussed, but the accurate convergence curves (surfaces) are not given. (2) In order to obtain an interpolating curve (surface) with high accuracy, recursion computations are needed time after time, which result in a large workload. To overcome these limitations, this paper gives an explicit matrix expression of the control points of the limit curve (surface) by the PIA or LPIA method, and proves that the column vector consisting of the control points of the PIA's limit curve (or surface) can be obtained by multiplying the column vector consisting of the original data points on the left by the inverse matrix of the collocation matrix (or the Kronecker product of the collocation matrices in two direction) of the blending basis at the parametric values chosen by the original data points. Analogously, the control points of the LPIA's limit curve (or surface) can also be calculated by one-step. Furthermore, the $G^1$ joining conditions between two adjacent limit curves obtained from two neighboring data points sets are derived. Finally, a simple LPIA method is given to make the given tangential conditions at the endpoints can be satisfied by the limit curve.