• Korean Journal of Mathematics
• /
• v.30 no.1
• /
• pp.1-10
• /
• 2022

In the present paper, we have studied conformal Ricci solitons on f-Kenmotsu manifolds of dimension three. Also we have studied 𝜙-Ricci symmetry, 𝜂-parallel Ricci tensor, cyclic parallel Ricci tensor and second order parallel tensor in f-Kenmotsu manifolds of dimension three admitting conformal Ricci solitons. Finally, we give an example.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.510-517
• /
• 2009

A high throughput parallel decoding method is developed for context-based adaptive variable length codes. In this paper, several new design ideas are devised and implemented for scalable parallel processing, a reduction in area, and a reduction in power requirements. First, simplified logical operations instead of memory lookups are used for parallel processing. Second, the codes are grouped based on their lengths for efficient logical operation. Third, up to M bits of the input stream can be analyzed simultaneously. For comparison, we designed a logical-operation-based parallel decoder for M=8 and a conventional parallel decoder. High-speed parallel decoding becomes possible with our method. In addition, for similar decoding rates (1.57 codes/cycle for M=8), our new approach uses 46% less chip area than the conventional method.

• Journal of the Chungcheong Mathematical Society
• /
• v.13 no.1
• /
• pp.71-78
• /
• 2000

The main goal of this paper is to prove the following theorem ; Let (X, ${\rho}_1$) be a fuzzy normed linear space over K and (Y, ${\rho}_2$) be a fuzzy Banach space over K. If ${\chi}_{B_{{\parallel}{\cdot}{\parallel}}}{\supseteq}{\rho}*$, then (CF(X,Y), ${\rho}*$) is a fuzzy Banach space, where ${\rho}*(f)={\vee}{\lbrace}{\theta}{\wedge}\frac{1}{t({\theta},f)}\;{\mid}\;{\theta}{\in}(0,1){\rbrace}$, $f{\in}CF(X,Y)$, $B_{{\parallel}{\cdot}{\parallel}}$ is the closed unit ball on (CF(X, Y), ${\parallel}{\cdot}{\parallel}$ and ${\parallel}f{\parallel}={\vee}{\lbrace}P^2_{{\alpha}^-}(f(x))\;{\mid}\;P^1_{{\alpha}^-}(x)=1,\;x{\in}X{\rbrace}$, $f{\in}CF(X,Y)$, ${\alpha}{\in}(0,1)$.

• Advances in robotics research
• /
• v.1 no.2
• /
• pp.141-154
• /
• 2014

Redundant parallel manipulators have some advantages over the nonredundant parallel manipulators. It is important to determine how many additional branches should be introduced. This paper studies whether one or two additional branches should be added to a 3-DOF parallel manipulator by comparing the flexible deformation of a 3-DOF parallel manipulator with one additional branch and that with two additional branches. The kinematic and dynamic models of the redundant parallel manipulator are derived and the flexible deformation is investigated. The flexible deformation of the manipulators with one additional branch and two branches is simulated and compared. This paper is helpful for designers to design a redundantly actuated parallel manipulator.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1146-1158
• /
• 1993

In this paper, parallel scrambling techniques are considered for practical use in the SDH transmission and the ATM transmission. In the ATM transmission, there are two ways of transmitting ATM cells - the SDH-based and the cell-based - and the corresponding scrambling techniques differ accordingly. For the SDH transmission and the SDH-based ATM transmission, the FSS (frame synchronous scrambling) is applied to the STM frames : while for the cell-based ATM trans-mission, the DSS(distributed sample scrambling) is used on the ATM cell stream. The parallel scrambling techniques are examined for the FSS and the DSS, and applied to achieve the parallel FSSs for use in the SDH and the SDH-based ATM transmission along with the parallel DSS applicable to the cell-based ATM transmission. The resulting(8, 4) PSRG(parallel shift resister generator) and (8, 16) PSRG based parallel scramblings are directly applicable for the STM-1 rate processing of the STM-4 and STM-16 scramblings, respectively. Likewise, the resulting (1, 8)PSRG and double-sampling-double-correction based parallel scrambling techniques can be practically used for a low-rate processing of the SDH-based and the cell-based ATM signal scrambling respectively.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.119-124
• /
• 2001

In this pattern recognition on the large volumes of remote sensing satellite images, the inference time is much increased. In the case of the remote sensing data [5] having 4 wavebands, the 778 training patterns are learned. Each land cover pattern is classified by using 159, 900 patterns including the trained patterns. For the fuzzy classification, the 778 fuzzy rules are generated. Each fuzzy rule has 4 fuzzy variables in the condition part. Therefore, high performance parallel fuzzy inference system is needed. In this paper, we propose a novel parallel fuzzy inference system on T3E parallel computer. In this, fuzzy rules are distributed and executed simultaneously. The ONE_To_ALL algorithm is used to broadcast the fuzzy input to the all nodes. The results of the MIN/MAX operations are transferred to the output processor by the ALL_TO_ONE algorithm. By parallel processing of the fuzzy rules, the parallel fuzzy inference algorithm extracts match parallelism and achieves a good speed factor. This system can be used in a large expert system that ha many inference variables in the condition and the consequent part.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.482-489
• /
• 1997

This paper presents the analysis of the kinematics and dynamics of redundant parallel manipulators, and provides design guides for advanced parallel mainpulators with high performance. Three types of redundancies are considered which include the redundancies in serial chain, joint actuation, and parallelism. First, the kinematic and dynamic models of a redundant parallel manipulator are obtained in both joint and Cartesian spaces, and the kinematic and dynamic manipulabilities are defined for the performance evaluation. The effects of the three types of redundancies on the kinematic and dynamic performance of a parallel manipulator are then analyzed and compared, providing a set of guides for the design of advanced parallel manipulators. Finally, the simulation results using planer parallel manipulators are given.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.387-392
• /
• 2009

This paper introduces a novel parallel shift operator finite-difference time-domain (SO-FDTD) method for plasma in the dispersive media. We calculate the interaction between the electromagnetic wave of various frequencies and non-magnetized plasma by using the parallel SO-FDTD method. Then, we compare the results，which are calculated with serial and parallel SO-FDTD executions to obtain the speedup ratio and validate the parallel execution. We conclude that the parallel SO method has almost the same precision as the serial SO method, while the parallel approach expands the scope of memory and reduces the CPU time.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1286-1290
• /
• 2003

This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are includes in the proposed parallel contact-impact procedure, such as a parallel Belytschko-Lin-Tsay (BLT) shell element generation, a parallel explicit time integration scheme, and a parallel contact search algorithm based on the master slave slide-line algorithm. The underlying focus of the algorithms is on its effectiveness and efficiency for inclusion in future finite element systems on parallel computers. Throughout this research, a prototype code, named GT-PARADYN, is developed on the IBM SP2, a distributed-memory computer. Some numerical examples are provided to demonstrate the timing results of the procedure, discussing the accuracy and efficiency of the code.