the genetic parameters and (co) variance components of body weight at birth (bw), weaning (ww) and six months of age (bw6) and average daily gain (adg) pre and post-weaning of afshari sheep were estimated using restricted maximum likelihood (reml) methodology and animal model implemented in dfreml software. the likelihood ratio test (lrt) was used to compare the models. year of birth, age of mo...

This paper revisits worst-case response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [3, 4, 5], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that ...

This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis for developing predictable distributed real-time systems.

The present paper studies almost fixed point property for digital spaces whose structures are induced by Marcus-Wyse (M-, for brevity) topology. In this paper we mainly deal with spaces X which are connected M-topological spaces with M-adjacency (MA-spaces or M-topological graphs for short) whose cardinalities are greater than 1. Let MAC be a category whose objects, denoted by Ob(MAC), are MA-s...

Counting Bloom Filters (CBFs) are widely employed in many applications for fast membership queries. CBF works on dynamic sets rather than a static set via item insertions and deletions. CBF allows false positive, but not false negative. The Bh-Counting Bloom Filter (Bh-CBF) and Variable Increment Counting Bloom Filter (VI-CBF) are introduced to reduce the false positive probability, but they su...

This paper revisits response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [5, 6, 7], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that task when r...

A closed convex subset C of a Banach space E has normal structure if for each bounded closed convex subsetD of Cwhich contains more than one point, there is a point x ∈ D which is not a diametral point of D, that is, sup {‖x − y‖ : y ∈ D} < δ D , where δ D the diameter of D. The set C is said to have fixed point property FPP if every nonexpansive mapping T : C → C has a fixed point. In 1 , Kirk...

In this paper, we present equations to determine the exact worst-case response times of periodic tasks under fixedpriority scheduling with deferred preemption (FPDS) and arbitrary phasing. We show that the worst-case response time analysis is not uniform for all tasks. Our exact analysis is based on a dedicated conjecture for an ε-critical instant, and uses the notion of worst-case occupied time.

Image compression techniques have required much attention from the neural networks community for the last years. In this work we intend to develop a new algorithm to perform image compression based on adding some pre-fixed prototypes to those obtained by a competitive neural network. Prototypes are selected to get a better representation of the compressed image, improving the computational time...