• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2019년도 학술발표회
• /
• pp.148-148
• /
• 2019

The 2006 Millennium Ecosystem Assessment (MA) defines ecosystem services (ES) as "the benefits people obtain from ecosystems". Identifying where ES originates, whom it benefits and how it is changing over a period of time is critical in rapidly developing country like Nepal, where the risk of ES loss is high. In the context of various ecosystem services provided by watershed, this study, particularly deals with water yield, Soil loss and Carbon sequestration computation and evaluation in Bagmati Basin of Nepal. As Bagmati Basin incorporates capital city Kathmandu of nepal, land use change is significant over decades and mapping of ES is crucial for sustainable development of Basin in future. In this regard, the objectives of this study are 1) To compute the total and sub-watershed scale water yield of the basin, 2) Computation of soil loss and sediment retention in the basin, and 3) Computation of carbon sequestration in the basin. Integrated Valuation of Environmental Services and Tradeoffs (InVEST), a popular model for ecosystem service assessment based on Budyko hydrological method is used to compute Ecosystem services. The scenario of ES in two periods of time can be referenced for various approaches of prioritization and incorporation of their value into local and regional decision making for management of basin.

• 대한조선학회논문집
• /
• 제31권3호
• /
• pp.87-99
• /
• 1994

Reynolds Averaged Navier-Stokes 방정식을 수치해석하여 Wigley 선형 주위의 난류유동을 계산하였다. 정규격자상에서 공간의 이산화는 2차 정도의 유한차분법을, 시간의 적분에는 4단계 Runge-kutta법을 이용하였다. 시간 증분을 크게 하기 위하여 Jameson의 잔류항 평균 기법을 사용하였다. 압력 Poisson 방정식으로부터 압력장을 구하였고 난류닫음 조건을 만족시키기 위하여 Baldwin-Lomax의 난류 모형을 사용하였다. 수치계산은 레이놀드수가 $4.5{\times}10^6$에서 수행하였고 계산된 속도와 압력분포는 실험 결과와 비교적 잘 일치하는 것을 확인하였다.

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

Pedestrian detection (PD) is an essential task in various applications and sliding window-based methods utilizing HOG (Histogram of Oriented Gradients) or HOG-like descriptors have been shown to be very effective for accurate PD. However, due to exhaustive search across images, PD methods based on sliding window usually require heavy computational time. In this paper, we propose a real-time PD method for embedded visual surveillance with fixed backgrounds. The proposed PD method employs HOG descriptors as many PD methods does, but utilizes selective search so that it can save processing time significantly. The proposed selective search is guided by restricting searching to candidate regions extracted from Adaptive Gaussian Mixture Model (AGMM)-based background subtraction technique. Moreover, approximate computation of HOG descriptor and implementation in fixed-point arithmetic mode contributes to reduction of processing time further. Possible accuracy degradation due to approximate computation is compensated by applying an appropriate one among three offline trained SVM classifiers according to sizes of candidate regions. The experimental results show that the proposed PD method significantly improves processing speed without noticeable accuracy degradation compared to the original HOG-based PD and HOG with cascade SVM so that it is a suitable real-time PD implementation for embedded surveillance systems.

• Communications for Statistical Applications and Methods
• /
• 제4권1호
• /
• pp.229-241
• /
• 1997

