Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0718
%A R. W. Floyd
%A R. L. Rivest
%T Expected time bounds for selection
%J CACM
%V 18
%N 3
%P 165-172
%M MAR
%D 1975
%K jrnl, CACM, c1975, c197x, c19xx, zz0718, median, select, selection, problem,
algorithm 489, algorithm489, CSD 349, CSD349, bound
%X "A new seln alg. ... v.efficient on average, both theor, & practically.
The # of comparisons used to select the i-th smallest of n numbers is
n+min(i,n-i)+o(n). A lower bound within 9 percent of the above formula is
also derived." (Note, "... on average ...")
-- [doi:10.1145/360680.360691]['18],
pdf@[citese'r['18].
(*ALSO see 'Algorithm 489, SELECT', CACM, p.173, same issue
-- [citese'r['18].*)
[Also seach for: median selection problem] and
[also search for: Kiwiel select c2005].
%A K. C. Kiwiel
%T On Floyd and Rivest's SELECT algorithm
%J TCS
%V 347
%N 1-2
%P 214-238
%M NOV
%D 2005
%K jrnl, TCS, c2005, c200x, c20xx, zz0718, median, select, selection, problem,
algorithm
%X "We show that several versions of Floyd & Rivest's alg. SELECT for finding
the k-th smallest of n elts require at most n+min(k,n−k)+o(n) comparisons on
avg & with high probability. This rectifies the analysis of F & R, & extends
it to the case of nondistinct elts. Our computational results confirm that
SELECT may be the best alg. in practice."
-- [doi:10.1016/j.tcs.2005.06.032]['18] (open '18).
[Also seach for: median selection problem] and
[also search for: Floyd select c1975].
%A A. Sakharov
%A T. Sakharov
%T The Viterbi algorithm for subsets of stochastic context-free languages
%J IPL
%V 135
%N ?
%P 68-72
%K jrnl, IPL, c2018, c201x, c20xx, zz0718, Viterbi algorithm, CFG, language,
DPA, most probable path
%X "The time complexity of finding the most probable derivation for stochastic
context-free grammars is cubic in the size of the input. The Viterbi alg.
solves the same task in linear time for stochastic regular languages. We
present two modified versions of this alg.. One finds the most probable path
& builds a parse tree for stochastic one-counter languages in quadratic time
of the size of the input. The other finds the most probable derivation for
stochastic linear languages, also in quadratic time."
-- [doi:10.1016/j.ipl.2018.03.005]['18].
[Also search for: DPA].
%A R. Plomin
%A et al ...
%A J. C. DeFries
%T Nature, nurture, and cognitive development from 1 to 16 years:
A parent-offspring adoption study
%J Psychological Sci.
%V 8
%N 6
%P 442-447
%M NOV
%D 1997
%K jrnl, c1997, c199x, c19xx, zz0718, intelligence, IQ, nature, nurture,
genetic, cognition, genes, parents, children, human development
%X "Children increasingly resemble their parents in cognitive abilities from
infancy through adolescence Results obtained from a 20-year longitudinal
adoption study of 245 adopted children and their biological and adoptive
parents, as well as 245 matched nonadoptive (control) parents and offspring,
show that this increasing resemblance is due to genetic factors ...
Although these results were strongest for general cognitive ability & verbal
ability similar results were found for other specific cognitive abilities -
spatial ability, speed of processing, and recognition memory. ... indicate
that within this population, genes that stably affect cognitive abilities in
adulthood do not all come into play until adolescence & that environmental
factors that contribute to cognitive development are not correlated with
parents' cognitive ability."
-- [doi:10.1111/j.1467-9280.1997.tb00458.x]['18].
%A A. Hammond
%A et al ...
%A T. Nolan
%T A CRISPR-Cas9 gene drive system targeting female reproduction in tha
malaria mosquito vector Anopheles gambiae
%J Nature Biotech.
%V 34
%P 78-83
%D 2016
%K jrnl, MolBio, c2015, c201x, c20xx, zz0718, gene drive, geneDrive, CRISPR Cas9
%X "Gene drive systems that enable super-Mendelian inheritance of a transgene
have the potential to modify insect populations over a timeframe of a few
years. ... identified three genes (AGAP005958, AGAP011377 and AGAP007280)
that confer a recessive female-sterility phenotype upon disruption, and
inserted into each locus CRISPR-Cas9 gene drive constructs designed to target
and edit each gene. ... transmission rates to progeny of 91.4 to 99.6% ..."
-- [doi:10.1038/nbt.3439]['18] (online 12/2015).
(Also see news@[doi:10.1038/nature.2015.18974][2015],
but mice more difficult [doi:10.1038/d41586-018-05665-1][6/7/2018].
[Also search for: MolBio gene drive].
%A D. J. Pereira Gray
%A et al ...
%A P. H. Evans
%T Continuity of care with doctors - a matter of life and death? A systematic
review of continuity of care and mortality
%J BMJ Open
%V 8
%N 6
%M JUN
%D 2018
%K jrnl, eJrnl, BMJopen, c2018, c201x, c20xx, zz0718, human, health, risk,
risks, healthcare, doctor, doctors, GPs, NHS, medicare, mortality
%X "... Systematic review without meta-analysis. ... Of the 726 articles
identified in searches, 22 fulfilled the eligibility criteria. The studies
were all cohort or cross-sectional & most adjusted for multiple potential
confounding factors. These studies came from nine countries with very
different cultures & health systems. We found such heterogeneity of
continuity & mortality measurement methods & time frames that it was not
possible to combine the results of studies. However, 18 (81.8%) high-quality
studies reported statistically significant reductions in mortality, with
increased continuity of care. 16 of these were with all-cause mortality.
Three others showed no association & one demonstrated mixed results. These
significant protective effects occurred with both generalist & specialist
doctors. ..."
-- [doi:10.1136/bmjopen-2017-021161]['18].
So, try to stick with one doctor.
%A A. Scaiewicz
%A M. Levitt
%T Unique function words characterize genomic proteins
%J PNAS
%V ?
%P ?-?
%M JUN
%D 2018
%K jrnl, PNAS, MolBio, c2018, c201x, c20xx, zz0718, protein, domain, domains,
architecture, MDA, unique function words, UFW, profile, profiles,
conserved, CDART
%X "... Using clustering to collapse redundant profiles into unique function
words (UFWs), we find that over the years 2009-2016, the # of UFWs saturates
while the # of seqs. matched by a combination of two or more UFWs grows
exponentially. Between 2009 & 2016 the # of protein seqs. from known species
increased 10-fold from 8 million to 85 million. About 80% of these seqs.
contain at least one region recognized by the conserved domain architecture
retrieval tool (CDART) as a seq. motif. Motifs provide clues to biol. fn but
CDART often matches the same region of a protein by two or more profiles.
Such synonyms complicate ests. of functional complexity. We do full-linkage
clustering of redundant profiles by finding maximum disjoint cliques: Each
cluster is replaced by a single representative profile to give what we term a
unique fn word (UFW). From 2009 to 2016, the # of seq. profiles used by CDART
increased by 80%; the # of UFWs increased more slowly by 30%, indicating that
the # of UFWs may be saturating. The # of seqs. matched by a single UFW
(seqs. with single domain architectures) increased as slowly as the # of
different words, whereas the # of seqs. matched by a combination of two or
more UFWs in seqs. with multiple domain architectures (MDAs) increased at the
same rate as the total # of seqs.. This combinatorial arrangement of a ltd #
of UFWs in MDAs accounts for the genomic diversity of protein seqs.. Although
eukaryotes & prokaryotes use very similar sets of 'words' or UFWs (57%
shared), the 'sentences' (MDAs) are different (1.3% shared)."
-- [doi:10.1073/pnas.1801182115]['18] (online 6/2018).
%A M. Griesmann
%A et al ...
%A S. Cheng
%T Phylogenomics reveals multiple losses of nitrogen-fixing
root nodule symbiosis
%J Science
%V 361
%N 6398
%P eaat1743
%M JUL
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0718, angiosperm, NFN symbiosis,
convergent, evolution, plant
%X "... Molecular phylogenies show that NFN symbiosis is restricted to four
angiosperm orders - Fabales, Fagales, Cucurbitales, and Rosales - that
together form the monophyletic NFN clade. However, only 10 of the 28 plant
families within this clade contain species engaged in the NFN symbiosis. Even
within these 10 families, most genera do not form this symbiosis. ...
sequenced the genomes of seven nodulating species belonging to the Fagales,
Rosales, and Cucurbitales orders and the legume subfamily Caesalpinioideae.
We complemented this dataset by sequencing three genomes of nonnodulating
species from the Cucurbitales and from the legume subfamilies Cercidoideae
and Papilionoideae. ... We found that multiple independent losses of
NFN symbiosis occurred in the four orders of the NFN clade. These results
suggest that NFN symbiosis has previously been more common than currently
evident and that this symbiosis is subject to an underestimated adverse
selection pressure."
-- -- [doi:10.1126/science.aat1743]['18].
(Also see [news]['18].)
%A C. Sumner
%A J. E. Scofield
%A E. M. Buchanan
%A M.-Rose Evans
%A M. Shearing
%T The role of personality, authoritarianism and cognition in the
United Kingdom's 2016 referendum on European Union membership
%I Online Privacy Foundation
%M JUL
%D 2018
%K TR, c2018, c201x, c20xx, zz0718, stats, Brexit, EU, Europe, UK, referendum,
vote, personality, traits, authoritarianism, conscientiousness, numeracy,
politics, democracy, psychology, stats
%X "... examined the role of personality traits, cognition & cognitive biases in
relation to referendum voters' choices. A total of 11,225 participants
completed questionnaires & controlled experiments ... Participants expressing
an intent to vote to leave the EU reported sig. higher levels of
authoritarianism & conscientiousness, & lower levels of openness &
neuroticism than voters expressing an intent to vote to remain in the EU.
When compared with Remain voters, Leave voters displayed sig. lower levels of
numeracy & appeared more reliant on impulsive System 1 thinking. In the
experimental studies, voters on both sides were found to be susceptible to
the cognitive biases tested, but often, unexpectedly, to different degrees.
These results raise important questions regarding the use & framing of
numerical & non-numerical data for public consumption."
-- draft n5r67@[osf][7/2018],
project urt63@[osf]['18],
[oPf]['18].
[Also search for: brexit].
%T What Will the Future of Scientific Publishing Look Like?
%I Lindau Nobel Laureate Meetings
%K c2018, c201x, c20xx, zz0718, publish perish, grants, fellowship, impact,
JIF, citations, journal, journals, Ropers ceo Springer, Schekman, PNAS,
eLife, EMBO, open, access, reviewing, referees, LIN, LIN018, Lindau meeting,
Nobel, NobelPrize, panel discussion, scientific research, university,
academic, publication, publications, papers
%M JUN
%D 2018
%X "Publish or perish - anyone working in research or academia knows that
phrase all too well and has felt the pressure and dread caused by it. ...
the current way of researchers climbing over one another or, worse yet,
molding their results to fit a promising narrative to get a publication in
one of the glamour journals, is unsustainable. The rationale behind wanting a
'big' publication is simple: A paper in a journal with a high glamour factor
(which is closely correlated to the impact factor of the journal) such as
Nature, Science or Cell promises high visibility for the leading authors of
the paper and presumably heightens their value and prospects when applying
for a new fellowship or grant. ..."
-- [www][28/6/2018] inc. the video. (Via AK).
[Also search for: publish perish] and check out
Schekman & eLife, e.g., [doi:10.7554/eLife.31697][12/10/2017].
%A E. S. Bernstein
%A S. Turban
%T The impact of the 'open' workspace on human collaboration
%J Phil. Trans. of the Royal Soc. B
%V 373
%N 1753
%M JUL
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0718, open plan office, space, openPlan, F2F,
management, business, organization, company, layout, human behaviour,
experiment, stats
%X "Organizations' pursuit of increased workplace collaboration has led managers
to transform traditional office spaces into 'open', transparency-enhancing
architectures with fewer walls, doors and other spatial boundaries, yet there
is scant direct empirical research on how human interaction patterns change
as a result of these architectural changes. In two intervention-based field
studies of corporate headquarters transitioning to more open office spaces,
we empirically examined ... In short, rather than prompting increasingly
vibrant face-to-face collaboration, open architecture appeared to trigger a
natural human response to socially withdraw from officemates and interact
instead over email and IM [messaging]. ..."
-- [doi:10.1098/rstb.2017.0239]['18].
%A S. Cave
%A K. Dihal
%T Ancient dreams of intelligent machines: 3,000 years of robots
%J Nature
%V 559
%P 473-475
%M JUL
%D 2018
%K c2018, c201x, c20xx, zz0718, robot, gods, robots, android, AI, automaton,
Alife, Ingenious Devices, HAL, Skynet, Mayor, books, literature
%X "... hopes and fears that have been associated with human-like machines for
nearly three millennia. ... In her forthcoming book Gods and Robots,
classicist Adrienne Mayor describes bronze automata that featured at the
Olympic Games two centuries before the Argonautica - a leaping dolphin and
eagle in apparent flight. ..."
-- [doi:10.1038/d41586-018-05773-y]['18].
[Also search for: android].
%A D. Dor
%A M. Tarsi
%T A simple algorithm to constract a consistent extension of a
partially oriented graph
%R R-185
%I Cog. Sys. Lab., UCLA
%M OCT
%D 1992
%K TR, TR185, c1992, c199x, c19xx, Dorit, zz0718, maths, partially oriented,
directed, graph, PDAG, hybrid, DAG, extension, causal, Vstructure, collider,
independencies
%X "A partially directed acyclic graph, (pdag), is a g. which contains both
directed & undir. edges, with no dir. cycle in its dir. subgraph. An oriented
extension of a pdag G is a fully dir. acyclic graph (DAG) on the same
underlying set of edges, with the same orientation on the directed subg. of
G & the same set of vee-structures. A vee-struct. is formed by two edges,
directed toward a common head, while their tails are nonadjacent. A simple
polynomial-time alg. is presented, to solve the following problem: Given a
pdag, does it admit an oriented extension? The problem was stated by Verma
& Pearl, while studying the existence of causal explanation to a given set of
observed independencies." (Note, "polynomial-time".)
"extend( G: pdag )
{ G' := G; A := G;
while A is not empty do
{ Select a vertex x in A s.t.
(a) x is a sink (no edge x -> y) and
(b) for every vertex y adjacent to x with (x,y) undirected,
y is adjacent to all other vertices which are adjacent to x;
If no such x can be found then return (false, _); /*else...*/
direct all edges involving x to x in G';
A := A-x; /*remove x and all edges involving x*/
}
return (true, G');
}"
-- pdf@[ucla]['18].
[Also search for: PDAG] and [also search for: graph recovery algorithm].
%A L. Babai
%A E. Szemeredi
%T On the complexity of matrix group problems I
%J FOCS
%I IEEE
%D 1984
%K conf, FOCS, FOCS84, FOCS25, c1984, c198x, c19xx, zz0718, matrix, group,
straight line program, straightLineProgram, maths, word, problem,
reachability, subgroup, NPB, black box
%X "We build a theory of black box groups, & apply it to matrix grps over finite
fields. Elts of a black box grp are encoded by strings of uniform length &
grp operations are performd by an oracle. Subgrps are given by a list of
generators. We prove that for such subgrps, membership & divisor of the order
are in NP^B. (B is the grp box oracle.) Under a plausible math. hypothesis on
short presentations of finite simple grps, non membership & exact order will
also be in NP^B & thus in NP^B intersection coNP^B."
-- [doi:10.1109/SFCS.1984.715919]['18] (uk us isbn:081860591X),
pdf@[c'mputer.org]['18].
(alludes to a second, later paper.)
(And, "Babai & Szemeredi (1984) ... prove that every elt of a finite group
G has an SLP of length O(log^2 |G|) in every generating set. ..."
-- SLP@[wikip]['18].
(auth EM@[r'nyi.hu]['18].)
[Also search for: group word problem].
%A T. S. Verma
%A J. Pearl
%T Deciding morality of graphs is NP-complete
%J UAI
%P 391-399
%D 1993
%K conf, UAI, UAI93, UAI1993, c1993, c199x, c19xx, zz0718, maths, graph, DAG,
causal, explanation, recovery algorithm, moral, NPC
%X "In order to find a causal explanation for data presented in the form of
covariance & concentration matrices it is necessary to decide if the graph
formed by such associations is a projection of a directed acyclic graph
(DAG). We show that the general problem of deciding whether such a dag exists
is NP-complete."
-- [doi:10.1016/B978-1-4832-1451-1.50052-4]['18],
1303.1501@[arXiv]['18].
[Also search for: graph recovery algorithm].
%A G. J. Cane
%T Linear estimation of parameters of the Cauchy distribution based on
sample quantiles
%J J. Amer. Stat. Assoc.
%V 69
%N 345
%P 243-245
%M NOV
%D 1974
%K jrnl, c1974, c197x, c19xx, zz0718, Gwenda, Cauchy distribution, pdf,
estimate, estimator, quantile, heavy, fat tail, tailed, fatTail, half
%X "Asymptotically best linear unbiased estimates (ABLUE) of the location &
scale params (when both are unknown) of the Cauchy distn, based on k order
statistics selected from a large sample, are considered. It is shown that the
joint asymptotic relative efficiency (JARE) of the two ests. is maximized
when the sample quantiles are equally spaced, & expressions are derived for
the coefficients used in these estimates. In estimating the scale param.
using a reasonably large # of quantiles, it is found that not much weight is
attached to the extreme observations or those close to the median."
-- [doi:10.1080/01621459.1974.10480163]['18],
2285535@[Jstor]['19].
[Also search for: Cauchy distribution].
(Also see,
"... Cauchy.d's pdf(x|x_0,g) = 1/(pi g {1+((x-x_0)/g)^2})
... mean & variance undefined, median=x_0, mode=x_0 ...
... [Eg,] the truncated mean of the middle 24% of the sample order stats
produces an estimate for x_0 that is more efficient than using either the
sample median or the full sample mean.
... maximum likelihood est.... numerical solution ..."
-- C@[wikip]['18].)
%A T. P. Minka
%T Estimating a Dirichlet distribution
%D 2000
%K TR, c2000, c200x, c20xx, zz0718, estimate, estimator, estimating, stats
%X "The D.distn & its compound variant, the Dirichlet-multinomial, are two of
the most basic models for proportional data, such as the mix of vocabulary
words in a text document. Yet the max.-likelihood est. of these distns is not
available in closed-form. ... describes simple & efficient iterative schemes
for obtaining param. ests. in these models. In each case, a fixed-point
iteration & a Newton-Raphson (or generalized N.-R.) iteration is provided."
-- pdf@[c'teseer]['18],
and revised 2003, 2009, 2012
-- pdf@[g'th'b]['18].
[Also search for: Dirichlet estimate stats].
%A P. Spirtes
%A T. Richardson
%T Ancestral graph Markov models
%J Ann. Statist.
%V 30
%N 4
%P 962-1030
%D 2002
%K jrnl, c2002, c200x, c20xx, zz0718, ancestral graph, maths, ancestralGraph,
graphs, DAG, mixed, hybrid, model, causal, graphical independence
%X "... introduces a class of graphical independence models that is closed under
marginalization and conditioning but that contains all DAG independence
models. This class of g., called maximal ancestral gs., has two attractive
features: there is at most one edge between each pair of vertices; every
missing edge corresponds to an independence relation. These features lead to
a simple parameterization of the corr. set of distns in the Gaussian case."
-- paper@[eucl'd]['18].
[Also search for: ancestralGraph].
%A J. Textor
%A A. Idelberger
%A M. Liskiewicz
%T Learning from pairwise marginal independencies
%J UAI
%D 2015
%K conf, UAI, UAI15, UAI2015, c2015, c201x, c20xx, zz0718, DAG, maths, graph,
causal, model, graphs, independency, algorithm
%X "We consider graphs that represent pairwise marginal independencies amongst a
set of variables ([e.g.] the zero entries of a covariance matrix for normal
data). We characterize the DAGs that faithfully explain a given set of
independencies, & derive algs. to efficiently enumerate such structures. Our
results map out the space of faithful causal models for a given set of
pairwise marginal independence relations. This allows us to show the extent
to which causal inference is possible without using conditional independence
tests."
-- 1508.00280@[arXiv]['18],
pdf@[uai]['18].
%A C. Gray
%A L. Mitchell
%A M. Roughan
%T Generating connected random graphs
%J arXiv
%M JUL
%D 2018
%K TR, c2018, c201x, c20xx, zz0718, random, graph, randomGraph, maths, Waxman,
model, algorithm, generate
%X "... an alg. to produce connected random graphs using a Metropolis-Hastings
framework. [It] extends to a general f/wk for sampling from a known distn of
gs., conditioned on a desired property. We demonstrate the method to generate
connected spatially embedded random gs., specifically the well known Waxman
n/wk, & illustrate the convergence & practicalities of the alg.."
-- 1806.11276@[arXiv]['18].
[Also search for: random graph].
%A T. A. K. Zakian
%A T. L. Mcdonell
%A M. Cimini
%A R. R. newton
%T Ghostbuster: A tool for simplifying and converting GADTs
%J JFP
%V 28
%P e16
%M JUN
%D 2018
%K jrnl, eJrnl, JFP, c2018, c201x, c20xx, zz0718, datatype, type, types, check,
checking, GADT, GADTs, Generalized Algebraic Data Type, Ghostbuster
%X "... GADTs, can encode non-trivial properties in the types of the
constructors. ... however, all code manipulating that datatype must provide
proof that it maintains these properties in order to typecheck. ... take a
step toward gradualizing these obligations. We introduce a tool, Ghostbuster,
that produces simplified versions of GADTs which elide selected type params,
thereby weakening the guarantees of the simplified datatype in exchange for
reducing the obligations necessary to manipulate it. Like ornaments, these
simplified datatypes preserve the recursive structure of the original, but
unlike ornaments, we focus on information-preserving bidirectional
transformations. Ghostbuster generates type-safe conversion fns between the
original & simplified datatypes, which we prove are the identity fn when
composed. We evaluate a prototype tool for Haskell against thousands of GADTs
found on the Hackage package database, generating simpler Haskell98 datatypes
& round-trip conversion functions between the two." (online 22/6/2018.)
-- [doi:10.1017/S0956796818000114]['18].