• Journal of Astronomy and Space Sciences
• /
• v.25 no.2
• /
• pp.181-198
• /
• 2008

Designing satellite constellations providing partial coverage of certain regions becomes more important as small low-altitude satellites receives an increasing attention due to its cost-effectiveness analysis. Generally, Walker's method is a standard constellation method for global coverage but not effective for partial coverage. The purpose of this study is to design optimal constellation of satellites for effective observation in Korean peninsula regions. In this study, a new constellation design method is presented for partial coverage, using direct control of satellites' orbital elements. And also, a ground repeating circular orbit is considered for each satellite's orbit with the Earth oblateness effect. As the results, at least four satellites are required to observe the Korean peninsula regions effectively when minimum elevation angle is assumed as 12 degrees. The results from new method are better than those from the best Walker method. The proposed algorithm will be useful to design satellite constellation missions of Korea in future.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.17-24
• /
• 2006

We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2011

For rapid formed the ad hoc wireless backbone network in disaster scene, It is necessary for real-time deployment scheme of wireless ad hoc relay devices by first responders without pre-planning. However, in order to realize this scheme, redundant deployment should be minimized, as well as optimal location of relay devices should be selected to expand communication coverage. Therefore, in this paper, we propose a new deployment scheme of relay devices to optimize communication coverage and then through simulations showed that improved performance of algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.2
• /
• pp.87-95
• /
• 2015

In this study, we pursue a new direction for system modeling by introducing the concept of granular models, which produce results in the form of information granules (such as intervals, fuzzy sets, and rough sets). We present a rationale and several key motivating arguments behind the use of granular models and discuss their underlying design processes. The development of the granular model includes optimal allocation of information granularity through optimizing the criteria of coverage and specificity. The emergence and construction of granular models of type-2 and type-n (in general) is discussed. It is shown that achieving a suitable coverage-specificity tradeoff (compromise) is essential for developing granular models.

• Clinical and Experimental Pediatrics
• /
• v.53 no.5
• /
• pp.623-628
• /
• 2010

The mumps virus is a single-stranded, non-segmented, negative-sense RNA virus belonging to the $Paramyxoviridae$ family. Mumps is characterized by bilateral or unilateral swelling of the parotid gland. Aseptic meningitis is a common complication, and orchitis is also common in adolescents and adult men. Diagnosis is based on clinical findings, but because of high vaccination coverage, clinical findings alone are not sufficient for diagnosis, and laboratory confirmation is needed. Mumps is preventable by vaccination, but despite high vaccination coverage, epidemics occur in several countries, including Korea. Many hypotheses are suggested for these phenomena. In this review, we investigate the reason for the epidemics, optimal methods of diagnosis, and surveillance of immunization status for the prevention of future epidemics.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.206-214
• /
• 2003

In this paper, we propose a method to avoid obstacles that have unstable limit cycles in a chaos trajectory surface. We assume all obstacles in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle. When a chaos robot meets an obstacle in an Arnold equation or Chua's equation trajectory, the obstacle reflects the robot. We also show computer simulation results of Arnold equation and Chua's equation and random walk chaos trajectories with one or more Van der Pol obstacles and compare the coverage rates of each trajectory. We show that the Chua's equation is slightly more efficient in coverage rates when two robots are used, and the optimal number of robots in either the Arnold equation or the Chua's equation is also examined.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.255-262
• /
• 2011

Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.

• Journal of the Korean Home Economics Association
• /
• v.40 no.7
• /
• pp.157-172
• /
• 2002

The purpose of this study is to characterize body types of males in their twenties, and to provide information on body types of males by classifying them into groups. In addition, this study attempts to provide ways that can help improve the fit and coverage rate of ready-to-wear clothes by developing an apparel sizing system according to body types. 297 male subjects in their twenties participated in this study. 54 anthropometric and 35 photographic measurements were taken from each subject. After combining the body types of the front and the side into a whole body, we selected typical body types out of the combinations. It is shown that 84.64% of males in their twenties belong to the HI type, H/equation omitted/ type, X/equation omitted/ type, Xl type, Yl type, and HS type. To develop a new size system of clothes, the distribution of sizes was determined by using means and standard deviations for basic parts of each body type. Then, the most optimal sizes were selected separately for each body type to maximize the coverage rate.

• Journal of Trauma and Injury
• /
• v.36 no.4
• /
• pp.404-410
• /
• 2023

Large scalp defects resulting from high-voltage electrical burns require free flaps, preferably skin, to permit optimal coverage and enable future or simultaneous cranial vault reconstruction. The anterolateral thigh permits the harvest of a large area of skin supplied by a reliable perforator. The superficial temporal vessels offer the proximate choice of recipient vessels to enable adequate reach and coverage. The lack of a second vein at this site implies the inability to perform a second venous anastomosis; however, this obstacle can be overcome by using an interposition vein graft, to the neck veins primarily. This assures adequate venous drainage and complete flap survival.