• 한국수자원학회논문집
• /
• 제32권1호
• /
• pp.31-40
• /
• 1999

기존의 침투류 산정식들이 가지고 있는 근본적인 문제점에 대하여 고찰하고, 문제점을 개선하기 위한 방안으로 침투류에 대한 지수형 마찰계수 산정식을 개발하였다. 지수형 마찰계수 산정식의 개발은 여러 가지 무차원수를 이용하여 양해적으로 산정치를 구하는 것을 가능하게 하였다. 지수형 마찰계수 산정식의 개발을 위하여 기존연구자들의 실험자료를 재분석하였으며 개발된 산정식으로 침투류 간편설계가 가능하도록 유도하였다. 주어진 조건에 따라 설계유형을 수리경사, 유속 또는 유량 그리고 입경을 산정하는 세가지 경우로 구분하여 양해법 산정식을 개발하였다.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권9호
• /
• pp.1081-1087
• /
• 1999

Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권1호
• /
• pp.11-22
• /
• 2016

Clock skew scheduling is one of the essential steps to be carefully performed during the design process. This work addresses the clock skew optimization problem integrated with the consideration of the inter-dependent relation between the setup and hold times, and clock to-Q delay of flip-flops, so that the time margin is more accurately and reliably set aside over that of the previous methods, which have never taken the integrated problem into account. Precisely, based on an accurate flexible model of setup time, hold time, and clock-to-Q delay, we propose a stepwise clock skew scheduling technique in which at each iteration, the worst slack of setup and hold times is systematically and incrementally relaxed to maximally extend the time margin. The effectiveness of the proposed method is shown through experiments with benchmark circuits, demonstrating that our method relaxes the worst slack of circuits, so that the clock period ($T_{clk}$) is shortened by 4.2% on average, namely the clock speed is improved from 369 MHz~2.23 GHz to 385 MHz~2.33 GHz with no time violation. In addition, it reduces the total numbers of setup and hold time violations by 27.7%, 9.5%, and 6.7% when the clock periods are set to 95%, 90%, and 85% of the value of Tclk, respectively.

• Wind and Structures
• /
• 제22권3호
• /
• pp.349-368
• /
• 2016

A preconditioning technique is presented for a simultaneous solution to wind-membrane interaction. In the simultaneous equations, a linear elastic model was employed to deal with the fluid-structure data transfer at the interface. A Lagrange multiplier was introduced to impose the specified boundary conditions at the interface and strongly coupled simultaneous equations are derived after space and time discretization. An initial linear elastic model preconditioner and modified one were derived by treating the linearized elastic model equation as a saddle point problem, respectively. Accordingly, initial and modified fluid-structure interaction (FSI) preconditioner for the simultaneous equations were derived based on the initial and modified linear elastic model preconditioners, respectively. Wind-membrane interaction analysis by the proposed preconditioners, for two and three dimensional membranous structures respectively, was performed. Comparison was made between the performance of initial and modified preconditioners by comparing parameters such as iteration numbers, relative residuals and convergence in FSI computation. The results show that the proposed preconditioning technique greatly improves calculation accuracy and efficiency. The priority of the modified FSI preconditioner is verified. The proposed preconditioning technique provides an efficient solution procedure and paves the way for practical application of simultaneous solution for wind-structure interaction computation.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권6호
• /
• pp.634-646
• /
• 2015

Coarse-Grained Reconfigurable Architecture (CGRA) is a very promising platform that provides fast turn-around-time as well as very high energy efficiency for multimedia applications. One of the problems with CGRAs, however, is application mapping, which currently does not scale well with geometrically increasing numbers of cores. To mitigate the scalability problem, this paper discusses how to use the SIMD (Single Instruction Multiple Data) paradigm for CGRAs. While the idea of SIMD is not new, SIMD can complicate the mapping problem by adding an additional dimension of iteration mapping to the already complex problem of operation and data mapping, which are all interdependent, and can thus significantly affect performance through memory bank conflicts. In this paper, based on a new architecture called SIMD reconfigurable architecture, which allows SIMD execution at multiple levels of granularity, we present how to minimize bank conflicts considering all three related sub-problems, for various RA organizations. We also present data tiling and evaluate a conflict-free scheduling algorithm as a way to eliminate bank conflicts for a certain class of mapping problem.

• 한국통신학회논문지
• /
• 제37B권10호
• /
• pp.947-955
• /
• 2012

본 논문에서는 셀룰러 네트워크상의 간섭정렬을 위한 송수신벡터를 구하는 반복 알고리즘들을 제안한다. 기존의 간섭채널상의 간섭정렬을 위해 고안된 반복 알고리즘을 셀룰러 네트워크에 적용하는 것이 물론 가능하지만, 높은 합용량을 달성하려면 큰 반복횟수가 필요하다. 본 논문에서 제안된 알고리즘의 핵심은 상향링크의 송신벡터 그리고 하향링크의 수신벡터를 갱신할 때 셀내간섭을 고려하지 않는다는 점이다. 모의실험은 간섭정렬을 위해 다중안테나와 단일 반송파가 사용되었을 때, 제안된 알고리즘이 기존의 알고리즘보다 주어진 반복횟수에서 월등히 높은 합용량을 달성함을 보인다. 또한 제안된 알고리즘이 간섭정렬을 위해 단일 안테나와 다중 부반송파가 사용되었을 때도 기존 간섭정렬 알고리즘보다 성능이 우수함을 보인다.

