Molecular genetic analysis of a cattle population to reconstitute the extinct Algarvia breed

Background: Decisions to initiate conservation programmes need to account for extant variability, diversity loss and cultural and economic aspects. Molecular markers were used to investigate if putative Algarvia animals could be identified for use as progenitors in a breeding programme to recover this nearly extinct breed. Methods: 46 individuals phenotypically representative of Algarvia cattle were genotyped for 27 microsatellite loci and compared with 11 Portuguese autochthonous and three imported breeds. Genetic distances and factorial correspondence analyses (FCA) were performed to investigate the relationship among Algarvia and related breeds. Assignment tests were done to identify representative individuals of the breed. Y chromosome and mtDNA analyses were used to further characterize Algarvia animals. Gene- and allelic-based conservation analyses were used to determine breed contributions to overall genetic diversity. Results: Genetic distance and FCA results confirmed the close relationship between Algarvia and southern Portuguese breeds. Assignment tests without breed information classified 17 Algarvia animals in this cluster with a high probability (q > 0.95). With breed information, 30 cows and three bulls were identified (q > 0.95) that could be used to reconstitute the Algarvia breed. Molecular and morphological results were concordant. These animals showed intermediate levels of genetic diversity (MNA = 6.0 ± 1.6, Rt = 5.7 ± 1.4, Ho = 0.63 ± 0.19 and He = 0.69 ± 0.10) relative to other Portuguese breeds. Evidence of inbreeding was also detected (Fis = 0.083, P < 0.001). The four Algarvia bulls had Y-haplotypes H6Y2 and H11Y2, common in Portuguese cattle. The mtDNA composition showed prevalence of T3 matrilines and presence of the African-derived T1a haplogroup. This analysis confirmed the genetic proximity of Algarvia and Garvonesa breeds (Fst = 0.028, P > 0.05). Algarvia cattle provide an intermediate contribution (CB = 6.18, CW = -0.06 and D1 = 0.50) to the overall gene diversity of Portuguese cattle. Algarvia and seven other autochthonous breeds made no contribution to the overall allelic diversity. Conclusions: Molecular analyses complemented previous morphological findings to identify 33 animals that can be considered remnants of the Algarvia breed. Results of genetic diversity and conservation analyses provide objective information to establish a management program to reconstitute the Algarvia breed.

Speech of Hon. John Lowndes McLaurin, of South Carolina, in the Senate of the United States, Monday, December 9, 1901

This speech is to address the statement that Mr. McLaurin has been excluded from the caucuses of his party and thus that he will be without assignment on any committee. He goes on to explain his exclusion and defend his views that led to his exclusion.

Miniaturization and Integration of Optoelectronics for Contact Lens Embedded Display and Wireless Communication

Thesis (Ph.D.)--University of Washington, 2013

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.