Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0818
%A L. Letenneur
%T Risk of dementia and alcohol and wine consumption: a review of recent results
%J Biol. Res.
%V 37
%N 2
%P 189-193
%D 2004
%K jrnl, zzAlcohol, positive, c2004, c200x, c20xx. zz0818, human health, brain,
dementia, Alzheimers disease, alcohol consumption, wine, moderate drinking
%X "... there was a negative association only with AD. after adjustment
(OR = 0.55; p < 0.05). The inverse relationship between moderate wine
drinking & incident dementia was explained neither by known predictors of
dementia nor by medical, psychological or socio-familial factors. These
results were confirmed from data of the Rotterdam study. Light-to-moderate
drinking (one to three drinks per day) was sig. associated with a lower risk
of any dementia (hazard ratio 0.58 [95% CI 0.38-0.90]) & vascular dementia
(hazard ratio 0.29 [0.09-0.93]). No evidence that the relation between
alcohol & dementia varied by type of alcoholic beverage was found. ..."
-- [pubm'd]['18].
[Also search for: zzAlcohol].
%T Alcohol use and burden for 195 countries and territories, 1990-2016:
A systematic analysis for the Global Burden of Disease Study 2016
%Q GBD 2016 Alcohol Collaborators
%J The Lancet
%V ?
%P ?-?
%M AUG
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0818, moderate alcohol, zzAlcohol, negative,
consumption, drink, drinking, human health, risks, DALY, DALYs
%X "... 694 data sources of individual & popln-level alcohol consumption,
along with 592 prospective & retrospective studies on the risk of alcohol
use, we produced ests. of the prevalence of current drinking, abstention,
the distribution of a.consumption among current drinkers in std drinks
daily (defined as 10g of pure ethyl a.), & a.-attributable deaths & DALYs.
... Globally, alcohol use was the 7th leading risk factor for both deaths &
DALYs in 2016, accounting for 2.2% (95% uncertainty interval [UI] 1.5-3.0) of
age-standardised female deaths & 6.8% (5.8-8.0) of age-standardised male
deaths. Among the popln aged 15-49 years, alcohol use was the leading
risk factor globally in 2016, with 3.8% (95% UI 3.2-4.3) of female deaths &
12.2% (10.8-13.6) of male deaths attributable to alcohol use. For the
popln aged 15-49 years, female attributable DALYs were 2.3% (95% UI
2.0-2.6) & male attributable DALYs were 8.9% (7.8-9.9). The three leading
causes of attributable deaths in this age group were tuberculosis (1.4%
[95% UI 1.0-1.7] of total deaths), road injuries (1.2% [0.7-1.9]), &
self-harm (1.1% [0.6-1.5]). For poplns aged 50 years & older, cancers
accounted for a large proportion of total alcohol-attributable deaths in
2016, constituting 27.1% (95% UI 21.2-33.3) of total alcohol-attributable
female deaths & 18.9% (15.3-22.6) of male deaths. The level of alcohol
consumption that minimised harm across health outcomes was zero (95% UI
0.0-0.8) std drinks per week." (online Aug 2018)
-- [doi:10.1016/S0140-6736(18)31310-2]['18].
%A M. A. Kronrod
%T An optimal ordering algorithm without a field of operation
%J Dokl. Akad. Nauk USSR
%V 186
%N 6
%P 1256-1258
%D 1969
%K jrnl, c1969, c196x, c19xx, zz0818, sort, sorting, merge, merging, in-situ,
insitu, inPlace, space, algorithm
%C -- dan34705@[mathnet.ru]['18].
[Also search for: insitu merge].
(Also see [inSitu].)
%A L. T. Pardo
%T Stable sorting and merging with optimal space and time bounds
%J SIAM J. Comput.
%V 6
%N 2
%P 351-372
%D 1977
%K jrnl, c1977, c197x, c19xx, zz0818, sort, sorting, merge, merging, in situ,
insitu, inPlace, stable, algorithm, space
%X "... two algs. for stable merging & stable sorting of files. The algs. have
optimal worst case time bounds, the merge is linear & the sort is of order
(n log n). Extra storage requirements are also optimal, since both algs. make
use of a fixed # of pointers. Files are handled only by means of the
primitives exchange & comparison of records & basic pointer transformations."
-- [doi:10.1137/0206025]['18].
[Also search for: insitu merge].
%A E. C. Horvath
%T Stable sorting in asymptotically optimal time and extra space
%J JACM
%V 25
%N 2
%P 177-199
%M APR
%D 1978
%K jrnl, JACM, c1978, c197x, c19xx, zz0818, stable, sort, sorting, merge,
merging, algorithm, in-situ, insitu, inPlace, space, Kronrod, contiguent
%X "... Section 1 shows that a stable sorting alg. may be derived directly from
a stable merging alg., & thereafter this paper is restricted to stable
merging algs.. Sec.2 defines the concept of a contiguent, & shows that a
contiguent-forming alg. may be used as the basis for a stable merging alg..
A class of contiguent-forming algs. which exhibit a space/time tradeoff is
presented. In the extremes, one alg. in the class gives rise to a stable
merge requiring O(N) time & O(N log N) bits of extra space, another alg.
requires O(N log N) time & O(log N) bits of extra space to merge.
Sec.3 describes the Stable Kronrod Merge, which requires O(N) time & O(log N)
bits of extra space, but is not applicable to all cases. Sec.4, however,
shows how the Stable Kronrod Merge may be combined with contiguent-forming
alg. to yield a generally applicable class of stable merging algs.. One
alg. in the class is shown to require O(N) time & O(log N) bits of extra
space to merge ..."
-- [doi:10.1145/322063.322064]['18].
[Also search for: insitu merge].
%A J. K. Wong
%T Some simple in-place merging algorithms
%J BIT Numer. Maths.
%V 21
%N 2
%P 157-166
%M JUN
%D 1981
%K jrnl, c1981, c198x, c19xx, zz0818, in situ, insitu, merge, merging, space,
algorithm
%X "... family[1] merges stably in O(k.n) time and O(n^{1/k}) additional space
with a limiting case running in O(n log n) time & constant space. The second
family merges unstably in O(k.n) time & O(log^k n) space with a limiting case
running in O(nG(n)) time & constant space. Here G(n) is the least k s.t.
F(k) >= n where F(0)=1 & F(i)=2^{F(i−1)} for i >= 1. Each alg. gives rise to
a corresponding merge sort."
-- [doi:10.1007/BF01933160]['18].
[Also search for: insitu merge].
%A F. Gavril
%T Algorithms for minimum coloring, maximum clique, minimum covering by
cliques, and maximum independent set of a chordal graph
%J SIAM J. Comput.
%V 1
%N 2
%P 180-187
%D 1972
%K jrnl, c1972, c197x, c19xx, zz0818, maths, graph, chordal, algorithm,
colouring, clique, covering, independent, Rose, R orientation, rOrientation
%X "... Given a chordal graph, we present, ways for constructing efficient
algs. for finding a minimum coloring, a minimum covering by cliques, a
maximum clique, & a maximum independent set. The proofs are based on a
theorem of D.Rose[3] that a finite g. is chordal iff it has some special
orientation called an R-orientation. In the last part of this paper we prove
that an infinite g. is chordal iff it has an R-orientation."
-- [doi:10.1137/0201013]['18].
%A D. Dor
%A U. Zwick
%T Selecting the median
%J Proc. sixth annual ACM-SIAM symp. on Discrete Algorithms (SODA)
%P 28-37
%M JAN
%D 1995
%O SIAM J. Comput., 28(5), pp.1722-1758, 1999
%K conf, SODA, c1995, c199x, c19xx, zz0818, median, select, selection, problem,
algorithm
%X "Improving the standing result of Schonhage, Paterson and Pippenger [1976]
we show that the median of a containing N elts can be found using at most
2.95N comparisons."
-- pdf@[unc]['18],
[doi:10.1137/S0097539795288611]['18] (SIAM J. C. 1999),
[acm]['18].
[Also search for: median selection problem].
%A D. Dor
%A U. Zwick
%T Finding the alpha.n-th largest element
%J Combinatorica
%V 16
%N 1
%P 41-58
%M MAR
%D 1996
%K jrnl, c1996, c199x, c19xx, zz0818, median, select, selection,
problem, algorithm
%X "...an alg. for selecting the alpha.n-th largest elt (where 0 < alpha < 1),
from a totally ordered set of N elts, using at most (1+(1+o(1))H(alpha))·n
comparisons where H(alpha) is the binary entropy fn & the o(1) stands for a
fn that tends to 0 as alpha tends to 0. For small values of alpha this is
almost the best possible as there is a lower bound of about (1+H(alpha))·n
comparisons. The alg. obtained beats the global 3n upper bound of Schonhage,
Paterson & Pippenger [1976] for alpha < 1/3."
-- [doi:10.1007/BF01300126]['18].
[Also search for: median selection problem].
%A M. Alber
%A I. Bello
%A B. Zoph
%A P.-J. Kindermans
%A P. Ramachandran
%A Q. Le
%T Backprop evolution
%K arXiv
%M AUG
%D 2018
%K TR, c2018, c201x, c20xx, zz0818, AI, ANN, NN, backpropagation, backProp,
deep learning, algorithm, intro, survey
%X "The back-propagation alg. is the cornerstone of deep learning. Despite its
importance, few variations of [it] have been attempted. This work presents an
approach to discover new variations of the back-propagation eqn. We use a
domain specific language to describe update equns as a list of primitive
fns. An evolution-based method is used to discover new propagation rules that
maximize the generalization performance after a few epochs of training. We
find several update equns that can train faster with short training times
than std b.-p., & perform similar as standard b.-p. at convergence."
-- 1808.02822@[arXiv]['18].
(Also see backprop@[wikip]['22].)
%A A. Medlar
%A L. Holm
%T TOPAZ: asymmetric suffix array neighbourhood search for massive
protein databases
%J BMC Bioinformatics
%V 19
%P 278
%M AUG
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0818, proteins, homolgy, Blast,
SANS, SANSparallel, UniProtK, TOPAZ, seeds
%X "... many methods have been proposed as alternatives to BLAST that make an
explicit trade-off between sensitivity & speed. One such method,
SANSparallel, uses a parallel implementation of the suffix array
neighbourhood search (SANS) technique to achieve high speed & provides
several modes to allow for greater sensitivity at the expense of performance.
... present a new approach called asymmetric SANS together with scored seeds
& an alternative suffix array ordering scheme called optimal substitution
ordering. ... In our benchmark, searching UniProtKB for homologous proteins
to the Dickeya solani proteome, TOPAZ took less than 3 minutes to achieve a
sensitivity of 0.84 compared to BLAST."
-- [doi:10.1186/s12859-018-2290-3]['18].
%A V. Slon
%A et al ...
%A S. Paabo
%T The genome of the offspring of a Neanderthal mother and a Denisovan father
%J Nature
%V ?
%P ?-?
%M AUG
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0818, ancient, human, fossil, DNA,
Neanderthal, Denisovan, evolution, Denisova 11, Denisova11, interbreeding,
Pleistocene, hominin
%X "Neanderthals & Denisovans are extinct groups of hominins that separated from
each other more than 390,000 years ago. ... present the genome of
'Denisova 11', a bone fragment from Denisova Cave (Russia) & show that it
comes from an individual who had a N. mother & a D. father. The father, whose
genome bears traces of N. ancestry, came from a popn related to a later D.
found in the cave. The mother came from a population more closely related to
Neanderthals who lived later in Europe than to an earlier N. found in D.
Cave, suggesting that migrations of Ns. between eastern & western Eurasia
occurred sometime after 120,000 years ago. The finding of a first-generation
N.-D. offspring among the small # of archaic specimens sequenced to date
suggests that mixing between Late Pleistocene hominin groups was common when
they met."
-- [doi:10.1038/s41586-018-0455-x]['18].
[Also search for: ancient DNA].
%A R. Hougaard
%T The Mind of the Leader: How to Lead Yourself, Your People, and
Your Organization for Extraordinary Results
%I HarvardBuisRev
%P 256
%M MAR
%D 2018
%K book, c2018, c201x, c20xx, zz0818, managing, leader, leadership, bosses,
management, managing, business, economics, neoliberalism, econobabble
%X "The world is facing a global leadership crisis. Seventy-seven percent of
leaders think they do a good job of engaging their people, yet 88 percent of
employees say their leaders don't engage enough. There is also a high level
of suffering in the workplace: 35 percent of employees would forgo a pay
raise to see their leaders fired. ... need to develop managers and executives
who lead with three core mental qualities: mindfulness, selflessness, and
compassion. ..."
1st ed 2018; ub us$22; uk us isbn:1633693422; uk us isbn13:978-1633693425.
%A A. Mayor
%T Gods and Robots: Myths, Machines, and Ancient Dreams of Technology
%I PrincetonUP
%P 296
%M NOV
%D 2018
%K book, text, c2018, c201x, c20xx, zz0818, robot, robots, android, Greeks,
Talos, AI, Alife, sinularity, Ingenious Devices, HAL, Skynet
%X "The first robot to walk the earth was a bronze giant called Talos. This
wondrous machine was created not by MIT Robotics Lab, but by Hephaestus,
the Greek god of invention. More than 2,500 years ago ..."
1st ed 2018; hb us$30; uk us isbn:0691183511; uk us isbn13:978-0691183510.
[Also search for: android].
%A H. Else
%T How Unpaywall is transforming open science
%J Nature
%V 560
%N 7718
%P ?-?
%M AUG
%D 2018
%K news, views, c2018, c201x, c20xx, zz0818, papers, publications, Unpaywall,
free, open, access, OA, openAccess, online, impact, scientific research,
Piwowar, Priem, Parra, preprint, preprints, PeerJ
%X "... a group of computer scientists simply moved to an adjacent hallway.
There, Heather Piwowar, Jason Priem and Cristhian Parra worked all night on
software to help academics to illustrate how much of their work was freely
available on the Internet. ..."
-- [doi:10.1038/d41586-018-05968-3].
Also see, 'The State of OA: A large-scale analysis of the
prevalence and impact of Open Access articles'
-- [10.7287/peerj.preprints.3119v1]['17].
[Also search for: unpaywall] & [also search for: research open access].
%A P. M. Dearing
%A D. R. Shier
%A D. D. Warner
%T Maximal chordal subgraphs
%J Discr. Appl. Maths.
%V 20
%N 3
%P 181-190
%M JUL
%D 1988
%K jrnl, c1988, c198x, c19xx, zz0818, maths, graph, maximal, chordal, subgraph,
finding, algorithm
%X "An alg. for finding maximal chordal subgraphs is developed that has
worst-case time complexity of O(|E|d), where |E| is the # of edges in G &
d is the max. vertex degree in G. ... Two examples are given that illustrate
potential applications of maximal chordal subgs.. One provides an
alternative formulation to the maximum indep. set problem on a g.. The other
involves a novel splitting scheme for solving large sparse systems of linear
equns. "
-- [doi:10.1016/0166-218X(88)90075-3]['18].
Note 1, "maximal...", not "maximum...". Note 2, allows deleting edges.
[Also search for: maximal chordal subgraph] and/or try "maximum", and
[also search for: induced chordal subgraph].
%A I. Bliznets
%A F. V. Fomin
%A M. Pilipczuk
%A Y. Villanger
%T Largest chordal and interval subgraphs faster than 2^n
%J Algorithmica
%V 76
%N 2
%P 569-594
%M OCT
%D 2016
%K jrnl, c2016, c201x, c20xx, zz0818, maths, graph, chordal, induced subgraph
interval, maximum, largest, count, counting, enumerate, enumerating,
problem, property, hereditary, clique path
%X "We prove that in a g. with n vertices, *induced* chordal & interval subgs.
with the maximum # of vertices can be found in time O(2^{lambda n}) for some
lambda < 1. These are the first algs. breaking the trivial 2^n.n^{O(1)} bound
of the brute-force search for these problems."
("... Interval gs. form a subclass of chordal gs. admitting a decomposition
into a clique path instead of less restrictive clique tree. ...")
-- [doi:10.1007/s00453-015-0054-2]['18].
Note 1, "... *induced* [property-] subgraph ...", and
note 2, "maximum # of ver...", not "maximal...".
[also search for: maximum chordal subgraph] and/or try "maximal", and
[also search for: induced chordal subgraph].
%Q Gravity Collaboration
%T Detection of the gravitational redshift in the orbit of the star S2 near
the Galactic centre massive black hole
%J Astronomy and Astrophysics
%V 615
%P L15
%M JUL
%D 2018
%K jrnl, eJrnl, c2018, c201x, c20xx, zz0818, physics, relativity, gravity,
light, redshift, relativistic, black hole, blackHole
%X "The highly elliptical, 16-year-period orbit of the star S2 around the
massive black hole candidate Sgr A* is a sensitive probe ... Near pericentre
at 120 AU ~1400 Schwarzschild radii, the star has an orbital speed of
~7650 km/s, s.t. the first-order effects of Special & General Relativity have
now become detectable with current capabilities. ... From data up to & inc.
pericentre, we robustly detect the combined gravitational redshift &
relativistic transverse Doppler effect for S2 of z = Del L / L ~200km/s/c
with different statistical analysis methods. When parameterising the
post-Newtonian contribution from these effects by a factor f, with f=0 &
f=1 corr. to the Newtonian & general relativistic limits, resp., we find from
posterior fitting with different weighting schemes
f=0.90 +/- 0.09_{stat} +/- 0.15_{sys}. The S2 data are inconsistent with
pure Newtonian dynamics."
-- [doi:10.1051/0004-6361/201833718]['18].
(Also see the [bbc][26/7/2018].)
%A A. Ananthaswamy
%T Through Two Doors at Once: The Elegant Experiment That Captures the
Enigma of Our Quantum Reality
%I DuttonPubl
%P 3014
%M AUG
%D 2018
%K book, c2018, c201x, c20xx, zz0818, physics, quantum theory, mechanics,
diffraction, interference, pattern, double slit, slits, wave, particle
%X 1st ed 2018; hb us$25; uk us isbn:1101986093; isbn13:978-1101986097.
"... How can a single particle behave both like a particle and a wave? Does
a particle exist before we look at it, or does the very act of looking
create reality? ..."
(Also see [review]['18].)
%A K. Iwama
%A J. Teruyama
%A S. Tsuyama
%T Reconstructing strings from substrings: Optimal randomized and average-case
algorithms
%J arXiv
%M AUG
%D 2018
%K TR, c2018, c201x, c20xx, zz0818, string, strings, substrings, queries,
reconstruct, reconstruction, problem, sequencing, DNA, sequence assembly,
MolBio, oracle, algorithm
%X "... 'String reconstruction from substrings' is a math. model of sequencing
by hybridization that plays an important role in DNA seq.. ... we are given a
blackbox oracle holding an unknown string X & are required to obtain
(reconstruct) X through 'substring queries' Q(S). Q(S) is given to the oracle
with a string S & the answer of the oracle is Yes if X includes S as a
substring & No otherwise. Our goal is to minimize the # of queries for the
reconstruction. ... we deal with only binary strings for X whose length n is
given in advance by using a seq. of good S's. In 1995, Skiena & Sundaram
first studied this problem & obtained an alg. whose query complexity is
n+O(log n). Its information theoretic lower bound is n, & they posed an
obvious open question; if we can remove the O(log n) additive term. No
progress has been made until now. This paper gives two partially positive
answers to this open question. One is a randomized alg. whose query
complexity is n+O(1) with high probability & the other is an avg-case alg.
also having a query complexity of n+O(1) on avg. The n lower bound is still
true for both cases, & hence they are optimal up to an additive constant."
-- 1808.00674@[arXiv]['18].
[Also search for: MolBio sequence assembly].
%A A. N. Arslan
%T A fast algorithm for all-pairs Hamming distances
%J IPL
%V 139
%P 49-52
%M ?
%D 2018
%K jrnl, IPL, c2018, c201x, c20xx, zz0818, strings, Hamming distance,
AllPairsHamDist, all pairs, allPairs, algorithm
%X "AllPairsHamDist is introduced as the problem of computing Hamming distances
for all pairs in two given sets. Solving an instance of AllPairHamDist yields
a distance matrix that can be used for hierarchical clustering of biological
sequences. For AllPairsHamDist, there exists a fast alg. based on fast
matrix multiplication."
-- [doi:10.1016/j.ipl.2018.07.006]['18].
%A K. Muller
%A C. Schwarz
%T Fanning the Flames of Hate: Social Media and Hate Crime
%J SSRN
%M DEC
%D 2017
%K TR, c2017, c2017, c20xx, zz0818, internet, www, social network, media,
meta, facebook, troll, hate, nasty, crime, Germany, politics, refugee,
refugees, Alternative fur Deutschland, AfD, right, rightWing
%X "... investigates the link between social media & hate crime using Facebook
data. We study the case of Germany, where the recently emerged right-wing
party Alternative fur Deutschland (AfD) has developed a major social media
presence. We show that right-wing anti-refugee sentiment on F. predicts
violent crimes against refugees in otherwise similar municipalities with
higher social media usage. To further establish causality, we exploit
exogenous variation in major internet & F. outages, which fully undo the
correlation between social media & hate crime. We further find that the
effect decreases with distracting news events; increases with user network
interactions; & does not hold for posts unrelated to refugees. Our results
suggest that social media can act as a propagation mechanism between online
hate speech & real-life violent crime."
-- [www]['18].
%A E. E. Bruch
%A M. E. J. Newman
%T Aspirational pursuit of mates in online dating markets
%J Sci. Adv.
%V 4
%N 5
%P eaap9815
%M AUG
%D 2018
%K jrnl, eJrnl, c2018, c201x, c20xx, zz0818, www, web, internet dating site,
sites, men, women, attractiveness, desirability, mate selection, matching,
messaging, pagerank, stats, US, eHarmony, courtship
%X "... an empirical analysis of heterosexual dating markets in four large U.S.
cities using data from a popular, free online dating service. ... competition
for mates creates a pronounced hierarchy of desirability that correlates
strongly with user demographics & is remarkably consistent across cities. We
find that both men & women pursue partners who are on avg about 25% more
desirable than themselves by our measures & that they use different messaging
strategies with partners of different desirability. We also find that the
probability of receiving a response to an advance drops markedly with
increasing difference in desirability between the pursuer & the pursued.
Strategic behaviors can improve one's chances of attracting a more desirable
mate, although the effects are modest."
"... The most popular individual in our four cities, a 30 y.o. woman
living in New York, received 1504 messages during the period of
observation, equivalent to one message every 30min, day & night, for the
entire month. ..."
-- [doi:10.1126/sciadv.aap9815]['18].
Also see Courtship@[wikip]['21].