We consider discrimination curve and minimum dwell time for Poisson distribution and Poisson-power function distribution. Let the random variable X has Poisson distribution with mean .lambda.. For the hypothesis testing H$\_$0/:.lambda. = t vs. H$\_$1/:.lambda. = d (d$\_$0/ if X.leq.c. Since a critical value c can not be determined to satisfy both types of errors .alpha. and .beta., we considered discrimination curve that gives the maximum d such that it can be discriminated from t for a given .alpha. and .beta.. We also considered an algorithm to compute the minimum dwell time which is needed to discriminate at the given .alpha. and .beta. for the Poisson counts and proved its convergence property. For the Poisson-power function distribution, we reject H$\_$0/ if X.leq..'{c}.. Since a critical value .'{c}. can not be determined to satisfy both .alpha. and .beta., similar to the Poisson case we considered discrimination curve and computation algorithm to find the minimum dwell time for the Poisson-power function distribution. We prosent this algorithm and an example of computation. It is found that the minimum dwell time algorithm fails for the Poisson-power function distribution if the aiming error variance .sigma.$\^$2/$\_$2/ is too large relative to the variance .sigma.$\^$2/$\_$1/ of the Gaussian distribution of intensity. In other words, if .ell. is too small, we can not find the minimum dwell time for a given .alpha. and .beta..

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2532-2537
• /
• 2005

FIR(Finite Impulse Response) filter is well known to be ideal for the finite time state-space model, but it requires much computation due to its inherent non-recursive structure especially when the measurement interval grows to a large extent. And often a fixed-lag smoother based on the finite time interval is needed to monitor the soundness of the system model and the measurement model, but the computation burden of FIR-type smoother imposes much restriction of its usage for real-time application. Conventional recursive forms of FIR estimator[1]-[4] could not be used for real time applications, since they are numerically unstable in their recursive equations. To cope with this problem, we suggest a stable recursive form FIR estimator(SRFIR) and its usefulness is demonstrated for designing the real-time fixed-lag smoother on the finite time window through an example of detection of rate bias in the anti-aircraft gun fire control system.

• 대한기계학회논문집B
• /
• 제29권5호
• /
• pp.609-616
• /
• 2005

While the SIMPLE algorithm is most widely used for the simulations of flow phenomena that take place in the industrial equipments or the manufacturing processes, it is less adopted for the simulations of the free surface flow. Though the SIMPLE algorithm is free from the limitation of time step, the free surface behavior imposes the restriction on the time step. As a result, the explicit schemes are faster than the implicit scheme in terms of computation time when the same time step is applied to, since the implicit scheme includes the numerical method to solve the simultaneous equations in its procedure. If the computation time of SIMPLE algorithm can be reduced when it is applied to the unsteady free surface flow problems, the calculation can be carried out in the more stable way and, in the design process, the process variables can be controlled based on the more accurate data base. In this study, a modified SIMPLE algorithm is presented fur the free surface flow. The broken water column problem is adopted for the validation of the modified algorithm (MoSIMPLE) and for comparison to the conventional SIMPLE algorithm.

• Journal of Mechanical Science and Technology
• /
• 제15권8호
• /
• pp.1090-1096
• /
• 2001

In this paper, new methods for efficiently solving linear acceleration equations of multibody dynamic simulation exploiting sparsity for real-time simulation are presented. The coefficient matrix of the equations tends to have a large number of zero entries according to the relative joint coordinate numbering. By adequate joint coordinate numbering, the matrix has minimum off-diagonal terms and a block pattern of non-zero entries and can be solved efficiently. The proposed methods, using sparse Cholesky method and recursive block mass matrix method, take advantages of both the special structure and the sparsity of the coefficient matrix to reduce computation time. The first method solves the η$\times$η sparse coefficient matrix for the accelerations, where η denotes the number of relative coordinates. In the second method, for vehicle dynamic simulation, simple manipulations bring the original problem of dimension η$\times$η to an equivalent problem of dimension 6$\times$6 to be solved for the accelerations of a vehicle chassis. For vehicle dynamic simulation, the proposed solution methods are proved to be more efficient than the classical approaches using reduced Lagrangian multiplier method. With the methods computation time for real-time vehicle dynamic simulation can be reduced up to 14 per cent compared to the classical approach.

• 대한기계학회논문집A
• /
• 제25권3호
• /
• pp.486-494
• /
• 2001

This paper presents a real-time multibody vehicle dynamic analysis method using recursive Kanes formulation and suspension composite joints. To shorten the computation time of simulation, relative coordinate system is used and the equations of motion are derived using recursive Kanes formulation. Typical suspension systems of vehicles such as MacPherson strut suspension system is modeled by suspension composite joints. The joints are derived and utilized to reduce the computation time of simulation without any degradation of kinematical accuracy of the suspension systems. Using the develop program, a multibody vehicle dynamic model is formed and simulations are performed. Accuracy of the simulation results is compared to the real vehicle field test results. It is found that the simulation results using the proposed method are very accurate and real-time simulation is achieved on a computer with single PowerPC 604 processor.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권2호
• /
• pp.184-194
• /
• 2016

In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2003년도 하계학술발표회
• /
• pp.60-61
• /
• 2003

A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.