• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.17-34
• /
• 2022

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.348-359
• /
• 2007

The conventional mobile VPN services assumed the mobile communications occur between the MN in foreign networks and the CN in the home network. However, if a MN wants to communicate with another MN in a foreign network, it could degrade the performance of the mobile VPN service because of the triangular routing problem. In this paper, we propose a route optimization mechanism based on the mobile VPN using an x-HA allocated by diameter MIP in order to support the efficient communication between the mobile VPN users in foreign networks. The i-HA maintains the VPN-TIA as well as the x-HoA as the CoAs to solve the security problem and to provide an efficient route optimization simultaneously. Moreover, we proposed revised IPSec tunnel configuration to reduce the IPSec tunnel overheads at a MN when the MN communicates with several MNs in the foreign networks at the same time. The VPN server, a security management entity in the home network, notifies an additional IPSec tunnel establishment between the x-HAs where the communication peers are registered. The simulation result showed that the proposed scheme decreases the end-to-end packet delay time and improves the throughput after the handoff compared to the existing mechanism.

• Journal of Korea Water Resources Association
• /
• v.45 no.11
• /
• pp.1169-1186
• /
• 2012

Storage function method has been used for flood forecasting in the major rivers in Korea, however, the researches on the relationship between the parameters and runoff characteristics was not sufficient. In addition, there has been a controversy about the optimized parameters without the consideration of the physical characteristics of the basin. Therefore, in this study, the SCE-UA method is used to optimize the parameters and the proposed method was applied with two stage optimization in the Jeongseon and Yeongwol watersheds located in the most upstream in the South Han river. The contour map was developed to investigate parameters and the error surface calculated from the runoff. The proposed parameters is to provide a range of the possible parameter set in a watershed, rather than a specific value. However, the applicability is examined using the average value of the proposed ranged parameters. In this study, the criticism about the optimization technique to find an optimal value having no physical meaning on a watershed is tried to avoid. The objective of this study is to provide a range of parameters for the flood forecasting model and the intuition about the behavior of the parameters, so the efficiency of flood forecasting is increased.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.207-218
• /
• 2008

With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.108-113
• /
• 2012

Routing paths are mightily important for the network security in WSNs. To maintain such routing paths, sustained path re-selection and path management are needed. Region segmentation based path selection method (RSPSM) provides a path selection method that a sensor network is divided into several subregions, so that the regional path selection and path management are available. Therefore, RSPSM can reduce energy consumption when the path re-selection process is executed. However, it is hard to guarantee optimized secure routing path at all times since the information using the path re-selection process is limited in scope. In this paper, we propose partial path selection method in each subregion using preselected partial paths made by RSPSM for routing path optimization in SEF based sensor networks. In the proposed method, the base station collects the information of the all partial paths from every subregion and then, evaluates all the candidates that can be the optimized routing path for each node using a evaluation function. After the evaluation process is done, the result is sent to each super DN using the global routing path information (GPI) message. Thus, each super DN provides the optimized secure routing paths using the GPI. We show the effectiveness of the proposed method via the simulation results. We expect that our method can be useful for the improvement of RSPSM.

• Journal of Korean Ophthalmic Optics Society
• /
• v.14 no.1
• /
• pp.47-56
• /
• 2009

Purpose: To find optimized luminosity factor of color from light transmission filter. Methods: To make $Y_{1-x}G_{x}$, $Y_{1-x}P_{x}$ by using CR-39 compound within dipping method, mixing up Y(Yellow), G(green) and P(pink) for optimize eye sensitivity. Modeling for relative luminous efficiency(relative sensitivity) curves in Luminose transmission, it could be resolved by Multiplying sensitivity of eye within transmission rate of Lens ($P_f({\lambda}=T({\lambda}){\cdot}P({\lambda}).)$.). To evaluate Wavelength between 400~700 nm, relative luminous efficiency curve in Area and Height value is being used. Results: In color filter of $Y_{1-x}G_{x}$ position of x equals to 0.04, 0.1, 0.08, 0.12, 0.14, 0.5 at ${\beta}=S_1/S_0{\cdot}100$ each consist value of 76.1, 77.9, 80.7, 81.6, 80.2, 18.6 In color filter of $Y_{1-x}P_{x}$ position of x equals to 1.00, 0.2, 0.6, 0.8 at ${\beta}=S_1/S_0{\cdot}100$ each consist value of 74.3, 74.0, 70.5, 33.0 The result from experiment $Y_{1-x}P_{x}$ value less than $Y_{1-x}G_{x}$, from evaluating luminous efficiency curve and test was successfully optimized. Conclusions: Optimized relative luminous efficiency curve result have value of X=0.12-0.14 at $Y_{1-x}G_{x}$.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.3
• /
• pp.109-118
• /
• 2019

Road information is one of the most significant geospatial data for applications such as transportation, city planning, map generation, LBS (Location-Based Service), and GIS (Geographic Information System) database updates. Robust technologies to acquire and update accurate road information can contribute significantly to geospatial industries. In this study, we analyze the limitations of ACO (Ant Colony Optimization) road extraction, which is a recently introduced object-based road extraction method using high-resolution satellite images. Object-based ACO road extraction can efficiently extract road areas using both spectral and morphological information. This method, however, is highly dependent on object descriptor information and requires manual designations of descriptors. Moreover, reasonable iteration closing point needs to be specified. In this study, we perform improved ACO road extraction on VHR (Very High Resolution) optical satellite image by proposing an optimization stopping criteria and descriptors that complements the limitations of the existing method. The proposed method revealed 52.51% completeness, 6.12% correctness, and a 51.53% quality improvement over the existing algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Journal of Digital Convergence
• /
• v.15 no.2
• /
• pp.173-181
• /
• 2017

In this paper, we have studied tracking as a training stage of considering the position and the scale of a person given its previous position, scale, as well as next and forward image fraction. Unlike other learning methods, CNN is thereby learning combines both time and spatial features from the image for the two consecutive frames. We introduce multiple path ways in CNN to better fuse local and global information. A creative shift-variant CNN architecture is designed so as to alleviate the drift problem when the distracting objects are similar to the target in cluttered environment. Furthermore, we employ CNNs to estimate the scale through the accurate localization of some key points. These techniques are object-independent so that the proposed method can be applied to track other types of object. The capability of the tracker of handling complex situations is demonstrated in many testing sequences. The accuracy of the SVM classifier using the features learnt by the CNN is equivalent to the accuracy of the CNN. This fact confirms the importance of automatically optimized features. However, the computation time for the classification of a person using the convolutional neural network classifier is less than approximately 1/40 of the SVM computation time, regardless of the type of the used features.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.343-352
• /
• 2011

For optimizing railroad designs, setting up shape and specifications of facilities harmonized and coincide with local topography based on absolute location information, correct construction quantity's output and proper land's security etc are key matters, and also clear and advanced surveying standards and technical provision shall become priority so as to satisfy them. Therefore, this study analyzed and researched on surveying standards and technical provision's status in current railroad design's cases, and then attempts to suggest establishment of design surveying standard, procedures, and methods together with its practical scheme.