Efficient tree construction for the multicast problem

A new heuristic for the Steiner Minimal Tree problem is presented here. The method described is based on the detection of particular sets of nodes in networks, the “Hot Spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used CIS comparison terms in the experimental analysis which demonstrates the goodness of the heuristic discussed in this paper.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the “hot spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed

LVB: parsimony and simulated annealing in the search for phylogenetic trees

Summary: The program LVB seeks parsimonious phylogenies from nucleotide alignments, using the simulated annealing heuristic. LVB runs fast and gives high quality results.

A little learning is a dangerous thing: an experimental demonstration of ignorance-driven inference

Studies of ignorance-driven decision making have been employed to analyse when ignorance should prove advantageous on theoretical grounds or else they have been employed to examine whether human behaviour is consistent with an ignorance-driven inference strategy (e. g., the recognition heuristic). In the current study we examine whether-under conditions where such inferences might be expected-the advantages that theoretical analyses predict are evident in human performance data. A single experiment shows that, when asked to make relative wealth judgements, participants reliably use recognition as a basis for their judgements. Their wealth judgements under these conditions are reliably more accurate when some of the target names are unknown than when participants recognize all of the names (a "less-is-more effect"). These results are consistent across a number of variations: the number of options given to participants and the nature of the wealth judgement. A basic model of recognition-based inference predicts these effects.

Deciding the price of fame

Previous studies of ignorance-driven decision-making have either analyzed when ignorance should prove advantageous on theoretical grounds, or else they have examined whether human behavior is consistent with an ignorance driven inference strategy (e.g., the recognition heuristic). The current study merges these research goals by examining whether – under conditions where ignorance driven inference might be expected – the type of advantages theoretical analyses predict are evident in human performance data. A single experiment shows that, when asked to make relative wealth judgments, participants reliably use recognition as a basis for their judgments. Their wealth judgments under these conditions are reliably more accurate when some of the target names are unknown than when participants recognize all the names (the “less-is-more effect”). these data are robust against a number of variations on the size of the pool from which participants have to choose and the nature of the wealth judgment.

Search space pruning and global optimisation of Multiple Gravity Assist spacecraft trajectories

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.

Directed search with real options

While search is normally modelled by economists purely in terms of decisions over making observations, this paper models it as a process in which information is gained through feedback from innovatory product launches. The information gained can then be used to decide whether to exercise real options. In the model the initial decisions involve a product design and the scale of production capacity. There are then real options to change these factors based on what is learned. The case of launching product variants in parallel is also considered. Under ‘true’ uncertainty, the model can be seen in terms of heuristic decision-making based on subjective beliefs with limited foresight. Search costs, the values of the real options, beliefs, and the cost of capital are all shown to be significant in determining the search path.

Mean-tracking clustering algorithm for radial basis function centre selection

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Expert system aid for design of overload line distribution networks

The use of expert system techniques in power distribution system design is examined. The selection and siting of equipment on overhead line networks is chosen for investigation as the use of equipment such as auto-reclosers, etc., represents a substantial investment and has a significant effect on the reliability of the system. Through past experience with both equipment and network operations, most decisions in selection and siting of this equipment are made intuitively, following certain general guidelines or rules of thumb. This heuristic nature of the problem lends itself to solution using an expert system approach. A prototype has been developed and is currently under evaluation in the industry. Results so far have demonstrated both the feasibility and benefits of the expert system as a design aid.

A multinomial model of applying recognition to judge between multiple alternatives

Proponents of the “fast and frugal” approach to decision-making suggest that inferential judgments are best made on the basis of limited information. For example, if only one of two cities is recognized and the task is to judge which city has the larger population, the recognition heuristic states that the recognized city should be selected. In preference choices with >2 options, it is also standard to assume that a “consideration set”, based upon some simple criterion, is established to reduce the options available. A multinomial processing tree model is outlined which provides the basis for estimating the extent to which recognition is used as a criterion in establishing a consideration set for inferential judgments.

A framework for graphic description in book design

