• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.705-708
• /
• 2005

Mobile Mapping Systems using the vehicle equipped the GPS, IMU, CCD Cameras is the effective system for the management of the road facilities, update of the digital map, and etc. They must provide users with the sensor data which is acquired by Mobile Mapping Systems in real-time so that users can process what they want by using the latest data. But it' s not an easy process because the amount of sensor data is very large, particularly image data to be transmitted. So it is necessary to reduce the amount of image data so that it is transmitted effectively. In this study, the effective method was suggested for the compression/decompression image data using the Wavelet Transformation and Huffman Coding. This technique will be possible to transmit of the geographic information effectively such as position data, attitude data, and image data acquired by Mobile Mapping Systems in the wireless internet environment when data is transmitted in real-time.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1963-1969
• /
• 2017

In order to overcome the manufacturing difficulty of the transverse-flux permanent magnet linear motor (TFPMLM) and enhance its performance much better, a novel TFPMLM with E-core and 3 dimension (3D) magnetic structures is proposed in this paper. Firstly, its basic structure and operating principle are presented. Then the equivalent 2D configuration of the TFPMLM is transformed, so that the Schwarz-Christoffel (SC) mapping method can be used to analyze the motor. Furthermore, the air gap flux density distribution is solved by SC mapping method, based on which, the EMF waveform, no-load cogging force waveform and load force waveform are obtained. Finally, the prototyped TLPMLM is manufactured and the results are obtained from the experiment and 3D FEM, respectively, which are used to compare with those from SC mapping method.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.991-1002
• /
• 2011

An iterative algorithm is provided to find a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of some variational inequality in a Hilbert space. Using this result, we consider a strong convergence result for finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping. Our results include the previous results as special cases and can be viewed as an improvement and refinement of the previously known results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.

• Korean Journal of Mathematics
• /
• v.20 no.3
• /
• pp.361-369
• /
• 2012

We get a theorem which shows the existence of at least six solutions for the semilinear wave equation with nonlinearity crossing three eigenvalues. We obtain this result by the variational reduction method and the geometric mapping defined on the finite dimensional subspace. We use a contraction mapping principle to reduce the problem on the infinite dimensional space to that on the finite dimensional subspace. We construct a three-dimensional subspace with three axes spanned by three eigenvalues and a mapping from the finite dimensional subspace to the one-dimensional subspace.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.507-515
• /
• 2012

We investigate the number of the solutions for the elliptic boundary value problem. We obtain a theorem which shows the existence of six weak solutions for the elliptic problem with jumping nonlinearity crossing three eigenvalues. We get this result by using the geometric mapping defined on the finite dimensional subspace. We use the contraction mapping principle to reduce the problem on the infinite dimensional space to that on the finite dimensional subspace. We construct a three dimensional subspace with three axis spanned by three eigenvalues and a mapping from the finite dimensional subspace to the one dimensional subspace.

• Communications of the Korean Mathematical Society
• /
• v.18 no.2
• /
• pp.251-261
• /
• 2003

The purpose of this paper is to establish the necessary and sufficient conditions which ensure the strong convergence of the Ishikawa iterative schemes with errors to the unique fixed point of a $\Phi$-hemicontractive mapping defined on a nonempty convex subset of a normed linear space. The results of this paper extend substantially most of the recent results.

• Progress in Superconductivity and Cryogenics
• /
• v.18 no.2
• /
• pp.30-36
• /
• 2016

For the magnetic field analysis or design, it is important to know the behavior of the magnetic field in an interesting space. Magnetic field mapping becomes a useful tool for the study of magnetic field. In this paper, a numerical way for mapping the magnetic field within the cylindrical center volume of magnet is presented, based on the solution of the Laplace's equation in the cylindrical coordinate system. The expression of the magnetic field can be obtained by the magnetic flux density, which measured in the mapped volume. According to the form of the expression, the measurement points are arranged with the parallel cylindrical line (PCL) method. As example, the magnetic flux density generated by an electron cyclotron resonance ion source (ECRIS) magnet and a quadrupole magnet were mapped using the PCL method, respectively. The mapping results show the PCL arrangement method is feasible and convenience to map the magnetic field within a cylindrical center volume generated by the general magnet.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.312-316
• /
• 2010

Conformal mapping has been a familiar tool of science and engineering for generations. The methods of numerical mapping are usually classified into those which construct the map from standard domain such as the unit disk onto the 'problem domain', and those which construct the map in the reverse direction. We treat numerical conformal mapping from the unit disk onto the Jordan regions as the problem domain in this paper. The traditional standard methods of this type are based on Theodorsen integral equation. Wegmann's method is well known as a Newton-like efficient one for solving Theodorsen equation. An improved method for convergence by applying low frequency pass filter to the Wegmann's method was proposed. In this paper we propose an effective algorithm for numerical conformal mapping based on the improved method. This algorithm is able to determine the discrete numbers and initial values automatically in accordance with the given region and the required accuracy. This results come from analyzing the shape of given domain as seen in the Fourier Transform.