Habitat complexity, spatial interference, and "minimum risk distribution": a framework for population stability

In the past century, the debate over whether or not density-dependent factors regulate populations has generally focused on changes in mean population density, ignoring the spatial variance around the mean as unimportant noise. In an attempt to provide a different framework for understanding population dynamics based on individual fitness, this paper discusses the crucial role of spatial variability itself on the stability of insect populations. The advantages of this method are the following: (1) it is founded on evolutionary principles rather than post hoc assumptions; (2) it erects hypotheses that can be tested; and (3) it links disparate ecological schools, including spatial dynamics, behavioral ecology, preference-performance, and plant apparency into an overall framework. At the core of this framework, habitat complexity governs insect spatial variance. which in turn determines population stability. First, the minimum risk distribution (MRD) is defined as the spatial distribution of individuals that results in the minimum number of premature deaths in a population given the distribution of mortality risk in the habitat (and, therefore, leading to maximized population growth). The greater the divergence of actual spatial patterns of individuals from the MRD, the greater the reduction of population growth and size from high, unstable levels. Then, based on extensive data from 29 populations of the processionary caterpillar, Ochrogaster lunifer, four steps are used to test the effect of habitat interference on population growth rates. (1) The costs (increasing the risk of scramble competition) and benefits (decreasing the risk of inverse density-dependent predation) of egg and larval aggregation are quantified. (2) These costs and benefits, along with the distribution of resources, are used to construct the MRD for each habitat. (3) The MRD is used as a benchmark against which the actual spatial pattern of individuals is compared. The degree of divergence of the actual spatial pattern from the MRD is quantified for each of the 29 habitats. (4) Finally, indices of habitat complexity are used to provide highly accurate predictions of spatial divergence from the MRD, showing that habitat interference reduces population growth rates from high, unstable levels. The reason for the divergence appears to be that high levels of background vegetation (vegetation other than host plants) interfere with female host-searching behavior. This leads to a spatial distribution of egg batches with high mortality risk, and therefore lower population growth. Knowledge of the MRD in other species should be a highly effective means of predicting trends in population dynamics. Species with high divergence between their actual spatial distribution and their MRD may display relatively stable dynamics at low population levels. In contrast, species with low divergence should experience high levels of intragenerational population growth leading to frequent habitat-wide outbreaks and unstable dynamics in the long term. Six hypotheses, erected under the framework of spatial interference, are discussed, and future tests are suggested.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

Complementation analysis of the flavivirus Kunjin NS3 and NS5 proteins defines the minimal regions essential for formation of a replication complex and shows a requirement of NS3 in cis for virus assembly

We have previously reported successful trans-complementation of defective Kunjin virus genomic RNAs with a range of large lethal deletions in the nonstructural genes NSI, NS3, and NS5 (A. A. Khromykh et al., J. Virol. 74:3253-3263, 2000). In this study we have mapped further the minimal region in the NS5 gene essential for efficient trans-complementation of genome-length RNAs in repBHK cells to the first 316 of the 905 codons. To allow amplification and easy detection of complemented defective RNAs with deletions apparently affecting virus assembly, we have developed a dual replicon complementation system. In this system defective replicon RNAs with a deletion(s) in the nonstructural genes also encoded the puromycin resistance gene (PAC gene) and the reporter gene for beta-galactosidase (beta-Gal). Complementation of these defective replicon RNAs in repBHK cells resulted in expression of PAC and beta-Gal which allowed establishment of cell lines stably producing replicating defective RNAs by selection with puromycin and comparison of replication efficiencies of complemented defective RNAs by beta-Gal assay. Using this system we demonstrated that deletions in the C-terminal 434 codons of NS3 (codons 178 to 611) were complemented for RNA replication, while any deletions in the first 178 codons were not. None of the genome-length RNAs containing deletions in NS3 shown to be complementable for RNA replication produced secreted defective viruses during complementation in repBHK cells. In contrast, structural proteins produced from these complemented defective RNAs were able to package helper replicon RNA. The results define minimal regions in the NS3 and NS5 genes essential for the formation of complementable replication complex and show a requirement of NS3 in cis for virus assembly.

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.

Local complexity of Delone sets and crystallinity

