Titlebook: Virtue Ethics for Women 1250-1500; Karen Green,Constant Mews Book 2011 Springer Science+Business Media B.V. 2011 Agostino Strozzi.Christin

粘

Book 2011of the relative virtues of men and women. It is the first to explore how women were represented and addressed within medieval discussions of the virtues. It introduces readers to the little studied .Speculum Dominarum. (Mirror of Ladies), a mirror for a princess, compiled for Jeanne of Navarre, whic

發(fā)芽

The , (,) and Transformations of the Literature of Instruction for Women in the Early Fourteenth Ceow to order themselves to God and those things which are godly, how they ought to conduct themselves usefully and prudently in the way she and they govern, and how it is fitting for them to converse with everyone without reproach, and finally by what merits they may deserve to be elevated to the glory of the eternal kingdom.”

為敵

,Joanna of Castile’s Entry into Brussels: Viragos, Wise and Virtuous Women,tin text giving a description and interpretation. This manuscript is a unique document: the oldest illustrated testimony of a princely entry in Burgundy. It predates the entry of Charles V into Bruges in 1515, which was recorded by both an illuminated manuscript and a printed book with thirty-three woodcuts.

dagger

Affiliation

acetylcholine

Constant J. Mewscall two edges . and . of . . if the set of endpoints . induces a . in .. The . of a graph . is the smallest cardinality of a family . of linear orders of .(.) such that every pair of strongly independent edges in . are separated in at least one of the linear orders in .. For each ., the family of g

Euthyroid

Dna262

Janice Pindercently introduced various degrees of acyclicity..In this paper, a method is given for designing database schemes that enjoy these properties. This method is based on the decomposition algorithm of Fagin, cf. /Ul 82/, and on the surrogate concept, called L-augmentation, of Kandzia and Mangelmann, cf.

Angiogenesis

Cécile Quentel-Touchethe network. The goal is to inform everybody using as few rounds as possible, that is to minimize the broadcasting time..Given a graph and a subset of nodes, the sources, the problem to determine its specific broadcast time, or more general to find a broadcast schedule of minimal length has been sho

輪流

Karen Green been identified as an important and frequently occurring special case. Traditional algorithms for computing the transitive closure, as developed in the field of algorithmic graph theory, hold both the operand relation and the result relation within directly addressable main memory. The newly antici