Orde Wingate and the Theory behind the Chindit Operations: Some Recent Findings

This short paper discusses some of the theory behind the Chindit operations in Burma of 1943-44, drawing parallels between Wingate's theoretical concepts post 1990s concepts of 'manoeuvre warfare.'

MI(R,)G(R) and British Covert Operations, 1939-42

The Military Intelligence (Research) Department of the British War Office was tasked in 1940 with encouraging and supporting armed resistance in occupied Europe and the Axis-controlled Middle East. The major contention of this paper is that, in doing so, MI(R) performed a key role in British strategy in 1940-42 and in the development of what are now known as covert operations. MI(R) developed an organic, but coherent doctrine for such activity which was influential upon the Special Operations Executive (SOE) and its own sub-branch, G(R), which applied this doctrine in practice in East Africa and the Middle East in 1940-41. It was also here that a number of key figures in the development of covert operations and special forces first cut their teeth, the most notable being Major Generals Colin Gubbins and Orde Wingate.

International construction and Brazilian contractors’ operations

The international construction market is very complex, and requires strong structure and strategy for companies wanting to operate overseas. This article investigates characteristics of international construction. The international operation of Brazilian contractors is explored via results from a qualitative study which was carried out using case studies. The case studies comprised ten big Brazilian contractors, six of which operate abroad. The study identified the patterns of international operation, the competitive advantages of these contractors, as well as the difficulties faced by them in the international construction market. Four of the contractors studied operate only in the domestic market. The study of these cases revealed both obstacles and motivations for future international operations. The study revealed that despite the existing competitive advantages, Brazilian contractors' presence in the international market is limited. The main reason for that is probably their main competitive disadvantage: the lack of financial support from the government.

Memory operations in rapid serial visual presentation

Short-term memory (STM) has often been considered to be a central resource in cognition. This study addresses its role in rapid serial visual presentation (RSVP) tasks tapping into temporal attention-the attentional blink (AB). Various STM operations are tested for their impact on performance and, in particular, on the AB. Memory tasks were found to exert considerable impact on general performance but the size of the AB was more or less immune to manipulations of STM load. Likewise, the AB was unaffected by manipulating the match between items held in STM and targets or temporally close distractors in the RSVP stream. The emerging picture is that STM resources, or their lack, play no role in the AB. Alternative accounts assuming serial consolidation, selection for action, and distractor-induced task-set interference are discussed.

A swarm pattern transformation method based on macroscopic parameter operations

The work reported in this paper is motivated by biomimetic inspiration - the transformation of patterns. The major issue addressed is the development of feasible methods for transformation based on a macroscopic tool. The general requirement for the feasibility of the transformation method is determined by classifying pattern formation approaches an their characteristics. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some robotic agents are introduced. A feasible method for transforming patterns geometrically, based on the macroscopic parameter operation of a swarm is considered. The transformation method is applied to a swarm model which lends itself to the transformation technique. Simulation studies are developed to validate the feasibility of the approach, and do indeed confirm the approach.

Using the web graph to influence application behaviour

The Web's link structure (termed the Web Graph) is a richly connected set of Web pages. Current applications use this graph for indexing and information retrieval purposes. In contrast the relationship between Web Graph and application is reversed by letting the structure of the Web Graph influence the behaviour of an application. Presents a novel Web crawling agent, AlienBot, the output of which is orthogonally coupled to the enemy generation strategy of a computer game. The Web Graph guides AlienBot, causing it to generate a stochastic process. Shows the effectiveness of such unorthodox coupling to both the playability of the game and the heuristics of the Web crawler. In addition, presents the results of the sample of Web pages collected by the crawling process. In particular, shows: how AlienBot was able to identify the power law inherent in the link structure of the Web; that 61.74 per cent of Web pages use some form of scripting technology; that the size of the Web can be estimated at just over 5.2 billion pages; and that less than 7 per cent of Web pages fully comply with some variant of (X)HTML.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.