• 대한수학회보
• /
• 제49권4호
• /
• pp.767-774
• /
• 2012

For a positive square-free integer $d$, let $t_d$ and $u_d$ be positive integers such that ${\epsilon}_d=\frac{t_d+u_d{\sqrt{d}}}{\sigma}$ is the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{d})$, where ${\sigma}=2$ if $d{\equiv}1$ (mod 4) and ${\sigma}=1$ otherwise For a given positive integer $l$ and a palindromic sequence of positive integers $a_1$, ${\ldots}$, $a_{l-1}$, we define the set $S(l;a_1,{\ldots},a_{l-1})$ := {$d{\in}\mathbb{Z}|d$ > 0, $\sqrt{d}=[a_0,\overline{a_1,{\ldots},2a_0}]$}. We prove that $u_d$ < $d$ for all square-free integer $d{\in}S(l;a_1,{\ldots},a_{l-1})$ with one possible exception and apply it to Ankeny-Artin-Chowla conjecture and Mordell conjecture.

• 제어로봇시스템학회논문지
• /
• 제10권7호
• /
• pp.590-596
• /
• 2004

A passivity-based dynamic output feedback controller design is considered for a finite collection of non-square linear systems. Design of a single controller for a set of plants i.e. simultaneous stabilization is an important issue in the area of robust control design. We first determine a squaring gain matrix and an additional dynamics that is connected to the systems in a feedforward way, then a static passivating control law is designed. Consequently, the actual feedback controller will be the static control law combined with the feedforward dynamics. A necessary and sufficient condition for the existence of the parallel feedforward compensator is given by the static output feedback formulation. In contrast to the previous result [1], a technical condition for constructing the parallel feedforward compensator is removed by proposing a new type of the parallel compensator.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.299-302
• /
• 1995

Recently, we proposed a 3-D range-image measuring system for a slowly moving object by mechanically scanning a laser light beam emitted from a self mixing laser diode. In this paper, we introduced that every object moves along a straight line course, which is set diagonally against the semiconductor laser beam so that we can recognize each shape and size parameters of objects separately from the acquired 3-D range-image. We measured a square mesa on a square plane as an object. The measured velocity was 4.44mm/s and 4.63mm/s with an error of 0.56mm/s to 0.37mm/s. And thickness error of the mesa was 0.5mm to 0.6mm, which was obtained from the 3-D range-image of the standstill or moving object with thickness of 17.Omm.

• EDISON SW 활용 경진대회 논문집
• /
• 제4회(2015년)
• /
• pp.521-526
• /
• 2015

A Sudoku puzzle is a kind of magic square puzzle which requires a non-repeated series of numbers from 1 to 9 in each 9 rows and 9 columns. Furthermore it contains total of 9 small three-by-three matrices, which need non-repeated numbers from 1 to 9 as well. Therefore the total number of possible cases of Sudoku puzzle is finite, even though that of creating nine-by-nine square is exponentially great. Accordingly a certain set of way is need not only for solving the puzzle, but also creating a new one. In this study, the method for creating a Sudoku puzzle applying genetic algorithm is suggested and will be demonstrated. Also, it will be shown that a Sudoku puzzle can be solved by genetic algorithm.

• 한국CDE학회지
• /
• 제21권2호
• /
• pp.69-74
• /
• 2015

A Sudoku puzzle is a kind of magic square puzzle which requires a non-repeated series of numbers from 1 to 9 in each 9 rows and 9 columns. Furthermore it contains total of 9 small three-by-three matrices, which need non-repeated numbers from 1 to 9 as well. Therefore the total number of possible cases of Sudoku puzzle is finite, even though that of creating nine-by-nine square is exponentially great. Accordingly a certain set of way is need not only for solving the puzzle, but also creating a new one. In this study, the method for creating a Sudoku puzzle applying genetic algorithm is suggested and will be demonstrated. Also, it will be shown that a Sudoku puzzle can be solved by genetic algorithm.

• 한국지능시스템학회논문지
• /
• 제16권6호
• /
• pp.777-784
• /
• 2006

본 논문에서는 부분최소법 (PLS: Partial least square)과 c-퍼지 모델트리를 적용하여 클로로필-a 농도의 예측 모델을 제안한다. 제안된 방법은 모든 입력속성을 고려하여 퍼지 클러스터에 의해 계산된 중심벡터를 설정한 후, 각각의 중심벡터들과 입력속성간의 소속도를 이용하여 내부 노드를 형성하고, 형성된 내부노드에서 PLS를 적용하여 지역모델(Local model)을 구축한다. 노드의 분리기준으로서 부모노드(patent node)에서 구축된 모델에서 계산된 에러값이 자식노드(child node)에서 계산된 에러값보다 클 경우에 분기가 이루어진다. 최종 단계에서는 임의의 입력데이터와 잎노드에서 계산된 클러스터 중심값과 비교하여 소속도가 높은 클러스터에 속한 지역모델을 선택하여 출력값을 예측한다. 제안된 방법의 우수성을 보이기 위해 수질 데이터를 대상으로 실험한 결과 기존의 모델트리 방식에 비하여 향상된 성능을 보임을 알 수 있었다.

• 한국축산식품학회지
• /
• 제39권1호
• /
• pp.114-120
• /
• 2019

Response surface methodology (RSM) is a useful set of statistical techniques for modeling and optimizing responses in research studies of food science. As a design for a response surface experiment, a central composite design (CCD) with multiple runs at the center point is frequently used. However, sometimes there exist situations where some among the responses at the center point are outliers and these outliers are overlooked. Since the responses from center runs are those from the same experimental conditions, there should be no outliers at the center point. Outliers at the center point ruin statistical analysis. Thus, the responses at the center point need to be looked at, and if outliers are observed, they have to be examined. If the reasons for the outliers are not errors in measuring or typing, such outliers need to be deleted. If the outliers are due to such errors, they have to be corrected. Through a re-analysis of a dataset published in the Korean Journal for Food Science of Animal Resources, we have shown that outlier elimination resulted in the increase of the maximum possible R-square that the modeling of the data can obtain, which enables us to improve the quality of response surface analysis.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.343-345
• /
• 2004

We propose a new category of fuzzy set-based fuzzy inference systems based on data granulation related to fuzzy space division for each variables. Data granules are viewed as linked collections of objects(data, in particular) drawn together by the criteria of proximity, similarity, or functionality. Granulation of data with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polyminial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method. Numerical example is included to evaluate the performance of the proposed model.

• Agribusiness and Information Management
• /
• 제7권2호
• /
• pp.1-11
• /
• 2015

This study has performed a comparative analysis between groups based on Time To First Fixation, Fixation Duration, Fixation Count and Total Visit Duration, which are eye-tracking analysis indicators on what visual attention is shown compared to the e-magazine produced as regular images related to e-magazines in which experiment subjects have applied cinemagraph images as eye tracking research on the e-magazine produced with cinemagraph images and e-magazines produced with regular images. The experiment sample used e-magazines composed of nine pages while AOI (area of interest) has been set up on each page by classifying image and text regions. A combined 30 people took part in the experiment, which was performed by randomly assigning 15 to the experiment group and 15 to the control group. According to the results of the analysis, the experiment group recorded a shorter time than the control group on the e-magazine produced with cinemagraph images through Time To First Fixation. Though no significant difference was found between the experiment and control groups in Fixation Duration, a substantial difference did appear between Fixation Duration and Total Visit Duration.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.19-25
• /
• 2004

In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.