Tracking the neoliberal juggernaut: A virtual edition

This is an editorial introduction for a virtual edition focused on neoliberalism in educational sectors for the journal, "Critical Studies in Education". The introduction outlines the nature and progress of neoliberalism, then reviews the selected articles from the journal's archives.

Virtual countries: Internet domain names and geographical terms

This paper examines the dispute between the Seattle company Virtual Countries Inc. and the Republic of South Africa over the ownership of the domain name address southafrica.com. The first part of the paper deals with the pre-emptive litigation taken by Virtual Countries Inc. in a District Court of the United States. The second part considers the possible arbitration of the dispute under the Uniform Domain Name Dispute Resolution Process of the Internet Corporation for Assigned Names and Numbers (ICANN) and examines the wider implications of this dispute for the jurisdiction and the governance of ICANN. The final section of the paper evaluates the Final Report of the Second WIPO Internet Domain Name Process.

Characterization of novel microsatellite markers derived from Korean rose bitterling (Rhodeus uyekii) genomic library

Korean rose bitterling (Rhodeus uyekii) is a freshwater fish endemic to Korea. Natural populations of this species have experienced severe declines as a result of habitat fragmentation and water pollution. To conserve and restore R. uyekii, the genetic diversity of this species needs to be assessed at the population level. Eighteen novel polymorphic microsatellite loci for R. uyekii were developed using an enriched partial genomic library. Polymorphisms at these loci were studied in 150 individuals collected from three populations. The number of alleles at each locus ranged from 3 to 47 (mean = 17.1). Within the populations, the observed heterozygosity ranged from 0.032 to 1.000, expected heterozygosity from 0.082 to 0.967, and polymorphism information content from 0.078 to 0.950. Six loci showed significant deviation from Hardy-Weinberg equilibrium after Bonferroni’s correction, and no significant linkage disequilibrium was detected between most locus pairs, except in three cases. These highly informative microsatellite markers should be useful for genetic population structure analyses of R. uyekii.

Australian Library and Information Association (ALIA)

The Australian Library and Information Association (ALIA) is the professional association for the Australian library and information services sector. It seeks to empower the profession in the development, promotion and delivery of quality library and information services to the nation, through leadership, advocacy, and mutual support. The ALIA represents the interest of 6000 members, the profession and Australia's 12 million library users. The objects of the Association are listed in its constitution. They are To promote the free flow of information and ideas in the interest of all Australians and a thriving culture, economy, and democracy. To promote and improve the services provided by all kinds of library and information agencies. To ensure the high standard of personnel engaged in information provision and foster their professional interests and aspirations. To represent the interests of members to governments, other organizations, and the community. To encourage people to contribute to the improvement of library and information services through support and membership of the association.

Using genetic algorithm in profile-based assignment of applications to virtual machines for greener data centers

The increase in data center dependent services has made energy optimization of data centers one of the most exigent challenges in today's Information Age. The necessity of green and energy-efficient measures is very high for reducing carbon footprint and exorbitant energy costs. However, inefficient application management of data centers results in high energy consumption and low resource utilization efficiency. Unfortunately, in most cases, deploying an energy-efficient application management solution inevitably degrades the resource utilization efficiency of the data centers. To address this problem, a Penalty-based Genetic Algorithm (GA) is presented in this paper to solve a defined profile-based application assignment problem whilst maintaining a trade-off between the power consumption performance and resource utilization performance. Case studies show that the penalty-based GA is highly scalable and provides 16% to 32% better solutions than a greedy algorithm.

A virtual radiation therapy workflow training simulation

