ALBERT

Notes: Abstract It is observed that a dynamical continuity equation for biomass distribution yields the asymptotic steady-state exponential dependencen=A exp( $$ - m/\bar m$$ ) exhibited by certain fishery data, wherem is the biomass of an individual,n is the number of individuals per unit biomass interval, andA, $$\bar m$$ are positive constants. This dynamical approach to biomass distribution is an alternative to the global maximization principle proposed recently by Lurié and Wagensberg.

Notes: Abstract Linear birth and death processes are used to derive simple expressions for sequential extinction times and gene fixation probabilities in asexual populations.

Notes: Abstract We are here concerned with the functionf which assigns to each pointP of an object the numberf(P) which is the shortest distance fromP to the border. This function appears in various guises in diverse biological studies. The functionf(P) is itself a measure of shape—or more precisely, an infinite set of measures, one for each point (and hence, in view of its geometric definition, usually in a form inconvenient for use). Thus in this paper we sought a reasonable representative of this infinite set of measures, namely themean of the numbersf(P) asP ranges over all points of the entity. Computability studies are developed for various classes of shapes. For example, (1) the mean for a lamina bounded by a polygon circumscribable about a circle of radiusr isr/3; (2) the mean for a domain bounded by a polyhedron circumscribable about a sphere of radiusr isr/4. The transition from pointwise to piecewisef(P), especially in the non-convex case, requires working with inequalities.

Notes: Abstract A mathematical model for traveling bands of motile and chemotactic bacteria in the presence of cell growth and death is examined. It is found that asymptotic traveling wave solutions exist in the absence of chemotaxis, due to the balance of growth, death and random motility. Thus random motility confers the ecological advantage of population propagation through migration into nutrient-rich regions. The presence of chemotaxis amplifies this advantage by moving more cells into higher nutrient concentration regions, resulting in larger and faster bands. Therefore there seem to be two types of traveling bands that can be attained by chemotactic bacteria in the presence of growth and death: (1) these growth/death/motility bands; and (2) pure chemotactic ‘Keller-Segel'-type bands. Comparison to experimental observations by Chapman in 1973 indicate that the latter seem to be formed. The relationship between these two types of solution is at present uncertain. The growth/death/motility bands may have relevance on longer time or distance scales characteristic of microbial ecological systems.

Notes: Abstract Based on the principle of minimum power, a mathematical model of the pathological functional state of the oxygen transport system is presented. The model is used to determine the optimal functional parameters of the oxygen transport system in hyperthyroidism, anemia and hypertension. Theoretical results are compared with clinical data.

Notes: Abstract A modified SIRS model is developed as a framework for the study of epizootiological dynamics in an insect-pathogen system. Linearized stability analysis reveals that the system with one immune and one susceptible host class can exhibit stable, periodic or unstable behavior depending on model parameters. In general, high pathogenicity, short pathogen propagule lifespan and high host reproductive rate are stabilizing influences. Pathogen transmissibility and propagule production/host do not influence local stability. The effect of seasonal host reproduction is studied because most insect hosts are seasonal in temperate climates. The basic stability dependence on model parameters holds except as modified by the length of the reproduction interval. The results of this study are compared with the recent work of Anderson and May.

Notes: Abstract The random predator-prey type interactions of the population species in a random varying environment have been investigated. The Fokker-Planck equation for the transition probability, corresponding to the stochastic differential equations established from Lotka-Volterra equations by the introduction of randomness and variability, has been integrated in the form of a path integral. The transition probabilities for extinction or survival of one or several species have been approximately evaluated and investigated.

Notes: Abstract If two microbial populations compete for a single resource in a homogeneous environment with time invariant inputs they cannot coexist indefinitely if the resource competed for is not renewed by biological activity within the system. Mathematical studies have shown that in a predator-prey system, where the resource (prey) is self-renewing, the two competitors (predators) can coexist in a limit cycle. This suggests that if the resource competed for is renewed by biological activity within the system coexistence can occur in any microbial system provided that it exhibits the same features as, but without being, a predator-prey one. A food chain involving commensalism, competition and amensalism is presented here. Two subcases are considered. It is only when maintenance effects are taken into account that coexistence, in limit cycles, can occur for this system. Limit cycle solutions for the system are demonstrated with the help of computer simulations. Some necessary conditions for coexistence are presented, as are some speculations regarding the possible physical explanations of the results.

Notes: Abstract The branching structure of the mammalian arterial tree has been known to be close to that of an optimal conduit system of the minimum work model characterized as the branch system of constant wall shear rate. The physiological mechanism producing such construction was considered to be based on the local response of arterial caliber induced by the wall shear stress (shear rate × blood viscosity) and thereby maintaining this stress constant, which was previously observed at the canine common carotid artery shunted to the external jugular vein. The stress levels at various parts of the arterial system estimated from available data fell within ±50% of the mean (15 dyn/cm2), which was consistent with the value predicted from the model. Theoretical analyses on the cost function of the model indicated that the suspected variation of shear rate levels in the arterial tree due to the anomalous changes in blood viscosity which might bring about 3- to 4-fold differences between the minimum and maximum shear rates would cause less than 10% increase in the total energy cost. It was concluded that a local adaptive response to wall shear stress is the mechanism which effectively optimizes the design of the arterial tree.

Notes: Abstract The structure of the genetic code is related to a Gray code, which is a plausible theoretical model for an amino acid code. The proposed model implies that the most important factor in shaping the code was the effects of mistakes in translation, not effects of mutations. Another possible implication is that the preservation of stiffness and flexibility at appropriate places in a protein chain is as important in protein structure as the appropriate placement of hydrophilic (external) and hydrophobic (internal) residues. Other results are a simple conceptualization of the relationships among the 20 amino acids and their relations to their codons. The detailed relationships are summarized in the following ‘similarity alphabet’: ala, thr, gly, pro, ser; asp, asn, glu, gln, lys; his, arg, trp, tyr, phe; leu, met, ile, val, cys; (ATGPS DNEQK HRWYF LMIVC in the one-letter code). This alphabet falls into four groups of amino acids: small, external, large, internal. The approximate relation of the groups to their codons is expressed as: the first base of a codon controls size—a purine means a small amino acid, a pyrimidine means large; the middle base controls cloisterednes—purine means external, pyrimidine means internal. These relationships express the minimum change principle upon which the code appears to be founded.

