• 대한수학회보
• /
• 제48권5호
• /
• pp.917-922
• /
• 2011

Let R be a prime ring, H a generalized derivation of R, L a noncentral Lie ideal of R, and 0 ${\neq}$ a ${\in}$ R. Suppose that $au^sH(u)u^t$ = 0 for all u ${\in}$ L, where s; t ${\geq}$ 0 are fixed integers. Then H = 0 unless satisfies $S_4$, the standard identity in four variables.

• 대한수학회보
• /
• 제46권3호
• /
• pp.599-605
• /
• 2009

Let R be a prime ring, H a generalized derivation of R and L a noncommutative Lie ideal of R. Suppose that $u^sH(u)u^t$ = 0 for all u $\in$ L, where s $\geq$ 0, t $\geq$ 0 are fixed integers. Then H(x) = 0 for all x $\in$ R unless char R = 2 and R satisfies $S_4$, the standard identity in four variables.

• 대한수학회보
• /
• 제45권4호
• /
• pp.621-629
• /
• 2008

Let R be a prime ring of characteristic different from 2, C the extended centroid of R, and $\delta$ a generalized derivations of R. If [[$\delta(x)$, x], $\delta(x)$] = 0 for all $x\;{\in}\;R$ then either R is commutative or $\delta(x)\;=\;ax$ for all $x\;{\in}\;R$ and some $a\;{\in}\;C$. We also obtain some related result in case R is a Banach algebra and $\delta$ is either continuous or spectrally bounded.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2002년도 춘계학술대회논문집
• /
• pp.67-71
• /
• 2002

본 논문에서는 many-to-many IP 멀티캐스팅을 위한 효율적인 BCT(Backbone Core Tree)생성 알고리즘의 시뮬레이션 방법에 대하여 제안한다. BCT는 기법은 CBT(Core Based Tree)에 기반을 두고 있다. CBT는 공유 트리를 이용하여 멀티캐스트 자료를 전달하기 때문에 Source based Tree에 비하여 각 라우터가 유지해야 하는 상태 정보의 양에 적고, 적용하기 간단하지만, Core 라우터 선택의 어려움과 트래픽이 Core로 집중되는 문제점을 가지고 있다. 이에 대한 보완책으로 BCT기법이 제안되었는데, 본 논문에서는 주어진 네트워크 위상 그래프에서 최소신장 트리를 만들고, 센트로이드(Centroid)를 이용하여 효율적인 BCT를 생성하는 알고리즘을 제안하고 시뮬레이션 방법을 제시한다.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1857-1866
• /
• 1989

In this paper, an algorithm to update a codebook using a neural network in consecutive images, is proposed. With the Kohonen's self-organizing feature map, we adopt the iterative technique to update a centroid of each cluster instead of the unsupervised learning technique. Because the performance of this neural model is comparable to that of the LBG algorithm, it is possible to update the codebooks of consecutive frames sequentially in TV and to realize the hardwadre on the real-time implementation basis.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2004년도 추계학술대회 학술발표 논문집 제14권 제2호
• /
• pp.564-567
• /
• 2004

In this thesis, a method is proposed to extract the car plate at the rear side of vehicle using blobs. We first extract the blobs in the input images using intensity variations and calculate the minimum horde. rectangle (MBR) of each blobs. It is followed that we select groups of blobs having similar width, centroid. And then, we try to detect the border lines of car plate and verify whether the area is a car plate or not using NN.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.642-645
• /
• 1991

This paper presents the results of research on hardware and software of the landmark tracking system to the positions of moving robot in real time. The landmark tracking system is composed of CCD camera, landmark, strobo system and image processing board. The algorithm calculates the position and direction by using the coordinate transformation fomula after calculating the centroid and rotation angle of landmark at fixed position using the image data. The experiment is performed with landmark tracking system is loaded on xyz-table. XYZ-table is used for identifying the true position in our experiment. The results shows that this system has high performance with maxima error of .+-.1 pixels.

• Journal of Advanced Marine Engineering and Technology
• /
• 제18권3호
• /
• pp.34-42
• /
• 1994

The present study is aimed to improve the PIV performance by suggesting a two-frame particle identification technique and by introducing estimation method of wall pressure distribution from the velocity data. Adopted image processing system consists of one commercial image board slit into a personal computer, 2-D sheet light generator, flow picture recording apparatus and related particle identification software. A revised particle tracking method essential to PIV performance is obtained by particle centroid correlation pairing (CCP) and its effectiveness is ascertained by comparison with multi-frame identification.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.796-799
• /
• 1999

In this paper, we propose an inference method for understanding intention of obstacle for collision avoidance using the grid-type map. In order to represent the environment using ultrasonic sensors, the grid-type map is first constructed. Then we detect the obstacle and infer the intention for collision avoidance using the CLA(Centroid of Largest Area) point of the grid-type map. To verify the proposed method, some experiments are performed.

• 천문학회보
• /
• 제42권1호
• /
• pp.56.2-56.2
• /
• 2017

To maintain turbulence in astrophysical fluids, driving is required. Constraining the driving scale of turbulence is important to identify the driving mechanism and also to obtain more accurate turbulence statistics from observations. We discuss how to obtain the driving scale of turbulence from observations. First, we explain the method to obtain the driving scale from the standard deviation of centroid velocity (i.e. the first moment of the line profile). Second, we discuss other techniques to obtain the driving scale.