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

Glookbib search for: zz1021

%A J. Edmonds
%A R. M. Karp
%T Theoretical improvements in algorithmic efficiency for network flow problems
%J JACM
%V 19
%N 2
%P 248-264
%M APR
%D 1972
%K jrnl, JACM, c1972, c197x, c19xx, zz1021, maths, graph, graphs, network, flow,
   flows, max, maximum, Hitchcock transportation, augmenting path, min,
   minimum cost, problem, algorithm, Hungarian method, Ford Fulkerson
%X "... new algs. for the maximum flow problem, the Hitchcock transportation
   problem, & the general minimum-cost flow problem. ... the Ford-Fulkerson
   labeling method ... We show that, if each flow augmentation is made along an
   augmenting path having a min. # of arcs, then a max. flow in an n-node n/wk
   will be obtained after no more than ~(n a-n) augmentations; & then ...
   a max. flow will be determined within at most 1+logM/(M-1) if(t,S) augm's,
   where f*(t,s) is the value of the max. flow & M is the max. # of arcs across
   a cut. Next a new alg. is given for the min.-cost flow problem ..."
   -- [doi:10.1145/321694.321699]['21] or
      [doi:10.1007/3-540-36478-1_4]['21].
   (Also see HAlg@[wikip]['21], and
    "... max. flow in a flow network in O(|V|.|E|^2) time. ..."
    -- E_and_K@[wikip]['21].)
    [Also search for: Tomizawa graph].

%A R. Jonker
%A A. Volgenant
%T A shortest augmenting path algorithm for dense and sparse
   linear assignment problems
%J Computing
%V 38
%P 325-240
%D 1987
%K jrnl, c1987, c198x, c19xx, zz1021, maths, graph, graphs, augmenting path,
   linear assignment problem, algorithm
%X "... a shortest augmenting path alg. for the linear assignment problem. It
   contains new initialization routines & a special implementation of Dijkstra's
   shortest path method. For both dense & sparse problems computational
   experiments show this alg. to be uniformly faster than the best algs. from
   the lit.. A Pascal implementation is presented."
   -- [doi:10.1007/BF02278710]['21].
   [Also search for: maths graph assignment problem].
   (Also see HAlg@[wikip]['21].)

%A M. Kozlov
%T COVID-vaccine booster shot shows promise in Israeli study
%J Nature
%M SEP
%D 2021
%K news, c2021, c202x, c20xx, zz1021, covid-19, covid19, vaccine, pandemic,
   booster dose, vaccination, infection
%X "Older Israelis who have received a third dose of a COVID-19 vaccine are much
   less likely to test positive for SARS-CoV-2 or to develop severe COVID-19
   than are those who have had only two jabs, according to a highly anticipated
   study published on 15 Sept. ..."
   -- [doi:10.1038/d41586-021-02516-4]['21].
  Article: 'Protection of BNT162b2 Vaccine Booster against Covid-19 in Israel',
  NEJM, SEP, 2021
  "At least 12 days after the booster dose, the rate of confirmed infection was
  lower in the booster group than in the nonbooster group by a factor of 11.3
  ... In a secondary analysis, the rate of confirmed infection at least 12 days
  after v. was lower than the rate after 4 to 6 days by a factor of 5.4 ..."
  -- [doi:10.1056/NEJMoa2114255]['21].
  (Also see
  'COVID vaccine immunity is waning - how much does that matter?'
  Nature, 597, pp.606-607, SEP, 2021
  -- [doi:10.1038/d41586-021-02532-4]['21].)

%A S. C. Campbell-Staton
%T Ivory poaching and the rapid evolution of tusklessness in African elephants
%J Science
%V 374
%N 6566
%P 483-487
%M OCT
%D 2021
%K jrnl, c2021, c202x, c20xx, zz1021, elephant, tusk, tusks, loss, tuskless,
   ivory, poaching, Africa, selection
%X "... We examined the impacts of ivory poaching during the Mozambican Civil
   War (1977 to 1992) on the evolution of African savanna elephants (Loxodonta
   africana) ... Whole-genome scans implicated two candidate genes with known
   roles in mammalian tooth development (AMELX & MEP1a) ... One of these loci
   (AMELX) is assoc. with an X-linked dominant, male-lethal syndrome in humans
   that diminishes the growth of maxillary lateral incisors (homologous to
   e.tusks). ..."
   -- [doi:10.1126/science.abe7389]['21].
   (I recall 1st hearing about the increase in the % of
   tuskless elephants at a conf in the 1990s.)

%A T. Petricek
%T Composable data visualizations (a functional pearl)
%J JFP
%V 31
%M JUN
%D 2021
%K JFP, jrnl, FP, c2021, c202x, c20xx, zz1021, data, visualisation,
   visualization, Compost, compost.js
%X "Let's say we want to create the two charts in Fig.1. The chart on the left
   is a bar chart that shows two different values for each bar. The chart on the
   right consists of two line charts that share the x axis with parts of the
   timeline highlighted using two different colors. ..."
   -- [doi:10.1017/S0956796821000046]['21].
   "... Compost is a plain JavaScript library. You use it by writing [js] code
   that generates a chart using some 15 basic Compost primitives."
   -- Compost@[g'thub]['21].

%A H. Nowotny
%T In AI We Trust: Power, Illusion and Control of Predictive Algorithms
%I Polity
%P 200
%M SEP
%D 2021
%K book, text, c2021, c202x, c20xx, zz1021, AI, data analytics, society, bias,
   technology, democracy, risks
%X 1st ed 2021; hb us$41; uk us isbn:1509548815; uk us isbn13:978-1509548811.
   "One of the most persistent concerns about the future is whether it will be
   dominated by the predictive algorithms of AI - and, if so, what this will
   mean for our behaviour, for our institutions and for what it means to
   be human. ..."

%A H. Else
%T China's clampdown on fake-paper factories picks up speed
%J Nature
%V ?
%M SEP
%D 2021
%K news, views, c2021, c202x, c20xx, zz1021, publish, perish, academic,
   misconduct, China, scientific research, fake, paper mill, PaperMill, mills
%X "As part of a misconduct crackdown, Chinese funders are penalizing
   researchers who commission sham journal articles from 'paper mills', but
   some say the measures still don't go far enough. ..."
   -- [doi:10.1038/d41586-021-02587-3]['21].
   [Also search for: publish perish]  and  [also search for: PaperMill].

%A D. Hemprich-Bennett
%A D. Rabaiotti
%A E. Kennedy
%T Beware survivorship bias in advice on science careers
%J Nature
%V ?
%M OCT
%D 2021
%K news, views, c2021, c202x, c20xx, zz1021, science, academic, research,
   academia, career, careers, job, jobs, advice, survivor bias, luck,
   chance, fart, farting
%X "A major flaw in much scientific & academic career advice is survivorship
   bias. This is a common logical error, involving drawing conclusions based on
   those who have 'survived' a process - and are thus more visible than those
   who did not. In the case of sci. careers advice, the bias arises because
   those who manage to stick to their chosen career path are there to advise the
   next gen. of researchers on how to stay in their field. ..."
   -- [doi:10.1038/d41586-021-02634-z]['21].
   [Also search for: survivor bias].
   (Makes reference to: N. Caruso & D. Rabaiotti, 'Does it Fart',
   1st ed 2018, hb us$26; us us isbn:0316484156; uk us isbn13:978-0316484152.)

%A K. Siler
%A V. Lariviere
%A P. Vincent-Lamarre
%A C. R. Sugimoto
%T Predatory publishers' latest scam: bootlegged and rebranded papers
%J Nature
%V 598
%P 563-565
%M OCT
%D 2021
%K news, views, c2021, c202x, c20xx, zz1021, predatory, dodgy, journal,
   journals, publisher, publishing, scam, deception, fake, bootleg, hijack,
   plagiarism, misconduct, academia, scientific research, paper, OMICS, Hilaris,
   Longdom, iMedPub, Lacuna
%X "To thwart publishing rackets that undermine scholars & scholarly publishing,
   legitimate jrnls should show their workings. ..."
   -- [doi:10.1038/d41586-021-02906-8]['21].
   (Also see Lacuna [www]['21].)
   [Also search for: misconduct publishing].

%A S. W. Hawking
%T Information loss in black holes
%J arXiv
%M JUL
%D 2005
%K TR, physics, c2005, c200x, c20xx, zz1021, black hole, paradox, information,
   loss, unitary, unitarity, cosmology
%T "The question of whether information is lost in black holes is investigated
   using Euclidean path integrals. The formation & evaporation of black holes is
   regarded as a scattering problem with all measurements being made at
   infinity. This seems to be well formulated only in asymptotically AdS
   spacetimes. The path integral over metrics with trivial topology is unitary &
   information preserving. On the other hand, the path integral over metrics
   with non-trivial topologies leads to correlation functions that decay to
   zero. Thus at late times only the unitary information preserving path
   integrals over trivial topologies will contribute. Elementary quantum gravity
   interactions do not lose information or quantum coherence.
   -- hep-th/0507171@[arXiv]['21].
   [Also search for: black hole paradox].
   (Also see BHoleP@[wikip]['21].)

%A V. Choudhury
%A J. Karwowski
%A A. Sabry
%T Symmetries in reversible programming: From symmetric rig groupoids to
   reversible programming languages
%J arXiv
%M OCT
%D 2021
%K TR, c2021, c202x, c20xx, zz1021, reversible, computing, information, PL,
   rig groupoid, circuit, logic, symmetry, quantum computing
%X "The Pi family of reversible prog. langs. for boolean circuits is presented
   as a syntax of combinators witnessing type isomorphisms of algebraic
   datatypes. ... We establish a corr. between the syntactic groupoid of the
   language & a formally presented univalent subuniverse of finite types. ...
   Using the formalisation of our results, we show how to perform
   normalisation-by-eval'n, verification, & synthesis of reversible logic gates,
   motivated by examples from quantum computing."
   -- 2110.05404@[arXiv]['21].
   [Also search for: reversible computing].

%A Wei Yan
%A Sian-Jheng Lin
%T A tighter upper bound of the expansion factor for universal coding of
   integers and its code constructions
%J arXiv
%M SEP
%D 2021
%K TR, c2021, c202x, c20xx, zz1021, universal code, integer, expansion, bound
%X "... K^*_C is the infimum of the set of expansion factors. The optimal UCI
   is defined as a class of UCI possessing the smallest K^*_C. Based on prior
   research, the range of K^*_C for the optimal UCI is 2<=K^*_C<=2.75. Currently
   the code constructions achieve K_C=2.75 for UCI & K_C=3.5 for asymptotically
   optimal UCI. ... we propose a class of UCI, termed i code, to achieve
   K_C=2.5. This further narrows the range of K^*_C to 2<=K^*_C<=2.5. Next, a
   family of asymptotically optimal UCIs is presented, where their expansion
   factor infinitely approaches 2.5. Finally, a more precise range of K^*_C for
   the classic UCIs is discussed."
   -- 2109.08920@[arXiv]['21].
   [Also search for: integer universal code].

%A Shyan Akmal
%A Ce Jin
%T Near-optimal quantum algorithms for string problems
%K arXiv
%M OCT
%D 2021
%K TR, c2021, c202x, c20xx, zz1021, string, strings, substring,
   quantum algorithm, Lyndon word, LyndonWord
%X "We study q.algs. for several fundamental string problems, inc. Longest
   Common Substring, Lexicographically Minimal String Rotation, & Longest
   Square Substring. ... known to be solvable by near-linear time classical
   algs.. ... Longest Square Substring can be solved by a q.alg. in
   ~O(n^{2/3}) time. ... is an adaptation of the alg. by Le Gall & Seddighin
   (2020) for the Longest Palindromic Substring problem, but uses additional
   techniques to overcome the difficulty that binary search no longer applies.
   Our techniques naturally extend to other related string problems, such as
   Longest Repeated Substring, Longest Lyndon Substring, & Minimal Suffix."
   -- 2110.09696@[arXiv]['21].
   [Also search for: strings quantum algorithm].

%A J. Sterling
%A R. Harper
%T Logical relations as types: Proof-relevant parametricity for program modules
%J JACM
%V 68
%N 6
%P 1-47
%M DEC
%D 2021
%K jrnl, JACM, c2021, c202x, c20xx, zz1021, dependent type, checking, types,
   logic, proof
%X "The theory of program modules ... we contribute a new synthetic approach to
   phase separated parametricity based on the slogan logical relations as types,
   by iterating our modal account of the phase distinction. We axiomatize a
   dependent type theory of parametricity structures using two pairs of
   complementary modalities (syntactic, semantic) & (static, dynamic),
   substantiated using the topos theoretic Artin gluing construction. Then, to
   construct a simulation between two implementations of an abstract type, one
   simply programs a third implementation whose type component carries the
   representation invariant."  [online Nov 2021].
   -- [doi:10.1145/3474834]['21].
   !?-)

%A J. G. Siek
%A P. Thiemann
%A P. Wadler
%T Blame and coercion: Together again for the first time
%J JFP
%V 31
%M OCT
%D 2021
%K jrnl, JFP, c2021, c202x, c20xx, zz1021, data type, types, static, dynamic,
   gradual typing, coercion, cast, Csharp, Dart, Pyret, Racket, VB, lambdaS,
   lambdaT, programming language
%X "C#, Dart, Pyret, Racket, TypeScript, VB: many recent languages integrate
   dynamic & static types via gradual typing. We systematically develop four
   calculi for gradual typing & the rel'ns between them ... Together, lambdaB,
   lambdaC, lambdaS & lambdaT provide a coherent foundation for design,
   implementation, & optimization of gradual types. We define translations from
   lambdaB to lambdaC, from lambdaC to lambdaS, & from lambdaS to lambdaT, ..."
   -- [doi:10.1017/S0956796821000101]['21].
   [Also search for: gradual type].