The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

5-cycle systems of K-v-F with a hole

Recently the problem of the existence of a 5-cycle system of K-v with a hole of size u was completely solved. In this paper we prove necessary and sufficient conditions on v and u for the existence of a 5-cycle system of K-v - F, with a hole of size u.

Embeddings of m-cycle systems and incomplete m-cycle systems: m<=14

In this paper we completely settle the embedding problem for m-cycle systems with m less than or equal to 14. We also solve the more general problem of finding m-cycle systems of K-v - K-u when m is an element of {4,6,7,8,10,12,14}.

On the Hamilton-Waterloo problem

The Hamilton-Waterloo problem asks for a 2-factorisation of K-v in which r of the 2-factors consist of cycles of lengths a(1), a(2),..., a(1) and the remaining s 2-factors consist of cycles of lengths b(1), b(2),..., b(u) (where necessarily Sigma(i)(=1)(t) a(i) = Sigma(j)(=1)(u) b(j) = v). In thus paper we consider the Hamilton-Waterloo problem in the case a(i) = m, 1 less than or equal to i less than or equal to t and b(j) = n, 1 less than or equal to j less than or equal to u. We obtain some general constructions, and apply these to obtain results for (m, n) is an element of {(4, 6)1(4, 8), (4, 16), (8, 16), (3, 5), (3, 15), (5, 15)}.

Some equitably 3-colourable cycle decompositions

Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),..., c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and (i) - n(j) less than or equal to 1 for any i, j is an element of {1, 2,..., k}, then C is equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in C is equitably k-coloured. For m = 4,5 and 6, we completely settle the existence problem for equitably 3-colourable m-cycle decompositions of complete graphs and complete graphs with the edges of a 1-factor removed. (C) 2004 Elsevier B.V. All rights reserved.

Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post

This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-city mail distribution problem faced by Australia Post. First we describe the Australia Post mail distribution problem and outline the heuristic vehicle routing algorithm used to find vehicle routes. We present a new multi-depot combined vehicle and crew scheduling algorithm based on set covering with column generation. The paper concludes with a computational investigation examining the affect of different types of vehicle routing solutions on the vehicle and crew scheduling solution, comparing the different levels of integration possible with the new vehicle and crew scheduling algorithm and comparing the results of sequential versus simultaneous vehicle and crew scheduling, using real life data for Australia Post distribution networks.

Least energy solutions of a critical Neumann problem with a weight

We investigate the effect of the coefficient of the critical nonlinearity for the Neumann problem on the existence of least energy solutions. As a by-product we establish a Sobolev inequality with interior norm.

What is the Problem of Ad Hoc Hypotheses?

The received view of an ad hoc hypothesis is that it accounts for only the observation(s) it was designed to account for, and so non-adhocness is generally held to be necessary or important for an introduced hypothesis or modification to a theory. Attempts by Popper and several others to convincingly explicate this view, however, prove to be unsuccessful or of doubtful value, and familiar and firmer criteria for evaluating the hypotheses or modified theories so classified are characteristically available. These points are obscured largely because the received view fails to adequately separate psychology from methodology or to recognise ambiguities in the use of 'ad hoc'.

Watkins and the Pragmatic Problem of Induction

Watkins proposes a neo-Popperian solution to the pragmatic problem of induction. He asserts that evidence can be used non-inductively to prefer the principle that corroboration is more successful over all human history than that, say, counter-corroboration is more successful either over this same period or in the future. Watkins's argument for rejecting the first counter-corroborationist alternative is beside the point. However, as whatever is the best strategy over all human history is irrelevant to the pragmatic problem of induction since we are not required to act in the past, and his argument for rejecting the second presupposes induction.

On the nonlinear Neumann problem with critical and supercritical nonlinearities

We investigate the solvability of the Neumann problem (1.1) involving a critical Sobolev exponent. In the first part of this work it is assumed that the coeffcients Q and h are at least continuous. Moreover Q is positive on overline Omega and lambda > 0 is a parameter. We examine the common effect of the mean curvature and the shape of the graphs of the coeffcients Q and h on the existence of low energy solutions. In the second part of this work we consider the same problem with Q replaced by - Q. In this case the problem can be supercritical and the existence results depend on integrability conditions on Q and h.

(FAB11_2_003) Authentic Japanese architecture after Bruno Taut: the problem of eclecticism

This paper will examine attitudes to eclectic stylistic borrowing in Japan in the twentieth century in light of the concept of authenticity. I am particularly interested in how an earlier claim correlating European modernist and traditional Japanese architecture continues to colour conceptions about what is an 'authentic' response for Japanese architects to make to contemporary conditions. Non-Western and vernacular architectures generally have been the repository for touristic desires for regional authenticity and difference. Yet Japan's unique role in the development of modernist architecture has given a peculiar intensity to the demand for its architecture to resist a perceived postmodern decadence.

Analysis of heat transfer and entropy generation for a thermally developing Brinkman–Brinkman forced convection problem in a rectangular duct with isoflux walls

Heat transfer and entropy generation analysis of the thermally developing forced convection in a porous-saturated duct of rectangular cross-section, with walls maintained at a constant and uniform heat flux, is investigated based on the Brinkman flow model. The classical Galerkin method is used to obtain the fully developed velocity distribution. To solve the thermal energy equation, with the effects of viscous dissipation being included, the Extended Weighted Residuals Method (EWRM) is applied. The local (three dimensional) temperature field is solved by utilizing the Green’s function solution based on the EWRM where symbolic algebra is being used for convenience in presentation. Following the computation of the temperature field, expressions are presented for the local Nusselt number and the bulk temperature as a function of the dimensionless longitudinal coordinate, the aspect ratio, the Darcy number, the viscosity ratio, and the Brinkman number. With the velocity and temperature field being determined, the Second Law (of Thermodynamics) aspect of the problem is also investigated. Approximate closed form solutions are also presented for two limiting cases of MDa values. It is observed that decreasing the aspect ratio and MDa values increases the entropy generation rate.