Adaptive sizing of populations and number of islands in distributed genetic algorithms

Deciding the appropriate population size and number of is- lands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines a method that automatically searches for good combinations of island population sizes and the number of islands. The method is based on a race between competing parameter sets, and collaborative seeding of new parameter sets. This method is applicable to any problem, and makes distributed genetic algorithms easier to use by reducing the number of user-set parameters. The experimental results show that the proposed method robustly and reliably finds population and islands settings that are comparable to those found with traditional trial-and-error approaches.

Dynamic optimization of migration topology in internet-based distributed genetic algorithms

Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a major impact on DGA performance. This paper describes and evaluates an adaptive migration topology optimizer that keeps the communication load low while maintaining high solution quality. Experiments on benchmark problems show that the optimized topology outperforms static or random topologies of the same degree of connectivity. The applicability of the method on real-world problems is demonstrated on a hard optimization problem in VLSI design.

Bayesian algorithms with applications

Advances in algorithms for approximate sampling from a multivariable target function have led to solutions to challenging statistical inference problems that would otherwise not be considered by the applied scientist. Such sampling algorithms are particularly relevant to Bayesian statistics, since the target function is the posterior distribution of the unobservables given the observables. In this thesis we develop, adapt and apply Bayesian algorithms, whilst addressing substantive applied problems in biology and medicine as well as other applications. For an increasing number of high-impact research problems, the primary models of interest are often sufficiently complex that the likelihood function is computationally intractable. Rather than discard these models in favour of inferior alternatives, a class of Bayesian "likelihoodfree" techniques (often termed approximate Bayesian computation (ABC)) has emerged in the last few years, which avoids direct likelihood computation through repeated sampling of data from the model and comparing observed and simulated summary statistics. In Part I of this thesis we utilise sequential Monte Carlo (SMC) methodology to develop new algorithms for ABC that are more efficient in terms of the number of model simulations required and are almost black-box since very little algorithmic tuning is required. In addition, we address the issue of deriving appropriate summary statistics to use within ABC via a goodness-of-fit statistic and indirect inference. Another important problem in statistics is the design of experiments. That is, how one should select the values of the controllable variables in order to achieve some design goal. The presences of parameter and/or model uncertainty are computational obstacles when designing experiments but can lead to inefficient designs if not accounted for correctly. The Bayesian framework accommodates such uncertainties in a coherent way. If the amount of uncertainty is substantial, it can be of interest to perform adaptive designs in order to accrue information to make better decisions about future design points. This is of particular interest if the data can be collected sequentially. In a sense, the current posterior distribution becomes the new prior distribution for the next design decision. Part II of this thesis creates new algorithms for Bayesian sequential design to accommodate parameter and model uncertainty using SMC. The algorithms are substantially faster than previous approaches allowing the simulation properties of various design utilities to be investigated in a more timely manner. Furthermore the approach offers convenient estimation of Bayesian utilities and other quantities that are particularly relevant in the presence of model uncertainty. Finally, Part III of this thesis tackles a substantive medical problem. A neurological disorder known as motor neuron disease (MND) progressively causes motor neurons to no longer have the ability to innervate the muscle fibres, causing the muscles to eventually waste away. When this occurs the motor unit effectively ‘dies’. There is no cure for MND, and fatality often results from a lack of muscle strength to breathe. The prognosis for many forms of MND (particularly amyotrophic lateral sclerosis (ALS)) is particularly poor, with patients usually only surviving a small number of years after the initial onset of disease. Measuring the progress of diseases of the motor units, such as ALS, is a challenge for clinical neurologists. Motor unit number estimation (MUNE) is an attempt to directly assess underlying motor unit loss rather than indirect techniques such as muscle strength assessment, which generally is unable to detect progressions due to the body’s natural attempts at compensation. Part III of this thesis builds upon a previous Bayesian technique, which develops a sophisticated statistical model that takes into account physiological information about motor unit activation and various sources of uncertainties. More specifically, we develop a more reliable MUNE method by applying marginalisation over latent variables in order to improve the performance of a previously developed reversible jump Markov chain Monte Carlo sampler. We make other subtle changes to the model and algorithm to improve the robustness of the approach.

Detecting conversing groups of chatters : a model, algorithms, and tests

