• 한국산업정보학회논문지
• /
• 제2권2호
• /
• pp.219-228
• /
• 1997

The Fano metric is the maximum likelihood decoding choice for convlutional code for binary symmetric channel. The Fano metric assumes that it has previous knowledge of channel error probability. However, the bit errors in real channel occur in bursts and the channel error probability can not be known exactly. Thus, the Fano metric is not the maximum likelihood choice for bursty-noise channel. In this paper universal metri which dose not require the previous knowlege of the channel transition probability is used for sequential decoding. It is shown that the complexity of the universal is much less than that of the Fano metric bursty-noise channel, since it is estimated on a branch by branch basis.

• Nonlinear Functional Analysis and Applications
• /
• 제28권4호
• /
• pp.877-886
• /
• 2023

The first result of this paper is to give a revised proof of Sanatammappa et al.'s recent result in a b-metric space, under appropriate choice of constants without using the continuity of the b-metric. The second is to prove a fixed point theorem under a contraction type condition in an extended b-metric space.

• Structural Engineering and Mechanics
• /
• 제17권6호
• /
• pp.767-788
• /
• 2004

The classical 8-node isoparametric serendipity element uses parametric shape functions for both test and trial functions. Although this element performs well in general, it yields poor results under severe mesh distortions. The distortion sensitivity is caused by the lack of continuity and/or completeness of shape functions used for test and trial functions. A recent element using parametric and metric shape functions for constructing the test and trial functions exhibits distortion immunity. This paper discusses the choice of parametric or metric shape functions as the basis for test and/or trial functions, satisfaction of continuity and completeness requirements, and their connection to distortion sensitivity. Also, the performances of four types of elements, viz., parametric, metric, parametric-metric, and metric-parametric, are compared for distorted meshes, and their merits and demerits are discussed.

• 대한수학회보
• /
• 제46권2호
• /
• pp.255-261
• /
• 2009

In this paper, we shall prove several results concerning Ricci curvature of a Riemannian manifold (M, g) := (SU(2), g) with an arbitrary given left invariant metric g. First of all, we obtain the maximum (resp. minimum) of {r(X) := Ric(X,X) | ${||X||}_g$ = 1,X ${\in}$ X(M)}, where Ric is the Ricci tensor field on (M, g), and then get a necessary and sufficient condition for the Levi-Civita connection ${\nabla}$ on the manifold (M, g) to be projectively flat. Furthermore, we obtain a necessary and sufficient condition for the Ricci curvature r(X) to be always positive (resp. negative), independently of the choice of unit vector field X.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2237-2242
• /
• 2005

The original RRT is iteratively expanded by applying control inputs that drive the system slightly toward randomly-selected states, as opposed to requiring point-to-point convergence, as in the probabilistic roadmap approach. It is generally known that the performance of RRTs can be improved depending on the selection of the metrics in choosing the nearest vertex and bias techniques in choosing random states. We designed a path planning algorithm based on the RRT method for a remote-controlled mobile robot. First, we considered a bias technique that is goal-biased Gaussian random distribution along the command directions. Secondly, we selected the metric based on a weighted Euclidean distance of random states and a weighted distance from the goal region. It can save the effort to explore the unnecessary regions and help the mobile robot to find a feasible trajectory as fast as possible. Finally, the constraints of the actuator should be considered to apply the algorithm to physical mobile robots, so we select control inputs distributed with commanded inputs and constrained by the maximum rate of input change instead of random inputs. Simulation results demonstrate that the proposed algorithm is significantly more efficient for planning than a basic RRT planner. It reduces the computational time needed to find a feasible trajectory and can be practically implemented in a remote-controlled mobile robot.

• 융합보안논문지
• /
• 제11권1호
• /
• pp.11-18
• /
• 2011

무선 메쉬 네트워크 기술은 유선과 유사한 전송속도를 갖는 무선망을 구축하는 기술을 의미하며, 유선 네트워크와 비교하여 보다 효율적인 망 구축의 편의성 및 유연성을 제공한다. 이러한 무선 메쉬 네트워크는 라우터 노드의 이동성이 적고 에너지 영향에도 제약이 적게 따른다는 특징을 갖고 있다. 그러나 다양한 종류의 네트워크로 구성되는 특징으로 인해서 다중 경로의 설정 및 선택 시에 발생할 수 있는 시스템 오버헤드 등 고려되어야 하는 사항들이 많다. 그러므로 이러한 네트워크 특성에 맞는 경로 설정 기술이 반영되는 네트워크의 설계 및 최적화에 주목할 필요가 있다. 본 논문에서는 다중 경로 설정 시 발생 할 수 있는 문제에 효과적으로 대응하기 위해 라우터 노드의 트래픽 상황에 따른 데이터 손실률과 대역폭 및 링크의 흡수를 평가 요소로 활용하여 유전 알고리즘을 통한 동적 경로 설정에 대한 해결방법으로 무선 메쉬 네트워크의 라우팅 메트릭 기법을 제안한다.

• 대한수학회논문집
• /
• 제9권4호
• /
• pp.927-931
• /
• 1994

Let G be a cyclic group of order 2 and let $S^1$ denote the unit circle in $R^2$ with the standard metric. We consider smooth G-vector bundles over $S^1$ when G acts on $S^1$ by reflection. Then the fixed point set of G on $S^1$ is two points ${z_0, z_1}$. Let $E$\mid$_{z_0} and E$\mid$_{z_1}$ be the fiber G-representation spaces at $z_0$ and $z_1$ respectively. We associate an orthogonal G-representation $\rho_i : G \to O(n)$ to $E$\mid$_{z_i}, i = 0, 1$. Let det $p\rho_i(g), g \neq 1$, be denoted by det $E$\mid$_{z_i}$ since det $\rho_i(g)$ is independent of choice of $\rho_i$.

• 음성과학
• /
• 제13권4호
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• 대한수학회보
• /
• 제60권2호
• /
• pp.507-514
• /
• 2023

Suppose that a line passing through a given point P intersects a given circle 𝓒 at Q and R in the Euclidean plane. It is well known that |PQ||P R| is independent of the choice of the line as long as the line meets the circle at two points. It is also known that similar properties hold in the 2-sphere and in the hyperbolic plane. New proofs for the similar properties in the 2-sphere and in the hyperbolic plane are given.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제20권11호
• /
• pp.604-609
• /
• 2014

미디어 플레이어에서의 디코딩 과정은 많은 연산을 필요로 하며, CPU로부터 높은 소비전력을 초래한다. 디코딩 연산을 줄이는 것은 CPU 소비 전력을 감소시킬 수 있지만 사용자로부터 비디오 품질을 저하시키게 된다. 본 논문에서는 H.264의 품질 확장성을 이용하여 새로운 CPU 전력 관리 기법을 제안한다. 첫째, VQM(Video Quality Metric)을 사용하여 계층적 비디오 코딩의 서로 다른 양자화 인자를 고려한 새로운 비디오 품질 모델을 제안한다. 그리고 이전 디코딩 시간과 프레임 크기를 선택적으로 융합한 디코딩 시간 예측기법에 기반한 새로운 동적 전압 기법을 제안한다. 최신 스마트폰에서 구현하였고, 사용자 테스트를 수행하였다. 제안한 기법을 실제 측정에 적용하였을 때 리눅스 동적 전압 및 주파수 조절(DVFS) 거버너에 비해 34%의 에너지 감소를 보였고 사용자 테스트를 통해 실험 영상의 품질 하락을 사용자는 인지하지 못하거나 용인될 수 있음을 확인하였다.