Flexible working arrangements in context: An empirical investigation through self-organizing maps

This is one of the first studies to utilize Kohonen’s self-organizing maps on flexible work arrangements (FWAs), employee turnover and absenteeism within different national contexts and an array of organizational factors. While the majority of FWAs did not reduce significantly employee turnover or absenteeism, country and industry were significant contextual variables in FWA use: we deciphered six main country regions, where service and manufacturing organizations were important to FWA preferences. We found a curvilinear relationship between turnover and shift-work among manufacturing firms regardless of country: turnover decreases at low levels and increases at high levels of shift-work. We also found strong positive relationships between weekend work and turnover among manufacturing firms regardless of country and firms in the region comprising of Germany, Austria, Sweden, Finland, Denmark, Czech Republic and Belgium. Finally, we found consistently high concentration of organizations with low absenteeism throughout certain industries and countries: noteworthy are service organizations in the Netherlands and manufacturing organizations in Australia. The results demonstrate the contextuality of FWA use across countries and industries, and the usefulness of SOMs for research within human resource management.     

Covariance Decompositions for Accurate Computation in Bayesian Scale-Usage Models

Analyses of multivariate ordinal probit models typically use data augmentation to link the observed (discrete) data to latent (continuous) data via a censoring mechanism defined by a collection of “cutpoints.” Most standard models, for which effective Markov chain Monte Carlo (MCMC) sampling algorithms have been developed, use a separate (and independent) set of cutpoints for each element of the multivariate response. Motivated by the analysis of ratings data, we describe a particular class of multivariate ordinal probit models where it is desirable to use a common set of cutpoints. While this approach is attractive from a data-analytic perspective, we show that the existing efficient MCMC algorithms can no longer be accurately applied. Moreover, we show that attempts to implement these algorithms by numerically approximating required multivariate normal integrals over high-dimensional rectangular regions can result in severely degraded estimates of the posterior distribution. We propose a new data augmentation that is based on a covariance decomposition and that admits a simple and accurate MCMC algorithm. Our data augmentation requires only that univariate normal integrals be evaluated, which can be done quickly and with high accuracy. We provide theoretical results that suggest optimal decompositions within this class of data augmentations, and, based on the theory, recommend default decompositions that we demonstrate work well in practice. This article has supplementary material online.     

A library of local search heuristics for the vehicle routing problem

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allows one to quickly generate solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, straightforward to compile, and is freely available online. The code contains several applications that can be used to generate solutions to the capacitated VRP. Computational results indicate that these applications are able to generate solutions that are within about one percent of the best-known solution on benchmark problems.     

Rotation implementation of a circular cylinder in incompressible flow via staggered grid approach

In this paper, we present a finite difference method for the implementation of the rotation of a circular cylinder in the incompressible flow field by solving the two-dimensional unsteady Navier-Stokes equations. The approach is to use staggered grid method so that the accuracy and order of convergence of the associated algorithms can be maintained. The proposed method is easy to be implemented and is effective. A set of simulations for the flow dynamics is provided to show the computational results.     

Validation of a microsimulation of the Port of Dover

Modelling and simulating the traffic of heavily used but secure environments such as seaports and airports are of increasing importance. Errors made when simulating these environments can have long standing economic, social and environmental implications. This article discusses issues and problems that may arise when designing a simulation strategy. Data for the Port is presented, methods for lightweight vehicle assessment that can be used to calibrate and validate simulations are also discussed along with a diagnosis of overcalibration issues. We show that decisions about where the intelligence lies in a system has important repercussions for the reliability of system statistics. Finally, conclusions are drawn about how microsimulations can be moved forward as a robust planning tool for the 21st century.     

L-functions of twisted Legendre curves

Let K be a global field of char p and let Fq be the algebraic closure of Fp in K. For an elliptic curve E/K with nonconstant j-invariant, the L-function L(T,E/K) is a polynomial in 1+T⋅Z[T]. For any N>1 invertible in K and finite subgroup T⊂E(K) of order N, we compute the mod N reduction of L(T,E/K) and determine an upper-bound for the order of vanishing at 1/q, the so-called analytic rank of E/K. We construct infinite families of curves of rank zero when q is an odd prime power such that for some odd prime ?. Our construction depends upon a construction of infinitely many twin-prime pairs (Λ,Λ−1) in Fq[Λ]×Fq[Λ]. We also construct infinitely many quadratic twists with minimal analytic rank, half of which have rank zero and half have (analytic) rank one. In both cases we bound the analytic rank by letting T≅Z/2⊕Z/2 and studying the mod-4 reduction of L(T,E/K).     

Populations with individual variation in dispersal in heterogeneous environments: Dynamics and competition with simply diffusing populations

We consider a model for a population in a heterogeneous environment, with logistic-type local population dynamics, under the assumption that individuals can switch between two different nonzero rates of diffusion. Such switching behavior has been observed in some natural systems. We study how environmental heterogeneity and the rates of switching and diffusion affect the persistence of the population. The reactiondiffusion systems in the models can be cooperative at some population densities and competitive at others. The results extend our previous work on similar models in homogeneous environments. We also consider competition between two populations that are ecologically identical, but where one population diffuses at a fixed rate and the other switches between two different diffusion rates. The motivation for that is to gain insight into when switching might be advantageous versus diffusing at a fixed rate. This is a variation on the classical results for ecologically identical competitors with differing fixed diffusion rates, where it is well known that "the slower diffuser wins".