• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.10-21
• /
• 2008

User travel behavior is based on the existence of complete traffic information in deterministic user optimal principle by Wardrop(1952). According to deterministic user optimal principle, users choose the optimal route from origin to destination and they change their routes arbitrarily in order to minimize travel cost. In this principle, users only consider travel time as a factor to take their routes. However, user behavior is not determined by only travel time in actuality. Namely, the models that reflect only travel time as a route choice factor could give irrational travel behavior results. Therefore, the model is necessary that considers various factors including travel time, transportation networks structure and traffic information. In this research, more realistic deterministic optimal traffic assignment model is proposed in the way of route recognizance behavior. This model assumes that when users decide their routes, they consider many factors such as travel time, road condition and traffic information. In addition, route recognizance attributes is reflected in this suggested model by forward searching method and backward searching method with numerical formulas and algorithms.

• Smart Media Journal
• /
• v.11 no.1
• /
• pp.38-45
• /
• 2022

A lot of research is being going until this day in order to obtain stable profit in the stock market. Trading algorithms are widely used, accounting for over 80% of the trading volume of the US stock market. Despite a lot of research, there is no trading algorithm that always shows good performance. In other words, there is no guarantee that an algorithm that performed well in the past will perform well in the future. The reason is that there are many factors that affect the stock price and there are uncertainties about the future. Therefore, in this paper, we propose a model using TimeGAN that predicts future returns well and selects algorithms that are expected to have high returns based on past records of the returns of algorithms. We use TimeGAN becasue it is probabilistic, whereas LSTM method predicts future time series data is deterministic. The advantage of TimeGAN probabilistic prediction is that it can reflect uncertainty about the future. As an experimental result, the method proposed in this paper achieves a high return with little volatility and shows superior results compared to many comparison algorithms.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.601-606
• /
• 1998

In this paper, we propose a new design method of an optimal fuzzy logic controller using co-evolutionary concept. In general, it is very difficult to find optimal fuzzy rules by experience when the input and/or output variables are going to increase. Futhermore proper fuzzy partitioning is not deterministic ad there is no unique solution. So we propose a co-evolutionary method finding optimal fuzzy rules and proper fuzzy membership functions at the same time. Predator-Prey co-evolution and symbiotic co-evolution algorithms, typical approaching methods to co-evolution, are reviewed, and dynamic fitness landscape associated with co-evolution is explained. Our algorithm is that after constructing two population groups made up of rule base and membership function, by co-evolving these two populations, we find optimal fuzzy logic controller. By applying the propose method to a path planning problem of autonomous mobile robots when moving objects applying the proposed method to a pa h planning problem of autonomous mobile robots when moving objects exist, we show the validity of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.847-856
• /
• 2013

This paper presents an AP placement technique considering indoor location-awareness and examines its performance. The proposed AP placement technique is addressed from three performance metrics: location-awareness and AP-based wireless network performance as well as its cost. The proposed AP placement technique consists of meta-heuristic algorithms that yield a near optimal AP configuration for given performance metrics, and deterministic algorithms that improve the fast convergence of the near optimal AP configuration. The performance of the AP placement technique presented in this paper is measured under the environments simulating indoor space, and numerical results obtained by experimental evaluation yield the fast convergence of a near-optimal solution to a given performance metric.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2011

Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.7-12
• /
• 1993

This paper presents a generalized truncated least, squares adaptive algorithm and a two-stage design method. The proposed algorithm is directly derived from the normal equation of the generalized truncated least squares method (GTLSM). The special case of the GTLSM, the truncated least squares (TLS) adaptive algorithm, has a distinct features which includes the case of minimum steps estimator. This algorithm seemed to be best in the deterministic case. For real applications in the presence of disturbances, the GTLS adaptive algorithm is more effective. The two-stage design method proposed here combines the adaptive control system design with a conventional control design method and each can be treated independently. Using this method, the validity of the presented algorithms are examined by the simulation studies of an indirect adaptive control.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.35 no.4
• /
• pp.435-447
• /
• 1999

It is main objective of this approach to present a method to analyse stochastic design sensitivity for problems of structural dynamics with randomness in design parameters. A combination of the adjoint variable approach and the second order perturbation method is used in the finite element approach. An alternative form of the constant functional that holds for all times is introduced to consider the time response of dynamic sensitivity. The terminal problem of the adjoint system is solved using equivalent homogeneous equations excited by initial velocities. The numerical procedures are shown to be much more efficient when based on the fold superposition method: the generalized co-ordinates are normalized and the correlated random variables are transformed to uncorrelated variables, whereas the secularities are eliminated by the fast Fourier transform of complex valued sequences. Numerical algorithms have been worked out and proved to be accurate and efficient : they can be readily adapted to fit into the existing finite element codes whose element derivative matrices can be explicitly generated. The numerical results of two cases -2 dimensional portal frame for the comparison with reference and 3-dimensional frame structure - for the deterministic sensitivity analysis are presented.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.740-749
• /
• 1998

This paper proposes compression of image data using neural networks based on conjugate gradient method and dynamic tunneling system. The conjugate gradient method is applied for high speed optimization .The dynamic tunneling algorithms, which is the deterministic method with tunneling phenomenon, is applied for global optimization. Converging to the local minima by using the conjugate gradient method, the new initial point for escaping the local minima is estimated by dynamic tunneling system. The proposed method has been applied the image data compression of 12 ${\times}$12 pixels. The simulation results shows the proposed networks has better learning performance , in comparison with that using the conventional BP as learning algorithm.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.5
• /
• pp.45-54
• /
• 1998

For proper release of side airbags, the onset of crash should be detected first. After crash detection, the algorithm has to make a decision whether the side airbag deployment is necessary. If the deployment is necessary, proper timing has to be provided for the maximum protection of driver or passenger. The side airbag release algorithm should be robust against the statistical deviations which are inherent to experimental crash test data. Deterministic optimization algorithms cannot be used for the side aribag release algorithm since the objective function cannot be expressed in a closed form. From this background, genetic algorithm has been used for the optimization. The optimization requires moderate amount of computation and gives satisfactory results.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.5
• /
• pp.81-90
• /
• 2004

This paper presents new testability measure based on learning, which can be useful in the deterministic process of test pattern generation algorithms. This testability measure uses the structural information that are obtained by teaming. The proposed testability measure searches for test pattern that can early detect the conflict in case of the hardest decision problems. On the other hand in case of the easiest decision problem, it searches for test pattern that likely results in the least conflict. The proposed testability measure reduces CPU time to generate test pattern that accomplishes the same fault coverage as that of the distance-based measure.