• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.2
• /
• pp.63-68
• /
• 2004

This paper presents an approach to optimum design of Moving Magnet Type Linear Oscillatory Actuator(MM-LOA). The Finite Element Method is applied to characteristic parameters for characteristic analysis and in order to reduce modeling time and efforts, the moving model node technique is used. In addition the neural network is used to reduce computational time of analysis according to changing design variable. To confirm the validity of this study, optimum design results are compared with results of analysis procedure that is verified by experiment.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.54 no.2
• /
• pp.53-59
• /
• 2005

In this paper, optimum shape design of permanent magnet in slotted type Permanent Magnet Linear Synchronous Motor(PMLSM) is progressed for minimization of detent force owing to structure of slot-teeth and thrust ripple by harmonic magnetic flux of permanent magnet. In order to reduce remodeling time as changing design parameter for Permanent Magnet shape optimization, the moving model node technique was applied. The characteristics of thrust and detent force computed by finite element analysis are acquired equal effect both skewed basic model and optimum model which is optimization of permanent magnet shape. In addition to, thrust per unit volume is improved 4.l2[%] in optimum model.

• Journal of Digital Convergence
• /
• v.14 no.5
• /
• pp.301-307
• /
• 2016

The location measurement technique of moving worker in dangerous areas, is necessary for safety in the mines, basements, warehouses, etc. There are various measurement techniques about moving node of position in a restricted environment. Trigonometric Method, one of measurement techniques, is commonly used because of its easiness. However, errors occur frequently when measuring distance and position due to radio interference and physical disability with measuring instruments. This paper proposed a method which is more accurate and shows reduced margin of error than existing trigonometric method by recalculating distance between Anchor and moving node with various measuring instruments. By adding Anchor when calculating distance and position of moving node's estimated point, suggested technique obtains at least 41% efficiency compared to existing method.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.55-65
• /
• 2005

This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.4
• /
• pp.26-34
• /
• 2003

In this paper, a novel technique is proposed to arbitrarily activate the nodal points in finite element model through the meshless approximation methods such as MLS(moving least squares method), and theoretical investigations are carried out including the consistency and boundeness of numerical solution to prove the validity of the proposed method. By using the proposed node activation technique, one can activate and handle only the concerned nodes as unknown variables among the large number of nodal points in the finite element model. Therefore, the proposed technique has a great potential in design and reanalysis procedure.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.49 no.11
• /
• pp.749-756
• /
• 2000

Detent force develops generally undesirable effect that contributes to the output ripple of machine, vibration and noise. This paper proposes detent force minimization techniques for a Permanent Magnet Linear Synchronous Motor (PMLSM). In addition, thrust according to each minimization technique is estimated to observe the change of machine performance. A two-dimensional Finite Element Method is used to predict detent force and thrust due to structural factors and non-linearity. And moving node technique for geometric models is proposed to reduce modeling time and efforts.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.23-31
• /
• 2010

With the advances in the information technology and mobile communications, we now face increasing demands for various services based on both of position tracking of moving objects and their efficient index scheme. Accordingly, the $TPR^*$-tree, which were proposed for efficiently tracking moving objects and predicting their positions in the future time, has drawn much intention. As the $TPR^*$-tree came from the R-tree that is suitable for indexing static objects, it does not support cheap update costs. Therefore, it seems to be very costly to index moving objects if there are frequent occurrences of node updates caused by continuously changing velocities and positions. If some moving objects with high velocities have node updates, in particular, then the $TPR^*$-tree may suffer from many unnecessary updates in the wide range of tree regions. To avoid such a problem, we propose a method that can keep fast-moving objects in the child nodes of the root node, thereby saving node update costs in the $TPR^*$-tree. To show our performance advantages and retaining $TPR^*$-tree features, we performed some performance experiments using a simulation technique.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.54 no.10
• /
• pp.477-482
• /
• 2005

In this paper, detent force is minimized using notch and slot-aputure width adjustment in a slotted PMLSM. This time, the moving model node technique has used to reduce the time and the effort for calculation according to changing design parameters. As the result, the detent force of proposed model is decreased from 9.44[N] to 0.97[N] compare with it of basic model greatly. The thrust Is decreased 1.3[$\%$] from 342.07[N] to 337.48[N] a little. The notch is applied to PMLSM simply, the detent force is reduced greatly.