A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

Locality-sensitive hashing for protein classification

Determination of sequence similarity is a central issue in computational biology, a problem addressed primarily through BLAST, an alignment based heuristic which has underpinned much of the analysis and annotation of the genomic era. Despite their success, alignment-based approaches scale poorly with increasing data set size, and are not robust under structural sequence rearrangements. Successive waves of innovation in sequencing technologies – so-called Next Generation Sequencing (NGS) approaches – have led to an explosion in data availability, challenging existing methods and motivating novel approaches to sequence representation and similarity scoring, including adaptation of existing methods from other domains such as information retrieval. In this work, we investigate locality-sensitive hashing of sequences through binary document signatures, applying the method to a bacterial protein classification task. Here, the goal is to predict the gene family to which a given query protein belongs. Experiments carried out on a pair of small but biologically realistic datasets (the full protein repertoires of families of Chlamydia and Staphylococcus aureus genomes respectively) show that a measure of similarity obtained by locality sensitive hashing gives highly accurate results while offering a number of avenues which will lead to substantial performance improvements over BLAST..

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

Synthesis, characterization and activity of an immobilized photocatalyst : natural porous diatomite supported titania nanoparticles

Diatomite, a porous non-metal mineral, was used as support to prepare TiO2/diatomite composites by a modified sol–gel method. The as-prepared composites were calcined at temperatures ranging from 450 to 950 _C. The characterization tests included X-ray powder diffraction (XRD), scanning electron microscopy (SEM) with an energy-dispersive X-ray spectrometer (EDS), high-resolution transmission electron microscopy (HRTEM), X-ray photoelectron spectroscopy (XPS), and nitrogen adsorption/desorption measurements. The XRD analysis indicated that the binary mixtures of anatase and rutile exist in the composites. The morphology analysis confirmed the TiO2 particles were uniformly immobilized on the surface of diatom with a strong interfacial anchoring strength, which leads to few drain of photocatalytic components during practical applications. In further XPS studies of hybrid catalyst, we found the evidence of the presence of Ti–O–Si bond and increased percentage of surface hydroxyl. In addition, the adsorption capacity and photocatalytic activity of synthesized TiO2/diatomite composites were evaluated by studying the degradation kinetics of aqueous Rhodamine B under UV-light irradiation. The photocatalytic degradation was found to follow pseudo-first order kinetics according to the Langmuir–Hinshelwood model. The preferable removal efficiency was observed in composites by 750 _C calcination, which is attributed to a relatively appropriate anatase/rutile mixing ratio of 90/10.

Profiling : an application assignment approach for green data centers

In the past few years, there has been a steady increase in the attention, importance and focus of green initiatives related to data centers. While various energy aware measures have been developed for data centers, the requirement of improving the performance efficiency of application assignment at the same time has yet to be fulfilled. For instance, many energy aware measures applied to data centers maintain a trade-off between energy consumption and Quality of Service (QoS). To address this problem, this paper presents a novel concept of profiling to facilitate offline optimization for a deterministic application assignment to virtual machines. Then, a profile-based model is established for obtaining near-optimal allocations of applications to virtual machines with consideration of three major objectives: energy cost, CPU utilization efficiency and application completion time. From this model, a profile-based and scalable matching algorithm is developed to solve the profile-based model. The assignment efficiency of our algorithm is then compared with that of the Hungarian algorithm, which does not scale well though giving the optimal solution.

Sortase A : an ideal target for anti-virulence drug development

Sortase A is a membrane enzyme responsible for the anchoring of surface-exposed proteins to the cell wall envelope of Gram-positive bacteria. As a well-studied member of the sortase subfamily catalysing the cell wall anchoring of important virulence factors to the surface of staphylococci, enterococci and streptococci, sortase A plays a critical role in Gram-positive bacterial pathogenesis. It is thus considered a promising target for the development of new anti-infective drugs that aim to interfere with important Gram-positive virulence mechanisms, such as adhesion to host tissues, evasion of host defences, and biofilm formation. The additional properties of sortase A as an enzyme that is not required for Gram-positive bacterial growth or viability and is conveniently located on the cell membrane making it more accessible to inhibitor targeting, constitute additional reasons reinforcing the view that sortase A is an ideal target for anti-virulence drug development. Many inhibitors of sortase A have been identified to date using high-throughput or in silico screening of compound libraries (synthetic or natural), and while many have proved useful tools for probing the action model of the enzyme, several are also promising candidates for the development into potent inhibitors. This review is focused on the most promising sortase A inhibitor compounds that are currently in development as leads towards a new class of anti-infective drugs that are urgently needed to help combat the alarming increase in antimicrobial resistance.