• 설비공학논문집
• /
• 제5권3호
• /
• pp.187-197
• /
• 1993

In this study, the numerical analysis and experiments of the hot water storage using the thermal stratification techniques were carried out. The CPU time for a typical run of the the thermal stratification up to 900 seconds took one week for a $81{\times}31$ mesh size and 10 days for a $118{\times}31$ mesh size, respectively, for a cylindrical shape of the storage. In the initial stage, the numerical results were in favorable agreement with the experimental results, but it showed that the temperature gradients in the storage decreased gradually with time. It was also found that the increase of ${\delta}t$ decreased the convergent speed due to the intensive fluctuation of the velocity field in every iteration. The increase of numbers of grids is projected to forecast a more accurate result, but it made the computing time longer and woul slow down convergence. At the experiments of the flow visualization, it was confirmed that the thermal stratification was apparently built up due to the installation of diffuser at the lower part of the storage. Thus, the thermal performance of the storage could be improved by installing the diffusers at the inlet and outlet.

• Journal of Hydrospace Technology
• /
• 제1권1호
• /
• pp.29-40
• /
• 1995

This paper describes the procedure to predict steady and unsteady performances of a contrarotating propeller(CRP) by a mixed formulation of the boundary value problem(BVP) far the flow around a CRP. The blade BVP is treated by a classical vortex lattice method, whereas the hub BVP is solved by a potential-based panel method. Blades and trailing wakes are represented by a vortex and/or source lattice system, and hubs are represented by normal dipole and source distributions. Both forward and aft propellers are solved simultaneously, thus treating the interaction effect without iteration. The unsteady performance is computed directly in time domain. The new numerical procedure requires a large amount of storage and computing time, which is however no longer a limit in a modern computer system. Sample computations show that the steady performance compares very well with the experiments. The predicted unsteady behavior shows that the dominant harmonics of the total forces are multiples of not only the number of blades of the forward and aft propellers but also the product of both blade numbers. The magnitude of the latter harmonics, present also in uniform oncoming flow, may reach abort 50% of the mean torque for the aft propeller, which in turn may cause a serious vibration problem in the complicated contrarotating shafting system.

• 융합신호처리학회논문지
• /
• 제4권4호
• /
• pp.73-80
• /
• 2003

본 논문에서는 시간 다이버시티 효과를 증대시키는 새로운 터보 코드 형태인 ETD-터보 코드(Enhanced Time Diversity-turbo code)를 구성하고, 이를 MC-CDMA 시스템에 적용하여 그 효율성을 입증하였다. ETD-터보 코드는 기존의 터보 코드 구성에 인터리버를 추가하여 구성하고, 모든 패리티 비트가 인터리버 패턴을 갖게 되어 시간 다이버시티 효과가 증대된다. 시스템 성능분석을 위해 인터리버 조합에 따른 ETD-터보 코드의 특성을 비교하고, MC-CDMA 시스템에 채널 부호화 기법으로 기존의 터보 코드와 본 논문에서 제안한 ETD-터보 코드를 적용하여 시스템 성능을 분석한다. 그 결과 ETD-터보 코드는 기존의 터보 코드방식에 비해 비교적 단순한 인터리버 조합으로도 BER을 감소시키고, 반복 복호 횟수를 줄임으로써 복호과정에서의 시간지연을 감소시킬 수 있다. 따라서 ETD-터보 코드를 적용한 MC-CDMA의 전체 시스템 오율특성이 개선됨을 알 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1492-1511
• /
• 2013

A novel, chaotic map that is based on concatenated torus automorphisms is proposed in this paper. As we know, cat map, which is based on torus automorphism, is highly chaotic and is often used to encrypt information. But cat map is periodic, which decreases the security of the cryptosystem. In this paper, we propose a novel chaotic map that concatenates several torus automorphisms. The concatenated mechanism provides stronger chaos and larger key space for the cryptosystem. It is proven that the period of the concatenated torus automorphisms is the total sum of each one's period. By this means, the period of the novel automorphism is increased extremely. Based on the novel, concatenated torus automorphisms, two application schemes in image encryption are proposed, i.e., 2D and 3D concatenated chaotic maps. In these schemes, both the scrambling matrices and the iteration numbers act as secret keys. Security analysis shows that the proposed, concatenated, chaotic maps have strong chaos and they are very sensitive to the secret keys. By means of concatenating several torus automorphisms, the key space of the proposed cryptosystem can be expanded to $2^{135}$. The diffusion function in the proposed scheme changes the gray values of the transferred pixels, which makes the periodicity of the concatenated torus automorphisms disappeared. Therefore, the proposed cryptosystem has high security and they can resist the brute-force attacks and the differential attacks efficiently. The diffusing speed of the proposed scheme is higher, and the computational complexity is lower, compared with the existing methods.