Reproductive allocation strategies: a long-term study on proximate factors and temporal adjustments in a viviparous lizard.

Optimisation of reproductive investment is crucial for Darwinian fitness, and detailed long-term studies are especially suited to unravel reproductive allocation strategies. Allocation strategies depend on the timing of resource acquisition, the timing of resource allocation, and trade-offs between different life-history traits. A distinction can be made between capital breeders that fuel reproduction with stored resources and income breeders that use recently acquired resources. In capital breeders, but not in income breeders, energy allocation may be decoupled from energy acquisition. Here, we tested the influence of extrinsic (weather conditions) and intrinsic (female characteristics) factors during energy storage, vitellogenesis and early gestation on reproductive investment, including litter mass, litter size, offspring mass and the litter size and offspring mass trade-off. We used data from a long-term study of the viviparous lizard, Lacerta (Zootoca) vivipara. In terms of extrinsic factors, rainfall during vitellogenesis was positively correlated with litter size and mass, but temperature did not affect reproductive investment. With respect to intrinsic factors, litter size and mass were positively correlated with current body size and postpartum body condition of the previous year, but negatively with parturition date of the previous year. Offspring mass was negatively correlated with litter size, and the strength of this trade-off decreased with the degree of individual variation in resource acquisition, which confirms theoretical predictions. The combined effects of past intrinsic factors and current weather conditions suggest that common lizards combine both recently acquired and stored resources to fuel reproduction. The effect of past energy store points out a trade-off between current and future reproduction.

Cardenolides in nectar may be more than a consequence of allocation to other plant parts: a phylogenetic study of Asclepias

The primary function of secondary plant metabolites is thought to be defence against herbivores. The frequent occurrence of these same noxious compounds in floral nectar, which functions primarily to attract pollinators, has been seen as paradoxical. Although these compounds may have an adaptive purpose in nectar, they may also occur as a nonadaptive consequence of chemical defence in other plant parts. If nectar chemistry reflects physiological constraints or passive leakage from other tissues, we expect that the identity and relative concentration of nectar cardenolides to be correlated with those of other plant parts; in contrast, discordant distributions of compounds in nectar and other tissues may suggest adaptive roles in nectar. We compared the concentrations and identities of cardenolides in the nectar, leaves and flowers of 12 species from a monophyletic clade of Asclepias. To measure putative toxicity of nectar cardenolides, we then examined the effects of a standard cardenolide (digoxin) on the behaviour of bumblebees, a common generalist pollinator of Asclepias. We found that the average cardenolide concentrations in nectar, leaves and flowers of the 12 Asclepias species were positively correlated as predicted by nonadaptive hypotheses. However, significant differences in the identities and concentrations of individual cardenolides between nectar and leaves suggest that the production or allocation of cardenolides may be independently regulated at each plant part. In addition, cardenolide concentrations in leaves and nectar exhibited no phylogenetic signal. Surprisingly, bumblebees did not demonstrate an aversion to digoxin-rich nectar, which may indicate that nectar cardenolides have little effect on pollination. Although the idea that discordant patterns of secondary metabolites across tissue types may signal adaptive functions is attractive, there is evidence to suggest constraint contributes to nectar secondary chemistry. Further work testing the ecological impacts of such patterns will be critical in determining the functional significance of nectar cardenolides

The average inter-crossing number of equilateral random walks and polygons

In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = (3 In 2)/(8) approximate to 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance p apart and p is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of p. Our simulation result shows that the model in fact works very well for the entire range of p. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well.

Bandwidth allocation based on real time calculations using the convolution approach

This paper focuses on one of the methods for bandwidth allocation in an ATM network: the convolution approach. The convolution approach permits an accurate study of the system load in statistical terms by accumulated calculations, since probabilistic results of the bandwidth allocation can be obtained. Nevertheless, the convolution approach has a high cost in terms of calculation and storage requirements. This aspect makes real-time calculations difficult, so many authors do not consider this approach. With the aim of reducing the cost we propose to use the multinomial distribution function: the enhanced convolution approach (ECA). This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements and makes a simple deconvolution process possible. The ECA is used in connection acceptance control, and some results are presented

Quality uncertainty and allocation of decision rights in the European protected designation of origin