Notes: Abstract A theoretical study of the Brusselator model with non-uniform distribution of component A and a concentration-dependent diffusion coefficient has been performed. Numerical simulation reveals that a variable diffusion coefficient alters the bifurcation pattern and the stability properties of the steady-state as well as periodic solutions. A simple approximate method, based on one-point collocation, has been proposed to analyze the bifurcation phenomena for the case of fixed boundary conditions and low system size.

Notes: Abstract In this paper the effects of the occurrence of cut trees in the topological analysis of branching patterns have been studied. It is assumed that branches are removed at random from the trees. We prove that, for both the segmental and terminal growth models, the probability distributions of the cut trees are identical to those of complete trees.

Notes: Abstract The goal of this work is an examination of capillary exchange models as mathematical operators. The concentration function relations for the Krogh cylinder of a single capillary, basic to many organ models, are studied via the theory of operators on the Lebesgue normed spacesL p[0,∞], (1〈-p〈-∞). A discussion is included of theL p -normsvis-à-vis the coefficient of variation currently used in finding capillary parameters and evaluating parameter searches. The capillary model determines two operators on the space of locally integrable functions: O K (relating extravascular concentration to intravascular) and K a, k (relating intravascular concentration to input), wherek is the ratio of permeabilitysurface area (PS) to extravascular volume, and α is the ratio of PS to flow. These operators are shown to induce contractive (‖O K ‖ p 〈-1, ‖K a, k ‖ p 〈-1), isotone, linear operators onL p . The uniform convergence relation $$K_{a,k} = \mathop {\lim _{(p)} }\limits_{N \to \infty } \left( {\sum\limits_{n = 0}^N {P_n (a)O_k^n } } \right)$$ (as operators onL p) is derived, whereP n (a) is the Poisson probabilitye −a a n /n!. For the important special cases ofp=∞, 1, 2 the norms are found (‖Ok‖=‖Ka,k‖p=1). Consideration is also given to the norms and operators when the functions involved are limited to a finite interval of time.

Notes: Abstract One particular kind of structure offers possible explanations, for long-term memory, efficient consolidation of stored information from the environment, clustering of data strings and multimodal functioning. It is a possible model for pieces of neural structure and its use offers a uniform method for both studying and constructing an extensive class of mechanisms.

Notes: Abstract Levenshtein dissimilarity measures are used to compare sequences in application areas including coding theory, computer science and macromolecular biology. In general, they measure sequence dissimilarity by the length of a shortest weighted sequence of insertions, deletions and substitutions required, to transform one sequence into another. Those Levenshtein dissimilarity measures based on insertions and deletions are analyzed by a model involving valuations on a partially ordered set. The model reveals structural relationships among poset, valuation and dissimilarity measure. As a consequence, certain Levenshtein dissimilarity measures are shown to be metrics characterized by betweenness properties and computable in terms of well-known measures of sequence similarity.

Notes: Abstract It is pointed out that the methane flux measured experimentally for certain ponds and swamps is quantitatively consistent with a commensal dependence of Methanobacteria on O2-chemotactic motile aerobic bacteria. The Methano species is thereby shielded from oxygen and provided with carbon dioxide for the anaerobic production of methane.

Notes: Abstract A sufficient condition is given for stochastic boundedness persistence of a top predator in generalized Lotka-Volterra-type stochastic food web models in arbitrary bounded regions of state space. The main result indicates that persistence in the corresponding deterministic system is preserved in the stochastic system if the intensities of the random fluctuations are not too large.

Notes: Abstract One of Bobisud's models for the evolution of cannibalism is reanalyzed by applying the method of finding evolutionarily stable strategies (or ESS's). It is demonstrated that ‘no cannibalism’ never will be an ESS if the initial rate of cannibalism is too large. It is further demonstrated that individual selection may even result in the evolution of cannibalism during food abundance. Some empirical case studies are briefly discussed in relation to this model.

Notes: Abstract A computer algorithm is presented which equiprobably generates any member of the set of all directed trees withk labeled terminal nodes and unlabeled interior nodes. The algorithm requires roughlyk 2 /2 storage locations. The one-time initialization requiresO(k 2 ) time, while generating each tree requiresO(k) time.

Notes: Abstract The comparison of several sequences is central to many problems of molecular biology. Finding consensus patterns that define genetic control regions or that determine structural or functional themes are examples of these problems. Previously proposed methods, such as dynamic programming, are not adequate for solving problems of realistic size. This paper gives a new and practical solution for finding unknown patterns that occur imperfectly above a preset frequency. Algorithms for finding the patterns are given as well as estimates of statistical significance.

Notes: Abstract A new development is introduced here in the use of dynamic programming in finding pattern similarities in genetic sequences, as was first done by Needleman and Wunsch (1969). A condition of pattern similarity is defined and an algorithm is given which scans any set of similarities and screens out those which fail to meet the condition. When the set to be scanned contains every pair of segments, one from each of two given sequences of lengthsm andn (i.e. every possible location for a pattern similarity), then it completes the scan in a number of computational steps proportional tom·n, leaving those pairs of segments which satisfy the similarity condition. The algorithm is based on the concept of match density, as suggested by Goad and Kanehisa (1982).

Notes: Abstract This paper concerns sequences of letters in which certain “distinguished” words are of interest. Such sequences arise as data in numerous fields including genetics and neuroscience. A probability distribution is given for the number of occurrences of a chosen word in a randomized sequence of letters. Such words are considered “favored” if they occur more than expected at random. Favored words have been discovered in nerve impulse trains and may reflect a neural coding scheme.

Notes: Abstract As the volume of protein sequence data grows, rapid methods for searching the protein sequence database become of primary importance. Rigorous comparison of sequences is obtained with the well-known dynamic programming algorithms. However, these algorithms are not rapid enough to use for routinely searching the entire database. In this paper we discuss some methods that can be used for rapid searches.

Notes: Abstract We give algorithms for computing the extent of similarity between two or three sequences of letters. The similarity measures we consider include a penalty for inserting gaps within the sequence in order to enhance similarity. The magnitude of the penalty for gaps is assumed to be independent of their size in order to accommodate certain biological applications. Our algorithm for three sequence comparisons, which is based on solving a system of recursive equations, improves upon the efficiency of existing methods. Although the system of recursive equations utilized by the algorithm is quite complicated as it stands, it has none the less been simplified by appeal to combinatorial considerations.

Notes: Abstract Well-known dynamic programming algorithms exist for comparing two finite sequences inO(N 2) time and storage, whereN is the common sequence length. Extensions to the comparison ofM finite sequences requireO((2N) M) time and storage, making such algorithms difficult even forM=3. A simple generalization of the sequences makes it possible to obtain some results about the geometry of sequence alignments. These ideas suggest heuristic approaches to problems of comparing several sequences. IfM sequences are known to be related by a binary tree, they can be aligned inO(MN 2) time andO(N 2+NM) storage.

