• Journal of Information Processing Systems
• /
• 제5권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
• /
• 제18권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
• /
• 제73권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%.

• 대한토목학회논문집
• /
• 제31권3D호
• /
• pp.383-389
• /
• 2011

본 연구는 교통기본법(안)에 명시된 대중교통 사각지대 설정과 평가를 위한 3가지 평가척도를 제시하였다. 평가척도는 행정동 단위의 대중교통 노선 및 운행실태에 대한 기초 DB를 적용하여 대중교통 서비스권역, 대중교통 배차간격, 1일 총 운행시간을 각각 A-F(6등급)으로 구분하였다. 대중교통 사각지대 평가척도는 정부 및 지자체에서 대중교통 서비스 낙후지역의 최저 대중교통 공급 및 연계노선 계획, 최저배차계획, 1일 대중교통 총 운행시간 계획에 기준으로 활용할 수 있을 것이다.

• 한국건설관리학회논문집
• /
• 제23권5호
• /
• pp.108-116
• /
• 2022

1989년 영구임대주택으로 시작된 공공임대주택 정책은 매 정부마다 새로운 공급유형을 도입하며 입주대상과 재고량을 확대하고 있다. 하지만 공공임대주택 사업주체는 공공임대주택의 적자누적으로 공급확대에 어려움을 겪고 있다. 본 연구에서는 장기공공 임대주택 재건축사업을 기존 장기공공임대주택사업의 누적적자 보전방안으로 제시하였다. 재건축사업으로 공급되는 분양주택 수익으로 누적적자를 보전할 수 있는 재건축사업의 용적률을 최소용적률로 정의하고, 장기공공임대주택 재건축사업의 특성을 고려한 수리적 접근으로 장기공공임대주택 재건축사업 최소용적률 수리모델을 제시하였다. 최소용적률 수리모델의 결정요인은 기존 장기공공임대주택 누적적자, 재건축사업 분양주택 토지면적, 단위면적당 분양가격, 단위면적당 사업비로 구성된다. 최소용적률 수리모델은 노후 장기공공임대주택 재건축사업의 건축규모에 대한 경제적 측면의 의사결정 지원과 도심지 내 주택공급 확대와 관련된 의사결정을 지원하는 이정표가 될 것으로 사료된다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• 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.

• 한국실내디자인학회논문집
• /
• 제26권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
• /
• 제15권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년도 ICCAS
• /
• 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.