Virtual Machine Consolidation using Roulette wheel selection Strategy

Cloud computing data centers are growing rapidly in both number and capacity to meet the increasing demands for highly-responsive computing and massive storage. Such data centers consume enormous amounts of electrical energy resulting in high operating costs and carbon dioxide emissions. The reason for this extremely high energy consumption is not just the quantity of computing resources and the power inefficiency of hardware, but rather lies in the inefficient usage of these resources. Virtual Machine [VM] consolidation involves live migration of VMs hence the capability of transferring a VM between physical servers with a close to zero down time. It is an effective way to improve the utilization of resources and increase energy efficiency in cloud data centers. VM consolidation consists of host overload/under load detection, VM selection and VM placement. In Our Proposed Model We are going to use Roulette-Wheel Selection Strategy, Where the VM selects the Instance type and Physical Machine [PM] using Roulette-Wheel Selection Mechanism Keywords—searchable encryption, dynamic update, cloud computing

The Role of Genetic Algorithm Selection Operators in Extending WSN Stability Period: A Comparative Study

A genetic algorithm (GA) contains a number of genetic operators that can be tweaked to improve the performance of specific implementations. Parent selection, crossover, and mutation are examples of these operators. One of the most important operations in GA is selection. The performance of GA in addressing the single-objective wireless sensor network stability period extension problem using various parent selection methods is evaluated and compared. In this paper, six GA selection operators are used: roulette wheel, linear rank, exponential rank, stochastic universal sampling, tournament, and truncation. According to the simulation results, the truncation selection operator is the most efficient operator in terms of extending the network stability period and improving reliability. The truncation operator outperforms other selection operators, most notably the well-known roulette wheel operator, by increasing the stability period by 25.8% and data throughput by 26.86%. Furthermore, the truncation selection operator outperforms other selection operators in terms of the network residual energy after each protocol round.

How an idiosyncratic (zero-beta) risk can greatly increase the firm’s cost of capital

The celebrated capital asset pricing model (‘CAPM’) brought numerous appealing insights and spawned a new theory of capital budgeting. One key intuition is that there is ‘no penalty for diversifiable risk’ – that is, any risky payoff that has zero-correlation with the wider economy, and hence zero-beta, is treated as ‘risk-free’. Does that mean that managers can bet the firm on a spin of the roulette wheel without attracting a higher CAPM discount rate? Our re-interpretation of CAPM reveals that potential financial losses which are conventionally regarded as firm-specific ‘unpriced’ risks can bring a large increase in the firm’s beta and CAPM cost of capital, despite having zero-beta and making only negligible difference at the aggregate market level. This mathematical result clashes with textbook expositions but is easily demonstrated and can be traced to authoritative but overlooked parts of the theoretical CAPM literature. JEL Classification: G11, G12

Self-adaptively Commensal Learning-based Jaya Algorithm with Multi-populations and its Application

Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every sub-population employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e. complex (bridge) system, series system and series-parallel system are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective.

Optimasi Penjadwalan Ujian Tugas Akhir Dengan Menggunakan Algoritma Genetika

Tugas Akhir merupakan salah satu persyaratan bagi mahasiswa STMIK STIKOM Indonesia untuk menyelesaikan studinya. Tugas Akhir memiliki dua tahapan yaitu proses seminar proposal dan sidang tugas akhir, untuk menyelesaikan tahapan tersebut tentunya pihak program studi harus membuat jadwal berlangsungnya tahapan tersebut. Permasalahan yang sering terjadi dalam kegiatan penjadwalan adalah terjadinya bentrok antara jadwal yang satu dengan yang lain, jadwal bentrok dengan kegiatan mengajar dosen sebagai pembimbing dan penguji . dan adanya permintaan waktu larangan dosen untuk menguji. Salah satu metode untuk menyelesaikan permasalahan tersebut dengan menggunakan algoritma genetika yang bekerja melalui seleksi alam dan genetika. Terdapat 8 prosedur algoritma genetika, Prosedur teknik pengkodean, populasi awal dan kromosom secara acak (random), fungsi fitness untuk meminimalkan jumlah bentrok antar jadwal, metode seleksi roulette-wheel, pindah silang, mutasi genetik, elitisme dan kondisi selesai bila iterasi maksimum telah tercapai. Hasil output dari sistem berupa susunan penjadwalan perkuliahan dan ujian akhir semester dalam format file PDF