Teaching reflection for service-learning

In this chapter, we discuss an approach for teaching pre-service teachers how to critically reflect on their experiences in a Service-learning program in an advanced subject about inclusive education. The approach was informed by critical social theory, with the expectation that students would engage in transformational learning. By explicitly teaching the students to engage in critical reflective thinking (Fishbowl discussions) and examine the depth of their critical reflection against a heuristic (the 4Rs reflection framework), the final-year Bachelor of Education students were able to gain a deeper understanding of the subject and experience transformational learning. We provide contextual information about the Service-learning program and discuss critical social theory for transformational learning, as well as how the teaching team taught critical reflection. Based on the evidence gathered from the students, we consider lessons learned by the teaching team and provide recommendations for teaching reflection in Service-learning programs.

Protecting encrypted cookies from compression side-channel attacks

Compression is desirable for network applications as it saves bandwidth; however, when data is compressed before being encrypted, the amount of compression leaks information about the amount of redundancy in the plaintext. This side channel has led to successful CRIME and BREACH attacks on web traffic protected by the Transport Layer Security (TLS) protocol. The general guidance in light of these attacks has been to disable compression, preserving confidentiality but sacrificing bandwidth. In this paper, we examine two techniques - heuristic separation of secrets and fixed-dictionary compression|for enabling compression while protecting high-value secrets, such as cookies, from attack. We model the security offered by these techniques and report on the amount of compressibility that they can achieve.

Multi-objective models and techniques for analysing the absolute capacity of railway networks

Railway capacity determination and expansion are very important topics. In prior research, the competition between different entities such as train services and train types, on different network corridors however have been ignored, poorly modelled, or else assumed to be static. In response, a comprehensive set of multi-objective models have been formulated in this article to perform a trade-off analysis. These models determine the total absolute capacity of railway networks as the most equitable solution according to a clearly defined set of competing objectives. The models also perform a sensitivity analysis of capacity with respect to those competing objectives. The models have been extensively tested on a case study and their significant worth is shown. The models were solved using a variety of techniques however an adaptive E constraint method was shown to be most superior. In order to identify only the best solution, a Simulated Annealing meta-heuristic was implemented and tested. However a linearization technique based upon separable programming was also developed and shown to be superior in terms of solution quality but far less in terms of computational time.

Efficiency of parallelisation of genetic algorithms in the data analysis context

Most real-life data analysis problems are difficult to solve using exact methods, due to the size of the datasets and the nature of the underlying mechanisms of the system under investigation. As datasets grow even larger, finding the balance between the quality of the approximation and the computing time of the heuristic becomes non-trivial. One solution is to consider parallel methods, and to use the increased computational power to perform a deeper exploration of the solution space in a similar time. It is, however, difficult to estimate a priori whether parallelisation will provide the expected improvement. In this paper we consider a well-known method, genetic algorithms, and evaluate on two distinct problem types the behaviour of the classic and parallel implementations.

Optimisation algorithms for microarray biclustering

In providing simultaneous information on expression profiles for thousands of genes, microarray technologies have, in recent years, been largely used to investigate mechanisms of gene expression. Clustering and classification of such data can, indeed, highlight patterns and provide insight on biological processes. A common approach is to consider genes and samples of microarray datasets as nodes in a bipartite graphs, where edges are weighted e.g. based on the expression levels. In this paper, using a previously-evaluated weighting scheme, we focus on search algorithms and evaluate, in the context of biclustering, several variations of Genetic Algorithms. We also introduce a new heuristic “Propagate”, which consists in recursively evaluating neighbour solutions with one more or one less active conditions. The results obtained on three well-known datasets show that, for a given weighting scheme,optimal or near-optimal solutions can be identified.

