• Title/Summary/Keyword: Computation cost

Search Result 648, Processing Time 0.032 seconds

Computation and Verification of Approximate Construction cost of Steel Box Girder Bridge by Using Case-Based Reasoning (사례기반추론을 이용한 강박스거더교의 개략공사비 산정 및 검증)

  • Jung, Min-Sun;Kyung, Kab-Soo;Jeon, Eun-Kyoung;Kwon, Soon-Cheol
    • Journal of Korean Society of Steel Construction
    • /
    • v.23 no.5
    • /
    • pp.557-568
    • /
    • 2011
  • To effectively come up with and secure a national budget, it is very important to estimate the reasonable construction cost of each step in public construction projects. In this study, the approximate construction cost of a steel box girder bridge in the early stages of the project, on which available information is limited, was proposed using case-based reasoning. In addition, construction cost estimation models were used for existing sample design models, and the accuracy of the estimation model for the presented cost was verified. The analysis results showed that the error rate was comparatively stable. Therefore, it is expected that construction cost estimation will be effectively suggested in the country's budget preparation.

A Study on the fluctuation Factors Influenced on the Computation of interior Cost (인테리어 공사비 산정에 영향을 주는 변동요인에 관한 연구)

  • 정재은;권영성
    • Korean Institute of Interior Design Journal
    • /
    • no.16
    • /
    • pp.75-81
    • /
    • 1998
  • With the rise of the economic level and the improvement of the standard of living the size of the interior work is becoming large and specialized, With the recent opening of the domestic interior decoration market the order of the large-scale interior decoration work is actively received and its efficient construction is vigorously made. Accordingly reliability is required in keeping with all the accuracy of computing interior construction expenses systematically is importantly emerging. The estimation sheet written in a kind of process mode and in an area made as the construction expense breakdown mode were statistically treated and analyzed as well as quantity computation breakdown data. In determing the major factors that expert an influence on the factors of changes in construction expenses as well as the compositional ratio of construction work that becomes basic material for developing the cost model of interior decoration work the following conclusion could be made: Improvement should be made to suit the present situation by synthesizing and arranging the data practically used in current interior construction expenses. Required construction expenses for the kind of work common to each construction field are showing a given proportion and the required construction expenses of rather small scale interior construction work tend to be irregular. It is necessary to compute optimal construction expenses by calculating the optimal period of work and working personnel in consideration of the influential factor in each work.

  • PDF

Symmetric Searchable Encryption with Efficient Conjunctive Keyword Search

  • Jho, Nam-Su;Hong, Dowon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1328-1342
    • /
    • 2013
  • Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

WSN Lifetime Analysis: Intelligent UAV and Arc Selection Algorithm for Energy Conservation in Isolated Wireless Sensor Networks

  • Perumal, P.Shunmuga;Uthariaraj, V.Rhymend;Christo, V.R.Elgin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.901-920
    • /
    • 2015
  • Wireless Sensor Networks (WSNs) are widely used in geographically isolated applications like military border area monitoring, battle field surveillance, forest fire detection systems, etc. Uninterrupted power supply is not possible in isolated locations and hence sensor nodes live on their own battery power. Localization of sensor nodes in isolated locations is important to identify the location of event for further actions. Existing localization algorithms consume more energy at sensor nodes for computation and communication thereby reduce the lifetime of entire WSNs. Existing approaches also suffer with less localization coverage and localization accuracy. The objective of the proposed work is to increase the lifetime of WSNs while increasing the localization coverage and localization accuracy. A novel intelligent unmanned aerial vehicle anchor node (IUAN) is proposed to reduce the communication cost at sensor nodes during localization. Further, the localization computation cost is reduced at each sensor node by the proposed intelligent arc selection (IAS) algorithm. IUANs construct the location-distance messages (LDMs) for sensor nodes deployed in isolated locations and reach the Control Station (CS). Further, the CS aggregates the LDMs from different IUANs and computes the position of sensor nodes using IAS algorithm. The life time of WSN is analyzed in this paper to prove the efficiency of the proposed localization approach. The proposed localization approach considerably extends the lifetime of WSNs, localization coverage and localization accuracy in isolated environments.

Study on Economical M&V Methoodology for the Lighting Control System (조명제어시스템 경제적인 실적확인 기법 연구)

  • Choi, Kyung-Shik;Han, Seung-Ho
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2009.10a
    • /
    • pp.163-167
    • /
    • 2009
  • Although the domestic electric power consumption of lighting have shared 20${\sim}$30 % of the national electric power consumption, the spread of lighting control system which can reduce the electric power consumption have been insignificant. The government have set the demonstration project and given the incentive to promote the spread of lighting control system since 2008. The M&V (Measurement and Verification) methodology for lighting control system have not been set yet in our country, but the direct measurement was suggested in US. The direct measurement methodology can increase the accuracy of measurement, but it cost much money to burden a customer. This study have suggested a new M&V methodology which cost low and is simple relatively. I had measured the amount of electric consumption through both the direct measurement and the new M&V program computation, and have analyzed the deviation. The amount of electric consumption measured by the new M&V program computation have agreed with one by the direct measurement within the error range of the instrumentation in case of lab scale test, and the 4${\sim}$8 % deviation have existed in case of field evaluation.

  • PDF

