• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2001년도 학술대회지
• /
• pp.379-382
• /
• 2001

국내 건설프로젝트는 공정관리와 원가관리의 이원적 관리체계를 가지고 있으며, 공정관리는 아직 그 체계가 미흡하고 상대적으로 관리의 중요도가 낮게 평가되고 있는 현실이다. 현재의 원가위주의 관리체계로는 프로젝트 진행과정상의 수행성과를 정확히 파악하기 어려우며, 이에 따라 공기지연, 공사비초과, 생산성저하 둥의 문제가 야기되고 있다. 따라서 프로젝트를 계획된 기간과 비용안에 효율적으로 완성하기 위해서는 비용과 일정의 통합관리를 통한 정확한 실적관리기법의 도입이 요구된다. 이에 본 연구에서는 실공정을 중심으로 한 실적관리를 통해 프로젝트의 성과를 정확히 파악하여 성공적 프로젝트 수행을 위한 방안으로 비용과 일정의 통합관리를 통한 실적관리 모델을 제시하였다.

• 한국도로학회논문집
• /
• 제18권4호
• /
• pp.19-28
• /
• 2016

PURPOSES : Long-life asphalt pavements are used widely in developed countries. In order to be able to devise an effective maintenance strategy for such pavements, in this study, we evaluated the performance of the long-life asphalt pavements constructed along the national highways in South Korea. Further, an economic evaluation of the long-life asphalt pavements was performed based on a life-cycle cost analysis. We aimed to devise a model for evaluating the performance of long-life asphalt pavements using the national highway pavement management system (PMS) database as well as for analyzing the economic feasibility of such pavements, in order to promote their use in South Korea. METHODS : The maintenance history and pavement performance data were obtained from the national highway PMS database. The pavement performances for a total of 292 sections of 10 lanes (5 northbound lanes and 5 eastbound lanes) of national highways were used in this study. Models to predict the performances of hot mix asphalt (HMA) and long-life asphalt pavements under two distinct traffic conditions were developed using a simple regression method. Further, the economic feasibility of long-life asphalt pavements was evaluated using the Korea Pavement Management System (KoPMS). RESULTS : We developed service-life prediction models based on the traffic volume and the equivalent of single-axle load and found that long-life asphalt pavements have service lives 50% longer than those of HMA pavements. Further, the results of the economic analysis showed that long-life asphalt pavements are superior in terms of various economic indexes, including user cost, delay cost, total cost, and user benefits, even though their maintenance cost is higher than that of HMA pavements. A comparison of the economic feasibilities of the various groups showed that group A is superior to HMA pavements in all aspects except in terms of the maintenance criterion (crack 20% or higher) as per the NPV index. However, the long-life asphalt pavements in group B were superior in terms of the maintenance criterion (crack 25% or higher) regardless of the economic feasibility. CONCLUSIONS : The service life of long-life asphalt pavements was found to be approximately 50% longer than that of HMA pavements, regardless of the traffic volume characteristics. The economic feasibility of long-life asphalt pavements was evaluated based on the KoPMS. The results of the economic analysis were the following: long-life asphalt pavements are exceptional in terms of almost all factors, such as user cost, delay cost, total cost, and user benefit; however, the exception is the maintenance cost. Further, the economic feasibility of the long-life asphalt pavements in group B was found to be better than that of the HMA pavements (crack 25% or higher).

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• 산업경영시스템학회지
• /
• 제14권23호
• /
• pp.19-25
• /
• 1991

In this paper, constrained resource project scheduling problems schedule project activities subject to finite constraints on the availability of non-storable resource. Further, resources are assumed to be available per period in constant amounts, and are also demanded by an activity in constant amounts throughout the duration of the activity. We describe formulation which minimizes the combined cost of fluctuations in resource demand and delay of project completion. Cost bounding procedures are augmented by dominance relationships presented as theorems. This paper presents algorithm for solving the problem. And numerical examples are presented. Sensitivity analysis to evaluate the effect of changes of cost efficients is conducted.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2023년도 봄 학술논문 발표대회
• /
• pp.407-408
• /
• 2023

This article proposes a method to assess construction safety risk during the construction phase based on accident loss costs. Risk assessments for hazardous construction work are required by law, but they lack quantitative criteria. To address this, a survey estimated loss costs due to fatalities in the construction industry, finding labor loss cost and delay reimbursement cost to be the largest factors. The proposed method uses algorithm to calculate expected accidents and risk levels based on project characteristics, work methods, personnel, and environment data. This method is expected to enhance the reliability and usability of risk assessments during the construction phase of construction projects.

• IEIE Transactions on Smart Processing and Computing
• /
• 제1권3호
• /
• pp.152-160
• /
• 2012

