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

Glookbib search for: zz0919

%A A. M. Lovett
%A B. Sandlund
%T A simple algorithm for minimum cuts in near-linear time
%J arXiv
%M AUG
%D 2019
%K TR, c2019, c201x, c20xx, zz0919, maths, graph, minimum, min cut, minCut,
   algorithm
%X "We consider the minimum cut problem in undirected, weighted graphs. We give
   a simple alg. to find a minimum cut that 2-respects (cuts two edges of) a
   spanning tree T of a graph G. ... can be used in place of the complicated
   subrtn given in Karger's near-linear time min. cut alg. (JACM, 2000). We give
   a self-contained version of K's alg. with the new proc., which is easy to
   state & relatively simple to implement. It produces a min. cut on an m-edge,
   n-vertex graph in O(m log^3 n) time with high probability. This performance
   matches that achieved by K., thereby matching the current state of the art."
   -- 1908.11829@[arXiv]['19].

%A T. Mieno
%A et al ...
%A M. Takeda
%T Minimal unique substrings and minimal absent words in a sliding window
%J arXiv
%M SEP
%D 2019
%K TR, c2019, c201x, c20xx, zz0919, short, minimal unique substring, MUS,
   minimal absent word, MAW, missing, nullomer, string, strings, sequence,
   algorithm, Crochemore
%X "A substring u of a string T is called a minimal unique substring (MUS) of
   T if u occurs exactly once in T and any proper substring of u occurs at least
   twice in T. A string w is called a minimal absent word (MAW) of T if w does
   not occur in T and any proper substring of w occurs in T. ... study computing
   MUSs and MAWs in a sliding window over a given string T. ... show how the set
   of MUSs can change in a sliding window over T, and present an O(n log s)-time
   and O(d)-space alg. to compute MUSs in a s.window of width d over T, where s
   is the maximum # of distinct chars. in every window. We then give tight upper
   & lower bounds on the maximum # of changes in the set of MAWs in a s.window
   over T. Our bounds improve on the prev.results in [Crochemore et al., 2017]."
   -- 1909.02804@[arXiv]['19].
   (Note 'minimal' not 'minimum'.)
   [Also search for: unique substring].

%A S. Gharibian
%A O. Parekh
%T Almost optimal classical approximation algorithms for a quantum
   generalization of Max-Cut
%M SEP
%D 2019
%K TR, c2019, c201x, c20xx, zz0919, maths, graph, max cut, maxCut,
   approximation algorithm, quantum model, interaction, anti-ferromagnetic
%X "... study classical product state approx. algs. for a physically motivated
   quantum generalization of Max-Cut, known as the q. Heisenberg model. This
   model is notoriously difficult to solve exactly, even on bipartite g., in
   stark contrast to the classical setting of Max-Cut. ... show, for any
   interaction graph, how to classically and efficiently obtain approx. ratios
   0.649 (anti-ferromagnetic XY model) and 0.498 (anti-ferromagnetic Heisenberg
   XYZ model). These are almost optimal; we show that the best possible ratios
   achievable by a product state for these models is 2/3 and 1/2, respectively."
   -- 1909.08846@[arXiv]['19].

%T Jerzy Neyman 1894-1981
%A E. L. Lehmann
%B Biographical Memoirs
%P 393-420
%I Nat. Acad. Sci
%D 1994
%O Adapted from a biographical article written for the Dictionary of
   Scientific Biography, Supplement II
%K Neyman, Jerzy, biog, biography, memoir, c1981, c198x, c19xx, zz0919,
   stats, statistics, statistician, Berkeley
%X Jerzy Neyman 1894-1981.
   -- pdf@[NASonline]['19].
   Also see JN@[wikip]['19].

%A B. Bengoudifa
%A R. Mieusset
%T Thermal asymmetry of the human scrotum
%J Human Reproduction
%V 22
%N 8
%P 2178-2182
%M AUG
%D 2007
%K jrnl, c2007, c200x, c20xx, zz0919, human, anatomy, male, body, health,
   reproduction, scrotum, testicle, sperm, fertility, temperature, postman,
   postmen, symmetry, asymmetry, Ig, funny, ha ha, hahah, IgNobel prize, ignoble
%X "... Lack of thermal symmetry was seen in the right and left scrotum, whether
   naked or clothed, and this applied regardless of position or activity when
   clothed. This thermal difference between right and left scrotum could
   contribute to the asymmetry in the male external genital organs."
   -- [doi:10.1093/humrep/dem133]['19].
   And it won an IgNobel prize for anatomy in 2019
   [bbc][13/9/2019],
   [2019].

%A M. Schreiber
%T A modification of the h-index: The hm-index accounts for multi-authored
   manuscripts
%J J. Informetrics
%V 2
%N 3
%P 211-216
%M JUL
%D 2008
%K jrnl, c2008, c200x, c20xx, zz0919, publish, perish, Hindex, hmIndex,
   modified bibliometrics, authorship, multiple authors, author, trends,
   papers, citations, KPI, KPIs
%X "In order to take multiple co-authorship appropriately into account, a
   straightforward modification of the Hirsch index was recently proposed.
   Fractionalised counting of the papers yields an appropriate measure which is
   called the hm-index. The effect of this procedure is compared in the present
   work with other variants of the h-index and found to be superior to the
   fractionalised counting of citations and to the normalization of the h-index
   with the avg # of authors in the h-core. Three fictitious examples for model
   cases and one empirical case are analysed."
   -- [doi:10.1016/j.joi.2008.05.001]['19].
   [Also search for: hmIndex] and [also search for: Hindex].

%A P. Schwardmann
%A J. van der Weele
%T Deception and self-deception
%J Nature Human Behaviour
%V ?
%P ?-?
%M JUL
%D 2019
%K jrnl, c2019, c201x, c20xx, zz0919, Trivers, von Hippel, vonHippel,
   human behaviour, psychology, self deception, over confidence, overconfidence,
   confident, skill, ability, deceit, persuasion, Trivers
%X "There is ample evidence that the average person thinks he or she is more
   skilful, more beautiful and kinder than others and that such overconfidence
   may result in substantial personal and social costs. ... [A] theory, first
   advanced by evolutionary biologist Robert Trivers, posits that people
   self-deceive into higher confidence to more effectively persuade or deceive
   others. Here we conduct two experiments (combined n=688) to test this
   strategic self-deception hypothesis. ... Overconfidence emerges from these
   results as the product of an adaptive cognitive technology with important
   social benefits, rather than some deficiency or bias."
   -- [doi:10.1038/s41562-019-0666-7]['19].
   (Also see the [bbc][30/7/2019].)

%A J. P. A. Ioannidis
%A J. Baas
%A R. Klavans
%A K. W. Boyack
%T A standardized citation metrics author database annotated for
   scientific field
%J PLoS Biology
%V 17
%N 8
%P e3000384
%M AUG
%D 2019
%K jrnl, eJrnl, c2019, c201x, c20xx, zz0919, publish, perish, impact, KPI, KPIs,
   scientific, university, academic, research, management, modified,
   bibliometrics, scientist, authorship, modified, Hindex, misuse, hmIndex,
   hm-index, citations, multiple authors, author, trends
%X "Citation metrics are widely used & misused. We have created a publicly
   available database of 100,000 top scientists that provides standardized
   info. on citations, h-index, coauthorship-adjusted hm-index, citations to
   papers in different authorship positions, & a composite indicator. Separate
   data are shown for career-long & single-year impact. Metrics with & without
   self-citations & ratio of citations to citing papers are given. Scientists
   are classified into 22 scientific fields & 176 subfields. Field- &
   subfield-specific percentiles are also provided for all scientists who have
   published at least five papers. Career-long data are updated to end of 2017
   & to end of 2018 for comparison."
   -- [doi:10.1371/journal.pbio.3000384]['19], via AK.
   data@[www]['19].
   auth1@[orcid]['19].
   [Also search for: hmIndex]  and  [also search for: publish perish].

%A A. J. Stewart
%A M. Mosleh
%A M. Diakonova
%A A. A. Arechar
%A D. G. Rand
%A J. B. Plotkin
%T Information gerrymandering and undemocratic decisions
%J Nature
%V 573
%P 117-121
%M SEP
%D 2019
%K jrnl, c2019, c201x, c20xx, zz0919, politics, voting, election, gerrymander,
   social media, USA, presidential, president, potus, Trump, zzTrump, brexit,
   democracy, vote, votes, influence
%X "... we develop a voter game as a model system to study information flow in
   collective decisions. Players are assigned to competing groups (parties) &
   placed on an 'influence network' that determines whose voting intentions each
   player can observe. Players are incentivized to vote according to partisan
   interest, but also to coordinate their vote with the entire group. Our
   mathematical analysis uncovers a phenomenon that we call information
   gerrymandering: the structure of the influence network can sway the vote
   outcome towards one party, even when both parties have equal sizes & each
   player has the same influence. A small number of zealots, when strategically
   placed on the influence network, can also induce information gerrymandering &
   thereby bias vote outcomes. We confirm the predicted effects of information
   gerrymandering in social network experiments with n=2,520 human subjects.
   Furthermore, we identify extensive information gerrymandering in real-world
   influence networks, including online political discussions leading up to the
   US federal elections, & in historical patterns of bill co-sponsorship in the
   US Congress & European legislatures. ... also highlights a group-level social
   dilemma: information gerrymandering can enable one party to sway decisions in
   its favour, but when multiple parties engage in gerrymandering the group
   loses its ability to reach consensus & remains trapped in deadlock."
   -- [doi:10.1038/s41586-019-1507-6]['19].

%A D. S. Chawala
%T Elsevier investigates hundreds of peer reviewers for manipulating citations
%J Nature
%V 573
%P 174
%M SEP
%D 2019
%K news, views, c2019, c201x, c20xx, zz0919, publish, perish, review,
   citations, coercive citation, Hindex, ethics, cheat, fraud, peer review,
   citation abuse, misuse, Kuo-Chen Chou, KCChou, KuoChenChou, corrupt, scam,
   referee, gaming, refereeing, academic, research, misconduct, manipulation,
   papers, Baas, Fennel, Elsevier
%X "... The publisher is looking into the possibility that some peer reviewers
   are encouraging the authors of work under review to cite the reviewers' own
   research in exchange for positive reviews - a frowned-on[!] practice broadly
   termed coercive citation. ..."
   -- [doi:10.1038/d41586-019-02639-9]['19].
   (See,  Baas and Fennel, 'When Peer Reviewers Go Rogue - Estimated
    Prevalence of Citation Manipulation by Reviewers Based on the
    Citation Patterns of 69,000 Reviewers', May 2019,
    -- [www]['19].)
   [Also search for: peer review]  and  [also search for: Hindex abuse].

%A G. Gutierres
%A R. Mamede
%A J. L. Santos
%T Optimal Gray code for involutions
%J IPL
%V 148
%P 19-22
%M AUG
%D 2019
%K jrnl, IPL, c2019, c201x, c20xx, zz0919, Gray code, involution, group
%X "We present a Gray code for the set of involutions of the symmetric group,
   where the difference between two consecutive involutions is a transposition,
   or a rotation of three letters. Our code improves previous constructions, &
   it is proven to be optimal in relation to the Hamming distance between
   consecutive elements of the code. We also show that the transitions made
   using a transposition are more frequent than those made using a rotation of
   three elements."
   -- [doi:10.1016/j.ipl.2019.04.003]['19].

%A J. Malik
%A O. Suchy
%A T. Valla
%T Efficient implementation of color coding algorithm for subgraph isomorphism
   problem
%J arXiv
%M AUG
%D 2019
%K TR, c2019, c201x, c20xx, zz0919, maths, graph, subgraph, isomorphism,
   algorithm, color, colour, heuristic
%X "We consider the subgraph isomorphism problem where, given two graphs G
   (source g.) & F (pattern g.), one is to decide whether there is a (not
   nec. induced) subgraph of G isomorphic to F. While many practical heuristic
   algs. have been developed for the problem, as pointed out by McCreesh et al.
   [JAIR 2018], for each of them there are rather small instances which they
   cannot cope. ... A seminal paper by Alon, Yuster & Zwick [JACM '95]
   introduced the color coding approach to solve the problem, where the main
   part is a dynamic programming over color subsets & partial mappings. As with
   many exp.-time DPAs, the memory requirements constitute the main limiting
   factor ... grow exponentially with the treewidth of the pattern g., all
   existing implementations based on the color coding principle restrict
   themselves to specific pattern gs., e.g., paths or trees. In contrast, we
   provide an efficient implementation of the alg. sig. reducing its memory
   req. so that it can be used for pattern gs. of larger treewidth. [&] our
   implementation not only decides the existence of an isomorphic subg., but it
   also enumerates all such subgs. (or given number of them). We provide an
   extensive experimental comparison of our implementation to other available
   solvers for the problem."
   -- 1908.11248@[arXiv]['19].
   [Also search for: subgraph isomorphism].

%A M. S. A. Graziano
%T Rethinking Consciousness: A Scientific Theory of Subjective Experience
%I WWNorton
%D 2019
%K book, text, c2019, c201x, c20xx, zz0919, AI, human, mind, conscious,
   consciousness, Attention Schema Theory, AST, PrincetonU, PrincetonUni
%X auth@[prin'ton]['19].
   Also see AST@[wikip]['19].
   [Also search for: consciousness mind].

%A G. Milburn
%A S. Shrapnel
%T Classical and quantum causal interventions
%J Entropy
%V 20
%N 9
%P 687
%M SEP
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0919, causal, network, model, cause, causality,
   intervention, intervene, classical, quantum
%X "... Causal models are representational devices that can be used as oracles
   for future interventions, to predict how values of some variables will change
   in response to interventions on others. Recent work has generalised concepts
   from this field to situations involving quantum systems, resulting in a new
   notion of quantum c.structure. A key concept in both the classical & q.
   context is that of an intervention. Interventions are the controlled
   operations required to identify causal structure & ultimately the feature
   that endows causal models with empirical meaning. Although interventions are
   a crucial feature of both the c. & q. causal modelling frameworks, to date
   there has been no discussion of their physical basis. ... we consider
   interventions from a physical perspective & show that, in both the c. & q.
   case, they are constrained by the thermodynamics of measurement & feedback
   in open systems. We demonstrate that the perfect 'atomic' or 'surgical'
   interventions characterised by Pearl's famous do-calculus are physically
   impossible, & this is the case for both c. & q. systems."
   -- [doi:10.3390/e20090687]['19],
    & [UQ]['19].
   auth2@[orcid]['19],
   auth2@[UQ]['19].
   [Also search for: quantum causal model] & [also search for: causal model].

%A W. A. Borders
%A et al
%A S. Datta
%T Integer factorization using stochastic magnetic tunnel junctions
%J Nature
%V 573
%P 390-393
%M SEP
%D 2019
%K jrnl, c2019, c201x, c20xx, zz0919, integers, factor, factorisation,
   probabilistic, adiabatic, p bit, pBit, qBit, factors, factorisation,
   computer, computing, Shor, algorithm, prime, composite, number, numbers,
   spintronics
%X "... Probabilistic computing is another unconventional computation scheme
   that shares similar concepts with quantum computing but is not limited by the
   above challenges. The key role is played by a probabilistic bit (a p-bit) -
   a robust, classical entity fluctuating in time between 0 & 1, which interacts
   with other p-bits in the same system using principles inspired by neural
   networks. ... a proof-of-concept experiment for prob.computing using
   spintronics technology, and demonstrate int.factorization, an [e.g.] of the
   optimization class of problems addressed by adiabatic and gated q.computing.
   ... The p-bits are electrically connected to form a functional asynchronous
   n/wk, to which a modified adiabatic q.computing alg. that implements three- &
   four-body interactions is applied. Factorization of integers up to 945 is
   demonstrated with this rudimentary asynchronous probabilistic computer using
   eight correlated p-bits, & the results show good agreement with theoretical
   predictions, thus providing a potentially scalable h/w approach to the
   difficult problems of optimization & sampling."
   -- [doi:10.1038/s41586-019-1557-9]['19].
   [Also search for: quantum computing] and
   [also search for: integer factorization algorithm].

%A M. C. Jones
%T On reciprocal symmetry
%J J. of Statist. Plann. and Inference
%V 138
%N 10
%P 3039-3043
%M OCT
%D 2008
%K jrnl, c2008, c200x, c20xx, zz0919, R reciprocal symmetry,
   Rsymmetry, Rsymmetric, symmetric, probability distribution,
   log symmetric, logSymmetry, logSymmetric, Mudholkar, Wang
%X "On the +ve half line, there are two natural, & complementary, analogues of
   the single notion of symmetry of distns on the real line. One is the
   R-symmetry recently proposed and investigated by Mudholkar & Wang [2007.
   IG-symmetry and R-symmetry: interrelations & applications to the inverse
   Gaussian theory. J. Statist. Plann. Inference 137, 3655-3671]; the other is
   the 'log-symmetry' investigated here. Log-symmetry can be thought of either
   in terms of a random variable having the same distribution as its reciprocal
   or as ordinary symmetry of the distribution of the logged random variable.
   Various properties, analogies, comparisons & consequences are investigated."
      " ... R-symmetry: f(theta.y) = f(theta/y)  --(1.3)...
        log-symmetry: Y/theta~~theta/Y  --(1.4)
            equivalent to log(Y)-log(theta)~~log(theta)-log(Y)  --(1.5) ..."
   -- 22523@[open_ac_uk]['19],
      [doi:10.1016/j.jspi.2007.11.006]['19].
   [Also search for: probability distribution symmetry].

%A M. C. Jones
%A B. C. Arnold
%T Distributions that are both log-symmetric and R-symmetric
%J Electronic J. of Stats.
%V 2
%P 1300-1308
%D 2008
%K jrnl, eJrnl, c2008, c200x, c20xx, zz0919, log symmetric, logSymmetry,
   logSymmetric, R, Rsymmetric, Rsymmetry, reciprocal, doubly, log symmetry,
   probability distribution, log Normal, logNormal, Pakes
%X "Two concepts of symmetry for the distns of positive random variables are
   log-symmetry (symmetry of the d. of log Y) & R-symmetry. ... we characterise
   the distns that have both properties, which we call doubly symmetric. It
   turns out that doubly symmetric ds. constitute a subset of those ds. that are
   moment-equivalent to the log normal distn. They include the lognormal, some
   members of the Berg/Askey class of distns, & a # of others for which we give
   an explicit construction (based on workof A.J.Pakes) & note some properties;
   Stieltjes classes, however, are not doubly symmetric."
    [[Random variable Y from distn F with pdf f(.) is log-symmetric if there
      exists a d>0 s.t. (y^2)f(d.y) = f(d/y), for all y>0; i.e., Y/d~d/Y.
      Distn F is (reciprocal-) R-symmetric if there
      exists a t>0 s.t. f(t.y)=f(t/y), for all y>0.]]
   -- 0810.0102@[arXiv],
      [SemSchol]['19].
   [Also search for: probability distribution symmetry].
      (Also see logNormal@[wikip]['19].)

%A J. Zhang
%T A highly efficient L-estimator for the location parameter of the
   Cauchy distribution
%J Comp. Stats.
%V 25
%N 1
%P 97-105
%M MAR
%D 2010
%K jrnl, c2010, c201x, c20xx, zz0919, Cauchy distribution, estimator, estimate,
   heavy tail
%X "The Cauchy distn is a peculiar d. due to its heavy tail & the difficulty of
   estimating its location parameter. It is often cited as an e.g. of the
   computational failure of the max.likelihood method of estimation. The method
   of moment estimation fails & Bayesian estimation is v.unstable. A new
   unbiased L-estimator based on order statistics is proposed, which is not only
   asymptotically efficient but outperforms existing L-estimators in terms of
   finite-sample efficiency."
   -- [doi:10.1007/s00180-009-0163-y]['19].
   [Also search for: Cauchy distribution].
   (Also see C@[wikip]['19].)

%A L. Olejnik
%A T. Minh-Dung
%A C. Castelluccia
%T Selling off privacy at auction
%I hal inria
%R hal-00915249
%M DEC
%D 2019
%K TR, c2013, c201x, c20xx, zz0919, social media, google, privacy, advertising,
   ads, adverts, user, data, protection, targetting, targetted,
   real time bidding, RTB, cookies, www, HREF, web, tracking, users, internet
%X "Real-Time Bidding (RTB) and Cookie Matching(CM) are transforming the
   advertising landscape to an extremely dynamic market and make targeted
   advertising considerablypermissive. The emergence of these technologies
   allows companies to exchange user data ... We expose a design characteristic
   of RTB systems to observe the prices which advertisers pay for serving ads to
   Web users.We leverage this feature and provide important insights into these
   prices by analyzing different user profiles and visiting contexts. Our study
   shows the variation of prices accordingto context information including
   visiting site, time and user's physical location. ... We show that user's
   browsing history elts are routinely being sold off for less than $0.0005."
   -- [inria]['19].
   Also see [www]['19]
   and the [bbc][6/9/2019].
   [Also search for: internet privacy].