Notes: Abstract Protein sequences of the Dayhoff databank of 1984 have been analyzed to evaluate the occurrences of the 400 dipeptides and 8000 tripeptides. Expected values and standard deviations for the di- and tripeptides were determined by Monte Carlo and binomial approximation. A condensed format containing this information, labeled a uniqueness diagram, is presented and made available in the form of a microfiche.

Notes: Abstract In two-state sliding filament models of muscle contraction a partial differential equation must be solved to find the cross-bridge distribution functionn(x, t). In this paper the analytical form of this function is obtained by integration along the characteristic line and special cases are presented in which the explicit expression forn(x, t) can be completely determined. These analytical solutions provide a direct mathematical connection between the microscopic contraction parameters contained in the kinetic theories and macroscopic muscle dynamics and are thus used to investigate what parameters influence the transient contractile tension in typical experimental conditions. The results of this investigation are consistent with relevant aspects of muscle physiology.

Notes: Abstract Experiments on random binary, ternary, etc. (P=2, 3,…, 10) switching nets are reported. Behavioral cycle lengths are examined as functions of output variety,P, input connectance,K, and net size,N. Overall, output variety appears an influential, well-behaved net property. Strong, but well-behaved interactions appear among net variables. In high connectance nets, median cycle length grows approx. asP N/2. Other factors constant, one-connected nets show the shortest cycles, and connectance effects appear to converge asymptotically aroundN. Data for cycle length as a function of net size suggest a concavity not compatible with the Kauffman “square root law” (Kauffman, 1969). Evidence of a positive relationship between cycle length and run-in length is found in two-input nets; weaker evidence is obtained that in higher connectance nets this relationship becomes negative in sign. The “modular complexity” ofP〉2 nets is examined briefly.

Notes: Abstract The influence of topographical situation on the spread of infection is studied. The investigation is based on a multigroup model. The population under consideration is thought to be divided into subpopulations living in regions that are separated from each other by natural barriers (mountains). Infection is carried from one region to another by migrating infectives. Migration is possible only along the river system so that the structure of the epidemiological network is that of a symmetric tree. The results allow comparison of the velocity of propagation of the epidemic for different geographical situations and allow quantification of the “channel-effect”, according to which mountainous regions are channels rather than barriers to the spread of an epidemic.

Notes: Abstract Pipeline techniques have been successfully applied to speeding up processing in both general- and special-purpose digital computers. Application of these techniques to nonrecursive (FIR) filters has been suggested and is quite straightforward. Application to recursive (IIR) filters has not previously been shown. In this paper, the technique for applying pipeline techniques to recursive filters is shown and the advantages and disadvantages of the technique are discussed. Using these techniques, recursive digital filters operating at hitherto impossibly high rates can be designed.

Notes: Abstract The long-standing problem of reconstructing a function from its samples is considered again. Assuming a sequence of oversampled values, a set of appropriate idealized reconstruction filters can be defined, which do not suffer from instability or slow convergence. The realization — a cascade of a nonrecursive digital filter, D/A-converter, and a fixed/analog smoothing filter — demands the design of the digital filter for the increase of the sampling rate. The design of this nonrecursive filter is the purpose of this paper. Approximations in the frequency as well as in the time domain are presented.

Notes: Abstract In this paper we formulate power systems as nonlinear nearly Hamiltonian systems. Using the invariance principle for ordinary differential equations, necessary and sufficient conditions for asymptotic stability are established and a new method of estimating the domain of attraction of the stable equilibrium point is developed. The present results constitute a novel approach to stability analysis and involve the following three steps: a. Given a system with dissipation, the stability of its equilibrium is ascertained by determining the stability of the associated conservative system. b. Attractivity of the stable equilibrium of the entire system (with dissipation) is determined from the system topology. c. An estimate of the domain of attraction of the asymptotically stable equilibrium is obtained by making use of results obtained in (a) and (b). The stability criterion developed in this paper sheds new light on the mechanism of instability in power systems and it provides analytical verification to the concept of the potential-energy boundary surface (PEBS). The PEBS is a hypersurface which makes up a part of the boundary of the domain of attraction of the stable equilibrium in a power system. The existence and properties of the PEBS have thus far been deduced primarily via simulations and heuristic methods.

Notes: Abstract In conventional television systems, picture scanning in vertical and temporal directions is usually very defective with regard to the sampling theorem. In this paper some deficiencies such as aliasing, line-structure distortion, line flickering, and large-area flickering are investigated with regard to their dependence on the inter-lacedpicture-scanning process. The three-dimensional reconstruction filtering of the sampled picture is especially analyzed with respect of the viewer's perception. Furthermore, it will be shown that in connection with a new concept of picture scanning published earlier [1], [2], a flat-field reproduction without any 25/30-Hz flicker can be achieved by vertical filtering only. This is true even though the final reproduction by the monitor is performed with interlace. The vertical filtering can then be optimized in the sense of maximum picture sharpness and resolution with negligible ringing as well. Practical results are given in this paper.

Notes: Abstract In this paper a new type of “velocity-selecting/rejecting filter” which passes or stops a particular event in a seismic signal is proposed. The velocity-selecting filter is based on a time-space band-pass filter with sharp passband for a particular direction, and similarly, the velocity-rejecting filter is based on a time-space band-stop filter. A technique for designing such filters, in terms of an infinite-impulse-response (IIR) filter, is presented, in which a rotated version of separable filter is used. Finally, numerical examples are included to illustrate the design theory.

Notes: Abstract A special type of factorization for operators defined on partially ordered Hilbert resolution spaces is considered. The main result includes, as a particular case, the classical Schur-Coleski triangular factorization. Connections with stochastic optimization and image-processing problems are established.

Notes: Abstract In a recent paper on nonlocal expansions necessary and sufficient conditions are given under whichf −1 has a generalized power series expansion, whenf is an invertible locally Lipschitz map between certain general subsets of a complex Banach space. Here we establish the validity of a conceptually interesting algorithm for obtaining the expansion. Basically, we show that a certain contraction mapping iteration generates iteratesℐ 1,ℐ 2,... such that eachℐ k yields all of the terms of the generalized power series expansion off −1 up to order (k + 1), assuming merely that the expansion off −1 exists. An earlier different result along related lines is mentioned.