Aim Simulation forms an increasingly vital component of clinical skills development in a wide range of professional disciplines. Simulation of clinical techniques and equipment is designed to better prepare students for placement by providing an opportunity to learn technical skills in a “safe” academic environment. In radiotherapy training over the last decade or so this has predominantly comprised treatment planning software and small ancillary equipment such as mould room apparatus. Recent virtual reality developments have dramatically changed this approach. Innovative new simulation applications and file processing and interrogation software have helped to fill in the gaps to provide a streamlined virtual workflow solution. This paper outlines the innovations that have enabled this, along with an evaluation of the impact on students and educators. Method Virtual reality software and workflow applications have been developed to enable the following steps of radiation therapy to be simulated in an academic environment: CT scanning using a 3D virtual CT scanner simulation; batch CT duplication; treatment planning; 3D plan evaluation using a virtual linear accelerator; quantitative plan assessment, patient setup with lasers; and image guided radiotherapy software. Results Evaluation of the impact of the virtual reality workflow system highlighted substantial time saving for academic staff as well as positive feedback from students relating to preparation for clinical placements. Students valued practice in the “safe” environment and the opportunity to understand the clinical workflow ahead of clinical department experience. Conclusion Simulation of most of the radiation therapy workflow and tasks is feasible using a raft of virtual reality simulation applications and supporting software. Benefits of this approach include time-saving, embedding of a case-study based approach, increased student confidence, and optimal use of the clinical environment. Ongoing work seeks to determine the impact of simulation on clinical skills.

A penalty-based genetic algorithm for the migration cost-aware virtual machine placement problem in cloud data centers

In the past few years, the virtual machine (VM) placement problem has been studied intensively and many algorithms for the VM placement problem have been proposed. However, those proposed VM placement algorithms have not been widely used in today's cloud data centers as they do not consider the migration cost from current VM placement to the new optimal VM placement. As a result, the gain from optimizing VM placement may be less than the loss of the migration cost from current VM placement to the new VM placement. To address this issue, this paper presents a penalty-based genetic algorithm (GA) for the VM placement problem that considers the migration cost in addition to the energy-consumption of the new VM placement and the total inter-VM traffic flow in the new VM placement. The GA has been implemented and evaluated by experiments, and the experimental results show that the GA outperforms two well known algorithms for the VM placement problem.

A Strength Pareto Evolutionary Algorithm for live migration of multiple interdependent virtual machines in data centers

Although live VM migration has been intensively studied, the problem of live migration of multiple interdependent VMs has hardly been investigated. The most important problem in the live migration of multiple interdependent VMs is how to schedule VM migrations as the schedule will directly affect the total migration time and the total downtime of those VMs. Aiming at minimizing both the total migration time and the total downtime simultaneously, this paper presents a Strength Pareto Evolutionary Algorithm 2 (SPEA2) for the multi-VM migration scheduling problem. The SPEA2 has been evaluated by experiments, and the experimental results show that the SPEA2 can generate a set of VM migration schedules with a shorter total migration time and a shorter total downtime than an existing genetic algorithm, namely Random Key Genetic Algorithm (RKGA). This paper also studies the scalability of the SPEA2.

Expectation and variation with a virtual die

By the time students reach the middle years they have experienced many chance activities based on dice. Common among these are rolling one die to explore the relationship of frequency and theoretical probability, and rolling two dice and summing the outcomes to consider their probabilities. Although dice may be considered overused by some, the advantage they offer is a familiar context within which to explore much more complex concepts. If the basic chance mechanism of the device is understood, it is possible to enter quickly into an arena of more complex concepts. This is what happened with a two hour activity engaged in by four classes of Grade 6 students in the same school. The activity targeted the concepts of variation and expectation. The teachers held extended discussions with their classes on variation and expectation at the beginning of the activity, with students contributing examples of the two concepts from their own experience. These notions are quite sophisticated for Grade 6, but the underlying concepts describe phenomena that students encounter every day. For example, time varies continuously; sporting results vary from game to game; the maximum temperature varies from day to day. However, there is an expectation about tomorrow’s maximum temperature based on the expert advice from the weather bureau. There may also be an expectation about a sporting result based on the participants’ previous results. It is this juxtaposition that makes life interesting. Variation hence describes the differences we see in phenomena around us. In a scenario displaying variation, expectation describes the effort to characterise or summarise the variation and perhaps make a prediction about the message arising from the scenario. The explicit purpose of the activity described here was to use the familiar scenario of rolling a die to expose these two concepts. Because the students had previously experienced rolling physical dice they knew instinctively about the variation that occurs across many rolls and about the theoretical expectation that each side should “come up” one-sixth of the time. They had observed the instances of the concepts in action, but had not consolidated the underlying terminology to describe it. As the two concepts are so fundamental to understanding statistics, we felt it would be useful to begin building in the familiar environment of rolling a die. Because hand-held dice limit the explorations students can undertake, the classes used the soft-ware TinkerPlots (Konold & Miller, 2011) to simulate rolling a die multiple times.

