This study measures and compares the efficiency of leading tour operator and hotel companies across several Asia Pacific countries. We use an innovative methodology that is based on combining the stochastic frontier and data envelopment analysis in a Bayes framework. We show from the results that Australia, Singapore and South Korea are the most efficient in both their tour operator and hotel i...

An< accurate, stable and very fast corner finder (for feature based vision) has been developed', based on a novel definition of corners, using:no image derivatives. This note describes the algorithm and the results obtained from its use.

In this project we implemented Leak Finder, a tool for examining how Android applications use their granted permissions. Leak Finder instruments Android applications with custom log code, then it collects the logs from actual user application runs and uses these logs to create an execution graph. Auditors can use the executing graph to examine when an applications tends to use its permissions. ...

We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation algorithm with constant bound. The algorithm is based on Christofides' algorithm for the traveling s...

Objective: We studied finder needle use in Internal Jugular Vein (IJV) catheterization and complications rate in adult cardiac surgery. Methods: A prospective study was carried out for 3 month period from august to November 2007 and all patients older than 18 years who underwent elective cardiac surgery were studied. Data were collected about using finder needle, patient position, success rate,...

The problem of existence of closed knight’s tours in [n]d, where [n] = {0, 1, 2, . . . , n− 1}, was recently solved by Erde, Golénia, and Golénia. They raised the same question for a generalised, (a, b) knight, which is allowed to move along any two axes of [n]d by a and b unit lengths respectively. Given an even number a, we show that the [n]d grid admits an (a, 1) knight’s tour for sufficient...

In this paper, we propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arrival/staying time, P-Tour computes the nearly best schedule to visit part of those destinations. In addition to the map-based navigation, P-Tour provides temporal guidance according to the schedule, and automatically mod...

Nowadays more Virtual Environment (VEs) are becoming available on the web. This means that VE are becoming more accessible to a larger and more diverse audience. It also means that the interpretation of VEs and their virtual objects (i.e. how to interact with the virtual environment and the meanings of the associated virtual objects) are more likely to differ from one group of persons to anothe...

The Probabilistic Traveling Salesman Problem (PTSP) is a TSP problem in which each customer has a given probability of requiring a visit. The goal is to find an a priori tour of minimal expected length over all customers, with the strategy of visiting a random subset of customers in the same order as they appear in the a priori tour. We propose an ant based a priori tour construction heuristic,...