• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3851-3857
• /
• 2014

Shippers' requests of freight trains vary with time, but generating an additional schedule of freight trains is not easy due to many considerations, such as the line capacity, operation rules, and conflicts with existing trains. On the other hand, an additional freight train schedule has been continuously requested and manually processed by domestic train operation companies using empirical method, which is time consuming. This paper proposes a model to determine the additional freight train schedule that assesses the feasibility of the added freight trains, and generates as many additional schedules as possible, while minimizing the delay of the existing schedules. The problem is presented using time-space network, modeled as multi-commodity flow problem, and solved using the column generation method. Three levels of experiment were conducted to show validity of the proposed model in the computation time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.7
• /
• pp.666-673
• /
• 2008

To construct the accurate radio satellite navigation system, the efficient communication each satellite with the ground station is very important. Throughout the communication, the orbit of each satellite can be corrected, and those information will be used to analyze the satellite satus by the operator. Since there are limited resources of ground station, the schedule of antenna's azimuth and elevation angle should be optimized. On the other hand, the satellite in the medium earth orbit does not pass the same point of the earth surface due to the rotation of the earth. Therefore, the antenna pass schedule must be updated at the proper moment. In this study, Q learning approach which is a form of model-free reinforcement learning and genetic algorithm are considered to find the optimal antenna schedule. To verify the optimality of the solution, numerical simulations are conducted.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.8
• /
• pp.706-711
• /
• 2015

The fighter aircraft uses several different loading configurations for air-to-surface and air-to-air combat missions. To maintain wings-level flight with an asymmetric weapon configuration, a pilot controls a roll trim system. However, it is difficult to apply an accurate roll trim input for wings-level flight in the actual flight under disturbance. The inaccurate roll trim input degrades the performance of the roll autopilot system. In this paper, to solve this problem, an integrator was additionally designed in the command part of the roll autopilot system. The initial transient response was improved by scheduling the limiter to restrict the roll attitude error. As a result of the evaluation of the simulation for the designed flight control law, the roll attitude following performance was found to be improved in the autopilot system operation under the inaccurate roll trim condition.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.3
• /
• pp.247-255
• /
• 2013

The flight control of re-entry vehicles poses a challenge to conventional gain-scheduled flight controllers due to the widely spread aerodynamic coefficients. In addition, a wide range of uncertainties in disturbances must be accommodated by the control system. This paper presents the design of a roll channel controller for a non-axisymmetric reentry vehicle model using the trajectory linearization control (TLC) method. The dynamic equations of a moving mass system and roll control model are established using the Lagrange method. Nonlinear tracking and decoupling control by trajectory linearization can be viewed as the ideal gain-scheduling controller designed at every point along the flight trajectory. It provides robust stability and performance at all stages of the flight without adjusting controller gains. It is this "plug-and-play" feature that is highly preferred for developing, testing and routine operating of the re-entry vehicles. Although the controller is designed only for nominal aerodynamic coefficients, excellent performance is verified by simulation for wind disturbances and variations from -30% to +30% of the aerodynamic coefficients.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.355-364
• /
• 2000

Application sharing for collaborative works make multiple participants to be capable of collaborative developments through sharing development tools and applications which is distributed to various system without spatial restriction. However, applying legacy application sharing to CSCW based virtual environment has a problem because it dont consider 3D space and it disturbs the harmonic interaction of participants. In this study, we designed application sharing system for collaborative works in 3D virtual environment to share application effectively on collaborative virtual environment. The designed application sharing system for collaborative works in 3D virtual environment consist of application sharing manager, group manager and communication manager. This system is able to perceive event of 3D space about application of participant on 3D virtual environment by agent which moves to participant sites and get an ordered events and conflict among participants through scheduling. Therefore, designed application sharing system for collaborative work in 3D virtual environment can support efficient collaborative works and improve reusability of legacy application through using easily legacy application in 3D virtual environment when CSCW application development for virtual environments.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3138-3147
• /
• 2000

EC(Electronic Commerce) which is cone the virtual space through Internet, has the advantage of time and space. On the contrary, it also has weak point like security probelm because anybody can easily access to the system due to open network attribute of Internet. Theretore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solution is the implemonlation of a strong cipher algorithm. YK2(YoungKu Kang) cipher algorithm proposed in this paper is advantage for the EC security and it overcomes the limit of the current 6/1 bits block cipher algorithm using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is degigned for the increase of time complexity and probability calculation by adapting more complex design for key scheduling regarded as one of the important element effected to enciyption.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.5
• /
• pp.409-416
• /
• 2000

In the shared-memory mutiprocessor systems, shared processing techniques such as time-sharing, space¬sharing, and gang-scheduling are used to improve the overall system utilization for the parallel operations. Recently, LLPC(Loop-Level Process Control) allocation technique was proposed. It dynamically adjusts the needed number of processors for the execution of the parallel code portions based on the current system load in the given job. This method allocates as many available processors as possible, and does not save any processors for the parallel sections of other later-arriving applications. To solve this problem, in this paper, we propose a new processor allocation technique called FPA(Fuzzy Processor Allocation) that dynamically adjusts the number of processors by fuzzifYing the amounts ofueeded number of processors, loads, and estimated execution times of job. The proposed method provides the maximum possibility of the parallism of each job without system overload. We compare the performances of our approaches with the conventional results. The experiments show that the proposed method provides a better performance.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.2
• /
• pp.114-121
• /
• 2019

Tailless aircraft have advantages of low visibility compared to conventional aircraft, but drawback of poor stability as well which makes designing controller difficult. The controller design is more difficult, especially when the center of gravity moves due to store release or fuel consumption during flight. In this paper, an L1 adaptive controller is proposed as a way to overcome these problems. The reliability and performance of the controllers were verified by non-linear simulations. RPV Flying Quality Design criteria were used for design criteria. Using the simulation, it is shown that the adaptive controller maintains stability of the unmanned aircraft for sudden large change in the inertial properties. It is also shown that the calculation burden can be reduced when it is used with the gain scheduling method.