• Title/Summary/Keyword: cost aggregation

Search Result 86, Processing Time 0.023 seconds

A Fast Optimization Algorithm for Optimal Real Power Flow (고속의 유효전력 최적조류계산 알고리즘)

  • Song, Kyung-Bin;Kim, Hong-Rae
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.926-928
    • /
    • 1998
  • A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

  • PDF

Thermal Properties according to Content and Alignment of Carbon Fiber in Cu Matrix Composite Reinforced with Chopped Carbon Fiber (탄소 단섬유가 첨가된 Cu기지 복합재료의 섬유 분율 및 배열에 따른 열적 특성)

  • Kim, Minkyoung;Han, Jun Hyun
    • Korean Journal of Materials Research
    • /
    • v.31 no.11
    • /
    • pp.626-634
    • /
    • 2021
  • Cu matrix composites reinforced with chopped carbon fiber (CF), which is cost effective and can be well dispersed, are fabricated using electroless plating and hot pressing, and the effects of content and alignment of CF on the thermal properties of CF/Cu composites are studied. Thermal conductivity of CF/Cu composite increases with CF content in the in-plane direction, but it decreases above 10% CF; this is due to reduction of thermal diffusivity related with phonon scattering by agglomeration of CF. The coefficient of thermal expansion decreases in the in-plane direction and increases in the through-plane direction as the CF content increases. This is because the coefficient of thermal expansion of the long axis of CF is smaller than that of the Cu matrix, and the coefficient of thermal expansion of its short axis is larger than that of the Cu matrix. The thermal conductivity is greatly influenced by the agglomeration of CF in the CF/Cu composite, whereas the coefficient of thermal expansion is more influenced by the alignment of CF than the aggregation of CF.

Review on Energy Efficient Clustering based Routing Protocol

  • Kanu Patel;Hardik Modi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.10
    • /
    • pp.169-178
    • /
    • 2023
  • Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

Analysis on Efficiency of Hierarchical Structure for a Grid Transit Network (격자형 대중교통 노선망의 위계구조 효율성 분석)

  • Park, Jun-Sik;Go, Seung-Yeong;Jeon, Gyeong-Su
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.4
    • /
    • pp.123-133
    • /
    • 2007
  • This study analyzed whether a transit network with hierarchy is efficient or not, and if transit network hierarchy has cost efficiency, then which condition guarantees the efficiency of the transit network hierarchy. The authors modeled the total cost of the transit network and suggested the conditions in which the transit network hierarchy has cost efficiency through comparing the cost of the transit network with and without hierarchy. The efficiency of transit network hierarchy is guaranteed when the travel cost savings induced by using a higher hierarchy transit network is larger than the increasing non-travel cost, which is the sum of access cost, waiting cost, and operating cost, induced by the introduction of a higher hierarchy transit network. This result is consistent with common sense and with the concept of cost and benefit analysis. If a passenger traveling within the area divided by a higher hierarchy transit network uses only a lower hierarchy transit network and the passenger traveling out of the area divided by the higher hierarchy transit network uses both lower and higher hierarchy transit networks, the travel demand using the higher hierarchy transit network is inversely proportional to the square of the line spacing. This means that the transit network becomes more efficient and small increases of travel demand guarantee the efficiency of the transit network hierarchy as the connectivity of the network becomes higher. This result shows that transit networks have economies of aggregation. This study is the first analytical research on transit network hierarchy and is expected to be a basis for numerical research. However, numerical research should complement this study, since analytical research has some limitations for considering a real network.

Linear Resource Sharing Method for Query Optimization of Sliding Window Aggregates in Multiple Continuous Queries (다중 연속질의에서 슬라이딩 윈도우 집계질의 최적화를 위한 선형 자원공유 기법)

  • Baek, Seong-Ha;You, Byeong-Seob;Cho, Sook-Kyoung;Bae, Hae-Young
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.563-577
    • /
    • 2006
  • A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

Hilbert Cube for Spatio-Temporal Data Warehouses (시공간 데이타웨어하우스를 위한 힐버트큐브)

  • 최원익;이석호
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.451-463
    • /
    • 2003
  • Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

