A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Impacts of experimental warming and fire on phenology of subalpine open-heath species

The present study examined experimentally the phenological responses of a range of plant species to rises in temperature. We used the climate-change field protocol of the International Tundra Experiment (ITEX), which measures plant responses to warming of 1 to 2°C inside small open-topped chambers. The field study was established on the Bogong High Plains, Australia, in subalpine open heathlands; the most common treeless plant community on the Bogong High Plains. The study included areas burnt by fire in 2003, and therefore considers the interactive effects of warming and fire, which have rarely been studied in high mountain environments. From November 2003 to March 2006, various phenological phases were monitored inside and outside chambers during the snow-free periods. Warming resulted in earlier occurrence of key phenological events in 7 of the 14 species studied. Burning altered phenology in 9 of 10 species studied, with both earlier and later phenological changes depending on the species. There were no common phenological responses to warming or burning among species of the same family, growth form or flowering type (i.e. early or late-flowering species), when all phenological events were examined. The proportion of plants that formed flower buds was influenced by fire in half of the species studied. The findings support previous findings of ITEX and other warming experiments; that is, species respond individualistically to experimental warming. The inter-year variation in phenological response, the idiosyncratic nature of the responses to experimental warming among species, and an inherent resilience to fire, may result in community resilience to short-term climate change. In the first 3 years of experimental warming, phenological responses do not appear to be driving community-level change. Our findings emphasise the value of examining multiple species in climate-change studies.

FPGA implementation of an evolutionary algorithm for autonomous unmanned aerial vehicle on-board path planning

In this paper, a hardware-based path planning architecture for unmanned aerial vehicle (UAV) adaptation is proposed. The architecture aims to provide UAVs with higher autonomy using an application specific evolutionary algorithm (EA) implemented entirely on a field programmable gate array (FPGA) chip. The physical attributes of an FPGA chip, being compact in size and low in power consumption, compliments it to be an ideal platform for UAV applications. The design, which is implemented entirely in hardware, consists of EA modules, population storage resources, and three-dimensional terrain information necessary to the path planning process, subject to constraints accounted for separately via UAV, environment and mission profiles. The architecture has been successfully synthesised for a target Xilinx Virtex-4 FPGA platform with 32% logic slices utilisation. Results obtained from case studies for a small UAV helicopter with environment derived from LIDAR (Light Detection and Ranging) data verify the effectiveness of the proposed FPGA-based path planner, and demonstrate convergence at rates above the typical 10 Hz update frequency of an autopilot system.

Optimal coordination of overcurrent relays in distribution systems with distributed generators based on differential evolution algorithm

Distributed generators (DGs) are defined as generators that are connected to a distribution network. The direction of the power flow and short-circuit current in a network could be changed compared with one without DGs. The conventional protective relay scheme does not meet the requirement in this emerging situation. As the number and capacity of DGs in the distribution network increase, the problem of coordinating protective relays becomes more challenging. Given this background, the protective relay coordination problem in distribution systems is investigated, with directional overcurrent relays taken as an example, and formulated as a mixed integer nonlinear programming problem. A mathematical model describing this problem is first developed, and the well-developed differential evolution algorithm is then used to solve it. Finally, a sample system is used to demonstrate the feasiblity and efficiency of the developed method.

Book Review: "Mark Considine, Jenny Lewis and Damon Alexander Networks, Innovation and Public Policy : Politicians, Bureaucrats and the Pathways to Change inside Government Houndsmills, UK: Palgrave Macmillan, 2009"

Having wrung the most from workforce and workplace productivity initiaitves, innovation has come to the fore as a key goal and directive for public sector organisations to become more efficient. This clarion call for innovation can be heard all around the world, with public services everywhere taking up the message to develop better, smarter, novel, more innovative processes, programs and policies. In the current push for innovation, networks are considered to be a superior vehicle through which collective knowledge can be shared and leveraged; replacing or at least supplementing the role function previously provided by inventive leaders...

A sequential Monte Carlo algorithm to incorporate model uncertainty in Bayesian sequential design

