Symbolic consumption of tourism destination brands

Electronic word-of-mouth (eWOM) is recognised as a means of interpersonal communication and a powerful marketing tool. However, previous studies have focussed on related motivations, and limited attention has been given to understanding the antecedents of eWOM communication behaviour in the travel industry. This study proposes a full and partial mediation model, which brings together for the first time three key antecedents: adoption of electronic communication technology, consumer dis/satisfaction with travel consumption experience, and subjective norm. The model aims to understand the impact of these antecedents on travellers' attitude towards eWOM communication and intention to use eWOM communication media. The data were collected from international travellers (n = 524), and structural equation modelling is used to test the conceptual framework. The findings of the study suggest that overall attitude towards eWOM communication partially mediates the impact of the traveller's adoption of electronic communication technology and subjective norm, and fully mediates the impact of consumer dis/satisfaction with travel consumption experience on travellers' intention to use eWOM communication media.

Preconditioning 2D integer data for fast convex hull computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.

Evaluation of a bounded high order upwind scheme for 3D incompressible free surface flow computations

fit the context of normalized variable formulation (NVF) of Leonard and total variation diminishing (TVD) constraints of Harten. this paper presents an extension of it previous work by the authors for solving unsteady incompressible flow problems. The main contributions of the paper are threefold. First, it presents the results of the development and implementation of a bounded high order upwind adaptative QUICKEST scheme in the 3D robust code (Freeflow), for the numerical solution of the full incompressible Navier-Stokes equations. Second, it reports numerical simulation results for 1D hock tube problem, 2D impinging jet and 2D/3D broken clam flows. Furthermore, these results are compared with existing analytical and experimental data. And third, it presents the application of the numerical method for solving 3D free surface flow problems. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved,