Utilizing capacitor banks is very conventional in distribution network in order for local compensation of reactive power. This will be more important considering uncertainties including wind generation and loads uncertainty. Harmonics and non-linear loads are other challenges in power system which complicates the capacitor placement problem. Thus, uncertainty and network harmonics have been con...

In several parts of query optimization, like join enumeration or physical operator selection, there is always the question of how much optimization is needed and how large the performance benefits are. In particular, a decision for either global optimization (e.g., during query optimization) or local optimization (during query execution) has to be taken. In this way, heterogeneity in the hardwa...

Sleep transistors in industrial power-gating designs are custom designed with an optimal size. Consequently, sleep transistor P/G network optimization becomes a problem of finding the optimal number of sleep transistors and their placement as well as optimal P/G network grids, wire widths and layers. This paper presents a fake via based sleep transistor P/G network synthesis method, which addre...

Cloud computing is at the forefront of information technology. Cloud computing led to abandon the use of expensive mainframe. It becomes a trend that data center uses the cluster which is relatively cheap and virtualization technologies to provide infrastructure services. To improve the utilization rate of the cloud center and decrease the operating cost, the cloud center provides services to u...

The analysis of power system observability and the rules of PMU placement are concisely presented. Several algorithms of PMU placement as well as their differences and relations are discussed in details: a graph-theoretic procedure based on Depth First Search can find the optimal placement the most quickly; Simulated Annealing Method can help the algorithm converge to global optimum. Base on th...

In this paper we study the correlation between wirelength and routability for standard-cell placement problem, under the fixed-die place-androute environment. We present a placement tool with better routability for designs with high row utilization. Compared to a well-known industrial placement tool, our placer produces placements with equal or better routability, 13.2% better half-perimeter wi...

Geo-replication is the process of maintaining copies of data at geographically dispersed datacenters for better availability and fault-tolerance. The distinguishing characteristic of geo-replication is the large wide-area latency between datacenters that varies widely depending on the location of the datacenters. Thus, choosing which datacenters to deploy a cloud application has a direct impact...

Recent advancements in Internet technology research, as well as the widespread of commercial content delivery networks, motivates the need for optimization algorithms designed to work in decentralized manner. In this paper we formulate data placement problem, a special case of universal facility location problem with quadratic terms in objective function. The considered combinatorial optimizati...

The paper deals with a problem encountered in the physical implementation of circuits on the PCB and VLSI chip level as well. Due to its complexity a decomposition methods are used to decrease the complexity of the problem. We present min-cut algorithms that are based upon the principle of partitioning. The circuit is repeatedly divided into densely connected subcircuits such that the number of...