2,915 research outputs found
Edmonds, C J, 419802
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/383434Surname: EDMONDS. Given Name(s) or Initials: C J. Military Service Number or Last Known Location: 419802. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 53652.223081
Item: [2016.0049.15727] "Edmonds, C J, 419802
J. C. "Red" Edmonds
No full text"Red" Edmonds receives an award at the Sports Hall of Fame during the Alumni dinner
Personal Papers (MS 80-0002)
No full textLetter from F. G. Robinson to Harvey Allen, Clark Davis, F. L. Gordon, E. J. Falk, C. S. Edmonds, and Frank O'Kane discussing regulations for cotton tariffs
Personal Papers (MS 80-0002)
No full textLetter from F. G. Robinson to F. H. Hemphill, L. A. Brockwell, J. S. Smith, C. S. Edmonds, E. A. Tharp, and H. J. Carr discussing tariffs on cotton shipments
Personal Papers (MS 80-0002)
No full textLetter from F. G. Robinson to Clark Davis, F. L. Gordon, Harvey Allen, E. J. Falk, C. S. Edmonds, and Frank O'Kane discussing proposals relating to cotton transport in Corpus Christi
Circumferential suction-asssisted lipectomy is the only surgical procedure that can normalize large chronic fat-transformed lymphedemas
No full text2.Brorson H. Circumferential suction-asssisted lipectomy is the only surgical procedure that can normalize large chronic fat-transformed lymphedemas. In: Catalano M, Pecsvarady Z, Olinic D, Wautrecht J-C, Gerotziafas G, Amann-Vesti B, Karetova D, Fagrell B, Diehm C, Kozak M, Edmonds M, editors, European Book of Angiology/Vascular Medicine. Milano, Italy: VAS, UNIMI-H Sacco; 2016. Pp XXX-XXX
Coprophanaeus Edmonds & Zidek, 2010, s. str.
No full textKey to species groups of Coprophanaeus s. str. 1. Circumnotal ridge continuous, not interrupted behind eyes (Fig. 7). Posterior margin of paraocular area straight, ending at middle of eye. Prosternal ridge with acute tubercle at anterior end (Fig. 112). Parameres lacking distinct apical teeth, at most with slightly swollen tips (e.g. Fig. 123). South America....................................................................................... jasius species group — Circumnotal ridge (Fig. 8) effaced behind each eye. Posterior margin of paraocular area curved, ending at posterior angle of eye. Prosternal ridge simple, not tuberculate anteriorly. Parameres with apical teeth (may be reduced) (e.g. Fig. 169-170, 217). Distribution variable................. 2 2(1). Apical processes of parameres (Fig. 169-170) projecting laterally, not visible from side, tip of paramere not appearing at all hooked in profile (although hook-like processes often visible from above); parameres elongate, usually lacking prominent basal angle. Male and female with trituberculate cephalic carina. Mesoamerican (Fig. 172)...................... pluto species group — Apical processes of parameres (Fig. 217) elevated dorsally, tip (viewed from side) appearing acutely hooked, usually projecting above dorsal surface; parameres (viewed from side) strongly triangular, base extending well below lower margin of phallobase as heel-like protuberance. Male cephalic process variable; female bearing trituberculate cephalic carina. South America (one Mesoamerican species).............................................................................................................. 3 3(2). Cephalic horn of large male more-or-less laminate, strongly raised, with apical tubercles or processes, never a trituberculate carina or raised ridge (e.g. Fig. 213, 218, 220, 227). Male head horn (and female carina) set close to eyes so that length of frons along midline usually no more than length of clypeus, often only one-half or less (cf. Fig. 171). Elytral interstriae usually flat or weakly convex, rarely narrowly raised midlongitudinally (C. ignecinctus, Fig. 232). South America, one species Mesoamerican (Fig. 237-238)........................ dardanus species group — Male and female with trituberculate cephalic carina, position relative to eyes variable (Fig. 287, 289). Elytral interstriae narrowly raised midlongitudinally. Eastern slopes of Andes from Bolivia to Colombia........................................................................................... ohausi species groupPublished as part of Edmonds, W. D. & Zidek, J., 2010, A taxonomic review of the neotropical genus Coprophanaeus Olsoufieff, 1924 (Coleoptera: Scarabaeidae, Scarabaeinae), pp. 1-111 in Insecta Mundi 2010 (129) on pages 38-39, DOI: 10.5281/zenodo.535292
FACES OF MATCHING POLYHEDRA
No full textLet G = (V, E, ~) be a finite loopless graph, let
b=(bi:ieV) be a vector of positive integers. A
feasible matching is a vector X = (x.: j e: E)
J
of nonnegative
integers such that for each node i of G, the sum of the
over the edges j of G incident with i is no
greater than bi. The matching polyhedron P(G, b) is the
convex hull of the set of feasible matchings.
In Chapter 3 we describe a version of Edmonds' blossom
algorithm which solves the problem of maximizing C • X
over P (G, b) where c =. (c.: j e: E)
J
is an arbitrary real
vector. This algorithm proves a theorem of Edmonds which
gives a set of linear inequalities sufficient to define
P(G, b).
In Chapter 4 we prescribe the unique subset of these
inequalities which are necessary to define P(G, b), that
is, we characterize the facets of P(G, b). We also
characterize the vertices of P(G, b), thus describing the
structure possessed by the members of the minimal set X
of feasible matchings of G such that for any real vector
c = (c.: j e: E), c • x is maximized over P(G, b)
J
member of X.
by a
In Chapter 5 we present a generalization of the blossom
algorithm which solves the problem: maximize c • x over
a face F of P(G, b) for any real vector c = (c.: j e: E).
J
In other words, we find a feasible matching x of G which
satisfies the constraints obtained by replacing an arbitrary
subset of the inequalities which define P(G, b) by equations and which maximizes c • x subject to this
restriction. We also describe an application of this
algorithm to matching problems having a hierarchy of objective
functions, so called ''multi-optimization'' problems.
In Chapter 6 we show how the blossom algorithm can be
combined with relatively simple initialization algorithms
to give an algorithm which solves the following postoptimality
problem. Given that we know a matching 0 x £ P(G, b)
maximizes c · x over P(G, b), we wish to utilize 0
X
which
to
find a feasible matching x' £ P(G, b') which maximizes
c • x over P(G, b'), where b' = (b!: i £ V)
]_
vector of positive integers and
arbitrary real vector.
c=(c.:j£E)
J
is a
is an
In Chapter 7 we describe a computer implementation of
the blossom algorithm described herein
- …
