• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.12-21
• /
• 1996

The trellis shaping is the method of selecting a minimum weight sequence from an equivalent class of possible transmitted sequences. It is perforemed by searching through the trellis diagram of a shaping convolutional code Cs. A shaping gain of the order of 1dB may be obtained with a simple 4-state shaping code. But when the rellis shaping is applied to multi-dimensional constellation, the shaping gain is decreased and the transmission delay is increased, which make it difficult to apply the trellis shaping to multi-dimensional constellation. In this paper, in order to solve these problems, the shell mapping algorithm is used for the mapper in the proposed trellis shaping. The simulatio result shows that the proposed trellis shaping is better than coventional trellis shaping to multi-dimensional constellation. In this paper, in order to solve these problems, the shell mapping on multi-dimensional costellation with respect to shaping gain and transmission delay. And the constellation expansion ratio (CER) and the capacity of transmitted injformation are identical to those of conventional trellis shaping on multi-dimensional constellation.

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.38-47
• /
• 2012

The paper proposes a method for generating a sequence of images with smooth transition of illumination from two input images with different lighting conditions. Our relighting approach is image-based, such as the light field rendering. We store the luminances (pixel RGB values) into "lighting functions" consisting of a couple of parameters related to normal vectors. Images with different light positions are rendered by interpolating the luminances retrieved from the lighting functions. The proposed method is a promising technique for many applications requiring a scene with variety of lighting effects, such as movies, TV games, and so on.

• Transactions of Materials Processing
• /
• v.13 no.1
• /
• pp.90-101
• /
• 2004

An inverse mosaic method has been proposed to generate an initial blank shape from the final product shape. Differently from the geometric mapping method, the method can handle triangular patches. However, the generated blank shape is strongly dependent on the order of determination of nodes. In order to compensate the dependency error smoothing technique has been also developed. Although the accuracy has been improved greatly compared with the geometrical mapping method, the method has limitation, due to the no incorporation of plasticity theory. Even though the accuracy of the radius vector method is already proved. the method requires initial guess to start the method. In order to compromise the limitation of the present method and the radius vector method, the method has been connected to the radius vector method. The efficiency of the present optimal blank design method has been verified with some chosen examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.386-386
• /
• 2000

Cell mapping is a powerful computational technique for analyzing the global behavior of nonlinear dynamic systems. It simplifies the task of analyzing a continuous phase space by partitioning it into a finite number of disjoint cells and approximating system trajectories as cell transitions. A cell map for the system is then constructed based on the allowable control actions. Next search algorithms are employed to identify the optimal or near-optimal sequence(s) of control actions required to drive the system from each cell to the target cell by an "unravelling algorithm." Errors resulting from the cell center-point approximation could be reduced and eliminated by fuzzifying the bonders of cells. The dynamic system control method based on the cell mapping has been demonstrated for a motor control problem.l problem.

• Communications of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.421-436
• /
• 2024

In this article, we propose a shrinking projection algorithm for solving a finite family of generalized equilibrium problem which is also a fixed point of a nonexpansive mapping in the setting of Hadamard manifolds. Under some mild conditions, we prove that the sequence generated by the proposed algorithm converges to a common solution of a finite family of generalized equilibrium problem and fixed point problem of a nonexpansive mapping. Lastly, we present some numerical examples to illustrate the performance of our iterative method. Our results extends and improve many related results on generalized equilibrium problem from linear spaces to Hadamard manifolds. The result discuss in this article extends and complements many related results in the literature.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.2
• /
• pp.307-332
• /
• 2024

Two inertial extragradient-type algorithms are introduced for solving convex pseudomonotone variational inequalities with fixed point problems, where the associated mapping for the fixed point is a 𝜌-demicontractive mapping. The algorithm employs variable step sizes that are updated at each iteration, based on certain previous iterates. One notable advantage of these algorithms is their ability to operate without prior knowledge of Lipschitz-type constants and without necessitating any line search procedures. The iterative sequence constructed demonstrates strong convergence to the common solution of the variational inequality and fixed point problem under standard assumptions. In-depth numerical applications are conducted to illustrate theoretical findings and to compare the proposed algorithms with existing approaches.

