• Journal of Korea Society of Industrial Information Systems
• /
• v.2 no.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
• /
• v.28 no.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
• /
• v.17 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.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.06a
• /
• 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.

• Convergence Security Journal
• /
• v.11 no.1
• /
• pp.11-18
• /
• 2011

Wireless mesh network technology with transmission speeds similar to wired and wireless technology means to build, compared with wired networks, building a more efficient network to provide convenience and flexibility. The wireless mesh network router nodes in the energy impact of the mobility is less constrained and has fewer features entail. However, the characteristics of various kinds due to network configuration settings and the choice of multiple paths that can occur when the system overhead and there are many details that must be considered. Therefore, according to the characteristics of these network routing technology that is reflected in the design and optimization of the network is worth noting. In this paper, a multi-path setting can be raised in order to respond effectively to the problem of the router node data loss and bandwidth according to traffic conditions and links to elements of the hop count evaluation by using a genetic algorithm as a workaround for dynamic routing the routing metric for wireless mesh network scheme is proposed.

• Communications of the Korean Mathematical Society
• /
• v.9 no.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$.

• Speech Sciences
• /
• v.13 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.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.

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.604-609
• /
• 2014

Decoding processes in portable media players have a high computational cost, resulting in high power consumption by the CPU. If decoding computations are reduced, the power consumed by the CPU is also be reduced, but such a choice generally results in a degradation of the video quality for the users, so it is essential to address this tradeoff. We proposed a new CPU power management scheme that can make use of the scalability property available in the H.164/SVC standard. We first proposed a new video quality model that makes use of a video quality metric(VQM) in order to efficiently take into account the different quantization factors in the SVC. We then propose a new dynamic voltage scaling(DVS) scheme that can selectively combine the previous decoding times and frame sizes in order to accurately predict the next decoding time. We then implemented a scheme on a commercial smartphone and performed a user test in order to examine how users react to the VQM difference. Real measurements show that the proposed scheme uses up to 34% fewer energy than the Linux DVFS governor, and user tests confirm that the degradation in the quality is quite tolerable.