Search engine run on: http://users.monash.edu.au/

Glookbib search for: zz0420

%A J. A. Nelder
%A R. Mead
%T A simplex method for function minimization
%J COMPJ
%V 7
%N 4
%P 308-313
%M JAN
%D 1965
%K jrnl, COMPJ, c1965, c196x, c19xx, zz0420, functionMin, function,
   minimization, minimum, minimisation, algorithm, Simplex
%X "A method is described for the minimization of a fn of n variables, which
   depends on the comparison of fn values at the (n+1) vertices of a general
   simplex, followed by the replacement of the vertex with the highest value by
   another point. The simplex adapts itself to the local landscape, & contracts
   on to the final minimum. The method is shown to be effective &
   computationally compact. A proc. is given for the estimation of the Hessian
   matrix in the neighbourhood of the minimum, needed in statistical estimation
   problems."
   -- [doi:10.1093/comjnl/7.4.308]['20],
      and correction
      [doi:10.1093/comjnl/8.1.27]['20].
   [Also search for: functionMin].

%A Y. Masumura
%A T. Oki
%A Y. Yamaguchi
%T Dynamic programming approach to the generalized minimum Manhattan network
   problem
%J arXiv
%M APR
%D 2020
%K TR, c2020, c202x, c20xx, zz0420, algorithm, DPA, maths, graph,
   generalized minimum Manhattan network, GMMN
%X "... (GMMN): given a set P of pairs of two pts in the Euclidean plane R^2,
    ... find a minimum-length geometric n/wk which consists of axis-aligned
   segments & contains a shortest path in the L1 metric (a so-called Manhattan
   path) for each pair in P. ... generalizes several NP-hard n/wk design
   problems that admit constant-factor approxn algs., such as the rectilinear
   Steiner arborescence (RSA) problem, & it is open whether so does the GMMN
   problem. ... Schnizler (2015) focused on the intersection graphs of the
   rectangles defined by the pairs in P, & gave a polynomial-time DPA for the
   GMMN problem whose input is restricted s.t. both the treewidth & the maximum
   degree of its intersection g. are bounded by consts. [we] attempt to remove
   the degree bound, we provide a polynomial-time alg. for the star case, &
   extend it to the general tree case based on an improved DP approach."
   -- 2004.11166@[arXiv]['20].

%T John Horton Conway
%D 2020
%K Conway, John, c2020, c202x, c20xx, zz0420, obit, obituary, biography, biog,
   maths, mathematics, mathematician, algebra, finite groups, group theory,
   surreal numbers, free will theorem, FWT, game of life,
   Cambridge University, Princeton
%X John Horton Conway FRS (26 Dec. 1937 - 11 Apr. 2020), d. covid19.
   "... Born and raised in Liverpool, Conway spent the first half of his career
   at the U. of Cambridge before moving to the U.S. state of New Jersey, where
   he held the title of John von Neumann Professor Emeritus at Princeton U. for
   the rest of his career. ..."
   -- JC@[wikip]['20],
      JC@[Princeton]['20],
      obit@[Princeton]['20],
      obit@[NYT][15/4/2020],
      obit@[doi:10.1038/d41586-020-01515-1][23/5/'20] Nature.
   [Also search for: maths Conway].

%T Katherine Johnson
%J Nature
%V 579
%P 341
%D 2020
%K Johnson, Katherine, obit, biog, NASA, STEM, woman, science, mathematics,
   zz0420, mathematician, Project Mercury, Apollo 11, Hidden Figures
%X Obituary, Katherine Johnson (1918-2020)
   -- [doi:10.1038/d41586-020-00749-3]['20].
   Also see Science, 368(6491), pp.591, 8/5/2020
   -- [doi:10.1126/science.abc1546]['20].

%A A. M. Lesk
%T Molecular speleology: the exploration of crevices in proteins for
   prediction of binding sites, design of drugs and analysis of
   surface recognition
%J Acta Cryst.
%V A42
%P 83-85
%D 1986
%K jrnl, MolBio, AMLesk, c1986, c198x, c19xx, zz0420, protein 3D structure,
   surface, active site, binding site, pocket, ligand, inhibitor, drug design
%X "A method is described for analyzing molecular-surface complementarity,
   inc. the binding of ligands to proteins or the interaction of elts of
   secondary struct. in protein interiors. A computer program can identify &
   model molecules that satisfy general criteria for good binding affinity.
   Computational tests are presented. This approach is likely to have useful
   application in the analysis of surface recognition in proteins, inc. the
   identification of binding sites, & in the design of drugs for specific
   targets, by (i) suggesting potential pharmacophores to the medicinal chemist
   for further computational analysis or laboratory testing, (ii) suggestion of
   derivatives of a known ligand to enhance its affinity, or (iii) searching a
   data base of known drugs for a match to the predicted ligand."
   -- [doi:10.1107/S010876738609983X]['20].
   [Also search for: MolBio protein surface] and [also search: for AMLesk].

%T The BCG World Atlas
%D ?
%K zz0420, BCG, tuberculosis, TB, vaccine, vaccination, trained immunity,
   human health, data, medical, medicine, public health policy, policies
%X Au: 1950s-mid 1980s @ school age.
   UK: 1953-2005 @ age 12-13y.        ... etc.
   -- [www]['20].
   [Also search for: BCG vaccine].

%A N. van Doremalen
%A et al
%T Aerosol and surface stability of SARS-CoV-2 as compared with SARS-CoV-1
%J NEJM
%M MAR
%D 2020
%K jrnl, NEJM, c2020, c202x, c20xx, zz0420, Wuhan, China, covid19, covid 19,
   SARS-CoV-2, SARSCoV2, SARS2, coronavirus, pandemic, corona virus, survival,
   human health, risks
%X "... SARS-CoV-2 remained viable in aerosols throughout the duration of our
   experiment (3 hours), with a redn in infectious titer from 103.5 to 102.7
   TCID_50 per liter of air. ... SARS-CoV-2 was more stable on plastic &
   stainless steel than on copper & cardboard, & viable virus was detected up to
   72h after application to these surfaces (Figure 1A), although the virus
   titer was greatly reduced (from 103.7 to 100.6 TCID_50 per milliliter of
   medium after 72h on plastic & from 103.7 to 100.6 TCID_50 per milliliter
   after 48 hours on stainless steel). ..."
    -- [doi:10.1056/NEJMc2004973]['20].
   [Also search for: covid19].

%A S. D. Evans
%A I. V. Hughes
%A J. G. Gehling
%A M. L. Droser
%T Discovery of the oldest bilaterian from the Ediacaran of South Australia
%J PNAS
%V ?
%M MAR
%D 2020
%K jrnl, PNAS, c2020, c202x, c20xx, zz0420, early animal, bilaterian,
   Ediacara Biota, Ikaria wariootia, origins, fossil, South Australia
%X "The transition from simple, microscopic forms to the abundance of complex
   animal life that exists today is recorded within soft-bodied fossils of the
   Ediacara Biota (571 to 539Ma). Perhaps most critically is the 1st appearance
   of bilaterians - animals with two openings & a through-gut-during this
   interval. ... Here, we describe the fossil Ikaria wariootia, one of the
   oldest bilaterians identified from South Australia. This organism is
   consistent with predictions based on modern animal phylogenetics that the
   last ancestor of all bilaterians was simple & small & represents a rare
   link between the Ediacaran & the subsequent record of animal life."
   -- [doi:10.1073/pnas.2001045117]['20].
   Also see the [bbc][24/3/2020].

%A R. Giblin
%A J. Kennedy
%A C. Pelletier
%A J. Thomas
%A K. G. Weatherall
%A F. Petitjean
%T What can 100,000 books tell us about the international public library
   e-lending landscape?
%J Inf. Res.
%V 24
%N 3
%M MAR
%D 2019
%O Sydney Law School, Res. Paper #19/21
%K eBook, eBooks, books, c2019, c201x, c20xx, zz0420, public library, libraries,
   lending, eLending, access, availability, licence, price, cost,
   Au, NZ, UK, USA, Canada
%X "We investigated the relative availability of e-books to libraries for
   e-lending in five English-language countries, and analysed their licence
   terms and prices. ..."
   -- [www]['20].
   Also see [elendingproject]['20].
   [Also search for: eBooks public access].

%A R. Giblin
%A J. Kennedy
%A K. Weatherall
%A D. Gilbert
%A J. Thomas
%A F. Petitjean
%T Available, but not accessible? Investigating publishers' e-lending licensing
   practices
%J Inf. Res.
%V 24
%N 3
%O paper 837
%M SEP
%D 2019
%K paper837, public library, libraries, c2019, c201x, c20xx, zz0420, eBook,
   eBooks, books, access, accessibilty, availability, literature, aggregator,
   publisher, publishing, copyright, licence, price, cost, Rakuten OverDrive,
   eLending, loans, borrowing, Au, NZ, UK, USA, Canada
%X "We report our mixed-methods investigation of publishers' licensing
   practices, which affect the books public libraries can offer for e-lending.
   ... sampled titles offered by e-book aggregators to public libraries across
   Australia, New Zealand, Canada, the United States and United Kingdom. ...
   licence terms and price ... While availability was better than anticipated,
   licensing practices make it infeasible for libraries to purchase certain
   kinds of e-book, particularly older titles. Confidentiality requirements make
   it difficult for libraries to shop (and aggregators to compete) on price and
   terms."
   -- [www]['20],
      [www]['20].
   Also see [elendingproject]['20].
   [Also search for: open access research].

%A C. Woolston
%T Australian junior scientists report damaging lack of support at work
%J Nature
%V 579
%P 457-458
%M MAR
%D 2020
%K news, views, Christian, Doran, c2020, c202x, c20xx, zz0420, university,
   academia, scientific research, management, ethics, bullying, Australia,
   Australian, scientist, STEM, PhD, postdoc, postgrad, faculty
%X "System built on short-term contracts & grants causes many to consider
   leaving. Four out of five early-career researchers in Australia have
   considered leaving science or their jobs because of factors inc. questionable
   research practices & an absence of institutional support, suggests a survey
   of 658 postdocs & junior faculty members. ..."
   -- [doi:10.1038/d41586-020-00687-0]['20].
 * Report@[bioRxiv][20/2/2020].
   [Also search for: University management].

%A C. Houston
%T Melbourne Uni pays out $700,000 to PhD student 'groped' by professor
%J The Age
%M APR
%D 2020
%K news, MeToo, c2020, c202x, c20xx, zz0420, University of Melbourne, UniMelb,
   Computer Science, Department, Faculty, Professor Ramamohanarao Rao Kotagiri,
   Prof, Comp Sci Dept, PhD student, academic, misconduct, sexual harassment,
   #metoo, meto, assault, scandal, bullying, management, Go8, Australia,
   Victoria, Supreme Court
%X 11 April 2020:  "The U. of Melbourne has paid $700,000 in compensation to a
   former PhD student who alleges she was sexually assaulted and harassed by a
   professor, amid claims the prestigious institution concealed previous
   complaints ... The accused academic, Professor Ramamohanarao 'Rao' Kotagiri,
   will be 'retiring on April 17 to pursue other opportunities', according to
   an email recently sent to colleagues by a senior university figure. ...
   Between June 2014 and April 2016, the 69-year-old academic is accused of ...
   filed with the court in 2017. ... An indep. investigator appointed by the
   uni. allegedly uncovered other complaints made by at least two former
   students against Prof. K. ..."
   -- The Age [www][11/4/2020].
   [Also search for: academic misconduct]  and  [also search for: MeToo].

%A R. Van Noorden
%T Nature to join open-access Plan S, publisher says
%J Nature
%M APR
%D 2020
%K journal Nature, c2020, c202x, c20xx, zz0420, open access, OA, Plan S, PlanS,
   publishing, science, scientific literature, papers, research,
   hybrid, transformative journals, free, paywall, paywalls
%X "... Springer Nature says it commits to offering researchers a route to
   publishing open access in Nature and most Nature-branded journals from 2021.'
   ... But Lisa Hinchliffe, a librarian at the U. of Illinois at Urbana-Ch.,
   says the changed rules show that publishers have successfully pushed back
   against Plan S, softening its guidelines and expectations - in particular
   in the case of hybrid journals, which publish some content openly & keep
   other papers behind paywalls. 'The coalition continues to take actions that
   rehabilitate hybrid journals into compliance rather than taking the hard
   line of unacceptability originally promulgated,' she says. ..."
   -- [doi:10.1038/d41586-020-01066-5]['20].
   [Also search for: research open access].

%A J. Oesterle
%T Novelle approaches du "theorem de Fermat"
%J Asterisque, Seminaire Bourbaki, exp 694
%V 161
%P 165-186
%D 1988
%K maths, seminar, c1988, c198x, c19xx, zz0420, ABC conjecture, defn,
   prime number, theory, numbers, square free, radical, number theory,
   Fermat's, Fermats, last theorem, diophantine, Masser, Mochizuki
%X '... three +ve integers, a, b & c [...], which have no common factor &
   satisfy a+b=c. If d denotes the product of the distinct prime factors of abc,
   the conjecture essentially states that d is rarely much smaller than c. ...
   the radical n, rad(n), is the product of the distinct prime factors of n. ...
   it turns out that "usually" c < rad(abc). The abc conjecture deals with the
   exceptions. Specifically, it states that for every eps > 0, there exist only
   finitely many triples (a,b,c) of +ve coprime ints with a+b=c s.t.
   c > rad(abc)**(1+eps). ...'
   -- [wikip].
   (2012: Possible proof by Mochizuki@[Kyoto-U]['17]
   -- various.
    2020: Also see [www][4/2020].)

%A I. Bezakova
%A A. Kalai
%A R. Santhanam
%T Graph model selection using maximum likelihood
%J ICML
%P 105-112
%M JUN
%D 2006
%K conf, ICML, ICML06, ICML23, c2006, c200x, c20xx, zz0420, maths, graph, model,
   graphModel, random, probability, likelihood, power law,
   preferential attachment, small world
%X "... propose a model seln criterion for graph models. Since each model is in
   fact a prob. distn over graphs, we suggest using [M.L.] to compare g.models &
   select their parameters. Interestingly, for the case of g.ms., computing
   likelihoods is a difficult algorithmic task. However, we design & implement
   MCMC algs for computing the [M.L.] for 4 popular models: a power-law random
   g.m., a preferential attachment m., a small-world m., & a uniform random
   g.m.. We hope that this novel use of M.L. will objectify comparisons between
   graph models."  [via K.L.]
   -- [doi:10.1145/1143844.1143858]['20].
   [Also search for: graphModel].

%A E. Barszcz
%T A blind permutation similarity algorithm
%J arXiv
%M MAR
%D 2020
%K TR, c2020, c202x, c20xx, zz0420, matrix, matrices, blind, permutation,
   similar, similarity, algorithm, invertible, transformation
%X "... a polynomial blind alg. that determines when two square matrices, A &
   B, are permutation similar. The shifted & translated matrices (A+bI+gJ) &
   (B+bI+gJ) are used to color the vertices of two square, edge weighted, rook's
   graphs. Then the orbits are found by repeated symbolic squaring of the vertex
   colored & edge weighted adjacency matrices. Multisets of the diagonal symbols
   from non-permutation similar matrices are distinct within a few iterations,
   typically four or less."
   -- 2003.11998@[arXiv]['20].
   (Also see, "... In the definition of similarity, if the matrix P can be
    chosen to be a permutation matrix then A and B are permutation-similar ..."
   -- MSim@[wikip]['20].)

%A D. Alderson
%A J. C. Doyle
%A L. Li
%A W. Willinger
%T Towards a theory of scale-free graphs: Definition, properties, and
   implications
%J Internet Maths.
%V 2
%N 4
%P 431-523
%D 2005
%K jrnl, c2005, c200x, c20xx, zz0420, maths, graph, model, graphModel,
   scale free, scaleFree, internet, www
%X "... there is unfortunately no consistent, precise definition of scale-free
   graphs & few rigorous proofs of many of their claimed properties. In fact, it
   is easily shown that the existing theory has many inherent contradictions &
   that the most celebrated claims regarding the Internet & biology are
   verifiably false. ... we introduce a structural metric that allows us to
   differentiate between all simple, connected gs. having an identical degree
   seq., which is of particular interest when that seq. satisfies a power law
   relationship. We demonstrate that the proposed structural metric yields
   considerable insight into the claimed properties of SF graphs & provides one
   possible measure of the extent to which a g. is scale-free. This structural
   view can be related to previously studied g. properties such as the various
   notions of self-similarity, likelihood, betweenness & assortativity. ...
   clarifies much of the confusion surrounding the sensational qualitative
   claims in the current literature, & offers a rigorous & quantitative
   alternative, while suggesting the potential for a rich & interesting theory.
   This paper is aimed at readers familiar with the basics of Internet
   technology & comfortable with a theorem-proof style of exposition, but who
   may be unfamiliar with the existing literature on scale-free networks.
   -- 1150477667@[eucl'd]['20].
   [Also search for: graphModel].

%A J. Conway
%A S. Kochen
%T The free will theorem
%J Foundations of Physics
%V 36
%P 1441-1473
%D 2006
%K jrnl, Physics, maths, c2006, c200x, c20xx, zz0420, free will theorem, FWT,
   spin, fin, experiment, measurement, quantum mechanics, entanglement,
   determinism, information, past, cause, causal, causality,
   elementary particles
%X "On the basis of three physical axioms, we prove that if the choice of a
   particular type of spin 1 experiment is not a fn of the information
   accessible to the experimenters, then its outcome is equally not a fn of the
   info. accessible to the particles. We show that this result is robust, &
   deduce that neither hidden variable theories nor mechanisms of the GRW type
   for wave fn collapse can be made relativistic & causal. We also establish the
   consistency of our axioms & discuss the philosophical implications."
   -- [doi:10.1007/s10701-006-9068-6]['20].
   "... states that if we have a free will in the sense that our choices are
   not a function of the past, then, subject to certain assumptions, so must
   some elementary particles. ..."
   -- FWT@[wikip]['20].
   [Also search for: Conway Kochen free will] & [also search for: maths Conway].

%A J. H. Conway
%A S. Kochen
%T The strong free will theorem
%J Notices of the AMS
%V 56
%N 2
%P 226-232
%M FEB
%D 2009
%K jrnl, maths, physics, c2009, c200x, c20xx, zz0420, strong free will theorem,
   SWFT, FWT, quantum, information, cause, causality, past, determinism, spin,
   fin, min, experiment, measurement, rGRWf
%X "... [the FWT] asserts, roughly, that if indeed we humans have free will,
   then elementary particles already have their own small share of this valuable
   commodity. ...
   -- [www]['20].
   Also see,
   "... In their later 2009 paper, "The Strong Free Will Theorem", C. & K.
   replace the Fin axiom by a weaker one called Min, thereby strengthening the
   theorem. Min asserts only that two experimenters separated in a space-like
   way can make choices of measurements indep. of each other. In particular it
   is not postulated that the speed of transfer of all info. is subject to a
   maximum limit, but only of the particular info. about choices of
   measurements. In 2017, K. argued that Min could be replaced by Lin -
   experimentally testable Lorentz covariance. ..."
   -- FWT@[wikip]['20].
   [Also search for: Conway Kochen free will].

%A H. Naganuma
%A D. Hendrian
%A R. Yoshinaka
%A A. Shinohara
%A N. Kobayashi
%T Grammar compression with probabilistic context-free grammar
%J arXiv
%M MAR
%D 2020
%K TR, c2020, c202x, c20xx, zz0420, text compression, CFG, PCFG, string,
   probabilistic context free grammar, compress, straight line program,
   straightLineProgram, SLP
%X "We propose a new approach for universal lossless text comp., based on
   grammar comp.. In the lit., a target string T has been compressed as a CFG G
   in Chomsky normal form satisfying L(G)={T}. Such a g. is often called a
   straight-line program (SLP). ... we consider a prob. gram. G that generates
   T, but not nec. as a unique elt of L(G). In order to recover the original
   text T unambiguously, we keep both the grammar G & the derivation tree of T
   from the start symbol in G, in compressed form. We show some simple evidence
   that our proposal is indeed more efficient than SLPs for certain texts, both
   from theoretical & practical points of view."
   -- 2003.08097@[arXiv][18/3/2020].
   (Also see SLP@[wikip]['21].)

%A G. Navarro
%T Indexing highly repetitive string collections
%J arXiv
%M APR
%D 2020
%K TR, c2020, c202x, c20xx, zz0420, strings, index, indexing, repetitive,
   repetition, repeats, data structure, compress, MolBio, bioinformatics
%X "Two decades ago, a breakthrough in indexing string collections ...
   [but] the string collections experienced a growth that outperforms Moore's
   Law ... [however] many of these rapidly growing string collections are highly
   repetitive ...  a new set of techniques has been developed in order to
   properly exploit [repetition]. ...  In this survey we cover the algorithmic
   developments that have led to these data structures. We describe the distinct
   compression paradigms that have been used to exploit repetitiveness ..."
   -- 2004.02781@[arXiv][6/4/2020].
   [Also search for: string index].