• Title/Summary/Keyword: Space allocation

Search Result 328, Processing Time 0.025 seconds

A Study on the Characteristics of Planning within Each Type of Multi-Family Housing (공동주택단지의 유형별 계획특성에 관한 연구)

  • Choi Moo-Hyun
    • Journal of the Korean housing association
    • /
    • v.17 no.4
    • /
    • pp.83-91
    • /
    • 2006
  • Although the large supply of multi-family housings played a very important role in forming the urban structure and allocation of functions, and also enhanced the whole level of housing environment, it caused several problems relating to physical form such as isolation of housing estate, inhumanity of the exterior space, and mismatch with the urban structure. To handle these problems, the purpose of this study is to analyse design elements which have a direct impact on physical forms, thereby understand the characteristics of planning. Therefore design elements are reformed into respective analyzing indices. This study analyzes design elements based on analysing indices. Thus, several important results were found from the Factor Analysis and after classifying housing estates into several types, the study found the characteristics of planning within each type of housing estates.

A Study on Low Power Force-Directed scheduling for Optimal module selection Architecture Synthesis (최적 모듈 선택 아키텍쳐 합성을 위한 저전력 Force-Directed 스케쥴링에 관한 연구)

  • Choi Ji-young;Kim Hi-seok
    • Proceedings of the IEEK Conference
    • /
    • 2004.06b
    • /
    • pp.459-462
    • /
    • 2004
  • In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. A a reducing power consumption of a scheduling for module selection under the time constraint execute scheduling and allocation for considering the switching activity. The focus scheduling of this phase adopt Force-Directed Scheduling for low power to existed Force-Directed Scheduling. and it constructs the module selection RT library by in account consideration the mutual correlation of parameters in which the power and the area and delay. when it is, in this paper we formulate the module selection method as a multi-objective optimization and propose a branch and bound approach to explore the large design space of module selection. Therefore, the optimal module selection method proposed to consider power, area, delay parameter at the same time. The comparison experiment analyzed a point of difference between the existed FDS algorithm and a new FDS_RPC algorithm.

  • PDF

Distribution Feeder Reconfiguration Using Heuristic Rules (경험적 규칙을 이용한 배전계통의 재구성기법)

  • Cho, Si-Hyung;Choi, Byoung-Youn;Woo, Kwang-Bang
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.363-365
    • /
    • 1991
  • This paper presents a method for feeder reconfiguration in order to operate distribution systems efficiently using heuristic rules. The reconfiguration method presented here not only eliminates various abnormal states but also achieves minimum power loss and optimum load balance of the distribution feeders under normal operating condition transfering loads from one feeder to anoter applying the experiences of the experts. To implement the method effectively, a best-first tree searching strategy based on heuristics is used to evaluate the various load transfer alternatives. The development of a rule-based system aimed at the reduction of the search space is presented as a means of implementing the best-first searching strategy. The results of the computer simulation of the above procedure are as follows; 1) achieving minimum power loss of the distribution feeder adopting the optimum load transfer alternative. 2) Enhencing system reliability and achieving load balance through rational allocation of the feeder loads.

  • PDF

An Operating System Design and Development for Efficient Painting Process

  • Chung, Kuy-Hoon;Baek, Tae-Hyun;Park, Ju-Chull;Cho, Kyu-Kab
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.183-187
    • /
    • 2000
  • In this study, we design a scheduling system for painting shop, called HYPOS(Hyundai heavy industry Painting shop Operating System) and develop a system implementing the design. The painting shop operations are currently scheduled manually by experts. Manual scheduling is a serious time consuming job and generally can not guarantee a full optimality. Building a traditional heuristic scheduling system lot this problem, however, is not promising because there are various kinds of constraints to be satisfied including space allocation of shipbuilding blocks in a painting cell. We, therefore, adopt a spatial scheduling approach and develop scheduling algorithms based on field-oriented scheduling heuristics and computational geometry. And we show that the algorithms can successfully be applied to the painting shop scheduling problem.

  • PDF

Application of Work Relationships for Linear Scheduling Model (선형 공정계획 모델의 작업 관계성 적용 방법)

  • Rye, Han-Guk
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2010.05a
    • /
    • pp.131-133
    • /
    • 2010
  • As linear scheduling method has been used since 1929, Empire State Building linear schedule, it is being applied in various fields such as construction and manufacturing. When addressing concurrent critical path occurring on linear schedule of construction, the empirical researches stress the resource management which should be applied for optimizing work flow, flexible work productivity and continuos resource allocation. However, work relationships has been usually overlooked for making the linear schedule from existing network schedule. Therefore, this research analyze the previous researches related to linear scheduling model and then propose the method that can be applied for adopting the relationships of network schedule to the linear schedule.

  • PDF

