976 resultados para Cube attack


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Includes rare 1816 battle plan map.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A map titled "Plan of Attack of a Iagdkommaudo west of Cantigny on 27 May 1918. There are two sketches and the legend indicates that sketch no. 1 is "Firing until 7A.M." and sketch no. 2 is "Firing after 7A.M."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The source files and full sized renders of the main eHandbook 'cube' (both Photoshop and .png format). Created by David Davies and Dr Matt Jones.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Se presenta el proyecto CUBE, propuesta de trabajo donde se desarrolla una serie de actividades de introducción a la geometría analítica. El proyecto se divide en 2 partes; una relativa al guión de la película y otra derivada dirigida al desarrollo del currículo de cuarto de ESO en Geometría.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An outdoor experiment was conducted to increase understanding of apical leaf necrosis in the presence of pathogen infection. Holcus lanatus seeds and Puccinia coronata spores were collected from two adjacent and otherwise similar habitats with differing long-term N fertilization levels. After inoculation, disease and necrosis dynamics were observed during the plant growing seasons of 2003 and 2006. In both years high nutrient availability resulted in earlier disease onset, a higher pathogen population growth rate, earlier physiological apical leaf necrosis onset and a reduced time between disease onset and apical leaf necrosis onset. Necrosis rate was shown to be independent of nutrient availability. The results showed that in these nutrient-rich habitats H. lanatus plants adopted necrosis mechanisms which wasted more nutrients. There was some indication that these necrosis mechanisms were subject to local selection pressures, but these results were not conclusive. The findings of this study are consistent with apical leaf necrosis being an evolved defence mechanism.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Question: What are the life-history costs for a predatory insect of surviving parasitoid attack, and can parasitoid attack alter predator-prey interactions? Hypotheses: Survivorship is influenced by host age. Hosts that suffer parasitoid attack grow more slowly and consume fewer prey. Those that survive attack are smaller as adults and show reduced survivorship. Organisms: The aphidophagous hoverfly Episyrphus balteatus, its endoparasitoid wasp Diplazon laetatorius and its prey, the pea aphid, Acyrthosiphon pisum. Site of experiments: All experiments were conducted in controlled temperature rooms and chambers in the laboratory. Methods: Episyrphus balteatus larvae of each instar were exposed to attack by Diplazon laetatorius, then dissected to measure the encapsulation response (a measure of immunity). Second instar larvae were either attacked or not attacked by D. laetatorius. Their development rates and numbers of prey consumed were noted. The size and survivorship of surviving (immune) and control hoverflies were compared following eclosion. Conclusions: Successful immune response increased with larval age (first instar 0%, second instar 40%, third instar 100% survival). Second instar larvae that successfully resisted parasitoid attack were larger as pupae (but not as adults) and showed reduced adult survivorship. Female adult survivors were more likely than male survivors to have died within 16 days of eclosion, but there was no difference between unattacked male and female control hoverflies. Attacked larvae, irrespective of immune status, consumed fewer aphids than unattacked individuals. Episyrphus balteatus suffers significant costs of resisting parasitoid attack, and parasitoid attack can reduce the top-down effects of an insect predator, irrespective of whether the host mounts an immune response or not.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The development of new methods for the efficient synthesis of aziridines has been of considerable interest to researchers for more than 60 years, but no single method has yet emerged as uniformly applicable, especially for asymmetric synthesis of chiral aziridines. One method which has been intensely examined and expanded of late involves the nucleophilic addition to imines by anions bearing a-leaving groups; by analogy with the glycidate epoxide synthesis, these processes are often described as "aza-Darzens reactions". This Microreview gives a summary of the area, with a focus on contemporary developments. ((C) Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2009)

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Comparison-based diagnosis is an effective approach to system-level fault diagnosis. Under the Maeng-Malek comparison model (NM* model), Sengupta and Dahbura proposed an O(N-5) diagnosis algorithm for general diagnosable systems with N nodes. Thanks to lower diameter and better graph embedding capability as compared with a hypercube of the same size, the crossed cube has been a promising candidate for interconnection networks. In this paper, we propose a fault diagnosis algorithm tailored for crossed cube connected multicomputer systems under the MM* model. By introducing appropriate data structures, this algorithm runs in O(Nlog(2)(2) N) time, which is linear in the size of the input. As a result, this algorithm is significantly superior to the Sengupta-Dahbura's algorithm when applied to crossed cube systems. (C) 2004 Elsevier B.V. All rights reserved.