Here we present a sequential Monte Carlo (SMC) algorithm that can be used for any one-at-a-time Bayesian sequential design problem in the presence of model uncertainty where discrete data are encountered. Our focus is on adaptive design for model discrimination but the methodology is applicable if one has a different design objective such as parameter estimation or prediction. An SMC algorithm is run in parallel for each model and the algorithm relies on a convenient estimator of the evidence of each model which is essentially a function of importance sampling weights. Other methods for this task such as quadrature, often used in design, suffer from the curse of dimensionality. Approximating posterior model probabilities in this way allows us to use model discrimination utility functions derived from information theory that were previously difficult to compute except for conjugate models. A major benefit of the algorithm is that it requires very little problem specific tuning. We demonstrate the methodology on three applications, including discriminating between models for decline in motor neuron numbers in patients suffering from neurological diseases such as Motor Neuron disease.

Cyberinfrastructure inside out : definition and influences shaping its emergence, development, and implementation in the early 21st century

The authors provide a theoretically generative definition of cyberinfrastructure (CI) by drawing from existing definitions and literature in social sciences, law, and policy studies. They propose two models of domestic and international influencers on CI emergence, development, and implementation in the early 21st century. Based on its historical emergence and computational power, they argue that cyberinfrastructure is built on, and yet distinct from the current notion of the internet. The authors seek to answer two research questions: firstly, what is cyberinfrastructure? And secondly, what national and international influencers shape its emergence, development and implementation (in e-science) in the early 21st century? Additionally, consideration will be given to the implications of the proposed definition and models, and future directions on CI research in Internet studies will be suggested.

Four characters stuck inside a mystery [Review]

IN Harold Pinter's No Man's Land, four Englishmen find themselves trapped in a strange sort of limbo in the library of a well-to-do-house with musty old books, far too many bottles of beer, wine and spirits, dusty lamps and memories that never quite match up.

A boundary preserving numerical algorithm for the Wright-Fisher model with mutation

The Wright-Fisher model is an Itô stochastic differential equation that was originally introduced to model genetic drift within finite populations and has recently been used as an approximation to ion channel dynamics within cardiac and neuronal cells. While analytic solutions to this equation remain within the interval [0,1], current numerical methods are unable to preserve such boundaries in the approximation. We present a new numerical method that guarantees approximations to a form of Wright-Fisher model, which includes mutation, remain within [0,1] for all time with probability one. Strong convergence of the method is proved and numerical experiments suggest that this new scheme converges with strong order 1/2. Extending this method to a multidimensional case, numerical tests suggest that the algorithm still converges strongly with order 1/2. Finally, numerical solutions obtained using this new method are compared to those obtained using the Euler-Maruyama method where the Wiener increment is resampled to ensure solutions remain within [0,1].

Officers' perspectives of policing alcohol-related incidents in and around licensed premises

Alcohol-related harms are disproportionately represented in licensed-premises. This study aimed to investigate the practices and perceived capabilities of a group of police officers who engage in policing activities in and around licensed premises in a capital city policing district in an Australian jurisdiction. Analysis of the self-reported data revealed that the 254 participants were much more likely to attend to alcohol-related incidents outside rather than inside licensed premises. Policing licensed premises that involved an alcohol-related event was perceived as the most difficult task compared to other forms of police activities, which was mirrored by low levels of perceived knowledge regarding effective intervention strategies to deal with incidents inside licensed premises. The findings have direct implication in regards to training police officers, particularly increasing their perceived knowledge and skill level to deal with incidents inside licensed premises.

Clustering composite SaaS components in cloud computing using a grouping genetic algorithm

