text:
{Pasian}, F. and {Pettorino}, V. and {Pires}, S. and {Polenta}, G. and {Pourtsidou}, A. and {Raison}, F. and {Renzi}, A. and {Rhodes}, J. and {Romelli}, E. and {Roncarelli}, M. and {Rossetti}, E. and {Saglia}, R. and {Sakr}, Z. and {S{\'a}nchez}, A.~G. and {Sapone}, D. and {Scaramella}, R. and {Schneider}, P. and {Schrabback}, T. and {Scottez}, V. and {Secroun}, A. and {Serrano}, S. and {Sirignano}, C. and {Sirri}, G. and {Stanco}, L. and {Starck}, J. -L. and {Sureau}, F. and {Tallada-Cresp{\'\i}}, P. and {Taylor}, A. and {Tenti}, M. and {Tereno}, I. and {Toledo-Moreo}, R. and {Torradeflot}, F. and {Tutusaus}, I. and {Valenziano}, L. and {Vannier}, M. and {Vassallo}, T. and {Zoubian}, J. and {Zucca}, E.},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201936980e},
 eid = {C2},
 journal = {Astronomy and Astrophysics},
 keywords = {gravitational lensing: weak, errata, addenda},
 month = {June},
 pages = {C2},
 title = {{Euclid preparation. VI. Verifying the Performance of Cosmic Shear Experiments (Corrigendum)}},
 volume = {638},
 year = {2020}
}

@misc{2020hst..prop16138L,
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020hst..prop16138L},
 author = {{Lee}, Bomee and {Chary}, Ranga-Ram and {Brammer}, Gabriel and {Hirata}, Christopher Michael and {Jee}, Myungkook J. and {Kannawadi}, Arun and {Koekemoer}, Anton M. and {Momcheva}, Ivelina G. and {Rhodes}, Jason D. and {Shapiro}, Charles and {Taylor}, Peter L.},
 bibtex_show = {true},
 howpublished = {HST Proposal. Cycle 28, ID. \#16138},
 month = {May},
 pages = {16138},
 title = {{Constraining the masses of galaxy overdensities at z > 1 in CANDELS and COSMOS through weak lensing in the NIR}},
 year = {2020}
}

@article{2020A&A...635A.139E,
 abbr = {A&A},
 abstract = {{\textbackslash Aims: Our aim is to quantify the impact of systematic
effects on the inference of cosmological parameters from cosmic
shear. \textbackslash Methods: We present an ``end-to-end''
approach that introduces sources of bias in a modelled weak
lensing survey on a galaxy-by-galaxy level. We propagated
residual biases through a pipeline from galaxy properties at one
end to cosmic shear power spectra and cosmological parameter
estimates at the other end. We did this to quantify how
imperfect knowledge of the pipeline changes the maximum
likelihood values of dark energy parameters. \textbackslash
Results: We quantify the impact of an imperfect correction for
charge transfer inefficiency and modelling uncertainties of the
point spread function for Euclid, and find that the biases
introduced can be corrected to acceptable levels.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020A&A...635A.139E},
 altmetric = {69211069},
 archiveprefix = {arXiv},
 arxiv = {1910.10521},
 author = {{Euclid Collaboration} and {Paykari}, P. and {Kitching}, T. and {Hoekstra}, H. and {Azzollini}, R. and {Cardone}, V.~F. and {Cropper}, M. and {Duncan}, C.~A.~J. and {Kannawadi}, A. and {Miller}, L. and {Aussel}, H. and {Conti}, I.~F. and {Auricchio}, N. and {Baldi}, M. and {Bardelli}, S. and {Biviano}, A. and {Bonino}, D. and {Borsato}, E. and {Bozzo}, E. and {Branchini}, E. and {Brau-Nogue}, S. and {Brescia}, M. and {Brinchmann}, J. and {Burigana}, C. and {Camera}, S. and {Capobianco}, V. and {Carbone}, C. and {Carretero}, J. and {Castander}, F.~J. and {Castellano}, M. and {Cavuoti}, S. and {Charles}, Y. and {Cledassou}, R. and {Colodro-Conde}, C. and {Congedo}, G. and {Conselice}, C. and {Conversi}, L. and {Copin}, Y. and {Coupon}, J. and {Courtois}, H.~M. and {Da Silva}, A. and {Dupac}, X. and {Fabbian}, G. and {Farrens}, S. and {Ferreira}, P.~G. and {Fosalba}, P. and {Fourmanoit}, N. and {Frailis}, M. and {Fumana}, M. and {Galeotta}, S. and {Garilli}, B. and {Gillard}, W. and {Gillis}, B.~R. and {Giocoli}, C. and {Graci{\'a}-Carpio}, J. and {Grupp}, F. and {Hormuth}, F. and {Ili{\'c}}, S. and {Israel}, H. and {Jahnke}, K. and {Keihanen}, E. and {Kermiche}, S. and {Kilbinger}, M. and {Kirkpatrick}, C.~C. and {Kubik}, B. and {Kunz}, M. and {Kurki-Suonio}, H. and {Laureijs}, R. and {Le Mignant}, D. and {Ligori}, S. and {Lilje}, P.~B. and {Lloro}, I. and {Maciaszek}, T. and {Maiorano}, E. and {Marggraf}, O. and {Markovic}, K. and {Martinet}, N. and {Marulli}, F. and {Massey}, R. and {Mauri}, N. and {Medinaceli}, E. and {Mei}, S. and {Mellier}, Y. and {Meneghetti}, M. and {Metcalf}, R.~B. and {Moresco}, M. and {Moscardini}, L. and {Munari}, E. and {Neissner}, C. and {Nichol}, R.~C. and {Niemi}, S. and {Nutma}, T. and {Padilla}, C. and {Paltani}, S. and {Pasian}, F. and {Pettorino}, V. and {Pires}, S. and {Polenta}, G. and {Raison}, F. and {Renzi}, A. and {Rhodes}, J. and {Romelli}, E. and {Roncarelli}, M. and {Rossetti}, E. and {Saglia}, R. and {Sakr}, Z. and {S{\'a}nchez}, A.~G. and {Sapone}, D. and {Scaramella}, R. and {Schneider}, P. and {Schrabback}, T. and {Scottez}, V. and {Secroun}, A. and {Serrano}, S. and {Sirignano}, C. and {Sirri}, G. and {Stanco}, L. and {Starck}, J. -L. and {Sureau}, F. and {Tallada-Cresp{\'\i}}, P. and {Taylor}, A. and {Tenti}, M. and {Tereno}, I. and {Toledo-Moreo}, R. and {Torradeflot}, F. and {Valenziano}, L. and {Vannier}, M. and {Vassallo}, T. and {Zoubian}, J. and {Zucca}, E.},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201936980},
 eid = {A139},
 eprint = {1910.10521},
 journal = {Astronomy and Astrophysics},
 keywords = {gravitational lensing: weak, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {March},
 pages = {A139},
 primaryclass = {astro-ph.CO},
 title = {{Euclid preparation. VI. Verifying the performance of cosmic shear experiments}},
 volume = {635},
 year = {2020}
}

@article{2020A&A...634A.127A,
 abbr = {A&A},
 abstract = {{We present cosmological constraints from a joint cosmic shear analysis
of the Kilo-Degree Survey (KV450) and the Dark Energy Survey
(DES-Y1), which were conducted using Complete Orthogonal Sets of
E/B-Integrals (COSEBIs). With COSEBIs, we isolated any B-modes
that have a non-cosmic shear origin and demonstrate the
robustness of our cosmological E-mode analysis as no significant
B-modes were detected. We highlight how COSEBIs are fairly
insensitive to the amplitude of the non-linear matter power
spectrum at high k-scales, mitigating the uncertain impact of
baryon feedback in our analysis. COSEBIs, therefore, allowed us
to utilise additional small-scale information, improving the
DES-Y1 joint constraints on S$_{8}$ = {\ensuremath{\sigma}}$_{8}
$({\ensuremath{\Omega}}$_{m}$/0.3)$^{0.5}$ and
{\ensuremath{\Omega}}$_{m}$ by 20\%. By adopting a flat
{\ensuremath{\Lambda}}CDM model we find S$_{8}$ =
0.755$_{-0.021}$$^{+0.019}$, which is in
3.2{\ensuremath{\sigma}} tension with the Planck Legacy analysis
of the cosmic microwave background.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020A&A...634A.127A},
 altmetric = {68325544},
 archiveprefix = {arXiv},
 arxiv = {1910.05336},
 author = {{Asgari}, Marika and {Tr{\"o}ster}, Tilman and {Heymans}, Catherine and {Hildebrandt}, Hendrik and {van den Busch}, Jan Luca and {Wright}, Angus H. and {Choi}, Ami and {Erben}, Thomas and {Joachimi}, Benjamin and {Joudaki}, Shahab and {Kannawadi}, Arun and {Kuijken}, Konrad and {Lin}, Chieh-An and {Schneider}, Peter and {Zuntz}, Joe},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201936512},
 eid = {A127},
 eprint = {1910.05336},
 journal = {Astronomy and Astrophysics},
 keywords = {gravitational lensing: weak, methods: data analysis, methods: statistical, surveys, cosmological parameters, large-scale structure of Universe, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {February},
 pages = {A127},
 primaryclass = {astro-ph.CO},
 title = {{KiDS+VIKING-450 and DES-Y1 combined: Mitigating baryon feedback uncertainty with COSEBIs}},
 volume = {634},
 year = {2020}
}

@article{2020A&A...633L..10T,
 abbr = {A&A},
 abstract = {{We reanalyse the anisotropic galaxy clustering measurement from the
Baryon Oscillation Spectroscopic Survey (BOSS), demonstrating
that using the full shape information provides cosmological
constraints that are comparable to other low-redshift probes. We
find {\ensuremath{\Omega}}$_{m}$ = 0.317$^{+0.015}$$_{-0.019}$,
{\ensuremath{\sigma}}$_{8}$ = 0.710{\ensuremath{\pm}}0.049, and
h = 0.704 {\ensuremath{\pm}} 0.024 for flat
{\ensuremath{\Lambda}}CDM cosmologies using uninformative priors
on {\ensuremath{\Omega}}$_{c}$h$^{2}$,
100{\ensuremath{\theta}}$_{MC}$, ln{}10$^{10}$A$_{s}$, and
n$_{s}$, and a prior on {\ensuremath{\Omega}}$_{b}$h$^{2}$ that
is much wider than current constraints. We quantify the
agreement between the Planck 2018 constraints from the cosmic
microwave background and BOSS, finding the two data sets to be
consistent within a flat {\ensuremath{\Lambda}}CDM cosmology
using the Bayes factor as well as the prior-insensitive
suspiciousness statistic. Combining two low-redshift probes, we
jointly analyse the clustering of BOSS galaxies with weak
lensing measurements from the Kilo-Degree Survey (KV450). The
combination of BOSS and KV450 improves the measurement by up to
45\%, constraining {\ensuremath{\sigma}}$_{8}$ = 0.702
{\ensuremath{\pm}} 0.029 and S$_{8}$ =
{\ensuremath{\sigma}}$_{8}$ {\ensuremath{\Omega}}$_{m}$/0.3 =
0.728 {\ensuremath{\pm}} 0.026. Over the full 5D parameter
space, the odds in favour of a single cosmology describing
galaxy clustering, lensing, and the cosmic microwave background
are 7 {\ensuremath{\pm}} 2. The suspiciousness statistic signals
a 2.1 {\ensuremath{\pm}} 0.3{\ensuremath{\sigma}} tension
between the combined low-redshift probes and measurements from
the cosmic microwave background.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020A&A...633L..10T},
 altmetric = {67090473},
 archiveprefix = {arXiv},
 arxiv = {1909.11006},
 author = {{Tr{\"o}ster}, Tilman and {S{\'a}nchez}, Ariel. G. and {Asgari}, Marika and {Blake}, Chris and {Crocce}, Mart{\'\i}n and {Heymans}, Catherine and {Hildebrandt}, Hendrik and {Joachimi}, Benjamin and {Joudaki}, Shahab and {Kannawadi}, Arun and {Lin}, Chieh-An and {Wright}, Angus},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201936772},
 eid = {L10},
 eprint = {1909.11006},
 journal = {Astronomy and Astrophysics},
 keywords = {large-scale structure of Universe, cosmological parameters, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {January},
 pages = {L10},
 primaryclass = {astro-ph.CO},
 title = {{Cosmology from large-scale structure. Constraining {\ensuremath{\Lambda}}CDM with BOSS}},
 volume = {633},
 year = {2020}
}

@article{2020A&A...633A..89X,
 abbr = {A&A},
 abstract = {{We present a weak lensing detection of filamentary structures in the
cosmic web, combining data from the Kilo-Degree Survey, the Red
Cluster Sequence Lensing Survey, and the Canada-France-Hawaii
Telescope Lensing Survey. The line connecting luminous red
galaxies with a separation of 3 - 5 h$^{-1}$ Mpc was chosen as a
proxy for the location of filaments. We measured the average
weak lensing shear around {\ensuremath{\sim}}11 000 candidate
filaments selected in this way from the Sloan Digital Sky
Survey. After nulling the shear induced by the dark matter
haloes around each galaxy, we reported a
3.4{\ensuremath{\sigma}} detection of an anisotropic shear
signal from the matter that connects them. Adopting a filament
density profile, motivated from N-body simulations, the average
density at the centre of these filamentary structures was found
to be 15 {\ensuremath{\pm}} 4 times the critical density.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020A&A...633A..89X},
 altmetric = {66532397},
 archiveprefix = {arXiv},
 arxiv = {1909.05852},
 author = {{Xia}, Qianli and {Robertson}, Naomi and {Heymans}, Catherine and {Amon}, Alexandra and {Asgari}, Marika and {Cai}, Yan-Chuan and {Erben}, Thomas and {Harnois-D{\'e}raps}, Joachim and {Hildebrandt}, Hendrik and {Kannawadi}, Arun and {Kuijken}, Konrad and {Schneider}, Peter and {Sif{\'o}n}, Crist{\'o}bal and {Tr{\"o}ster}, Tilman and {Wright}, Angus H.},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201936678},
 eid = {A89},
 eprint = {1909.05852},
 journal = {Astronomy and Astrophysics},
 keywords = {gravitational lensing: weak, large-scale structure of Universe, dark matter, cosmology: observations, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {January},
 pages = {A89},
 primaryclass = {astro-ph.CO},
 title = {{A gravitational lensing detection of filamentary structures connecting luminous red galaxies}},
 volume = {633},
 year = {2020}
}

@article{2020A&A...633A..69H,
 abbr = {A&A},
 abstract = {{We present a tomographic cosmic shear analysis of the Kilo-Degree Survey
(KiDS) combined with the VISTA Kilo-Degree Infrared Galaxy
Survey. This is the first time that a full optical to near-
infrared data set has been used for a wide-field cosmological
weak lensing experiment. This unprecedented data, spanning 450
deg$^{2}$, allows us to significantly improve the estimation of
photometric redshifts, such that we are able to include robustly
higher-redshift sources for the lensing measurement, and - most
importantly - to solidify our knowledge of the redshift
distributions of the sources. Based on a flat
{\ensuremath{\Lambda}}CDM model we find S$_{8}$
{\ensuremath{\equiv}} {\ensuremath{\sigma}}$_{8}$
{\ensuremath{\Omega}}$_{m}$/0.3 = 0.737$^{+0.040}$$_{-0.036}$ in
a blind analysis from cosmic shear alone. The tension between
KiDS cosmic shear and the Planck-Legacy CMB measurements remains
in this systematically more robust analysis, with S$_{8}$
differing by 2.3{\ensuremath{\sigma}}. This result is
insensitive to changes in the priors on nuisance parameters for
intrinsic alignment, baryon feedback, and neutrino mass. KiDS
shear measurements are calibrated with a new, more realistic set
of image simulations and no significant B-modes are detected in
the survey, indicating that systematic errors are under control.
When calibrating our redshift distributions by assuming the
30-band COSMOS-2015 photometric redshifts are correct (following
the Dark Energy Survey and the Hyper Suprime-Cam Survey), we
find the tension with Planck is alleviated. The robust
determination of source redshift distributions remains one of
the most challenging aspects for future cosmic shear surveys.
\textbackslash\textbackslashData products from this analysis are
available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr
(ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-
bin/cat/J/A+A/633/A69 and at http://kids.strw.leidenuniv.nl}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2020A&A...633A..69H},
 altmetric = {52749174},
 archiveprefix = {arXiv},
 arxiv = {1812.06076},
 author = {{Hildebrandt}, H. and {K{\"o}hlinger}, F. and {van den Busch}, J.~L. and {Joachimi}, B. and {Heymans}, C. and {Kannawadi}, A. and {Wright}, A.~H. and {Asgari}, M. and {Blake}, C. and {Hoekstra}, H. and {Joudaki}, S. and {Kuijken}, K. and {Miller}, L. and {Morrison}, C.~B. and {Tr{\"o}ster}, T. and {Amon}, A. and {Archidiacono}, M. and {Brieden}, S. and {Choi}, A. and {de Jong}, J.~T.~A. and {Erben}, T. and {Giblin}, B. and {Mead}, A. and {Peacock}, J.~A. and {Radovich}, M. and {Schneider}, P. and {Sif{\'o}n}, C. and {Tewes}, M.},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201834878},
 eid = {A69},
 eprint = {1812.06076},
 journal = {Astronomy and Astrophysics},
 keywords = {cosmology: observations, gravitational lensing: weak, galaxies: photometry, surveys, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {January},
 pages = {A69},
 primaryclass = {astro-ph.CO},
 selected = {true},
 title = {{KiDS+VIKING-450: Cosmic shear tomography with optical and infrared data}},
 volume = {633},
 year = {2020}
}

@article{2019yCat..36330069H,
 abstract = {{Here we provide: \textbackslash\textbackslash1) The data vector
(tomographic two-point correlation function) 2) The covariance
matrix 3) The redshift distributions 4) The fiducial output
chains of the likelihood analysis \textbackslash\textbackslash(8
data files).}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2019yCat..36330069H},
 author = {{Hildebrandt}, H. and {Koehlinger}, F. and {van den Busch}, J.~L. and {Joachimi}, B. and {Heymans}, C. and {Kannawadi}, A. and {Wright}, A.~H. and {Asgari}, M. and {Blake}, C. and {Hoekstra}, H. and {Joudaki}, S. and {Kuijken}, K. and {Miller}, L. and {Morrison}, C.~B. and {Troester}, T. and {Amon}, A. and {Archidiacono}, M. and {Brieden}, S. and {Choi}, A. and {de Jong}, J.~T.~A. and {Erben}, T. and {Giblin}, B. and {Mead}, A. and {Peacock}, J.~A. and {Radovich}, M. and {Schneider}, P. and {Sifon}, C. and {Tewes}, M.},
 bibtex_show = {true},
 eid = {J/A+A/633/A69},
 journal = {VizieR Online Data Catalog},
 keywords = {Surveys, Redshifts, Optical, Infrared},
 month = {November},
 pages = {J/A+A/633/A69},
 title = {{VizieR Online Data Catalog: KiDS-VIKING-450 cosmic shear (Hildebrandt+, 2020)}},
 year = {2019}
}

@article{2019MNRAS.487.3715V,
 abbr = {MNRAS},
 abstract = {{We use the overlap between multiband photometry of the Kilo-Degree
Survey (KiDS) and spectroscopic data based on the Sloan Digital
Sky Survey and Galaxy And Mass Assembly to infer the colour-
magnitude relation of red-sequence galaxies. We then use this
inferred relation to select luminous red galaxies (LRGs) in the
redshift range of 0.1 < z < 0.7 over the entire KiDS Data
Release 3 footprint. We construct two samples of galaxies with
different constant comoving densities and different luminosity
thresholds. The selected red galaxies have photometric redshifts
with typical photo-z errors of {\ensuremath{\sigma}}$_{z}$
{\ensuremath{\sim}} 0.014(1 + z) that are nearly uniform with
respect to observational systematics. This makes them an ideal
set of galaxies for lensing and clustering studies. As an
example, we use the KiDS-450 cosmic shear catalogue to measure
the mean tangential shear signal around the selected LRGs. We
detect a significant weak lensing signal for lenses out to z
{\ensuremath{\sim}} 0.7.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2019MNRAS.487.3715V},
 altmetric = {50923476},
 archiveprefix = {arXiv},
 arxiv = {1811.02518},
 author = {{Vakili}, Mohammadjavad and {Bilicki}, Maciej and {Hoekstra}, Henk and {Chisari}, Nora Elisa and {Brown}, Michael J.~I. and {Georgiou}, Christos and {Kannawadi}, Arun and {Kuijken}, Konrad and {Wright}, Angus H.},
 bibtex_show = {true},
 doi = {10.1093/mnras/stz1249},
 eprint = {1811.02518},
 journal = {Monthly Notices of the Royal Astronomical Society},
 keywords = {gravitational lensing: weak, methods: data analysis, methods: statistical, galaxies: distances and redshifts, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {August},
 number = {3},
 pages = {3715-3733},
 primaryclass = {astro-ph.CO},
 title = {{Luminous red galaxies in the Kilo-Degree Survey: selection with broad-band photometry and weak lensing measurements}},
 volume = {487},
 year = {2019}
}

@article{2019A&A...624A..92K,
 abbr = {A&A},
 abstract = {{Exploiting the full statistical power of future cosmic shear surveys
will necessitate improvements to the accuracy with which the
gravitational lensing signal is measured. We present a framework
for calibrating shear with image simulations that demonstrates
the importance of including realistic correlations between
galaxy morphology, size, and more importantly, photometric
redshifts. This realism is essential to ensure that selection
and shape measurement biases can be calibrated accurately for a
tomographic cosmic shear analysis. We emulate Kilo-Degree Survey
(KiDS) observations of the COSMOS field using morphological
information from Hubble Space Telescope imaging, faithfully
reproducing the measured galaxy properties from KiDS
observations of the same field. We calibrate our shear
measurements from lensfit, and find through a range of
sensitivity tests that lensfit is robust and unbiased within the
allowed two per cent tolerance of our study. Our results show
that the calibration has to be performed by selecting the
tomographic samples in the simulations, consistent with the
actual cosmic shear analysis, because the joint distributions of
galaxy properties are found to vary with redshift. Ignoring this
redshift variation could result in misestimating the shear bias
by an amount that exceeds the allowed tolerance. To improve the
calibration for future cosmic shear analyses, it will also be
essential to correctly account for the measurement of
photometric redshifts, which requires simulating multi-band
observations.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2019A&A...624A..92K},
 altmetric = {52487002},
 archiveprefix = {arXiv},
 arxiv = {1812.03983},
 author = {{Kannawadi}, Arun and {Hoekstra}, Henk and {Miller}, Lance and {Viola}, Massimo and {Fenech Conti}, Ian and {Herbonnet}, Ricardo and {Erben}, Thomas and {Heymans}, Catherine and {Hildebrandt}, Hendrik and {Kuijken}, Konrad and {Vakili}, Mohammadjavad and {Wright}, Angus H.},
 bibtex_show = {true},
 custom_keywords = {first},
 doi = {10.1051/0004-6361/201834819},
 eid = {A92},
 eprint = {1812.03983},
 journal = {Astronomy and Astrophysics},
 keywords = {gravitational lensing: weak, cosmology: observations, large-scale structure of Universe, cosmological parameters, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {April},
 pages = {A92},
 primaryclass = {astro-ph.CO},
 selected = {true},
 title = {{Towards emulating cosmic shear data: revisiting the calibration of the shear measurements for the Kilo-Degree Survey}},
 volume = {624},
 year = {2019}
}

@article{2019A&A...622A..90G,
 abbr = {A&A},
 abstract = {{The outer regions of galaxies are more susceptible to the tidal
interactions that lead to intrinsic alignments of galaxies. The
resulting alignment signal may therefore depend on the passband
if the colours of galaxies vary spatially. To quantify this, we
measured the shapes of galaxies with spectroscopic redshifts
from the GAMA survey using deep gri imaging data from the
KiloDegree Survey. The performance of the moment-based shape
measurement algorithm DEIMOS was assessed using dedicated image
simulations, which showed that the ellipticities could be
determined with an accuracy better than 1\% in all bands.
Additional tests for potential systematic errors did not reveal
any issues. We measure a significant difference of the alignment
signal between the g, r and i-band observations. This difference
exceeds the amplitude of the linear alignment model on scales
below 2 Mpc h$^{-1}$. Separating the sample into
central/satellite and red/blue galaxies, we find that the
difference is dominated by red satellite galaxies.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2019A&A...622A..90G},
 altmetric = {48141063},
 archiveprefix = {arXiv},
 arxiv = {1809.03602},
 author = {{Georgiou}, Christos and {Johnston}, Harry and {Hoekstra}, Henk and {Viola}, Massimo and {Kuijken}, Konrad and {Joachimi}, Benjamin and {Chisari}, Nora Elisa and {Farrow}, Daniel J. and {Hildebrandt}, Hendrik and {Holwerda}, Benne W. and {Kannawadi}, Arun},
 bibtex_show = {true},
 doi = {10.1051/0004-6361/201834219},
 eid = {A90},
 eprint = {1809.03602},
 journal = {Astronomy and Astrophysics},
 keywords = {galaxies: evolution, large-scale structure of Universe, gravitational lensing: weak, cosmology: observations, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {February},
 pages = {A90},
 primaryclass = {astro-ph.CO},
 title = {{The dependence of intrinsic alignment of galaxies on wavelength using KiDS and GAMA}},
 volume = {622},
 year = {2019}
}

@article{2018MNRAS.481.1337H,
 abbr = {MNRAS},
 abstract = {{We present a public suite of weak-lensing mock data, extending the
Scinet Light Cone Simulations (SLICS) to simulate cross-
correlation analyses with different cosmological probes. These
mocks include Kilo Degree Survey (KiDS)-450- and LSST-like
lensing data, cosmic microwave background lensing maps and
simulated spectroscopic surveys that emulate the Galaxy And Mass
Assembly, BOSS, and 2-degree Field Lensing galaxy surveys. With
844 independent realizations, our mocks are optimized for
combined-probe covariance estimation, which we illustrate for
the case of a joint measurement involving cosmic shear, galaxy-
galaxy lensing, and galaxy clustering from KiDS-450 and BOSS
data. With their high spatial resolution, the SLICS are also
optimal for predicting the signal for novel lensing estimators,
for the validation of analysis pipelines, and for testing a
range of systematic effects such as the impact of neighbour-
exclusion bias on the measured tomographic cosmic shear signal.
For surveys like KiDS and Dark Energy Survey, where the
rejection of neighbouring galaxies occurs within
{\ensuremath{\sim}}2 arcsec, we show that the measured cosmic
shear signal will be biased low, but by less than a per cent on
the angular scales that are typically used in cosmic shear
analyses. The amplitude of the neighbour-exclusion bias doubles
in deeper, LSST-like data. The simulation products described in
this paper are made available at http://slics.roe.ac.uk/.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2018MNRAS.481.1337H},
 altmetric = {41315355},
 archiveprefix = {arXiv},
 arxiv = {1805.04511},
 author = {{Harnois-D{\'e}raps}, J. and {Amon}, A. and {Choi}, A. and {Demchenko}, V. and {Heymans}, C. and {Kannawadi}, A. and {Nakajima}, R. and {Sirks}, E. and {van Waerbeke}, L. and {Cai}, Yan-Chuan and {Giblin}, B. and {Hildebrandt}, H. and {Hoekstra}, H. and {Miller}, L. and {Tr{\"o}ster}, T.},
 bibtex_show = {true},
 doi = {10.1093/mnras/sty2319},
 eprint = {1805.04511},
 journal = {Monthly Notices of the Royal Astronomical Society},
 keywords = {gravitational lensing: weak, methods: numerical, dark matter, large-scale structure of Universe, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {November},
 number = {1},
 pages = {1337-1367},
 primaryclass = {astro-ph.CO},
 title = {{Cosmological simulations for combined-probe analyses: covariance and neighbour-exclusion bias}},
 volume = {481},
 year = {2018}
}

@article{2018MNRAS.477.4285A,
 abbr = {MNRAS},
 abstract = {{We present a weak gravitational lensing analysis of 815 deg$^{2}$ of
i-band imaging from the Kilo-Degree Survey (KiDS-i-800). In
contrast to the deep r-band observations, which take priority
during excellent seeing conditions and form the primary KiDS
data set (KiDS-r-450), the complementary yet shallower
KiDS-i-800 spans a wide range of observing conditions. The
overlapping KiDS-i-800 and KiDS-r-450 imaging therefore provides
a unique opportunity to assess the robustness of weak lensing
measurements. In our analysis we introduce two new `null' tests.
The `nulled' two-point shear correlation function uses a matched
catalogue to show that the calibrated KiDS-i-800 and KiDS-r-450
shear measurements agree at the level of 1 {\ensuremath{\pm}} 4
per cent. We use five galaxy lens samples to determine a
`nulled' galaxy-galaxy lensing signal from the full KiDS-i-800
and KiDS-r-450 surveys and find that the measurements agree to 7
{\ensuremath{\pm}} 5 per cent when the KiDS-i-800 source
redshift distribution is calibrated using either spectroscopic
redshifts, or the 30-band photometric redshifts from the COSMOS
survey.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2018MNRAS.477.4285A},
 altmetric = {21872003},
 archiveprefix = {arXiv},
 arxiv = {1707.04105},
 author = {{Amon}, A. and {Heymans}, C. and {Klaes}, D. and {Erben}, T. and {Blake}, C. and {Hildebrandt}, H. and {Hoekstra}, H. and {Kuijken}, K. and {Miller}, L. and {Morrison}, C.~B. and {Choi}, A. and {de Jong}, J.~T.~A. and {Glazebrook}, K. and {Irisarri}, N. and {Joachimi}, B. and {Joudaki}, S. and {Kannawadi}, A. and {Lidman}, C. and {Napolitano}, N. and {Parkinson}, D. and {Schneider}, P. and {van Uitert}, E. and {Viola}, M. and {Wolf}, C.},
 bibtex_show = {true},
 doi = {10.1093/mnras/sty859},
 eprint = {1707.04105},
 journal = {Monthly Notices of the Royal Astronomical Society},
 keywords = {gravitational lensing: weak, surveys, galaxies: photometry, cosmology: observations, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {July},
 number = {4},
 pages = {4285-4307},
 primaryclass = {astro-ph.CO},
 title = {{KiDS-i-800: comparing weak gravitational lensing measurements from same-sky surveys}},
 volume = {477},
 year = {2018}
}

@article{2016PASP..128j4001P,
 abstract = {{Weak gravitational lensing (WL) is one of the most powerful techniques
to learn about the dark sector of the universe. To extract the
WL signal from astronomical observations, galaxy shapes must be
measured and corrected for the point-spread function (PSF) of
the imaging system with extreme accuracy. Future WL
missions{\textemdash}such as NASA{\textquoteright}s Wide-Field
Infrared Survey Telescope (WFIRST){\textemdash}will use a family
of hybrid near-infrared complementary metal-oxide-semiconductor
detectors (HAWAII-4RG) that are untested for accurate WL
measurements. Like all image sensors, these devices are subject
to conversion gain nonlinearities (voltage response to collected
photo-charge) that bias the shape and size of bright objects
such as reference stars that are used in PSF determination. We
study this type of detector nonlinearity (NL) and show how to
derive requirements on it from WFIRST PSF size and ellipticity
requirements. We simulate the PSF optical profiles expected for
WFIRST and measure the fractional error in the PSF size
({\ensuremath{\Delta}}R/R) and the absolute error in the PSF
ellipticity ({\ensuremath{\Delta}}e) as a function of star
magnitude and the NL model. For our nominal NL model (a
quadratic correction), we find that, uncalibrated, NL can induce
an error of {\ensuremath{\Delta}}R/R = 1 {\texttimes} 10$^{-2}$
and {\ensuremath{\Delta}}e $_{2}$ = 1.75 {\texttimes} 10$^{-3}$
in the H158 bandpass for the brightest unsaturated stars in
WFIRST. In addition, our simulations show that to limit the bias
of {\ensuremath{\Delta}}R/R and {\ensuremath{\Delta}}e in the
H158 band to {\ensuremath{\sim}}10\% of the estimated WFIRST
error budget, the quadratic NL model parameter
{\ensuremath{\beta}} must be calibrated to
{\ensuremath{\sim}}1\% and {\ensuremath{\sim}}2.4\%,
respectively. We present a fitting formula that can be used to
estimate WFIRST detector NL requirements once a true PSF error
budget is established.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2016PASP..128j4001P},
 altmetric = {7134800},
 archiveprefix = {arXiv},
 arxiv = {1605.01001},
 author = {{Plazas}, A.~A. and {Shapiro}, C. and {Kannawadi}, A. and {Mandelbaum}, R. and {Rhodes}, J. and {Smith}, R.},
 bibtex_show = {true},
 doi = {10.1088/1538-3873/128/968/104001},
 eprint = {1605.01001},
 journal = {Publications of the ASP},
 keywords = {Astrophysics - Instrumentation and Methods for Astrophysics},
 month = {October},
 number = {968},
 pages = {104001},
 primaryclass = {astro-ph.IM},
 title = {{The Effect of Detector Nonlinearity on WFIRST PSF Profiles for Weak Gravitational Lensing Measurements}},
 volume = {128},
 year = {2016}
}

@article{2016PASP..128i5001K,
 abstract = {{Unlike optical CCDs, near-infrared detectors, which are based on CMOS
hybrid readout technology, typically suffer from electrical
crosstalk between the pixels. The interpixel capacitance (IPC)
responsible for the crosstalk affects the point-spread function
(PSF) of the telescope, increasing the size and modifying the
shape of all objects in the images while correlating the Poisson
noise. Upcoming weak lensing surveys that use these detectors,
such as WFIRST, place stringent requirements on the PSF size and
shape (and the level at which these are known), which in turn
must be translated into requirements on IPC. To facilitate this
process, we present a first study of the effect of IPC on WFIRST
PSF sizes and shapes. Realistic PSFs are forward-simulated from
physical principles for each WFIRST bandpass. We explore how the
PSF size and shape depends on the range of IPC coupling with
pixels that are connected along an edge or corner; for the
expected level of IPC in WFIRST, IPC increases the PSF sizes by
{\ensuremath{\sim}}5\%. We present a linear fitting formula that
describes the uncertainty in the PSF size or shape due to
uncertainty in the IPC, which could arise for example due to
unknown time evolution of IPC as the detectors age or due to
spatial variation of IPC across the detector. We also study of
the effect of a small anisotropy in the IPC, which further
modifies the PSF shapes. Our results are a first, critical step
in determining the hardware and characterization requirements
for the detectors used in the WFIRST survey.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2016PASP..128i5001K},
 altmetric = {4850094},
 archiveprefix = {arXiv},
 arxiv = {1512.01570},
 author = {{Kannawadi}, Arun and {Shapiro}, Charles A. and {Mandelbaum}, Rachel and {Hirata}, Christopher M. and {Kruk}, Jeffrey W. and {Rhodes}, Jason D.},
 bibtex_show = {true},
 custom_keywords = {first},
 doi = {10.1088/1538-3873/128/967/095001},
 eprint = {1512.01570},
 journal = {Publications of the ASP},
 keywords = {Astrophysics - Instrumentation and Methods for Astrophysics},
 month = {September},
 number = {967},
 pages = {095001},
 primaryclass = {astro-ph.IM},
 title = {{The Impact of Interpixel Capacitance in CMOS Detectors on PSF Shapes and Implications for WFIRST}},
 volume = {128},
 year = {2016}
}

@article{2016EL....11557005K,
 abstract = {{The eigenstates of a quantum spin glass Hamiltonian with long-range
interaction are examined from the point of view of localisation
and entanglement. In particular, low particle sectors are
examined and an anomalous family of eigenstates is found that is
more delocalised but also has larger inter-spin entanglement.
These are then identified as particle-added eigenstates from the
one-particle sector. This motivates the introduction and the
study of random promoted two-particle states, and it is shown
that they may have large delocalisation such as generic random
states and scale exactly like them. However, the entanglement as
measured by two-spin concurrence displays different scaling with
the total number of spins. This shows how for different classes
of complex quantum states entanglement can be qualitatively
different even if localisation measures such as participation
ratio are not.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2016EL....11557005K},
 altmetric = {2524979},
 archiveprefix = {arXiv},
 arxiv = {1407.5090},
 author = {{Kannawadi}, Arun and {Sharma}, Auditya and {Lakshminarayan}, Arul},
 bibtex_show = {true},
 custom_keywords = {first},
 doi = {10.1209/0295-5075/115/57005},
 eprint = {1407.5090},
 journal = {EPL (Europhysics Letters)},
 keywords = {Quantum Physics, Condensed Matter - Statistical Mechanics},
 month = {September},
 number = {5},
 pages = {57005},
 primaryclass = {quant-ph},
 title = {{Persistent entanglement in a class of eigenstates of quantum Heisenberg spin glasses}},
 volume = {115},
 year = {2016}
}

@article{2015MNRAS.449.3597K,
 abbr = {MNRAS},
 abstract = {{Upcoming weak lensing surveys will survey large cosmological volumes to
measure the growth of cosmological structure with time and
thereby constrain dark energy. One major systematic uncertainty
in this process is the calibration of the weak lensing shape
distortions, or shears. Most upcoming surveys plan to test
several aspects of their shear estimation algorithms using
sophisticated image simulations that include realistic galaxy
populations based on high-resolution data from the Hubble Space
Telescope (HST). However, existing data sets from the HST cover
very small cosmological volumes, so cosmic variance could cause
the galaxy populations in them to be atypical. A narrow redshift
slice from such surveys could be dominated by a single large
overdensity or underdensity. In that case, the morphology-
density relation could alter the local galaxy populations and
yield an incorrect calibration of shear estimates as a function
of redshift. We directly test this scenario using the COSMOS
survey, the largest-area HST survey to date, and show how the
statistical distributions of galaxy shapes and morphological
parameters (e.g. S{\'e}rsic n) are influenced by redshift-
dependent cosmic variance. The typical variation in rms
ellipticity due to environmental effects is 5 per cent
(absolute, not relative) for redshift bins of width
{\ensuremath{\Delta}}z = 0.05, which could result in uncertain
shear calibration at the 1 per cent level. We conclude that the
cosmic variance effects are large enough to exceed the
systematic error budget of future surveys, but can be mitigated
with careful choice of training data set and sufficiently large
redshift binning.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2015MNRAS.449.3597K},
 altmetric = {2948089},
 archiveprefix = {arXiv},
 arxiv = {1412.1094},
 author = {{Kannawadi}, Arun and {Mandelbaum}, Rachel and {Lackner}, Claire},
 bibtex_show = {true},
 custom_keywords = {first},
 doi = {10.1093/mnras/stv520},
 eprint = {1412.1094},
 journal = {Monthly Notices of the Royal Astronomical Society},
 keywords = {gravitational lensing: weak, galaxies: evolution, large-scale structure of Universe, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {June},
 number = {4},
 pages = {3597-3612},
 primaryclass = {astro-ph.CO},
 title = {{The impact of cosmic variance on simulating weak lensing surveys}},
 volume = {449},
 year = {2015}
}

@article{2014ApJS..212....5M,
 abbr = {ApJS},
 abstract = {{The GRavitational lEnsing Accuracy Testing 3 (GREAT3) challenge is the
third in a series of image analysis challenges, with a goal of
testing and facilitating the development of methods for
analyzing astronomical images that will be used to measure weak
gravitational lensing. This measurement requires extremely
precise estimation of very small galaxy shape distortions, in
the presence of far larger intrinsic galaxy shapes and
distortions due to the blurring kernel caused by the atmosphere,
telescope optics, and instrumental effects. The GREAT3 challenge
is posed to the astronomy, machine learning, and statistics
communities, and includes tests of three specific effects that
are of immediate relevance to upcoming weak lensing surveys, two
of which have never been tested in a community challenge before.
These effects include many novel aspects including realistically
complex galaxy models based on high-resolution imaging from
space; a spatially varying, physically motivated blurring
kernel; and a combination of multiple different exposures. To
facilitate entry by people new to the field, and for use as a
diagnostic tool, the simulation software for the challenge is
publicly available, though the exact parameters used for the
challenge are blinded. Sample scripts to analyze the challenge
data using existing methods will also be provided. See http://great3challenge.info
and http://great3.projects.phys.ucl.ac.uk/leaderboard/ for
more information.}},
 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
 adsurl = {https://ui.adsabs.harvard.edu/abs/2014ApJS..212....5M},
 altmetric = {1710070},
 archiveprefix = {arXiv},
 arxiv = {1308.4982},
 author = {{Mandelbaum}, Rachel and {Rowe}, Barnaby and {Bosch}, James and {Chang}, Chihway and {Courbin}, Frederic and {Gill}, Mandeep and {Jarvis}, Mike and {Kannawadi}, Arun and {Kacprzak}, Tomasz and {Lackner}, Claire and {Leauthaud}, Alexie and {Miyatake}, Hironao and {Nakajima}, Reiko and {Rhodes}, Jason and {Simet}, Melanie and {Zuntz}, Joe and {Armstrong}, Bob and {Bridle}, Sarah and {Coupon}, Jean and {Dietrich}, J{\"o}rg P. and {Gentile}, Marc and {Heymans}, Catherine and {Jurling}, Alden S. and {Kent}, Stephen M. and {Kirkby}, David and {Margala}, Daniel and {Massey}, Richard and {Melchior}, Peter and {Peterson}, John and {Roodman}, Aaron and {Schrabback}, Tim},
 bibtex_show = {true},
 doi = {10.1088/0067-0049/212/1/5},
 eid = {5},
 eprint = {1308.4982},
 journal = {Astrophysical Journal, Supplement},
 keywords = {gravitational lensing: weak, methods: data analysis, methods: statistical, techniques: image processing, Astrophysics - Cosmology and Nongalactic Astrophysics},
 month = {May},
 number = {1},
 pages = {5},
 primaryclass = {astro-ph.CO},
 title = {{The Third Gravitational Lensing Accuracy Testing (GREAT3) Challenge Handbook}},
 volume = {212},
 year = {2014}
}

license: MIT

license_type: permissive

branch_name: refs/heads/master

gha_license_id: MIT

extension: bib


text:
@inproceedings{INTEROP2016-2,
	Address = {Portoro{\v z}, Slovenia},
	Author = {Estival, Dominique},
	Booktitle = {Proceedings of the Workshop on Cross-Platform Text Mining and Natural Language Processing Interoperability (INTEROP 2016) at LREC 2016},
	Editor = {Eckart de Castilho, Richard and Ananiadou, Sophia and Margoni, Thomas and Peters, Wim and Piperidis, Stelios},
	Month = may,
	Pages = {5--9},
	Publisher = {European Language Resources Association (ELRA)},
	Title = {Alveo: making data accessible through a unified interface -- a pipe-dream?},
	Year = {2016}}


text:
@article{park2021,
	title = {Going from bad to worse: from Internet voting to blockchain voting},
	volume = {7},
	issn = {2057-2085, 2057-2093},
	url = {https://academic.oup.com/cybersecurity/article/doi/10.1093/cybsec/tyaa025/6137886},
	doi = {10.1093/cybsec/tyaa025},
	shorttitle = {Going from bad to worse},
	abstract = {Voters are understandably concerned about election security. News reports of possible election interference by foreign powers, of unauthorized voting, of voter disenfranchisement, and of technological failures call into question the integrity of elections worldwide. This article examines the suggestions that “voting over the Internet” or “voting on the blockchain” would increase election security, and ﬁnds such claims to be wanting and misleading. While current election systems are far from perfect, Internet- and blockchain-based voting would greatly increase the risk of undetectable, nation-scale election failures. Online voting may seem appealing: voting from a computer or smartphone may seem convenient and accessible. However, studies have been inconclusive, showing that online voting may have little to no effect on turnout in practice, and it may even increase disenfranchisement. More importantly, given the current state of computer security, any turnout increase derived from Internet- or blockchain-based voting would come at the cost of losing meaningful assurance that votes have been counted as they were cast, and not undetectably altered or discarded. This state of affairs will continue as long as standard tactics such as malware, zero day, and denial-of-service attacks continue to be effective. This article analyzes and systematizes prior research on the security risks of online and electronic voting, and shows that not only do these risks persist in blockchain-based voting systems, but blockchains may introduce ‘additional’ problems for voting systems. Finally, we suggest questions for critically assessing security risks of new voting system proposals.},
	pages = {tyaa025},
	number = {1},
	journaltitle = {Journal of Cybersecurity},
	author = {Park, Sunoo and Specter, Michael and Narula, Neha and Rivest, Ronald L},
	urldate = {2021-11-20},
	date = {2021},
	langid = {english},
}

@incollection{brickell1993,
	location = {Berlin, Heidelberg},
	title = {Wallet Databases with Observers},
	volume = {740},
	isbn = {978-3-540-57340-1},
	url = {http://link.springer.com/10.1007/3-540-48071-4_7},
	abstract = {Previously there have been essentially on!? t{\textbackslash}vo models for computers t h a t people can use to handle ordinary consumer transactions: {\textless}i:i:he tamper-proof module, such as a smart card, that the person cannot modify or probe; and ( 2 ) the personal workstation whose inner working is totally under control of the individual. The first part of this article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone. providing both security and correctness for organizations as Ivell as privacy and even anonymity for individuals. T h e n it is shown horn this conihined device. called a wailet. r a n carry a. dat.a.base containing personal information. The construction presenred ensures that no single part of the device (i.e. neither the yamper-proof part nor the xvorkstat.ion) can learn the contents of t h e database - thls information can only he recovered by the {tLvo} parts together.},
	pages = {89--105},
	booktitle = {Advances in Cryptology — {CRYPTO}’ 92},
	publisher = {Springer Berlin Heidelberg},
	author = {Chaum, David and Pedersen, Torben Pryds},
	editor = {Brickell, Ernest F.},
	urldate = {2021-11-21},
	date = {1993},
	langid = {english},
	doi = {10.1007/3-540-48071-4_7},
	note = {Series Title: Lecture Notes in Computer Science},
}

@incollection{brenner2017,
	location = {Cham},
	title = {Pseudo-Code Algorithms for Verifiable Re-encryption Mix-Nets},
	volume = {10323},
	isbn = {978-3-319-70277-3 978-3-319-70278-0},
	url = {http://link.springer.com/10.1007/978-3-319-70278-0_23},
	abstract = {Implementing the shuﬄe proof of a veriﬁable mix-net is one of the most challenging tasks in the implementation of an electronic voting system. For non-specialists, even if they are experienced software developers, this task is nearly impossible to fulﬁll without spending an enormous amount of resources into studying the necessary cryptographic theory. In this paper, we present one of the existing shuﬄe proofs in a condensed form and explain all the necessary technical details in corresponding pseudo-code algorithms. The goal of presenting the shuﬄe proof in this form is to make it accessible to a broader audience and to facilitate its implementation by non-specialists.},
	pages = {370--384},
	booktitle = {Financial Cryptography and Data Security},
	publisher = {Springer International Publishing},
	author = {Haenni, Rolf and Locher, Philipp and Koenig, Reto and Dubuis, Eric},
	editor = {Brenner, Michael and Rohloff, Kurt and Bonneau, Joseph and Miller, Andrew and Ryan, Peter Y.A. and Teague, Vanessa and Bracciali, Andrea and Sala, Massimiliano and Pintore, Federico and Jakobsson, Markus},
	urldate = {2021-11-23},
	date = {2017},
	langid = {english},
	doi = {10.1007/978-3-319-70278-0_23},
	note = {Series Title: Lecture Notes in Computer Science},
}

@article{schneider2017,
	title = {Survey on Remote Electronic Voting},
	url = {http://arxiv.org/abs/1702.02798},
	abstract = {Electronic and remote voting has become a large ﬁeld of research and brought forth a multiplicity of schemes, systems, cryptographic primitives as well as formal deﬁnitions and requirements for electronic elections. In this survey we try to give a brief and precise overview and summary of the current situation.},
	journaltitle = {{arXiv}:1702.02798 [cs]},
	author = {Schneider, Alexander and Meter, Christian and Hagemeister, Philipp},
	urldate = {2022-01-05},
	date = {2017},
	langid = {english},
	eprinttype = {arxiv},
	eprint = {1702.02798},
	keywords = {Computer Science - Computers and Society, Computer Science - Cryptography and Security},
}

@inproceedings{kusters2010,
	location = {Chicago, Illinois, {USA}},
	title = {Accountability: definition and relationship to verifiability},
	isbn = {978-1-4503-0245-6},
	url = {http://portal.acm.org/citation.cfm?doid=1866307.1866366},
	doi = {10.1145/1866307.1866366},
	shorttitle = {Accountability},
	abstract = {Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation, involve the use of (semi-)trusted parties, such as notaries and authorities. It is crucial that such parties can be held accountable in case they misbehave as this is a strong incentive for such parties to follow the protocol. Unfortunately, there does not exist a general and convincing deﬁnition of accountability that would allow to assess the level of accountability a protocol provides.},
	eventtitle = {the 17th {ACM} conference},
	pages = {526},
	booktitle = {Proceedings of the 17th {ACM} conference on Computer and communications security - {CCS} '10},
	publisher = {{ACM} Press},
	author = {Küsters, Ralf and Truderung, Tomasz and Vogt, Andreas},
	urldate = {2022-01-13},
	date = {2010},
	langid = {english},
}

@article{belanger2016,
	title = {Framing Electoral Transparency: A Comparative Analysis of Three E-vote Counting Ceremonies},
	pages = {18},
	author = {Belanger, Olivier and Markussen, Randi and Ronquillo, Lorena and Schurmann, Carsten},
	langid = {english},
       	date = {2016},
}

@article{morgan2010,
	title = {Negative Vote Buying and the Secret Ballot},
	abstract = {We o¤er a model of “negative vote buying”— paying voters to abstain. While negative vote buying is feasible under the open ballot, it is never optimal. In contrast, a combination of positive and negative vote buying is optimal under the secret ballot: Lukewarm supporters are paid to show up at the polls, while lukewarm opponents are paid to stay home. Surprisingly, the imposition of the secret ballot increases the amount of vote buying— a greater fraction of the electorate votes insincerely than under the open ballot. Moreover, the secret ballot may reduce the costs of buying an election.},
	pages = {42},
	author = {Morgan, John},
	langid = {english},
        date = {2010},
}

@incollection{christen2020,
	location = {Cham},
	title = {Core Values and Value Conflicts in Cybersecurity: Beyond Privacy Versus Security},
	volume = {21},
	isbn = {978-3-030-29052-8 978-3-030-29053-5},
	url = {http://link.springer.com/10.1007/978-3-030-29053-5_3},
	shorttitle = {Core Values and Value Conflicts in Cybersecurity},
	abstract = {This chapter analyses some of the main values, and values conflicts, in relation to cybersecurity by distinguishing four important value clusters that should be considered when deciding on cybersecurity measures. These clusters are security, privacy, fairness and accountability. Each cluster consists of a range of further values, which can be viewed as articulating specific moral reasons relevant when devising cybersecurity measures. In addition to the four value clusters, domain- specific values that are served by computer systems, such as health, are important. Following a detailed discussion of the four relevant value clusters, potential value conflicts and value tensions are considered. The relationships of five pairs of values (privacy-security, privacy-fairness, privacy-accountability, security-accountability and security-fairness) are analysed in terms of whether they are largely supportive or conflicting. In addition, possible methods for addressing these potential value conflicts are discussed. It is concluded that values, and value conflicts, in cybersecurity should be considered in context, also taking into account the specific computer systems at play, to enable the use of nuanced and fine-grained methods for addressing the relevant value conflicts.},
	pages = {45--71},
	booktitle = {The Ethics of Cybersecurity},
	publisher = {Springer International Publishing},
	author = {van de Poel, Ibo},
	editor = {Christen, Markus and Gordijn, Bert and Loi, Michele},
	urldate = {2022-08-27},
	date = {2020},
	langid = {english},
	doi = {10.1007/978-3-030-29053-5_3},
	note = {Series Title: The International Library of Ethics, Law and Technology},
}

@incollection{jamroga2021,
	location = {Cham},
	title = {A Declaration of Software Independence},
	isbn = {978-3-030-91631-2},
	url = {https://doi.org/10.1007/978-3-030-91631-2_11},
	series = {Lecture Notes in Computer Science},
	abstract = {A voting system should not merely report the outcome: it should also provide sufficient evidence to convince reasonable observers that the reported outcome is correct. Many deployed systems, notably paperless {DRE} machines still in use in {US} elections, fail certainly the second, and quite possibly the first of these requirements. Rivest and Wack proposed the principle of software independence ({SI}) as a guiding principle and requirement for voting systems. In essence, a voting system is {SI} if its reliance on software is “tamper-evident”, that is, if there is a way to detect that material changes were made to the software without inspecting that software. This important notion has so far been formulated only informally.},
	pages = {198--217},
	booktitle = {Protocols, Strands, and Logic: Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday},
	publisher = {Springer International Publishing},
	author = {Jamroga, Wojciech and Ryan, Peter Y. A. and Schneider, Steve and Schürmann, Carsten and Stark, Philip B.},
	editor = {Dougherty, Daniel and Meseguer, José and Mödersheim, Sebastian Alexander and Rowe, Paul},
	urldate = {2022-08-28},
	date = {2021},
	langid = {english},
	doi = {10.1007/978-3-030-91631-2_11},
}

@report{benaloh2015,
	title = {End-to-end verifiability},
	url = {http://arxiv.org/abs/1504.03778},
	abstract = {This pamphlet describes end-to-end election verifiability (E2E-V) for a nontechnical audience: election officials, public policymakers, and anyone else interested in secure, transparent, evidence-based electronic elections. This work is part of the Overseas Vote Foundation's End-to-End Verifiable Internet Voting: Specification and Feasibility Assessment Study (E2E {VIV} Project), funded by the Democracy Fund.},
	number = {{arXiv}:1504.03778},
	institution = {{arXiv}},
	author = {Benaloh, Josh and Rivest, Ronald and Ryan, Peter Y. A. and Stark, Philip and Teague, Vanessa and Vora, Poorvi},
	urldate = {2022-08-28},
	date = {2015},
	eprinttype = {arxiv},
	eprint = {1504.03778 [cs]},
	note = {type: article},
	keywords = {Computer Science - Cryptography and Security},
}

@article{rivest2008,
	title = {On the notion of ‘software independence’ in voting systems},
	volume = {366},
	url = {https://royalsocietypublishing.org/doi/10.1098/rsta.2008.0149},
	doi = {10.1098/rsta.2008.0149},
	abstract = {This paper defines and explores the notion of ‘software independence’ in voting systems: ‘A voting system is software independent if an (undetected) change or error in its software cannot cause an undetectable change or error in an election outcome’. For example, optical scan and some cryptographically based voting systems are software independent. Variations and implications of this definition are explored. It is proposed that software-independent voting systems should be preferred, and software-dependent voting systems should be avoided.

An initial version of this paper was prepared for use by the Technical Guidelines Development Committee in their development of the Voluntary Voting System Guidelines, which will specify the requirements that the {USA} voting systems must meet to receive certification.},
	pages = {3759--3767},
	number = {1881},
	journaltitle = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
	author = {Rivest, Ronald L},
	urldate = {2022-08-28},
	date = {2008},
	note = {Publisher: Royal Society},
	keywords = {security, software independence, voting},
}

@article{sampigethaya2006,
	title = {A framework and taxonomy for comparison of electronic voting schemes},
	volume = {25},
	issn = {01674048},
	url = {https://linkinghub.elsevier.com/retrieve/pii/S0167404805001914},
	doi = {10.1016/j.cose.2005.11.003},
	abstract = {Electronic voting is an emerging social application of cryptographic protocols. A vast amount of literature on electronic voting has been developed over the last two decades. In this paper, we provide a framework that classiﬁes these approaches and deﬁnes a set of metrics under which their properties can be compared. Such a methodology reveals important differences in security properties between the classes and allows for selection and future design of voting schemes, based on application requirements. We illustrate the use of our framework by analyzing some of the existing electronic voting schemes.},
	pages = {137--153},
	number = {2},
	journaltitle = {Computers \& Security},
	shortjournal = {Computers \& Security},
	author = {Sampigethaya, Krishna and Poovendran, Radha},
	urldate = {2022-08-29},
	date = {2006},
	langid = {english},
}

@article{sampigethaya2006v2,
	title = {A Survey on Mix Networks and Their Secure Applications},
	volume = {94},
	issn = {0018-9219, 1558-2256},
	url = {http://ieeexplore.ieee.org/document/4077263/},
	doi = {10.1109/JPROC.2006.889687},
	abstract = {Anonymity is a subdiscipline of information hiding, required in a number of applications, such as in electronic voting. For network communications, anonymity can be provided by a mix network (mixnet). A mixnet is a multistage system that uses cryptography and permutations to provide anonymity. The basic idea of a mixnet has evolved into a number of different classes. In addition to presenting the existing mixnet classifications, this paper classifies mixnets based on the verification mechanisms employed for robustness. The construction of mixnets is presented under a common framework to provide insight into both the design and weaknesses of existing solutions. Basic forms of attack on mixnets and the corresponding robustness solutions are reviewed. Comparison with other solutions for anonymity and suggestions for interesting future research in mix networks are also provided.},
	pages = {2142--2181},
	number = {12},
	journaltitle = {Proceedings of the {IEEE}},
	shortjournal = {Proc. {IEEE}},
	author = {Sampigethaya, K. and Poovendran, R.},
	urldate = {2022-08-29},
	date = {2006},
	langid = {english},
}

@article{neff2001,
	title = {A Veriﬁable Secret Shufﬂe and its Application to E-Voting},
	abstract = {We present a mathematical construct which provides a cryptographic protocol to veriﬁably shuﬄe a sequence of k modular integers, and discuss its application to secure, universally veriﬁable, multi-authority election schemes. The output of the shuﬄe operation is another sequence of k modular integers, each of which is the same secret power of a corresponding input element, but the order of elements in the output is kept secret. Though it is a trivial matter for the “shuﬄer” (who chooses the permutation of the elements to be applied) to compute the output from the input, the construction is important because it provides a linear size proof of correctness for the output sequence (i.e. a proof that it is of the form claimed) that can be checked by an arbitrary veriﬁers. The complexity of the protocol improves on that of Furukawa-Sako[16] both measured by number of exponentiations and by overall size.},
	pages = {10},
	author = {Neff, Andrew},
	date = {2001},
	langid = {english},
}

@article{gibson2016,
	title = {A review of E-voting: the past, present and future},
	volume = {71},
	issn = {0003-4347, 1958-9395},
	url = {http://link.springer.com/10.1007/s12243-016-0525-8},
	doi = {10.1007/s12243-016-0525-8},
	shorttitle = {A review of E-voting},
	abstract = {Electronic voting systems are those which depend on some electronic technology for their correct functionality. Many of them depend on such technology for the communication of election data. Depending on one or more communication channels in order to run elections poses many technical challenges with respect to veriﬁability, dependability, security, anonymity and trust. Changing the way in which people vote has many social and political implications. The role of election administrators and (independent) observers is fundamentally diﬀerent when complex communications technology is involved in the process. Electronic voting has been deployed in many diﬀerent types of election throughout the world for several decades. Despite lack of agreement on whether this has been a ‘success’, there has been - in the last few years - enormous investment in remote electronic voting (primarily as a means of exploiting the internet as the underlying communication technology).},
	pages = {279--286},
	number = {7},
	journaltitle = {Annals of Telecommunications},
	shortjournal = {Ann. Telecommun.},
	author = {Gibson, J Paul and Krimmer, Robert and Teague, Vanessa and Pomares, Julia},
	urldate = {2022-08-29},
	date = {2016},
	langid = {english},
}

@misc{bernhard2017,
	title = {Public Evidence from Secret Ballots},
	url = {http://arxiv.org/abs/1707.08619},
	abstract = {Elections seem simple—aren’t they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results are correct; and the secrecy of the ballot must be ensured. And they have practical constraints: time is of the essence, and voting systems need to be affordable and maintainable, and usable by voters, election ofﬁcials, and pollworkers. It is thus not surprising that voting is a rich research area spanning theory, applied cryptography, practical systems analysis, usable security, and statistics. Election integrity involves two key concepts: convincing evidence that outcomes are correct and privacy, which amounts to convincing assurance that there is no evidence about how any given person voted. These are obviously in tension. We examine how current systems walk this tightrope.},
	number = {{arXiv}:1707.08619},
	publisher = {{arXiv}},
	author = {Bernhard, Matthew and Benaloh, Josh and Halderman, J. Alex and Rivest, Ronald L. and Ryan, Peter Y. A. and Stark, Philip B. and Teague, Vanessa and Vora, Poorvi L. and Wallach, Dan S.},
	urldate = {2022-08-29},
	date = {2017},
	langid = {english},
	eprinttype = {arxiv},
	eprint = {1707.08619 [cs]},
	keywords = {Computer Science - Cryptography and Security},
}

@online{buterin2022,
	title = {Some ways to use ZK-SNARKs for privacy},
	url = {https://web.archive.org/web/20220620222545/https://vitalik.ca/general/2022/06/15/using_snarks.html},
	titleaddon = {Vitalik Buterin's website},
	type = {blog},
	author = {Buterin, Vitalik},
	urldate = {2022-08-30},
	date = {2022},
}

@incollection{ryan2016,
	location = {Berlin, Heidelberg},
	title = {Crypto Santa},
	isbn = {978-3-662-49301-4},
	url = {https://doi.org/10.1007/978-3-662-49301-4_33},
	series = {Lecture Notes in Computer Science},
	abstract = {Secret Santa, also known as Kris Kindle etc., is a ceremony widely enacted in various countries, notably the Netherlands, on or around the 6th of December.},
	pages = {543--549},
	booktitle = {The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday},
	publisher = {Springer},
	author = {Ryan, Peter Y. A.},
	editor = {Ryan, Peter Y. A. and Naccache, David and Quisquater, Jean-Jacques},
	urldate = {2022-08-30},
	date = {2016},
	langid = {english},
	doi = {10.1007/978-3-662-49301-4_33},
	keywords = {Curious Party, Final Permutation, Partial Random Checks, Secret Santa, Unbalanced Secretion},
}

@inproceedings{terelius2010,
	location = {Berlin, Heidelberg},
	title = {Proofs of Restricted Shuffles},
	isbn = {978-3-642-12678-9},
	doi = {10.1007/978-3-642-12678-9_7},
	series = {Lecture Notes in Computer Science},
	abstract = {A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and re-encryption of another list of ciphertexts. We call a shuffle restricted if the permutation is chosen from a public subset of all permutations. In this paper, we introduce a general technique for constructing proofs of shuffles which restrict the permutation to a group that is characterized by a public polynomial. This generalizes previous work by Reiter and Wang [22], and de Hoogh et al. [7].},
	pages = {100--113},
	booktitle = {Progress in Cryptology – {AFRICACRYPT} 2010},
	publisher = {Springer},
	author = {Terelius, Björn and Wikström, Douglas},
	editor = {Bernstein, Daniel J. and Lange, Tanja},
	date = {2010},
	langid = {english},
	keywords = {cryptographic protocols, election schemes, mix-nets, proof of a shuffle},
}

@article{wikstrom2011,
	title = {How To Implement A Stand-alone Veriﬁer for the Veriﬁcatum Mix-Net},
	abstract = {Veriﬁcatum, http://www.verificatum.org, is a free and open source implementation of an El Gamal based mix-net which optionally uses the Fiat-Shamir heuristic to produce universally veriﬁable proofs of correctness during the execution of the protocol. This document gives a detailed description of these proofs targeting implementors of standalone veriﬁers.},
	pages = {30},
	author = {Wikstrom, Douglas},
	langid = {english},
        date = {2011},
}

@inproceedings{haenni2011,
	title = {Secure Internet Voting on Limited Devices with Anonymized DSA Public Keys},
	url = {https://www.usenix.org/conference/evtwote-11/secure-internet-voting-limited-devices-anonymized-dsa-public-keys},
	eventtitle = {2011 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections ({EVT}/{WOTE} 11)},
	author = {Haenni, Rolf and Spycher, Oliver},
	urldate = {2022-08-30},
	date = {2011},
	langid = {english},
}

@inproceedings{wikstrom2005,
	location = {Berlin, Heidelberg},
	title = {A Sender Verifiable Mix-Net and a New Proof of a Shuffle},
	isbn = {978-3-540-32267-2},
	doi = {10.1007/11593447_15},
	series = {Lecture Notes in Computer Science},
	abstract = {We introduce the first El Gamal based mix-net in which each mix-server partially decrypts and permutes its input, i.e., no re-encryption is necessary. An interesting property of the construction is that a sender can verify non-interactively that its message is processed correctly. We call this sender verifiability.},
	pages = {273--292},
	booktitle = {Advances in Cryptology - {ASIACRYPT} 2005},
	publisher = {Springer},
	author = {Wikström, Douglas},
	editor = {Roy, Bimal},
	date = {2005},
	langid = {english},
	keywords = {Cryptology {ePrint} Archive, Ideal Functionality, Internal Randomness, Secret Sharing Scheme, Security Parameter},
}

@inproceedings{wikstrom2009,
	location = {Berlin, Heidelberg},
	title = {A Commitment-Consistent Proof of a Shuffle},
	isbn = {978-3-642-02620-1},
	doi = {10.1007/978-3-642-02620-1_28},
	series = {Lecture Notes in Computer Science},
	abstract = {We introduce a pre-computation technique that drastically reduces the online computational complexity of mix-nets based on homomorphic cryptosystems.},
	pages = {407--421},
	booktitle = {Information Security and Privacy},
	publisher = {Springer},
	author = {Wikström, Douglas},
	editor = {Boyd, Colin and González Nieto, Juan},
	date = {2009},
	langid = {english},
	keywords = {Commitment Scheme, Full Version, Joint Decryption, Online Phase, Secret Sharing},
}

@online{veliz2021,
	title = {Why Democracy Needs Privacy},
	url = {https://bostonreview.net/articles/why-democracy-needs-privacy/},
	abstract = {The more someone knows about us, the more they can influence us. We can wield democratic power only if our privacy is protected.},
	titleaddon = {Boston Review},
	author = {Véliz, Carissa},
	urldate = {2022-08-31},
	date = {2021},
	langid = {american},
}

gha_language: HTML


text:
package operators

import (
	"fmt"
	"github.com/nuclio/logger"
	"github.com/v3io/xcp/backends"
)

func ListDir(task *backends.ListDirTask, logger logger.Logger) (*listResults, error) {

	list := listResults{
		fileChan: make(chan *backends.FileDetails, 1000),
		summary:  &backends.ListSummary{},
		errChan:  make(chan error, 60),
	}

	logger.InfoWith("list task", "from", task.Source)
	client, err := backends.GetNewClient(logger, task.Source)
	if err != nil {
		return nil, fmt.Errorf("failed to get list source, %v", err)
	}

	go func(errChan chan error) {
		var err error
		err = client.ListDir(list.fileChan, task, list.summary)
		if err != nil {
			errChan <- fmt.Errorf("failed in list dir, %v", err)
			fmt.Println(err)
		}
	}(list.errChan)

	return &list, nil
}

type listResults struct {
	fileChan chan *backends.FileDetails
	summary  *backends.ListSummary
	errChan  chan error

	currFile *backends.FileDetails
	err      error
}

func (l *listResults) Next() bool {
	var more bool
	l.currFile, more = <-l.fileChan

	if !more {
		select {
		case err := <-l.errChan:
			l.err = err
		default:
		}
		return false
	}
	return true
}

func (l *listResults) ReadAll() ([]*backends.FileDetails, error) {
	list := []*backends.FileDetails{}
	for l.Next() {
		list = append(list, l.At())
	}
	return list, l.err
}

func (l *listResults) Err() error {
	return l.err
}

func (l *listResults) At() *backends.FileDetails {
	return l.currFile
}

func (l *listResults) Name() string {
	return l.currFile.Key
}

func (l *listResults) Summary() *backends.ListSummary {
	return l.summary
}

gha_language: Go

extension: go


text:
/**
 * User: jackong
 * Date: 11/14/13
 * Time: 7:21 PM
 */
package service

import (
	"time"
	. "morning-dairy/global"
	"morning-dairy/model"
	"github.com/Jackong/db"
)

type dairy struct {

}

var (
	Dairy dairy
)

const (
	FROM_GLOBAL = "0"
	FROM_LEFT = "1"
	FROM_RIGHT = "2"
	FROM_UP = "3"
	FROM_DOWN = "4"
)

func init() {
	Dairy = dairy{}
}

//Dairies get dairies by date and operation
//THe date defines the date user want to view
//THe from defines the direction user switch from
//All dairies surrounding with date will be return when from is FROM_GLOBAL
//Else the dairies surrounding with date (not contain that date and the date switch from)
func (this dairy) Dairies(dateStr string, from string) (dairies map[string] db.Item) {
	dairies = make(map[string] db.Item)
	date, err := time.Parse(FORMAT_DATE, dateStr)
	if err != nil {
		return
	}
	for _, val := range []string{FROM_GLOBAL, FROM_LEFT, FROM_RIGHT, FROM_UP, FROM_DOWN} {
		if from != FROM_GLOBAL && (val == from || val == FROM_GLOBAL) {
			continue
		}
		toDate, dairy := this.GetDairy(date, val)
		dairies[toDate] = dairy
	}
	return
}

func (this dairy) GetDairy(date time.Time, from string) (dateStr string, dairy db.Item) {
	date = this.correspondDate(date, from)
	return date.Format(FORMAT_DATE), model.Dairy.FindByDate(date)
}

func (this dairy) correspondDate(date time.Time, from string) (time.Time) {
	switch from {
	case FROM_LEFT:
		date = date.AddDate(0, 0, -1)
	case FROM_RIGHT:
		date = date.AddDate(0, 0, 1)
	case FROM_UP:
		date = date.AddDate(0, -1, 0)
	case FROM_DOWN:
		date = date.AddDate(0, 1, 0)
	default:
	}
	return date
}

repository: Jackong/morning-dairy

repo_name: Jackong/morning-dairy


text:
@misc{sedgwick2020design,
 author = {Ruby Sedgwick and John Goertz and Molly Stevens and Ruth Misener and Mark van der Wilk},
 eprint = {arXiv:2011.10575},
 title = {Design of Experiments for Verifying Biomolecular Networks},
 url = {https://arxiv.org/abs/2011.10575},
 year = {2020}
}


text:
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/

%% Created for David Andersson at 2015-05-24 11:02:42 +0200

%% Saved with string encoding Unicode (UTF-8)

@book{social,
	Date-Added = {2015-05-24 09:00:12 +0000},
	Date-Modified = {2015-05-24 09:00:44 +0000},
	Publisher = {Socialstyrelsen},
	Title = {H{\"a}lso- och sjukv{\aa}rd J{\"a}mf{\"o}relser mellan landsting},
	Year = {2013}}

@article{svt,
	Author = {Niklas Forsberg and {\"O}rjan Magnusson and Diana Olofsson},
	Date-Added = {2015-05-24 08:45:19 +0000},
	Date-Modified = {2015-05-24 08:46:12 +0000},
	Journal = {SVT},
	Title = {Nu har l{\"a}karna tr{\"o}ttnat p{\aa} byr{\aa}kratin},
	Year = {2014}}

@article{maalqvist2011styrformer,
	Author = {M{\aa}lqvist, Ingela and {\AA}borg, Carl and Forsman, Mikael},
	Journal = {Stockholm, Sweden: Institutionen f{\"o}r folkh{\"a}lsovetenskap, Karolinska Institutet},
	Title = {Styrformer och arbetsf{\"o}rh{\aa}llanden inom v{\aa}rd och omsorg--en kunskapssammanst{\"a}llning om New Public Management},
	Year = {2011}}

@book{porter2006redefining,
	Author = {Porter, Michael E and Teisberg, Elizabeth Olmsted},
	Publisher = {Harvard Business Press},
	Title = {Redefining health care: creating value-based competition on results},
	Year = {2006}}

@misc{intervjuwiklund1,
	Author = {Wiklund, Erik},
	Howpublished = {Intervju},
	Month = {Mars. 25},
	Year = {2015}}

@article{zaremba,
	Author = {Zaremba, Maciej},
	Journal = {Dagens Nyheter},
	Title = {Den ol{\"o}nsamma patienten},
	Year = {2013}}

@book{nordenstrom2014vardebaserad,
	Author = {Nordenstr{\"o}m, J{\"o}rgen},
	Publisher = {Karolinska Institutet University Press, Stockholm},
	Title = {V{\"a}rdebaserad V{\aa}rd-{\"A}r vi s{\aa} bra vi kan bli?},
	Year = {2014}}

@article{engstrom,
	Author = {Engstr{\"o}m, Ingemar},
	Journal = {Dagens Nyheter},
	Title = {NPM en av de viktigaste fr{\aa}gorna},
	Year = {2013}}


text:
SUMMARY = "Python library implementing ASN.1 types."
HOMEPAGE = "http://pyasn1.sourceforge.net/"
LICENSE = "BSD-2-Clause"
LIC_FILES_CHKSUM = "file://LICENSE.rst;md5=a14482d15c2249de3b6f0e8a47e021fd"

SRC_URI[md5sum] = "dffae4ff9f997a83324b3f33fe62be54"
SRC_URI[sha256sum] = "aef77c9fb94a3ac588e87841208bdec464471d9871bd5050a287cc9a475cd0ba"

inherit pypi setuptools

RDEPENDS:${PN}:class-target += " \
    ${PYTHON_PN}-codecs \
    ${PYTHON_PN}-lang \
    ${PYTHON_PN}-logging \
    ${PYTHON_PN}-math \
    ${PYTHON_PN}-shell \
"

BBCLASSEXTEND = "native nativesdk"

SKIP_RECIPE[python-pyasn1] ?= "${@bb.utils.contains('I_SWEAR_TO_MIGRATE_TO_PYTHON3', 'yes', '', 'python2 is out of support for long time, read https://www.python.org/doc/sunset-python-2/ https://python3statement.org/ and if you really have to temporarily use this, then set I_SWEAR_TO_MIGRATE_TO_PYTHON3 to "yes"', d)}"

branch_name: refs/heads/jansa/master

gha_language: BitBake

extension: bb


text:
package godrill

import (
	"bytes"
	"encoding/json"
	"net/http"
	"reflect"
)

type TemplateEmail struct {
	Key             string             `json:"key"`
	TemplateName    string             `json:"template_name"`
	TemplateContent []*TemplateContent `json:"template_content"`
	Message         *Message           `json:"message"`
}

type TemplateContent struct {
	Name    string `json:"name"`
	Content string `json:"content"`
}

type Message struct {
	Subject         string      `json:"subject"`
	To              []*To       `json:"to"`
	FromName        string      `json:"from_name"`
	FromEmail       string      `json:"from_email"`
	MergeVars       []*MergeVar `json:"merge_vars"`
	GlobalMergeVars []*Var      `json:"global_merge_vars"`
}

type To struct {
	Email string `json:"email"`
	Name  string `json:"name"`
	Type  string `json:"type"`
}

type MergeVar struct {
	Recipient string `json:"rcpt"`
	Vars      []*Var `json:"vars"`
}

type Var struct {
	Name    string      `json:"name"`
	Content interface{} `json:"content"`
}

// NewTemplateEmail returns a new email using the specified
// template. It initializes it with the global API key.
func NewTemplateEmail(name string) (*TemplateEmail, error) {
	if Key == "" {
		return nil, ErrNotInitialized
	}
	message := &Message{}
	email := &TemplateEmail{Key: Key, TemplateName: name, Message: message}
	return email, nil
}

// SetTemplateContent sets the template's editable regions.
func (e *TemplateEmail) SetTemplateContent(content ...string) error {
	if e.TemplateName == "" {
		return ErrNoTemplateName
	}
	contentArr, err := formatTemplateContent(content)
	if err != nil {
		return err
	}

	e.TemplateContent = contentArr
	return nil
}

// SetSubject sets the subject of the message.
func (e *TemplateEmail) SetSubject(subject string) {
	e.Message.Subject = subject
}

// SetFrom sets the from information.
func (e *TemplateEmail) SetFrom(email, name string) {
	e.Message.FromEmail = email
	e.Message.FromName = name
}

// SetRecipient sets the recipients email & name, along with any personalized
// merge variables that are provided.
func (e *TemplateEmail) SetRecipient(email, name string, args ...interface{}) error {
	to := &To{
		Email: email,
		Name:  name,
		Type:  "to",
	}
	e.Message.To = append(e.Message.To, to)
	if len(args) > 1 {
		vars, err := formatVar(args)
		if err != nil {
			return err
		}
		mergeVar := &MergeVar{
			Recipient: email,
			Vars:      vars,
		}
		e.Message.MergeVars = append(e.Message.MergeVars, mergeVar)
	}
	return nil
}

// SetCC sets the email & name for the persons CC'ed in the email
// along with any personalized merge variables that are provided.
func (e *TemplateEmail) SetCC(email, name string, args ...interface{}) error {
	to := &To{
		Email: email,
		Name:  name,
		Type:  "cc",
	}
	e.Message.To = append(e.Message.To, to)
	if len(args) > 1 {
		vars, err := formatVar(args)
		if err != nil {
			return err
		}
		mergeVar := &MergeVar{
			Recipient: email,
			Vars:      vars,
		}
		e.Message.MergeVars = append(e.Message.MergeVars, mergeVar)
	}
	return nil
}

// SetBCC sets the email & name for the persons BCC'ed in the email
// along with any personalized merge variables that are provided.
func (e *TemplateEmail) SetBCC(email, name string, args ...interface{}) error {
	to := &To{
		Email: email,
		Name:  name,
		Type:  "bcc",
	}
	e.Message.To = append(e.Message.To, to)
	if len(args) > 1 {
		vars, err := formatVar(args)
		if err != nil {
			return err
		}
		mergeVar := &MergeVar{
			Recipient: email,
			Vars:      vars,
		}
		e.Message.MergeVars = append(e.Message.MergeVars, mergeVar)
	}
	return nil
}

// SetGlobalMergeVars sets the global merge variables for the email.
func (e *TemplateEmail) SetGlobalMergeVars(value ...interface{}) error {
	vars, err := formatVar(value)
	if err != nil {
		return err
	}

	e.Message.GlobalMergeVars = vars
	return nil
}

// Send calls the /messages/send-template.json endpoint of the mandrill API
// sending the current email.
func (e *TemplateEmail) Send() (*EmailSendResponse, *EmailSendErrorResponse, error) {
	sendTemplatePath := "messages/send-template.json"
	emailBytes, err := json.Marshal(e)
	if err != nil {
		return nil, nil, err
	}
	emailBuf := bytes.NewBuffer(emailBytes)

	emailRes, err := request("POST", sendTemplatePath, emailBuf)
	if err != nil {
		return nil, nil, err
	}
	defer emailRes.Body.Close()

	decoder := json.NewDecoder(emailRes.Body)

	if emailRes.StatusCode != http.StatusOK {
		var errRes EmailSendErrorResponse
		err = decoder.Decode(&errRes)
		if err != nil {
			return nil, nil, err
		}

		return nil, &errRes, nil
	}

	var er EmailSendResponse
	err = decoder.Decode(&er)
	if err != nil {
		return nil, nil, err
	}

	return &er, nil, nil
}

// formatTemplateContent creates an array of TemplateContent items
// from then given string array. It assumes that the first value
// of the pair will be the name while the second the content of
// the templates editable region.
func formatTemplateContent(arr []string) ([]*TemplateContent, error) {
	if len(arr)%2 != 0 {
		return nil, ErrOddNumberArguments
	}
	result := []*TemplateContent{}
	// work the array in pairs.
	for i := 0; i < len(arr); i += 2 {
		pair := &TemplateContent{
			Name:    arr[i],
			Content: arr[i+1],
		}
		result = append(result, pair)
	}
	return result, nil
}

// formatVar creates an array of Var structs from the given
// interface{} array. It assumes that the first value of the
// pair will be the name while the second the content
func formatVar(arr []interface{}) ([]*Var, error) {
	if len(arr)%2 != 0 {
		return nil, ErrOddNumberArguments
	}
	result := []*Var{}
	// work the array in pairs.
	for i := 0; i < len(arr); i += 2 {
		// unless the first value is a string, dump the pair.
		v := reflect.TypeOf(arr[i]).Kind()
		if v != reflect.String {
			return nil, ErrKeyNotString
		}
		pair := &Var{
			Name:    arr[i].(string),
			Content: arr[i+1],
		}
		result = append(result, pair)
	}
	return result, nil
}

repository: kostaskoukouvis/godrill

repo_name: kostaskoukouvis/godrill


text:
@inproceedings{alt-etal-2020-tacred,
    title = "{TACRED} Revisited: A Thorough Evaluation of the {TACRED} Relation Extraction Task",
    author = "Alt, Christoph  and
      Gabryszak, Aleksandra  and
      Hennig, Leonhard",
    booktitle = "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
    month = jul,
    year = "2020",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://www.aclweb.org/anthology/2020.acl-main.142",
    doi = "10.18653/v1/2020.acl-main.142",
    pages = "1558--1569",
    abstract = "TACRED is one of the largest, most widely used crowdsourced datasets in Relation Extraction (RE). But, even with recent advances in unsupervised pre-training and knowledge enhanced neural RE, models still show a high error rate. In this paper, we investigate the questions: Have we reached a performance ceiling or is there still room for improvement? And how do crowd annotations, dataset, and models contribute to this error rate? To answer these questions, we first validate the most challenging 5K examples in the development and test sets using trained annotators. We find that label errors account for 8{\%} absolute F1 test error, and that more than 50{\%} of the examples need to be relabeled. On the relabeled test set the average F1 score of a large baseline model set improves from 62.1 to 70.1. After validation, we analyze misclassifications on the challenging instances, categorize them into linguistically motivated error groups, and verify the resulting error hypotheses on three state-of-the-art RE models. We show that two groups of ambiguous relations are responsible for most of the remaining errors and that models may adopt shallow heuristics on the dataset when entities are not masked.",
}

branch_name: refs/heads/src

gha_language: TeX


text:
inherit setuptools
require python-websocket-client.inc

RDEPENDS_${PN} += "\
    ${PYTHON_PN}-argparse \
    ${PYTHON_PN}-lang \
"

repository: hanfeijp/meta-iot-cloud

repo_name: hanfeijp/meta-iot-cloud


text:
SUMMARY = "Programs used to build P4 for the P4 Behavioral Model"
HOMEPAGE = "https://github.com/p4lang/p4factory"
LICENSE = "Apache-2.0"
LIC_FILES_CHKSUM = "file://LICENSE;md5=2f3453ba8e98aaed11a290758a999e65"

# This will point to a forked repository
# https://git.openswitch.net/openswitch/ops-p4factory but we need to
# sort out how to do that first (because they are using submodules).
SRC_URI = "gitsm://github.com/p4lang/p4factory;protocol=https \
	file://patches/include_stdio.patch \
	file://patches/use_cross_compiler.patch \
	file://patches/no_redis.patch \
	file://patches/fix_cpp_compilation.patch \
"
SRCREV = "2b69702c678df8e5542bbdc2686cc706b12b6335"
PV = "git${SRCPV}"
S = "${WORKDIR}/git"

DEPENDS = "thrift judy libedit thrift-native python-native p4-hlir python-pyyaml-native"
RDEPENDS_${PN} = "thrift libedit judy libpcap"

inherit pythonnative

do_compile() {
	make VERBOSE=1 -C targets/basic_routing
}

do_install() {
}

repository: ziozzang/ops-build

repo_name: ziozzang/ops-build