• 전산구조공학
• /
• 제4권2호
• /
• pp.103-110
• /
• 1991

컴퓨터의 제한된 코어메모리로 대형문제를 해결하기 위하여 디스크를 마치 메모리처럼 사용할 수 있는 가상 메모리 데이타베이스 기법을 개발하였다. 이 기법과 아울러 최대 가용코어메모리를 작동시키는 방식을 사용하여 유한요소 해석시 흔히 발생하는 스카이라인 형태로 저장된 대칭통산행예(Sparse Symmetric Matrix)에 대한 매우 효과적인 코어 내 및 코어 외 직립방정식의 해법을 개발하였다. 제안된 방법은 다른 코어 외 해법에 비해 알고리즘 및 코딩이 매우 간단하여 계산효율을 상당히 향상시켰다. 해석예에서는 제안된 방법을 사용하여 대규모 구조해석 문제를 메모리 용량이 작은 소형컴퓨터에서 대단히 효율적으로 해결하였음을 보여주었다.

• Structural Engineering and Mechanics
• /
• 제67권6호
• /
• pp.659-669
• /
• 2018

The Dynamic equations in the polar coordinates are drawn out using the MLPG method for the non-symmetric FG cylindrical shell. To simulate the mechanical properties of FGM, the nonlinear volume fractions for radial direction are used. The shape function applied in this paper is a form of the radial basis functions, by using this function all the requirements for an effective and suitable shape function are established. Hence in this study, the multiquadrics (MQ) radial basis functions are exploited as the shape function governing the problem. The MLPG method is combined with the the Newmark time approximation scheme to solve dynamic equations in the time domain. The obtained results by the MLPG method to be verified are compared with the analytical solution and the FEM. The obtained results through the MLPG method show a good agreement in comparison to other results and the MLPG method has high accuracy for dynamic analysis of the non-symmetric FG cylindrical shell. To demonstrate the capability of the present method to dynamic analysis of the non-symmetric FG cylindrical shell, it is analyzed dynamically with different volume fraction exponents under harmonic and rectangular shock loading. The present method shows high accuracy, efficiency and capability to dynamic analysis of the non-symmetric FG cylindrical shell with nonlinear grading patterns.

• Journal of Magnetics
• /
• 제18권2호
• /
• pp.130-134
• /
• 2013

Most electrical machines like motor, generator and transformer are symmetric in terms of magnetic field distribution and mechanical structure. In order to analyze these problems effectively, many coupling techniques have been introduced. This paper deals with a coupling scheme for open boundary problem of symmetric and periodic structure. It couples an analytical solution of Fourier series expansion with the standard finite element method. The analytical solution is derived for the magnetic field in the outside of the boundary, and the finite element method is for the magnetic field in the inside with source current and magnetic materials. The main advantage of the proposed method is that it retains sparsity and symmetry of system matrix like the standard FEM and it can also be easily applied to symmetric and periodic problems. Also, unknowns of finite elements at the boundary are coupled with Fourier series coefficients. The boundary conditions are used to derive a coupled system equation expressed in matrix form. The proposed algorithm is validated using a test model of a bush bar for the power supply. And the each result is compared with analytical solution respectively.

• Journal of information and communication convergence engineering
• /
• 제21권2호
• /
• pp.103-109
• /
• 2023

We investigated the antipodal-symmetric dispersion maps of a dispersion-managed link with a midway optical phase conjugator to compensate for the distorted 960 Gb/s wavelength division multiplexed (WDM) signal caused by these effects. The proposed antipodal-symmetric dispersion map has various shapes depending on the detailed design scheme. We confirmed that the dispersion-managed link designed with the dispersion map of the antipodal-symmetric structure is more advantageous than the conventional uniform dispersion map for compensating WDM channels. It was also confirmed that among the antipodal-symmetric structures, the dispersion map configured with the S-1-profile, in which S is inverted up and down, was more effective for distortion compensation than the dispersion map configured with the S-profile. In particular, we confirmed that the S-1-profile can broaden the optical pulse width intensively at a short transmission distance, more effectively compensating for the distorted WDM channel. Because this structure makes the intensity of the optical pulse relatively weak, it can decrease the nonlinear Kerr effect.

• ETRI Journal
• /
• 제36권4호
• /
• pp.537-544
• /
• 2014