Recently, Software as a Service (SaaS) in Cloud computing, has become more and more significant among software users and providers. To offer a SaaS with flexible functions at a low cost, SaaS providers have focused on the decomposition of the SaaS functionalities, or known as composite SaaS. This approach has introduced new challenges in SaaS resource management in data centres. One of the challenges is managing the resources allocated to the composite SaaS. Due to the dynamic environment of a Cloud data centre, resources that have been initially allocated to SaaS components may be overloaded or wasted. As such, reconfiguration for the components’ placement is triggered to maintain the performance of the composite SaaS. However, existing approaches often ignore the communication or dependencies between SaaS components in their implementation. In a composite SaaS, it is important to include these elements, as they will directly affect the performance of the SaaS. This paper will propose a Grouping Genetic Algorithm (GGA) for multiple composite SaaS application component clustering in Cloud computing that will address this gap. To the best of our knowledge, this is the first attempt to handle multiple composite SaaS reconfiguration placement in a dynamic Cloud environment. The experimental results demonstrate the feasibility and the scalability of the GGA.

A parallel cooperative co-evolutionary genetic algorithm for the composite SaaS placement problem in Cloud computing

A composite SaaS (Software as a Service) is a software that is comprised of several software components and data components. The composite SaaS placement problem is to determine where each of the components should be deployed in a cloud computing environment such that the performance of the composite SaaS is optimal. From the computational point of view, the composite SaaS placement problem is a large-scale combinatorial optimization problem. Thus, an Iterative Cooperative Co-evolutionary Genetic Algorithm (ICCGA) was proposed. The ICCGA can find reasonable quality of solutions. However, its computation time is noticeably slow. Aiming at improving the computation time, we propose an unsynchronized Parallel Cooperative Co-evolutionary Genetic Algorithm (PCCGA) in this paper. Experimental results have shown that the PCCGA not only has quicker computation time, but also generates better quality of solutions than the ICCGA.

Unsteady natural convection within a differentially heated enclosure of sinusoidal corrugated side walls

Numerically investigation of natural convection within a differentially heated modified square enclosure with sinusoidally corrugated side walls has been performed for different values of Rayleigh number. The fluid inside the enclosure considered is air and is quiescent, initially. The top and bottom surfaces are flat and considered as adiabatic. Results reveal three main stages: an initial stage, a transitory or oscillatory stage and a steady stage for the development of natural convection flow inside the corrugated cavity. The numerical scheme is based on the finite element method adapted to triangular non-uniform mesh element by a non-linear parametric solution algorithm. Investigation has been performed for the Rayleigh number, Ra ranging from 105 to 108 with variation of corrugation amplitude and frequency. Constant physical properties for the fluid medium have been assumed. Results have been presented in terms of the isotherms, streamlines, temperature plots, average Nusselt numbers, traveling waves and thermal boundary layer thickness plots, temperature and velocity profiles. The effects of sudden differential heating and its consequent transient behavior on fluid flow and heat transfer characteristics have been observed for the range of governing parameters. The present results show that the transient phenomena are greatly influenced by the variation of the Rayleigh Number with corrugation amplitude and frequency.

Terra Preta : bioenergy, soil restoration, urban agriculture, art algorithm

The 2010 LAGI competition was held on three underutilized sites in the United Arab Emirates. By choosing Staten Island, New York in 2012 the competition organises have again brought into question new roles for public open space in the contemporary city. In the case of the UEA sites, the competition produced many entries which aimed to create a sculpture and by doing so, they attracted people to the selected empty spaces in an arid climate. In a way these proposals were the incubators and the new characters of these empty spaces. The competition was thus successful at advancing understandings of the expanded role of public open spaces in EAU and elsewhere. LAGI 2012 differs significantly to the UAE program because Fresh Kills Park has already been planned as a public open space for New Yorkers - with or without these clean energy sculptures. Furthermore, Fresh Kills Park is already an (gas) energy generating site in its own right. We believe Fresh Kills Park, as a site, presents a problem which somewhat transcends the aims of the competition brief. Advancing a sustainable urban design proposition for the site therefore requires a fundamental reconsideration of the established paradigms public open space. Hence our strategy is to not only create an energy generating, site specific art work, but to create synergy between the public and the site engagement while at the same time complement the idiosyncrasies of the pre-existing engineered landscape. Current PhD research about energy generation in public open spaces informs this work.