Enhanced and Automated Virtual Machine Provisioning to Online E-assessment using Openstack Cloud
Journal Title: International Journal of Science and Research (IJSR) - Year 2015, Vol 4, Issue 3
Abstract
This paper consist of system that efficiently uses the cloud resource provisioning for conducting E-Assessment and automates the resource maintenance in the cloud environment to reduce user activity in cloud management. Openstack is fully open source and it is supported by many popular organizations like Rackspace, HP, Cisco,etc. The proposed solution efficiently uses OpenStack cloud computing resources for provisioning resource to conduct online E-Assessment in order to have auto provisioning and manage load that comes in during situation where increase in users count who are trying to write exams in the Cloud.
Modeling of an Automotive ThermoElectric Generator (ATEG)
Modeling of an Automotive ThermoElectric Generator (ATEG)
Biomedical Ethics: An Introduction
Biomedical Ethics is also known as bioethics. It is a sub-section of ethics and in fact a part of applied ethics that uses ethical principles and decision making to solve actual or anticipated dilemmas in philosophy, med...
Fostering Sustainable Competitive Advantage through Relationship Marketing in the Hospitality Industry: A Case of Hotels and Lodges in Masvingo City, Zimbabwe
Relationship marketing is a post modern development that has seen the practice of marketing evolving from a medieval production orientation in the early 1900s, when demand for goods and services exceeded supply to a peri...
Base Substrate Sorghum Supplied with Nitrogen Additive Enhanced the Proliferation of Oyster (Pleurotus ostreatus (Jacq.: Fr.) Kummer) Mushroom Spawn Mycelium
The experiment was conducted to evaluate the performance of Pleurotus ostreatus (Jacq.: Fr.) Kummer mycelium on spawn media prepared from base substrate sorghum supplemented with combination of additives namely wheat bra...
R-Restricted Steiner Problem is NP-Complete
This work aims to arrive a Steiner minimum tree with -terminals. Every full component of a Steiner tree contains almost 4 terminals. In this work, we propose to flash R-restricted Steiner problem which is NP-complete.