• Title/Summary/Keyword: modified scheme

Search Result 1,089, Processing Time 0.031 seconds

Modified Scheme for Tsunami Propagation with Variable Water Depths

  • Ha, Tae-Min;Seo, Kyu-Hak;Kim, Ji-Hun;Cho, Yong-Sik
    • Journal of Korea Water Resources Association
    • /
    • v.44 no.6
    • /
    • pp.471-476
    • /
    • 2011
  • In this study, a modified dispersion-correction scheme describing tsunami propagation on variable water depths is proposed by introducing additional terms to the previous numerical scheme. The governing equations used in previous tsunami propagation models are slightly modified to consider the effects of a bottom slope. The numerical dispersion of the proposed model replaces the physical dispersion of the governing equations. Then, the modified scheme is employed to simulate tsunami propagation on variable water depths and numerical results are compared with those of the previous tsunami propagation model.

Enhancements of the Modified PCF in IEEE 802.11 WLANs

  • Kanjanavapastit Apichan;Landfeldt Bjorn
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.313-324
    • /
    • 2005
  • The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

Improving the Performance of TCP/RLP over CDMA Forward Link (CDMA 순방향 무선링크에서의 TCP/RLP 성능 향상에 관한 연구)

  • 송기영;박영근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.369-380
    • /
    • 2003
  • In the CDMA wireless link, frame errors are correlated and burst because of fading. The implementation ability of RLP error recovery is dependent on the correlated frame errors. The (1,2,3) retransmission scheme, which is recommended as default in IS-707, is not adapted in high frame loss regime with strong correlations. By using the modified error recovery method, where the total number of retransmission attempts is the same and the retransmission is increased, the proposed retransmission scheme can efficiently recover frame errors than the (1,2,3) retransmission scheme. Since the modified scheme has longer transmission delay due to the increase of retransmission round, we propose the algorithm of retransmission failure prediction to improve the modified error recovery scheme. We simulate the modified error recovery scheme applying our algorithm and compare two schemes. (i.e. default scheme by IS-707 and modified scheme) not applying our algorithm. In the result, we show TCP performance improvement is better than default scheme by IS-707.

An Imprevement of the Approximate-Factorization Scheme and Its Application to the Analysis of Incompressible Viscous Flows (근사인자화법의 개량과 비압축성 유동해석에의 응용)

  • 신병록
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.8
    • /
    • pp.1950-1963
    • /
    • 1995
  • A modification of the approximate-factorization method is made to accelerate the convergency rate and to take sufficiently large Courant number without loss of accuracy. And a stable implicit finite-difference scheme for solving the incompressible Navier-Stokes equations employed above modified method is developed. In the present implicit scheme, the volume fluxes with contravariant velocity components and the pressure formulation in curvilinear coordinates is adopted. In order to satisfy the continuity condition completely and to remove spurious errors for the pressure, the Navier-Stokes equations are solved by a modified SMAC scheme using a staggered gird. The upstream-difference scheme such as the QUICK scheme is also employed to the right hand side. The implicit scheme is unconditionally stable and satisfies a diagonally dominant condition for scalar diagonal linear systems of implicit operator on the left hand side. Numerical results for some test calculations of the two-dimensional flow in a square cavity and over a backward-facing step are obtained using both usual approximate-factorization method and the modified one, and compared with each other. It is shown that the present scheme allows a sufficiently large Courant number of O(10$^{2}$) and reduces the computing time.

Satellite Attitude Control with a Modified Iterative Learning Law for the Decrease in the Effectiveness of the Actuator

  • Lee, Ho-Jin;Kim, You-Dan;Kim, Hee-Seob
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.11 no.2
    • /
    • pp.87-97
    • /
    • 2010
  • A fault tolerant satellite attitude control scheme with a modified iterative learning law is proposed for dealing with actuator faults. The actuator fault is modeled to reflect the degradation of actuation effectiveness, and the solar array-induced disturbance is considered as an external disturbance. To estimate the magnitudes of the actuator fault and the external disturbance, a modified iterative learning law using only the information associated with the state error is applied. Stability analysis is performed to obtain the gain matrices of the modified iterative learning law using the Lyapunov theorem. The proposed fault tolerant control scheme is applied to the rest-to-rest maneuver of a large satellite system, and numerical simulations are performed to verify the performance of the proposed scheme.

