• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.176-183
• /
• 1999

Using Asynchronous Transfer Mode(ATM) which is a high-bandwidth, low-delay, cell switching and multiplexing technology, Broadband-Integrated Services Digital Network (B-ISDN) can support communication services of all kinds. To evaluate the performance of ATM networks, traffic source models to meet the requirements are demanded. We can obtain random traffic distribution for ATM networks by using the Cellular Automata (CA) which have effective random pattern generation capability. In this paper we propose an algorithm using 2-D LHCA to generate more effective random patterns with good random characteristics. And we show that the randomness by 2-D LHCA is better than that of the randomness by 1-D LHCA.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.365-368
• /
• 2005

이동중인 단말에게 인터넷 서비스를 제공하고자 하는 WiBro 시스템은, 무선자원의 효율적인 사용을 위해서 전송할 데이터가 있는 단말들에게만 대역폭을 할당하는 demand-based 대역폭 할당 방식을 사용한다. 이때 여러 단말들이 동시에 데이터를 전송하고자할 경우 충돌이 발생하므로 이들의 전송순서를 정해주는 것이 필요하다. 기존의 WiBro 시스템에서는 binary exponential backoff algorithm 에 기초한 random access 기법을 사용하는데, 본 연구에서는 conflict resolution 기법에 기초한 새로운 random access 기법을 제안하고, 새로운 기법의 성능이 보다 우수함을 시뮬레이션을 통해 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.822-829
• /
• 2005

In this paper, a processing time and trafnc capacity analysis algorithm for RFID system using LBT-Random Searching scheme is proposed. Service time, carrier sensing time, additional delay time required for contiguous frequency channel occupancy, and additional delay time required for the contiguous using the same frequency channel are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results showing maximum capacity of the system and explaining the accuracy of the algorithm are provided.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.75-80
• /
• 1999

This paper presents a new method to find a optimal solution for stochastic system. This method uses Genetic Algorithm(GA) and simulation. GA is used to search for new alternative and simulation is used to evaluate alternative. The stochastic system has one or more random variables as inputs. Random inputs lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of they system. These estimates could greatly differ from the corresponding real characteristics for the system. We need multiple replications to get reliable information on the system. And we have to analyze output data to get a optimal solution. It requires too much computation to be practical. We address the problem of reducing computation. The procedure on this paper use GA character, an iterative process, to reduce the number of replications. The same chromosomes could exit in post and present generation. Computation can be reduced by using the information of the same chromosomes which exist in post and present current generation.

• Structural Engineering and Mechanics
• /
• v.52 no.2
• /
• pp.405-426
• /
• 2014

In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.5
• /
• pp.499-505
• /
• 2003

In the design of mobile wireless communication system, base station location is one of the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively fur global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.125-136
• /
• 2009

The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

• Journal of radiological science and technology
• /
• v.43 no.6
• /
• pp.503-509
• /
• 2020

This study aims to develop a patient-specific radiation exposure dose prediction model based on anthropometric data that can be easily measurable during CT examination, and to be used as basic data for DRL setting and radiation dose management system in the future. In addition, among the machine learning algorithms, the most suitable model for predicting exposure doses is presented. The data used in this study were chest CT scan data, and a data set was constructed based on the data including the patient's anthropometric data. In the pre-processing and sample selection of the data, out of the total number of samples of 250 samples, only chest CT scans were performed without using a contrast agent, and 110 samples including height and weight variables were extracted. Of the 110 samples extracted, 66% was used as a training set, and the remaining 44% were used as a test set for verification. The exposure dose was predicted through random forest, linear regression analysis, and SVM algorithm using Orange version 3.26.0, an open software as a machine learning algorithm. Results Algorithm model prediction accuracy was R^2 0.840 for random forest, R^2 0.969 for linear regression analysis, and R^2 0.189 for SVM. As a result of verifying the prediction rate of the algorithm model, the random forest is the highest with R^2 0.986 of the random forest, R^2 0.973 of the linear regression analysis, and R^2 of 0.204 of the SVM, indicating that the model has the best predictive power.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.49 no.4
• /
• pp.249-257
• /
• 2000

In this paper, we propose the use of stochastic finite element method, that is popularly employed in mechanical structure analysis, for more practical designing purpose of RF device. The proposed method is formulated based on the vector finite element method cooperated by pertubation analysis. The method utilizes sensitivity analysis algorithm with covariance matrix of the random variables that represent for uncertain physical quantities such as length or various electrical constants to compute the probabilities of the measure of performance of the structure. For this computation one need to know the variance and covariance of the random variables that might be determined by practical experiences. The presenting algorithm has been verified by analyzing several device with different be determined by practical experiences. The presenting algorithm has been verified by analysis several device with different measure of performanes. For the convenience of formulation, two dimensional analysis has been performed to apply it into waveguide with dielectric slab. In the problem the dielectric constant of the dielectric slab is considered as random variable. Another example is matched waveguide and cavity problem. In the problem, the dimension of them are assumed to be as random variables and the expectations and variances of quality factor have been computed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2237-2242
• /
• 2005

The original RRT is iteratively expanded by applying control inputs that drive the system slightly toward randomly-selected states, as opposed to requiring point-to-point convergence, as in the probabilistic roadmap approach. It is generally known that the performance of RRTs can be improved depending on the selection of the metrics in choosing the nearest vertex and bias techniques in choosing random states. We designed a path planning algorithm based on the RRT method for a remote-controlled mobile robot. First, we considered a bias technique that is goal-biased Gaussian random distribution along the command directions. Secondly, we selected the metric based on a weighted Euclidean distance of random states and a weighted distance from the goal region. It can save the effort to explore the unnecessary regions and help the mobile robot to find a feasible trajectory as fast as possible. Finally, the constraints of the actuator should be considered to apply the algorithm to physical mobile robots, so we select control inputs distributed with commanded inputs and constrained by the maximum rate of input change instead of random inputs. Simulation results demonstrate that the proposed algorithm is significantly more efficient for planning than a basic RRT planner. It reduces the computational time needed to find a feasible trajectory and can be practically implemented in a remote-controlled mobile robot.