This paper proposes a frame-level rate control algorithm for low delay video applications to reduce the fluctuations in the bitrate. The proposed algorithm minimizes the bitrate fluctuations in two ways with minimal coding loss. First, the proposed rate control applies R-Q model to all frames including the first frame of every group of pictures (GOP) except for the first one of a sequence. Conventional rate control algorithms do not use any R-Q models for the first frame of each GOP and do not estimate the generated-bit. An unexpected output rate result from the first frame affects the remainder of the pictures in the rate control. Second, a rate-distortion (R-D) cost is calculated regardless of the hierarchical coding structure for low bitrate fluctuations because the hierarchical coding structure controls the output bitrate in rate distortion optimization (RDO) process. The experimental results show that the average variance of per-frame bits with the proposed algorithm can reduce by approximately 33.8% with a delta peak signal-to-noise ratio (PSNR) degradation of 1.4dB for a "low-delay B" coding structure and by approximately 35.7% with a delta-PSNR degradation of 1.3dB for a "low-delay P" coding structure, compared to HM 8.0 rate control.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제3권1호
• /
• pp.15-22
• /
• 2014

지연 감내 네트워크는 지속적인 연결이 보장되지 않고 저장(Store), 운반(Carry), 전달(Forward) 방식의 메시지 전달을 사용 하는 네트워크이다. 이러한 지연 감내 네트워크에서 메시지 전달은 중요한 연구 이슈이며, 최근 많은 라우팅 기법들이 제안되었다. 본 논문에서는 노드들의 사회관계와 확장 매개 중심도를 이용하여 효율적인 지연 감내 네트워크에서 라우팅 기법을 제안한다. 시뮬레이션 결과를 통해 Epidemic routing, Friendship routing에 비해 적은 메시지 전달 성공률차이를 유지하며, 메시지 전달 비용에는 효율적임을 보인다.

• Journal of Communications and Networks
• /
• 제15권5호
• /
• pp.496-503
• /
• 2013

In an orthogonal frequency division multiplexing system, conventional interpolation techniques cannot correctly balance performance and overhead when estimating dynamic long-delay channels in single frequency networks (SFNs). In this study, classical filter analysis and design methods are employed to derive a complex interpolator for maximizing the resistible echo delay in a channel estimator on the basis of the correlation between frequency domain interpolating and time domain windowing. The coefficient computation of the complex interpolator requires a key parameter, i.e., channel length, which is obtained in the frequency domain with a tentative estimation scheme having low implementation complexity. The proposed complex adaptive interpolator is verified in a simulated digital video broadcasting for terrestrial/handheld receiver. The simulation results indicate that the designed channel estimator can not only handle SFN echoes with more than $200{\mu}s$ delay but also achieve a bit-error rate performance close to the optimum minimum mean square error method, which significantly outperforms conventional channel estimation methods, while preserving a low implementation cost in a short-delay channel.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권8호
• /
• pp.353-362
• /
• 2006

This paper illustrates the practical design procedure on a position control of an electrical fin actuator for the guided missile using Time Delay Control(TDC) and Enhanced Time Delay Observer(ETDO). Since TDC is robust to the model uncertainties such as the parameter variation and the external disturbance, it has been frequently used in nonlinear control systems. For a position control of an electrical fin actuator in the missile system, TDC requires the velocity sensor as well as the position sensor. To resolve the problems of the cost, the space and the malfunction due to the velocity sensor, ETDO is used as the velocity observer. ETDO is enhanced version of TDO that has the problems of the reconstruction errors and the restriction on selecting its gains. To maximize the control performance, the parameters of ETDO are optimized by using the genetic algorithm. The effectiveness of this approach is proved through a series of simulation studies and experiments, and the designed controller is compared with the typical TDC and TDC using the reduced oder observer.

• 한국정보통신학회논문지
• /
• 제11권9호
• /
• pp.1799-1805
• /
• 2007

무선 Ad-hoc 네트워크에서의 배터리 고갈에 의해 발생하는 노드 실패는 네트워크 전체의 성능에도 큰 영향을 미치므로 에너지소비를 고려한 라우팅 알고리즘은 매우 중요하다. 본 논문에는 전송 시 노드에 의한 에너지 소비뿐만 아니라 노드의 잔여 에너지와 경로 재설정 시 소요되는 지연까지도 고려한 라우팅 (DEAR; Delay and Energy-Aware Routing) 알고리즘을 제안하였다. 성능분석 결과 DEAR알고리즘은 충분한 잔여 에너지를 보유한 노드로 경로를 설정함으로써 에너지 비율에 따라 균형 있게 에너지를 소비할 수 있었다.