A novel grass pollen allergen mimotope identified by phage display peptide library inhibits allergen-human IgE antibody interaction

The aim of this study was to investigate the molecular basis of human IgE-allergen interaction by screening a phage-displayed peptide library with an allergen-specific human IgE-mimicking monoclonal antibody (mAb). A mAb that reacted with major grass pollen allergens was successfully identified and shown to inhibit human IgE-allergen interaction. Biopanning of a phage-displayed random peptide library with this mAb yielded a 12 amino acid long mimotope. A synthetic peptide based on this 12-mer mimotope inhibited mAb and human IgE binding to grass pollen extracts. Our results indicate that such synthetic peptide mimotopes of allergens have potential as novel therapeutic agents. © 2001 Published by Elsevier Science B.V. on behalf of the Federation of European Biochemical Societies.

Monoclonal antibody screening of a phage-displayed random peptide library reveals mimotopes of chemokine receptor CCR5: Implications for the tertiary structure of the receptor and for an n-terminal binding site for HIV-1 gp120

The chemokine receptor CCR5 contains seven transmembrane-spanning domains. It binds chemokines and acts as co-receptor for macrophage (m)-tropic (or R5) strains of HIV-1. Monoclonal antibodies (mAb) to CCR5, 3A9 and 5C7, were used for biopanning a nonapeptide cysteine (C)-constrained phage-displayed random peptide library to ascertain contact residues and define tertiary structures of possible epitopes on CCR5. Reactivity of antibodies with phagotopes was established by enzyme-linked immunosorbent assay (ELISA). mAb 3A9 identified a phagotope C-HASIYDFGS-C (3A9/1), and 5C7 most frequently identified C-PHWLRDLRV-C (5C7/1). Corresponding peptides were synthesized. Phagotopes and synthetic peptides reacted in ELISA with corresponding antibodies and synthetic peptides inhibited antibody binding to the phagotopes. Reactivity by immunofluorescence of 3A9 with CCR5 was strongly inhibited by the corresponding peptide. Both mAb 3A9 and 5C7 reacted similarly with phagotopes and the corresponding peptide selected by the alternative mAb. The sequences of peptide inserts of phagotopes could be aligned as mimotopes of the sequence of CCR5. For phage 3A9/1, the motif SIYD aligned to residues at the N terminus and FG to residues on the first extracellular loop; for 5C7/1, residues at the N terminus, first extracellular loop, and possibly the third extracellular loop could be aligned and so would contribute to the mimotope. The synthetic peptides corresponding to the isolated phagotopes showed a CD4-dependent reactivity with gp120 of a primary, m-tropic HIV-1 isolate. Thus reactivity of antibodies raised to CCR5 against phage-displayed peptides defined mimotopes that reflect binding sites for these antibodies and reveal a part of the gp120 binding sites on CCR5.

A polymerase chain reaction-based method for isolating clones from a complimentary DNA library in sheep

