to determine chromosomal localization and relationship between field and laboratory indicators of drought tolerance, an experiment was conducted in 2003-2004 cropping season at sararood agricultural research station, kermanshah, iran. seven genotypes of wheat-barley disomic addition lines provided by international center for agricultural research in dryland areas (icarda), their donor and recip...

Promptness is a desirable behavior in students and an expected behavior in professionals. Promptness can also be viewed as a surrogate variable of the larger concept of engagement with the course. Here, a model to integrate the evaluation of promptness into the usual pattern of teaching a college-level course is presented. The life cycle of a specific assignment is presented and broken down int...

Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the “wait time” for an eventuality to be fulfilled. That is, Fθ asserts that θ holds eventually, but there is no bound on the time when θ will hold. This is troubling, as designers tend to interpret an eventuality F...

Abstract A central property of a classical geometry is that the geodesic distance between two events additive. When considering quantum fluctuations in metric or statistical superposition different spacetimes, additivity generically lost at level expectation values. In presence metrics, distances can be made diffeomorphism invariant by frame family free-falling observers pressureless fluid, pro...

Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems. They are closely related to alternating ω-automata and emerge as a natural method for the solution of the μ-calculus model checking problem. Due to these strict connections, parity games are a well-established environment to describe liveness properties such as “every request that occurs infi...

We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cu...