An Optimal Parallel Algorithm for Generating Computation Tree Form on Linear Array with Slotted Optical Buses (LASOB 상에서 계산 트리 형식을 생성하기 위한 최적 병렬 알고리즘)

  • Kim, Young-Hak
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.475-484
    • /
    • 2000
  • Recently, processor arrays to enhance the banRecently, processor arrays to enhance the bandwidth of buses and to reduce the complexity of hardwares, using optical buses instead of electronic buses, have been proposed in manyliteratures. In this paper, we first propose a constant-time algorithm for parentheses matching problemon a linear array with slotted optical buses (LASOB).Then, given an algebraic expression of length n, we also propose a cost optimal parallel algorithmthat constructs computational tree form in the steps of constant time on LASOB with n processorsby using parentheses matching algorithm. A cost optimal parallel algorithm for this problem that runsin constant time has not yet been known on any parallel computation models.

  • PDF

A Lightweight Pseudonym Authentication and Key Agreement Protocol for Multi-medical Server Architecture in TMIS

  • Liu, Xiaoxue;Li, Yanping;Qu, Juan;Ding, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.924-944
    • /
    • 2017
  • Telecare Medical Information System (TMIS) helps the patients to gain the health monitoring information at home and access medical services over the mobile Internet. In 2015, Das et al proposed a secure and robust user AKA scheme for hierarchical multi-medical server environment in TMIS, referred to as DAKA protocol, and claimed that their protocol is against all possible attacks. In this paper, we first analyze and show DAKA protocol is vulnerable to internal attacks, impersonation attacks and stolen smart card attack. Furthermore, DAKA protocol also cannot provide confidentiality. We then propose a lightweight pseudonym AKA protocol for multi-medical server architecture in TMIS (short for PAKA). Our PAKA protocol not only keeps good security features declared by DAKA protocol, but also truly provides patient's anonymity by using pseudonym to protect sensitive information from illegal interception. Besides, our PAKA protocol can realize authentication and key agreement with energy-saving, extremely low computation cost, communication cost and fewer storage resources in smart card, medical servers and physical servers. What's more, the PAKA protocol is proved secure against known possible attacks by using Burrows-Abadi-Needham (BAN) logic. As a result, these features make PAKA protocol is very suitable for computation-limited mobile device.

Long-term simulation of wind turbine structure for distributed loading describing long-term wind loads for preliminary design

  • Ibrahimbegovic, Adnan;Boujelben, Abir
    • Coupled systems mechanics
    • /
    • v.7 no.2
    • /
    • pp.233-254
    • /
    • 2018
  • In order to reduce the dependency on fossil fuels, a policy to increase the production capacity of wind turbine is set up. This can be achieved with increasing the dimensions of offshore wind turbine blades. However, this increase in size implies serious problems of stability and durability. Considering the cost of large turbines and financial consequences of their premature failure, it is imperative to carry out numerical simulations over long periods. Here, an energy-conserving time-stepping scheme is proposed in order to ensure the satisfying computation of long-term response. The proposed scheme is implemented for three-dimensional solid based on Biot strain measures, which is used for modeling flexible blades. The simulations are performed at full spatial scale. For reliable design process, the wind loads should be represented as realistically as possible, including the fluid-structure interaction (FSI) dynamic effects on wind turbine blades. However, full-scale 3D FSI simulations for long-term wind loading remain of prohibitive computation cost. Thus, the model to quantify the wind loads proposed here is a simple, but not too simple to be representative for preliminary design studies.

Improved Sub-block Matching Algorithm (개선된 서브블록 정합 알고리즘)

  • Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.628-633
    • /
    • 2010
  • This paper proposes a block matching algorithm to improve the sub-block matching algorithm that uses partial sub-blocks being a great contribution to the block matching. Unlike the conventional algorithm using the one sub-block group the proposed algorithm uses two sub-block groups. The matching using the small group selects a candidate block to be a good possibility of a similar block with a small computation cost and the additional matching using the large group in the selected block decreases a wrong matching. Simulation results show that the proposed algorithm always has good image quality at the same computation cost as compared to the conventional algorithm and it has an outstanding performance at the matching using a few sub-blocks.

Fast Rate Distortion Optimization Algorithm for Inter Predictive Coding of H.264/AVC (H.264/AVC의 인터 예측 부호화를 위한 고속 율왜곡 최적화 알고리즘)

  • Sin, Se-Ill;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.56-62
    • /
    • 2009
  • In H.264/AVC, rate distortion optimization algorithm is used to decide the best block mode from various block modes. It improves a bit rate but greatly increases an amount of computation. This paper proposes a fast rate distortion optimization algorithm that omits a rate distortion optimization adaptively by predicting its cost from the cost calculated for motion estimation. The simulation results show that the proposed algorithm, on average, keeps nearly the image quality and the bit rate made by the rate distortion optimization while reduces 69.86% and 69.63% of computation added by it in CIF and QCIF respectively.