• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.5
• /
• pp.27-38
• /
• 1994

An inversion technique, by using an improved Born inversion and an iterativeprocess in cross borehole structure, is suggested to reconstruct relative permittivity rofiles of cylindrical scatterer. The degraded image resulting from the violation of the Born conditionand the restriction of measured structure is an improved by improved Borninversion and an iterative rocess,respectively. The simulation results show that this inversion technique give betterreconstruction of original rofile distribution than a conventional Bornor an improved Born technique.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.159-166
• /
• 2012

Many biometrics-based user authentication schemes using smart cards have been proposed to improve the security weaknesses in user authentication system. In 2010, Chang et al. proposed an improved biometrics-based user authentication scheme without concurrency system which can withstand forgery attack, off-line password guessing attack, replay attack, etc. In this paper, we analyze the security weaknesses of Chang et al.'s scheme and we have shown that Chang et al.'s scheme is still insecure against man-in-the-middle attack, off-line biometrics guessing attack, and does not provide mutual authentication between the user and the server. And we proposed the improved scheme to overcome these security weaknesses, even if the secret information stored in the smart card is revealed. As a result, the proposed scheme is secure for the user authentication attack, the server masquerading attack, the man-in-the-middle attack, and the off-line biometrics guessing attack, does provide the mutual authentication between the user and the remote server. And, in terms of computational complexities, the proposed scheme is more effective than Chang et al.'s scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.33-40
• /
• 2010

Recently Yoon et al. proposed the remote user authentication scheme using smart cards. But their scheme has not satisfied security requirements which should be considered in the user authentication scheme using the password based smart card. In this paper, we prove that Yoon et al.'s scheme is vulnerable to a password guessing attack in case that the attacker steals the user's smart card and extracts the information from the smart card. Accordingly, we propose the improved user authentication scheme based on the hash function and random nonce that can withstand various possible attacks including a password guessing attack. The result of comparative analysis demonstrates that the our proposed scheme is much more secure and efficient than the Yoon et al.'s scheme, with a trivial trade-off to require just a few more exclusive-OR operations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.373-379
• /
• 2001

There is a big issue to generate 3D hexahedral finite element (FE) model, since a process to divide the whole domain into several simple-shaped sub-domains is required before generating a continuous mesh with mapped mesh generators. In general, it is nearly impossible to set up proper division numbers interactively to keep mesh connectivity between sub-domains on a complicated arbitrary-shaped domain. If mesh continuity between sub-domains is not required in an analysis, this complicated process can be omitted. Element-free Galerkin method (EFGM) can accept discontinuous meshes, which only requires nodal information. However it is difficult to choose a reasonable influenced domain in moving least squares scheme with non-uniformly distributed nodes in discontinuous FE models. A new FE scheme fur discontinuous mesh is proposed in this paper by applying improved EFGM with some modification to derive FE approximated function in discontinuous parts. Its validity is evaluated on linear elastic problems.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.900-903
• /
• 2002

This paper proposes the use of wavelet packet transform in a transform based video coding scheme, which is mainly used in low/very low bit-rate video coding schemes i.e. H.263 standard. In the experiments, the discrete cosine transform in the video coding scheme is replaced by the wavelet packet transform, and the improved performance in term of peak signal to noise ratio is measured and compared with the results obtained from the coding scheme implementing the ordinary wavelet transform. The experimental results show an impressive improvement obtained from the use of wavelet packet transform.

• International Journal of Contents
• /
• v.4 no.1
• /
• pp.16-19
• /
• 2008

In this paper, we propose to new dispatcher method, which doesn't depend on an operating system of the server, and the direct routing method, by which a server answers a client's request at first hand. And, propose new web clustering scheme based on the contents on the web where web servers composed of cluster, with each different contents, answer client's request. The other purposes are to reduce overhead of the dispatcher through load balance, and to minimize the time to take in responding to a client's request. The performance of new web cluster scheme was improved by about 39% than that of the existing RR method. It was identified that the performance of the proposed web cluster method was extraordinary improved comparing with that of the existing RR method as a whole.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1964-1981
• /
• 2014

An improved Mean-Shift (MS) tracker called joint CB-LBWH, which uses a combined weighted-histogram scheme of CBWH (Corrected Background-Weighted Histogram) and LBWH (likelihood-based Background-Weighted Histogram), is presented. Joint CB-LBWH is based on the notion that target representation employs both feature saliency and confidence to form a compound weighted histogram criterion. As the more prominent and confident features mean more significant for tracking the target, the tuned histogram by joint CB-LBWH can reduce the interference of background in target localization effectively. Comparative experimental results show that the proposed joint CB-LBWH scheme can significantly improve the efficiency and robustness of MS tracker when heavy occlusions and complex scenes exist.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.219-227
• /
• 2005

Since multicast in the mobile environments is based on packet transmission and independent addressing, this paper propose an improved scheme about how to manage the multicasting group and to set the communication path in the mobile environment by applying two-level addressing mode, which is similar to mobile IP, for location-independent address setting. And we propose the smooth handoff scheme that minimizes the handoff delay for mobile multimedia services. Performance analysis by the modified NS-2 network simulator has showed that the proposed scheme is better than other techniques in terms of handoff delay and transmitted packets' throughput.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.4
• /
• pp.223-228
• /
• 2014

It is known that a belief propagation algorithm is a fast decoding scheme for LT codes but it require a large overhead, especially for a short block length LT codes. In this paper an improved belief decoding algorithm using searching method for degree-1 packets is proposed for a small overhead. The proposed decoding scheme shows the desirable performance in terms of overhead while guaranteeing the same computational complexity with respect to the conventional BP decoding scheme.