• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• Structural Engineering and Mechanics
• /
• v.18 no.1
• /
• pp.1-20
• /
• 2004

The paper presents a numerical method for the limit analysis of structures made of a rigid no-tension material. Firstly, we formulate the constrained minimum problem resulting from the application of the kinematic theorem, which characterizes the collapse multiplier as the minimum of all kinematically admissible multipliers. Subsequently, by using the finite element method, we derive the corresponding discrete minimum problem in which the objective function is linear and the inequality constraints are linear as well as quadratic. The method is then applied to some examples for which the collapse multiplier and a collapse mechanism are explicitly known. Lastly, the solution to the minimum problem calculated via numerical codes for quadratic programming problems, is compared to the exact solution.

• Journal of the Korean Physical Society
• /
• v.73 no.11
• /
• pp.1644-1649
• /
• 2018

Aiming at infrared thermal images with different buried depth defects, we study a variety of image segmentation algorithms based on the threshold to develop global search ability and the ability to find the defect area accurately. Firstly, the iterative thresholding method, the maximum entropy method, the minimum error method, the Ostu method and the minimum skewness method are applied to image segmentation of the same infrared thermal image. The study shows that the maximum entropy method and the minimum error method have strong global search capability and can simultaneously extract defects at different depths. However none of these five methods can accurately calculate the defect area at different depths. In order to solve this problem, we put forward a strategy of "divide and conquer". The infrared thermal image is divided into several local thermal maps, with each map containing only one defect, and the defect area is calculated after local image processing of the different buried defects one by one. The results show that, under the "divide and conquer" strategy, the iterative threshold method and the Ostu method have the advantage of high precision and can accurately extract the area of different defects at different depths, with an error of less than 5%.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3D
• /
• pp.383-389
• /
• 2011

The purpose of this paper is to analyze the blind spot for public transportation by level of service(LOS) in public transportation supply service. For the purpose, we proposed indices of service coverage area, service frequency and hours of service and analysis method for them. Service coverage area analysis is to decide station location and network design for the maximum beneficiary area. Moreover, we can use the service frequency is for the maximum service frequency decision and hours of service is for the minimum operation hours. The results of this study are applied to the plan of minimum supply service, minimum service frequency and minimum operation hours for city and national public transportation plan.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.5
• /
• pp.108-116
• /
• 2022

Started in 1989 as Public Permanent Rental Housing scheme, public rental housing lease policy is increasing target residents and supply in each government by introducing new supply types. However, public housing business entities have difficulties in expanding the supply due to cumulated deficit. The research suggested long-term public rental housing reconstruction business as a method to preserve the cumulated deficit from the previous. Minimum floor area ratio mathematical model was suggested by defining the floor area ratio of reconstruction business as minimum, since housing sales profit after reconstruction could preserve aggregated deficit, and mathematically approached by considering the traits of long-term public rental housing reconstruction. The determinant for minimum floor area ratio mathematical model comprise cumulated deficit of the existing long-term public rental housing, land size of reconstructed sale housing, housing sales price per unit area, and business cost per unit area. Minimum floor area ratio mathematical model is expected to be the milestone for supporting decision making regarding the economic part of old long-term public lease housings' reconstruction scale, and expanding housing supply within urban area.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1041-1044
• /
• 1998

In this paper the cellular neural networks with annealing capability is designed. The annealing capability helps the networks escape from the local-minimum points and quickly search for the global-minimum point. A 6$\times$6 CNN chip is designed using a $0.8\mu\textrm{m}$ CMOS technology, and the chip area is 2.89mm$\times$2.89mm. The simulation results for hole filling image processing show that the general CNN has a local-minimum problem, but the annealed CNN finds the global-minimum solutions very efficiently.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.451-452
• /
• 2008

In this paper we describe a multi-module, multi-port memory design procedure that satisfies area and/or energy constraints. Our procedure uses ILP models to determine (a) the memory configuration with minimum area, given the energy bound, (b) the memory configuration with minimum energy, given the area bound. If we have a margin in time constraint, we break up conflict edges and expend the search space of ILP. This method effectively reduces area and power of the designed results.

• Korean Institute of Interior Design Journal
• /
• v.26 no.4
• /
• pp.3-11
• /
• 2017

The appropriate area for human's most basic living space is an important factor. Therefore, the 'minimum housing standard' is a very important factor to ensure a minimum quality of living space for human life. In Korea, however, the importance of the 'minimum housing standard' has been neglected for about 20 years. Even in Korea, the 'minimum housing standard' has become an nominal existence. In other countries, studies have long been conducted on the minimum housing standards, but studies have shown that studies on the minimum housing standard are not actively occurring in Korea. The purpose of this study is to diagnose the current status of the 'minimum housing standard' in Korea and to explore the direction of future research. The study included a total of 29 researches commissioned by the Korea Academic Research Institute (KCI). To ensure the objectivity and reliability of the analysis, analyzed year of research, field of research, method of research, contents of research. Through this study, it is possible to grasp the tendency of previous studies on 'minimum housing standard' in Korea and it is meaningful to increase the usability of 'minimum housing standard' in residential planning. It is also expected that future research on 'minimum housing standards' will be able to present the direction of the field to be developed.

• Structural Engineering and Mechanics
• /
• v.15 no.1
• /
• pp.39-52
• /
• 2003

A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2325-2330
• /
• 2005

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.