Notes: Abstract The representation of functions in a basis function expansionz(t)= ∑k=1/∞=,a k〉 x k (t) is straightforward when the basis functionsx k (t) are orthogonal. There has been very little work up to this time in determining how to use nonorthogonal bases in signal representation. On the other hand, applications in data compression and signal synthesis often require using specific tailor-made bases. Presented here is a method for constructing very general nonorthogonal bases. Orthogonality has often been used to show that a basis spans the set of functions of interest and to calculate the coefficients of the representation. In this paper, both of these fundamental aspects are addressed for nonorthogonal bases. A new basis {y k (t)} is obtained by performing a linear transformation on a known existing basis {x k (t)}. This transformation is constructed such that the coefficients of signal representation on the new basis are readily found. Then, a useful and sufficient condition is placed upon the new basis such that representations converge. The fundamental methods are applied to the standard examples of signal representation. The complex sinusoids, the Rademacher functions, the orthogonal polynomials, and the decaying exponentials are used as the original basis {x k (t)} from which a new basis {y k (t)} is generated. Two examples are given to illustrate general applications: one in signal synthesis and one in signal analysis.

Notes: Abstract The temperature regulation in homothermic animals is an example of a negative feedback system. It shows sudden changes of parameter values, and therefore suggests the use of catastrophe theory for its description. This paper reports on work done on the human temperature regulation mechanism to shows that the five-dimensional dual butterfly catastrophe model is sufficient for its description. Nearly all experiments reported in the literature overlook the dynamic multiparametric nature of the process. Use of catastrophe theory, on the other hand, shows that one cannot find a model with fewer than five parameters for such a system. From work by Benzinger and Kitzinger, the exact shape of part of the corresponding bifurcation set is determined.

Notes: Abstract This paper is an analytical study on the pulse wave velocities in the aorta. In conformity to a physiologic state of loading, the distensibility of the vessel wall has been accounted for. The wall material is treated by using the theory of large elastic deformations. The orthotropicity of wall tissues and the effect of the surrounding tissues have been incorporated in the analysis which is based on the use of the strain energy function suggested by Vaishnavet al. Numerical values of the wave velocities of the canine middle descending thoracic aorta are computed by using the derived analytical expressions.

Notes: Abstract The theory of a symmetrical 3-barrier, 4-site, single-filing ionic channel is developed. The model goes beyond earlier models by including additional sites, as well as barriers which need not be symmetrical in the applied field, and contains the earlier models as special cases. It is itself a special case of the most general 4-site model, which has 5 barriers. By considering the barriers at the mouth and middle of the channel to be sufficiently larger than the barriers separating the sites in each channel half, these barriers can be neglected; thus this case reduces to a 3-barrier model where the sites in each channel half can then be assumed to be in equilibrium with each other. The alternative 3-barrier, 4-site case, where the barrier between the sites is considered to be larger than that at the mouth of the channel, is considered elsewhere. Pure cation permeation is considered and only single-salt properties of the system are analyzed, namely occupancy, conductance, flux ratio exponent and current-voltage relation. The concentration dependences of these properties are computed and interrelated and, where possible, also given in analytical form. The mathematical relations are obtained for a channel which is symmetrical around its middle, which is the appropriate assumption for the gramicidin channel. However, the barriers themselves are allowed to be asymmetric with respect to the potential dependence, which has been found to be essential for gramicidin. Mathematically, a straight-forward matrix formulation is used; but a general theoretical method is presented for reducing a complex model (with more than 2 sites) to a simpler cases when equilibrium exists across one or several barriers, as is often the cases. This method is a prototype which makes analytical solutions of complex barrier models possible in many cases.

Notes: Abstract A chain-like arrangement of four urns (a catenary system) into which different color balls (white, corresponding to radio atoms, and black, corresponding to stable atoms) are being transferred is used to simulate the transport of atoms down the GI tract of man and animals. Into the first urn (stomach) are placedw o white balls andr black balls while in the 2nd (small intestines) and 3rd (large intestines) urn, onlyr blacks are put in, with no whites. A sample of sizer is transferred from the 1st, 2nd and 3rd urns to the 2nd, 3rd and 4th (infinite universe) urns. From the random variable difference equations the first and second moments for the distribution of the number of radio atoms present in each urn are obtained. The variance of the contents of radioatoms in the excretion urn is

Notes: Abstract A power series solution is presented which describes the steady-state concentration profiles for substrate and product molecules in immobilized enzyme systems. Diffusional effects and product inhibition are incorporated into this model. The kinetic consequences of diffusion limitation and product inhibition for immobilized enzymes are discussed and are compared to kinetic behavior characteristic of other types of effects, such as substrate inhibition and substrate activation.

Notes: Abstract The use of spheroids as a tumor model has become commonplace since it was discovered that many cell lines can form spheroids when grown on a surface to which the cells cannot attach. This culture system complicates experiments which depend on oxygen supply because the oxygen concentration in the vicinity of a stationary spheroid has not been well defined. We present in this paper solutions to the oxygen diffusion equation for simple geometries: a spheroid in an infinite stationary medium and in a finite spherical stationary medium. Comparison of these solutions provides an estimate of the oxygen supply to a spheroid in a Petri dish. We show that typical spheroids can be expected to cause a substantial depletion of the oxygen in the nearby medium. Any disturbance of the medium or the spheroids will temporarily increase the oxygen supply. We provide a method for estimating the rate of return to equilibrium in the finite cases. These results indicate that the oxygen supply to stationary spheroids can be altered temporarily by small movements or changes in temperature which cause convection currents, or permanently by changes in the depth of the medium.

Notes: Abstract Alternative sufficient conditions are derived that guarantee the stability of spatially heterogenous steady-state distributions of motile aerobic bacterial populations attracted chemotactically by oxygen, motile anaerobic populations repelled by oxygen, and the oxygen concentration itself through a stationary aqueous medium. In particular, it follows from the latter criteria that the heterogeneous steady-state distributions for cylindrical regions with arbitrary cross-sections, uniform depth and mixed Dirichlet-Neumann boundary conditions on the oxygen concentration (appropriate to certain still-water bodies in nature) are stable with respect to arbitrary perturbations in the bacteria cell and the oxygen distributions.

