• Proceedings of the KIPE Conference
• /
• 2004.11a
• /
• pp.32-36
• /
• 2004

In order to achieve high performance vector control, it is essential to measure accurate ac current. The errors generated from current path are inevitable, and they could be divided into two categories: offset error and scaling error. The current data including these errors cause periodic speed ripples which are one and two times of stator electrical frequency respectively. Since these undesirable ripples bring about bad influences to motor driving system, a compensation algorithm must be needed in the control algorithm of the motor drive. In this paper, a new compensation algorithm is proposed. The signal of the integrator output of the d-axis current regulator is chosen and processed to compensate the current measurement errors. The compensation of the current measurement errors is easily implemented to smooth the signal of the integrator output of the d-axis current regulator by subtracting the DC offset value or rescaling the gain of the hall sensor. Therefore, the proposed algorithm has several features: the robustness of the variation of the mechanical parameters, the application of the steady and transient state, the easy implementation, and less computation time.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.24 no.2
• /
• pp.208-225
• /
• 2019

To understand the mean surface circulation and surface currents in the East Sea, trajectories of surface drifters passed through the East Sea from 1991 to 2017 were analyzed. By analyzing the surface drifter trajectory data, the main paths of surface ocean currents were grouped and the variation in each main current path was investigated. The East Korea Warm Current (EKWC) heading northward separates from the coast at $36{\sim}38^{\circ}N$ and flows to the northeast until $131^{\circ}E$. In the middle (from $131^{\circ}E$ to $137^{\circ}E$) of the East Sea, the average latitude of the currents flowing eastward ranges from 36 to $40^{\circ}N$ and the currents meander with large amplitude. When the average latitude of the surface drifter paths was in the north (south) of $37.5^{\circ}N$, the meandering amplitude was about 50 (100) km. The most frequent route of surface drifters in the middle of the East Sea was the path along $37.5-38.5^{\circ}N$. The surface drifters, which were deployed off the coast of Vladivostok in the north of the East Sea, moved to the southwest along the coast and were separated from the coast to flow southeastward along the cyclonic circulation around the Japan Basin. And, then, the drifters moved to the east along $39-40^{\circ}N$. The mean surface current vector and mean speed were calculated in each lattice with $0.25^{\circ}$ grid spacing using the velocity data of surface drifters which passed through each lattice. The current variance ellipses were calculated with $0.5^{\circ}$ grid spacing. Because the path of the EKWC changes every year in the western part of the Ulleung Basin and the current paths in the Yamato Basin keep changing with many eddies, the current variance ellipses are relatively large in these region. We present a schematic map of the East Sea surface current based on the surface drifter data. The significance of this study is that the surface ocean circulation of the East Sea, which has been mainly studied by numerical model simulations and the sea surface height data obtained from satellite altimeters, was analyzed based on in-situ Lagrangian observational current data.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.538-548
• /
• 2008

In the Internet Engineering Task Force(IETF), Next Step in Signaling(NSIS) working group, proposed a mechanism to discover the Crossover Node(CRN), when the route is changed by Mobile Node(MN) handover. The CRN is divergence or convergence node on old and new path for reserving resources. Trough the CRN discovery mechanism, it possible to reduce a signaling delay and avoid the redundant reservation on the common path between old and new path. However, the QoS(Quality of Service) can be guaranteed continuously while the MN is performing handover, it is needed to pre-reserve the resource on the new path before completion of the handover. When the nodes on the new path try to make a pre-resource reservation before the handover, it is difficult to pre-reserve the resource with the existing CRN discovery mechanism. Therefore, we proposed a Passive CRN(PCRN) discovery scheme and pre-resource reservation mechanism. The PCRN which means an initial common point between the current reserved and the new paths, where the handover can take place.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.805-811
• /
• 2012

In this paper, movement of conduction path has been analyzed for electron distribution in the channel of double gate(DG) MOSFET. The analytical potential distribution model of Poisson equation, validated in previous researches, has been used to analyze transport characteristics. DGMOSFETs have the adventage to be able to reduce short channel effects due to improvement for controllability of current by two gate voltages. Since short channel effects have been occurred in subthreshold region including threshold region, the analysis of transport characteristics in subthreshold region is very important. Also transport characteristics have been influenced on the deviation of electron distribution and conduction path. In this study, the influence of electron distribution on conduction path has been analyzed according to intensity and distribution of doping and channel dimension.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.342-352
• /
• 2006

Current studies on storing XML data are focused on either mapping XML data to existing RDBMS efficiently or developing a native XML storage. Some native XML storages store each XML node with parsed object form. Clustering, the physical arrangement of each object, can be an important factor to increase the performance with this storing method. In this paper, we propose re-clustering techniques that can store an XML document efficiently. Proposed clustering technique uses path similarities among data nodes, which can reduce page I/Os when returning query results. And proposed technique can process a path query only using small number of clusters as possible instead of using all clusters. This enables efficient processing of path query because we can reduce search space by skipping unnecessary data. Finally, we apply existing clustering techniques to store XML data and compare the performance with proposed technique. Our results show that the performance of XML storage can be improved by using a proper clustering technique.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1373-1381
• /
• 2010

Current flight maneuver diagram used by pilots is based on 2D spatial presentation, so it has limitation on display 3D flight information and hard to understand it instinctively. Flight animation authoring tools for this diagram are complex to use and lack useful features like non-linear editing of flight path and real-time interactivity on multiple aircrafts. This research focuses on 3D flight path generation method in the animation system for flight maneuver education. This research combines initial sketch input on 2D diagram with the thrust of an aircraft to generate 3D linear spline as close as to real flight. Using suggested linear spline creation method, the flight path can be visualized, edited, and animated in real-time at the flight maneuver briefing and debriefing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.137-141
• /
• 2005

Optimal path search algorithm should consider traffic flows of the roads as well as the distance between a departure and destination, The existing path search algorithms, however, usually don't apply the continuously changed traffic flows. In this paper, we propose a new optimal path search algorithm. the algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road networks into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and $A^*$ algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.320-330
• /
• 2004

Query languages for XML use paths in a data graph to represent queries. Actually, paths in a data graph are used as a basic constructor of an XML query. User can write more expressive Queries by using Patterns (e.g. regular expressions) for paths. There are many identical paths in a data graph because of the feature of semi-structured data. Current researches for indexing XML utilize identical paths in a data graph, but such an index can grow larger than source data graph and cannot guarantee efficient access path. In this paper we propose a partitioning technique that can partition all the paths in a data graph. We develop an index graph that can find appropriate partitions for a path query efficiently. The size of our index graph can be adjusted regardless of the source data. So, we can significantly improve the cost for index graph traversals. In the performance study, we show our index much faster than other graph based indexes.