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

Glookbib search for: zz1218

%A H. L. Bodlaender
%T A linear-time algorithm for finding tree-decompositions of small treewidth
%J SIAM J. Comput.
%V 25
%N 6
%P 1305-1317
%D 1996
%O Proc. 25th annual ACM symp. on Theory of comp. (STOC), pp 226 234, 1993
%K jrnl, STOC, c1996, c199x, c19xx, zz1218, maths, graph, tree, path,
   decomposition, bounded, treewidth, width, algorithm
%X "... for const k a linear-time alg. that, given a graph $G = (V,E)$,
   determines whether the treewidth of G is at most k &, if so, finds a
   tree-decomposition of G with treewidth at most k. A consequence is that every
   minor-closed class of graphs that does not contain all planar graphs has a
   linear-time recognition alg.. [&] a similar result holds when we look instead
   for path-decompositions with pathwidth at most some constant k."
   -- [doi:10.1137/S0097539793251219]['18].
   [Also search for: graph decomposition].

%A M. AlQuraishi
%T Some thoughts on a mysterious universe
%J wordpress
%M DEC
%D 2018
%K news, views, MolBio, c2018, c201x, c20xx, zz1218, MolBio, protein, folding,
  structure, prediction, CASP, CASP13, AlphaFold, DeepMind, google
%X "... you may have heard that DeepMind's debut went rather well. So well in
   fact that not only did they take first place, but put a comfortable distance
   between them and the second place predictor ..."
   -- [www]['18].
   (*See [casp13]['18].*)
   [Also search for: MolBio alphafold].

%A S. A. Purro
%A et al ...
%A J. Collinge
%T Transmission of amyloid-beta protein pathology from cadaveric pituitary
   growth hormone
%J Nature
%V ?
%N ?
%P ?-?
%M DEC
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1218, human health, risk, risks,
   Creutzfeldt-Jakob disease, CJD, Alzheimers, transmission, prion
%X "We previously reported the presence of amyloid-beta protein (Abeta) deposits
   in individuals with Creutzfeldt-Jakob disease (CJD) who had been treated
   during childhood with human cadaveric pituitary-derived growth hormone
   (c-hGH) contaminated with prions. ..."
      -- [doi:10.1038/s41586-018-0790-y]['18].
   [Also search for: prion disease].

%E G. Trogemann
%E A. Y. Nitussov
%E W. Ernst
%A A. Y. Nitussov (trans.)
%T Computing in Russia : the history of computer devices and information
   technology revealed
%P 350
%I Braunschweig; Wiesbaden: Vieweg
%D 2001
%K book, text, c2001, c200x, c20xx, zz1218, ternary, computer, computers,
   history, Russia, Russian, Soviet, Setun, 1958, Brusentsov
%X -- 39089515@[nla.gov.au]['18].
   (Also see, "... The first modern, electronic ternary computer Setun was
   built in 1958 in the Soviet Union at the Moscow State University by
   Nikolay Brusentsov ..."
   -- TC@[wikip]['18].)
   [Also search for: ternary computer].

%A M. Glusker
%A D. M. Hogan
%A P. Vass
%T The ternary calculating machine of Thomas Fowler
%J IEEE Annals of the History of Computing
%V 27
%N 3
%P 4-22
%M JUL-SEP
%D 2005
%K jrnl, c2005, c200x, c20xx, zz1218, 1840, 19C, Thomas Fowler, history,
   computing, computer, computers, balanced ternary, calculator
%X "In 1840, Thomas Fowler, a self-taught English mathematician & inventor,
   created a unique ternary calculating machine. Recently, all detail of this
   machine was lost. A research project begun in 1997, uncovered sufficient
   information to enable the recreation of a physical concept model of Fowler's
   machine. The next step is to create a historically accurate replica."
   -- [doi:10.1109/MAHC.2005.49]['18].
     (Note: 'balanced ternary' has base 3 & digits for -1,0,+1, {n,z,p} say,
      0='z', 1='p', 2='pn' (i.e., 3-1), 3='pz', 4='pp', 5='pnn' (9-3-1), etc.;
      to negate a number, swap all 'p's to 'n's and all 'n's to 'p's.)
     ['Description of a calculating machine, invented by Mr. Thomas Fowler of
      Torrington in Devonshire', Archive Papers, A.DeMorgan,
      The Royal Soc., London, 1840.]
   (Also see TF@[wikip]['18].)
   [Also search for: ternary computer].

%A G. Tesauro
%T Temporal difference learning and TD-Gammon
%J CACM
%V 38
%N 3
%P 58-68
%M MAR
%D 1995
%K jrnl, CACM, c1995, c199x, c19xx, zz1218, back gammon, backgammon, TD gammon,
   TDgammon, AI, game, games, playing, reinforcement learning
%X "...  complex board games such as Go, chess, checkers, Othello, & backgammon
   has been widely regarded as an ideal testing ground for exploring a variety
   of concepts & approaches in AI & ML. Such board games offer the challenge of
   tremendous complexity & sophistication required to play at expert level. At
   the same time, the problem inputs & performance measures are clear-cut & well
   defined, & the game environment is readily automated in that it is easy to
   simulate the board, the rules of legal play, & the rules regarding when the
   game is over & determining the outcome."
   -- [doi:10.1145/203330.203343]['18].
   [Also search for: backgammon].
   (Also see RL@[wikip]['22].)

%A M. A. Edwards
%A S. Roy
%T Academic research in the 21st century: Maintaining scientific integrity in a
   climate of perverse incentives and hypercompetition
%J Environmental Eng. Sci.
%V 34
%N 1
%P ?-?
%M JAN
%D 2017
%K jrnl, c2017, c201x, c20xx, zz1218, publish, perish, scientific, research,
   ethics, integrity, academic, university, KPI, KPIs, grant, grants,
   EPA, NIH, ARC, misconduct, manipulation, abuse
%X "Over the last 50 years, we argue that incentives for academic scientists
   have become increasingly perverse in terms of competition for res.funding,
   development of quantitative metrics to measure performance, & a changing
   business model for higher ed. itself. [&] decreased discretionary funding at
   the federal & state level is creating a hypercompetitive environment between
   gvmt agencies (e.g., EPA, NIH, CDC), for scientists in these agencies, & for
   academics seeking funding from all sources - the combination of perverse
   incentives & decreased funding increases pressures that can lead to unethical
   behavior. If a critical mass of scientists become untrustworthy, a tipping
   point is possible in which the scientific enterprise itself becomes
   inherently corrupt & public trust is lost, risking a new dark age with
   devastating consequences to humanity. Academia & federal agencies should
   better support science as a public good, & incentivize altruistic & ethical
   outcomes, while de-emphasizing output."
   -- [doi:10.1089/ees.2016.0223]['18].
   [Also search for: publish perish]  and  [also search for: misconduct].

%A C. Candia
%A C. Jara-Figueroa
%A C. Rodriguez-Sickert
%A A.-L. Barabasi
%A C. A. Hidalgo
%T The universal decay of collective memory and attention
%J Nature Human Behaviour
%V ?
%P ?-?
%M DEC
%D 2018
%K jrnl, c2018, c201x, c20xx, zz1218, human behaviour, collective memory,
   influence, culture, universal biexponential, distribution, publications,
   papers, citations
%X "Collective memory & attention are sustained by two channels: oral
   communication (communicative memory) & the physical recording of information
   (cultural memory). Here, we use data on the citation of academic articles &
   patents, & on the online attention received by songs, movies & biographies,
   to describe the temporal decay of the attention received by cultural
   products. ... the attention received by cultural products decays following a
   universal biexponential function. ... biographies remain in our communicative
   memory the longest (20-30y.) & music the shortest (~5.6y.). ... show
   that the avg. attention received by cultural products decays following a
   universal biexponential fn."
   -- [doi:10.1038/s41562-018-0474-5]['18].

%A S. Parter
%T The use of linear graphs in Gauss elimination
%V 3
%N 2
%P 119-130
%M APR
%D 1961
%K jrnl, c1961, c196x, c19xx, zz1218, maths, graph, Gaussian, elimination,
   sparse, matrix, system, equations, solve
%X "A proc. to study the effect of sparseness in G.elimination & to choose an
   elimination scheme if practical ... The associations between graphs &
   matrices are developed & illustrated, & properties of special graphs, the
   trees, are discussed. The occasional breakdown of the G.proc. is also
   illustrated."
   -- [doi:10.1137/1003021]['18],
      2027387@[Jstor]['18].
   [Also search for: elimination].

%A N. Srebro
%T Maximum likelihood bounded tree-width Markov networks
%J AI
%V 143
%N 1
%P 123-138
%M JAN
%D 2003
%O Proc. 17th Conf. on Uncertainty in AI (UAI2001)
%K jrnl, AI, c2003, c200x, c20xx, zz1218, graph, bounded treewidth, width,
   tree, algorithm, masters MIT, hypertree, NPH, NP-hard, NPhard,
   Markov, network, Chow, Liu
%X "... problem of projecting a distribution onto (or finding a maximum
   likelihood distribution among) Markov networks of bounded tree-width. By
   casting it as the combinatorial optimization problem of finding a maximum
   weight hypertree, we prove that it is NP-hard to solve exactly and provide
   an approximation alg. with a provable performance guarantee."
   -- [doi:10.1016/S0004-3702(02)00360-0]['18], and
      1301.2311@[arXiv]['18].
   (And S's masters thesis: "Maximum Likelihood Markov Networks: An
       Algorithmic Approach", MIT, 2000,
       pdf@[mit]['18].)