A DEM is one of the most useful information for spatial modelling and monitoring. Several DEMs have been published in the public domain like SRTM and ASTER GDEM with and without considering the horizontal and vertical misallocation of single input data. Results of that are for example the inherent errors in the ASTER GDEM V1 dataset as well as the known striping in the SRTM dataset. Therefore, ...

We have studied the influence of the peripheral vasodilator hydralazine (HDZ) on the vasculature and blood perfusion of two members of a series of subcutaneous murine adenocarcinomata of the colon (MAC tumours), and the influence of HDZ on the efficacy and/or toxicity of TCNU and melphalan.

The recent merging self-organizing map (MSOM) for unsupervised sequence processing constitutes a fast, intuitive, and powerful unsupervised learning model. In this paper, we investigate its theoretical and practical properties. Particular focus is put on the context established by the self-organizing MSOM, and theoretic results on the representation capabilities and the MSOM training dynamic ar...

This paper examines in detail the proposition that a set of fundamental syntactic relations (domination, sisterhood, c-command, etc) can be founded in the computational operation Merge, itself taken to be fundamental and indispensable. In doing this, it pursues one aspect of minimalist methodology in an unusually rigorous fashion. The outcome of the investigation is that Chomsky’s initial appro...

Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge–sort algorithm emerges indisputably as the most prominent method. In this paper we present a variant of merge–sort that proceeds through arbitrary merges between pairs of quasi-ordered subsequences, no matter w...

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...

Industrial applications of model-driven engineering to develop large and complex systems resulted in an increasing demand for collaboration features. However, use cases such as model differencing and merging have turned out to be a difficult challenge, due to (i) the graphlike nature of models, and (ii) the complexity of certain operations (e.g. hierarchy refactoring) that are common today. In ...

An automatic merge tool was implemented as the centerpiece of branch management in a continuous integration environment. A naming convention and several processes are enforced with Perforce triggers to enable the connection between Perforce and the defect tracking system. The coupling of the “Tofu” branch model with the defect structure allows efficient management of merges and fixes across var...

Data from four merge locations in northern California and Toronto, Canada unveil a notable feature of driver turn taking. We have observed that queued vehicles from the on-ramp and freeway traffic streams enter a congested merge in some (nearly) fixed ratio, independent of the merge outflow. Drivers in competing traffic streams thus enter the merge by adopting some definite turn-taking behavior...

The p-compact-regions problem involves the search for an aggregation of n atomic spatial units into p-compact, contiguous regions. This article reports our efforts in designing a heuristic framework—MERGE (memory-based randomized greedy and edge reassignment) —to solve this problem through phases of dealing, randomized greedy, and edge reassignment. This MERGE heuristic is able to memorize (ME ...