Non-competitive phenotypic differences can have a strong effect on ideal free distributions

1. We present a model of the ideal free distribution (IFD) where differences between phenotypes other than those involved in direct competition for resources are considered. We show that these post-acquisitional differences can have a dramatic impact on the predicted distributions of individuals.

2. Specifically, we predict that, when the relative abilities of phenotypes are independent of location, there will be a continuum of mixed evolutionarily stable strategy (ESS) distributions (where all phenotypes are present in all patches).

3, When the relative strengths of the post-acquisitional trait in the two phenotypes differ between patches, however, we predict only a single ESS at equilibrium. Further, this distribution may be fully or partially segregated (with the distribution of at least one phenotype being spatially restricted) but it will never be mixed.

4, Our results for post-acquisitional traits mirror those of Parker (1982) for direct competitive traits. This comparison illustrates that it does not matter whether individual differences are expressed before or after competition for resources, they will still exert considerable influence on the distribution of the individuals concerned.

How do grazers achieve their distribution? A continuum of models from random diffusion to the ideal free distribution using biased random walks

A conceptual model is described for generating distributions of grazing animals, according to their searching behavior, to investigate the mechanisms animals may use to achieve their distributions. The model simulates behaviors ranging from random diffusion, through taxis and cognitively aided navigation (i.e., using memory), to the optimization extreme of the Ideal Free Distribution. These behaviors are generated from simulation of biased diffusion that operates at multiple scales simultaneously, formalizing ideas of multiple-scale foraging behavior. It uses probabilistic bias to represent decisions, allowing multiple search goals to be combined (e.g., foraging and social goals) and the representation of suboptimal behavior. By allowing bias to arise at multiple scales within the environment, each weighted relative to the others, the model can represent different scales of simultaneous decision-making and scale-dependent behavior. The model also allows different constraints to be applied to the animal's ability (e.g., applying food-patch accessibility and information limits). Simulations show that foraging-decision randomness and spatial scale of decision bias have potentially profound effects on both animal intake rate and the distribution of resources in the environment. Spatial variograms show that foraging strategies can differentially change the spatial pattern of resource abundance in the environment to one characteristic of the foraging strategy.</

Beyond the ideal free distribution: More general models of predator distribution

The ideal free distribution model which relates the spatial distribution of mobile consumers to that of their resource is shown to be a limiting case of a more general model which we develop using simple concepts of diffusion. We show how the ideal free distribution model can be derived from a more general model and extended by incorporating simple models of social influences on predator spacing. First, a free distribution model based on patch switching rules, with a power-law interference term, which represents instantaneous biased diffusion is derived. A social bias term is then introduced to represent the effect of predator aggregation on predator fitness, separate from any effects which act through intake rate. The social bias term is expanded to express an optimum spacing for predators and example solutions of the resulting biased diffusion models are shown. The model demonstrates how an empirical interference coefficient, derived from measurements of predator and prey densities, may include factors expressing the impact of social spacing behaviour on fitness. We conclude that empirical values of log predator/log prey ratio may contain information about more than the relationship between consumer and resource densities. Unlike many previous models, the model shown here applies to conditions without continual input. (C) 1997 Academic Press Limited.</p>

Use of data dependence graphs in the design of bit-level systolic arrays

The use of bit-level systolic array circuits as building blocks in the construction of larger word-level systolic systems is investigated. It is shown that the overall structure and detailed timing of such systems may be derived quite simply using the dependence graph and cut-set procedure developed by S. Y. Kung (1988). This provides an attractive and intuitive approach to the bit-level design of many VLSI signal processing components. The technique can be applied to ripple-through and partly pipelined circuits as well as fully systolic designs. It therefore provides a means of examining the relative tradeoff between levels of pipelining, chip area, power consumption, and throughput rate within a given VLSI design.

DESIGNING VLSI SIGNAL PROCESSING CHIPS USING DATA DEPENDENCE GRAPHS.

The highly structured nature of many digital signal processing operations allows these to be directly implemented as regular VLSI circuits. This feature has been successfully exploited in the design of a number of commercial chips, some examples of which are described. While many of the architectures on which such chips are based were originally derived on heuristic basis, there is an increasing interest in the development of systematic design techniques for the direct mapping of computations onto regular VLSI arrays. The purpose of this paper is to show how the the technique proposed by Kung can be readily extended to the design of VLSI signal processing chips where the organisation of computations at the level of individual data bits is of paramount importance. The technique in question allows architectures to be derived using the projection and retiming of data dependence graphs.

