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

Glookbib search for: zz0219

%A A. Dumitrescu
%T Finding a mediocre player
%J arXiv
%M JAN
%D 2019
%K TR, c2019, c201x, c20xx, zz0219, mediocre, player, algorithm, pick, find,
   rank, ranking, median, Yao, 1974
%X "Consider a totally ordered set S of n elements; [eg] a set of tennis players
   & their rankings. ... Following Frances Yao (1974), an elt (player) is said
   to be (i,j)-mediocre if it is neither among the top i nor among the bottom j
   elts of S. More than 40 years ago, Yao suggested a stunningly simple alg.
   for finding an (i,j)-mediocre elt: Pick i+j+1 elts arbitrarily & select the
   (i+1)-th largest among them. She also asked: 'Is this the best alg.?' No one
   seems to have found such an alg. ever since. We first provide a deterministic
   alg. that beats the worst-case comparison bound in Yao's alg. for a large
   range of values of i ... We then repeat the exercise for randomized algs; the
   avg. # of comparisons of our alg. beats the avg. comparison bound in Yao's
   alg. for another large range of values of i ... the improvement is most
   notable in the symmetric case i=j. [&] the tight bound obtained in the
   analysis of Yao's alg. allows us to give a definite answer for this class of
   algs.. In summary, we answer Yao's question as follows: (i) 'Presently not'
   for deterministic algs. & (ii) 'Definitely not' for randomized algs. (In
   fairness, it should be said however that Yao posed the question in the
   context of deterministic algs..)
   -- 1901.09017@[arXiv]['19].
   (The problem is a little like the select (the med-ian) problem.
    A mediocre value could be used as the pivot in queeksort.)

%A S. Lin
%A R. Rado
%T Computer studies of Turing machine problems
%J JACM
%V 12
%N 2
%P 196-212
%M APR
%D 1965
%K jrnl, JACM, c1965, c196x, c19xx, zz0219, busy beaver, problem, halting
%X -- [acm]['19],
   or [doi:10.1145/321264.321270]['19].
   (Also see,
   "The results of this paper had already appeared in part in Lin's 1963
   doctoral dissertation, under Rado's guidance. Lin & Rado prove that
   SUM(3)=6 and S(3)=21 by proving that all 3-state 2-symbol TMs which don't
   halt within 21 steps will never halt. (Most are proven automatically by a
   computer program, however 40 are proven by human inspection."
   -- BB@[wikip['19].)

%A M. Bentert
%A p. Skowron
%T Comparing election methods where each voter ranks only few candidates
%J arXiv
%M JAN
%D 2019
%K TR, c2019, c201x, c20xx, zz0219, election, vote, voting, system, preference,
   preferential, Borda, politics, rank, rankings
%X "... We ask how well certain election rules (focusing on positional scoring
   rules & the Minimax rule) can be approximated from partial preferences
   collected through one of the following procedures: (i) randomized - we ask
   each voter to rank a random subset of L candidates, & (ii) deterministic - we
   ask each voter to provide a ranking of her L most preferred candidates (the
   L-truncated ballot). We establish theoretical bounds on the approximation
   ratios & we complement our theoretical analysis with computer simulations. We
   find that mostly (apart from the cases when the preferences have no or very
   little structure) it is better to use the randomized approach. While we
   obtain fairly good approximation guarantees for the Borda rule already for
   L=2, for approximating the Minimax rule one needs to ask each voter to
   compare a larger set of candidates in order to obtain good guarantees."
   -- 1901.10848@[arXiv]['19].

%A P. Davies
%T The Demon in the Machine: How Hidden Webs of Information are
   Finally Solving the Mystery of Life
%I AllenLane
%P 320
%M SEP
%D 2018
%K book, text, c2018, c201x, c20xx, zz0219, life, definition, information,
   entropy
%X 1st ed 2018, hb us$17; uk us isbn:024130959X; uk us isbn13:978-0241309599.
   "... proposes a radical vision of biology which sees the underpinnings of
   life as similar to circuits and electronics, arguing that life as we know it
   should really be considered a phenomenon of information storage. ..."
   [Also search for: life definition].

%A P. Azouly
%T Small research teams 'disrupt' science more radically than large ones
%J Nature
%V 566
%N 7743
%P ?
%M FEB
%D 2019
%K news, views, c2019, c201x, c20xx, zz0219, scientific research, progress,
   teams, paper, papers, citation, impact, KPI, KPIs, small, research grant,
   grants, ARC, NIH, publish, perish, Wu, Wang, Evans
%X "The application of a new citation metric prompts a reassessment of the
   relationship between the size of scientific teams and research impact, &
   calls into question the trend to emphasize 'big team' science. ...
   Citation behaviour can also reflect strategic considerations, such as
   currying favour with referees or editor ... Wu and colleagues ... describe &
   validate a citation-based index of 'disruptiveness' that has previously been
   proposed for patents. ..."
   -- [doi:10.1038/d41586-019-00350-3]['19].
   [Also search for: scientific progress].

%A L. Wu
%A D. Wang
%A J. A. Evans
%T Large teams develop and small teams disrupt science and technology
%J Nature
%V 566
%N ?
%P 378-382
%M FEB
%D 2019
%K jrnl, c2019, c201x, c20xx, zz0219, scientific research, progress, team,
   paper, papers, citation, impact, KPI, KPIs, small, research grant, grants,
   ARC, NIH, disruption, disruptive, new, idea, ideas, creativity, Hindex,
   Sleeping Beauty, SBindex, Web of Science, WOS, software, patent,
   publish, perish
%X "... [trend] today is the growth of large teams in all areas ...
   Here we analyse more than 65 million papers, patents & s/w products that span
   the period 1954-2014, & demonstrate that across this period smaller teams
   have tended to disrupt sci. & tech. with new ideas & opportunities, whereas
   larger teams have tended to develop existing ones. ... Observed differences
   between small & large teams are magnified for higher-impact work, with small
   teams known for disruptive work & large teams for developing work. ...
   science policies should aim to support a diversity of team sizes."
   -- [doi:10.1038/s41586-019-0941-9][13/2/'19],
      [www]['19].
   [Also search for: scientific progress] and [also search for: publish perish].

%A O. Chang
%A H. Lipson
%T Seven myths in machine learning research
%J arXiv
%M FEB
%D 2019
%K TR, views, c2019, c201x, c20xx, zz0219, AI, risks, stats, myth, myths,
   reproducibility, deep, tensorflow, NN, ANN, image, images, validation,
   training, test, testing
%X "We present seven myths commonly believed to be true in machine learning
   research, circa Feb 2019. This is an archival copy of the blog postat
[crazyoscarchang.github.io/2019/02/16/seven-myths-in-machine-learning-research/]
   Myth 1: TensorFlow is a Tensor manipulation library ...
   Myth 2: Image datasets are representative of real images found in the wild
   Myth 3: Machine Learning researchers do not use the test set for validation
   Myth 4: Every datapoint is used in training a neural network
   Myth 5: We need (batch) normalization to train very deep residual networks
   Myth 6: Attention > Convolution
   Myth 7: Saliency maps are robust ways to interpret neural networks
   -- 1902.06789@[arXiv]['19].
   [Also search for: NN ANN reproducibility].

%A M. Gardner
%T Mathematical Games, Nov. 1977, in which joining sets of points by
   lines leads into diverse (and diverting) paths
%J Sci. Amer.
%M NOV
%D 1977
%K c1977, c197x, c19xx, zz0219, Graham's number, Grahams, large, big, enormous,
   vast, integers, Ramsey theory, g64, graphs, maths, uparrow notation
%X SciAm pdf@[www]['19] us$8,
   also [doi:10.1038/scientificamerican1177-18]['19] us$8.
   (Also see,
   "Graham's number is an enormous number that arises as an upper bound on the
   answer of a problem in the mathematical field of Ramsey theory. It is named
   after mathematician Ronald Graham, who used the number as a simplified
   explanation of the upper bounds of the problem he was working on in
   conversations with popular science writer Martin Gardner. ..."
   -- GNum@[wikip]['19].)

%A E. Schrodinger
%T What is Life?
%I MacmillanCo
%P 91
%D 1945
%K book, Erwin Schrodinger, c1945, c194x, c19xx, zz0219, life, definition,
   mind, matter, philosophy
%X 1945, hb us$45, asin:B000JTFNAO.
   And a CUP reprint 2012, also with 'Mind and Matter', pp.200,
   pb us$15; uk us isbn:1107683653, uk us isbn13:978-1107604667.
   [Also search for: life definition].

%A A. Kempf
%T Quantum Gravity, Information Theory and the CMB
%J Foundn Physics
%V 48
%N 10
%M OCT
%P 1191-1203
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0219, Achim Kempf, quantum physics,
   information theory, CMB, fluctuations, field, fields, discrete, continuous,
   empty space, spacetime
%X "We review connections between the metric of spacetime[s.t.] & the quantum
   fluctuations of fields. We start with the finding that the s.t.metric can be
   expressed entirely in terms of the 2-pt correlator of the fluctuations of
   q.fields. We then discuss the open question whether the knowledge of only the
   spectra of the q.fluctuations of fields also suffices to determine the
   s.t.metric. ... of interest because spectra are geometric invariants & their
   quantization would, therefore, have the benefit of not requiring the modding
   out of diffeomorphisms. [&] we discuss the fact that spacetime at the Planck
   scale need not nec. be either discrete or cts. Instead, results from
   information theory show that spacetime may be simultaneously discrete & cts
   in the same way that information can. Finally, we review the recent finding
   that a covariant natural ultraviolet cutoff at the Planck scale implies a
   signature in the cosmic microwave background (CMB) that may become
   observable."  [57 refs.]
   -- [doi:10.1007/s10701-018-0163-2]['19].
   (AK at [uwaterloo]['19].)

%A A. Clare
%A J. W. Daykin
%T Enhanced string factoring from alphabet orderings
%J IPL
%V 143
%P 4-7
%M MAR
%D 2019
%K jrnl, IPL, c2019, c201x, c20xx, zz0219, string, strings, Lyndon word, words,
   LyndonWord, algorithm, factoring, AClare, Parikh
%X "... consider the concept of alphabet ordering in the context of string
   factoring. We propose a greedy alg. that produces Lyndon factorizations with
   small #s of factors which can be modified to produce large #s of factors. For
   the technique we introduce the Exponent Parikh vector. Applications &
   research directions derived from circ-UMFFs are discussed."
   -- [doi:10.1016/j.ipl.2018.10.011]['19].
   [Also search for: Lyndon factorization]  &  [also search for: Lyndon words].
   (Also see [Factors].)

%A H. Yamamoto
%T A faster algorithm for finding shortest substring matches of a
   regular expression
%J IPL
%V 143
%P 56-60
%M MAR
%D 2019
%K jrnl, IPL, c2019, c201x, c20xx, zz0219, string, regular expression, regexp,
   match, NFA, NFSA, NFSM, algorithm, text, search, searching,
   Thompson automaton
%X "Consider a reg.exp. r of length m & a text string T of length n over an
   alphabet S. Then, the RE shortest substring search problem is to find all
   shortest substrings of T matching r. The previous alg. proposed by Clarke &
   Cormack uses an eps-free nondeterministic finite automaton (NFA) & runs in
   O(ksn) time and O(s) space, where k is the max. # of outgoing transitions for
   any state & symbol, & s is the # of states. Generally, an eps-free NFA
   obtained from a regexp. has s=O(m) & k=O(m); thus the alg. takes O(m^2n) time
   & O(m) space. We propose a faster alg. that runs in O(mn) time O(m) space.
   [It] is based on a Thompson automaton which is an NFA with eps-transitions."
   -- [doi:10.1016/j.ipl.2018.12.001]['19].
   [Also search for: regular expression].

%A T. Nishimoto
%A Y. Tabei
%T Conversion from RLBWT to LZ77
%J arXiv
%M FEB
%D 2019
%K TR, c2019, c201x, c20xx, zz0219, compressed, string, strings, conversion,
   LZ, LZ77, BWT, RLBWT, Policriti, Prezza, Kempa
%X "Converting a compressed format of a string into another compressed format
   without an explicit decompression ... We discuss the problem of converting
   the run-length Burrows-Wheeler Transform (RLBWT) of a string to Lempel-Ziv 77
   (LZ77) phrases of the reversed string. The 1st results with Policriti &
   Prezza's conversion alg. [Algorithmica 2018] were O(n log r) time & O(r)
   working space for length of the string n, # of runs r in the RLBWT, & # of
   LZ77 phrases z. Recent results with Kempa's conversion alg. [SODA 2019] are
   O(n/log n + r log^9(n)+z log^9(n)) time & O(n/log_s(n)+rlog^8(n)) working
   space for the alphabet size σ of the RLBWT. ... we present a new c.alg. by
   improving P & P's c.alg. where dynamic data structures for general purpose
   are used. We argue that these dynamic DSs can be replaced & present new data
   structures for faster conversion. The time & working space of our c.alg. with
   new data structures are O(n min(log log n, sqrt((log r)/(log log r))))
   & O(r), resp.."
   -- 1902.05224@[arXiv]['19].

%A T. Schrijvers
%A B. C. D. S. Oliveira
%A P. Wadler
%T K. Marntirosian
%T COCHIS: Stable and coherent implicits
%J JFP
%V 29
%P e3
%M FEB
%D 2019
%K jrnl, JFP, c2019, c201x, c20xx, zz0219, Oliveira, data type, types, checking,
   implicit, overlapping, coherent, implicits, programming languages,
   COCHIS, Haskell, classes, Scala, Agda, Coq, Rust
%X "Implicit programming (IP) mechanisms infer values by type-directed
   resolution, making programs more compact & easier to read. Examples of IP
   mechanisms include Haskell's type classes, Scala's implicits, Agda's instance
   arguments, Coq's type classes & Rust's traits. ... heated debate: proponents
   of one school argue for the desirability of strong reasoning properties,
   while proponents of another school argue for the power & flexibility of local
   scoping or overlapping instances. The current state of affairs seems to
   indicate that the two goals are at odds ... presents COCHIS, the Calculus Of
   CoHerent ImplicitS, an improved variant of the implicit calculus that offers
   flexibility while preserving two key properties: coherence & stability of
   type substitutions. COCHIS supports polymorphism, local scoping, overlapping
   instances, 1st-class instances & higher-order rules, while remaining
   type-safe, coherent & stable under type substitution. ..."
   -- [doi:10.1017/S0956796818000242]['19].

%A B. Greenman
%A A. Takikawa
%A M. S. New
%A D. Feltey
%T How to evaluate the performance of gradual type systems
%J JFP
%V 29
%P e4
%M FEB
%D 2019
%K jrnl, JFP, c2019, c201x, c20xx, zz0219, gradual type, types, check, checking,
   Racket
%X "A sound gradual type system ensures that untyped components of a program can
   never break the guarantees of statically typed components. This assurance
   relies on runtime checks, which in turn impose performance overhead in
   proportion to the freq. & nature of interaction between typed & untyped
   components. The literature on gradual typing lacks rigorous description ...
   presents the 1st method for evaluating the performance of sound gradual type
   systems. The method quantifies both the absolute performance of a gradual
   type system & the relative performance of two implementations of the same
   gradual type system. To validate the method, the paper reports on its
   application to 20 programs & 3 implementations of Typed Racket."
   -- [doi:10.1017/S0956796818000217]['19].
   [Also search for: gradual type].

%A G. Gorman
%T Troll Hunting. Inside the World of online hate and its human fallout
%I HardieGrant
%P 304
%D 2019
%K book, text, c2019, c201x, c20xx, zz0219, internet, www, social media, nasty,
   troll, trolls, trolling, hate, cyberhate, threat, mysogyny, bully, bullying,
   altright, meepsheep, meta, facebook, twitter
%X 1st ed 2019; pb us$20; uk us isbn:1743794355; uk us isbn13:978-1743794357.
   "... What she discovered was both profoundly shocking and fascinating.
   Syndicates of highly organised predator trolls across the globe
   systematically set out to disrupt and disturb. Some want to highlight the
   media's alleged left-wing bias, some want to bring down capitalism, and
   some just want to have fun. Even if it means destroying someone's life..."
   [Also search for: trolling].