131,074 research outputs found
Maggs, D T, NX35917
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/401045Surname: MAGGS. Given Name(s) or Initials: D T. Military Service Number or Last Known Location: NX35917. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 12293.220691
Item: [2016.0049.33338] "Maggs, D T, NX35917
Maggs, J D, VX36637
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/401046Surname: MAGGS. Given Name(s) or Initials: J D. Military Service Number or Last Known Location: VX36637. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 23763.220692
Item: [2016.0049.33339] "Maggs, J D, VX36637
Jack Maggs : A Differend Convict(ion) by Peter Carey
No full textThis thesis is an analysis of Peter Carey\u27s novel Jack Maggs and its attempt at writing back to Charles Dickens\u27 Great Expectations. I will analyse the (de)construction of language games between Jack Maggs and Great Expectations; show how Carey as a post-colonial settler writer writes back to the centre, to Dickens\u27 text as a canonical Victorian novel, through intergrating the very notion of the Victorian novel, and in his own terms giving the convict a history . I will explore how Carey writes competing language games of science and narrative (as identified by Lyotard) within Jack Maggs and how they produce what Lyotard calls a differend within history: Tobias Oates\u27 construction of Jack Maggs\u27 history through the scientific language game of Animal Magnetism, which relies on the notion of a centre and concrete metaphors to make sense, is in competition with Jack Maggs\u27 private history constructed through narrative language games, unrestricted by limiting procedures. I will discuss the aporia of identity for the settler writer, which is internally (Slemon, 1997, p.l09) inscribed within the text, and within Jack Maggs; how the process of identity is not closed within or outside the text; how Carey\u27s Australian identities are formed without resorting to nationalist notions of closure and purity. The purity of nation state, which is legitimated by a meta-narrative of History, is no longer credible in Carey\u27s postmodern/post colonial enceinte. Finally, I will show how Carey moves to cut symbolic ties with England to form an Australian republic, which is acceptant of heterogeneous and fluid notions of identity: of Australian national identities without a fixed notion of the nation state; a history of Australia which incorporates its fictions and its truths ; a notion of history which is constructed from narrative language games and scientific language games
Vertebrata martensiana Pineiro-Corbeira, Maggs & Diaz-Tapia. Ce 2020, comb. nov.
No full text<i>Vertebrata martensiana</i> (Kützing) Piñeiro-Corbeira, Maggs & Díaz-Tapia, comb. nov. <p> <i>Polysiphonia martensiana</i> Kützing, <i>Phycologia</i> <i>generalis oder Anatomie, Physiologie und Systemkunde der Tange. Mit 80 farbig gedruckten Tafeln, gezeichnet und gravirt vom Verfasser</i>: 432 (1843) (basionym). — <i>Boergeseniella martensiana</i> (Kützing) Ardré, <i>Portugaliae Acta Biologica, Série B</i> 10: 198 (1970).</p> <p> TYPE LOCALITY. — <b>Biarritz</b>. France (Kützing 1843).</p>Published as part of <i>Piñeiro-Corbeira, Cristina, Maggs, Christine A., Rindi, Fabio, Bunker, Francis, Baldock, Lin & Díaz-Tapia, Pilar, 2020, Molecular assessment of the tribes Streblocladieae and Polysiphonieae (Rhodomelaceae, Rhodophyta) in the British Isles reveals new records and species that require taxonomic revision, pp. 55-72 in Cryptogamie, Algologie 20 (8)</i> on page 65, DOI: 10.5252/cryptogamiealgologie2020v41a8, <a href="http://zenodo.org/record/7827761">http://zenodo.org/record/7827761</a>
The interplay of sedimentation and crystallization in hard-sphere suspensions
No full textWe study crystal nucleation under the influence of sedimentation in a model of colloidal hard spheres via Brownian dynamics simulations. We introduce two external fields acting on the colloidal fluid: a uniform gravitational field (body force), and a surface field imposed by pinning a layer of equilibrium particles (rough wall). We show that crystal nucleation is suppressed in proximity of the wall due to the slowing down of the dynamics, and that the spatial range of this effect is governed by the static length scale of bond orientational order. For distances from the wall larger than this length scale, the nucleation rate is greatly enhanced by the process of sedimentation, since it leads to a higher volume fraction, or a higher degree of supercooling, near the bottom. The nucleation stage is similar to the homogeneous case, with nuclei being on average spherical and having crystalline planes randomly oriented in space. The growth stage is instead greatly affected by the symmetry breaking introduced by the gravitation field, with a slowing down of the attachment rate due to density gradients, which in turn cause nuclei to grow faster laterally. Our findings suggest that the increase of crystal nucleation in higher density regions might be the cause of the large discrepancy in the crystal nucleation rate of hard spheres between experiments and simulations, on noting that the gravitational effects in previous experiments are not negligible
MeSH term explosion and author rank improve expert recommendations
No full textInformation overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules
No full textIn 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to their destinations in O(c + d) steps using constant-size queues, where c is the congestion of the paths in the network, and d is the length of the longest path. The proof, however, used the Lov'asz Local Lemma and was not constructive. In this paper, we show how to find such a schedule in O(P(log log P) log P) time, with probability 1 \Gamma 1=P fi , for any positive constant fi, where P is the sum of the lengths of the paths taken by the packets in the network. We also show how to parallelize the algorithm so that it runs in NC. The method that we use to construct the schedules is based on the algorithmic form of the Lov'asz Local Lemma discovered by Beck. Tom Leighton is supported in part by ARPA Contracts N00014-91-J-1698 and N00014-92-J-1799. Bruce Maggs and Andr'ea Richa are supported i..
- …