• Investigative Magnetic Resonance Imaging
• /
• v.24 no.3
• /
• pp.141-153
• /
• 2020

Purpose: Myocardial T1 and T2 relaxation times are affected by technical factors such as cardiovascular magnetic resonance platform/vendor. We aimed to validate T1 and T2 mapping sequences using a phantom; establish reference T1, T2, and extracellular volume (ECV) measurements using two sequences at 3T in normal Koreans; and compare the protocols and evaluate the differences from previously reported measurements. Materials and Methods: Eleven healthy subjects underwent cardiac magnetic resonance imaging (MRI) using 3T MRI equipment (Verio, Siemens, Erlangen, Germany). We did phantom validation before volunteer scanning: T1 mapping with modified look locker inversion recovery (MOLLI) with 5(3)3 and 4(1)3(1)2 sequences, and T2 mapping with gradient echo (GRE) and TrueFISP sequences. We did T1 and T2 mappings on the volunteers with the same sequences. ECV was also calculated with both sequences after gadolinium enhancement. Results: The phantom study showed no significant differences from the gold standard T1 and T2 values in either sequence. Pre-contrast T1 relaxation times of the 4(1)3(1)2 protocol was 1142.27 ± 36.64 ms and of the 5(3)3 was 1266.03 ± 32.86 ms on the volunteer study. T2 relaxation times of GRE were 40.09 ± 2.45 ms and T2 relaxation times of TrueFISP were 38.20 ± 1.64 ms in each. ECV calculation was 24.42% ± 2.41% and 26.11% ± 2.39% in the 4(1)3(1)2 and 5(3)3 protocols, respectively, and showed no differences at any segment or slice between the sequences. We also calculated ECV from the pre-enhancement T1 relaxation time of MOLLI 5(3)3 and the post-enhancement T1 relaxation time of MOLLI 4(1)3(1)2, with no significant differences between the combinations. Conclusion: Using phantom-validated sequences, we reported the normal myocardial T1, T2, and ECV reference values of healthy Koreans at 3T. There were no statistically significant differences between the sequences, although it has limited statistical value due to the small number of subjects studied. ECV showed no significant differences between calculations based on various pre- and post-mapping combinations.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.361-378
• /
• 2020

The most apparent aspect of the present study is to introduce a new sequence space 𝚽^⋆(𝓛_p) derived by double Euler-Totient matrix operator. We examine its topological and algebraic properties and give an inclusion relation. In addition to those, the α-, β(bp)- and γ-duals of the space 𝚽^⋆(𝓛_p) are determined and finally, some 4-dimensional matrix mapping classes related to this space are characterized.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.725-742
• /
• 1996

In this paper we give some sharp expressions of the weakly convergent sequence coefficient WCS(X) of a Banach space X. They are used to prove fixed point theorems for involution mappings T from a weakly compact convex subset C of a Banach space X with WCS(X) > 1 into itself which $T^2$ are both of asymptotically nonexpansive type and weakly asymptotically regular on C. We also show that if X satisfies the semi-Opial property, then every nonexpansive mapping $T : C \to C$ has a fixed point. Further, some questions for asymtotically nonexpansive mappings are raised.

• Korean Journal of Veterinary Service
• /
• v.27 no.1
• /
• pp.103-109
• /
• 2004

Babesia equi ema-1 5' intergenic(IG) nucleotide was PCR amplified and analyzed for restriction sites in order to identify a promoter region in this IG nucleotide sequence. B equi ema-1 5' IG specific primers identified a 1268 bp PCR product. The sequence had restriction sites for 34 restriction enzymes when analyzed by a computer program. Among them, 26 enzymes had only one restriction site, but the others had more than one sites. When four restriction enzymes (Bgll , HindⅢ, Kpn1 and BamH1) were treated to digest the 1268 bp nucleotide, they had restriction sites as expected by the computer program. Information of restriction sites in the 1268 bp IG nucleotide will be applied to select restriction enzymes for cloning the IG nucleotide to a vector.