• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.880-883
• /
• 2005

본 논문에서는 유한체 GF(P)상의 순차논리머시인구성 방법의 한가지를 제안하였다. 제안한 순차논리머시인구성 방법은 먼저 GF(P)상에서의 순차논리머시인의 수학적 성질을 논의하였으며, 순차논리머시인 구성을 위하여 기본의 3가지 회로소자를 사용하여 선형제환시프트레지스터와 이에 대한 행렬표현에 대해 논의하였다. 그리고, 제안한 방법을 제산연산처리에 적용하였다.

• Journal of the Korean Data and Information Science Society
• /
• 제16권3호
• /
• pp.657-663
• /
• 2005

Under the minimum risk point estimation formulation of Robbins(1959), we consider the sequential point estimation problem for normal population $N({\theta},\;{\theta})$ with unknown parameter ${\theta}$. In the case of completely unknown ${\theta}$, Stein's(1945) two-stage procedure is known to enjoy the consistency property, but it is not even first-order efficient. In the case when ${\theta}>{\theta}_L\;where\;{\theta}_L(>0)$ is known, the revised two-stage procedure is shown to enjoy all the usual second-order properties.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.257-266
• /
• 2003

Distribution-free estimation methods are proposed for slope, $\beta$ in the simple linear regression model. In this paper, we suggest the point estimators using the sequential slope based on sign test and Wilcoxon signed rank test. Also confidence intervals are presented for each estimation methods. Monte Carlo simulation study is carried out to compare the efficiency of these methods with least square method and Theil´s method. Some properties for the proposed methods are discussed.

• 충청수학회지
• /
• 제14권2호
• /
• pp.47-54
• /
• 2001

Let {Xn, n = 1,2,${\cdots}$} be i.i.d. random variables with the only unknown parameters mean ${\mu}$ and variance a ${\sigma}^2$. We consider a sequential confidence interval C1 for the mean with coverage probability 1-${\alpha}$ and expected length of confidence interval $E_{\theta}$(Length of CI)/${\mid}{\mu}{\mid}{\leq}k$ (k : constant) and give some asymptotic properties of the stopping time in various limiting situations.

• 대한전자공학회논문지
• /
• 제24권5호
• /
• pp.823-832
• /
• 1987

This pper presents a method for constructing multiple-valued logic sequential machines based on Galois field. First, we assign all elements in GF(2**m) to bit codes using mathematical properties of GF(2**m). Then, we realized the sequencial machine circuits with and withoutm feed-back. 1) Sequential machines with feed-back are constructed by using only MUX from state-transition diagram expressing the information of sequential machines. 2) Sequential machines without feed-back are constructed by following steps. First, we assigned states in state-transition disgram to state bit codes, then obtained state function and predecessor table explaining the relationship between present states and previous states. Next, we obtained next-state function from state function and predecessor table. Finally we realized the circuit using MUX and decoder.

• 한국컴퓨터정보학회논문지
• /
• 제23권11호
• /
• pp.43-49
• /
• 2018

In this paper, we propose a displacement measurement method based on deep learning using image data obtained from tensile tests of a material specimen. We focus on the fact that the sequential images during the tension are generated and the displacement of the specimen is represented in the image data. So, we designed sample generation model which makes sequential images of specimen. The behavior of generated images are similar to the real specimen images under tensile force. Using generated images, we trained and validated our model. In the deep neural network, sequential images are assigned to a multi-channel input to train the network. The multi-channel images are composed of sequential images obtained along the time domain. As a result, the neural network learns the temporal information as the images express the correlation with each other along the time domain. In order to verify the proposed method, we conducted experiments by comparing the deformation measuring performance of the neural network changing the displacement range of images.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• 한국정보통신학회논문지
• /
• 제14권6호
• /
• pp.1441-1446
• /
• 2010

본 논문에서는 유한체상의 순차논리시스템을 이용하여 제산기를 구성하는 방법을 제안하였다. 제안한 방법은 먼저 유한체와 순차논리시스템의 수학적 성질을 기반으로 현재상태와 차순상태 사이의 선형성질을 도출하였다. 그리고, 선형성질과 행렬로 표현한 특성다항식을 사용하여 유한체상의 순차논리시스템을 구현하였으며, 이를 이용하여 제산기를 구현하였다. 제안한 방법은 기존의 방법에 비해 규칙적이고 좀 더 효율적으로 순차논리시스템을 구현할 수 있었으며, 이를 이용하여 효과적인 제산기를 구현할 수 있었다.

• 응용통계연구
• /
• 제1권2호
• /
• pp.66-81
• /
• 1987

이 연구에서는 새로운 방법의 비모수적 축차검정방법이 제시되었다. 먼저 축차적으로 얻어지는 관측치를 일정수의 집단으로 분류하고 각집단으로부터 주어진 가설에 적절한 비모수 통계량을 구하여 이것을 축차확률비검정에서 사용되는 로그확률비통계량에 대체하여 Wald의 축차검정을 수행하는 방법이다. 이러한 검정의 특성은 Wiener과정에 의해 근사적으로 규명되었다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.858-863
• /
• 2004

In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.