Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0221
%A G. B. Dantzig
%T George Dantzig
%K Dantzig, zz0221, linear programming, simplex algorithm, optimisation,
optimization, biography, biog
%X "... Dantzig is known for his development of the simplex algorithm, an
alg. for solving linear programming problems ..."
-- D@[wikip]['21].
%A S. Keretsu
%A S. P. Bhujbal
%A S. Joo Cho
%T Rational approach toward COVID-19 main protease inhibitors via molecular
docking, molecular dynamics simulation and free energy calculation
%J Sci. Reps.
%V 10
%N #17716
%M OCT
%D 2020
%K MolBio, jrnl, ejrnl, c2020, c202x, c20xx, zz0221, 3CL pro, 3CLpro, protease,
MEROPS, SARS-CoV-2, SARS2, SARSCov2, inhibitor, saquinavir, aclarubicin,
TMC-310911, TMC310911, faldaprevir
%X "... A combination of modeling studies was performed to identify potential
3CLpro inhibitors from the protease inhibitor database MEROPS
[www]. Binding energy
evaluation identified key residues for inhibitor design. We found 15
potential 3CLpro inhibitors with higher binding affinity than that of an
alpha-ketoamide inhibitor determined via X-ray structure. Among them,
saquinavir and three other investigational drugs aclarubicin, TMC-310911, &
faldaprevir could be suggested as potential 3CLpro inhibitors. We recommend
further experimental investigation of these compounds."
-- [doi:10.1038/s41598-020-74468-0]['21].
[Also search for: MolBio 3CLpro inhibitor].
%A K. Sahlin
%T Strobemers: an alternative to k-mers for sequence comparison
%J BioRxiv
%M JAN
%D 2021
%K MolBio, TR, c2021, c202x, c20xx, zz0221, Strobemer, Kmers, gapped, seeds
%X "... a single mutation will mutate k consec. k-mers & makes most k-mer based
applications for seq. comparison sensitive to variable mutation rates. Many
techniques have been studied to overcome this sensitivity, e.g., spaced
k-mers & k-mer permutation techniques, but these techniques do not handle
indels well. ...propose strobemers as an alternative to k-mers for seq.
comparison. Intuitively, strobemers consists of linked minimizers. We show
that under a certain minimizer selection technique, strobemers provide more
evenly distributed sequence matches than k-mers & are less sensitive to
different mutation rates & distributions. ..." [via AK]
-- at[bioRxiv]['21].
%T BLAS (Basic Linear Algebra Subprograms)
%D 1979 +
%K Basic Linear Algebra Subprograms, BLAS, zz0221, OpenBLAS, software,
numerical methods, scientific computing, netlib, vectors, matrices, matrix
%X -- [wikip]['21],
blas@[netl'b]['21].
[Also search for: BLAS numerical].
%T Poe's law
%D 2005
%K Poe, Poes law, c2005, c200x, c20xx, zz0221, funny laws, ha ha, haha,
adage, maxim, parody, irony, creationism, flat earth, Qanon
%X "Poe's law is an adage of Internet culture stating that, without a clear
indicator of the author's intent, it is impossible to create a parody of
extreme views so obviously exaggerated that it cannot be mistaken by some
readers for a sincere expression of the views being parodied. The original
statement, by Nathan Poe, read:
Without a winking smiley or other blatant display of humor, it is utterly
impossible to parody a Creationist in such a way that someone won't
mistake for the genuine article.
-- PL@[wikip]['21].
[Also search for: funny laws].
%T Brandolini's law
%D 2015
%K Brandolini, law, c2015, c201x, c20xx, zz0221, funny, laws, haha, ha ha,
bullshit, fake news, fakeNews, rumours, misinformation, disinformation,
lies, postTruth, Qanon, conspiracy, conspiracist
%X "Brandolini's law, also known as the bullshit asymmetry principle ...
The amount of energy needed to refute bullshit is an order of magnitude
larger than to produce it."
-- BL@[wikip]['21].
[Also search for: funny laws].
%A M. K. Wood
%A G. B. Dantzig
%T Programming of interdependent activities: I General discussion
%J Econometrica
%V 17
%N 3/4
%P 193-199
%M JUL-OCT
%D 1949
%I The Econometric Soc.
%K jrnl, c1949, c194x, c19xx, zz0221, linear programming, simplex algorithm
%X "... concerned with improved techniques of program planning, particularly as
they apply to the scheduling of activities over time within an organization
or economy in which the activities must share in the use of limited amounts
of various commodities. The contemplated use of electronic computers for
rapidly computing programs and the assumptions underlying the math. model
are discussed. The paper is concluded by an illustrative example."
-- [doi:10.2307/1905522]['21],
or 1905522@[Jst'r]['21].
[Also search for: Dantzig linear programming].
%A G. B. Dantzig
%T Programming of interdependent activities: II Mathematical model
%J Econometrica
%V 17
%N 3/4
%P 200-211
%M JUL-OCT
%D 1949
%I The Econometric Society
%K jrnl, c1949, c194x, c19xx, zz0221, linear programming, simplex algorithm
%X "Activities (or production processes) are considered as building blocks out
of which a technology is constructed. Postulates are developed by which
activities may be combined. The main part of the paper is concerned with
the discrete type model and the use of a linear maximization function for
finding the "optimum" program. The math. problem associated with this
approach is developed first in general notation and then in term sof a
dynamic system of equations expressed in matrix notation. Typical problems
from the fields of inter-industry relations, transportation nutrition,
warehouse storage, and air transport are given in the last section.
-- [doi:10.2307/1905523]['21],
or 190552@[Jst'r]['21].
[Also search for: Dantzig linear programming].