Factors influencing paternity success in Antechinus agilis: last-male sperm precedence, timing of mating and genetic compatibility

We describe the patterns of paternity success from laboratory mating experiments conducted in Antechinus agilis, a small size dimorphic carnivorous marsupial (males are larger than females). A previous study found last-male sperm precedence in this species, but they were unable to sample complete Utters, and did not take male size and relatedness into account. We tested whether last-male sperm precedence regardless of male size still holds for complete litters. We explored the relationship between male mating order, male size, timing of mating and relatedness on paternity success. Females were mated with two males of different size with either the large or the small male first, with 1 day rest between the matings. Matings continued for 6 h. in these controlled conditions male size did not have a strong effect on paternity success, but mating order did. Males mating second sired 69.5% of the offspring. Within first mated males, males that mated closer to ovulation sired more offspring, To a lesser degree, variation appeared also to be caused by differences in genetic compatibility of the female and the male, where high levels of allele-sharing resulted in lower paternity success.

Handling shared resources and precedence constraints in open systems

There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

Concurrency detection on finish-to-start activity precedence networks

We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.

On games corresponding to sequencing situations with precedence relations

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.

Calling and career preparation: Investigating developmental patterns and temporal precedence

The presence of a calling and career development are assumed to be closely related. However, the nature of and reason for this relationship have not been thoroughly investigated. We hypothesized the existence of reciprocal effects between calling and three dimensions of career preparation and assessed the change of the presence of a calling, career planning, decidedness, and self-efficacy with three waves of a diverse sample of German university students (N = 846) over one year. Latent growth analyses revealed that the intercepts of calling showed a significant positive correlation with the intercepts of all career preparation measures. The slope of calling was positively related to those of decidedness and self-efficacy but not to planning. Cross-lagged analyses showed that calling predicted a subsequent increase in planning and self-efficacy. Planning and decidedness predicted an increase in the presence of a calling. The results suggest that calling and career preparation are related due to mutual effects but that effects differ for different career preparation dimensions.

Calling and career preparation: Investigating developmental patterns and temporal precedence

The presence of a calling and career development are assumed to be closely related. However, the nature of and reason for this relationship has not been thoroughly investigated. We hypothesized the existence of reciprocal effects between calling and three dimensions of career preparation and assessed the change of the presence of a calling, career planning, decidedness, and self-efficacy with three waves of a diverse sample of German university students (N = 846) over one year. Latent growth analyses revealed that the intercepts of calling showed a siginficant positive correlation with the intercepts of all career preparation measures. The slope of calling was positively related to those of decidedness and self-efficacy but not to planning. Cross-lagged analyses showed that calling predicted a subsequent increase in planning and self-efficacy. Planning and decidedness predicted an incrrease in the presence of a calling. The results suggest that calling and career preparation are related due to mutual effects but that effects differ for different career preparation dimensions.

Relating goal scheduling, precedence, and memory management in and-parallel execution of logic programs

The interactions among three important issues involved in the implementation of logic programs in parallel (goal scheduling, precedence, and memory management) are discussed. A simplified, parallel memory management model and an efficient, load-balancing goal scheduling strategy are presented. It is shown how, for systems which support "don't know" non-determinism, special care has to be taken during goal scheduling if the space recovery characteristics of sequential systems are to be preserved. A solution based on selecting only "newer" goals for execution is described, and an algorithm is proposed for efficiently maintaining and determining precedence relationships and variable ages across parallel goals. It is argued that the proposed schemes and algorithms make it possible to extend the storage performance of sequential systems to parallel execution without the considerable overhead previously associated with it. The results are applicable to a wide class of parallel and coroutining systems, and they represent an efficient alternative to "all heap" or "spaghetti stack" allocation models.

Baptism in its subject, act, design, administrator and precedence to the Lord's Supper.

Mode of access: Internet.

Integrating structured data using property precedence

Data integration systems offer uniform access to a set of autonomous and heterogeneous data sources. One of the main challenges in data integration is reconciling semantic differences among data sources. Approaches that been used to solve this problem can be categorized as schema-based and attribute-based. Schema-based approaches use schema information to identify the semantic similarity in data; furthermore, they focus on reconciling types before reconciling attributes. In contrast, attribute-based approaches use statistical and structural information of attributes to identify the semantic similarity of data in different sources. This research examines an approach to semantic reconciliation based on integrating properties expressed at different levels of abstraction or granularity using the concept of property precedence. Property precedence reconciles the meaning of attributes by identifying similarities between attributes based on what these attributes represent in the real world. In order to use property precedence for semantic integration, we need to identify the precedence of attributes within and across data sources. The goal of this research is to develop and evaluate a method and algorithms that will identify precedence relations among attributes and build property precedence graph (PPG) that can be used to support integration.

Multi-stage scheduling problems with precedence constraints

Abstract not available

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

Abstract not available