Chatrooms, for example Internet Relay Chat, are generally multi-user, multi-channel and multiserver chat-systems which run over the Internet and provide a protocol for real-time text-based conferencing between users all over the world. While a well-trained human observer is able to understand who is chatting with whom, there are no efficient and accurate automated tools to determine the groups of users conversing with each other. A precursor to analysing evolving cyber-social phenomena is to first determine what the conversations are and which groups of chatters are involved in each conversation. We consider this problem in this paper. We propose an algorithm to discover all groups of users that are engaged in conversation. Our algorithms are based on a statistical model of a chatroom that is founded on our experience with real chatrooms. Our approach does not require any semantic analysis of the conversations, rather it is based purely on the statistical information contained in the sequence of posts. We improve the accuracy by applying some graph algorithms to clean the statistical information. We present some experimental results which indicate that one can automatically determine the conversing groups in a chatroom, purely on the basis of statistical analysis.

Corporate governance as social responsibility : a meta-regulation approach to raise social responsibility of corporate governance in a weak economy

Corporate governance (CG) denotes the rules of business decision-making and directs the internal mechanism of companies to follow the output of the rules. It includes the customs, policies, laws and institutions as a set of processes that affects the way in which a corporation is directed, administered or controlled.

Adaptive dynamic path re-planning RRT algorithms with game theory for UAVs

The main aim of this paper is to describe an adaptive re-planning algorithm based on a RRT and Game Theory to produce an efficient collision free obstacle adaptive Mission Path Planner for Search and Rescue (SAR) missions. This will provide UAV autopilots and flight computers with the capability to autonomously avoid static obstacles and No Fly Zones (NFZs) through dynamic adaptive path replanning. The methods and algorithms produce optimal collision free paths and can be integrated on a decision aid tool and UAV autopilots.

Convergence of corporate social responsibility and corporate governance in weak economies : the case of Bangladesh

The convergence of corporate social responsibility (CSR) and corporate governance (CG) has changed the corporate accountability mechanism. This has developed a socially responsible ‘corporate self-regulation’, a synthesis of governance and responsibility in the companies of strong economies. However, unlike in the strong economies, this convergence has not been visible in the companies of weak economies, where the civil society groups are unorganised, regulatory agencies are either ineffective or corrupt and the media and non-governmental organisations do not mirror the corporate conscience. Using the case of Bangladesh, this article investigates the convergence between CSR and CG in the self-regulation of companies in a less vigilant environment.

Pseudo-marginal algorithms with multiple CPUs

The emergence of pseudo-marginal algorithms has led to improved computational efficiency for dealing with complex Bayesian models with latent variables. Here an unbiased estimator of the likelihood replaces the true likelihood in order to produce a Bayesian algorithm that remains on the marginal space of the model parameter (with latent variables integrated out), with a target distribution that is still the correct posterior distribution. Very efficient proposal distributions can be developed on the marginal space relative to the joint space of model parameter and latent variables. Thus psuedo-marginal algorithms tend to have substantially better mixing properties. However, for pseudo-marginal approaches to perform well, the likelihood has to be estimated rather precisely. This can be difficult to achieve in complex applications. In this paper we propose to take advantage of multiple central processing units (CPUs), that are readily available on most standard desktop computers. Here the likelihood is estimated independently on the multiple CPUs, with the ultimate estimate of the likelihood being the average of the estimates obtained from the multiple CPUs. The estimate remains unbiased, but the variability is reduced. We compare and contrast two different technologies that allow the implementation of this idea, both of which require a negligible amount of extra programming effort. The superior performance of this idea over the standard approach is demonstrated on simulated data from a stochastic volatility model.

Legal Regulation of Corporate Social Responsibility : A Meta-Regulation Approach of Law for Raising CSR in a Weak Economy

"Even though Corporate Social Responsibility (CSR) has become a widely accepted concept promoted by different stakeholders, business corporations' internal strategies, known as corporate self-regulation in most of the weak economies, respond poorly to this responsibility. Major laws relating to corporate regulation and responsibilities of these economies do not possess adequate ongoing influence to insist on corporate self-regulation to create a socially responsible corporate culture. This book describes how the laws relating to CSR could contribute to the inclusion of CSR principles at the core of the corporate self-regulation of these economies in general, without being intrusive in normal business practice. It formulates a meta-regulation approach to law, particularly by converging patterns of private ordering and state control in contemporary corporate law from the perspective of a weak economy. It proposes that this approach is suitable for alleviating regulators' limited access to information and expertise, inherent limitations of prescriptive rules, ensuring corporate commitment, and enhance the self-regulatory capacity of companies. This book describes various meta-regulation strategies for laws to link social values to economic incentives and disincentives, and to indirectly influence companies to incorporate CSR principles at the core of their self-regulation strategies. It investigates this phenomenon using Bangladesh as a case study."--publisher website

Harnessing SD and CSR within corporate self-regulation of weak economies : a meta-regulation approach