A New Mobile-IPv6 based Buffering Scheme in the All-IP Network

  • Park, Byoung-Seob;Lim, Cheol-Su
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1094-1097
    • /
    • 2002
  • Realtime applications like VoIP(Voice over IP) in All-IP networks need smooth handoffs in order to minimize or eliminate packet loss as a Mobile Host(MH) transitions between network links. In this paper, we design a new dynamic buffering(DB) mechanism for IPv6 by which an MH can request that the router on its current subnet buffers packets on its behalf while the MH completes registration procedures with the router of a new subnet. Performance results show that our proposed buffering scheme with a dynamic buffer space allocation is quite appropriate for mobile Internet, or the All-IP environment in terms of the datagram loss rate.

  • PDF

Development and Testing of Satellite Operation System for Korea Multipurpose Satellite-I

  • Mo, Hee-Sook;Lee, Ho-Jin;Lee, Seong-Pal
    • ETRI Journal
    • /
    • v.22 no.1
    • /
    • pp.1-11
    • /
    • 2000
  • The Satellite Operation System (SOS) has been developed for a low earth orbiting remote sensing satellite, Korea Multipurpose Satellite-I, to monitor and control the spacecraft as well as to perform the mission operation. SOS was designed to operate on UNIX in the HP workstations. In the design of SOS, flexibility, reliability, expandability and interoperability were the main objectives. In order to achieve these objectives, a CASE tool, a database management system, consultative committee for space data systems recommendation, and a real-time distributed processing middle-ware have been integrated into the system. A database driven structure was adopted as the baseline architecture for a generic machine-independent, mission specific database. Also a logical address based inter-process communication scheme was introduced for a distributed allocation of the network resources. Specifically, a hotstandby redundancy scheme was highlighted in the design seeking for higher system reliability and uninterrupted service required in a real-time fashion during the satellite passes. Through various tests, SOS had been verified its functional, performance, and inter-face requirements. Design, implementation, and testing of the SOS for KOMPSAT-I is presented in this paper.

  • PDF

APPROXIMATE ANALYSIS OF AN N-DESIGN CALL CENTER WITH TWO TYPES OF AGENTS

  • Park, Chul-Geun;Han, Dong-Hwan;Baik, Kwang-Hyun
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.1021-1035
    • /
    • 2008
  • In this paper, we analyze an N-design call center with skill-based routing, in which one pool of agents handles two types of calls and another pool of agents handles only one type of calls. The approximate analysis is motivated by a computational complexity that has been observed in the direct stochastic approach and numerical method for finding performance measures. The workforce staffing policy is very important to the successful management of call centers. So the allocation scheduling of the agents can be considered as the optimization problem of the corresponding queueing system to the call center. We use a decomposition algorithm which divides the state space of the queueing system into the subspaces for the approximate analysis of the N-design call center with two different types of agents. We also represent some numerical examples and show the impact of the system parameters on the performance measures.

  • PDF

Two-Stage Hybrid Flow Shop Scheduling: Minimizing the Number of Tardy Jobs (2 단계 혼합흐름공정에서의 일정계획문제에 관한 연구)

  • Choi Hyun-Seon;Lee Dong-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1133-1138
    • /
    • 2006
  • This paper considers a hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. The hybrid flow shop consists of two stages in series, each of which has multiple identical parallel machines, and the problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also derived to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

  • PDF

Development of an Integrated System for Cooperative Design - Application for Very Large Floating Structures (협업기반 설계 통합 시스템 개발 - 초대형 해상구조물에의 획용)

  • Park, Seong-Whan;Lee, Jai-Kyung;Cho, Gui-Mok;Han, Soon-Hung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.13 no.6
    • /
    • pp.412-420
    • /
    • 2008
  • In order to design the large complex structures like VLFS (Very Large Floating Structures), it is essential the cooperation between the experts in various fields; structural engineering expert, fluid mechanics expert, mooring system engineer, and so on. This paper describes the development of an integrated system to support the cooperative design between various experts and project manager. This integrated system is designed to be operated in Web environment and it contains the support of design DB and 3D graphical tool, negotiation tool for task allocation, and various engineering supporting tools for each design step. The user group of this system can be classified as Project Manager, Engineering Expert, DB Builder, and System Administrator. All of the engineering data is saved after and during the process of the design projects and all participants can be connected by Internet without the limit of time or space constraints.