• Journal of Korea Water Resources Association
• /
• v.46 no.2
• /
• pp.139-153
• /
• 2013

For analyzing shallow-water flows over the uneven bottom, the HLLL scheme and the divergence form for bed slope source term (DFB) technique, respectively were applied to the flux gradient and the bottom gradient source terms in a finite-volume model for the shallow water equations. And also the model incorporated the volume/free-surface relationship (VFR) to consider the partially submerged cells (PSC). It was identified that a simpler version of the weighted surface-depth gradient method in the MUSCL was equivalent to the original one in the accuracy for 1D steady flows. It was verified that the flux gradient term and the bottom gradient source term were well-balanced exactly by the VFR for the 1D PSC. The VFR for the triangular PSC settled the problem which the governing equations were not well-balanced by the DFB technique for the 2D PSC. There were good agreements in simulations and experiments for 2D dam-break flows over a triangular sill and a round bump. In addition, the partial dam-break flow was successfully simulated for flooding of roughnesses in an irregular bottom as well as a sloping one. Therefore, this model is expected to be applied to the real river with uneven topography.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.3
• /
• pp.62-74
• /
• 2020

Although the government and local governments devote efforts to activate bicycles, they only access to the supply infrastructure such as bike lanes and the public bicycle rental service centers without considering the measures to overcome the geographical constraints of slope. Therefore, this study constructs bicyclist's energy consumption estimation model through experimental methods of slope gradient and heart rate measurement and suggest the bicycle route choice model which could minimize the energy by the slope gradient. After calculating the RMSE of the estimated energy consumption by applying this model to the simulation section, it is confirmed to be 41% better than the model which does not reflect slope gradient. The results of this study are expected to be applied to the bicycle infrastructure planning that considers both longitude and transverse of bike lanes and the algorithm of bicycle route guidance system in the future.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.5
• /
• pp.1125-1132
• /
• 2017

In a situation where the severity and frequency of drought events getting stronger and higher, many studies related to drought forecast have been conducted to improve the drought forecast accuracy. However it is difficult to predict drought events using a single model because of nonlinear and complicated characteristics of temporal behavior of drought events. In this study, in order to overcome the shortcomings of the single model approach, we first build various single models capable to explain the relationship between the meteorological drought index, Standardized Precipitation Index (SPI), and other independent variables such as world climate indices. Then, we developed a combined models using Stochastic Gradient Descent method among Ensemble Learnings.

• The Journal of Society for e-Business Studies
• /
• v.25 no.4
• /
• pp.77-109
• /
• 2020

In this paper, we build a gradient Boosting model to predict government SME R&D subsidy, select features of high importance, and measure the impact of each features to the predicted subsidy using PDP and SHAP value. Unlike previous empirical researches, we focus on the effect of the R&D subsidy distribution pattern to the incentive of the firms participating subsidy competition. We used the firm data constructed by KISTEP linking government R&D subsidy record with financial statements provided by NICE, and applied a Gradient Boosting model to predict R&D subsidy. We found that firms with higher R&D performance and larger R&D investment tend to have higher R&D subsidies, but firms with higher operation profit or total asset turnover rate tend to have lower R&D subsidies. Our results suggest that current government R&D subsidy distribution pattern provides incentive to improve R&D project performance, but not business performance.

• Journal of Intelligence and Information Systems
• /
• v.22 no.2
• /
• pp.127-142
• /
• 2016

