• Water for future
• /
• v.30 no.1
• /
• pp.50-51
• /
• 1997

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.791-803
• /
• 2001

Mach-Zehnder type traveling-wave Ti：LiNb $O_3$ optical modulators were designed and fabricated. Optimum parameters of optical waveguides were calculated by means of the FDM. Design of CPW traveling-wave electrodes were performed by the FEM in the active region and by the CMM in the input/output section to obtain the conditions of MW effective index and impedance matching. From the measured S parameters, MW characteristics of the traveling-wane electrodes were extracted to be ${\alpha}_m$=0.05426 $\sqrt{f}$, $N_{eff}$=2.2025, and $Z_{c}$=39 ${\Omega}$. The calculated optical response R($\omega$) showed the 3 dB bandwidth of 10 GHz.z..

• Spatial Information Research
• /
• v.11 no.3
• /
• pp.275-289
• /
• 2003

This study focused on offering a helpful information for the touring. To develop a tour route guidance tool, it is needed to use a GIS function, which can suggest a possible shortest path based on time and distance. A Traveling salesman problem algorithm, which was developed to solve multi destination problem in network analysis, was used to implement a tour guidance system. This system was developed using ArcObjects programming components within ArcGIS 8.3. Jeju city was selected for the case study to apply the tool and to test the effectiveness of it. This study demonstrated that this tool was considerably effective for finding a probable optimum tour path in the following aspects. First, it can help tourists to select several attractions from numerous tour sites in an area given limited time. Second, tourist can manage time efficiently by organizing their tour courses on the basis of the tool. Third, tourists can reduce the uncertainties that may happen under unexpected situations in unfamiliar places by obtaining specific spatial information using the tool. Fourth, the Graphic User Interface of the tool can be easily used to obtain visual information of spatial data.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Physical Therapy Korea
• /
• v.15 no.3
• /
• pp.44-52
• /
• 2008

The purpose of this study was to investigate the effects of different objects and target location of dominant hand on the non-dominant hand movement kinematics in a bimanual reaching task. Fifteen right-handed volunteers were asked to reach from same starting point to the different target point of right and left hand with grasping the objects of different size. Independent variables were 1) three different object types (small mug cup, name pen, and PET bottle), and 2) three different target locations (shorter distance, same distance, and longer distance than the non-dominant hand) of the dominant hand. Dependent variables were movement time (MT), movement distance (MD), movement mean velocity ($MV_{mean}$), and movement peak velocity ($MV_{peak}$) of the non-dominant hand. Repeated measures two-way analysis of variance (ANOVA) was used to test for differences in the non-dominant hand movement kinematics during bimanual reaching. The results of this study were as follows: 1) MT of the non-dominant hand was increased significantly when traveling with grasping the mug cup and reaching the far target location, and was decreased significantly when traveling with grasping the PET bottle and reaching the near target location of the dominant hand. 2) MD of the non-dominant hand was significantly increased during reaching the far target location, and significantly decreased during reaching the near target location with dominant hand. 3) $MV_{mean}$ of the non-dominant hand was increased significantly when traveling with grasping the PET bottle, and was decreased significantly when traveling with grasping the mug cup of the dominant hand. Therefore, it can be concluded that the changes of the ipsilateral hand movement have influence on coupling of the contralateral hand movement in bimanual reaching.

• Korean Journal of Ichthyology
• /
• v.18 no.3
• /
• pp.251-265
• /
• 2006

To investigate the impingement of fish on the traveling screens, fishes were collected from the traveling screens at Hadong Power Plant through the year of 1999. A total of 84 fish species were collected during the study period. The dominant species were Leiognathus nuchalis, Engraulis japonicus, Trichiurus lepturus and Takifugu niphobles. These four species accounted for 78.2% of the total number of individuals and 52.0% of total biomass collected. The number of fish species, number of individuals, biomass and species diversity indices fluctuated with the seasons. The number of species and biomass were high in April and August, and the number of individuals was high in April and July. However, the number of fish species, number of individuals and biomass of fishes showed low values in winter.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.119-126
• /
• 2019

The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1754-1757
• /
• 2004

For the anti-sway control of traveling cranes, there are several solutions, i.e., by fuzzy control, by optimal control theory, etc. Each of them is reported to be effective. And, H infinity control and $H_2$ control can be also used. However, the full order observer which estimates all states in the controlled object is used in these methods. Therefore, the orders of these controllers are apt to be higher than that of the optimal controller, etc. Because the conventional H2 controller which minimizes $H_2$ norm consists of two parts, that is: feedback gains which make the controlled object stable and the full order observer which estimate those states. If the minimal order observer is used instead of the full order one, the order of the controller can be reduced. In this paper, we propose a new method based on the minimalization of $H_2$ norm using the minimal order observer. And, we confirm the effect of a new $H_2$ controller in the experiments of the anti-sway control of a traveling crane.