• 제목/요약/키워드: completion

검색결과 3,445건 처리시간 0.032초

이머징 마켓에 대한 전력산업 수출화전략과 프로젝트 파이낸싱 (The Relationship between Project Financing and Exportation Strategy towards Emerging Market in Electric Power Industry)

  • 이근대;이창호
    • 한국기술혁신학회:학술대회논문집
    • /
    • 한국기술혁신학회 2001년도 춘계학술대회:발표자료
    • /
    • pp.557-572
    • /
    • 2001
  • This study tries to analyze the possibility of application of project financing to electricity industry and analyze the management of risks happening in the process of foreign project procurement and construction. Those are based on the trends and analysis of project financing in foreign projects. Risks are 'classified as risks before completion of projects and risks after completion. Project financing is key element of exportation and financial strategies and activation of project financing may provide the acceleration of the efficient financial market.

  • PDF

건축물 준공년수 경과에 따른 단열재의 물성변화에 관한 연구 (A Study on the Physical Properties of Insulation Materials according to the Period of Building Construction)

  • 김현진;최세진
    • 한국건축시공학회:학술대회논문집
    • /
    • 한국건축시공학회 2018년도 추계 학술논문 발표대회
    • /
    • pp.92-93
    • /
    • 2018
  • This study analyzed the physical properties of insulation materials upon completion of building completion years and found the suitability of the current energy performance analysis methodology to apply the insulation specified in the design drawings to the same thermal conductivity values as the new materials.

  • PDF

두개의 공통납기에 대한 작업완료시간의 W.M.A.D. 최소화에 관한 연구 (Minimizing the Weighted Mean Absolute Deviation of Job Completion Times about Two Common Due Dates)

  • 오명진;이상도
    • 산업경영시스템학회지
    • /
    • 제14권24호
    • /
    • pp.111-121
    • /
    • 1991
  • This paper considers a non preemtive single processor scheduling problem in which each set have the two common due dates. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such two common due dates under the assumption that each job has a different weight. Such a job sequence is an W-shaped sequence. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. The performance comparison is made among three heuristic scheduling procedures.

  • PDF

SEMI-CUBICALLY HYPONORMAL WEIGHTED SHIFTS WITH STAMPFLI'S SUBNORMAL COMPLETION

  • Baek, Seunghwan;Lee, Mi Ryeong
    • 대한수학회논문집
    • /
    • 제34권2호
    • /
    • pp.477-486
    • /
    • 2019
  • Let ${\alpha}:1,(1,{\sqrt{x}},{\sqrt{y}})^{\wedge}$ be a weight sequence with Stampfli's subnormal completion and let $W_{\alpha}$ be its associated weighted shift. In this paper we discuss some properties of the region ${\mathcal{U}}:=\{(x,y):W_{\alpha}$ is semi-cubically hyponormal} and describe the shape of the boundary of ${\mathcal{U}}$. In particular, we improve the results of [19, Theorem 4.2].

Study of an In-order SMT Architecture and Grouping Schemes

  • Moon, Byung-In;Kim, Moon-Gyung;Hong, In-Pyo;Kim, Ki-Chang;Lee, Yong-Surk
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권3호
    • /
    • pp.339-350
    • /
    • 2003
  • In this paper, we propose a simultaneous multithreading (SMT) architecture that improves instruction throughput by exploiting instruction level parallelism (ILP) and thread level parallelism (TLP). The proposed architecture issues and completes instructions belonging to the same thread in exact program order. The issue and completion policy greatly reduces the design complexity and hardware cost of our architecture, compared with others that employ out-of-order issue and completion. On the other hand, when the instructions belong to different threads, the issue and completion orders for those instructions may not necessarily be identical to the fetch order. The processor issues instructions simultaneously from multiple threads to functional units by exploiting ILP and TLP, and by dynamic resource sharing. That parallel execution notably improves performance and resource utilization with minimal additional hardware cost over the conventional superscalar processors. This paper proposes an SMT architecture with grouping as well as one without grouping. Without grouping, all threads dynamically and flexibly share most resources. On the other hand, in the SMT architecture with grouping, in which resources and threads are divided into several groups for design simplification, resources are shared only among threads belonging to the same group as those resources. Simulation results show that our processors with four and eight threads improve performance by three or more times over the conventional superscalar processor with comparable execution resources and policies, and that reasonable grouping reduces the design complexity of SMT processors with little negative effect on performance.