Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0617
%A K. Grace
%A J. Salvatier
%A A. Dafoe
%A B. Zhang
%A O. Evans
%T When will AI exceed human performance? Evidence from AI experts
%J arXiv
%M JUN
%D 2017
%K TR, c2017, c201x, c20xx, zz0617, AI, artificial intelligence, human, versus,
HAL, Terminator, singularity, robots, computing, technology, performance,
ability, society, social consequences, jobs, work, automation, profession,
futurology, prediction, zzPrediction, zz0124, zz0127, zz0149, zz0153
%X "... we report the results from a large survey of machine learning
researchers on their beliefs about progress in AI. Researchers predict AI
will outperform humans in many activities in the next ten years, such as
translating languages (by 2024), writing high-school essays (by 2026),
driving a truck (by 2027), working in retail (by 2031), writing a bestselling
book (by 2049), and working as a surgeon (by 2053). Researchers believe there
is a 50% chance of AI outperforming humans in all tasks in 45 years and of
automating all human jobs in 120 years, with Asian respondents expecting
these dates much sooner than North Americans. These results will inform
discussion amongst researchers and policymakers about anticipating and
managing trends in AI."
-- 1705.08807@[arXiv]['17].
[Also search for: zzPrediction] for other predictions.
(Some would say that LLmodels had achieved 'translation' and
'high-school essays' by 2023. [Also search for: LLmodel AI].)
%A R. Curticapean
%A H. Dell
%A D. Marx
%T Homomorphisms are a good basis for counting small subgraphs
%J arXiv
%M MAY
%D 2017
%O STOC 2017
%K TR, c2017, c201x, c20xx, zz0617, graph, maths, subgraph, count, enumerate,
enumeration, counting, homomorphism
%X "We introduce graph motif parameters, a class of g. parameters that depend
only on the freqs. of const-size induced subgraphs. Classical works by Lovasz
show that many interesting quantities have this form, inc., for fixed graphs
H, the # of H-copies (induced or not) in an input graph G, & the # of
homomorphisms from H to G. ... obtain faster algs. for counting subgraph
copies of fixed graphs H in host graphs G: For graphs H on k edges, we show
how to count subgraph copies of H in time k^O(k).n^(0.174k+o(k)) by a
surprisingly simple alg.. This improves upon prev. known running times, such
as O(n^(0.91k+c)) time for k-edge matchings or O(n^(0.46k+c)) time for
k-cycles. [&] we prove a general complexity dichotomy for evaluating g.motif
parameters: Given a class C of such params, we consider the problem of
evaluating 'f in C' on input g. G, parameterized by the # of induced subgs.
that f depends upon. For every rec. enum. class C, we prove the above problem
to be either FPT or #W[1]-hard, with an explicit dichotomy criterion. This
allows us to recover known dichotomies for counting subgs., induced subgs., &
homomorphisms in a uniform & simplified way, together with improved lwbs.
... extend g.motif params. to colored subgs. & prove a complexity trichotomy:
For vertex-colored gs. H & G, where H is from a fixed class Hc, we want to
count color-preserving H-copies in G. We show that this problem is either
polynomial-time solvable or FPT or #W[1]-hard, & that the FPT cases indeed
need FPT time under reasonable assumptions."
-- 1705.01595@[arXiv]['17].
[Also search for: enumerate subgraph] and [also search for: count subgraph].
%A M. Baek
%A T. Knudsen
%T Linear hashing is awesome
%J arXiv
%M JUN
%D 2017
%K TR, conf, FOCS16, c2017, c201x, c20xx, zz0617, linear, hash, hashing,
chaining, Dietzfelbinger
%X "We consider the hash function h(x)=((ax+b)mod p)mod n where a, b are chosen
uniformly at random from {0, 1, ..., p−1}. We prove that when we use h(x) in
hashing with chaining to insert n elts into a table of size n the
expected length of the longest chain is O^tilde(n^(1/3)). The proof also
generalises to give the same bound when we use the multiply-shift hash fn
by Dietzfelbinger et al. [J. of Alg. '97].
-- 1706.02783@[arXiv]['17].
%A G. Farr
%T Remembering Bill Tutte: Another brilliant codebreaker from World War II
%J The Conversation
%M MAY
%D 2017
%K Tutte, news, obit, biog, c2017, c201x, c20xx, zz0617, Bletchley Park,
Lorenz, code, Colossus, computer, history computing, cypher, break, breaking,
codebreaker, WW2, WWII
%X "One of the greatest mathematicians and codebreakers of the 20th century,
William (Bill) Tutte, was born a century ago this Sunday, May 14. ..."
-- [www]['17].
(Also see [B.Park].)
[Also search for: Bletchley Park] and [also search for: colossus].
%A D. I. Bolnick
%A W. E. Stutz
%T Frequency dependence limits divergent evolution by favouring rare immigrants
over residents
%J Nature
%V 546
%N 7657
%P 285-288
%M MAY
%D 2017
%K jrnl, biology, biol, c2017, c201x, c20xx, zz0617, evolution, parasites,
frequency-dependent, divergent, selection, diversity, histocompatibility,
speciation, ecology
%X "Two distinct forms of natural selection promote adaptive biological
diversity. Divergent seln occurs when different environments favour different
phenotypes, leading to increased differences between popns. Negative
frequency-dependent seln occurs when rare variants within a popn are favoured
over common ones, increasing diversity within popns. ... found -ve
freq.-dependence: survival was highest for the locally rare ecotype, rather
than natives. Also, individuals with locally rare major histocompatibility
complex (MHC) class IIb genotypes were infected by fewer parasites. This
negative freq.-dependent seln will tend to favour rare immigrants over common
residents, amplifying the effect of migration & undermining the efficacy of
divergent natural seln to drive popn differences. The only signal of
divergent seln was a tendency for foreign fish to have higher parasite loads
than residents, after controlling for MHC genotype rarity. Freq.-dependent
ecological interactions have long been thought to promote speciation. Our
results suggest a more nuanced view in which -ve freq. dependence alters the
fate of migrants to promote or constrain evol. divergence between popns."
-- [doi:10.1038/nature22351]['17] (online 5/2017).
%A E. Pennisi
%T Mysterious unchanging DNA finds a purpose in life
%J Science
%V 356
%N 6341
%P 892
%M JUN
%D 2017
%K news, views, c2017, c201x, c20xx, zz0617, MolBio, ultra conserved elements,
UCE, UCEs, DNA, ultraconserved, ARX gene, brain, development, hippocampus,
Dickel
%X "... at the Biology of Genomes meeting here, Dickel had presented what may be
the first compelling evidence of what these much-discussed stretches of DNA
do. ... researchers found 481 genome segments, 200 to more than 700 bases
long, that were 100% identical in humans, rats, and mice. These same segments
were at least 95% identical in chickens and dogs ... At first, knocking out
these elements, whether singly or in pairs, seemed to leave the mice
unaffected. But when Dickel and a developmental neuroscientist took a close
look at the brains of the mice, they detected abnormal numbers of neurons or
a shrunken hippocampus ..."
-- [doi:10.1126/science.356.6341.892]['17],
[www]['17].
%A J. Yin
%A et al
%T Satellite-based entanglement distribution over 1200 kilometers
%J Science
%V 356
%N 6343
%P 1140-1144
%M JUN
%D 2017
%K jrnl, physics, c2017, c201x, c20xx, zz0617, quantum, data transmission,
secure, communication, space, satellite, key distribution, encryption,
entangled, photons
%X "... Owing to channel loss, however, the previously achieved distance
was limited to ~100km. Here we demonstrate satellite-based distribution of
entangled photon pairs to two locations separated by 1203km on Earth, through
two satellite-to-ground downlinks with a summed length varying from 1600 to
2400km. We observed a survival of two-photon entanglement & a violation of
Bell inequality by 2.37+/-0.09 under strict Einstein locality conditions. The
obtained effective link efficiency is orders of magnitude higher than that of
the direct bidirectional transmission of the two photons through
telecommunication fibers."
-- [doi:10.1126/science.aan3211]['17].
[Also search for: quantum communication].
%A A. Abel
%A S. Adelsberger
%A A. Stzer
%T Interactive programming in Agda - Objects and graphical user interfaces
%J JFP
%V 27
%P e8
%M JAN
%D 2017
%K jrnl, JFP, FP, c2017, c201x, c20xx, zz0617, Agda, ooAgda, OOP, copattern,
copatterns, coinductive type, types, GUI, GUIs, computer programming language
%X "We develop a methodology for writing interactive and object-based programs
(in the sense of Wegner) in dependently typed FP languages. The methodology
is implemented in the ooAgda library. ooAgda provides a syntax similar to the
one used in object-oriented programming languages, thanks to Agda's copattern
matching facility. The library allows for the development of graphical user
interfaces (GUIs), including the use of action listeners ..."
-- [doi:10.1017/S0956796816000319]['17] (54pp).
(Also see Agda@[wikip][17].)
%A D. Hemenway
%T Fight the silencing of gun research
%J Nature
%V 546
%P 345-347
%M JUN
%D 2017
%K news, views, c2017, c201x, c20xx, zz0617, gun, guns, stats, statistics,
firearm, firearms, US, USA, law, death, gunshot, shooting, NRA, violence,
homicide, murder, suicide, quote, quotable
%X "In the half-century since the assassination of Martin Luther King, more
civilians in the United States have been killed with guns than American
soldiers have died in all US wars since the nation was founded in 1776.
Currently, on an average day, about 300 Americans are shot and 100 die from
gunshot wounds - in murders, attempted suicides or accidents ...
Among the world's two-dozen highest-income countries, the US has avg. rates
of non-gun crime & violence. But with many more guns & the weakest gun laws,
it has by far the most gun deaths per capita. An American 5- to 14-year-old
is more than 18 times more likely to be murdered with a gun, 11 times more
likely to use a gun to take their own life & 12 times more likely to be
killed in a gun accident than children of the same age in other high-income
countries. ..."
-- [doi:10.1038/546345a]['17].
[Also search for: gun usa].
%A C. F. Clements
%A et al
%T Body size shifts and early warning signals precede the historic collapse of
whale stocks
%J Nature Ecology and Evolution
%V 1
%P 0188
%D 2017
%K jrnl, eJrnl, c2017, c201x, c20xx, zz0617, whale, whales, size, stats, animal,
population size, decline, extinction, loss, marine, environment, ecology,
whaling, hunting, resources
%X "Predicting population declines is a key challenge in the face of global
environmental change. ... demonstrate that early warning signals can be
present not only in the abundance data, but also in the more reliable body
size data of wild popns. We show that during the period of commercial whaling
the mean body size of caught whales declined dramatically (by up to 4m over a
70-year period), leading to early warning signals being detectable up to 40y
before the global collapse of whale stocks. Combining abundance & body size
data can reduce the length of the time series required to predict collapse,
& decrease the chances of false positive early warning signals. ..."
-- [doi:10.1038/s41559-017-0188]['17].
%A T. Gagie
%A G. Navarro
%A N. Prezza
%T Fast locating with the RLBWT
%J arXiv
%M MAY
%D 2017
%K TR, c2017, c201x, c20xx, zz0617, strings, strings, BWT, RLBWT, index,
find, locate, search
%X "... FM-index based on the run-length compressed Burrows-Wheeler Transform
(RLBWT) of the text, which achieves excellent compression in practice &
allows us, given a pattern, to count its occurrences in the text quickly. ...
to be able to locate those occurrences quickly, however, the std soln is for
us to augment the RLBWT with a large sample of the suffix array (SA).
Recently, Policriti & Prezza (DCC 2016; Algorithmica, to appear) showed how
we can store O(r) SA values, where r is the # of runs in the BWT, s.t., while
counting the occurrences, we can locate at least one of them. ... we show how
we can store O(r) SA values such that, knowing the location of one occurrence
we can locate the others quickly. In other words, we show how to support fast
locating with the RLBWT."
-- 1705.10382@[arXiv]['17].
%A T. Nakamura
%A S. Inenaga
%A H. Bannai
%A M. Takeda
%T Order preserving pattern matching on trees and DAGs
%J arXiv
%M JUN
%D 2017
%K TR, c2017, c201x, c20xx, zz0617, search, match, matching, pattern, string,
tree, DAG, OPPM
%X "The order preserving pattern matching (OPPM) problem is, given a pattern
string p & a text string t, find all substrings of t which have the same
relative orders as p. ... we consider two variants of the OPPM problem where
a set of text strings is given as a tree or a DAG. We show that the OPPM
problem for a single pattern p of length m & a text tree T of size N can be
solved in O(m+N) time if the characters of p are drawn from an integer
alphabet of polynomial size. The time complexity becomes O(m log m + N) if
the pattern p is over a general ordered alphabet. We then show that the OPPM
problem for a single pattern & a text DAG is NP-complete."
-- 1706.00148@[arXiv]['17].
[Also search for: order preserving matching].
%A A. Stump
%T The calculus of dependent lambda eliminations
%J JFP
%V 27
%M e14
%M MAY
%D 2017
%K jrnl, JFP, FP, type, types, typing, c2017, c201x, c20xx, zz0617, dependent,
calculus of dependent lambda eliminations, Cedille
%X Modern constructive type theory is based on pure dependently typed
lambda calculus, augmented with user-defined datatypes. ... presents an
alternative called the Calculus of Dependent Lambda Eliminations, based
on pure lambda encodings with no auxiliary datatype system. New typing
constructs are defined that enable induction, as well as large eliminations
with lambda encodings. These constructs are constructor-constrained recursive
types, and a lifting operation to lift simply typed terms to the type level.
Using a lattice-theoretic denotational semantics for types, the language is
proved logically consistent. The power of CDLE is demonstrated through
several examples, which have been checked with a prototype implementation
called Cedille."
-- [doi:10.1017/S0956796817000053]['17].