Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz1018
%A A. Ilic
%A M. Basic
%T Path matrix and path energy of graphs
%J arXiv
%M OCT
%D 2018
%K TR, c2018, c201x, c20xx, zz1018, maths, graph, algorithm, path matrix,
energy, Shikare
%X "Given a graph G, we associate a path matrix P whose (i,j) entry represents
the maximum # of vertex disjoint paths between the vertices i & j, with zeros
on the main diagonal. ... we resolve four conjectures from [M.M.Shikare,
P.P.Malavadkar, S.C.Patekar, I.Gutman, 'On Path Eigenvalues & Path
Energy of Graphs', MATCH Commun. Math. Comput. Chem. {79, 2018, 387-398.] on
the path energy of graphs & finally present efficient O(|E||V|^3) alg. for
computing the path matrix used for verifying computational results."
-- 1810.04870@[arXiv]['18].
%A N. Tatti
%T Strongly polynomial efficient approximation scheme for segmentation
%J IPL
%V 142
%P ?-?
%M FEB
%D 2019
%K jrnl, IPL, c2018, c201x, c20xx, zz1018, segment, sequence, segmentation,
Seg, MaxSeg, algorithm
%X "Partitioning a sequence of length n into k coherent segments (Seg) ...
Seg can be solved exactly in time using a classic dynamic program. ...
first solving a slightly different segmentation problem (MaxSeg), where the
quality of the segmentation is the maximum penalty of an individual segment.
... able to obtain a strongly polynomial alg.. [&] consider a cumulative
version of Seg, where we are asked to discover the optimal segmentation for
each prefix of the input seq.. We propose a strongly polynomial alg. that
yields (1+e) approximation in time O(nk^2/e). ... consider a cumulative
version of MaxSeg, & show that we can solve the problem in time O(nk log k)."
-- [doi:10.1016/j.ipl.2018.09.007]['18] (online 10/'18).
[Also search for: segmentation].
%A Y. Erlich
%A T. Shor
%A I. Peer
%A S. Carmi
%T Identity inference of genomic data using long-range familial searches
%J Science
%V ?
%P ?
%M OCT
%D 2018
%K jrnl, MolBio, eaau4832, c2018, c201x, c20xx, zz1018, human, DNA, ancestry,
relatives, relations, genealogy, familial, genetic, privacy, security,
law, policing, forensic, DNAland, GEDmatch, GATACCA
%X "Consumer genomics databases have reached the scale of millions of
individuals. Recently, law enforcement authorities have exploited some of
these databases to identify suspects via distant familial relatives. ...
We project that about 60% of the searches for individuals of European-descent
will result in a third cousin or closer match, which can allow their
identification using demographic identifiers. [&] could implicate nearly any
US-individual of European-descent in the near future. We demonstrate that the
technique can also identify research participants of a public sequencing
project. Based on these results, we propose a potential mitigation strategy
& policy implications to human subject research."
-- [doi:10.1126/science.aau4832]['18]. (44 refs.)
(?Here comes 'GATACCA'?)
%A A. Husby
%A J. Wohlfahrt
%A N. Oyen
%A M. Melbye
%T Pregnancy duration and breast cancer risk
%J NatureComms
%V 9
%P e4255
%M OCT
%D 2018
%K jrnl, eJrnl, c2018, c201x, c20xx, zz1018, human, health, breast cancer,
pregnancy, women, female, risks
%X "Full-term pregnancies reduce a woman's long-term breast cancer risk, while
abortions have been shown to have no effect. ... found the reduction in
b.cancer risk was not observed for pregnancies lasting 33 weeks or less,
but restricted to those pregnancies lasting 34 weeks or longer. ... suggest
that a distinct biological effect introduced around week 34 of pregnancy
holds the key to understand pregnancy-assoc. b.cancer protection."
-- [doi:10.1038/s41467-018-06748-3]['18].
%A L. Nunney
%T Size matters: height, cell number and a person's risk of cancer
%J Proc. Royal Soc. B
%V 285
%N 1889
%P ?-?
%M OCT
%D 2018
%K jrnl, PRSB, c2018, c201x, c20xx, zz1018, human health, risk, risks, height,
cancer, Peto's paradox, IGF-1, IGF1
%X "The multistage model of carcinogenesis predicts cancer risk will increase
with tissue size, since more cells provide more targets for oncogenic somatic
mutation. However, this increase is not seen among mammal species of
different sizes (Peto's paradox), ... the hazard ratio for overall cancer
risk per 10cm increase in human height (HR10) is ~ 1.1, indicating a 10%
increase in c.risk per 10cm; however, an alternative explanation invokes an
indirect effect of height, with factors that increase c.risk indep.
increasing adult height. ... For overall c.risk the HR10 predicted v.
observed was 1.13 versus 1.12 for women % 1.11 versus 1.09 for men,
suggesting that cell # variation provides a null hypothesis for assessing
height effects. ..."
-- [doi: 10.1098/rspb.2018.1743]['18].
(Also see the [abc][10/2018].)
%A D. Graeber
%T Bullshit Jobs: A Theory
%I AllenLane
%M MAY
%D 2018
%K book, c2018, c201x, c20xx, zz1018, Graeber, LSE, society, neoliberal, work,
job, jobs, spin, bullshitization, academic, academia, toxic university,
management, dean, vice chancellor, impact, teaching, higher education,
faculty
%X 1st ed 2018; hb us$21, uk us isbn:9780241263884, uk us isbn13:978-0241263884.
(Also see,
"I would like to write about the bullshitization of academic life: that is,
the degree to which those involved in teaching and academic management spend
more and more of their time involved in tasks which they secretly - or not so
secretly - believe to be entirely pointless. ...",
-- D.G.@[www][6/5/2018]. And see
J.Weinberg@[8/5/2018]['18].)
[Also search for: toxic university].
%T Paywall: The Business of Scholarship
%D 2018
%K movie, film, c2018, c201x, c20xx, zz1018, scientific research, publications,
papers, articles, journal, journals, quality, JIF, open access, openAccess,
OA, Elsevier, Wiley, Springer Nature, SpringerNature, publishing, publisher,
SciHub, Sci-Hub
%X "Paywall: The Business of Scholarship is a documentary which focuses on the
need for open access to research and science, questions the rationale behind
the $25.2 billion a year that flows into for-profit academic publishers,
examines the 35-40% profit margin associated with the top academic publisher
Elsevier ..."
-- [paywallthemovie.com]['18].
(Also see review@[4/9/2018].)
[Also search for: research open access].
%A K. Hall Jamieson
%T Cyberwar: How Russian Hackers and Trolls helped elect a President,
what we don't, can't, and do know
%I OUP
%P 336
%M OCT
%D 2018
%K book, OUP, c2018, c201x, c20xx, zz1018, USA, US, American, politics,
Donald Trump, zzTrump, Russia, internet, facebook, twitter, social media,
troll, hack, president, POTUS, presidential, 2016, election
%X 1st ed 2018; hb us$17; uk us isbn13:978-0190915810; asin:0190915811.
"... how Donald Trump won the 2016 election looms over his presidency. In
particular, were the 78,000 voters who gave him an Electoral College victory
affected by the Russian trolls and hackers? ..."
%A C. Armitage
%T Less prestigious institutions deliver better value for grant money
%J NatureIndex
%M OCT
%D 2018
%K news, views, c2018, c201x, c20xx, zz1018, institution, university, bias,
scientific research, ARC, NIH, grant, grants, funding, prestige, quality,
reputation, inequality, Wahls, bioRxiv
%X "Study finds "wasteful" skew in NIH funding towards those at the top.
An analysis of United States National Institutes of Health (NIH) grant
allocations finds that prestigious institutions deliver much lower output
per dollar spent than less prestigious institutions, yet get a
disproportionate share of funding. ..."
[* SEE:
'High cost of bias: Diminishing marginal returns on NIH grant funding to
institutions', W.P.Wahls, bioRxiv July 2018,
"... revealed robust inverse correlations between funding (per institution,
per award, per investigator) and scientific output (publication productivity
and citation impact productivity). ..."
-- [doi:10.1101/367847]['18]. *]
[Also search for: research grants].
%A T. Ohtsuki
%A L. K. Cheung
%A T. Fujisawa
%T Minimal triangulation of a graph and optimal pivoting order in a
sparse matrix
%V 54
%N 3
%P 622-633
%M JUN
%D 1976
%K jrnl, c1976, c197x, c19xx, zz1018, maths, graph, triangulated, chordal,
sparse, matrix factorisation, factorization, fill in, fillIn, elimination,
minimal, OCF vertex
%X "... problem of finding a minimal triangulation of an undirected graph
G=(V,E), where a tri. is a set T such that every cycle in G=(V,E U T) has a
chord. A tri. T is minimal (minimum) if no tri. F exists such that F is a
proper subset of T (|F| < |T|) & an ordering alpha is optimal (optimum) if a
minimal (minimum) tri. is generated by alpha. A minimum tri. (optimum
ordering) is nec. minimal (optimal), but the converse is not nec. true. A
nec. & sufficient condition for a tri. to be minimal is presented. This leads
to an alg. for finding an optimal ordering alpha which produces a minimal set
of 'fill-in' when the process is viewed as triangular factorization of a
sparse matrix.
-- [doi:10.1016/0022-247X(76)90182-7]['18].
[Also search for: minimal triangulation] and [also search for: elimination].
%A E. Szemeredi
%T Regular partitions of graphs
%B Problemes combinatoires et theorie des graphes,
Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976
%P 399-401
%D 1978
%K conf, c1978, c197x, c19xx, zz1018, maths, graph, regularity lemma, edges,
regular, partition
%X Also a 1975 TR,
"A crucial lemma in recent work of the author (showing that k-term
arithmetic progression-free sets of integers must have density zero) stated
(approximately) that any large bipartite graph can be decomposed into
relatively few 'nearly regular' bipartite subgraphs. In this note the author
generalizes this result to arbitrary graphs, at the same time strengthening
and simplifying the original bipartite result."
-- STAN-CS-75-489@TR@[stanf.][10/'18].
Also see, "In maths, the Szemeredi regularity lemma states that every large
enough graph can be divided into subsets of about the same size so that the
edges between different subsets behave almost randomly. ..."
-- SRL@[wikip]['18].
%A M. Yannakakis
%T Computing the minimum fill-in is NP-complete
%J SIAM J. Alg. Disc. Methods
%V 2
%N 1
%P 77-79
%M MAR
%D 1981
%K jrnl, c1981, c198x, c19xx, zz1018, maths, graph, graphs, minimum, fill-in,
fillin, chordal, triangulation, triangulated, elimination, NPC,
linear arrangement, OLAP
%X "We show that the following problem is NP-complete. Given a graph, find the
minimum # of edges (fill-in) whose addition makes the graph chordal. This
problem arises in the solution of sparse symmetric positive definite systems
of linear equations by Gaussian elimination."
-- [doi:10.1137/0602010]['18].
(NB. 'minimum' not 'minimal'. Proof by reduction from
the 'optimal linear arrangement problem'.)
%A L. Beaulieu-Laroche
%A et al
%A M. T. Harnett
%T Enhanced dendritic compartmentalization in human cortical neurons
%J Cell
%V 175
%N 3
%P 643-651
%M OCT
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1018, human, brain, neuron, neurons, rodent,
rat, cortex, dendrite, cognition
%X "... Cortical neurons are larger in humans than in other species, but it is
unclear how their size affects synaptic integration. ..."
-- [doi:10.1016/j.cell.2018.08.045]['18].
%A F. LeRon Shults
%A et al ...
%A M. Toft
%T A generative model of the mutual escalation of anxiety between religious
groups
%J J. of Artificial Societies and Social Simulation
%V 21
%N 4
%P 7
%M OCT
%D 2018
%K jrnl, eJrnl, JASSS, c2018, c201x, c20xx, zz1018, Alife, simulation,
cooperation, behaviour, human behaviour, society, social, conflict, hate,
threat, religion, xenophobia, inGroup, outGroup, Gujurat, Troubles, Bogside,
Conflict Archive, CAIN
%X "... model of the emergence & escalation of xenophobic anxiety in which
individuals from two different religious groups encounter various hazards
within an artificial society. ... results identify some of the conditions &
mechanisms that engender the intensification of anxiety within & between
religious groups. ... Trace validation techniques show that the most common
conditions under which longer periods of mutually escalating xenophobic
anxiety occur are those in which the difference in the size of the groups is
not too large & the agents experience social & contagion hazards at a level
of intensity that meets or exceeds their thresholds for those hazards. Under
these conditions agents will encounter out-group members more regularly, &
perceive them as threats, generating mutually escalating xenophobic anxiety.
The model's capacity to grow the macro-level emergence of this phenomenon
from micro-level agent behaviors & interactions provides the foundation for
future work in this domain."
-- [www]['18],
[doi:10.18564/jasss.3840]['18].
(Also see the bbc[31/10/2018].)
%A D. Frauchiger
%A R. Renner
%T Quantum theory cannot consistently describe the use of itself
%J NatureCommunications
%V 9
%N 3711
%M SEP
%D 2018
%K quantum physics, c2018, c201x, c20xx, zz1018, theory, macroscopic,
consistent, consistency, inconsistent, Schrodinger, Schrodinger's cat
%X "... we propose a Gedankenexperiment to investigate the question whether
quantum theory can, in principle, have universal [macroscopic] validity. The
idea is that, if the answer was yes, it must be possible to employ QT to
model complex systems that include agents who are themselves using QT.
Analysing the experiment under this presumption, we find that one agent, upon
observing a particular measurement outcome, must conclude that another agent
has predicted the opposite outcome with certainty. The agents' conclusions,
although all derived within QT, are thus inconsistent. This indicates that
QT cannot be extrapolated to complex systems, at least not in a
straightforward manner."
-- [doi:10.1038/s41467-018-05739-8]['18].
Also see F&R 1604.07422@[arXiv][25/4/18].
(Also see FW@[www][19/9/2018] and
DC@[doi:10.1038/d41586-018-06749-8][18/9/2018].)
%A S. Bravyi
%A D. Gosset
%A R. Konig
%T Quantum advantage with shallow circuits
%J Science
%V 362
%N 6412
%P 308-311
%M OCT
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1018, quantum, algorithm, computer, circuit,
speed, advantage, locality, nonlocality
%X "... Whether a quantum advantage can be rigorously proven in some setting or
demonstrated experimentally using near-term devices is the subject of active
debate. We show that parallel quantum algs. running in a constant time period
are strictly more powerful than their classical counterparts; they are
provably better at solving certain linear algebra problems assoc. with binary
quadratic forms. ... gives an unconditional proof of a computational q.adv.
& simultaneously pinpoints its origin: It is a consequence of quantum
nonlocality. The proposed q.alg. is a suitable candidate for near-future
experimental realizations, as it requires only constant-depth q.circuits with
nearest-neighbor gates on a two-dimensional grid of qubits (quantum bits)."
-- [doi10.1126/science.aar3106]['18].
%A Y. Liu
%A et al ...
%A J.-W. Pan
%T Device-independent quantum random-number generation
%T Nature
%V 562
%P 548-551
%M OCT
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1018, physics, quantum, random number,
generator, generation, QRNG, RNG, DIQRNG
%X "... Device-independent quantum random-number generation (DIQRNG) based on
the loophole-free violation of a Bell inequality produces genuine,
unpredictable randomness without requiring any assumptions about the inner
workings of the devices ... Here we present DIQRNG that is secure against
quantum and classical adversaries. ..."
-- [doi:10.1038/s41586-018-0559-3]['18].
[Also search for: random RNG] and [also search for: quantum RNG].
%A C. Lagorio-Chafkin
%T We Are the Nerds: The Birth and Tumultuous Life of Reddit, the
Internet's Culture Laboratory
%I HachetteBooks
%M OCT
%D 2018
%K book, c2018, c201x, c20xx, zz1018, Reddit, internet, www, HREF, news, rating,
social media, subreddit, reddits, redditor, Snoo, web.py, Huffman, Ohanian
%X "... Reddit hails itself as 'the front page of the Internet.' It's the
third most-visited website in the United States ..."
1st ed 2018; hb us$18; uk us isbn:0316435376; uk us isbn13:978-0316435376.
(Also see reddit@[wikip]['18].)