• Title/Summary/Keyword: Minimal area

Search Result 467, Processing Time 0.025 seconds

Sensitivity analysis of effective imperviousness estimation for small urban watersheds (도시 소유역 유효불투수율의 민감도 분석)

  • Kim, Dae Geun;Ko, Young Chan
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.23 no.2
    • /
    • pp.181-187
    • /
    • 2009
  • In this study, a runoff hydrograph and runoff volume were calculated by using the kinetic wave theory for small urban watersheds based on the concept of low impact development(LID), and the effective imperviousness was estimated based on these calculations. The degree of sensitivity of the effective imperviousness of small watersheds to the impervious to pervious area ratio, infiltration capability, watershed slope, roughness coefficient and surface storage depth was then analyzed. From this analysis, the following conclusions were obtained: The effective imperviousness and paved area reduction factor decreased as the infiltration capability of pervious area increased. As the slope of watersheds becomes sharper, the effective imperviousness and the paved area reduction factor display an increasing trend. As the roughness coefficient of impervious areas increases, the effective imperviousness and the paved area reduction factor tend to increase. As the storage depth increases, the effective imperviousness and the paved area reduction factor show an upward trend, but the increase is minimal. Under the conditions of this study, it was found that the effective imperviousness is most sensitive to watershed slope, followed by infiltration capability and roughness coefficient, which affect the sensitivity of the effective imperviousness at a similar level, and the storage depth was found to have little influence on the effective imperviousness.

Error Concealment Based on Semantic Prioritization with Hardware-Based Face Tracking

  • Lee, Jae-Beom;Park, Ju-Hyun;Lee, Hyuk-Jae;Lee, Woo-Chan
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.535-544
    • /
    • 2004
  • With video compression standards such as MPEG-4, a transmission error happens in a video-packet basis, rather than in a macroblock basis. In this context, we propose a semantic error prioritization method that determines the size of a video packet based on the importance of its contents. A video packet length is made to be short for an important area such as a facial area in order to reduce the possibility of error accumulation. To facilitate the semantic error prioritization, an efficient hardware algorithm for face tracking is proposed. The increase of hardware complexity is minimal because a motion estimation engine is efficiently re-used for face tracking. Experimental results demonstrate that the facial area is well protected with the proposed scheme.

  • PDF

A Study on the Planning Characteristics of Sustainable Housing Area (지속가능성의 함의를 고려한 주거지 계획특성 연구)

  • Kim, Myo-Jung
    • Journal of the Korean housing association
    • /
    • v.19 no.4
    • /
    • pp.107-119
    • /
    • 2008
  • The purpose of this study was to provide basic information about the study of model development of sustainable housing area. So, this study identified the concept of sustainable development and condition after investigation Habitat Agenda II, and the 10 items of agenda were used to constitute the case study framework. This study found the development characteristics through the case study of 6 sustainable housing areas in the world(US, UK and Australia), and searched the missing point in the sustainable development concept. The major findings are summarized as follows: First, the attempt of environmental sustainability was restrictive such as minimal environment pollution and waste, water resource protection and conservation of nature ecosystem. Second, in social-culture sustainability, the effort of right to housing, solution of urban squatter and housing welfare eliminated. Third, in economic sustainability, the attempt of prevent natural disaster, technological and industrial disaster excluded.

Reconstruction of Soft Tissue Defect of Knee Joint Area Using Anterolateral Thigh Perforator Flap (전외측 대퇴부 천공지 피판을 이용한 슬관절부의 연부조직 결손의 재건)

  • Oh, Seung Il;Eun, Seok Chan;Baek, Rong Min
    • Archives of Reconstructive Microsurgery
    • /
    • v.20 no.2
    • /
    • pp.96-101
    • /
    • 2011
  • Reconstruction of soft tissue defect of knee joint area has been remained a challenging task for plastic surgeons. The earlier the normal tissue saved and the necrotic tissue removed, the less the patients had complications and functional disability. But such defects are difficult to manage for its poor vascularity, rigid tissue distensibility, easy infectability and a relatively long healing period. The goal of flap coverage in the knee joint should not only be satisfactory wound coverage, but also acceptable appearance and minimal donor site morbidity. We have treated five cases using the anterolateral thigh perforator flaps for reconstruction successfully. In conclusion, we believe that in cases of knee joint area soft tissue defects, flaps like anterolateral thigh perforator flap should be considered as the first line of treatment.

  • PDF

Allocating Storage Spaces for Temporary Inventories Considering Handling, Transportation, and Storage Capacities (취급, 수송 및 저장능력을 고려한 임시 재고의 저장 공간 할당)

  • Won Seung-Hwan;Kim Kap-Hwan
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.11-25
    • /
    • 2006
  • Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

Complete Coverage Path Planning for Multi-Robots (멀티로봇에 대한 전체영역 경로계획)

  • Nam, Sang-Hyun;Shin, Ik-Sang;Kim, Jae-Jun;Lee, Soon-Geul
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.26 no.7
    • /
    • pp.73-80
    • /
    • 2009
  • This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time.

State Assignment Method for Control Part Implementation of Effective-Area (효율적인 면적의 제어부 실현을 위한 상태 할당 방법)

  • Park, S.K.;Choi, S.J.;Cho, J.W.;Jong, C.W.;Lim, I.C.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1556-1559
    • /
    • 1987
  • In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

  • PDF

A study on the Power Distribution Synthesis and Area Optimization of VLSI Circuits (VLSI회로의 전력분배 합성과 면적 최적화에 관한 연구)

  • 김현호;이천희
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.63-69
    • /
    • 1998
  • The area optimization of the power distribution network is an important problem in the layout design of VLSI systems. In this paper we propose noval methods to solve the problem of designing minimal area power distribution nets, while satisfying voltage drop and electromigration constraints. We propose two novel greedy heuristics for power net design-one based on bottom-up tree construction using greedy merging and the other based on top-down linearly separable partitioning.

  • PDF

Fanout Constrained Logic Synthesis (Fanout 제약 조건하의 논리 회로 합성)

  • 이재형;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.5
    • /
    • pp.387-397
    • /
    • 1991
  • This paper presents the design and implementation of a performance-driven logic synthesis system that automatically generates circuits satisfying the given timing and fanout constraints in minimal silicon area. After performing technology independent and dependent optimization, the system identifies and resynthesizes the gates with large loading delay due to excessive fanouts to eliminate the critical path. Experimental results for MCNC benchmark circuits show that proposed system generates the circuits with less delay by up to 20%.

  • PDF

Transformations of Partial Matchings

  • Nakamura, Inasa
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.2
    • /
    • pp.409-439
    • /
    • 2021
  • We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a partial matching, and the lattice polytope associated with a pair of lattice presentations, and we investigate transformations with minimal area.