The semantic of the terms “sustainable development” and “corporate social responsibility” have changed over time to a point where these concepts have become two interrelated processes for ensuring the far-reaching development of society. Their convergence has given dimension to the environmental and corporate regulation mechanisms in strong economies. This article deals with the question of how the ethos of this convergence could be incorporated into the self-regulation of businesses in weak economies where nonlegal drivers are either inadequate or inefficient. It proposes that the policies for this incorporation should be based on the precepts of meta-regulation that have the potential to hold force majeure, economic incentives, and assistance-related strategies to reach an objective from the perspective of weak economies.

Comparing genotyping algorithms for Illumina's Infinium whole-genome SNP BeadChips

Background Illumina's Infinium SNP BeadChips are extensively used in both small and large-scale genetic studies. A fundamental step in any analysis is the processing of raw allele A and allele B intensities from each SNP into genotype calls (AA, AB, BB). Various algorithms which make use of different statistical models are available for this task. We compare four methods (GenCall, Illuminus, GenoSNP and CRLMM) on data where the true genotypes are known in advance and data from a recently published genome-wide association study. Results In general, differences in accuracy are relatively small between the methods evaluated, although CRLMM and GenoSNP were found to consistently outperform GenCall. The performance of Illuminus is heavily dependent on sample size, with lower no call rates and improved accuracy as the number of samples available increases. For X chromosome SNPs, methods with sex-dependent models (Illuminus, CRLMM) perform better than methods which ignore gender information (GenCall, GenoSNP). We observe that CRLMM and GenoSNP are more accurate at calling SNPs with low minor allele frequency than GenCall or Illuminus. The sample quality metrics from each of the four methods were found to have a high level of agreement at flagging samples with unusual signal characteristics. Conclusions CRLMM, GenoSNP and GenCall can be applied with confidence in studies of any size, as their performance was shown to be invariant to the number of samples available. Illuminus on the other hand requires a larger number of samples to achieve comparable levels of accuracy and its use in smaller studies (50 or fewer individuals) is not recommended.

Microstructure of an artificial grain boundary weak link in an YBa2Cu3O(7-δ) thin film grown on a (100)(110), [001]-tilt Y-ZrO2 bicrystal

The microstructure of an artificial grain boundary in an YBa2Cu3O7-δ (YBCO) thin film grown on a (100)(110), [001]-tilt yttria-stabilized-zirconia (YSZ) bicrystal substrate has been studied using transmission electron microscopy (TEM). The orientation relationship between the YBCO film and the YSZ substrate was [001]YBCO∥[001]YSZ and [110]YBCO∥[100]YSZ for each half of the bicrystal film. However, the exact boundary geometry of the bicrystal substrate was not transferred to the film. The substrate boundary was straight while the film boundary was wavy. In several cases there was bending of the lattice confined within a distance of a few basal-plane lattice spacings from the boundary plane and microfaceting. No intergranular secondary phase was observed but about 25% of the boundary was covered by c-axis-tilted YBCO grains and a-axis-oriented grains, both of which were typically adjacent to CuO grains or surrounded by a thin Cu-rich amorphous layer.

Properties of artificial grain boundary weak links grown on Y-ZrO 2 bicrystals

Weak links were fabricated by pulsed laser deposition of YBa 2Cu3Ox thin films on Y-ZrO2 bicrystal substrates. They were formed by transferring the bicrystal boundary into the epitaxial film during the film growth. Their properties were determined by the misorientation angle ( theta ) between the two halves of the bicrystal. The transport properties of the weak links were studied as a function of theta and an exponential dependence of the weak link critical current density was observed for angles up to 45 degrees . Clear Josephson effects with good microwave and magnetic field response were observed.

Weak links and dc SQUIDS on artificial nonsymmetric grain boundaries in YBa2Cu3O7-δ

We have studied weak links and dc-SQUIDs made from pulsed laser deposited YBa2Cu3O7-δ thin films on Y-ZrO 2 bicrystal substrates. The transport properties of the weak links were studied as a function of the misorientation angle (θ) between the two halves of the bicrystal and an exponential dependence of the weak link critical current density was observed for angles up to 40°at 77 K. Josephson effects with clear microwave and magnetic field responses were observed. An optimum dc-SQUID performance at 77 K was obtained for θ=32°. At this temperature, we achieved a periodic magnetic field response with a modulation depth of 12 μV.

Weak key-IV pairs in the A5/1 stream cipher

A5/1 is a shift register based stream cipher which provides privacy for the GSM system. In this paper, we analyse the loading of the secret key and IV during the initialisation process of A5/1. We demonstrate the existence of weak key-IV pairs in the A5/1 cipher due to this loading process; these weak key-IV pairs may generate one, two or three registers containing all-zero values, which may lead in turn to weak keystream sequences. In the case where two or three registers contain only zeros, we describe a distinguisher which leads to a complete decryption of the affected messages.