Deep learning model is a kind of neural networks that allows multiple hidden layers. There are various deep learning architectures such as convolutional neural networks, deep belief networks and recurrent neural networks. Those have been applied to fields like computer vision, automatic speech recognition, natural language processing, audio recognition and bioinformatics where they have been shown to produce state-of-the-art results on various tasks. Among those architectures, convolutional neural networks and recurrent neural networks are classified as the supervised learning model. And in recent years, those supervised learning models have gained more popularity than unsupervised learning models such as deep belief networks, because supervised learning models have shown fashionable applications in such fields mentioned above. Deep learning models can be trained with backpropagation algorithm. Backpropagation is an abbreviation for "backward propagation of errors" and a common method of training artificial neural networks used in conjunction with an optimization method such as gradient descent. The method calculates the gradient of an error function with respect to all the weights in the network. The gradient is fed to the optimization method which in turn uses it to update the weights, in an attempt to minimize the error function. Convolutional neural networks use a special architecture which is particularly well-adapted to classify images. Using this architecture makes convolutional networks fast to train. This, in turn, helps us train deep, muti-layer networks, which are very good at classifying images. These days, deep convolutional networks are used in most neural networks for image recognition. Convolutional neural networks use three basic ideas: local receptive fields, shared weights, and pooling. By local receptive fields, we mean that each neuron in the first(or any) hidden layer will be connected to a small region of the input(or previous layer's) neurons. Shared weights mean that we're going to use the same weights and bias for each of the local receptive field. This means that all the neurons in the hidden layer detect exactly the same feature, just at different locations in the input image. In addition to the convolutional layers just described, convolutional neural networks also contain pooling layers. Pooling layers are usually used immediately after convolutional layers. What the pooling layers do is to simplify the information in the output from the convolutional layer. Recent convolutional network architectures have 10 to 20 hidden layers and billions of connections between units. Training deep learning networks has taken weeks several years ago, but thanks to progress in GPU and algorithm enhancement, training time has reduced to several hours. Neural networks with time-varying behavior are known as recurrent neural networks or RNNs. A recurrent neural network is a class of artificial neural network where connections between units form a directed cycle. This creates an internal state of the network which allows it to exhibit dynamic temporal behavior. Unlike feedforward neural networks, RNNs can use their internal memory to process arbitrary sequences of inputs. Early RNN models turned out to be very difficult to train, harder even than deep feedforward networks. The reason is the unstable gradient problem such as vanishing gradient and exploding gradient. The gradient can get smaller and smaller as it is propagated back through layers. This makes learning in early layers extremely slow. The problem actually gets worse in RNNs, since gradients aren't just propagated backward through layers, they're propagated backward through time. If the network runs for a long time, that can make the gradient extremely unstable and hard to learn from. It has been possible to incorporate an idea known as long short-term memory units (LSTMs) into RNNs. LSTMs make it much easier to get good results when training RNNs, and many recent papers make use of LSTMs or related ideas.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Journal of Korea Water Resources Association
• /
• v.44 no.3
• /
• pp.189-198
• /
• 2011

The aim of this study is to compare k-$\varepsilon$ and k-$\omega$ closures under the condition of oscillatory layer flow at high Reynolds number. A one dimensional vertical model incorporated with flow momentum equations and turbulence models (k-$\varepsilon$ and k-$\omega$) is applied to the laboratory measurements in the turbulent oscillatory boundary layer. The numerical simulation reveals that both turbulence models calculate similar velocity profiles and turbulent kinetic energy (TKE). In addition, both deliver high accuracy under the condition of negligible spanwise pressure gradient. Therefore, it is recommended in this study to use k-$\varepsilon$ closure, of which numerical coefficients have been calibrated from many studies, for the cases of straight channel, estuary, and coastal environment where the spanwise pressure gradient is not significant.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.77-88
• /
• 2000

이용자의 경로선택 형태를 모사하는 통행배정모형 결과의 정확도는 교통계획에 상당한 영향을 미친다. 이용자의 경로선택 결정과정에서 가장 중요한 판단기준은 통행시간과 통행요금이다. 그런데 통행요금은 이용자의 경로 거리에 따라 다양한 방식으로 부과되므로, 링크를 분석단위로 하는 기존의 통행배정모형은 현실적인 통행요금 반영이 힘들었고 또한 수요예측 결과를 이용한 다양한 분석에서 제약을 받아 왔다. 본 연구는 이러한 배경에서 경로교통량을 도출할 수 있는 경로기반 통행배정모형을 구축하였고, 또한 경로거리에 따라 결정되는 현실적인 통행요금을 반영할 수 있는 알고리즘을 개발하였다. 경로기반 배정모형에서는 GP(Gradient Projection) 알고리즘을 이용하였고, 계산상의 효율성 제고를 위해 K-최단경로 알고리즘 중 MPS(Minimal Path Search) 알고리즘을 이용하였다. 개발된 배정모형은 현실적인 통행요금을 반영할 수 있으므로 통행배정 결과의 정밀도를 향상시켰을 뿐만 아니라 기존 배정모형에 비해 최적해로의 수렴속도도 개선되는 것으로 나타났다. 본 논문의 배정모형은 경로교통량이 도출되고 통행요금을 반영할 수 있으므로, 통행요금과 통행거리 관계에 따른 목적함수의 규명과 그에 따른 효과척도를 계량화할 수 있다. 따라서 본 모형은 통행배정에서 실재상황을 보다 현실여건에 맞도록 규명할 수 있고, 기존의 제한적인 효과분석의 문제점을 해결할 수 있으므로 그 활용범위가 넓다.

• Journal of Cadastre & Land InformatiX
• /
• v.50 no.1
• /
• pp.181-200
• /
• 2020

This study used the OLS model to estimate the determinants affecting the tenure of a home and then compared the predictive power of each model with SVM, Decision Tree, Random Forest, Gradient Boosting, XGBooest and LightGBM. There is a difference from the preceding study in that the Stacking model, one of the ensemble models, can be used as a base model to establish a more predictable model to identify the volume of housing transactions in the housing market. OLS analysis showed that sales profits, housing prices, the number of household members, and the type of residential housing (detached housing, apartments) affected the period of housing ownership, and compared the predictability of the machine learning model with RMSE, the results showed that the machine learning model had higher predictability. Afterwards, the predictive power was compared by applying each machine learning after rebuilding the data with the influencing variables, and the analysis showed the best predictive power of Random Forest. In addition, the most predictable Random Forest, Decision Tree, Gradient Boosting, and XGBooost models were applied as individual models, and the Stacking model was constructed using Linear, Ridge, and Lasso models as meta models. As a result of the analysis, the RMSE value in the Ridge model was the lowest at 0.5181, thus building the highest predictive model.

• Journal of Korean Society of Transportation
• /
• v.22 no.1 s.72
• /
• pp.43-62
• /
• 2004

Conventionally the estimation method of the origin-destination Matrix has been developed by implementing the expansion of sampled data obtained from roadside interview and household travel survey. In the survey process, the bigger the sample size is, the higher the level of limitation, due to taking time for an error test for a cost and a time. Estimating the O-D matrix from observed traffic count data has been applied as methods of over-coming this limitation, and a gradient model is known as one of the most popular techniques. However, in case of the gradient model, although it may be capable of minimizing the error between the observed and estimated traffic volumes, a prior O-D matrix structure cannot maintained exactly. That is to say, unwanted changes may be occurred. For this reason, this study adopts a conjugate gradient algorithm to take into account two factors: estimation of the O-D matrix from the conjugate gradient algorithm while reflecting the prior O-D matrix structure maintained. This development of the O-D matrix estimation model is to minimize the error between observed and estimated traffic volumes. This study validates the model using the simple network, and then applies it to a large scale network. There are several findings through the tests. First, as the consequence of consistency, it is apparent that the upper level of this model plays a key role by the internal relationship with lower level. Secondly, as the respect of estimation precision, the estimation error is lied within the tolerance interval. Furthermore, the structure of the estimated O-D matrix has not changed too much, and even still has conserved some attributes.