Merging

Abstract After decades from introducing and using agile methodologies, project managers realized that no methodology is sufficient by itself. Thus, merging their principles is the solution yet no formal solution has been proposed. Relying on previous work, ATT ...

In recent years the scale and scope of retailer internationalisation activity has grown markedly, mainly through increasing levels of cross‐border merger and acquisition activity. This has been particularly prevalent among companies operating in the food retail sector. During this time, and within the context of increased merger and acquisition activity in international markets, the financial institutions have taken an increasingly prominent role in the retail internationalisation process. Explores the nature of the financial institutions’ role in the retailer internationalisation process and, specifically, the extent to which the financial institutions actually inhibit and/or promote retail international activity. A key purpose of this study is to examine some of the drivers and inhibitors of the retailer internationalisation process. Reports the findings from 30 in‐depth interviews with food retail analysts of the leading investment banks in the City of London. The findings from t...

Cast shadows cause serious problems in the functionality of vision-based applications, such as video surveillance, traffic monitoring and various other applications. Accurate detection and removal of cast shadows is a challenging task. Common shadow detection techniques ...

Motivated by an application in computational geometry, we consider a novel variant of the problem of efficiently maintaining a forest of dynamic rooted trees. This variant includes an operation that merges two tree paths. In contrast to the standard problem, in which a single operation can only add or delete one arc, one merge can add and delete up to a linear number of arcs. In spite of this, we develop three different methods that need only polylogarithmic time per operation. The first method extends a solution of Farach and Thorup [1998] for the special case of paths. Each merge takes O (log 2 n ) amortized time on an n -node forest and each standard dynamic tree operation takes O (log n ) time; the latter bound is amortized, worst case, or randomized depending on the underlying data structure. For the special case that occurs in the motivating application, in which arbitrary arc deletions (cuts) do not occur, we give a method that takes O (log n ) time per operation, including m...

This Project is been said that, in order to overcome the losses incurred by an associate banks merging/ amalgamation is the right solution. But, bank mergers will really yield a good profit? Public sector banks suffer from bad debt and so many drawbacks so it is said to be privatized. As it is said after privatizing the bank’s only goal may be is to yield high profit and act commercial due to this people (customers) may get affect.

We present an approach to a segmentation of color cartographic images. This is a simultaneous segmentation-recognition-interpretation system when successfully segmented objects of interest (alphanumeric, punctual, linear, and area) are labeled by the system in the same gray-level values, but are different for each type of object. We call it the composite image technique. We exchange the source image for a number of composite image representations. Every composite image representation is associated with certain features. Some of the composite images that contain the objects of interest serve to be used in the following object detection-recognition-interpretation. The specification of features associated with perspective composite representations is regarded as a type of knowledge domain. The results of gray-level color image segmentation are presented.

An overview of development and usage of parallel texts corpora, as well as the author's personal achievements in this field. The necessity of constructing a parallel syntactically annotated corpus of Russian classical literature of the XIX century is declared in the paper. The author presents a method for sentence by sentence aligning of parallel texts, and a method for matching words - phrases within each pair of sentences. An algorithm for parsing Russian sentences is described and the possibility of comparing the dependency tree with the English equivalent is indicated. Also the prospects of the corpus usage for education and linguistic research are proposed.
Keywords: Russian classic literature; translations corpus; parallel texts; automatic alignment; lemmatization; fragmentation; dictionary; syntactic analysis; education.

The detection of frequently occurring patterns, also called motifs, in data streams has been recognized as an important task. To find these motifs, we use an advanced event encoding and pattern discovery algorithm. As a large time series can contain hundreds of motifs, there is a need to support interactive analysis and exploration. In addition, for certain applications, such as