The Proxy Variables Selection of Vulnerability Assessment for Agricultural Infrastructure According to Climate Change (논문 - 기후변화에 따른 농업생산기반 재해 취약성 평가를 위한 대리변수 선정)

  • Kim, Sung-Jae;Park, Tae-Yang;Kim, Sung-Min;Kim, Sang-Min
    • KCID journal
    • /
    • v.18 no.2
    • /
    • pp.33-42
    • /
    • 2011
  • Climate change has impacts on not only the average temperature rise but also the intensity and frequency of extreme events such as flood and drought. It is also expected that the damages on agricultural infrastructure will be increased resulting from increased rainfall intensity and frequency caused by climate change. To strengthen the climate change adaptation capacity, it is necessary to identify the vulnerability of a given society's physical infrastructures and to develop appropriate adaptation strategies with infrastructure management because generally facilities related to human settlements are vulnerable to climate changes and establishing an adaptive public infrastructure would reduce the damages and the repair cost. Therefore, development of mitigation strategies for agricultural infrastructure against climatic hazard is very important, but there are few studies on agricultural infrastructure vulnerability assessment and adaptation strategies. The concept of vulnerability, however, is difficult to functionally define due to the fact that vulnerability itself includes many aspects (biological, socioeconomic, etc.) in various sectors. As such, much research on vulnerability has used indicators which are useful for standardization and aggregation. In this study, for the vulnerability assessment for agricultural infrastructure, 3 categories of climate exposure, sensitivity, and adaptation capacity were defined which are composed of 16 sub-categories and 49 proxy variables. Database for each proxy variables was established based on local administrative province. Future studies are required to define the weighting factor and standardization method to calculate the vulnerability indicator for agricultural infrastructure against climate change.

  • PDF

Evaluation of the Performance on Coating on Roller Compacted Concrete Pavement for Bike Roads (자전거도로용 롤러 전압 콘크리트 포장의 코팅에 따른 성능 평가)

  • Lee, Chang-Ho;Lee, Seung-Woo;Kim, Seong-Kil
    • International Journal of Highway Engineering
    • /
    • v.13 no.1
    • /
    • pp.79-86
    • /
    • 2011
  • Recently, usage bicycle is encouraged to reduce fuel consumption and air pollution. For this purpose, bike road constructions are actively performed. However, types of pavement used in bike roads have high construction cost and performance comparing the required capacity of bike roads. Thus, an economical pavement type for construction is necessary for the effective development. Roller compacted concrete pavement have good requirements, such as easy construction and low costs, high structural performance of hydration and internal communication aggregation on compaction for bicycle roads. However, the pool landscape surface and resistance to deicer damage cannot be applied to the construction of bicycle roads. Thus, for solving this problem used coating which may have effect of improving the landscape and environmental resistance. To examine this effect were evaluated performance of roller compacted concrete pavement on the coating.

A Method to Customize Cluster Member Nodes for Energy-Efficiency in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율을 위한 클러스터 멤버 노드 설정 방법)

  • Nam, Chooon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.15-21
    • /
    • 2009
  • The goal of wireless sensor networks is to collect sensing data on specific region over wireless communication. Sink node gathers all local sensing data, processes and transmits them to users who use sensor networks. Generally, senor nodes are low-cost, low power devices with limited sensing, computation and wireless communication capabilities. And sensor network applies to multi-hop communication on large-scale network. As neighboring sensor nodes have similar data, clustering is more effective technique for 'data-aggregation'. In cluster formation technique based on multi-hop, it is necessary that the number of cluster member nodes should be distributed equally because of the balance of cluster formation To achieve this, we propose a method to customize cluster member nodes for energy-efficiency in wireless sensor networks.

  • PDF

Stochastic Disaggregation and Aggregation of Localized Uncertainty in Pavement Deterioration Process (포장파손과정의 지역적 불확실성에 대한 확률적 분해와 조합)

  • Han, Daeseok
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.4
    • /
    • pp.1651-1664
    • /
    • 2013
  • Precise analysis on deterioration processes of road pavements is not so simple matter due to severe uncertainty originated from a lot of explanatory variables engaged in. For those reasons, most analytical models for pavement deterioration prediction have often preferred to probabilistic approaches than deterministic models. However, the general probabilistic approaches that treat overall characteristics of population or entire sample would not be suitable for providing detail or localized information on their changing process. Considering the aspects, this paper aimed to suggest a stochastic disaggregation method to analyze the localized deterioration speeds and its variances changed by time and condition states. In addition, life expectancies and their uncertainty were estimated by probabilistic algorithm using the disaggregated stochastic process. For an empirical study, pavement inspection data (crack) accumulated from 2003 to 2010 from Korean national highway network was applied. This study can contribute to securing reliability of life cycle cost analysis, which is one of the primary analyses in road asset management, with much advanced deterioration forecasting functions. In addition, it would be meaningful trials as fundamental research for preventive maintenance strategy that demands essential understanding on changing process of the deterioration speed of pavement.