187,497 research outputs found

    Origins of the commercial hospitality industry : from the fanciful to factual

    Get PDF
    Explores some of the different historical roots of commercial hospitality in three distinct epochs with the intention of promoting further empirical research and beginning an informed debate into the origins and evolution of the contemporary hospitality industry. Reports on empirical research based on texts, artefacts and archaeological evidence. Wherever possible all the primary sources were consulted in the original languages; all translations are the author's own unless otherwise stated. Contrary to established and often fanciful rhetoric, commercial hospitality has at least 4000 years of history in the area of investigation. The rich and incredibly diverse heritage of the hospitality industry is illustrated and the conclusions emphasise that hospitality research should focus on deepening understanding of the industry through empirical research; learning from the past helps to inform the future. The particular focus of this article is restricted to reporting to empirical studies of three epochs: Mesopotamia (c. 2000 BC); Pompeii (79 AD), and Middle Eastern Trade Routes (c. 700 AD onwards). These distinct time periods illustrate the different roots and highlight the need for further research into the evolution of the commercial hospitality industry. The origins of commercial hospitality is an under-researched area in hospitality management and this paper highlights the rich data that is available through disciplined empirical study

    Well-Structured Futures and Cache Locality

    Full text link
    In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel, in an order consistent with their dependencies. A popular and effective way to extend fork-join parallelism is to allow threads to create futures. A thread creates a future to hold the results of a computation, which may or may not be executed in parallel. That result is returned when some thread touches that future, blocking if necessary until the result is ready. Recent research has shown that while futures can, of course, enhance parallelism in a structured way, they can have a deleterious effect on cache locality. In the worst case, futures can incur Ω(PT+tT)\Omega(P T_\infty + t T_\infty) deviations, which implies Ω(CPT+CtT)\Omega(C P T_\infty + C t T_\infty) additional cache misses, where CC is the number of cache lines, PP is the number of processors, tt is the number of touches, and TT_\infty is the \emph{computation span}. Since cache locality has a large impact on software performance on modern multicores, this result is troubling. In this paper, however, we show that if futures are used in a simple, disciplined way, then the situation is much better: if each future is touched only once, either by the thread that created it, or by a thread to which the future has been passed from the thread that created it, then parallel executions with work stealing can incur at most O(CPT2)O(C P T^2_\infty) additional cache misses, a substantial improvement. This structured use of futures is characteristic of many (but not all) parallel applications

    Evidence of authentic achievement: the extent of disciplined enquiry in student teachers' essay scripts

    Get PDF
    The purpose of this study was to describe the extent to which undergraduates engage in disciplined enquiry, as one means of operationalising critical thinking. Three hundred essays from second-year students were judged on the indicators of disciplinary concepts, elaborated written communication and analysis. Non parametric statistical tests revealed that disciplinary concepts were more in evidence than was analysis. This was manifest in written communications which were not, overall, elaborated into coherent essays. The results suggest that students need to appreciate that knowledge is an intentional, and perhaps, effortful construction of the human mind and that this involves the use of a knowledge-transforming strategy rather than the coping strategy of knowledge-telling. For this to happen, however, some current pedagogic practices may need to be revise

    CVXR: An R Package for Disciplined Convex Optimization

    Get PDF
    CVXR is an R package that provides an object-oriented modeling language for convex optimization, similar to CVX, CVXPY, YALMIP, and Convex.jl. It allows the user to formulate convex optimization problems in a natural mathematical syntax rather than the restrictive form required by most solvers. The user specifies an objective and set of constraints by combining constants, variables, and parameters using a library of functions with known mathematical properties. CVXR then applies signed disciplined convex programming (DCP) to verify the problem's convexity. Once verified, the problem is converted into standard conic form using graph implementations and passed to a cone solver such as ECOS or SCS. We demonstrate CVXR's modeling framework with several applications.Comment: 34 pages, 9 figure
    corecore