Prey should hide more randomly when a predator attacks more persistently

When being searched for and then (if found) pursued by a predator, a prey animal has a choice between choosing very randomly among hiding locations so as to be hard to find or alternatively choosing a location from which it is more likely to successfully flee if found. That is, the prey can choose to be hard to find or hard to catch, if found. In our model, capture of prey requires both finding it and successfully pursuing it. We model this dilemma as a zero-sum repeated game between predator and prey, with the eventual capture probability as the pay-off to the predator. We find that the more random hiding strategy is better when the chances of repeated pursuit, which are known to be related to area topography, are high. Our results extend earlier results of Gal and Casas, where there was at most only a single pursuit. In that model, hiding randomly was preferred by the prey when the predator has only a few looks. Thus, our new multistage model shows that the effect of more potential looks is opposite. Our results can be viewed as a generalization of search games to the repeated game context and are in accordance with observed escape behaviour of different animals.     

On the relation between common and distinctive feature models.

Investigates the relationship between the classificatory structure of objects and the dissimilarity between them by discussing the common and distinctive features models. Data indicate that given a feature structure, the 2 models produce different orderings of dissimilarity between objects. However, if one model holds in some feature structure, then the other model also holds, albeit in a different feature structure. It is suggested that the choice of a model and the specification of the feature structure are not always determined by the observed dissimilarity. (16 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Contingent weighting in judgment and choice.

Preference can be inferred from direct choice between options or from a matching procedure in which the decision maker adjusts one option to match another. Studies of preferences between two-dimensional options (e.g., public policies, job applicants, benefit plans) show that the more prominent dimension looms larger in choice than in matching. Thus, choice is more lexicographic than matching. This finding is viewed as an instance of a general principle of compatibility: The weighting of inputs is enhanced by their compatibility with the output. To account for such effects, we develop a hierarchy of models in which the trade-off between attributes is contingent on the nature of the response. The simplest theory of this type, called the contingent weighting model, is applied to the analysis of various compatibility effects, including the choice-matching discrepancy and the preference-reversal phenomenon. These results raise both conceptual and practical questions concerning the nature, the meaning and the assessment of preference. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Reaction-bonded B4C/SiC composites synthesized by microwave heating

The reaction-bonding technique was used to synthesize boron carbide (B₄C) - silicon carbide (SiC) composites by microwave heating. Preforms of porous B₄C were obtained by compaction followed or not by partial densification. Then, the material was infiltrated by molten silicon under a microwave heating. The influence of the thermal cycles (T: 1400-1500°C, t: 5-120 minutes) is low. The hardness of boron carbide is comparable to that of alumina (15-19 GPa) for a much lower density (≈2.5 g/cm³ for B₄C-based material instead of 3.95 g/cm³ for alumina). These properties make this composite, obtained by microwave heating, a good candidate for ballistic applications.     

Role of acetylcholine in negative patterning in turtles (Chrysemys picta).

Turtles were run on a negative patterning task involving 2 positive elements, a key with white stripes on a black background, and a solid red key, and a compound stimulus combining the 2 elements, white stripes on a red background. Injections of scopolamine, methylscopolamine, or saline were started at the same time that the compound stimulus was introduced, after the animals had been autoshaped to press the key for each of the elements. Scopolamine disrupted the learning of negative patterning, but methylscopolamine had no effect. In contrast, learning of a simple discrimination between the elements was not affected by scopolamine. These results show that muscarinic cholinergic receptors are involved in the learning of negative patterning in turtles. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Crack identification by ‘arrival time’ using XFEM and a genetic algorithm

A computational framework is developed in which cracks in two‐dimensional structures are identified, in conjunction with non‐destructive testing of specimens. As opposed to a previous study by the authors, which was based on time‐harmonic excitation with a single frequency, here the transient response of the structure to a short‐duration signal is measured along part of the external boundary. Crack detection is performed using the solution of an inverse time‐dependent problem. It is shown that the arrival time of the input signal to the points of measurement is a good criterion for crack identification in the time domain. The inverse problem of identification is solved using a genetic algorithm, while each forward problem is solved by the time‐dependent extended finite element method (XFEM). The XFEM scheme is efficient in that it allows the use of a single regular mesh for a large number of forward time response problems with different crack geometries. Numerical examples involving a crack in a flat membrane are presented. Identification based on ‘arrival time’ is shown to perform better than that based on time‐harmonic response. Copyright © 2008 John Wiley & Sons, Ltd.     

On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms

In Dijkstra (Commun ACM 17(11):643–644, 1974) introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of n processors. The third algorithm is the most interesting of these three but is rather non intuitive. In Dijkstra (Distrib Comput 1:5–6, 1986) a proof of its correctness was presented, but the question of determining its worst case complexity—that is, providing an upper bound on the number of moves of this algorithm until it stabilizes—remained open. In this paper we solve this question and prove an upper bound of 3\frac1318 n² + O(n){3\frac{13}{18} n^2 + O(n)} for the complexity of this algorithm. We also show a lower bound of 1\frac56 n² - O(n){1\frac{5}{6} n^2 - O(n)} for the worst case complexity. For computing the upper bound, we use two techniques: potential functions and amortized analysis. We also present a new-three state self-stabilizing algorithm for mutual exclusion and show a tight bound of \frac56 n² + O(n){\frac{5}{6} n^2 + O(n)} for the worst case complexity of this algorithm. In Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) presented a similar three-state algorithm, with an upper bound of 5\frac34n²+O(n){5\frac{3}{4}n^2+O(n)} and a lower bound of \frac18n²-O(n){\frac{1}{8}n^2-O(n)} for its stabilization time. For this algorithm we prove an upper bound of 1\frac12n² + O(n){1\frac{1}{2}n^2 + O(n)} and show a lower bound of n ²−O(n). As far as the worst case performance is considered, the algorithm in Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) is better than the one in Dijkstra (Commun ACM 17(11):643–644, 1974) and our algorithm is better than both.     

Design and Analysis of Output Voltage Regulation in Multi-Phase Switched Capacitor Converters

A new regulation method based on duty cycle control of the average currents in the multi-phase switched capacitor converters (SCC) is proposed, analyzed, and verified experimentally for the no effective charging case, also known as the fast switching limit. The regulation is accomplished by adjusting the value of the SCC equivalent resistance. To this end, the time slots allotted to each of the SCC topologies are adjusted, while the total switching period is kept constant. The time slots are represented by master and slave duty cycles. By this, the SCC output voltage is expressed analytically as a function of the master duty cycle. In a similar way, analytical expressions for the voltages across the flying capacitors and for the average currents in each of the topologies can be obtained. Excellent agreement was found between the theoretical and experimental results.