The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

On the Neighbour-Distinguishing Index of a Graph

A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adjacent vertices by sets of colours of their incident edges. It is proved that for any planar bipartite graph G with Δ(G)≥12 there is a neighbour-distinguishing edge colouring of G using at most Δ(G)+1 colours. Colourings distinguishing pairs of vertices that satisfy other requirements are also considered.     

The Asymptotic Behaviour of the Fourier Transforms of Orthogonal Polynomials I: Mellin Transform Techniques

The Fourier transform of orthogonal polynomials with respect to their own orthogonality measure defines the family of Fourier–Bessel functions. We study the asymptotic behaviour of these functions and of their products, for large real values of the argument. By employing a Mellin analysis we construct a general framework to exhibit the relation of the asymptotic decay laws to certain dimensions of the orthogonality measure, that are defined via the divergence abscissas of suitable integrals. The unifying r?le of Mellin transform techniques in deriving classical and new results is underlined. Submitted: November 5, 2004. Accepted: January 6, 2006.     

Learning and transfer in dynamic decision environments

An important aspect of learning is the ability to transfer knowledge to new contexts. However, in dynamic decision tasks, such as bargaining, firefighting, and process control, where decision makers must make repeated decisions under time pressure and outcome feedback may relate to any of a number of decisions, such transfer has proven elusive. This paper proposes a two-stage connectionist model which hypothesizes that decision makers learn to identify categories of evidence requiring similar decisions as they perform in dynamic environments. The model suggests conditions under which decision makers will be able to use this ability to help them in novel situations. These predictions are compared against those of a one-stage decision model that does not learn evidence categories, as is common in many current theories of repeated decision making. Both models' predictions are then tested against the performance of decision makers in an Internet bargaining task. Both models correctly predict aspects of decision makers' learning under different interventions. The two-stage model provides closer fits to decision maker performance in a new, related bargaining task and accounts for important features of higher-performing decision makers' learning. Although frequently omitted in recent accounts of repeated decision making, the processes of evidence category formation described by the two-stage model appear critical in understanding the extent to which decision makers learn from feedback in dynamic tasks. Faison (Bud) Gibson is an Assistant Professor at College of Business, Eastern Michigan University. He has extensive experience developing and empirically testing models of decision behavior in dynamic decision environments.     

Necessary conditions and duality for inexact nonlinear semi-infinite programming problems

First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii–Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given.     

Dimensional Properties of Fractional Brownian Motion

Let B^α = {B^α（t）,t E R^N} be an （N,d）-fractional Brownian motion with Hurst index α∈ （0, 1）. By applying the strong local nondeterminism of B^α, we prove certain forms of uniform Hausdorff dimension results for the images of B^α when N 〉 αd. Our results extend those of Kaufman for one-dimensional Brownian motion.     

Assignments of methanol laser lines by frequency measurements and Fourier transform spectroscopy

We have measured the frequencies of four CH₃OH far-infrared laser lines that were previously known only by wavelength measurement. Two of these lines turned out to be doublets, bringing the total number of measured lines to six. We can now confirm the assignments of five of them and definitely disprove the assignments proposed for the sixth.In particular we confirm the assignments for the four strong laser lines at 205 and 208 µm pumped by the 9-P(34) CO₂ laser line. These lines share a common upper level in the first excited CO-stretch state, and terminate in the upper and lower levels of a hybrid state with J=5. Heterodyne frequency measurements and conventional microwave spectroscopy show that both lines are split into two components approximately 3.5 MHz apart. The origin of this further splitting is interpreted as a perturbed K-splitting.Work supported by Consiglio Nazionale delle Ricerche -Italia     

Timetabling County Cricket Fixtures Using a Form of Tabu Search

This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.     

The Nature of Community OR

This paper outlines the results of a study undertaken to investigate the nature of Community Operational Research (COR). The objective was to contact the people involved in COR through a series of personal interviews and a questionnaire survey, in order to clarify many of the issues that have emerged within the profession relating to the practice of OR within the community and voluntary sector. A total of 20 individuals were successfully contacted, and they have been responsible for at least two-thirds of the projects in the COR area.