'Hollow from the start'? Professional associations and the professionalisation of tourism

Occupations as diverse as nursing, journalism and marketing have strengthened their claim to professional status and current research suggests that professional associations played a critical part in the process of professionalisation. Following a review of three conceptual approaches to understanding contemporary professionalisation strategies, this paper examines the case of British tourism. It traces the historical development and assesses the current practice of the two main professional associations in the sector. The analysis shows that the ‘professionalisation project’ has largely failed and argues that contemporary frameworks for understanding professionalisation strategies are somewhat deficient when applied to tourism

A triangular thin shell finite element: Linear analysis

The formulation of the linear stiffness matrix for a doubly-curved triangular thin shell element, using a modified potential energy principle, is described. The strain energy component of the potential energy is expressed in terms of displacements and displacement gradients by use of consistent Koiter strain-displacement equations. The element inplane and normal displacement fields are approximated by complete cubic polynomials. The interelement displacement admissibility conditions are met in the global representation by imposition of constraint conditions on the interelement boundaries; the constraints represent the modification of the potential energy. Errors due to the nonzero strains under rigid body motion are shown to be of small importance for practical grid refinements through performance of extensive comparison analyses

Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks

In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is to find a solution that has low complexity and yet performs close to optimal. We propose an algorithm for finding the optimal assignment (which results in the minimum energy consumption) with complexity O(N^2). An approximation algorithm with complexity O(N) is also proposed. It is shown that, for networks with uniformly distributed nodes, the linear-time approximate solution obtained by this algorithm on average performs practically identical to the optimal assignment. Both the optimal and the suboptimal algorithms require the full knowledge of the network topology and are thus centralized. We also propose a distributed algorithm of negligible complexity, i.e., with complexity O(1), which only requires the knowledge of the adjacent neighbors at each wireless node. Our simulations demonstrate that the distributed solution on average performs almost as good as the optimal one for networks with uniformly distributed nodes.Comment: 17 page

A qq-Queens Problem. II. The Square Board

We apply to the $n\times n$ chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I showed that the number of ways to place $q$ identical nonattacking pieces is given by a quasipolynomial function of $n$ of degree $2q$, whose coefficients are (essentially) polynomials in $q$ that depend cyclically on $n$. Here we study the periods of the quasipolynomial and its coefficients, which are bounded by functions, not well understood, of the piece's move directions, and we develop exact formulas for the very highest coefficients. The coefficients of the three highest powers of $n$ do not vary with $n$. On the other hand, we present simple pieces for which the fourth coefficient varies periodically. We develop detailed properties of counting quasipolynomials that will be applied in sequels to partial queens, whose moves are subsets of those of the queen, and the nightrider, whose moves are extended knight's moves. We conclude with the first, though strange, formula for the classical $n$-Queens Problem and with several conjectures and open problems.Comment: 23 pp., 1 figure, submitted. This = second half of 1303.1879v1 with great improvements. V2 has a new proposition, better definitions, and corrected conjectures. V3 has results et al. renumbered to correspond with published version, and expands dictionary's cryptic abbreviation

The NASA Lewis large wind turbine program

The program is directed toward development of the technology for safe, reliable, environmentally acceptable large wind turbines that have the potential to generate a significant amount of electricity at costs competitive with conventional electric generation systems. In addition, these large wind turbines must be fully compatible with electric utility operations and interface requirements. Advances are made by gaining a better understanding of the system design drivers, improvements in the analytical design tools, verification of design methods with operating field data, and the incorporation of new technology and innovative designs. An overview of the program activities is presented and includes results from the first and second generation field machines (Mod-OA, -1, and -2), the design phase of the third generation wind turbine (Mod-5) and the advanced technology projects. Also included is the status of the Department of Interior WTS-4 machine