A trajectory is defined as the record of time-varying spatial phenomenon. The trajectory database is an important research area that has received a lot of interest in the last decade, with the objective of trajectory databases being to extend existing database technology to support the representation and querying of moving objects and their trajectories. Querying in trajectory databases can be ...

Marcet and Marimon (1999) propose a recursive Lagrangian-based method for solving dynamic incentive problems. We show that this method is applicable to a large class of concave contracting problems that encompass many in the literature. This class includes problems with (potentially persistent) private information, non-commitment, differential private and societal discounting and potentially un...

Received (received date) Revised (revised date) Communicated by Christian Lengauer ABSTRACT Programming with parallel skeletons is an attractive framework because it encourages programmers to develop eecient and portable parallel programs. However, extracting parallelism from sequential speciications and constructing eecient parallel programs using the skeletons are still diicult tasks. In this...

This paper discusses analysis of recursive problems. It delves first on their classification, and then the various methods of solving them, depending on which class the recursive relation belongs to. An improvement on the Master Method is then described and used to demonstrate how this method is used to solve recursive relations on Divide & Conquer problems. The revised method is found easier t...

In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of linear equations should be solved. Given the specific form of obtained matrices, rather than sol...

Sensor networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes, with the goal of deceiving the base station or depleting the resources of forwarding nodes. Several research solutions have been recently proposed to detect and drop such for...

This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical  computations in the form of graphs are presented to show the par...

HTN planning is one of the most effective planning methods in AI. However, designing the HTN-decomposition methods is a very difficult task which has been achieved mainly by humans. It would therefore be desirable to design automated learning methods to acquire these decomposition methods from observed action sequences. In this work, we explore how to apply model-based clustering in order to co...

In some cancer clinical studies, researchers have interests to explore the risk factors associated with competing risk outcomes such as recurrence-free survival. We develop a novel recursive partitioning framework on competing risk data for both prognostic and predictive model constructions. We define specific splitting rules, pruning algorithm, and final tree selection algorithm for the compet...