This paper characterizes when a Delone set X in R-n is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the heterogeneity of their distribution. For a Delone set X, let N-X (T) count the number of translation-inequivalent patches of radius T in X and let M-X (T) be the minimum radius such that every closed ball of radius M-X(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a gap in the spectrum of possible growth rates between being bounded and having linear growth, and that having sufficiently slow linear growth is equivalent to X being an ideal crystal. Explicitly, for N-X (T), if R is the covering radius of X then either N-X (T) is bounded or N-X (T) greater than or equal to T/2R for all T > 0. The constant 1/2R in this bound is best possible in all dimensions. For M-X(T), either M-X(T) is bounded or M-X(T) greater than or equal to T/3 for all T > 0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has M-X(T) greater than or equal to c(n)T for all T > 0, for a certain constant c(n) which depends on the dimension n of X and is > 1/3 when n > 1.

Young children's performance on the balance scale: The influence of relational complexity

Three experiments investigated the effect of complexity on children's understanding of a beam balance. In nonconflict problems, weights or distances varied, while the other was held constant. In conflict items, both weight and distance varied, and items were of three kinds: weight dominant, distance dominant, or balance (in which neither was dominant). In Experiment 1, 2-year-old children succeeded on nonconflict-weight and nonconflict-distance problems. This result was replicated in Experiment 2, but performance on conflict items did not exceed chance. In Experiment 3, 3- and 4-year-olds succeeded on all except conflict balance problems, while 5- and 6-year-olds succeeded on all problem types. The results were interpreted in terms of relational complexity theory. Children aged 2 to 4 years succeeded on problems that entailed binary relations, but 5- and 6-year-olds also succeeded on problems that entailed ternary relations. Ternary relations tasks from other domains-transitivity and class inclusion-accounted for 93% of the age-related variance in balance scale scores. (C) 2002 Elsevier Science (USA).

A cognitive complexity metric applied to cognitive development

Two experiments tested predictions from a theory in which processing load depends on relational complexity (RC), the number of variables related in a single decision. Tasks from six domains (transitivity, hierarchical classification, class inclusion, cardinality, relative-clause sentence comprehension, and hypothesis testing) were administered to children aged 3-8 years. Complexity analyses indicated that the domains entailed ternary relations (three variables). Simpler binary-relation (two variables) items were included for each domain. Thus RC was manipulated with other factors tightly controlled. Results indicated that (i) ternary-relation items were more difficult than comparable binary-relation items, (ii) the RC manipulation was sensitive to age-related changes, (iii) ternary relations were processed at a median age of 5 years, (iv) cross-task correlations were positive, with all tasks loading on a single factor (RC), (v) RC factor scores accounted for 80% (88%) of age-related variance in fluid intelligence (compositionality of sets), (vi) binary- and ternary-relation items formed separate complexity classes, and (vii) the RC approach to defining cognitive complexity is applicable to different content domains. (C) 2002 Elsevier Science (USA). All rights reserved.

Hand-assisted laparoscopic adrenalectomy: An alternative minimal invasive surgical technique for the adrenal gland

Background: Presently the surgical approach to the adrenal gland is in a state of flux. While the traditional approach to the adrenal gland has been the open transabdominal technique, more recently laparoscopic approaches, particularly via the transabdominal route, have increasingly been utilized. However, laparoscopic intervention for the adrenal gland can be problematic in certain circumstances, particularly for large adrenal masses and in instances of adrenal malignancies. Methods: In this report we describe the use of hand-assisted laparoscopic adrenalectomy as an alternative minimal invasive surgical approach to the adrenal gland. Hand-assisted laparoscopic adrenalectomy using the HandPort system (Smith & Nephew, Sydney, Australia) was undertaken in three patients requiring adrenalectomy for mass lesions including one patient with Conn's syndrome. Results: In all three cases, surgery proceeded promptly and uneventfully. In the present paper, the details of the technique of hand-assisted adrenalectomy are described. This is the first report in the world literature of this new technique for the adrenal gland. Conclusions: Hand-assisted laparoscopic adrenalectomy is an easily performed technique, which can be completed within a short operative time span and which has the advantage of providing intraoperative tactile localization for the adrenal gland. It may be particularly applicable for large adrenal tumours, yet only involves the performance of a small abdominal incision. Postoperative recovery is comparable with that reported for the laparoscopic-only technique. Hand-assisted adrenalectomy is a new technique which has great potential and which warrants further evaluation.

The spectrum of minimal defining sets of some Steiner systems

For a design D, define spec(D) = {\M\ \ M is a minimal defining set of D} to be the spectrum of minimal defining sets of D. In this note we give bounds on the size of an element in spec(D) when D is a Steiner system. We also show that the spectrum of minimal defining sets of the Steiner triple system given by the points and lines of PG(3,2) equals {16,17,18,19,20,21,22}, and point out some open questions concerning the Steiner triple systems associated with PG(n, 2) in general. (C) 2002 Elsevier Science B.V. All rights reserved.

Link invariants associated with gauge equivalent solutions of the Yang-Baxter equation: The one-parameter family of minimal typical representations of Uq[gl(2|1)]

In this paper we investigate the construction of state models for link invariants using representations of the braid group obtained from various gauge choices for a solution of the trigonometric Yang-Baxter equation. Our results show that it is possible to obtain invariants of regular isotopy (as defined by Kauffman) which may not be ambient isotopic. We illustrate our results with explicit computations using solutions of the trigonometric Yang-Baxter equation associated with the one-parameter family of minimal typical representations of the quantum superalgebra U-q,[gl(2/1)]. We have implemented MATHEMATICA code to evaluate the invariants for all prime knots up to 10 crossings.

Independent contribution of plaque complexity to myocardial ischemia during Dobutamine stress echocardiography

The influence of complex plaque morphology on the extent of demand-induced ischemia in unselected patients is not well defined. We sought to investigate the functional significance of lesion morphology in patients who underwent coronary angiography and dobutamine stress echocardiography (DSE).,Angiography and DSE were performed within a 6-month period (mean 1 +/- 1 month) in 196 patients. Angiographic assessments involved quantification of stenosis severity, assessment of the extent of jeopardized myocardium, and categorization of plaque morphology according to the Ambrose classification. DSE was interpreted by separate investigators with respect to wall motion score index (WMSI) and number of coronary territories involved. A general linear model was constructed to assess,the independent contribution of patient characteristics and angiographic and DSE results with respect to extent of ischemic myocardium. Complex lesion morphology was seen in 62 patients (32%). Patients with complex lesions were more likely to have had prior myocardial infarction (p < 0.001) and be current smokers (p = 0.03). During angiography, they exhibited a trend toward a greater number of diseased vessels, had a greater coronary jeopardy score (p < 0.001) and more frequent collateral flow (p = 0.03). During echocardiography, patients had a higher stress WMSI (p < 0.001) and were more likely to show ischemia in all 3 arterial territories (p < 0.01). On multivariate regression, the coronary artery jeopardy score and the presence of complex plaque morphology were independent predictors of the extent of ischemic myocardium (R 2 = 34%, p < 0.001). Thus, patients with complex plaque morphology are older, more likely to smoke, and more likely to have had prior myocardial. infarction. They exhibit more extensive disease with higher coronary jeopardy scores and a higher resting and peak stress WMSI. Despite these differences, complex plaque morphology remains an independent predictor of the extent of ischemia during stress. (C) 2003 by Excerpta Medica, Inc.

Young children's understanding of oddity: reducing complexity by simple oddity and "most different" strategies

Children aged between 3 and 7 years were taught simple and dimension-abstracted oddity discrimination using learning-set training techniques, in which isomorphic problems with varying content were presented with verbal explanation and feedback. Following the training phase, simple oddity (SO), dimension-abstracted oddity with one or two irrelevant dimensions, and non-oddity (NO) tasks were presented (without feedback) to determine the basis of solution. Although dimension-abstracted oddity requires discrimination based on a stimulus that is different from the others, which are all the same as each other on the relevant dimension, this was not the major strategy. The data were more consistent with use of a simple oddity strategy by 3- to 4-year-olds, and a most different strategy by 6- to 7-year-olds. These strategies are interpreted as reducing task complexity. (C) 2002 Elsevier Science Inc. All rights reserved.