Family caregivers' ideal expectations of Canada's Compassionate Care Benefit

We present the findings of 57 interviews conducted in 2007-2008 with Canadians who have cared for a dying family member to examine their ideal expectations of the Compassionate Care Benefit (CCB) - a social programme providing job security and income support for workers caring for a dying person. Our aims are to (1) appreciate how intended users and other family caregivers view the programme's very nature; (2) identify programme challenges and improvements that emerge from considering family caregivers' ideal expectations; and (3) contribute to a larger evaluative study designed to make policy-relevant recommendations for CCB improvement. Review of transcripts across three respondent groups reveals four categories of ideal expectations: (1) eligibility, (2) informational, (3) timing and (4) financial. Ideal expectations were typically derived from respondents' experiences of care-giving, their knowledge of the programme and, for some, of applying for and/or receiving the CCB. Findings reveal that there are gaps between respondents' ideal expectations and their experienced realities. Such gaps may lead to disappointment being experienced by those who believe they should be eligible for the programme but are not, or should be entitled to receive some form of support that is not presently available. This analysis plays an important role in identifying potential changes for the CCB that may better support family caregivers, in that the ideal expectations serve as a starting point for articulating desirable programme amendments. This analysis also has wider relevance. For jurisdictions looking to create new social programmes to support caregivers based upon labour policy strategies and legislation, this analysis identifies considerations that should be made at the outset of development. For jurisdictions that already have employment-based caregiver support programmes, this analysis demonstrates that programme challenges may not always be met through legislative changes alone but also through measures such as increasing awareness. © 2011 Blackwell Publishing Ltd.

Attitudes towards ideal family size of different ethnic/nationality groups in Great Britain, France and Germany.

This article reports upon results from a European Union funded project on the integration of children of international migrants in Britain, France and Germany. It provides both a descriptive and a multivariate analysis of the factors that determine attitudes towards ideal family size. The results reveal that there are large differences between ethnic groups in Britain: Indian and Pakistani respondents in Britain expressed a preference for significantly larger families. However, many children of international migrants expressed a desire for smaller families than the autochthonous population in both countries. This was particularly the case for Portuguese respondents in France and Turks in Germany. Religious affiliation also had a significant effect, above and beyond ethnicity per se. Both Moslems and Christians preferred larger families than those with no religious affiliation. The article concludes that ethnic differences in attitudes towards fertility behaviour will remain important in the foreseeable future in western Europe, particularly in Britain.

Implementing efficient graphs in connection networks

We consider the problem of sharing the cost of a network that meets the connection demands of a set of agents. The agents simultaneously choose paths in the network connecting their demand nodes. A mechanism splits the total cost of the network formed among the participants. We introduce two new properties of implementation. The first property, Pareto Nash implementation (PNI), requires that the efficient outcome always be implemented in a Nash equilibrium and that the efficient outcome Pareto dominates any other Nash equilibrium. The average cost mechanism and other asymmetric variations are the only mechanisms that meet PNI. These mechanisms are also characterized under strong Nash implementation. The second property, weakly Pareto Nash implementation (WPNI), requires that the least inefficient equilibrium Pareto dominates any other equilibrium. The egalitarian mechanism (EG) and other asymmetric variations are the only mechanisms that meet WPNI and individual
rationality. EG minimizes the price of stability across all individually rational mechanisms. © Springer-Verlag Berlin Heidelberg 2012

Using Graphs to Visualise and Detect Anomalies in Access Control System Transactions

Physical Access Control Systems are commonly used to secure doors in buildings such as airports, hospitals, government buildings and offices. These systems are designed primarily to provide an authentication mechanism, but they also log each door access as a transaction in a database. Unsupervised learning techniques can be used to detect inconsistencies or anomalies in the mobility data, such as a cloned or forged Access Badge, or unusual behaviour by staff members. In this paper, we present an overview of our method of inferring directed graphs to represent a physical building network and the flows of mobility within it. We demonstrate how the graphs can be used for Visual Data Exploration, and outline how to apply algorithms based on Information Theory to the graph data in order to detect inconsistent or abnormal behaviour.

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we present AGWAN (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the AGWAN model to real-world graphs and for generating random graphs from the model. Using the Enron “who communicates with whom” social graph, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to the structure of real-world graphs.