Notes: Abstract Closed positive feedback loops of catalytic reactions between macromolecules, or hypercycles, provide a kinetic mechanism whereby each Species serves to catalyze selfreproduction of its successor in the loop. Hypercycles of five members or more evolve into limit cycles characteristic of a biochemical clock. Computer study of the coupled non-linear differential equations which describe these systems shows that the periodT n of then-species limit cycle is given byT n=nτn, where τn is an elemental repeat period reflecting translational time invariance. Analytic solutions of the equations are developed so that the time evolution of elementaryn-hypercycles can be traced in dynamical detail. It is shown that the magnitude of τn is, to good approximation, a linear function ofn. For a givenn, τn is a very sensitive function of the relative concentration a given member of the loop has at the time its predecessor dominates the state of the hypercycle. These concentrations decrease with increasingn. Aroundn=15 they become so small that elementary hypercycles become unstable against disruptive concentration fluctuations. Species concentrations for more realistic hypercycles tend not to be as small, so that the present estimate of a maximum number of components is a lower bound.

Notes: Abstract The technique of the probability generating function is used to derive the stochastic differential equations for a nonlinear model based on Eigen and Schuster's theory of biomolecular selection and evolution. The stabilities of various steady states are analyzed by using the linear stability approximation. The instability of a small starting population is investigated numerically. The minimum starting populations required for steady-state survival are then estimated for a wide range of parameters.

Notes: Abstract Some morphological features of the human bronchial tree were simulated by computergenerated trees. The trees were ordered by the methods of Horsfield and Strahler. Delta, the difference between the Horsfield orders of the two branches at a bifurcation, was determined by pseudorandom numbers generated according to a distribution of probabilities defined on input. By trial and error a distribution was found which resulted in trees being generated with average Strahler order branching ratios of 2.82, similar to a real bronchial tree. Branching angles and length ratio could also be defined on input. By varying these input parameters it was found that the form of the tree was quite sensitive to them, and that by a suitable choice the intrasegmental part of the bronchial tree could be simulated. It is concluded that branching ratio, length ratio, mean branching angles and distribution of delta are controlled within tight limits in the bronchial tree, and this may support the concept of optimal design.

Notes: Abstract In this paper perturbation methods are used for the mathematical analysis of coupled relaxation oscillators. This study covers entrainment by an external periodic stimulus as well as mutual entrainment of coupled oscillators with different limit cycles. The oscillators are of a type one meets in the modeling of biological oscillators by chemical reactions and electronic circuits. Special attention is given to entrainment different from 1∶1. The results relate to phenomena occurring in physiological experiments, such as the periodic stimulation of neural and cardiac cells, and in the non-regular functioning of organs and organisms, such as the AV-block in the heart.

Notes: Abstract A new, more realistic model of the action of ionizing radiation on mammalian cells growingin vitro is presented. Although this model requires a large number of parameters, these are linked to biologically observable quantities rather than being abstract sensitivities, as had previously been the case. Three different stochastic processes are required: {X(t);t ∈ [0, τ]}, representing damage alterations during irradiation; {(X(t), S(t));t ∈ [τ, τ+T D]}, representing changes in both damageX(t) and cell cycle positionS(t) during the post-irradiation cell cycle; and {N x(t);t ∈ [0,T G]}, representing the subsequent colony growth process conditioned on the value ofX(τ+T D). The assumptions used to define these processes extend a previous model of short term DNA damage formation and repair (Nelson S. J. 1982,Radiat. Res. 92, 120–145) to include the influence of cell cycle progression on damage in the irradiated cell and the effect of permanent inherited damage on the daughter cells' colony growth pattern. Expressions corresponding to commonly measured radiation effects are derived from the model and compared with predictions from previous models. It is found that these previous models oversimplified the mechanism of radiation action because they did not adequately represent repair during irradiation, the influence of radiation-induced cycle delays and damage inheritance by any daughter cells. Suggestions are then made for ways in which the new model can be used to test the importance of these effects.

Notes: Abstract A stochastic approach is utilized to develop a model equation capable of describing the time course of germination in a sample of bacterial spores. The time required by a spore to complete the change characteristic of germination consists of an initial interval of no change followed immediately by the duration of the change itself. The experimental basis of the proposed model is the observation that each of these time intervals is distributed over a range of values in a spore sample. Mixed continuous and discrete probabilities are employed in arriving at an average single-spore germination curve which, to a different scale, describes the sample in time.

Notes: Abstract Mathematical methods for comparison of nucleic acid sequences are reviewed. There are two major methods of sequence comparison: dynamic programming and a method referred to here as the regions method. The problem types discussed are comparison of two sequences, location of long matching segments, efficient database searches and comparison of several sequences.

Notes: Abstract An algorithm for nucleic acid and protein sequence alignment is presented. It is a non-metric local similarity minimal-difference algorithm and in the current implementation, assembles the matching regions found into a pseudo-global format. Its strengths are its speed of execution and the especially convenient presentation of its output. The algorithm is intended for use in sequence melding and local (small-region) similarity searching. It is not designed to replace a metric Needleman-Wunsch-Sellers-type similarity algorithm. The program is written in FORTRAN and is designed to be easily transportable to a variety of computer systems.

Notes: Abstract This is a review of past and present attempts to predict the secondary structure of ribonucleic acids (RNAs) through mathematical and computer methods. Related areas covering classification, enumeration and graphical representations of structures are also covered. Various general prediction techniques are discussed, especially the use of thermodynamic criteria to construct an optimal structure. The emphasis in this approach is on the use of dynamic programming algorithms to minimize free energy. One such algorithm is introduced which comprises existing ones as special cases.

Notes: Abstract It is shown that the concepts of grammar complexity and syntactic structure provide a useful mathematical framework for the investigation of some current problems in protein structure. Grammar complexity gives a measure of the degree of aperiodicity of a sequence and also an optimization criterion for evaluating amino acid categorizations. Three systems of amino acid categorization are compared in relation to their value for describing molecular architecture.

Notes: Abstract A scheme for representing amino acids as vectors in the plane is presented and justified. The two dimensions of the plane are size and hydrophobicity. The vector representation is then applied to generate a consensus sequence for some sets of homologous proteins. A figure of merit for the degree of homology of a set of sequences results from the analysis. Some other applications of the scheme are considered also. This work grew from ideaseeds planted by Margaret Dayhoff's work in theAtlas of Protein Structure and Sequence. It is with gratitude that I dedicate this paper to her memory.

Notes: Abstract An annotated bibliography of mathematical and computer analyses of protein and nucleic acid sequences is presented. The major subject areas represented are the determination of sequences, restriction mapping, similarity searching, sequence alignment, codon utilization, statistical analysis, information theoretic analysis, the construction of secondary and tertiary structure and DNA topology.

Notes: Abstract DISGEO is a new implementation of a distance geometry algorithm which has been specialized for the calculation of macromolecular conformation from distance measurements obtained by two-dimensional nuclear Overhauser enhancement spectroscopy. The improvements include (1) a decomposition of the complete embedding process into two successive, more tractable calculations by the use of “substructures”, (2) a compact data structure for storing incomplete distance information on a structure, (3) a more efficient shortest-path algorithm for computing the triangle inequality limits on all distances from this information, (4) a new algorithm for selecting random metric spaces from within these limits, (5) the use of chirality constraints to obtain good covalent geometry without the use ofad hoc weights or excessive optimization. The utility of the resultant program with nuclear magnetic resonance data is demonstrated by embedding complete spatial structures for the protein basic pancreatic trypsin inhibitor vs all 508 intramolecular, interresidue proton-proton contacts shorter than 4.0 Å that were present in its crystal structure. The crystal structure could be reproduced from this data set to within 1.3 Å minimum root mean square coordinate difference between the backbone atoms. We conclude that the information potentially available from nuclear magnetic resonance experiments in solution is sufficient to define the spatial structure of small proteins.

Notes: Abstract Recent evidence suggests that the cyclic nucleotides play a central role in the intracellular processing of neural signals. The dynamics of this system may be seen as a realization of the enzymatic neuron model. Enzymatic neurons are formal neurons which map binary afferent signals into patterns of excitation across an abstract membrane. The distribution of enzyme-like elements called excitases enables a set of local threshold functions to determine the firing activity of the neuron. This paper analyzes the basic properties of enzymatic neurons in a simple continuous-time framework, and shows how they may be presented as reaction-diffusion networks which model the cyclic nucleotide system. We present the results of computer simulations of this neuron and discuss its implications for selectional learning and its relation to conventional two-factor systems. One fundamental property of the reaction-diffusion neuron is its so-called “double-dynamics” property; examination of this property and its contribution to the computing power of the neuron provides some insight into the obscure relation between microscopic and macroscopic models of computation.

Notes: Abstract A model for enzymic catalysis is presented using the mathematical theories of differential geometry and Stieltjes integration. The Stieltjesintegrator is a complex-valued function of bounded variation which represents the curvature and torsion, hence the conformation, of the backbone of an enzyme molecule. Theintegrand is a complex-valued continuous function which describes the shape of the surface of a substrate molecule. We postulate that enzyme-substrate interactions correspond to evaluations of Stieltjes integrals, and that observables of enzymic catalysis correspond to projections. Results from the mathematical theory of the Stieltjes integral are discussed together with their biological interpretations. We contrast the difference between structural and functional proteins, and construct analogues of enzyme cofactors, modifications, and regulation. Various techniques of locating the active site on enzymes are also given. We construct a total variation metric, which is particularly useful for detecting similarities among proteins. An examination on the many different modes of convergence of mathematical functions representing biological molecules leads to a mathematical statement of the fundamental dogma of molecular biology, that ‘structure implies function’. Similar arguments also result in the converse statement ‘function dictates structure’, which is a basic premise of relational biology. Stepped-helical approximations of the backbone space curves of enzymes provide a concrete computational tool with which to calculate the Stieltjes integrals that model enzymic catalysis, by replacing the integral with a finite series. The duality between enzymes and substrates (that they aremeters ‘observing’ one another) is shown to be a consequence of the mathematical duality of Banach spaces. The Stieltjes integrals of enzyme-substrate interactions are hence shown to be bounded bilinear functionals. The mechanism of enzymic catalysis, the transformation from substrate to product, is also formulated in the Stieltjes integration context via the mathematical theory of adjoints. The paper closes with suggestions for generalizations, prospects for future studies, and a review of the correspondence between mathematical and biological concepts.

Notes: Abstract An earlier theory of cell differentiation and morphogenesis (Wassermann, 1972, 1973, 1978) is combined with the genetic control model of Davidson and Britten (e.g. 1979). The resulting new theory suggests how, bysystematic process algorithms, specifically enumerated combinations of batteries of structural genes can become switched on in particularly enumerated cells, via battery-specific enumerable regulator genes. The systematization is idealized. Up to a certain stage of development in each mitotically arising cell a unique cell-specific combination of structural genes called ‘marker genes’ is active. Marker genes are assumed to code for cell-specifying marker proteins (CSMPs) which permit cells carrying related markers to recognize each other, thus permitting specific cell sorting.Batteries of marker genes could ensure great developmental precision and can safeguard—via redundancies of CSMP types—against accidental loss or detrimental mutational modification of CSMPs or marker genes, respectively. This paper is much concerned with cell lineage in relation to ‘microdifferentiation’, where ‘microdifferentiation’ of a cell refers to a cell's active marker genes and its syntheses of CSMPs. A drastic distinction is made between ‘microdifferentiation’ and ‘gross’ differentiation of a cell, where the same ‘gross’ differentiation may be shared by a large number of cells that could each be uniquely ‘microdifferentiated’. Typical ‘gross’ differentiation could manifest itself in tissue specificity, whereas, up to certain stages of development, all cells of the same gross differentiation type (say tissue specificity) could each be uniquely ‘microdifferentiated’. The theory also assumes that at certain stages of the developmental process some (or in some organisms all) of the previously uniquely specified cells could give rise to small (or occasionally large) clones of equispecified cells, some of which might form clusters that represent complete ‘morphogenetic fields’ Tentative implementation mechanisms are proposed which suggest how the theory could operate in molecular biological terms. In particular, CSMPs could endow cell surface membranes with a highly specific protein network, and an associated equally specific cell surface coat. It is suggested how these highly specified cell surface coats and other systems could provide an ‘extracellular guidance network’ which could help to direct cells to attain energetically optimal locations relative to each other based on the matching of their surface specificities. In numerous experimental situations, where normally present optimal matching of cells is excluded, ‘alternative matching’ based on experiment-specific suboptimal matching could explain many data, notably in experimental development neurobiology (Wassermann, 1978).

Notes: Abstract Two equations describing one-dimensional food chains are known to possess soliton solutions. It is demonstrated that both equations are embraced within another equation, which arises in the theory of chains of enzymic reactions. We find an elliptic function solution to this equation. We obtain a one-soliton solution from it and re-derive the elliptic function solutions of the two ecological equations.

Notes: Abstract The temperature distribution in a perfused biological tissue is calculated for an instaneous point source. An approximate solution, which is simple enough to be evaluated by means of a hand calculator, is derived from the exact solution. It is expressed in terms of the deviation from an average temperature distribution. In an example, using realistic parameters for blood flow and thermal properties of tissue, the approximate solution differs at most 2% from the exact one.