In this paper, we present a new inter-carrier interference (ICI) self-cancellation scheme - namely, ISC scheme - for orthogonal frequency-division multiplexing systems to reduce the ICI generated from phase noise (PHN) and residual frequency offset (RFO). The proposed scheme comprises a new ICI cancellation mapping (ICM) scheme at the transmitter and an appropriate method of combining the received signals at the receiver. In the proposed scheme, the transmitted signal is transformed into a real signal through the new ICM using the real property of the transmitted signal; the fast-varying PHN and RFO are estimated and compensated. Therefore, the ICI caused by fast-varying PHN and RFO is significantly suppressed. We also derive the carrier-to-interference power ratio (CIR) of the proposed scheme by using the symmetric conjugate property of the ICI weighting function and then compare it with those of conventional schemes. Through simulation results, we show that the proposed ISC scheme has a higher CIR and better bit error rate performance than the conventional schemes.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.107-119
• /
• 2013

본 논문에서는 이동성을 지원하는 NEMO(NEwork MObility)와 네트워크 기반의 PMIPv6(Proxy Mobile IPv6)가 결합된 유 무선 통합 네트워크 환경에서 보안을 강화하고 암호계산과 인증지연 비용을 줄이는 가벼운 키 베이스의 $SK-L^2AS$(Symmetric Key-Based Light-Local Authentication Scheme)인증기법을 제안한다. 또한 PMIPv6에서 핸드오버 지연 단축을 위해 빠른 핸드오버 기법을 적용하였고, 지원되지 않는 전역 이동성을 지원하기 위해 X-FPMIPv6(eXtension of Fast Handover for PMIPv6)으로 확장 개선하였다. 더불어, 인증과 시그널링의 신호 부담을 줄이기 위해서 Piggybacks 방식을 적용하여 SK-L2AS과 X-FPMIPv6을 통합한 AX-FPMIPv6 (Authentication eXtension of Fast Handover for PMIPv6)을 제안한다. 본 논문에서 제안한 AX-FPMIPv6 기법은 성능분석 결과 인증과 핸드오버 지연에서 기존 기법에 비해 성능이 우수하다는 것을 보여준다.

• 한국통신학회논문지
• /
• 제40권10호
• /
• pp.2014-2025
• /
• 2015

무선 센서 네트워크는 특정 지역의 정보를 수집하거나 상태를 관찰하는 등의 특수한 목적을 가진 네트워크이다. 이를 위해, 센서 네트워크는 이벤트를 감지하고 정보를 전달하는 센서 노드와, 센서 노드로부터 전달받은 정보를 수집하는 싱크노드로 구성되어 있고, 센서 노드가 싱크노드에게 단순히 비대칭적으로 정보를 전달하는 형태로 연구가 진행되어 왔다. 하지만, 센서 네트워크가 단순히 데이터를 수집하기보다는 이동성을 지닌 사물이나 사람과 같은 객체들이 정보를 주고받으며 서비스를 제공하는 사물인터넷, CPS 등과 같은 서비스로의 활용 범위가 늘어나고 있기 때문에, 지금까지의 일방적인 정보를 전달하는 형태 뿐 만아니라 센서 네트워크 위에서 이동 객체들이 서로 정보를 교환하는 상호 대칭적인 형태의 통신 방안이 필요하다. 즉, 변화되어가는 서비스 환경과 사용자의 요구사항에 따라 센서 네트워크 내의 이동 객체들 간에 정보를 직접 교환하는 대칭적인 형태로의 연구가 필요하다. 따라서 본 논문에서는 센서 네트워크 내에서 이동 객체 간의 상호 대칭적인 통신을 지원하는 프로토콜을 제안한다. 시뮬레이션을 통해 제안방안이 기존의 방법들에 비해 더 나은 에너지 효율성 및 전송 성공률을 가진다는 것을 증명한다.

• 한국멀티미디어학회논문지
• /
• 제18권11호
• /
• pp.1332-1341
• /
• 2015

This paper proposes a novel reversible secret sharing scheme using AES algorithm in encrypted images. In the proposed scheme, a role of the dealer is divided into an image provider and a data hider. The image provider encrypts the cover image with a shared secret key and sends it to the dealer. The dealer embeds the secret data into the encrypted image and transmits encrypted shadow images to the corresponding participants. We utilize Galois polynomial arithmetic operation over 2⁸ and the coefficient of the higher-order term is fixed to one in order to prevent the overflow. In experimental results, we demonstrate that the PSNR is sustained close to 44dB and the embedding capacity is 524,288 bits.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.968-988
• /
• 2010

Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.