A spent nuclear fuel source term calculation code BESNA with a new modified predictor-corrector scheme

  • Duy Long Ta ;Ser Gi Hong ;Dae Sik Yook
    • Nuclear Engineering and Technology
    • /
    • v.54 no.12
    • /
    • pp.4722-4730
    • /
    • 2022
  • This paper introduces a new point depletion-based source term calculation code named BESNA (Bateman Equation Solver for Nuclear Applications), which is aimed to estimate nuclide inventories and source terms from spent nuclear fuels. The BESNA code employs a new modified CE/CM (Constant Extrapolation - Constant Midpoint) predictor-corrector scheme in depletion calculations for improving computational efficiency. In this modified CE/CM scheme, the decay components leading to the large norm of the depletion matrix are excluded in the corrector, and hence the corrector calculation involves only the reaction components, which can be efficiently solved with the Talyor Expansion Method (TEM). The numerical test shows that the new scheme substantially reduces computing time without loss of accuracy in comparison with the conventional scheme using CRAM (Chebyshev Rational Approximation Method), especially when the substep calculations are applied. The depletion calculation and source term estimation capability of BESNA are verified and validated through several problems, where results from BESNA are compared with those calculated by other codes as well as measured data. The analysis results show the computational efficiency of the new modified scheme and the reliability of BESNA in both isotopic predictions and source term estimations.

Modification of QUICK Scheme for Unstructured Grid Finite Volume Method (비정렬 유한체적법을 위한 QUICK법의 수정)

  • Kang, Dong Jin;Bae, Sang Soo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.9
    • /
    • pp.1148-1156
    • /
    • 2000
  • The QUICK scheme for convection terms is modified for unstructured finite volume method by using linear reconstruction technique and validated through the computation of two well defined laminar flows. It uses two upstream grid points and one downstream grid point in approximating the convection terms. The most upstream grid point is generated by considering both the direction of flow and local grid line. Its value is calculated from surrounding grid points by using a linear construction method. Numerical error by the modified QUICK scheme is shown to decrease about 2.5 times faster than first order upwind scheme as grid size decreases. Computations are also carried out to see effects of the skewness and irregularity of grid on numerical solution. All numerical solutions show that the modified QUICK scheme is insensitive to both the skewness and irregularity of grid in terms of the accuracy of solution.

Satellite Fault Detection and Isolation Scheme with Modified Adaptive Fading EKF

  • Lim, Jun Kyu;Park, Chan Gook
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.4
    • /
    • pp.1401-1410
    • /
    • 2014
  • This paper presents a modified adaptive fading EKF (AFEKF) for sensor fault detection and isolation in the satellite. Also, the fault detection and isolation (FDI) scheme is developed in three phases. In the first phase, the AFEKF is modified to increase sensor fault detection performance. The sensor fault detection and sensor selection method are proposed. In the second phase, the IMM filer with scalar penalty is designed to detect wherever actuator faults occur. In the third phase of the FDI scheme, the sub-IMM filter is designed to identify the fault type which is either the total or partial fault. An important feature of the proposed FDI scheme can decrease the number of filters for detecting sensor fault. Also, the proposed scheme can classify fault detection and isolation as well as fault type identification.

Applied to Satellite Network of Modified Diffie-Hellman Scheme (Diffie-Hellman 방법의 위성망에서의 응용)

  • Park, Jeong-Hyun;Lee, Sang-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.6 no.3
    • /
    • pp.23-30
    • /
    • 1996
  • This paper presented a key distribution scheme based on the Yacobi scheme that does not use the secret key provided by key distribution center as a power, but uses instead a random number generated by the user. The scheme is independent of the exposure of the secret key. Then this paper described modified Diffie-Hellman schemes based on the discrete logarithm and prime resolution into factors. The modified DH scheme was applied to point-to-multicasting, and broadcasting networks via satellite.

Design of Viterbi Decoders Using a Modified Register Exchange Method (변형된 레지스터 교환 방식의 비터비 디코더 설계)

  • 이찬호;노승효
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.1
    • /
    • pp.36-44
    • /
    • 2003
  • This paper proposes a Viterbi decoding scheme without trace-back operations to reduce the amount of memory storing the survivor path information, and to increase the decoding speed. The proposed decoding scheme is a modified register exchange scheme, and is verified by a simulation to give the same results as those of the conventional decoders. It is compared with the conventional decoding schemes such as the trace-back and the register exchange scheme. The memory size of the proposed scheme is reduced to 1/(5 x constraint length) of that of the register exchange scheme, and the throughput is doubled compared with that of the trace-back scheme. A decoder with a code rate of 2/3, a constraint length, K=3 and a trace-back depth of 15 is designed using VHDL and implemented in an FPGA. It is also shown that the modified register exchange scheme can be applied to a block decoding scheme.