The role of affect in consumer evaluation of health care services

Health care services are typically consumed out of necessity, typically to recover from illness. While the consumption of health care services can be emotional given that consumers experience fear, hope, relief, and joy, surprisingly, there is little research on the role of consumer affect in health care consumption. We propose that consumer affect is a heuristic cue that drives evaluation of health care services. Drawing from cognitive appraisal theory and affect-as-information theory, this article tests a research model (N = 492) that investigates consumer affect resulting from service performance on subsequent service outcomes.

Using academagogy to meet the needs of millennial learners: A comparative case study

Higher education institutions across the world are experiencing a new generation of students, known as millennial learners. They are more technologically literate and digitally connected than previous generations of learners. To meet the teaching and learning needs of these learners, we must offer more deliberate and meaningful learning experiences and opportunities, where students can see the connections between new material and their own experiences and real world applications – an academagogic approach. This study compares the implementation of academagogy for two different groups of millennial learners – one a traditional face-to-face undergraduate Engineering unit, and the other a mixed-mode (online and face-to-face) undergraduate Design unit. The units are discussed in terms of their student evaluation results, both qualitative and quantitative, and in terms of their academic outcomes for students. Conclusions are drawn about the applicability of academagogy as a heuristic for improving teaching and learning across disciplines, as well as its strengths and limitations in terms of student results.

Investigation of structural requirements of anticancer activity at the paclitaxel/tubulin binding site using CoMFA and CoMSIA

CoMFA and CoMSIA analysis were utilized in this investigation to define the important interacting regions in paclitaxel/tubulin binding site and to develop selective paclitaxel-like active compounds. The starting geometry of paclitaxel analogs was taken from the crystal structure of docetaxel. A total of 28 derivatives of paclitaxel were divided into two groups—a training set comprising of 19 compounds and a test set comprising of nine compounds. They were constructed and geometrically optimized using SYBYL v6.6. CoMFA studies provided a good predictability (q2 = 0.699, r2 = 0.991, PC = 6, S.E.E. = 0.343 and F = 185.910). They showed the steric and electrostatic properties as the major interacting forces whilst the lipophilic property contribution was a minor factor for recognition forces of the binding site. These results were in agreement with the experimental data of the binding activities of these compounds. Five fields in CoMSIA analysis (steric, electrostatic, hydrophobic, hydrogen-bond acceptor and donor properties) were considered contributors in the ligand–receptor interactions. The results obtained from the CoMSIA studies were: q2 = 0.535, r2 = 0.983, PC = 5, S.E.E. = 0.452 and F = 127.884. The data obtained from both CoMFA and CoMSIA studies were interpreted with respect to the paclitaxel/tubulin binding site. This intuitively suggested where the most significant anchoring points for binding affinity are located. This information could be used for the development of new compounds having paclitaxel-like activity with new chemical entities to overcome the existing pharmaceutical barriers and the economical problem associated with the synthesis of the paclitaxel analogs. These will boost the wide use of this useful class of compounds, i.e. in brain tumors as the most of the present active compounds have poor blood–brain barrier crossing ratios and also, various tubulin isotypes has shown resistance to taxanes and other antimitotic agents.

A roadmap for interpreting the literature on vision and driving

Over the past several decades there has been a sharp increase in the number of studies focused on the relationship between vision and driving. The intensified attention to this topic has most likely been stimulated by the lack of an evidence basis for determining vision standards for driving licensure and a poor understanding about how vision impairment impacts driver safety and performance. Clinicians depend on the literature on vision and driving to advise visually impaired patients appropriately about driving fitness. Policy makers also depend on the scientific literature in order to develop guidelines that are evidence-based and are thus fair to persons who are visually impaired. Thus it is important for clinicians and policy makers alike to understand how various study designs and measurement methods should be interpreted so that the conclusions and recommendations they make are not overly broad, too narrowly constrained, or even misguided. We offer a methodological framework to guide interpretations of studies on vision and driving that can also serve as a heuristic for researchers in the area. Here, we discuss research designs and general measurement methods for the study of vision as they relate to driver safety, driver performance, and driver-centered (self-reported) outcomes.