• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.413-418
• /
• 2004

The purpose of this research calculates the map manufacture cost and there are we even though we determine proper map price. We distinguished the budget item of NGI in 2003 with the direct cost to the overhead cost. A map manufacture cost classified a direct and overhead cost as a nap manufacture cost commonness cost and no relation cost and was calculated. The result to analyze the item of the charge, It is impossible to withdraw the map manufacture cost selling the map. This is because a map sale price inexpensive than the map manufacture price. We presented a two alternative in research to see consequently about a map price raising.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.207-213
• /
• 2006

Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.1 s.31
• /
• pp.27-35
• /
• 2005

It is impossible to call in the cost of map-production from the supply cost because the map produced in NGI is the public property. The aims of this research are to calculate a map manufacture cost and to assess the reasonable map prices with considering public property of map. For these aims, We have calculated the cost according to the scale and the form of paper and digital map, have determined the map supply cost, and have analyzed the situation of map supply and the map circulation market. We propose two alternatives. Firstly, supply price of map is reached the goal price after 6-years(raising ratio 30%) and Secondly, supply price of map is reached the goal price after 3-years(raising ratio 50%) because map supply price raising ratio is very much if research results are reflected after 1-year.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.323-326
• /
• 2007

Mobility Anchor Points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro handoff. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we proposed a cost effective MAP selection scheme. When leaving the current MAP domain. the mobile node calculates the optimum MAP domain size to minimize the local mobility cost at the new MAP domain considering mobile node's velocity and packet transmission rate. The mobile node then selects a MAP domain of size close to the optimum domain size calculated among the candidate MAP domains. In this way, it is possible for the mobile node to select an optimal MAP adaptively taking the network and node states into account, thus reducing the communication cost.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.169-176
• /
• 2009

Low-cost sensors have been widely used for mobile robot navigation in recent years. However, navigation performance based on low-cost sensors is not good enough to be practically used. Among many navigation techniques, building of an accurate map is a fundamental task for service robots, and mapping with low-cost IR sensors was investigated in this research. The robot's orientation uncertainty was considered for mapping by modifying the Bayesian update formula. Then, the data association scheme was investigated to improve the quality of a built map when the robot's pose uncertainty was large. Six low-cost IR sensors mounted on the robot could not give rich data enough to align the range data by the scan matching method, so a new sample-based method was proposed for data association. The real experiments indicated that the mapping method proposed in this research was able to generate a useful map for navigation.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.5
• /
• pp.511-518
• /
• 2015

As the cost-per-byte of SSDs dramatically decreases, the introduction of SSDs to Hadoop becomes an attractive choice for high performance data processing. In this paper the cost-per-performance of SSD-based Hadoop cluster (SSD-Hadoop) and HDD-based Hadoop cluster (HDD-Hadoop) are evaluated. For this, we propose a MapReduce performance model using queuing network to simulate the execution time of MapReduce job with varying cluster size. To achieve an accurate model, the execution time distribution of MapReduce job is carefully profiled. The developed model can precisely predict the execution time of MapReduce jobs with less than 7% difference for most cases. It is also found that SSD-Hadoop is 20% more cost efficient than HDD-Hadoop because SSD-Hadoop needs a smaller number of nodes than HDD-Hadoop to achieve a comparable performance, according to the results of simulation with varying the number of cluster nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.103-110
• /
• 2006

Internet engineering task force (IETF) has proposed hierarchical mobile IPv6 (HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6 (MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point the processing cost of packet at the MAP is influenced by the packet arrival rate for a mobile node and the number of mobile nodes in MAP domain. In this paper, we propose that MIPv6 and HMIPv6 are adaptively selected to minimize signaling coast of network as complementing weak point of MIPv6 and HMIPv6. After suppose that the packet arrival rate for a mobile node is fixed ,with this in mind, we find the optimal number of mobile nodes compared the total cost of HMIPv6 with the total cost of MIPv6. And if Mobile Nodes that the MAP is able to manage is full in MAP domain, a mobile node entering MAP domain is provided connection by MIPv6 instead of HMIPv6. In the conclusion, the proposed method of this paper shows that the weak points of MIPv6 and HMIPv6 are removed by adaptive selecting each other.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2208-2212
• /
• 2008

This paper deals with the cost reduction design of a single-phase line-start permanent magnet(LSPM) motor. Due to high cost of the permanent magnet(PM), cost reduction can be effectively achieved by reducing PM volume. Therefore, motor characteristics according to the PM volume are calculated by using d-q axis equivalent circuit analysis, and the characteristic map is made. In the characteristic map, maximum torque and efficiency are shown according to motor parameters such as back electromotive force(back emf) and inductances; back emf represents the PM volume. Minimum back emf and inductances satisfying output performance are determined in the characteristic map. Then, motor geometry based on the prototype motor is optimized to get the determined parameters using response surface methodology(RSM) and finite element method(FEM). Through the presented cost reduction design, total PM volume is reduced to 32% of prototype model.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.11a
• /
• pp.303-310
• /
• 2008

In Korea, the current noise impact assessment has not yet considered the vertical noise propagation property by buildings and other obstacles. And noise control plan has been established without conducting the economic assessment for the noise control facilities. A noise map is used to calculate the noise level based on a theoretical formula or an empirical formula, and also predict the characteristics of vertical propagation by linking with a geometry data. And It is Possible to analyze cost-effect of noise control facilities by consider installation costs. In this study, we addressed the application of noise map for noise impact assessment and cost-effect analysis of noise control facilities.