The sheep (Ovis aries) is favored by many musculoskeletal tissue engineering groups as a large animal model because of its docile temperament and ease of husbandry. The size and weight of sheep are comparable to humans, which allows for the use of implants and fixation devices used in human clinical practice. The construction of a complimentary DNA (cDNA) library can capture the expression of genes in both a tissue- and time-specific manner. cDNA libraries have been a consistent source of gene discovery ever since the technology became commonplace more than three decades ago. Here, we describe the construction of a cDNA library using cells derived from sheep bones based on the pBluescript cDNA kit. Thirty clones were picked at random and sequenced. This led to the identification of a novel gene, C12orf29, which our initial experiments indicate is involved in skeletal biology. We also describe a polymerase chain reaction-based cDNA clone isolation method that allows the isolation of genes of interest from a cDNA library pool. The techniques outlined here can be applied in-house by smaller tissue engineering groups to generate tools for biomolecular research for large preclinical animal studies and highlights the power of standard cDNA library protocols to uncover novel genes.

A CCG virtual system for big data application communication costs analysis

Network topology and routing are two important factors in determining the communication costs of big data applications at large scale. As for a given Cluster, Cloud, or Grid system, the network topology is fixed and static or dynamic routing protocols are preinstalled to direct the network traffic. Users cannot change them once the system is deployed. Hence, it is hard for application developers to identify the optimal network topology and routing algorithm for their applications with distinct communication patterns. In this study, we design a CCG virtual system (CCGVS), which first uses container-based virtualization to allow users to create a farm of lightweight virtual machines on a single host. Then, it uses software-defined networking (SDN) technique to control the network traffic among these virtual machines. Users can change the network topology and control the network traffic programmingly, thereby enabling application developers to evaluate their applications on the same system with different network topologies and routing algorithms. The preliminary experimental results through both synthetic big data programs and NPB benchmarks have shown that CCGVS can represent application performance variations caused by network topology and routing algorithm.

Collaborative learning from distributed places and spaces: Exploring the use of virtual collaborative tools for local and global student teamwork projects

Educating responsive graduates. Graduate competencies include reliability, communication skills and ability to work in teams. Students using Collaborative technologies adapt to a new working environment, working in teams and using collaborative technologies for learning. Collaborative Technologies were used not simply for delivery of learning but innovatively to supplement and enrich research-based learning, providing a space for active engagement and interaction with resources and team. This promotes the development of responsive ‘intellectual producers’, able to effectively communicate, collaborate and negotiate in complex work environments. Exploiting technologies. Students use ‘new’ technologies to work collaboratively, allowing them to experience the reality of distributed workplaces incorporating both flexibility and ‘real’ time responsiveness. Students are responsible and accountable for individual and group work contributions in a highly transparent and readily accessible workspace. This experience provides a model of an effective learning tool. Navigating uncertainty and complexity. Collaborative technologies allows students to develop critical thinking and reflective skills as they develop a group product. In this forum students build resilience by taking ownership and managing group work, and navigating the uncertainties and complexities of group dynamics as they constructively and professionally engage in team dialogue and learn to focus on the goal of the team task.

LibVM: An architecture for shared library sandboxing

Many software applications extend their functionality by dynamically loading libraries into their allocated address space. However, shared libraries are also often of unknown provenance and quality and may contain accidental bugs or, in some cases, deliberately malicious code. Most sandboxing techniques which address these issues require recompilation of the libraries using custom tool chains, require significant modifications to the libraries, do not retain the benefits of single address-space programming, do not completely isolate guest code, or incur substantial performance overheads. In this paper we present LibVM, a sandboxing architecture for isolating libraries within a host application without requiring any modifications to the shared libraries themselves, while still retaining the benefits of a single address space and also introducing a system call inter-positioning layer that allows complete arbitration over a shared library’s functionality. We show how to utilize contemporary hardware virtualization support towards this end with reasonable performance overheads and, in the absence of such hardware support, our model can also be implemented using a software-based mechanism. We ensure that our implementation conforms as closely as possible to existing shared library manipulation functions, minimizing the amount of effort needed to apply such isolation to existing programs. Our experimental results show that it is easy to gain immediate benefits in scenarios where the goal is to guard the host application against unintentional programming errors when using shared libraries, as well as in more complex scenarios, where a shared library is suspected of being actively hostile. In both cases, no changes are required to the shared libraries themselves.