Analysis of the distribution of the number of bidders in construction contract auctions

The number of bidders, N, involved in a construction procurement auction is known to have an important effect on the value of the lowest bid and the mark up applied by bidders. In practice, for example, it is important for a bidder to have a good estimate of N when bidding for a current contract. One approach, instigated by Friedman in 1956, is to make such an estimate by statistical analysis and modelling. Since then, however, finding a suitable model for N has been an enduring problem for researchers and, despite intensive research activity in the subsequent thirty years little progress has been made - due principally to the absence of new ideas and perspectives. This paper resumes the debate by checking old assumptions, providing new evidence relating to concomitant variables and proposing a new model. In doing this and in order to assure universality, a novel approach is developed and tested by using a unique set of twelve construction tender databases from four continents. This shows the new model provides a significant advancement on previous versions. Several new research questions are also posed and other approaches identified for future study.

Two varieties of the invasive liana, cat’s claw creeper, Macfadyena unguis-cati (Bignoniaceae) in Queensland, Australia

The invasive liana cat’s claw creeper, Macfadyena unguis-cati, native to tropical Central and South America, is a major environmental weed in Queensland and New South Wales (NSW). Two morphologically distinct cat’s claw creeper varieties occur in Australia, a ‘short-pod’ variety that is widespread through Queensland and NSW and a ‘long-pod’ variety restricted to a few sites in southeast Queensland. In this study we report the differences in the above-ground morphological, phenological and reproductive traits between the two varieties. The ‘long-pod’ variety has significantly larger leaves, larger pods, and larger number of seeds per pod than the ‘short-pod’ variety. The ‘short-pod’ variety has a slightly wider pods, and thicker leaves than the ‘long-pod’ variety. Both varieties have a yellow trumpet shaped flower, but the flower of the ‘long-pod’ variety has a deeper hue of yellow than the ‘short-pod’ flower. The fruits of the ‘short-pod’ variety mature in late summer to early autumn while the fruits of ‘long-pod’ variety mature in late winter to early spring. The more widespread nature of the ‘short-pod’ variety could potentially be due to a preference for this variety as an ornamental plant, due to its more presentable foliage characteristics and shorter pods, in contrast to the ‘long-pod’ variety.

On the number of two-line and three-line latin rectangles - an alternative approach

The number of two-line and three-line Latin rectangles is obtained by recursive methods in a setting slightly more general than usually considered. We show how this leads to a generalisation which is proved elsewhere.

Documents regarding number of recipients and amount of cash distributed; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"25851 Personen betreute die Juedische Winterhilfe mit Regelleistungen. 2300 Barbeihilfen im Werte von 54000 Mark wurden an Betreute gezahlt"

Comparison of three pollination methods for Eucalyptus argophloia, a small-flowered eucalypt

Context Most studies assess pollination success at capsule maturity, and studies of pre-zygotic processes are often lacking. Aims This study investigates the suitability of controlled pollination for a potential forestry plantation species, Eucalyptus argophloia, by examining pre- and post-zygotic pollination success. Methods Pollen tube development, capsule set and seed set are compared following three-stop pollination, artificially induced protogyny (AIP), AIP unpollinated and open pollination. The fecundity of stored pollen was compared with that of fresh pollen. Results Three-stop pollination, AIP and open pollination had similar numbers of pollen tubes, but AIP unpollinated had none. Open pollination produced significantly more capsules and total number of seeds than the other treatments. There were significantly more seeds per retained capsule for the open pollination and three-stop pollination treatments than for the AIP and AIP unpollinated pollination treatments. There were no significant differences relative to the age of pollen. Conclusions Pre-zygotic success in terms of pollen tubes was similar for open-pollinated, three stop and AIP, but was not reflected in post-zygotic success when the open pollination and three-stop method produced significantly more seeds per retained capsule than the AIP treatments and open pollination yielded more seeds. Capsule set and total seed set for open pollination, and fewer capsules in controlled pollinations, may reflect physical damage to buds because of the small E. argophloia flowers. Suitable alternative breeding strategies other than controlled pollinations are discussed for this species.

Counting the cost: Estimating the number of deaths among recently released prisoners in Australia

TO THE EDITOR: Kinner and colleagues described the high proportion of deaths among recently released prisoners in Australia...

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

A semi-analytical solution for multilayer diffusion in a composite medium consisting of a large number of layers

Diffusion in a composite slab consisting of a large number of layers provides an ideal prototype problem for developing and analysing two-scale modelling approaches for heterogeneous media. Numerous analytical techniques have been proposed for solving the transient diffusion equation in a one-dimensional composite slab consisting of an arbitrary number of layers. Most of these approaches, however, require the solution of a complex transcendental equation arising from a matrix determinant for the eigenvalues that is difficult to solve numerically for a large number of layers. To overcome this issue, in this paper, we present a semi-analytical method based on the Laplace transform and an orthogonal eigenfunction expansion. The proposed approach uses eigenvalues local to each layer that can be obtained either explicitly, or by solving simple transcendental equations. The semi-analytical solution is applicable to both perfect and imperfect contact at the interfaces between adjacent layers and either Dirichlet, Neumann or Robin boundary conditions at the ends of the slab. The solution approach is verified for several test cases and is shown to work well for a large number of layers. The work is concluded with an application to macroscopic modelling where the solution of a fine-scale multilayered medium consisting of two hundred layers is compared against an “up-scaled” variant of the same problem involving only ten layers.

An Estimator Algorithm For Learning Automata With Changing Number Of Actions

In many problems of decision making under uncertainty the system has to acquire knowledge of its environment and learn the optimal decision through its experience. Such problems may also involve the system having to arrive at the globally optimal decision, when at each instant only a subset of the entire set of possible alternatives is available. These problems can be successfully modelled and analysed by learning automata. In this paper an estimator learning algorithm, which maintains estimates of the reward characteristics of the random environment, is presented for an automaton with changing number of actions. A learning automaton using the new scheme is shown to be e-optimal. The simulation results demonstrate the fast convergence properties of the new algorithm. The results of this study can be extended to the design of other types of estimator algorithms with good convergence properties.

Design of crosspoint-irredundant PLAs using minimal number of control inputs

The problem of determining a minimal number of control inputs for converting a programmable logic array (PLA) with undetectable faults to crosspoint-irredundant PLA for testing has been formulated as a nonstandard set covering problem. By representing subsets of sets as cubes, this problem has been reformulated as familiar problems. It is noted that this result has significance because a crosspoint-irredundant PLA can be converted to a completely testable PLA in a straightforward fashion, thus achieving very good fault coverage and easy testability.

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations

It is important to identify the ``correct'' number of topics in mechanisms like Latent Dirichlet Allocation(LDA) as they determine the quality of features that are presented as features for classifiers like SVM. In this work we propose a measure to identify the correct number of topics and offer empirical evidence in its favor in terms of classification accuracy and the number of topics that are naturally present in the corpus. We show the merit of the measure by applying it on real-world as well as synthetic data sets(both text and images). In proposing this measure, we view LDA as a matrix factorization mechanism, wherein a given corpus C is split into two matrix factors M-1 and M-2 as given by C-d*w = M1(d*t) x Q(t*w).Where d is the number of documents present in the corpus anti w is the size of the vocabulary. The quality of the split depends on ``t'', the right number of topics chosen. The measure is computed in terms of symmetric KL-Divergence of salient distributions that are derived from these matrix factors. We observe that the divergence values are higher for non-optimal number of topics - this is shown by a `dip' at the right value for `t'.

Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.