Search engine run on: http://users.monash.edu.au/


Glookbib search for: zz1222

%A G. Blanc
%A J. Lange
%A Mingda Qiao
%A Li-Yang Tan
%T Properly learning decision trees in almost polynomial time
%J JACM
%V 69
%N 6
%P #39 (1-19)
%M NOV
%D 2022
%K jrnl, JACM, c2022, c202x, c20xx, zz1222, AI, II, decision tree, DTree,
   binary, influential variable, OSSS, Servedio
%X "We give an n^{O(log log n)}-time membership query alg. for properly &
   agnostically learning DTs under the uniform dist'n over {+/-1}^n. [It] shares
   similarities with practical heuristics for learning DTs ... we prove a new
   structural result for DTs that strengthens a theorem of O'Donnell, Saks,
   Schramm, & Servedio. While the OSSS theorem says that every DT has an
   influential variable, we show how every DT can be 'pruned' so that every
   variable in the resulting tree is influential."
   -- [doi:10.1145/3561047]['22].
   [Also search for: DTree].

%A D. de Andrade
%A et al
%T Investigating the relationship between inaccurate blood alcohol concentration
   estimates, harm and other negative consequences
%J Drug and Alcohol Review
%M NOV
%D 2022
%K jrnl, c2022, c202x, c20xx, zz1222, alcohol consumption, drinking, zzAlcohol,
   drunkeness, BAC, human health, harm, risks, Australia, Queensland, uniQld
%X "... Patrons with a low BAC were more likely to overestimate their BAC, while
   patrons with higher BACs were more likely to underest. their BAC. Moderately
   intoxicated patrons had the most precise BAC estimations. Patrons with a high
   BAC & who underestimated their intoxication level were more likely to have
   been recently ejected from licensed venues, compared to accurate estimators
   or over-estimators."
   -- [doi:10.1111/dar.13569]['22].
   One for the season.  [Also search for: zzAlcohol].

%A L. Babai
%T Canonical form for graphs in quasipolynomial time. Preliminary Report
%J Proc. 51st Annual ACM SIGACT Symp. on Theory of Comp.
%P 1237-1246
%M JUN
%D 2019
%K conf, STOC, c2019, c201x, c20xx, zz1222, maths, graph, canonical labelling,
   form, isomorphism
%X "We outline how to turn the author's quasipolynomial-time g.isomorphism test
   into a construction of a canonical form within the same time bound. The proof
   involves a nontrivial mod'n of the central symmetry-breaking tool, the
   construction of a canonical relational structure of logarithmic arity on the
   ideal domain based on local certificates."
   -- [doi:10.1145/3313276.3316356]['22].
   [Also search for: graph canonical].

%A F. Le Gall
%A S.Seddighin
%T Quantum meets fine-grained complexity: Sublinear time quantum algorithms for
   string problems
%J Algorithmica
%M DEC
%D 2022
%K jrnl, c2022, c202x, c20xx, zz1222, quantum computing, algorithm, strings,
   LeGall, LCS, LCSS, LPS, Ulam distance, LASS
%X "Longest common substring (LCS), longest palindrome substring (LPS), & Ulam
   distance (UL) are 3 fundamental string problems that can be classically
   solved in near linear time. ... we present sublinear time q.algs. for these
   problems along with q.lwbs. ... shed light on a v. surprising fact: Although
   the classic solns for LCS & LPS are almost identical (via suffix trees),
   their q. computational complexities are different. While we give an exact
   ~O(sqrt n) time alg. for LPS, we prove that LCS needs at least time
   ~Omega(n^{2/3}) even for 0/1 strings."
   -- [doi:10.1007/s00453-022-01066-z]['22].
   (Ulam dist. is a special case of ED where no char. is allowed to appear more
   than once in a string.  [Also search for: longest ascending subsequence].)

%A Yujia Li
%A et al ...
%A O. Vinyals
%T Competition-level code generation with AlphaCode
%J Science
%V 378
%N 6624
%P 1092-1097
%M DEC
%D 2022
%K jrnl, c2022, c202x, c20xx, zz1222, AlphaCode, ANN, NN, programming,
   transformer, transformerNN, Codeforces
%X "... we introduce AlphaCode, a system for code gen. that achieved an avg
   ranking in the top 54.3% in simulated eval'ns on recent programming comps. on
   the Codeforces platform. AlphaCode solves problems by generating millions of
   diverse programs using specially trained transformer-based networks & then
   filtering & clustering those programs to a max. of just 10 submissions. ..."
   -- [doi:10.1126/science.abq1158]['22].

%A J. A. Cuff
%A G. J. Barton
%T Application of multiple sequence alignment profiles to improve protein
   secondary structure prediction
%J Proteins
%V 40
%N 3
%P 502-511
%M JUN
%D 2000
%K jrnl, MolBio, c2000, c200x, c20xx, zz1222, MSA, NN, ANN, jpred, jnet
%X "The effect of training a NN sec. struct. pred. alg. with different types of
   multiple seq. alignment profiles derived from the same seqs., is shown to
   provide a range of accuracy from 70.5% to 76.4%. ... "
   -- [www]['22].
   [Also search for: secondary structure prediction].

%A L. J. McGuffin
%A K. Bryson
%A D. T. Jones
%T The PSIPRED protein structure prediction server
%J Bioinformatics
%V 16
%N 4
%P 404-405
%M APR
%D 2000
%K jrnl, MolBio, c2000, c200x, c20xx, zz1222, psipred, ANN, NN, memsat 2,
   memsat2, GenThreader, secondary
%X "... allows users to submit a p. seq., perform a pred'n of their choice ...
   The user may select one of three pred'n methods ...: PSIPRED ...; MEMSAT 2
   or GenTHREADER ..."
   -- [doi:10.1093/bioinformatics/16.4.404]['22].
   (Also see psipred@[wikip]['22].)

%A J. M. Jumper
%A N. F. Faruk
%A K. F. Freed
%A T. R. Sosnick
%T Trajectory-based training enables protein simulations with accurate folding
   and Boltzmann ensembles in cpu-hours
%J PLoS Comp. Biol.
%M DEC
%D 2018
%K jrnl, eJrnl, MolBio, c2018, c201x, c20xx, zz1222, Upside, protein folding,
   simulation, trajectory
%X "... we use the contrastive divergence technique from mach.l. to train from
   simulations of 450 proteins. ... the computational efficiency of the model
   enables high accuracy through the precise tuning of the Boltzmann ensemble.
   ... applied to our recently developed Upside model, where the free energy for
   side chains is rapidly calculated at every time-step, allowing for a smooth
   energy landscape without steric rattling of the side chains. After this
   contrastive divergence training, the model is able to de novo fold proteins
   up to 100 residues on a single core in days. ..."
   -- [doi:10.1371/journal.pcbi.1006578]['22].  (JJ involved with AlphaFold).
   [Also search for: protein folding simulation].

%A C. L. Brooks
%A et al
%T Classical molecular dynamics
%J J. Chem. Phys.
%V 154
%P 100401
%M MAR
%D 2021
%K jrnl, MolBio, c2021, c202x, c20xx, zz1222, history, survey, intro, views,
   special issue, software, CHARMM, GROMACS, LAMMPS, NAMD, protein folding,
   simulation, molecular dynamics, trajectory, pathway
%X "... highlights both developments in & applications of classical molecular
   simulation in 67 articles. ... inc. discussion of some of the major s/w
   packages for classical molecular dynamics (MD), inc. Amber, CHARMM, GROMACS,
   LAMMPS, and NAMD. ..."  (74 refs)
   -- [doi:10.1063/5.0045455]['22].
   [Also search for: protein folding simulation].

%A C. Outeiral
%A D. A. Nissley
%A C. M. Deane
%T Current structure predictors are not learning the physics of protein folding
%J Bioinformatics
%V 38
%N 7
%P 1881-1887
%M APR
%D 2022
%K jrnl, MolBio, c2022, c202x, c20xx, zz1222, protein folding, structure,
   pathway, trajectory, AlphaFold 2, RoseTTAFold, trRosetta, RaptorX, DMPfold,
   EVfold, SAINT2, Rosetta, uniOxford
%X "... deep learning ... unprecedented success at predicting a protein's
   crystal structure, but it is not clear if these models are learning the
   physics of how ps. dynamically fold ... find evidence that their simulated
   dynamics capture some info. about the folding pathway, but their predictive
   ability is worse than a trivial classifier using seq.-agnostic features like
   chain length. The folding trajectories produced are also uncorrelated with
   experimental observables such as intermediate structs. & the folding rate
   constant. ... suggest that recent advances in structure pred'n do not yet
   provide an enhanced understanding of protein folding."
   -- [doi:10.1093/bioinformatics/btab881]['22]  (online Jan 2022).
   [Also search for: protein folding trajectory].

%A K. H. Kjaer
%A et al
%T A 2-million-year-old ecosystem in Greenland uncovered by environmental DNA
%J Nature
%V 612
%P 283-291
%M DEC
%D 2022
%K jrnl, MolBio, c2022, c202x, c20xx, zz1222, ancient DNA, environmental, eDNA,
   mastodon, Greenland
%X "... we report an ancient environmental DNA (eDNA) record describing the rich
   plant & animal assemblages of the Kap Kobenhavn Formation in North Greenland,
   dated to around two million years ago. ..."
   -- [doi:10.1038/s41586-022-05453-y]['22].
   [Also search for: MolBio ancient DNA].
   (Also see later news [www]['23].)

%A D. V. Tikhonenkov
%A et al
%T Microbial predators form a new supergroup of eukaryote
%J Nature
%M DEC
%D 2022
%K MolBio, jrnl, c2022, c202x, c20xx, zz1222, evolution, eukaryote, microbes,
   microbe, tree, life, Provora, Nebulidia, Nibbleridia, 18S rRNA
%X "... Here we report ten previously undescribed strains of microbial predators
   isolated through culture that collectively form a diverse new supergroup of
   eukaryotes, termed Provora. ..."
   -- [doi:10.1038/s41586-022-05511-5]['22].
   (Also see [www]['22].)
   [Also search for: MolBio tree life].

%A W. Msemburi
%A et al
%T The WHO estimates of excess mortality associated with the COVID-19 pandemic
%J Nature
%M DEC
%D 2022
%K MolBio, jrnl, c2022, c202x, c20xx, zz1222, covid19, covid 19, human health,
   pandemic, death, deaths, WHO, stats, estimate
%X "... we report a comprehensive & consistent measurement of the impact of the
   COVID-19 pandemic by estimating excess deaths, by month, for 2020 & 2021. We
   predict the pandemic period all-cause deaths in locations lacking complete
   reported data using an overdispersed Poisson count framework that applies
   Bayesian inference techniques to quantify uncertainty. We estimate 14.83
   million excess deaths globally, 2.74 times more deaths than the 5.42 million
   reported as due to COVID-19 for the period. ..."
   -- [doi:10.1038/s41586-022-05522-2]['22].

%A S. Dash
%A Y. Kaddar
%A H. Paquet
%A S. Staton
%T Affine monads and lazy structures for Bayesian programming
%J arXiv
%M DEC
%D 2022
%O accepted for POPL 2023
%K TR, c2022, c202x, c20xx, zz1222, FP, probability, LazyPPL, AI, II, monad,
   measures, laziness
%X "We show that streams & lazy data structures are a natural idiom for
   programming with infinite-dimensional Bayesian methods such as Poisson
   processes, Gaussian ps., jump ps., Dirichlet ps., & Beta ps.. ... synthetic
   probability theory, is to work with two separate monads: an affine monad of
   probability, which supports laziness, & a commutative, non-affine monad of
   measures, which does not. (Affine means that T(1)~=1.) We show that the
   separation is important from a decidability perspective, & that the recent
   model of quasi-Borel spaces supports these two monads. To perform B.inference
   with these examples, we introduce new inference methods that are specially
   adapted to laziness; they are proven correct by reference to the
   Metropolis-Hastings-Green method. Our theor. development is implemented as a
   Haskell library, LazyPPL."
   -- 2212.07250@[arXiv]['22].
   [Also search for: FP probability].

%A E. Garfield
%A A. Welljams-Dorof
%T Of Nobel class: A citation perspective on high impact research authors
%J Theor. Medicine
%V 13
%P 117-135
%M JUN
%D 1992
%K jrnl, c1992, c199x, c19xx, zz1222, bibliometrics, impact, productivity,
   papers, publications, citations, ISI, scientific research, Nobel prize,
   academia, quote, quotable, publish, perish
%X "... to determine if quantitative rankings of highly cited research authors
   confirm Nobel prize awards. ..."
   -- [doi:10.1007/BF02163625]['22].
 * "productivity (articles per author), author impact (citations per author), &
   article impact (citations per paper)."
 * "[in 1961] the avg Nobel author received 169 citations, 30 times more than
   the avg author (5.5). [&] Nobelists were far more productive than the avg.
   They published 58.1 cited papers, 17 times more than the avg (3.37). But as a
   result, the average Nobelist-authored paper was cited 2.9 times, 'only' about
   double the average article (1.6)."
   [Also search for: publish perish].

%A J. E. Hirsch
%T An index to quantify an individual's scientific research output that takes
   into account the effect of multiple coauthorship
%J arXiv
%M FEB
%D 2010
%K TR, c2010, c201x, c20xx, zz1222, JEHirsch, Hbar, Hindex, hCore, publish,
   perish, modified bibliometrics, multi, multiple, author, authors,
   coauthorship
%X "I propose the index ('hbar'), defined as the number # papers of an
   individual that have citation count larger than or equal to the h of all
   coauthors of each paper, as a useful index to characterize the scientific
   output of a researcher that takes into account the effect of multiple
   coauthorship. The bar is higher for hbar."
   -- 0911.3144@[arXiv].
     "... A scientist has index hbar if hbar of his/her papers belong to his/her
     hbar core. A paper belongs to the hbar core of a sci't if it has >= hbar
     citations [&] belongs to the hbar-core of each of [its] coauthors ..."
   (The claimed benefits of Hbar over H seem doubtful to me.)
   [Also search for: modified Hindex]  and  [also search for: Hirsch Hindex].

%A O. Kinouchi
%A L. D. H. Soares
%A G. H. Cardoso
%T A simple centrality index for scientific social recognition
%J Physica A: Stat. Mech. and its Applications
%V 491
%P 632-640
%M FEB
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1222, modified bibliometrics, Kindex, graph,
   network, centrality, hub, Hindex, KPI, KPIs, publish, perish
%X "... bipartite n/wk of papers & authors that we call K-index. ... The K-index
   is robust to self-citations, is not limited by the total # of papers
   published by a researcher as occurs for the H-index & can distinguish in a
   consistent way researchers that have the same H-index but very different
   scientific social recognition. ..."
   -- [doi:10.1016/j.physa.2017.08.072]['22],
   1609.05273@[arXiv]['22].
     "If a researcher has K citing papers, each one with at least K citations,
     then their K-index is K."
   [Also search for: publish perish].  (And beware, there is another Kindex:-)

%A S. M. Fiil-Flynn
%A et al
%T Legal reform to enhance global text and data mining research
%J Science
%V 378
%N 6623
%M DEC
%D 2022
%K news, views, c2022, c202x, c20xx, zz1222, copyright, law, AI, training data,
   internet, www, image, images, text, data mining, TDM, international
%X "... Most text, images, & other materials that TDM [text data mining]
   researchers use are subject to copyright law. Copyright law gives the owner
   of a protected work the legal right to prohibit reproduction, distribution,
   modification, & other forms of exploitation of that work without the owner's
   permission. These rights apply even if the material is readily accessible -
   for example, published on the internet or available in a library. ..."
   -- [doi:10.1126/science.add6124]['22].
   [Also search for: copyright].

%A Ruoyu Wang
%A D. Sun
%A R. Wong
%A R. Ranjan
%T Horn rule discovery with batched caching and rule identifier for proficient
   compressor of knowledge data
%J SPE
%M NOV
%D 2022
%K jrnl, SPE, c2022, c202x, c20xx, zz1222, SInC, Prolog, ILP, LP, Horn clause,
   rule, discovery, AI, II, compress, data, compression
%X "... [here] proposes SInC, a semantic inductive compressor, to efficiently
   induce 1st-order Horn rules & semantically compress knowledge bases. SInC
   improves the scalability of top-down rule mining by batching correlated
   records in the cache & further optimizes the pruning of duplication &
   specialization via an identifier structure of Horn rules. ... evaluated on
   real-world & synthetic datasets & compared against the state-of-the-art. The
   results show that the batched caching speed up the rule mining procedure by
   more than two orders while consuming fewer than three times memory space. The
   identifier technique speeds up the duplication & specialization pruning by
   orders of magnitude with less than 5‰ & 15% error rates, resp.. SInC
   outperforms the state-of-the-art from the perspective of overall compression
   on both scalability & compression effect."
   -- [doi:10.1002/spe.3165]['22].
   [Also search for: AI II compression]  &  [also search for: ILP LP].

%A D. Chakraborty
%A D. Das
%A R. Krauthgamer
%T Clustering permutations: New techniques with streaming applications
%J arXiv
%M DEC
%D 2022
%K TR, c2022, c202x, c20xx, zz1222, permutation, ranking, cluster, clustering,
   Ulam distance, edit distance, k median, Kmedian, perm, rankings, algorithm
%X "We study the classical metric k-median clustering problem over a set of
   input rankings (i.e., permutations) ..., from social-choice theory to web
   search & databases. A folklore alg. provides a 2-approximate soln in
   polynomial time for all k=O(1), & works irrespective of the underlying dist.
   measure, so long it is a metric; however, going below the 2-factor is a
   notorious challenge. We consider the Ulam dist., a variant of the well-known
   edit-dist. metric, where strings are restricted to be permutations. ..."
   -- 2212.01821@[arXiv]['22].
   [Also search for: permutation distance].

%A H. Oosterbeek
%A R. Sloof
%A G. van de Kuilen
%T Cultural differences in ultimatum game experiments: Evidence from a
   meta-analysis
%J Experimental Economics
%V 7
%P 171–188
%M JUN
%D 2004
%K jrnl, c2004, c200x, c20xx, zz1222, game theory, ultimatum, ultimatumGame,
   threat, ultimate, offer, human behaviour, sharing, fairness, fair, unfair,
   punishment, responder, economics, negotiation, strategy, Hofsted, Inglehart
%X "... meta-analysis of 37 papers with 75 results ... find that on avg the
   proposer offers 40% of the pie to the responder. This share is smaller for
   larger pie sizes & larger when a strategy method is used or when subjects are
   inexperienced. On avg 16% of the offers is rejected. The rejection rate is
   lower for larger pie sizes & for larger shares offered. Responders are less
   willing to accept an offer when the strategy method is employed. As the
   results come from different countries, meta-analysis provides an alt. way to
   investigate whether bargaining behavior in ultimatum games differs across
   countries. We find differences in behavior of responders (& not of proposers)
   across g.regions. With one exception, these differences cannot be attributed
   to various cultural traits on which for inst. the cultural classifications of
   Hofstede (1991) & Inglehart (2000) are based."
    -- [doi:10.1023/B:EXEC.0000026978.14316.74]['22].
   (Also see UG@[wikip]['22].)
   [Also search for: ultimatum game].

%T Breakthrough in nuclear fusion energy announced
%I BBC
%M DEC
%D 2022
%K news, physics, c2022, c202x, c20xx, zz1222, nuclear fusion power,
   inertial confinement, LLNL, NIF
%X "... lasers had input 2.05 megajoules (MJ) of energy *to the target*,
   which had then produced 3.15 MJ of fusion energy output. ..."
   -- [bbc]['13/12/2022].
   But, "each laser shot requires about 300MJ of energy from the grid"
   -- Phys. Today [doi:10.1063/PT.6.2.20221213a][13/12/2022].
   Also see [llnl]['22] and
   NIF@[wikip]['22].
   [Also search for: nuclear fusion power].

%A W. Thomson
%T Escape from Model Land: How Mathematical Models Can Lead Us Astray and
   What We Can Do About It
%I BasicBooks
%M DEC
%D 2022
%K book, stats, c2022, c202x, c20xx, zz1222, statistics, model
%X 1st ed 2022; hb us$21; uk us isbn:1541600983, uk us isbn13:978-1541600980.
   "...illuminates the hidden dangers of models ... demonstrates how ms reflect
   the biases, perspectives, & expectations of their creators. ... shows us why
   understanding the limits of ms. is vital to using them well. ..."

%A D. Cenzato
%A V. Guerrini
%A Z. Lipták
%A G. Rosone
%T Computing the optimal BWT of very large string collections
%J arXiv
%M DEC
%D 2022
%K TR, c2022, c202x, c20xx, zz1222, optBWT, BWT, string, strings, many,
   collection, letter runs, SAIS, BCR, SAP
%X "It is known that the exact form of the ... (BWT) of a string coll'n depends,
   in most implementations, on the input order of the strings in the coll'n.
   Reordering strings of an input coll'n affects the # of equal-letter runs r
   ... we present the first tool that guarantees a BWT with minimum # of runs
   (optBWT), by combining i) an alg. that builds the BWT from a string coll'n
   (either SAIS-based ...] or BCR ...; ii) the SAP array data structure
   introduced in [...]; & iii) the alg. by Bentley et al. ..."
   -- 2212.01156@[arXiv]['22].
   [Also search for: BWT]  and  [also search for: BWT collection].


Search string: