• Title/Summary/Keyword: O&M Cost

Search Result 332, Processing Time 0.036 seconds

Application of Big Data and Machine-learning (ML) Technology to Mitigate Contractor's Design Risks for Engineering, Procurement, and Construction (EPC) Projects

  • Choi, Seong-Jun;Choi, So-Won;Park, Min-Ji;Lee, Eul-Bum
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.823-830
    • /
    • 2022
  • The risk of project execution increases due to the enlargement and complexity of Engineering, Procurement, and Construction (EPC) plant projects. In the fourth industrial revolution era, there is an increasing need to utilize a large amount of data generated during project execution. The design is a key element for the success of the EPC plant project. Although the design cost is about 5% of the total EPC project cost, it is a critical process that affects the entire subsequent process, such as construction, installation, and operation & maintenance (O&M). This study aims to develop a system using machine-learning (ML) techniques to predict risks and support decision-making based on big data generated in an EPC project's design and construction stages. As a result, three main modules were developed: (M1) the design cost estimation module, (M2) the design error check module, and (M3) the change order forecasting module. M1 estimated design cost based on project data such as contract amount, construction period, total design cost, and man-hour (M/H). M2 and M3 are applications for predicting the severity of schedule delay and cost over-run due to design errors and change orders through unstructured text data extracted from engineering documents. A validation test was performed through a case study to verify the model applied to each module. It is expected to improve the risk response capability of EPC contractors in the design and construction stage through this study.

  • PDF

Local structural study of commercial grade MBa2Cu3O7-x (M = Y and/or Gd) coated conductors by polarized Raman spectroscopy

  • Moon, Hankyoul;Shin, Hae-Young;Jin, Hye-Jin;Jo, William;Yoon, Seokhyun
    • Progress in Superconductivity and Cryogenics
    • /
    • v.17 no.4
    • /
    • pp.25-29
    • /
    • 2015
  • In 1987, M. K. Wu and Paul Chu discovered $Y_{1.2}Ba_{0.8}CuO_4$ (YBCO) with critical temperature ($T_c$) of 93 K. It has significantly lowered the cost of cooling of a material up to the point where superconductivity set in. Utilizing the cost reduction of attaining superconductivity and the vast amount of research to understand characteristics of high temperature oxide superconducting materials, there has been effort to use a high temperature superconductor as a coated conductor. It is important to characterize the materials precisely for stable performance before commercializing. We used polarized Raman scattering spectroscopy to study structural and stoichiometric information regarding $YBa_2Cu_3O_{7-x}$, $GdYBa_2Cu_3O_{7-x}$, and $GdBa_2Cu_3O_{7-x}$ produced by three leading groups of producing commercial grade high temperature superconductor coated conductors American Superconductor Corporation, Superpower, and SuNAM.

An Optimal Allocation Mechanism of Location Servers in A Linear Arrangement of Base Stations (선형배열 기지국을 위한 위치정보 서버의 최적할당 방식)

  • Lim, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.426-436
    • /
    • 2000
  • Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

  • PDF

Analysis of Process and Operating Characteristics for Chung Nam Province Sewage Treatment Plants (충청남도 하수처리시설의 공정 및 운영 특성 분석)

  • Oa, Seong Wook;Lee, Sang Jin
    • Journal of Korean Society on Water Environment
    • /
    • v.25 no.4
    • /
    • pp.553-559
    • /
    • 2009
  • Currently, small scale sewage works are getting increase in Chung Nam Province and it is strongly required for those plants to get the information of optimized procedures and technologies. Most processes for sewage works in Korea were designed for large scale plants, so many difficulties are observed in small scale sewage works. This study was conducted to evaluate the propriety of O&M and construction cost for sewage treatment plants in Chung Nam Province. The treatment results and process stability of 32 public sewage treatment plants were also investigated. It is expected to provide optimum O&M and construction cost for future small scale sewage works and improving projects of existing plants by these results. Pollution problems caused by small scale plants are usually restricted to small areas; however, in view of the high cost per unit population, treatment requirements and alternatives have to be studied carefully. In comparison to larger plants, more pronounced and different boundary conditions such as unstable influent load, per capita costs and a large variety of feasible treatment and disposal systems were considered.

Stock Efficiency Algorithm for Lot Sizing Problem (로트 크기 문제의 비축 효율성 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.2
    • /
    • pp.169-175
    • /
    • 2021
  • The lot sizing problem(LSP) is a hard problem that classified as non-deterministic(NP)-complete because of the polynomial-time optimal solution algorithm is unknown yet. The well-known W-W algorithm can be obtain the solution within polynomial-time, but this algorithm is a very complex, therefore the heuristic approximated S-M algorithm is suggested. This paper suggests O(n) linear-time complexity algorithm that can be find not the approximated but optimal solution. This algorithm determines the lot size Xt∗ in period t to the sum of the demands of interval [t,t+k], the period t+k is determined by the holding cost will not exceed setup cost of t+k period. As a result of various experimental data, this algorithm finds the optimal solution about whole data.

An I/O Interface Circuit Using CTR Code to Reduce Number of I/O Pins (CTR 코드를 사용한 I/O 핀 수를 감소 시킬 수 있는 인터페이스 회로)

  • Kim, Jun-Bae;Kwon, Oh-Kyong
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.1
    • /
    • pp.47-56
    • /
    • 1999
  • As the density of logic gates of VLSI chips has rapidly increased, more number of I/O pins has been required. This results in bigger package size and higher packager cost. The package cost is higher than the cost of bare chips for high I/O count VLSI chips. As the density of logic gates increases, the reduction method of the number of I/O pins for a given complexity of logic gates is required. In this paper, we propose the novel I/O interface circuit using CTR (Constant-Transition-Rate) code to reduce 50% of the number of I/O pins. The rising and falling edges of the symbol pulse of CTR codes contain 2-bit digital data, respectively. Since each symbol of the proposed CTR codes contains 4-bit digital data, the symbol rate can be reduced by the factor of 2 compared with the conventional I/O interface circuit. Also, the simultaneous switching noise(SSN) can be reduced because the transition rate is constant and the transition point of the symbols is widely distributed. The channel encoder is implemented only logic circuits and the circuit of the channel decoder is designed using the over-sampling method. The proper operation of the designed I/O interface circuit was verified using. HSPICE simulation with 0.6 m CMOS SPICE parameters. The simulation results indicate that the data transmission rate of the proposed circuit using 0.6 m CMOS technology is more than 200 Mbps/pin. We implemented the proposed circuit using Altera's FPGA and confimed the operation with the data transfer rate of 22.5 Mbps/pin.

  • PDF

The Role of (111)MgO Underlayer in Growth of c-axis Oriented Barium Ferrite Films

  • Erickson, D.W.;Hong, Y.K.;Gee, S.H.;Tanaka, T.;Park, M.H.;Nam, I.T.
    • Journal of Magnetics
    • /
    • v.9 no.4
    • /
    • pp.116-120
    • /
    • 2004
  • Hexagonal barium-ferrite ($BaFe_{12}O_{19}$, magnetoplumbite structure; BaM) film with perpendicularly c-axis orientation was successfully deposited on (100) silicon substrates with an MgO (111) underlayer by rf diode sputtering and in-situ heating at $920^{\circ}C$. The magnetic and structural properties of 0.27 ${\mu}m$ thick BaM films on MgO (111) underlayers were compared to films of the same thickness deposited onto single-crystal MgO (111) and c-plane ($000{\ell}$) sapphire ($Al_2O_3$) substrates by vibrating sample magnetometry (VSM), x-ray diffractometer (XRD), and atomic force microscopy (AFM). The thickness dependence of MgO (111) underlayers on silicon wafer was found to have a large effect on both magnetic and structural properties of the BaM film. The thickness of 15 nm MgO (111) underlayers produced BaM films with almost identical magnetic and structural properties as the single-crystal substrates; this can be explained by the lower surface roughness for thinner underlayer thicknesses. The magnetization saturation ($M_s$) and the ratio $H_{cII}/H_{c{\bot}}$ for the BaM film with a 15 nm MgO (111) underlayer is 217 emu/cc and 0.24, respectively. This is similar to the results for the BaM films deposited on the single-crystal MgO (111) and sapphire substrates of 197 emu/cc and 0.10, 200 emu/cc and 0.12, respectively. Therefore, the proposed MgO (111) underlayer can be used in many applications to promote c-axis orientation without the cost of expensive substrates.

Spindle-shaped Fe2O3 Nanoparticle Coated Carbon Nanofiber Composites for Low-cost Dye-sensitized Solar Cells (저비용 염료감응 태양전지를 위한 방추형 Fe2O3 나노입자가 코팅된 탄소나노섬유 복합체)

  • Oh, Dong-Hyeun;An, HyeLan;Koo, Bon-Ryul;Ahn, Hyo-Jin
    • Journal of Powder Materials
    • /
    • v.23 no.2
    • /
    • pp.95-101
    • /
    • 2016
  • Carbon nanofiber (CNF) composites coated with spindle-shaped $Fe_2O_3$ nanoparticles (NPs) are fabricated by a combination of an electrospinning method and a hydrothermal method, and their morphological, structural, and chemical properties are measured by field-emission scanning electron microscopy, transmission electron microscopy, X-ray diffraction, and X-ray photoelectron spectroscopy. For comparison, CNFs and spindle-shaped $Fe_2O_3$ NPs are prepared by either an electrospinning method or a hydrothermal method, respectively. Dye-sensitized solar cells (DSSCs) fabricated with the composites exhibit enhanced open circuit voltage (0.70 V), short-circuit current density ($12.82mA/cm^2$), fill factor (61.30%), and power conversion efficiency (5.52%) compared to those of the CNFs (0.66 V, $11.61mA/cm^2$, 51.96%, and 3.97%) and spindle-shaped $Fe_2O_3$ NPs (0.67 V, $11.45mA/cm^2$, 50.17%, and 3.86%). This performance improvement can be attributed to a synergistic effect of a superb catalytic reaction of spindle-shaped $Fe_2O_3$ NPs and efficient charge transfer relative to the one-dimensional nanostructure of the CNFs. Therefore, spindle-shaped $Fe_2O_3$-NP-coated CNF composites may be proposed as a potential alternative material for low-cost counter electrodes in DSSCs.

Icaritin Preparation from Icariin by a Special Epimedium Flavonoid-Glycosidase from Aspergillus sp.y848 Strain

  • Wang, Zhenghao;Liu, Chunying;Yu, Hongshan;Wu, Bo;Huai, Baoyu;Zhuang, Ziyu;Sun, Changkai;Xu, Longquan;Jin, Fengxie
    • Journal of Microbiology and Biotechnology
    • /
    • v.32 no.4
    • /
    • pp.437-446
    • /
    • 2022
  • In this study, to obtain icaritin with high pharmacological activities from icariin, which has a content ratio of over 58% in the total flavonoids of Epimedium herb, a special Epimedium flavonoid-glycosidase was produced, purified and characterized from Aspergillus sp.y848 strain. The optimal enzyme production was gained in a medium containing 5% (w/v) wheat bran extract and 0.7% (w/v) Epimedium leaf powder as the enzyme inducer, and strain culture at 30℃ for 6-7 days. The molecular weight of the enzyme was approximately 73.2 kDa; the optimal pH and temperature were 5.0 and 40℃. The enzyme Km and Vmax values for icariin were 15.63 mM and 55.56 mM/h. Moreover, the enzyme hydrolyzed the 7-O-glucosides of icariin into icariside II, and finally hydrolyzed 3-Orhamnoside of icariside II into icaritin. The enzyme also hydrolyzed 7-O-glucosides of epimedin B to sagittatoside B, and then further hydrolyzed terminal 3-O-xyloside of sagittatoside B to icarisiede II, before finally hydrolyzing 3-O-rhamnoside of icarisiede II into icaritin. The enzyme only hydrolyzed 7-O-glucoside of epimedin A or epimedin C into sagittatoside A or sagittatoside C. It is possible to prepare icaritin from the high-content icariin in Epimedium herb using this enzyme. When 2.5% icariin was reacted at 40℃ for 18-20 h by the low-cost crude enzyme, 5.04 g icaritin with 98% purity was obtained from 10 g icariin. Also, the icaritin molar yield was 92.5%. Our results showed icaritin was successfully produced via cost-effective and relatively simple methods from icariin by crude enzyme. Our results should be very useful for the development of medicines from Epimedium herb.

A Polynomial Time Algorithm for Aircraft Landing Problem (항공기 착륙 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.161-168
    • /
    • 2014
  • The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.