The paper considers some issue in the governance of the European Protected Designation of Origin (PDO). The PDO systems are the outcomes of both farmers and consumers expectations and connect the valorisation of the agricultural and rural resources of given territories to the quality of typical products. A critical point in the governance of the PDO systems is represented by the connection between the quality strategies and the uncertainty. The paper argues that the PDO systems can be thought of as strictly coordinated subsystems in which the ex post governance play a critical role in coping with quality uncertainty. The study suggests that the society's inducements given raise to complex organizational systems in which the allocation of decision rights to PDO collective organizations play a major role. The empirical analysis is carried out by examining ten Italian PDO systems in order to identify the decision rights allocated.

Solving Large Location-Allocation problems by Clustering and Simulated Annealing

Globalization involves several facility location problems that need to be handled at large scale. Location Allocation (LA) is a combinatorial problem in which the distance among points in the data space matter. Precisely, taking advantage of the distance property of the domain we exploit the capability of clustering techniques to partition the data space in order to convert an initial large LA problem into several simpler LA problems. Particularly, our motivation problem involves a huge geographical area that can be partitioned under overall conditions. We present different types of clustering techniques and then we perform a cluster analysis over our dataset in order to partition it. After that, we solve the LA problem applying simulated annealing algorithm to the clustered and non-clustered data in order to work out how profitable is the clustering and which of the presented methods is the most suitable

Subknots in ideal knots, random knots, and knotted proteins.

We introduce disk matrices which encode the knotting of all subchains in circular knot configurations. The disk matrices allow us to dissect circular knots into their subknots, i.e. knot types formed by subchains of the global knot. The identification of subknots is based on the study of linear chains in which a knot type is associated to the chain by means of a spatially robust closure protocol. We characterize the sets of observed subknot types in global knots taking energy-minimized shapes such as KnotPlot configurations and ideal geometric configurations. We compare the sets of observed subknots to knot types obtained by changing crossings in the classical prime knot diagrams. Building upon this analysis, we study the sets of subknots in random configurations of corresponding knot types. In many of the knot types we analyzed, the sets of subknots from the ideal geometric configurations are found in each of the hundreds of random configurations of the same global knot type. We also compare the sets of subknots observed in open protein knots with the subknots observed in the ideal configurations of the corresponding knot type. This comparison enables us to explain the specific dispositions of subknots in the analyzed protein knots.

Cell size distribution in a random tessellation of space governed by the Kolmogorov-Johnson-Mehl-Avrami model: Grain size distribution in crystallization

The space subdivision in cells resulting from a process of random nucleation and growth is a subject of interest in many scientific fields. In this paper, we deduce the expected value and variance of these distributions while assuming that the space subdivision process is in accordance with the premises of the Kolmogorov-Johnson-Mehl-Avrami model. We have not imposed restrictions on the time dependency of nucleation and growth rates. We have also developed an approximate analytical cell size probability density function. Finally, we have applied our approach to the distributions resulting from solid phase crystallization under isochronal heating conditions

Detecció automàtica de punts facials característics utilitzant Random Ferns i el criteri de la información mútua simplificada

En aquest article comparem el rendiment que presenten dos sistemes de reconeixement de punts característics en imatges: en el primer utilitzem la tècnica Random Ferns bàsica i en el segon (que anomenem Ferns amb Informació Mútua o FIM) apliquem una tècnica d'obtenció de Ferns utilitzant un criteri simplificat de la informació mútua.

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.

Sistema de votació electrònica sobre corbes el·líptques amb mescla de vots mitjançant Random Group Full Checking

L'objectiu del treball és dissenyar i implementar un sistema de simulació de votació electrònica, emprant una adaptació sobre corbes el·líptiques del criptosistema ElGamal, per tal d'estudiar-ne la viabilitat, centrant l'atenció en temes de seguretat, especialment en el procés de mescla de vots per tal de desvincular un vot de la persona que l'ha emès.

Predicting optimal lengths of random knots

In a thermally fluctuating long linear polymeric chain in a solution, the ends, from time to time, approach each other. At such an instance, the chain can be regarded as closed and thus will form a knot or rather a virtual knot. Several earlier studies of random knotting demonstrated that simpler knots show a higher occurrence for shorter random walks than do more complex knots. However, up to now there have been no rules that could be used to predict the optimal length of a random walk, i.e. the length for which a given knot reaches its highest occurrence. Using numerical simulations, we show here that a power law accurately describes the relation between the optimal lengths of random walks leading to the formation of different knots and the previously characterized lengths of ideal knots of a corresponding type.