This project is concerned with the way that illustrations, photographs, diagrams and graphs, and typographic elements interact to convey ideas on the book page. A framework for graphic description is proposed to elucidate this graphic language of ‘complex texts’. The model is built up from three main areas of study, with reference to a corpus of contemporary children’s science books. First, a historical survey puts the subjects for study in context. Then a multidisciplinary discussion of graphic communication provides a theoretical underpinning for the model; this leads to various proposals, such as the central importance of ratios and relationships among parts in creating meaning in graphic communication. Lastly a series of trials in description contribute to the structure of the model itself. At the heart of the framework is an organising principle that integrates descriptive models from fields of design, literary criticism, art history, and linguistics, among others, as well as novel categories designed specifically for book design. Broadly, design features are described in terms of elemental component parts (micro-level), larger groupings of these (macro-level), and finally in terms of overarching, ‘whole book’ qualities (meta-level). Various features of book design emerge at different levels; for instance, the presence of nested discursive structures, a form of graphic recursion in editorial design, is proposed at the macro-level. Across these three levels are the intersecting categories of ‘rule’ and ‘context’, offering different perspectives with which to describe graphic characteristics. Contextbased features are contingent on social and cultural environment, the reader’s previous knowledge, and the actual conditions of reading; rule-based features relate to the systematic or codified aspects of graphic language. The model aims to be a frame of reference for graphic description, of use in different forms of qualitative or quantitative research and as a heuristic tool in practice and teaching.

Inferring the biggest and best: a measurement model for applying recognition to evoke consideration sets and judge between multiple alternatives

It has long been supposed that preference judgments between sets of to-be-considered possibilities are made by means of initially winnowing down the most promising-looking alternatives to form smaller “consideration sets” (Howard, 1963; Wright & Barbour, 1977). In preference choices with >2 options, it is standard to assume that a “consideration set”, based upon some simple criterion, is established to reduce the options available. Inferential judgments, in contrast, have more frequently been investigated in situations in which only two possibilities need to be considered (e.g., which of these two cities is the larger?) Proponents of the “fast and frugal” approach to decision-making suggest that such judgments are also made on the basis of limited, simple criteria. For example, if only one of two cities is recognized and the task is to judge which city has the larger population, the recognition heuristic states that the recognized city should be selected. A multinomial processing tree model is outlined which provides the basis for estimating the extent to which recognition is used as a criterion in establishing a consideration set for inferential judgments between three possible options.

On nonlinear symmetric stability and the nonlinear saturation of symmetric instability

A nonlinear symmetric stability theorem is derived in the context of the f-plane Boussinesq equations, recovering an earlier result of Xu within a more general framework. The theorem applies to symmetric disturbances to a baroclinic basic flow, the disturbances having arbitrary structure and magnitude. The criteria for nonlinear stability are virtually identical to those for linear stability. As in Xu, the nonlinear stability theorem can be used to obtain rigorous upper bounds on the saturation amplitude of symmetric instabilities. In a simple example, the bounds are found to compare favorably with heuristic parcel-based estimates in both the hydrostatic and non-hydrostatic limits.

Fractal spatialities

This paper argues for the use of ‘fractals’ in theorising sociospatial relations. From a realist position, a nonmathematical but nonmetaphoric and descriptive view of ‘fractals’ is advanced. Insights from the natural sciences are combined with insights on the position of the observer from Luhmann and notions of assemblages and repetitions from Deleuze. It is argued that the notion of ‘fractals’ can augment current understanding of sociospatialities in three ways. First, it can pose questions about the scalar position of the observer or the grain of observation; second, as a signifier of particular attributes, it prompts observation and description of particular structuring processes; and third, the epistemic access afforded by the concept can open up possibilities for transformative interventions and thereby inform the same. The theoretical usefulness of the concept is demonstrated by discussing the territory, place, scale, and networks (TPSN) model for theorising sociospatial relations advanced by B Jessop, N Brenner, and M Jones in their 2008 paper “Theorizing sociospatial relations”, published in this journal (volume 26, pages 389–401). It is suggested that a heuristic arising from a ‘fractal’ ontology can contribute to a polymorphous, as opposed to polyvalent, understanding of sociospatial relations.

Nonlinear saturation of baroclinic instability: part III: bounds on the energy

Rigorous upper bounds are derived on the saturation amplitude of baroclinic instability in the two-layer model. The bounds apply to the eddy energy and are obtained by appealing to a finite amplitude conservation law for the disturbance pseudoenergy. These bounds are to be distinguished from those derived in Part I of this study, which employed a pseudomomentum conservation law and provided bounds on the eddy potential enstrophy. The bounds apply to conservative (inviscid, unforced) flow, as well as to forced-dissipative flow when the dissipation is proportional to the potential vorticity. Bounds on the eddy energy are worked out for a general class of unstable westerly jets. In the special case of the Phillips model of baroclinic instability, and in the limit of infinitesimal initial eddy amplitude, the bound states that the eddy energy cannot exceed ϵβ2/6F where ϵ = (U − Ucrit)/Ucrit is the relative supercriticality. This bound captures the essential dynamical scalings (i.e., the dependence on ϵ, β, and F) of the saturation amplitudes predicted by weakly nonlinear theory, as well as exhibiting remarkable quantitative agreement with those predictions, and is also consistent with heuristic baroclinic adjustment estimates.