• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.6
• /
• pp.708-714
• /
• 2018

Islanded operation of a microgrid can ensure the reliable operation of the system when a large accident occurs in the main grid. However, because the generation capability of a microgrid is typically limited, a microgrid operator should take islanded operation risk into account in scheduling its generation resources. To address this problem, in this paper we have proposed two unit commitment formulations based on the islanding scenario that reflect the expected and worst-case values of the islanded operation risk. An optimal resource scheduling strategy is obtained for the microgrid operator by solving these optimization problem, and the effectiveness of the proposed method is investigated by numerical simulations.

• Proceedings of the KIEE Conference
• /
• 1995.07a
• /
• pp.376-378
• /
• 1995

A voltage-temperature limit circuit for the Ni-H2 battery is designed and analyzed for the maximum and the minimum voltage deviations at the worst case of the EOL(end of life). It is demonstrated that the magnitude of voltage deviations due to circuit device tolerances are kept less than 0.3v at the worst case. The maximum and the minimum battery voltages are simulated for the environmental temperature range of $0^{\circ}C-30^{\circ}C$ by using MATHCAD. They are 34.67v and 29.851v, respectively.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.677-680
• /
• 2003

In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1722-1729
• /
• 2008

This paper describes the contents about the efficient routing technique for improvement of transmission in Wireless Sensor Networks. Existing flat-based routing protocols have several problems like data overlap and implosion. Gossiping Algorithm in WSN is able to reduce the overhead and transmit packets through already set up the path but it takes place the data delivery and problem of worst-case. In this paper, we try to solve two problems that are data delivery and worst-case by selecting neighbor nodes using RSSI and number of linkage. The proposed model is available to real-mote and we confirmed the improvement of the performance against existing models.

• Korean Journal of Hazardous Materials
• /
• v.3 no.1
• /
• pp.52-58
• /
• 2015

Since the HF release in 2012 in Korea, it became one of the most significant to evaluate consequence to the vicinity of industry facilities handling hazardous materials. BTX plant is selected to assess off-site risk to check whether the facility satisfies the Chemical Control Law by Korea Government. Accident scenarios were listed using process safety information. The scenarios having effect to the off-site were selected and assessed further according to guideline provided by Korea government. Worst case and alternative scenarios including other interested scenarios were evaluated using ALOHA. Each evaluated scenario was assessed further considering countermeasures. The results showed that the facility handling chloric acid is safe enough and needed no further protections at the moment.

• Korean Journal of Hazardous Materials
• /
• v.3 no.1
• /
• pp.59-64
• /
• 2015

Semiconductor industry has large number of chemical inventory and is easily exposed to chemical release incidents. Toxic release is one of the most interested area in evaluating consequence to the vicinity of industry facilities handling hazardous materials. Hydrofluoric acid is one of the typical chemical used in semiconductor facility and is selected and toxic release is evaluated to assess the risk impacted to its off-site. Accident scenarios were listed using process safety information. The scenarios having effect to the off-site were selected and assessed further according to guideline provided by Korea government. Worst case and alternative scenarios including other interested scenarios were evaluated using ALOHA. Each evaluated scenario was assessed further considering countermeasures. The results showed that the facility handling hydroflooric acid is safe enough and needed no further protections at the moment.

• ETRI Journal
• /
• v.11 no.1
• /
• pp.109-122
• /
• 1989

We developed new quadtree and octree representation schemes which reduce the storage requirements from exponential to polynomial. The new schemes not only lessen the large storage requirements of the existing quadtree and octree representation schemes but guarantee an exact representation of the original object. These are made possible by adopting a new set of termination conditions that ensure finiteness of the quadtree and octree during the decomposition. These new data structures are analyzed theoretically and tested empirically. For space complexity, we analyzed its best case, worst case, and average case. Given an $n_e$-gon, we show that the expected number of nodes in our quadtree isO($$$n_e^1.292$) For a polyhedron with $n_f$ faces, the expected number of nodes in the new octree is O($$$n_f^1.667$). For time complexity, we again analyzed the best, worst, and average cases for constructing such quadtree and octree and find the average to be the same as those of the space complexity. Finally, random $n_e$- gons are generated as test data. Regression equations are fitted and are shown to support the claims on the average case performance.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.09a
• /
• pp.304-305
• /
• 2005

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.4D
• /
• pp.547-553
• /
• 2011

This study has redefined the concepts of mobility indexes and potential demand, standards to evaluate areas with the worst public transportation system and applied the relevant indexes to select the areas with the worst public transportation mobility and present a method to set direct public transportation lines between these regions. The mobility indexes and indexes to evaluate potential demand were applied to select the regions with the worst public transportation systems in four metropolitan cities and case studies were carried out on direct lines provided between these regions. The analysis results showed that in public transportation mobility blind spots, public transportation takes much longer than driving an automobile or public transportation services are not provided. In addition, the analysis showed that a direct lines system to solve such worst off regions should be built to have public transportation take as much time as driving an automobile by establishing lines for automobiles only, minimize time lost from hopping up and down a bus and maximize connections.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.911-919
• /
• 2004

IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.