Heritability of multiple mating by female field crickets, Gryllus integer (Orthoptera: Gryllidae)

The heritability of multiple mating in female Gryllus integer crickets was studied. Two preliminary experiments were conducted to determine when females first mate following the post-imaginal moult and to ascertain whether constant exposure to males affects female mating rate. Female Q. integer first mated at an average age of 3.6 days (S.D. = 2.3, Range = 0-8 days) . Exposing female crickets to courting males 24 hr daily did not significantly alter mating rates from those females in contact with males for only 5 hr per day. A heritability value of 0.690 ± 0.283 was calculated for multiple mating behavior in female Q. integer using a parent-offspring regression approach. Parental females mated between land 30 times (x 9.8, S . D. = 6. 6 ) and offspring matings ranged from 0 to 26 times (x 7 .3, S.D. = 3.4). Multiple mating is probably a sexually selected trait which functions as a mechanism of female choice and increases reproductive success through increased offspring production. Classical theory suggests that traits intimately related with fitness should exhibit negligible heritable variation. However, this study has shown that multiple mating, a trait closely linked with reproductive fitness, exhibits substantial heritability. These results are in concordance with a growing body of empirical evidence suggesting many fitness traits in natural populations demonstrate heritabilities far removed from zero. Various mechanisms which may maintain heritable variation for female multiple mating in wild, outbred Q. integer populations are discussed.

An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.