• Nuclear Engineering and Technology
• /
• 제43권6호
• /
• pp.531-546
• /
• 2011

The backward differentiation formula (BDF) method is applied to a three-dimensional reactor kinetics calculation for efficient yet accurate transient analysis with adaptive time step control. The coarse mesh finite difference (CMFD) formulation is used for an efficient implementation of the BDF method that does not require excessive memory to store old information from previous time steps. An iterative scheme to update the nodal coupling coefficients through higher order local nodal solutions is established in order to make it possible to store only node average fluxes of the previous five time points. An adaptive time step control method is derived using two order solutions, the fifth and the fourth order BDF solutions, which provide an estimate of the solution error at the current time point. The performance of the BDF- and CMFD-based spatial kinetics calculation and the adaptive time step control scheme is examined with the NEACRP control rod ejection and rod withdrawal benchmark problems. The accuracy is first assessed by comparing the BDF-based results with those of the Crank-Nicholson method with an exponential transform. The effectiveness of the adaptive time step control is then assessed in terms of the possible computing time reduction in producing sufficiently accurate solutions that meet the desired solution fidelity.

• Structural Engineering and Mechanics
• /
• 제4권6호
• /
• pp.589-600
• /
• 1996

An explicit 4th order time integration scheme for solving the convection-diffusion equation is discussed in this paper. A system of ordinary differential equations are derived first by discretizing the spatial derivatives of the relevant PDE using the finite difference method. The integration of the ODEs is then carried out using a 4th order scheme and a self-adaptive technique based on the spatial grid spacing. For a non-uniform spatial grid, different time step sizes are used for the integration of the ODEs defined at different spatial points, which improves the computational efficiency significantly. A numerical example is also discussed in the paper to demonstrate the implementation and effectiveness of the method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.97-102
• /
• 2004

The very complicated proplem in spatial processing is effects of phading (Multipath and Delay Spread) and co-channel interference (CCI). The phading is one of principal causes, that form inter-symbol interference (ISI). Spatial-Temproral Adaptive Filter (STAF) has been taken as a solution of this problem, because it can suppress both these types of interference. But the performance of STAF exposes some elemental limitations, in which are the slow convergence of adaptive process and computational complexity. The cause of this is that, STAF must treat a large quantity of information in both space and time. The way that master these limitation is a use of Subband Spatial-Temproral Adaptive Filter (SSTAF). SSTAF reduce computational complexity by pruning off samples of signal and thus it lost some information in time. This draw on attennation of output SINR of SSTAF. The article analyse a optimal solution of this problem by introducing SSTAF with nonuniform weighted distribution.

• Structural Engineering and Mechanics
• /
• 제3권4호
• /
• pp.391-410
• /
• 1995

The application of adaptive finite element method to dynamic problems is investigated. Both the kinetic and strain energy errors induced by space and time discretization were estimated in a consistent manner and controlled by the simultaneous use of the adaptive mesh generation and the automatic time stepping. Also an optimal ratio of spatial discretization error to temporal discretization error was discussed. In this study it was found that the best performance can be obtained when the specified spatial and temporal discretization errors have the same value. Numerical examples are carried out to verify the performance of the procedure.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.419-423
• /
• 1996

These days, industrial robots are required to have high speed and high precision in doing various tasks. Recently, the adaptive control algorithms for those nonlinear robots have been developed. With spatial vector space, these adaptive algorithms including recursive implementation are simply described. Without sensing joint acceleration and computing the inversion of inertia matrix, these algorithms which include P.D. terms and feedforward terms have global tracking convergence. In this paper, the feasibility of the proposed control method is illustrated by applying to 2 DOF SCARA robot in DSP(Digital Signal Processing).

• 한국산학기술학회논문지
• /
• 제5권1호
• /
• pp.38-43
• /
• 2004

We designed and implemented a medical image query system, including a relational database and DBMS (database management system), which can visualize image data and can achieve spatial, attribute, and mixed queries. Image data used in querying can be visualized in slice, MPR(multi-planner reformat), volume rendering, and overlapping on the query system. To reduce spatial cost and processing time in the system. brain images are spatially clustered, by an adaptive Hilbert curve filling, encoded, and stored to its database without loss for spatial query. Because the query is often applied to small image regions of interest(ROI's), the technique provides higher compression rate and less processing time in the cases.

• 한국정보전자통신기술학회논문지
• /
• 제12권4호
• /
• pp.419-424
• /
• 2019

본 논문에서는 광대역 재밍 신호 환경에서 원하는 목표물을 추정하기 위한 알고리즘을 제안 한다. 재밍 신호를 억제하는 방법으로, 본 연구에서는 시공간적응 알고리즘과 QR분해를 사용하여 최적의 가중치를 획득한다. 시공간적응 알고리즘은 적응배열안테나시스템에서 탭 지연 신호에 복소 가중치를 곱하여 가중치를 생성하고, 역행렬로 인한 전력소모를 최소화하기 위해서 QR분해를 이용하여 최적의 가중치를 획득한다. 모의실험을 통하여, 본 연구에서 제안한 알고리즘과 기존 알고리즘의 성능을 비교 분석한다. [-40o,0o,+40o]의 목표물 추정에서 본 연구에서 제안 한 알고리즘이 3개의 목표물을 모두 추정하였지만 기존 알고리즘은 재밍 신호 때문에 [0o]에서만 추정하였다. 본 연구의 제안 알고리즘이 재밍 신호를 제거하고 원하는 목표물을 정확히 추정하여 성능이 향상되었음을 입증하였다.

• 한국광학회:학술대회논문집
• /
• 한국광학회 1989년도 제4회 파동 및 레이저 학술발표회 4th Conference on Waves and lasers 논문집 - 한국광학회
• /
• pp.103-106
• /
• 1989

A method of adaptive formation of the synthetic discriminant function(SDF) both in image plane and spatial frequency plane by using the Widrow-Hoff learning rule is proposed. The proposed method uses minimum number of interconnections between neurons so it can reduce the time for learning the neural net. Also complex valued interconnection weights are introduced for the purposes of handling the phase objects or Fourier transformed spatial frequency objects which usually have complex values for the representation of not only amplitude but also phase information. Also methods of optical implementation for the complex valued interconnection weights are discussed.

• ETRI Journal
• /
• 제28권6호
• /
• pp.697-708
• /
• 2006

Various adaptive mesh refinement techniques are often employed in numerical simulations for increasing spatial and temporal resolution beyond the limits imposed by available CPU time and memory space. Recently, an octree-based adaptive mesh structure was successfully used in fluid animation to place more grid cells efficiently in visually interesting regions of fluids. In an attempt to optimize the use of computational resources further in fluid animation, this paper extends this adaptive technique by modifying the mesh refinement scheme so that the camera's viewing properties are dynamically exploited during the simulation. Based on a simple adaptive mesh structure, we show that the new meshing strategy can save a substantial amount of computation time and memory space by using a view-dependent adaptive approach. The experimental results reveal that the proposed technique provides a good compromise between the computational effort and the simulation's fidelity, and may be used quite effectively in 3D animation production.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권10호
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.