Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz1019
%A S. Russell
%T Human Compatible: Artificial Intelligence and the Problem of Control
%I Viking
%P 352
%M OCT
%D 2019
%K book, text, c2019, c201x, c20xx, zz1019, AI, versus, human, robot,
convergence, HAL, Terminator, superintelligence, superintelligent
%X 1st ed 2019, hb us$28; uk is isbn:0525558616; uk us isbn13:978-0525558613.
"... In the popular imagination, superhuman artificial intelligence is an
approaching tidal wave that threatens not just jobs and human relationships,
but civilization itself. Conflict between humans and machines is seen as
inevitable and its outcome all too predictable. In this groundbreaking book,
distinguished AI researcher Stuart Russell argues that this scenario can be
avoided, but only if we rethink AI from the ground up. ..."
[Also search for: human versus AI].
%A S. Gallus
%A et al ...
%A C. La Vecchia
%T Does pizza protect against cancer?
%J Int. J. of Cancer
%V 107
%N 2
%P 283-284
%M NOV
%D 2003
%K jrnl, c2003, c200x, c20xx, zz1019, human, health, medicine, cancer, risk,
risks, diet, pizza, mediteranean, IgNobel, IgNoble, 2019, c2019
%X "We analyzed the potential role of pizza on cancer risk, using data from an
integrated network of case-control studies conducted in Italy between 1991
and 2000. ... Odds ratios for regular pizza consumers were 0.66 (95%
confidence interval, CI = 0.47-0.93) for oral and pharyngeal cancer, 0.41
(95% CI = 0.25-0.69) for oesophageal, 0.82 (95% CI = 0.56-1.19) for
laryngeal, 0.74 (95% CI = 0.61-0.89) for colon and 0.93 (95% CI = 0.75-1.17)
for rectal cancer. Pizza appears therefore to be a favorable indicator of
risk for digestive tract neoplasms in this population."
-- [doi:10.1002/ijc.11382]['19].
SG won the IgNobel prize for medicine [2019].
%A M. S. Johnson
%A A. Martsu
%A S. Kryazhimskiy
%A M. M. Desai
%T Higher-fitness yeast genotypes are less robust to deleterious mutations
%J Science
%V 366
%N 6464
%P 490-493
%M OCT
%D 2019
%K jrnl, c2019, c201x, c20xx, zz1019, biology, evolution, fitness, robustness,
robust, selection, fitest, fittest, mutation, yeast
%X "... In many microbial systems, diminishing-returns epistasis contributes to
a tendency for more-fit genotypes to be less adaptable, but no analogous
patterns for robustness are known. To understand how rob. varies across
genotypes, we measure the fitness effects of hundreds of individual insertion
mutations in a panel of yeast strains. We find that more-fit strains are less
robust: They have distributions of fitness effects with lower mean & higher
variance. These differences arise because many mutations have more strongly
deleterious effects in faster-growing strains. This -ve correlation between
fitness & robustness implies that second-order seln for robustness will tend
to conflict with first-order selection for fitness."
-- [doi:10.1126/science.aay4199]['19].
%A L. E. Crawford
%A et al ...
%A K. G. Lambert
%T Enriched environment exposure accelerates rodent driving skills
%J J. Behavioural Brain Research
%V ?
%M OCT
%D 2019
%K jrnl, c2019, c201xx, c20xx, zz1019, animal, rodent, rat, rats, car, vehicle,
ROV, drive, driving, skill, ratmobile, Dehydroepiandrosterone,
corticosterone, neurochemistry, DHEA, interest, stress, CORT, funny, haha
%X "... preliminary research establishing that rats could be taught to drive a
rodent operated vehicle (ROV) in a fwd dirnction, as well as steer in more
complex navigational patterns, male rats housed in an enriched environment
were exposed to the rodent driving regime. Compared to std-housed rats,
enriched-housed rats demonstrated more robust learning ... suggesting that
driving training, regardless of housing group, enhanced markers of emotional
resilience. ... confirm the importance of enriched environments in preparing
animals to engage in complex behavioral tasks. ..." [online 16/10/2019]
-- [doi:10.1016/j.bbr.2019.112309]['19].
Also see the [bbc][24/10/2019].
(I can see an IgNobel prize in the making.)
%A S. Furber
%A S. Temple
%T Neural systems engineering
%J J. Royal Soc. Interface
%V 4
%P 193-206
%D 2007
%K jrnl, c2007, c200x, c20xx, zz1019, NN, ANN, ManchesterUni, UManchester,
SpiNNaker
%X "... At present, however, knowledge about the operational principles of the
brain is far from complete, so attempts at emulation must employ a great
deal of assumption and guesswork ... o computer engineers have something to
contribute, alongside neuroscientists, psychologists, mathematicians and
others, to the understanding of brain and mind, which remains as one of the
great frontiers of science?"
-- [doi:10.1098/rsif.2006.0177]['19].
[Also search for: SpiNNaker].
Also see SpiNNaker@[manchester]['19].
%A Y. Polozhentseva
%A M. Klevtsova
%T KPI-monitoring for university's performance improvement
%J Economic Annals-XXI
%V 163
%N 1-2(1)
%P 71-74
%D 2017
%K jrnl, c2017, c201x, c20xx, zz1019, university, academic, research,
managament, education, KPI, KPIs, ranking, rankings, THES, Leiden, QS,
SCImago, ERA, ARC, Stanford, Harvard, Cambridge, Oxford, Toronto, Tokyo,
Lomonosov, Moscow, europe, uk, usa, russia
%X "Approaches based on KPI-monitoring are used by commercial entities
worldwide. However, such an approach is new and insufficiently developed for
universities. Specific features of their functioning necessitate not just
assessment of their economic efficiency but also consideration of special
aspects of higher education. Therefore, studying the issues of uni.
performance monitoring based on the development of a system of indicators is
challenging in terms of encouraging rapid international development of
'smart economy'. The article contains analysis of universities' global
rankings based on the selection of indicators of KPI-monitoring system to
show development of university competitive strengths related to countries'
economic development."
-- [www]['19].
[Also search for: university management].
(Also see [rankings].)
%A J. Bardin
%A et al ...
%A C. M. Gidney
%T A 28nm bulk-CMOS 4-to-8GHz < 2mW cryogenic pulse modulator for
scalable quantum computing
%J Proc. 2019 Int. Solid State Circuits Conf.
%A IEEE
%P 456-458
%D 2019
%K conf, c2019, c201x, c20xx, zz1019, google, quantum, computer, computing,
qubit, qubits
%X "Future q.c. systems will require cryogenic integrated circuits to control
& measure millions of qubits. ... we report design & measurement of a
prototype cryogenic CMOS integrated circuit that has been optimized for the
control of transmon qubits. The circuit has been integrated into a q.
measurement setup & its performance has been validated through multiple
quantum control experiments."
-- pub47965@[g'gle]['19].
[Also search for: quantum computing].
%T A kinder research culture is possible
%J Nature
%M OCT
%D 2019
%K news, views, c2019, c201x, c20xx, zz1019, scientific, university, research,
KPI, KPIs, quality, excellence, management, culture, ARC, grants, ERA,
Farrar, Welcome Trust, biol, biology
%X "Wellcome's director Jeremy Farrar didn't hold back. 'The emphasis on
excellence in the research system is stifling diverse thinking and positive
behaviours,' he wrote in a blog post last month. 'The relentless drive for
research excellence has created a culture in modern science that cares
exclusively about what is achieved and not about how it is achieved.' These
are strong words, not least because Farrar acknowledges that the UK
biomedical funding charity that he leads helped to create such a focus on
excellence. ..."
-- [doi:10.1038/d41586-019-02951-4]['19].
[Also search for: scientific research management].
%A F. Arute
%A et al ...
%A J. M. Martinis
%T Quantum supremacy using a programmable superconducting processor
%J Nature
%V 574
%P 505-510
%M OCT
%D 2019
%K jrnl, c2019, c201x, c20xx, zz1019, quantum computer, quantumComputer,
computing, google, Sycamore, 53 qubits, controversial, claim, IBM Summit,
%X "... we report the use of a processor with programmable superconducting
qubits to create q.states on 53 qubits, corr. to a computational state-space
of dimension 253 (~10^16). Measurements from repeated experiments sample the
resulting prob. distn, which we verify using classical simulations. Our
Sycamore processor takes about 200 seconds to sample one instance of a
q.circuit a million times - our benchmarks currently indicate that the
equivalent task for a state-of-the-art classical supercomputer would take
~10,000 years. ..."
-- [doi:10.1038/s41586-019-1666-5]['19].
Interesting, but not yet useful.
(Also see the bbc[23/10/2019], and
1910.09534@[arXiv][21/10/19]
[ibm][21/10/2019].)
%A Socrates
%T Quote
%K Socrates, Socratic, Plato, wisdom, knowledge, over confidence, overconfident,
experience, paradox, Dunning Kruger effect, law, zz1019
%X '"I know that I know nothing" is a saying derived from Plato's account of the
Greek philosopher Socrates. It is also called the Socratic paradox. The
phrase is not one that Socrates himself is ever recorded as saying.
This saying is also connected or conflated with the answer to a question
Socrates (according to Xenophon) or Chaerephon (according to Plato) is said
to have posed to the Pythia, the Oracle of Delphi, in which the oracle stated
something to the effect of "Socrates is the wisest."'
-- [wikip]['19].
%A M. C. Jones
%T Connecting distributions with power tails on the real line, the half line
and the interval
%J Int. Statistical Rev.
%V 75
%N 1
%P 58-69
%M MAR
%D 2007
%K jrnl, c2007, c200x, c20xx, zz1019, continuous probability distribution,
symmetry, heavy, tail, fat, tails, transformation, stats
%X "Univariate continuous distributions have three possible types of support
exemplified by: the whole real line, R, the semi-finite interval, R+, the
bounded interval (0,1). This paper is about connecting distributions on these
supports via 'natural' simple transformations in such a way that tail
properties are preserved. In particular ... focussed on the case where the
tails (at +/-inf) of densities are heavy, decreasing as a (-ve) power of
their argument; connections are then especially elegant. At boundaries (0 &
1), densities behave conformably with a directly related dependence on power
of argument. The transformation from (0,1) to R is the std odds transn. The
transn from R+ to R is a novel identity-minus-reciprocal transn. The main
points of contact with existing distns are with the transfns involved in the
Birnbaum-Saunders distn &, especially, the Johnson family of distns.
Relationships between various other existing & newly proposed distns are
explored."
-- [doi:10.1111/j.1751-5823.2007.00006.x]['19].
[Also search for: probability distribution symmetry].
%A G. S. Mudholkar
%A H. Wang
%T IG-symmetry and R-symmetry: Interrelations and applications to the
inverse Gaussian theory
%J J. of Stat. Planning and Inference
%V 137
%N 11
%P 3655-3671
%M NOV
%D 2007
%K jrnl, c2007, c200x, c20xx, zz1019, stats, inverse Gaussian, Wald, IG,
symmetry, IGsymmetry, IGsymmetric, analogy, RRIG, Rsymmetry, Rsymmetric,
probability distribution, symmetric, Tweedie
%X "... [here] first elaborate the importance of the IG distn and of the G-IG
analogies. Then we consider the IG-related root-reciprocal IG (RRIG) distn
& introduce a physically transparent, conceptually clear notion of reciprocal
symmetry (R-symmetry) and use it to explain the IG-symmetry. We study the
moments & mixture properties of the R-symmetric distns & the relationship of
R-symmetry with IG-symmetry & note that RRIG distn provides a link, in
addition to Tweedie's Laplace transform link, between the Gaussian & inverse
Gaussian distributions. We also give a structural characterization of the
unimodal R-symmetric distns. This work further expands the long list of G-IG
analogies. Several applications including product convolution, monotonicity
of power fns, peakedness & monotone limit thms of R-symmetry are outlined."
-- [doi:10.1016/j.jspi.2007.03.041]['19].
[Also search for: probability distribution symmetry].
(Also see,
"... [IG]name can be misleading: it is an 'inverse' only in that, while the
G. describes a Brownian motion's level at a fixed time, the inverse G
describes the distn of the time a B.motion with +ve drift takes to reach a
fixed +ve level. ..."
-- inv_G@[wikip]['19].)
%A P. Bille
%A I. Li Gortz
%A T. Anna Steiner
%T String indexing with compressed patterns
%J arXiv
%M SEP
%D 2019
%J TR, c2019, c201x, c20xx, zz1019, string, strings, substring, match, index,
query, pattern, search, compressed, LZ 77, LZ77, trie, algorithm,
data structure
%X "Given a string S of length n, the classic string indexing problem is to
preprocess S into a compact data struct. that supports efficient subsequent
pattern queries. ... we consider the basic variant where the pattern is given
in compressed form and the goal is to achieve query time that is fast in
terms of the compressed size of the pattern. ... consider how to efficiently
process the compressed query directly. Our main result is a novel linear
space DS that achieves near-optimal query time for patterns compressed with
the classic Lempel-Ziv compression scheme. [&] develop several data
structural techniques of indep. interest, inc. a novel DS that compactly
encodes all LZ77 compressed suffixes of a string in linear space & a general
decomposition of tries that reduces the search time from logarithmic in the
size of the trie to logarithmic in the length of the pattern."
-- 1909.11930@[arXiv]['19].
%A P. Charalampopoulos
%A T. Kociumaka
%A S. P. Pissis
%A J. Radoszewski
%A W. Rytter
%A J. Straszynski
%A T. Walen
%A W. Zuba
%T Weighted shortest common supersequence problem revisited
%J arXiv
%M SEP
%D 2019
%K TR, c2019, c201x, c20xx, zz1019, weighted shortest common supersequence,
WSCS, SCS, SCSS, problem, NPC, weighted longest common subsequence, WLCS,
Amir, fuzzy, character, probability, degenerate, dString, indeterminate,
string, strings, algorithm
%X "A weighted string, also known as a position weight matrix, is a seq. of
prob. distns over some alphabet. We revisit the Weighted Shortest Common
Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that
is, the SCS problem on weighted strings. .. we are given two weighted strings
W1 and W2 and a threshold Freq on probability, and we are asked to compute
the shortest (std) string S such that both W1 and W2 match subseqs. of S
(not nec. the same) with prob. at least Freq. Amir et al. showed that this
problem is NPC if the probs., inc. the threshold Freq, are represented by
their logarithms (encoded in binary). We present an alg. that solves the WSCS
problem for two wtd strings of length n over a const.-sized alphabet in
O(n^2 sqrt(z) log(z)) time. Notably, our upper bound matches known cond.
lower bounds stating that the WSCS problem cannot be solved in O(n^(2-e))
time or in O^*(z^(0.5-e)) time unless there is a breakthrough improving upon
long-standing upbs for fundamental NPH problems (CNF-SAT & Subset Sum,
resp.). We also discover a fundamental difference between the WSCS problem &
the WLCS problem, intr. by Amir et al. [JDA 2010]. We show that the WLCS
problem cannot be solved in O(n^f(z)) time, for any fn f(z), unless P=NP."
-- 1909.11433@[arXiv]['19].
[Also search for: indeterminate dString].
%A D. Kempa
%A T. Kociumaka
%T Resolution of the Burrows-Wheeler Transform conjecture
%J arXiv
%M OCT
%D 2019
%K TR, c2019, c201x, c20xx, zz1019, BWT, indexing, search, compression,
string, strings, LZ, LZ77
%X "... The compression ratio of BWT-based compressors, such as bzip2, is
quantified by the # 'r' of maximal equal-letter runs in the BWT. ... we show
that every text satisfies r=O(z log^2 n). This result has a # of immediate
implications: (1) it proves that a large body of work related to BWT
automatically applies to the so-far disjoint field of Lempel-Ziv indexing &
compression, e.g., it is possible to obtain full functionality of the suffix
tree & the suffix array in O(z polylog n) space; (2) it lets us relate the
# of runs in the BWT of the text & its reverse; (3) it shows that many
fundamental text processing tasks can be solved in the optimal time assuming
that the text is compressible by a suff. large polylogn factor using LZ77."
('z' is "the size of Lempel-Ziv (LZ77) parsing of the text")
-- 1910.10631@[arXiv]['19].
[Also search for: BWT].