Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0917
%A M. Tegmark
%T Life 3.0: Being Human in the Age of Artificial Intelligence
%I Knopf
%P 384
%D 2017
%K book, text, c2017, c201x, c20xx, zz0917, AI, Artificial Intelligence, robots,
robot, android, human versus, convergence, prediction zzPrediction,
Life3.0, Life3
%X 1st ed 2017; hb us$18; uk us isbn:1101946598; uk us isbn13:978-1101946596.
"... Should we fear an arms race in lethal autonomous weapons? Will machines
eventually outsmart us at all tasks, replacing humans on the job market and
perhaps altogether? Will AI help life flourish like never before or give us
more power than we can handle? What sort of future do you want? ..."
[Also search for: human versus AI].
%A M. Kubica
%A T. Kulczynski
%A J. Radoszewski
%A W. Rytter
%A T. Walen
%T A linear time algorithm for consecutive permutation pattern matching
%J IPL
%V 113
%N 12
%D 2013
%P 430-433
%K jrnl, IPL, c2013, c201x, c20xx, zz0917, CPPM, consecutive permutation,
OPPM, order preserving, pattern matching, problem, algorithm, sequence
%X "... 2 seqs x & w of length m are order-isomorphic (of the same 'shape') if
w[i] <= w[j] iff x[i] <= x[j] for each i, j in [1,m]. We present a simple
linear time alg. for checking if a given seq. y of length n contains a factor
which is order-isomorphic to a given pattern x. A factor is a subseq. of
consec. symbols of y, so we call our problem the consec.perm.pattern
matching. The (general) perm. pattern matching problem is related to general
subseqs. & is known to be NP-complete. We show that the situation for
consec.subseqs. is sig. different & present an O(n+m) time alg. under a
natural assumption that the symbols of x can be sorted in time O(m),
otherwise the time is O(n+m log m). ... use a modification of the classical
Knuth–Morris–Pratt string matching alg.."
-- [doi:10.1016/j.ipl.2013.03.015]['17].
%A S. L. S. Mergen
%A V. P. Moreira
%T DuelMerge: Merging with fewer moves
%J COMPJ
%V 60
%N 9
%P 1271-1278
%M SEP
%D 2017
%K jrnl, COMPJ, c2017, c201x, c20xx, zz0917, duelmerge, algorithm, merge,
merging, sorting, stable, moves
%X "... duelmerge, a stable merging alg. that is asymptotically optimal in the
# of comparisons & performs O(n log2(n)) moves. Unlike other partition-based
algs., we only allow blocks of equal sizes to be swapped, which reduces the
# of moves required. We performed experiments comparing duelmerge [v.] a # of
baselines inc. recmerge, the standard merging soln for programming languages
such as C, & some more recent approaches. The results show that our proposed
alg. performs fewer moves than other stable solns. Experiments employing
duelmerge within MergeSort confirmed our positive results in terms of moves,
comparisons & runtime."
-- [doi:10.1093/comjnl/bxw105]['17].
(NB. "*stable* merging".) [Also search for: merge algorithm].
%T Maryam Mirzakhani
%K Mirzakhani, c2017, c201x, c20xx, zz0917, mathematician, maths, math, STEM,
Teichmuller, hyperbolic, Ergodic theory, symplectic,
Fields medal, 2014, prize, obit, quote, quotable,
StanfordUni, science, scientist, woman, women, www, HREF, http
%X Maryam Mirzakhani (1977 - 14/7/2017).
Maths is "like being lost in a jungle and trying to use all the
knowledge that you can gather to come up with some new tricks", M.M.,
-- news@[Stanf'd][15/7/2017].
MM@[wikip]['17].
%A B. Adhikari
%A J. Cheng
%T Improved protein structure reconstruction using secondary structures,
contacts at higher distance thresholds, and non-contacts
%J BMC Bioinformatics
%V ?
%M AUG
%D 2017
%K jrnl, eJrnl, MolBio, c2017, c201x, c20xx, zz0917, CONFOLD, protein structure,
CASP, de novo structure prediction, secondary structure, contacts
%X "... Using a data set consisting of 496 structural domains released in recent
CASP experiments & a dataset of 150 representative p.structures, ... discuss
three techniques to improve the reconstruction accuracy using true contacts -
adding sec.structs, increasing contact distance thresholds, & adding
non-contacts. We find that reconstruction using sec.structures & contacts can
deliver accuracy higher than using full contact maps. Similarly, we
demonstrate that non-contacts can improve reconstruction accuracy not only
when the used non-contacts are true but also when they are predicted. On the
dataset consisting of 150 proteins, we find that by simply using low ranked
predicted contacts as non-contacts & adding them as additional restraints,
can increase the reconstruction accuracy by 5% when the reconstructed models
are evaluated using TM-score. ..."
-- [doi:10.1186/s12859-017-1807-5]['17].
%A N. Sitchinava
%A D. Strash
%T Reconstructing generalized staircase polygons with uniform step length
%J ArXiv
%M SEP
%D 2017
%K TR, c2017, c201x, c20xx, zz0917, visibility graph, polygon
%X "... construct a polygon that has a given visibility graph ... unknown
complexity (although VG recognition is known to be in PSPACE). We show that
two classes of uniform step length polygons can be reconstructed efficiently
by finding & removing rectangles formed between consecutive convex boundary
vertices called tabs. ... give an O(n^2 m)-time reconstruction alg. for
orthogonally convex polygons, where n & m are the # of vertices & edges in
the visibility graph, resp.. [&] show that reconstructing a monotone chain of
staircases (a histogram) is fixed-parameter tractable, when parameterized on
the # of tabs, & polynomially solvable in time O(n^2 m) under reasonable
alignment restrictions."
-- 1708.09842@[arXiv]['17].
%A A. Tilloy
%T Ghirardi-Rimini-Weber model with massive flashes
%J arXiv
%M SEP
%D 2017
%K TR, c2017, c201x, c20xx, zz0917, physics, quantum theory, gravity, GRW,
flashes, collapse, cosmology
%X "... a modification of the Ghirardi-Rimini-Weber (GRW) model in which the
flashes (or collapse space-time events) source a classical gravitational
field. The resulting semi-classical theory of Newtonian g. preserves the
statistical interpretation of quantum states of matter in contrast with mean
field approaches. It can be seen as a discrete version of recent proposals of
consistent hybrid quantum classical theories. The model seems to be in
agreement with known experimental data & introduces new falsifiable
predictions: (1) particles do not attract themselves, (2) the 1/r
gravitational potential of Newtonian gravity is cut-off at short (<= 0-7m)
distances, & (3) gravity makes spatial superpositions decohere at a rate
inversely proportional to that coming from the vanilla GRW model. Together,
the last two predictions make the model experimentally falsifiable for all
values of its parameters."
-- [arXiv]['17].
%A G. Shmueli
%T To explain or to predict?
%J arXiv
%M JAN
%D 2011
%O Stat. Sci., pp.289-310, 25(3), 2010
%K TR, c2011, c201x, c20xx, zz0917, AI, stats, prediction, explain, MDL,
MML, explanation, model, modelling, modeling, II, statistical, inference
%X "Statistical modeling is a powerful tool for developing & testing theories by
way of causal explanation, prediction, & description. In many disciplines
there is near-exclusive use of statistical modeling for causal explanation &
the assumption that models with high explanatory power are inherently of high
predictive power. Conflation between explanation & prediction is common, yet
the distinction must be understood for progressing scientific knowledge.
While this distinction has been recognized in the philosophy of science, the
statistical literature lacks a thorough discussion of the many differences
that arise in the process of modeling for an explanatory versus a predictive
goal. The purpose of this article is to clarify the distinction between
explanatory & predictive modeling, to discuss its sources, & to reveal the
practical implications of the distinction to each step in the modeling
process." [via F.Pj.]
-- 1101.0891@[arXiv]['17].