Notes: Abstract A simple model for the introduction of a cannibalistic mutant into a noncannibalistic population (or vice versa) is developed for the case where the offspring of an adult are clumped. It is assumed that there is no difference between the cannibals and noncannibals except for eating habits. Conditions on the parameters specifying the population are derived such that noncannibalism is favored over cannibalism when these conditions are satisfied. Specifically, it is shown that noncannibalism is favored in a diffuse, highly clumped population if the probability of encountering one cannibal after another is greater than twice the probability of encountering a cannibal after encountering a noncannibal.

Notes: Abstract In the field of numerical taxonomy it is often desirable to determine a tree which is the consensus (common part) of severaln-trees, each of which represents a classification of the same set of objects. In this note, ans-consensus tree and corresponding consensus index for a collection ofn-trees are defined. The choice of a value for the parameters will determine the number of nodes in thes-consensus tree and its tendency to resemble the strict or Adams-consensus tree.

Notes: Abstract The convulsant pentylenetetrazol (PTZ) was used to trigger spike bursts and paroxysmal discharges inAplysia neurons. Voltage clamp experiments showed that PTZ induced a slow voltage-dependent potassium current and a persistent inward current. These currents are incorporated into a membrane model together with modified spike-generating Hodgkin-Huxley equations. From these data a metaphoric model is constructed and represented by a slow-fast dynamical system defined inR 4. With some values of the main physiological parameters, the system might have limit cycles for the fast dynamic. A qualitative study of the system shows that it satisfactorily reproduces the various observed patterns produced by PTZ.

Notes: Abstract Monte Carlo data on the comparison of a short sequence with a long one are developed in a manner to quantify the occurrence of gaps.

Notes: Abstract The present study deals with the effect of a single cycle of body accelerations on blood flow in arteries. Such body accelerations are usually caused unintentionally, for example during travel in road vehicles, aircraft or spacecraft. A mathematical model of flow in single arteries subject to a pulsating pressure gradient due to the normal heart action as well as body acceleration expressible in terms of unit functions is presented. The body acceleration is such that it builds up from zero to a maximum value at a uniform rate, remains constant at the maximum value for some time, and thereafter reduces to zero at a uniform rate. The resulting equations are solved by using the technique of Laplace transforms. Computational results are presented for the effects of body accelerations on flow variables namely flow rate, velocity of flow, acceleration and shear stress corresponding to blood flow in the human aorta.

Notes: Abstract It is shown that a biological population or subpopulation composed ofN individuals can be governed by a generalized Verhulst logistic equation with time-dependent rate functions if and only if certain characterizing conditions are satisfied by ∂N/∂N 0 whereN 0 is the value ofN att=0.

Notes: Abstract The definitions and properties of various ideals of a nest algebra are reviewed. These correspond to strengthenings of the concept of causality. The interrelationships between these concepts are examined. An open question concerning these ideals is settled, namely that the strongly strictly causal operators form the largest of the classes commonly considered.

Notes: Abstract A class of efficient filter structures is proposed which uses a recursive realization of an FIR filter. The structures are in some sense a generalization of the frequency sampling structure, but they are more versatile and arise from a time-domain rather than frequency-domain argument. The new structure has a tap out of every block delay, and the length of the block delay is the length of each piecewise section of the time-domain approximation. The number of taps, filter coefficients, and the amount of arithmetic are proportional to the number of piecewise sections, not to the actual filter length or order. This filter is particularly efficient when a long-length filter can be approximated by a few piecewise sections, which is the case for many practical filters.

Notes: Abstract This paper introduces a new iterative image restoration method which is capable of restoring noisy blurred images by incorporatinga priori knowledge about the image and noise statistics into the iterative procedure. The iteration equation consists of a prediction part which is based on a noncausal image model description and an innovation part which is weighted by a gain factor. The gain is computed using a linear MSE optimization procedure and is updated at each step of the iteration. The convergence of the algorithm, the resolution of some convergence difficulties by using “reblurring,” and methods for the introduction of physical constraints will be discussed. This image restoration scheme can be interpreted as an iterative procedure with a statistical constraint on the image data. Results of several experiments with noisy blurred data are presented to demonstrate the feasibility of this approach.

Notes: Abstract Fast decimation-in-time (DIT) algorithms for the various discrete cosine transforms (DCT) and discrete sine transforms (DST) are systematically developed, based on a radix-2 factorization of the transformation matrix. The results indicate these to be attractive alternatives to existing algorithms in terms of computational complexity and structural simplicity.

Notes: Abstract The circuit-simulator program SPICE has been used worldwide by industry and academia to simulate wide varieties of IC designs. With the advance of technology have come many new devices that cannot be simulated by SPICE in its current form. We present methods for implementing classes of new DC device models directly into the source code of SPICE. The techniques described are illustrated for the case of the El-Mansy MOSFET model.

Notes: Abstract We consider the discrete-time detection of a known time-varying deterministic signal in white noise, where the univariate noise density is known perfectly only on an interval about the origin. We present a method to enhance the asymptotic performance of the detector by exploiting this knowledge, and at the same time preserve robustness properties of the detector to the remaining inexact knowledge of the univariate noise density. We then provide examples to show that improved performance is indeed obtained.

Notes: Abstract This paper reviews and compares different special transfer functions, of nonminimum order, characterized by low poleQ's and high selectivity. These functions extend the use of the cascade configuration, employing standard low-order sections implemented by active devices, to selective filters.

Notes: Abstract Recursive filter structures have been found for FIR filters with piecewisepolynomial or piecewise-(polynomial · sinusoid) impulse responses. The amount of arithmetic required for these filters is proportional to the number of piecewise sections in their impulse responses rather than the actual filter lengths. In this paper, it is shown that these impulse response expressions are quite good approximations to many practical filters. Low-pass filters, high-pass filters, narrowband, band-pass, and band-stop filters, Hilbert transformers, and differentiators all have impulse responses which can be approximated by these forms, and a long filter impulse response consists of only a few piecewise sections with greatly reduced arithmetic requirements. Though this technique is based on time-domain approximation, a frequency-domain optimization to select filter parameters is presented with excellent results.

Notes: Abstract The factorization of two-dimensional spectral functions is a problem of interest in the digital processing of signals because of the nonexistence of a fundamental theorem of algebra for bivariate polynomials. In this paper we consider the special case of rational spectral functions, which are quotients of polynomials or pseudo-polynomials of finite order. We first characterize the general use of asymmetric halfplane factors, and then propose recursive procedures to obtain the factors. In the case of strictly positive spectral functions, we use the homomorphic transform to characterize the causal factor by its first-order data and then apply the modified leastsquares approximation to obtain the rational factors. For those cases of partially characterized spectral functions, we propose extensions of one-dimensional procedures. These alternative procedures are based on the modified least-squares approximation as well as on the two-dimensional Levinson algorithm. All the procedures presented are recursive, thus computationally efficient, and guarantee the stability of the factors in most cases.

Notes: Abstract Tests for the discrete scattering Hurwitz property of two-dimensional (2-D) polynomials are suggested. Results belonging to two different categories are presented. The first procedure uses a finite number of rational operations and relies on the so-called polynomial resultant algebra. Alternative methods of testing, which are computationally less complex to implement are also developed.

Notes: Abstract This paper investigates the properties of the two-variable polynomialu (λ, z) built on the first column of the adjoint matrix ofλI -C, whereC is a given Hermitian Toeplitz matrix. In particular, the stability properties ofu (λ,z) are discussed and are shown to depend essentially on the location of X with respect to the eigenvalues ofC. The eigenvectors ofC, which have recently found some applications in signal processing and estimation theory, are obtained from the polynomialu(λ,z) whenλ tends to the eigenvalues ofC. This allows one to derive several results concerning the eigenpolynomials, including those for the case of multiple eigenvalues.

Notes: Abstract A general-purpose interactive computer program for the design of linear causal shift-invariant two-dimensional recursive filters is presented in terms of its organization and operation. Narrow-band fan filters and circularly symmetric low-pass and high-pass filters for many useful image-processing applications can be designed using this program. The design is by numerical optimization of a guaranteedstable analog transfer function which is derived from a general two-dimensional passive prototype network. Corresponding discrete transfer functions are obtained by the double bilinear transformation. In using the program, selection of one code from a menu of predefined design codes provides the designer with various design features; these include the use of a doubly-terminated network to eliminate erroneous gain spikes, the use of a network particularly suited to circularly symmetric functions, and a facility for designing filters potentially useful for high-speed parallel processing. Design examples of a low-order highly selective fan filter and a circularly symmetric low-pass filter are included.

Notes: Abstract The implementation of the Lin model for the non pinchoff depletion mode MOSFETs directly into the source code of the SPICE 2G.5 circuit simulation program is described. The computational advantages of our implementation over Lin's subcircuit approach are pointed out, and, more significantly, certain previously undiscovered limitations of both methods are discussed. The encoding of the model into SPICE is described in sufficient detail so as to be duplicable by other interested researchers. Our results compare favorably to experiment and to the more comprehensive El-Mansy model. Finally, a new method of parameter extraction is described for the El-Mansy model, which makes it possible to derive the parameters of the Lin and El-Mansy models simultaneously.

Notes: Abstract The roundoff noise problem for multirate digital filters is difficult because rate changing inside the filter makes both scaling and roundoff noise calculation complicated. With a new multirate filter analysis technique, the transfer function between any two points inside a multirate filter can be easily found, thus, simplifies the scaling and noise calculation. This paper finds theL P scaling and derives the roundoff noise expressions for fixed point implementations of the multistage decimator, interpolator, and multirate narrow-band low-pass filter. It is shown that the noise source at a low sampling rate stage is more important than that at a higher sampling rate stage. Methods to reduce output roundoff noise are discussed.

Notes: Abstract A relation between the types of symmetries that exist in signal and Fourier transform domain representations is derived for continuous as well as discrete domain signals. The symmetry is expressed by a set of parameters, and the relations derived in this paper will help to find the parameters of a symmetry in the signal or transform domain resulting from a given symmetry in the transform or signal domain respectively. A duality among the relations governing the conversion of the parameters of symmetry in the two domains is also brought to light. The application of the relations is illustrated by a number of two-dimensional examples.

Notes: Abstract Two-dimensional recursive digital filters have the advantages of flexibility and accuracy, typical of digital processing systems, and the ability to perform the desired filtering with significantly fewer operations than nonrecursive filters. In this paper some useful symmetries are exploited in the design of filters with circularly symmetric magnitude responses. With the imposition of quadrantal symmetry, followed by further symmetry about the 45° line, a particular filter structure is derived using a cascade of causal second-order sections. Each section uses only four independent coefficients and possesses a separable denominator, with resulting simplification of stability testing and stabilization, which can now be done by using one-dimensional techniques. The Fletcher-Powell nonlinear optimization routine is used with a mean-squared error criterion, which enables the optimum value of the gain to be incorporated into the objective function to be minimized. Linear phase is approximated by designing all-pass equalizers which can be cascaded with the filters designed.

Notes: Conclusions This special issue focuses on aspects of current research in a topic of paramount interest that spans a wide area of applications and at the same time offers theoretically challenging problems. I wish to thank Professor Sydney R. Parker for inviting me to serve as the Guest Editor for what he considered would be an important and timely special issue. I hope that expectation is, at least, partly realized by the readers of this volume. For me, it was a rewarding experience to have interacted with the contributors and reviewers. I also value this opportunity to study many interesting results generated over the past several years. The help provided by the reviewers are gratefully acknowledged. I wish to thank the Air Force Office of Scientific Research and the National Science Foundation for their support of research, some of which has been referenced in this editorial.

Notes: Zusammenfassung In einem Pilotversuch bei einer offenen Kehrichtdeponie wurde die Wirkung von arteigenen Angstschreien zum Verjagen von Rabenkrähen untersucht. Im Hinblick auf die Verwendung der Methode zum Schutz von sprießenden Maisfeldern interessierten die Gewöhnungszeiten der Krähen und die optimalen Sendeintervalle der Schreie. Die Versuche wurden jeweils morgens an 8 aufeinanderfolgenden Werktagen durchgeführt, und es gelang, mit nur 13 Abspielungen der Schreie die Krähen von der Grube fernzuhalten. Die Krähen flohen schneller, je mehr Schreie sie schon gehört hatten, und die Zeit bis zu ihrer Rückkehr nach der Flucht nahm von 20 Minuten auf 3 Stunden zu. Die Möglichkeit des Auftretens eines „warming up”-Phänomens wird diskutiert.

Notes: Zusammenfassung Berichtet wird über provoziertes spätes Setzen in einer Damwildherde, der erst am 25. Januar 1983 ein Hirsch zugegeben wurde. Die Geburtstermine lagen zwischen dem 13. und 29. September 1983, die daraus errechneten Konzeptionszeiten zwischen dem 27. Januar und 13. Februar 1983. Vier Alttiere setzten 5 Kälber, eines davon Zwillinge. Ein schwaches und zwei spätgeborene Schmaltiere waren nicht brunftig geworden.