text:
%
% Bibtex file for the Security of Systems group 2004.
%
% Policy
% ======
% - each group member inserts his own publications (for 2004)
%   in this file
% - only published papers are put here---no ``to appear's''---with
%   full bibliographic data (volume/page numbers etc.)
% - there is no uniform labeling or coding style required
% - uniformity for publications in the same journals/series (like
%   LNCS) is appreciated
%

% Journal & Conference shorthands

@STRING{JLAP    = "Journ. of Logic and Algebraic Programming"}
@STRING{LNCS    = "Lect. Notes Comp. Sci."}
@STRING{ENTCS   = "Electronic Notes in Theoretical Computer Science"}

@ARTICLE{HubbersJ04,
AUTHOR       = {E. Hubbers and B. Jacobs},
TITLE        = {{Stemmen via internet geen probleem}},
JOURNAL      = {Automatisering Gids},
DATE         = {25 okt.},
VOLUME       = {42},
PAGES        = {15},
YEAR         = {2004}
}

@inproceedings{HubbersPoll04,
  author     = {E. Hubbers and E. Poll},
  title      = {{Reasoning about Card Tears and Transactions in {Java Card}}},
  booktitle  = {{Fundamental Approaches to Software Engineering (FASE'2004), Barcelona, Spain}},
  pages      = {114--128},
  EDITOR = {M. Wermelinger and T. Margaria-Steffen},
  publisher  = {Springer},
  series     = LNCS,
  volume     = {2984},
  ISBN = {3-540-21305-8},
  URL = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2984&spage=114},
  PDF = {http://www.cs.kun.nl/ita/publications/papers/hubbers/fase2004.pdf},
  year       = {2004},
}

@ARTICLE{HughesJ04,
AUTHOR       = {J. Hughes and B. Jacobs},
TITLE        = {{Simulations in Coalgebra}},
JOURNAL      = TCS,
VOLUME       = {327(1-2)},
PAGES        = {71--108},
YEAR         = {2004}
}

@ARTICLE{Jacobs04a,
AUTHOR       = {B. Jacobs},
TITLE        = {{Weakest Precondition Reasoning for {Java} Programs
                with {JML} Annotations}},
JOURNAL      = JLAP,
VOLUME       = {58},
PAGES        = {61--88},
YEAR         = 2004}

@INPROCEEDINGS{Jacobs04b,
AUTHOR       = {B. Jacobs},
TITLE        = {{Counting votes with formal methods}},
BOOKTITLE    = {{Algebraic Methods and Software Technology}},
EDITOR       = {C. Rattray and S. Maharaj and C. Shankland},
PAGES        = {21--22},
PUBLISHER    = {Springer, Berlin},
SERIES       = LNCS,
NUMBER       = {3116},
YEAR         = {2004}
}

@ARTICLE{Jacobs04c,
AUTHOR       = {B. Jacobs},
TITLE        = {{Ongebreidelde functionaliteit grootste vijand beveiliging}},
JOURNAL      = {Automatisering Gids},
DATE         = {24 sept.},
YEAR         = {2004}
}

@INPROCEEDINGS{Jacobs04d,
AUTHOR       = {B. Jacobs},
TITLE        = {{Relating two Approaches to Coinductive Solution of Recursive Equations}},
BOOKTITLE    = {Coalgebraic Methods in Computer Science},
EDITOR       = {J. Ad{\'a}mek and S. Milius},
PUBLISHER    = {Elsevier, Amsterdam},
SERIES       = ENTCS,
NUMBER       = {106},
NOTE         = {\url{http://www.sciencedirect.com/science/journal/15710661}},
YEAR         = {2004}
}

@INPROCEEDINGS{Jacobs04e,
AUTHOR       = {B. Jacobs},
TITLE        = {{Trace Semantics for Coalgebras}},
BOOKTITLE    = {{Coalgebraic Methods in Computer Science}},
EDITOR       = {J. Ad{\'a}mek and S. Milius},
PUBLISHER    = {Elsevier, Amsterdam},
SERIES       = ENTCS,
NUMBER       = {106},
NOTE         = {\url{http://www.sciencedirect.com/science/journal/15710661}},
YEAR         = {2004}
}

@ARTICLE{Jacobs04f,
AUTHOR       = {B. Jacobs},
TITLE        = {{Vakmanschap van overwegend belang binnen informatie\-beveiliging}},
JOURNAL      = {Informatiebeveiliging},
VOLUME       = {6},
DATE         = {nov.},
YEAR         = {2004}
}

@INPROCEEDINGS{JacobsMR04,
AUTHOR       = {B. Jacobs and C. March{\'e} and N. Rauch},
TITLE        = {{Formal verification of a commercial smart card applet with multiple tools}},
BOOKTITLE    = {{Algebraic Methods and Software Technology}},
EDITOR       = {C. Rattray and S. Maharaj and C. Shankland},
PAGES        = {241--257},
PUBLISHER    = {Springer, Berlin},
SERIES       = LNCS,
NUMBER       = {3116},
YEAR         = {2004}
}

@ARTICLE{JacobsOW04,
AUTHOR       = {B. Jacobs and M. Oostdijk and M. Warnier},
TITLE        = {{Source Code Verification of a Secure Payment Applet}},
JOURNAL      = JLAP,
VOLUME       = {58},
PAGES        = {107--120},
YEAR         = {2004}
}

@INPROCEEDINGS{JacobsP04,
AUTHOR       = {B. Jacobs and E. Poll},
TITLE        = {{Java Program Verification at Nijmegen: Developments and Perspective}},
BOOKTITLE    = {{Software Security -- Theories and Systems}},
EDITOR       = {K. Futatsugi and F. Mizoguchi and N. Yonezaki},
PUBLISHER    = {Springer, Berlin},
SERIES       = LNCS,
NUMBER       = {3233},
PAGES        = {134--153},
YEAR         = {2004}
}

@ARTICLE{JacobsV04,
AUTHOR       = {B. Jacobs and F. Vaandrager},
TITLE        = {{Onderzoeksagenda remt innovatief onderzoek}},
JOURNAL      = {Automatisering Gids},
DATE         = {9 juli},
YEAR         = {2004}
}

@Article{Kiniry04-IME,
   author =       {Joseph R.~Kiniry},
   title =        {{Formalizing the User's Context to Support User Interfaces for Integrated Mathematical Environments}},
   journal =      {ENTCS},
   year =         {2004},
   volume =       {103},
   publisher =    {Elsevier},
}

@techreport{HubbersPoll04a,
  author =   {Engelbert Hubbers and Erik Poll},
  institution =  {Radboud University Nijmegen},
  number =   {NIII-R0438},
  title =    {{Transactions and non-atomic {API} calls in {Java Card}:  specification ambiguity and strange implementation behaviours}},
  year =     {2004},
  month =    oct
}

@techreport{KiniryCok04,
  author =   {David R. Cok and Joseph R. Kiniry},
  institution =  {Radboud University Nijmegen},
  number =   {NIII-R0413},
  title =    {{ESC/Java2: Uniting ESC/Java and JML: Progress and issues in building and using ESC/Java2}},
  year =     {2004},
}

@inproceedings{KiniryCok04b,
  author =   {David R. Cok and Joseph R. Kiniry},
  title =    {{ESC/Java2: Uniting ESC/Java and JML: Progress and issues in building and using ESC/Java2 and a report on a case study involving the use of ESC/Java2 to verify portions of an Internet voting tally system}},
    series    = LNCS,
    number    = {3362},
    pages     = {262-279},
    publisher = {Springer, Berlin},
    year      = {2004},
}

@techreport{Kiniry04,
  author =   {Joseph R. Kiniry},
  institution =  {Radboud University Nijmegen},
  number =   {NIII-R0420},
  title =    {{Semantic Properties for Lightweight Specification in Knowledgeable Development Environments}},
  year =     {2004},
}

@techreport{Kiniry04b,
  author =   {Joseph R. Kiniry},
  institution =  {Radboud University Nijmegen},
  number =   {NIII-R0419},
  title =    {{Kind Theory and Software Reuse}},
  year =     {2004},
}

@INPROCEEDINGS{HOP04,
  AUTHOR = {E.-M.G.M. Hubbers and M.D. Oostdijk and E. Poll},
  TITLE = {{Implementing a formally verifiable security protocol in {J}ava {C}ard}},
  BOOKTITLE = {{Proceedings of the 1st international conference on security in pervasive computing}},
  SERIES = LNCS,
  PUBLISHER = {Springer-Verlag},
  EDITOR = {D. Hutter and G. Müller and W. Stephan and M. Ullmann},
  VOLUME = {2802},
  PAGES = {213--226},
  YEAR = {2004},
  ISBN = {3-540-20887-9},
  URL = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2802&spage=213},
  PDF = {http://www.cs.kun.nl/ita/publications/papers/hubbers/spc2003.pdf},
  NOTE = {March 12--14, 2003, \url{http://www.dfki.de/SPC2003/}}
}

@INPROCEEDINGS{GarciaHoepmanNieuwenhuizen04,
  AUTHOR =       {F. D. Garcia and J.-H. Hoepman and J. van Nieuwenhuizen},
  TITLE =        {{Spam Filter Analysis}},
  BOOKTITLE =    {{Security and Protection in Information Processing Systems.  IFIP TC11 19th International Information Security Conference {(SEC2004)}}},
  YEAR =         {2004},
  editor =       {Deswarte, Y. and Cuppens, F. and Jajodia, S. and Wang, L.},
  address =      {Toulouse, France},
  month =        aug,
  pages =        {395-410},
  publisher =    {Kluwer Academic Publishers}
}

@techreport{VanWeeldenEtAl04,
  author      = {A. van Weelden and L. Frantzen and M. Oostdijk and P. Koopman and J. Tretmans},
  title       = {{On-the-Fly Formal Testing of a Smart Card Applet}},
  institution = {Radboud University Nijmegen},
  number      = {NIII-R0428},
  year        = {2004}
}

@ARTICLE{Warnier04a,
AUTHOR       = {M. Warnier},
TITLE        = {{Stiekem gedoe in de stemcomputer}},
JOURNAL      = {B4U Magazine},
DATE         = {21 mei},
YEAR         = {2004}
}

@INPROCEEDINGS{achp04:higher_order_gecs,
    author    = {Peter Achten and Marko van Eekelen and Rinus Plasmeijer and Arjan van Weelden},
    title     = {{{A}utomatic {G}eneration of {E}ditors for {H}igher-{O}rder {D}ata {S}tructures}},
    booktitle = {{Programming Languages and Systems (APLAS 2004)}},
    Editor    = {{W}ei-{N}gan {C}hin},
    address    = {Taipeh, Taiwan},
    series    = LNCS,
    number    = {3302},
    pages     = {262-279},
    publisher = {Springer, Berlin},
    month     = nov,
    year      = {2004}
}

@INPROCEEDINGS{kesr04:proof_rule_general_type_classes,
    author    = {Ron van Kesteren and Marko van Eekelen and Maarten de Mol},
    title     = {{{A}n {E}ffective {P}roof {R}ule for {G}eneral {T}ype {C}lasses}},
    booktitle = {{Trends in Functional Programming (TFP 2004)}},
    Editor    = {{H}ans-{W}olfgang {L}oidl},
    address    = {M\"unchen, Germany},
    pages     = {149-165},
    publisher = {Ludwig-Maximilians Universit\"at, M\"unchen},
    month     = nov,
    year      = {2004}
}

@INPROCEEDINGS{
    lenl04:induction_and_coinduction_in_sparkle,
    author    = {Leonard Lensink and Marko van Eekelen},
    title     = {{I}nduction and {C}o-induction in {S}parkle},
    booktitle = {Trends in Functional Programming (TFP 2004)},
    Editor    = {{H}ans-{W}olfgang {L}oidl},
    address    = {M\"unchen, Germany},
    pages     = {273-293},
    publisher = {Ludwig-Maximilians Universit\"at, M\"unchen},
    month     = nov,
    year      = {2004}
}

@InProceedings{GarHN04,
  author = 	 {Flavio D. Garcia and Jaap-Henk Hoepman and Jeroen van Nieuwenhuizen},
  title = 	 {{Spam Filter Analysis}},
  booktitle = 	 {{IFIP TC11 19th Int. Conf. on Information Security (SEC2004)}},
  month =        aug,
  note =         {eprint cs.CR/0402046},
  year = 	 {2004},
  url =          {\url{http://arxiv.org/abs/cs.CR/0402046}},
  localps =      {spam-filter.ps},
  localpdf =     {spam-filter.pdf}
}

@InProceedings{garcia2004karmaabstract,
  author = 	 {Flavio D. Garcia and Jaap-Henk Hoepman},
  title = 	 {{Off-line Karma: Towards a Decentralized Currency for Peer-to-peer and Grid Applications (Brief Abstract)}},
  booktitle = 	 {{Workshop on Secure Multiparty Computations (SMP)}},
  address =      {Amsterdam, The Netherlands},
  month =        oct # { 7--8},
  year =	 {2004},
  localps =	 {karma-smp-abstract.ps},
  localpdf =	 {karma-smp-abstract.pdf}
}

@InProceedings{Hoe04a,
  author = 	 {Jaap-Henk Hoepman},
  title = 	 {{The Ephemeral Pairing Problem}},
  booktitle = 	 {8th Int.\ Conf.\ Financial Cryptography},
  year = 	 {2004},
  address =	 {Key West, FL, USA},
  series =	 LNCS,
  volume =  {3110},
  publisher =	 {Springer},
  month =	 feb # { 9--12},
  pages =        {212--226},
  localpdf =     {pairing.pdf},
  localps =     {pairing.ps}
}

@proceedings{FTFJP2003,
  author    = {S. Eisenbach and G.T. Leavens and P. M\"{u}ller and A. Poetzsch-Heffter and E. Poll},
  title     = {{Formal Techniques for Java-Like Programs}},
  editor    = {F. Buschmann and A.P. Buchmann and M. Cilia},
  booktitle = {{ECOOP 2003 Workshop Reader, ECOOP 2003 Workshops, Darmstadt, Germany, July 21-25, 2003}},
  publisher = {Springer},
  series    = LNCS,
  volume    = {3013},
  year      = {2004},
  pages     = {62-71}
}

@article{MullerNaumannPoll04,
  author =   {P. M\"{u}ller and D.A. Naumann and E. Poll},
  title =    {{Special Issue: {Formal Techniques for Java-like Programs}}},
  journal =   {Concurrency and Computation: Practice and Experience},
  pages =   {645-646},
  volume =   {16},
  number =   {7},
  publisher = {Wiley},
  year = {2004}
}

@techreport{Poll04,
  author =   {E. {Poll (editor)}},
  institution =  {University of Nijmegen},
  number =   {NIII-R0426},
  title =    {{Proceedings of the {ECOOP} workshop on {Formal Techniques for Java-like Programs (FTfJP)}}},
  year =     {2004}
}

@proceedings{FTFJP2004,
  author    = {A. Coglio and M. Huisman and J.R. Kiniry and P. M{\"u}ller and E. Poll},
  title     = {{Formal Techniques for Java-Like Programs (FTfJP'04)}},
  editor    = {Jacques Malenfant and Bjarte M. {\O}stvold},
  booktitle = {ECOOP 2004 Workshop Reader},
  publisher = {Springer},
  series    = LNCS,
  year      = {2004},
  volume    = {3344},
  pages    = {75--82}
}

@techreport{HJP04,
  author = {E.-M.G.M. Hubbers and  B.P.F. Jacobs and W. Pieters},
  title = {{RIES -- Internet Voting in Action}},
  institution = {Radboud University Nijmegen},
  number = {NIII-R0449},
  year = {2004},
  month = dec,
}

repository: joostrenes/web

repo_name: joostrenes/web


text:
@article{ar:blankrot2018,
	author = {Boaz Blankrot and Clemens Heitzinger},
	title = {Efficient computational design and optimization of dielectric metamaterial devices},
	year = {2018},
	eprint = {arXiv:1804.09489},
	url = {https://arxiv.org/abs/1804.09489}
}

@article{ar:optimjl,
	doi = {10.21105/joss.00615},
	url = {https://doi.org/10.21105/joss.00615},
	year  = {2018},
	month = {apr},
	publisher = {The Open Journal},
	volume = {3},
	number = {24},
	pages = {615},
	author = {Patrick K Mogensen and Asbj{\o}rn N Riseth},
	title = {Optim: A mathematical optimization package for Julia},
	journal = {Journal of Open Source Software}
}

@article{ar:alldielectric,
	title={All-dielectric metamaterials},
	author={Jahani, Saman and Jacob, Zubin},
	journal={Nature Nanotechnology},
	volume={11},
	number={1},
	pages={23--36},
	year={2016},
	publisher={Nature Research},
	doi={10.1038/nnano.2015.304}
}

license: MIT

license_type: permissive

branch_name: refs/heads/master

extension: bib


text:
require linux-stable.inc

LIC_FILES_CHKSUM = "file://COPYING;md5=6bc538ed5bd9a7fc9398086aedcd7e46"

KERNEL_CONFIG_COMMAND = "oe_runmake_call -C ${S} CC="${KERNEL_CC}" O=${B} olddefconfig"

COMPATIBLE_MACHINE = "beaglebone"

KERNEL_DEVICETREE ?= " \
    am335x-boneblack.dtb \
    am335x-boneblack-wireless.dtb \
    am335x-boneblue.dtb \
    am335x-bonegreen.dtb \
    am335x-bonegreen-wireless.dtb \
    am335x-pocketbeagle.dtb \
    \
    bbb-4dcape43t.dtb \
    bbb-4dcape43t-spi.dtb \
    bbb-4dcape70t.dtb \
    bbb-gen4-4dcape50t.dtb \
    bbb-nhd5cape.dtb \
    bbb-nhd7cape.dtb \
    bbb-bcc-s6.dtb \
"

LINUX_VERSION = "5.7"
LINUX_VERSION_EXTENSION = "-jumpnow"

FILESEXTRAPATHS_prepend := "${THISDIR}/linux-stable-${LINUX_VERSION}:${THISDIR}/linux-stable-${LINUX_VERSION}/dts:"

S = "${WORKDIR}/git"

PV = "5.7.19"
SRCREV = "6b9830fecd4a87d7ebb4d93484fef00f46d0fa0f"
SRC_URI = " \
    git://git.kernel.org/pub/scm/linux/kernel/git/stable/linux-stable.git;branch=linux-${LINUX_VERSION}.y \
    file://defconfig \
    file://0001-spidev-Add-a-generic-compatible-id.patch \
    file://0002-dts-Remove-bbb-cape-i2c-definitions.patch \
    file://0003-wlcore-Change-NO-FW-RX-BA-session-warnings-to-debug.patch \
    \
    file://bbb-dcan0.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-dcan1.dtsi;subdir=git/arch/arm/boot/dts\
    file://bbb-i2c1.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-i2c2.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-spi0-spidev.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-spi1-spidev.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-uart1.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-uart2.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-uart4.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-uart5.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-4dcape43t-keypad.dtsi;subdir=git/arch/arm/boot/dts \
    file://bbb-4dcape70t-keypad.dtsi;subdir=git/arch/arm/boot/dts \
    \
    file://bbb-4dcape43t.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-4dcape43t-spi.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-4dcape70t.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-gen4-4dcape50t.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-nhd5cape.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-nhd7cape.dts;subdir=git/arch/arm/boot/dts \
    file://bbb-bcc-s6.dts;subdir=git/arch/arm/boot/dts \
"

repository: jumpnow/meta-bbb

repo_name: jumpnow/meta-bbb

branch_name: refs/heads/dunfell

gha_license_id: MIT

gha_language: Shell

extension: bb


text:
@misc{dyptop_outputs,
 author = {Stocker, B.D. and Yu, Z. and Massa, C. and Joos, F.},
 doi = {10.3334/ORNLDAAC/1382},
 language = {eng},
 publisher = {ORNL Distributed Active Archive Center},
 title = {Global Peatland Carbon Balance and Land Use Change CO2 Emissions Through the Holocene},
 url = {https://daac.ornl.gov/cgi-bin/dsviewer.pl?ds_id=1382},
 year = {2017}
}


text:
@inproceedings{10.1145/3261248,
author = {Mitra, Prasenjit},
title = {Session Details: Querying, Question Answering, & Searching},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3261248},
doi = {10.1145/3261248},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
numpages = {1},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651589,
author = {Lee, Dik Lun},
title = {User Profiling and Personalized Information Delivery on the Static and Mobile Web},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651589},
doi = {10.1145/1651587.1651589},
abstract = {Imagine a system that can push highly selective information right to our hands when and only when we need it. This requires a mind-reading machine, but unfortunately we don't have one --- yet. User profiling attempts to estimate what is most important to a user at a particular point in time and space. In this talk, I will start with simple raw data such as the users' queries and clicks on the web and places they have visited to estimate what they might be interested in. We further divide user interests into content-based and location-based. We discuss issues involving the transformation of raw activities to conceptual needs, identifying user groups for collaborative filtering and the roles of locations in personalized information delivery.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {1–2},
numpages = {2},
keywords = {clickthrough, query clustering, user clustering, user profiling},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651590,
author = {Pera, Maria S. and Qumsiyeh, Rani and Shaikh, Meher T. and Ng, Yiu-Kai},
title = {Retrieving Good, Better, and Best Answers to Questions in Advertisements},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651590},
doi = {10.1145/1651587.1651590},
abstract = {Question-Answering (QA) service is a growing area of research study, and commercial QA systems have recently been developed. We are motivated to provide complementary QA service that answers questions in advertisements (ads). These days with almost all businesses online, potential buyers who search for merchandises to purchase through the Internet are also flourishing. When a Web user looks for products online, he may have many questions on his mind for which he would be eager to receive answers prior to finalizing his purchasing decision. Although some ads Web sites are complemented with FAQs, their QA services either are non-existent or do not provide answers to inquires in real time automatically. We address these problems by answering user's questions such as "Which is the cheapest car?", "Are there any entry-level, software developer positions?", etc., spontaneously in real time. Existing general-purpose QA systems, such as Ask.com, provide answers to a user's question Q in a list format. A more sophisticated approach is to order the answers to Q according to their degrees of relevance to Q. We propose a QA system which deals with the challenge of interpreting users' questions and retrieves correct, as well as partially-matched ranked, answers. Experimental results have verified that the proposed QA system is highly accurate in answering users' questions on car ads.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {3–6},
numpages = {4},
keywords = {similarity measure, partial matching, question answering},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651591,
author = {Stamou, Sofia and Kozanidis, Lefteris},
title = {Impact of Search Results on User Queries},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651591},
doi = {10.1145/1651587.1651591},
abstract = {In this paper, we experimentally study how web searchers select the keywords to describe their information needs and specifically we investigate whether query keyword selections are influenced by the results the users reviewed for a previous search. For our study, we determine two types of searches: (i) those in which users define their queries without any external influence and which we call tightly-focused and (ii) those in which users define their queries under some external influence and which we call loosely-focused. Based on the analysis of the user querying trends and web visits on the query results, we propose a model that tries to capture the results' influence on the specification of the subsequent user queries. The application of our model on a search trace of 19,250 queries issued to Google by 18 users over a period of two months reveals that in overall search results influence the specification of 12.79% of the web queries.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {7–10},
numpages = {4},
keywords = {querying trends, web search, search results influence},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651592,
author = {Skopal, Tom\'{a}\v{s} and Dohnal, Vlastislav and Batko, Michal and Zezula, Pavel},
title = {Distinct Nearest Neighbors Queries for Similarity Search in Very Large Multimedia Databases},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651592},
doi = {10.1145/1651587.1651592},
abstract = {As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most popular retrieval concept is the k nearest neighbor (kNN) search. For a long time, the kNN queries provided an effective retrieval in multimedia databases. However, as today's multimedia databases available on the web grow to massive volumes, the classic kNN query quickly loses its descriptive power. In this paper, we introduce a new similarity query type, the k distinct nearest neighbors (kDNN), which aims to generalize the classic kNN query to be more robust with respect to the database size. In addition to retrieving just objects similar to the query example, the kDNN further ensures the objects within the result have to be distinct enough, i.e. excluding near duplicates.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {11–14},
numpages = {4},
keywords = {content-based retrieval, similarity search, knn query},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/3261249,
author = {Choi, Bryon},
title = {Session Details: Web Algorithms},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3261249},
doi = {10.1145/3261249},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
numpages = {1},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651594,
author = {Suzuki, Nobutaka and Fukushima, Yuji},
title = {Satisfiability of Simple Xpath Fragments in the Presence of Dtds},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651594},
doi = {10.1145/1651587.1651594},
abstract = {For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an empty set without evaluating it. However, it is shown that the XPath satisfiability problem is intractable for a large number of XPath fragments. In this paper, we consider simple XPath fragments under two restrictions; (i) only a label can be specified as a node test and (ii) operators such as qualifier ([]) and union (∪) are not allowed. We first show that, for some small XPath fragments under the above restrictions, the satisfiability problem is still NP-complete. Then we show that there exist XPath fragments, containing the above small fragments, for which the satisfiability problem is in PTIME under duplicate-free DTDs.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {15–22},
numpages = {8},
keywords = {xpath, xml, satisfiability, dtd},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651595,
author = {Hasan, Tahira and Mudur, Sudhir P. and Shiri, Nematollaah},
title = {A Session Generalization Technique for Improved Web Usage Mining},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651595},
doi = {10.1145/1651587.1651595},
abstract = {Generalization of web sessions is an effective approach used to overcome two major challenges in web usage mining, namely quality and scalability. Given a concept hierarchy, such as a website, generalization replaces actual page-clicks with their general concepts, i.e., nodes at higher levels. Presently known methods do this by choosing a level in the hierarchy, below which all the nodes are generalized to nodes at this level. The problem with this is that significant items may be coalesced, and insignificant ones may be retained. We present a usage driven generalization algorithm, which coalesces less significant pages into more general ones, independent of their level in the hierarchy. Based on actual usage set of sessions, item significance is estimated approximately but fast, using a small stratified sample of the large dataset. While providing scalability, the proposed generalization technique results in improved efficiency and quality of the discovered usage model, demonstrated through numerous experiments in our work.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {23–30},
numpages = {8},
keywords = {usage profiles, recommender systems, web usage mining, data generalization, fuzzy clustering},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651596,
author = {Zhang, Xianchao and Han, Bo and Liang, Wenxin},
title = {Automatic Seed Set Expansion for Trust Propagation Based Anti-Spamming Algorithms},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651596},
doi = {10.1145/1651587.1651596},
abstract = {Seed sets are of significant importance for trust propagation based anti-spamming algorithms, e.g., TrustRank. Conventional approaches require manual evaluation to construct a seed set, which restricts the seed set to be small in size, since it would cost too much and may even be impossible to construct a very large seed set manually. The small-sized seed set can cause detrimental effect on the final ranking results. Thus, it is desirable to automatically expand an initial seed set to a much larger one. In this paper, we propose the first automatic seed set expansion algorithm (ASE), which expands a small seed set by selecting reputable seeds that are found and guaranteed to be reputable through a joint recommendation link structure. Experimental results on the WEBSPAM-2007 dataset show that with the same manual evaluation efforts, ASE can automatically obtain a large number of reputable seeds with high precision, thus significantly improving the performance of the baseline algorithm in terms of both reputable site promotion and spam site demotion.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {31–38},
numpages = {8},
keywords = {link analysis, seed selection, seed expansion, trustrank, spam},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/3261250,
author = {Fletcher, George},
title = {Session Details: Web Information Mining & Extraction Techniques},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3261250},
doi = {10.1145/3261250},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
numpages = {1},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651598,
author = {Lee, Jung-Jin and Lee, Jung-Hyun and Ha, JongWoo and Lee, SangKeun},
title = {Novel Web Page Classification Techniques in Contextual Advertising},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651598},
doi = {10.1145/1651587.1651598},
abstract = {Contextual advertising seeks to place relevant ads to generic web pages based on their contents. Recently, it has been observed that classifying web pages into a well-organized taxonomy of topics is promising for matching topically relevant ads to web pages. Following the observation, in this paper we propose two methods to increase classification accuracy for web pages in the context of contextual advertising. Our strategy is to enhance the baseline classifier by reflecting unique features of web pages and the taxonomy. In particular, category tags extracted from web pages are utilized to augment term weights, and the hierarchical structure of the taxonomy is taken into account to categorize web pages with high confidence. We conduct a series of experiments to evaluate the proposed methods, and the results show that classification accuracy is increased up to 11% compared to the baseline classifier.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {39–47},
numpages = {9},
keywords = {comparative distance score, category tag, web page classification, concept hierarchy},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651599,
author = {Nguyen Hoang, Tu Anh and Hoang, Kiem},
title = {Efficient Approach for Incremental Vietnamese Document Clustering},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651599},
doi = {10.1145/1651587.1651599},
abstract = {In this paper, we present how to use graph model for clustering Vietnamese document incrementally. Graph based model allows us to model completely the structure of not only each document but also the whole collection of documents. The graph structure is easily updated when there is a new document. When building the graph incrementally we can identify representative subgraph features, which are later used for calculating hybrid pair-wise document similarity. These subgraph features make clustering process less sensitive to the Vietnamese word segmentation step. Based on the hybrid similarity measure, the documents are groups into clusters on-the-fly without any assumptions on the number of clusters and without retrieving previous documents.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {47–54},
numpages = {8},
keywords = {graph model, incremental document clustering, shared phrases, vietnamese},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651600,
author = {Chen, You and Yang, Sen and Cheng, XueQi},
title = {Bursty Topics Extraction for Web Forums},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651600},
doi = {10.1145/1651587.1651600},
abstract = {Many bursty topics which are difficult to summarize and search exist in web forums. Most existing topic detection and tracking (TDT) methods deal with the news stories, but the language used in web forums are much casual, oral and informal compared with news data. In this paper, we present a noise-filtered model to extract bursty topics from web forums using terms and participations of users. Conducting experiments in ShuiMu community we demonstrate the efficiency of our model. Our model not only extracts bursty topics which are better organized for search and visualization, but also discoveries communities corresponding to these topics.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {55–58},
numpages = {4},
keywords = {frequency segment, bursty topics, web forums, feature trajectory},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651601,
author = {Liu, Yanhong and Jin, Peiquan and Yue, Lihua},
title = {Extracting Position Relations from the Web},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651601},
doi = {10.1145/1651587.1651601},
abstract = {In this paper, we present a new algorithm to extract people's position in a corporation from the Web. People's position in a corporation, which the term position relation refers to, is a kind of significant competitive intelligence for enterprises. Our algorithm is based on the structural feature of position relation in Web contents, i.e., position relation is usually described in Web pages as a table or a list. In order to define the structural feature of Web contents, we first introduce a structural coefficient for each Web page. This structural coefficient is then used to generate structural file segments from Web pages. A structural file segment consists of all the candidates of position relation with a similar structure. We then employ a pattern-matching method to extract position relations from the structural file segments. Finally, we conduct experiments on a real data set containing 6028 Chinese Web pages gathered through the Baidu search engine, and evaluate the precision and recall of our approach. The experimental results show that our algorithm has a high precision over 96% as well as a recall over 87%.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {59–62},
numpages = {4},
keywords = {position relation, relation extraction, structural file segment},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651602,
author = {Ahmed, Emdad and Jamil, Hasan M.},
title = {Post Processing Wrapper Generated Tables for Labeling Anonymous Datasets},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651602},
doi = {10.1145/1651587.1651602},
abstract = {A large number of wrappers generate tables without column names for human consumption because the meaning of the columns are apparent from the context and easy for humans to understand, but in emerging applications, labels are needed for autonomous assignment and schema mapping where machine try to understand the tables. Autonomous label assignment is critical in volume data processing where ad hoc mediation, extraction and querying is involved. We propose an algorithm Lads for Labeling Anonymous Datasets, which can holistically label tabular web document. The algorithm has been tested on anonymous datasets from a number of sites, e.g music, movie, political, demographic, athletic obtained through different search engines such as Google, Yahoo and MSN. The comparative probabilities of attributes being candidate labels are presented which seem to be very promising, achieved as high as 93% probability of assigning good label to anonymous attribute. To the best of our knowledge, this is the first of its kind for label assignment based on multiple search engines' recommendation.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {63–66},
numpages = {4},
keywords = {ontology, anonymous datasets, html forms, wrapper, hidden web, web data integration},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/3261251,
author = {Wong, Raymond Chi-Wing},
title = {Session Details: Searching, Matching, & Browsing},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3261251},
doi = {10.1145/3261251},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
numpages = {1},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651604,
author = {Motoyama, Marti and Varghese, George},
title = {I Seek You: Searching and Matching Individuals in Social Networks},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651604},
doi = {10.1145/1651587.1651604},
abstract = {The first task any individual faces after joining an online social network (OSN) is locating friends that are present on that particular site. Most OSNs offer some variation of a tool that imports email contact lists to facilitate the task of finding one's friends. However, given that OSNs attempt to reconnect individuals with past acquaintances, one might not have access to the email address for a long lost friend. Furthermore, people tend to utilize a number of aliases online, meaning that an email address cannot always be used to reliably find a friend. Thus, new members must still manually search for friends based on a number of biographical attributes, such as gender, age, hometown, etc. It is not clear, however, what attributes are useful for conducting the search. Even after the search has been performed, the person performing the search might be left with a number of candidate profiles. In this paper, we develop a system for searching and matching individuals in OSNs. We evaluate the efficacy of our person matching techniques by measuring the overlap between social networks, and comparing our results to those published by compete.com. We then look at several interesting properties of overlapping profiles in both networks.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {67–75},
numpages = {9},
keywords = {social networks, crawling, analysis},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651605,
author = {Han, Xianpei and Zhao, Jun},
title = {Web Personal Name Disambiguation Based on Reference Entity Tables Mined from the Web},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651605},
doi = {10.1145/1651587.1651605},
abstract = {Ambiguous personal names are common on the Web, which pose a challenge for many different tasks. The traditional disambiguation employs the clustering methods. However, without reference entity tables, the clustering method can only identify whether two names refer to the same entity, rather than identify which entities they refer to. Furthermore, clustering methods are difficult to achieve robust performance on different names. Some recent disambiguation methods (the link-with-entity-base methods) extract the reference entity tables from online entity bases. The link-with-entity-base methods, however, suffer from the entity base's limited coverage problem, so it can only disambiguate names in a limited coverage.In this paper, to overcome the previous methods' deficiencies, we propose a web-querying method to mine the reference entity tables from the Web automatically with the help of professional category knowledge. Then, we disambiguate personal names by linking them to the personal entities within the mined tables through categorization. The experimental results on the dataset extracted from Freebase show that our web-querying method can effectively mine personal entity with an F-measure 0.90. The disambiguation results on WePS datasets show that our method can achieve more robust and informative performance than the traditional clustering methods; and outperforms the traditional link-with-entity-base methods with a 0.29 improvement in F-measure.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {75–82},
numpages = {8},
keywords = {person resolution, web person search, named entity disambiguation, name disambiguation},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651606,
author = {Asahi, Naoto and Yamamoto, Takehiro and Nakamura, Satoshi and Tanaka, Katsumi},
title = {Finding Intermediate Entity between Two Examples on the Web},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651606},
doi = {10.1145/1651587.1651606},
abstract = {We propose a method for finding an intermediate entity between two examples on the Web. For example, a user wants to find events that occurred between the Battle of Red Cliffs and the death of Cao Cao. In this situation, the user wants to find something intermediate between two events, processes, or objects. We first describe the problem of finding an entity between two examples. We then propose a method for extracting an intermediate entity between two inputs using a Web search engine. The method focuses on the positions of words in Web pages and then extracts words that are likely to appear between the two inputs. Finally, we show the usefulness of our method based on experiments.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {83–87},
numpages = {5},
keywords = {interpolation search, knowledge extraction, intermediate entity, web search},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651607,
author = {Tsatsaronis, George and Varlamis, Iraklis and Stamou, Sofia and N\o{}rv\r{a}g, Kjetil and Vazirgiannis, Michalis},
title = {Semantic Relatedness Hits Bibliographic Data},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651607},
doi = {10.1145/1651587.1651607},
abstract = {In this paper we introduce a novel approach for the thematic organization of bibliographic records that builds upon a semantic relatedness measure we have implemented for this task. In particular, we introduce the Omiotis measure, which captures the semantic relatedness between text segments and enables the thematic organization of the bibliographic data stored in online databases. Experimental evaluation demonstrates that Omiotis can significantly improve the performance of several data mining tasks, such as publications' classification and clustering, compared to existing approaches; even when considering a limited amount of information, i.e., the paper titles.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {87–90},
numpages = {4},
keywords = {bibliographic data management, semantic relatedness},
location = {Hong Kong, China},
series = {WIDM '09}
}

@inproceedings{10.1145/1651587.1651608,
author = {Iwata, Mayu and Arase, Yuki and Hara, Takahiro and Nishio, Shojiro},
title = {Investigation of Children's Characteristics for Web Browsing},
year = {2009},
isbn = {9781605588087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1651587.1651608},
doi = {10.1145/1651587.1651608},
abstract = {Owing to the proliferation of Internet environment, young children have started accessing the Web. However, most existing pages are oriented for grown-ups. Particularly, children are not good at browsing Web pages with full of characters, such as news site. Though such general pages have variety and detailed information than pages for children, children cannot understand their information in a current presentation style. In this paper, we investigate children's characteristics on Web browsing. First, we implemented a Web browser for children, which converts general pages into a children-friendly presentation. Then, we conducted a user experiment to compare our browser with two conventional Web browsers. The result shows that dividing a Web page into contents and showing each of them with animations and changing difficult expressions into easy and friendly ones are effective to keep children's interest and help them to understand the contents.},
booktitle = {Proceedings of the Eleventh International Workshop on Web Information and Data Management},
pages = {91–94},
numpages = {4},
keywords = {bubble metaphor, web browser, children's characteristics},
location = {Hong Kong, China},
series = {WIDM '09}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr

branch_name: refs/heads/main


text:
@inproceedings{las2020,
 author = {Xie, Benjamin and Nelson, Greg L and Akkaraju, Harshitha and
Kwok, William and Ko, Amy J},
 booktitle = {Proceedings of the Seventh (2020) ACM Conference on Learning @
Scale},
 month = {8},
 publisher = {ACM},
 series = {L@S 2020},
 title = {The Effect of Informing Agency in Self-Directed Online
Learning Environments},
 year = {2020}
}

repository: bxie/bxie-academic

repo_name: bxie/bxie-academic


text:
@article{abdelhafezGradientbasedOptimalControl2019,
  title = {Gradient-Based Optimal Control of Open Quantum Systems Using Quantum Trajectories and Automatic Differentiation},
  author = {Abdelhafez, Mohamed and Schuster, David I. and Koch, Jens},
  year = {2019},
  month = may,
  volume = {99},
  pages = {052327},
  issn = {2469-9926, 2469-9934},
  doi = {10.1103/PhysRevA.99.052327},
  abstract = {We present a gradient-based optimal-control technique for open quantum systems that utilizes quantum trajectories to simulate the quantum dynamics during optimization. Using trajectories allows for optimizing open systems with less computational cost than the regular density matrix approaches in most realistic optimization problems. We introduce an improved-sampling algorithm which minimizes the number of trajectories needed per optimization iteration. Together with employing stochastic gradient descent techniques, this reduces the complexity of optimizing many realistic open quantum systems to the complexity encountered with closed systems. Our optimizer harnesses automatic differentiation to provide flexibility in optimization and to suit the different constraints and diverse parameter regimes of real-life experiments. We utilize the optimizer in a variety of applications to demonstrate how the use of quantum trajectories significantly reduces the computation complexity while achieving a multitude of simultaneous optimization targets. Demonstrated targets include high state-transfer fidelities despite dissipation, faster gate times and maximization of qubit-readout fidelity while maintaining the quantum non-demolition nature of the measurement and allowing for subsequent fast resonator reset.},
  archivePrefix = {arXiv},
  eprint = {1901.05541},
  eprinttype = {arxiv},
  journal = {Physical Review A},
  keywords = {Quantum Physics},
  number = {5}
}

@article{alexanderNotebooksDataQiskitPulse2020b,
  title = {Notebooks and {{Data}} for "{{Qiskit}}-{{Pulse}}: {{Programming Quantum Computers Through}} the {{Cloud}} with {{Pulses}}"},
  shorttitle = {Notebooks and {{Data}} for "{{Qiskit}}-{{Pulse}}},
  author = {Alexander, Thomas and Kanazawa, Naoki and Egger, Daniel J. and Capelluto, Lauren and Wood, Christopher J. and {Javadi-Abhari}, Ali and McKay, David},
  year = {2020},
  month = feb,
  publisher = {{Zenodo}},
  doi = {10.5281/zenodo.3653502},
  abstract = {Archive of Jupyter notebooks, analysis code~and cached data for "Qiskit-Pulse: Programming Quantum Computers through the Cloud with Pulses". Details on using this code and running your own experiments may be~found~in the README.},
  keywords = {OpenPulse,OpenQasm,pulse,QASM,qiskit,quantum circuit,quantum computing,quantum programming language},
  language = {eng}
}

@article{blaisCavityQuantumElectrodynamics2004c,
  title = {Cavity Quantum Electrodynamics for Superconducting Electrical Circuits: An Architecture for Quantum Computation},
  shorttitle = {Cavity Quantum Electrodynamics for Superconducting Electrical Circuits},
  author = {Blais, Alexandre and Huang, Ren-Shou and Wallraff, Andreas and Girvin, S. M. and Schoelkopf, R. J.},
  year = {2004},
  month = jun,
  volume = {69},
  pages = {062320},
  issn = {1050-2947, 1094-1622},
  doi = {10.1103/PhysRevA.69.062320},
  abstract = {We propose a realizable architecture using one-dimensional transmission line resonators to reach the strong coupling limit of cavity quantum electrodynamics in superconducting electrical circuits. The vacuum Rabi frequency for the coupling of cavity photons to quantized excitations of an adjacent electrical circuit (qubit) can easily exceed the damping rates of both the cavity and the qubit. This architecture is attractive both as a macroscopic analog of atomic physics experiments and for quantum computing and control, since it provides strong inhibition of spontaneous emission, potentially leading to greatly enhanced qubit lifetimes, allows high-fidelity quantum non-demolition measurements of the state of multiple qubits, and has a natural mechanism for entanglement of qubits separated by centimeter distances. In addition it would allow production of microwave photon states of fundamental importance for quantum communication.},
  archivePrefix = {arXiv},
  eprint = {cond-mat/0402216},
  eprinttype = {arxiv},
  journal = {Physical Review A},
  keywords = {Condensed Matter - Mesoscale and Nanoscale Physics,Condensed Matter - Superconductivity,Quantum Physics},
  number = {6}
}

@misc{CalibratingQubitsQiskit,
  title = {Calibrating {{Qubits}} with {{Qiskit Pulse}}},
  howpublished = {https://qiskit.org/textbook/ch-quantum-hardware/calibrating-qubits-openpulse.html}
}

@article{granadeQInferStatisticalInference2017c,
  title = {{{QInfer}}: {{Statistical}} Inference Software for Quantum Applications},
  shorttitle = {{{QInfer}}},
  author = {Granade, Christopher and Ferrie, Christopher and Hincks, Ian and Casagrande, Steven and Alexander, Thomas and Gross, Jonathan and Kononenko, Michal and Sanders, Yuval},
  year = {2017},
  month = apr,
  volume = {1},
  pages = {5},
  issn = {2521-327X},
  doi = {10.22331/q-2017-04-25-5},
  abstract = {Characterizing quantum systems through experimental data is critical to applications as diverse as metrology and quantum computing. Analyzing this experimental data in a robust and reproducible manner is made challenging, however, by the lack of readily-available software for performing principled statistical analysis. We improve the robustness and reproducibility of characterization by introducing an open-source library, QInfer, to address this need. Our library makes it easy to analyze data from tomography, randomized benchmarking, and Hamiltonian learning experiments either in post-processing, or online as data is acquired. QInfer also provides functionality for predicting the performance of proposed experimental protocols from simulated runs. By delivering easy-to-use characterization tools based on principled statistical analysis, QInfer helps address many outstanding challenges facing quantum technology.},
  archivePrefix = {arXiv},
  eprint = {1610.00336},
  eprinttype = {arxiv},
  journal = {Quantum},
  keywords = {Physics - Data Analysis; Statistics and Probability,Quantum Physics,Statistics - Applications}
}

@article{hincksHamiltonianLearningOnline2018,
  title = {Hamiltonian {{Learning}} with {{Online Bayesian Experiment Design}} in {{Practice}}},
  author = {Hincks, Ian and Alexander, Thomas and Kononenko, Michal and Soloway, Benjamin and Cory, David G.},
  year = {2018},
  month = jun,
  abstract = {Estimating parameters of quantum systems is usually done by performing a sequence of predetermined experiments and post-processing the resulting data. It is known that online design, where the choice of the next experiment is based on the most up-to-date knowledge about the system, can offer speedups to parameter estimation. We apply online Bayesian experiment design to a Nitrogen Vacancy (NV) in diamond to learn the values of a five-parameter model describing its Hamiltonian and decoherence process. Comparing this to standard pre-determined experiment sweeps, we find that we can achieve median posterior variances on some parameters that are between 10 and 100 times better given the same amount of data. This has applications to NV magnetometry where one of the Hamiltonian coefficients is the parameter of interest. Furthermore, the methods that we use are generic and can be adapted to any quantum device.},
  archivePrefix = {arXiv},
  eprint = {1806.02427},
  eprinttype = {arxiv},
  journal = {arXiv:1806.02427 [quant-ph]},
  keywords = {Quantum Physics},
  primaryClass = {quant-ph}
}

@article{khanejaOptimalControlCoupled2005c,
  title = {Optimal Control of Coupled Spin Dynamics: Design of {{NMR}} Pulse Sequences by Gradient Ascent Algorithms},
  shorttitle = {Optimal Control of Coupled Spin Dynamics},
  author = {Khaneja, Navin and Reiss, Timo and Kehlet, Cindie and {Schulte-Herbr{\"u}ggen}, Thomas and Glaser, Steffen J.},
  year = {2005},
  month = feb,
  volume = {172},
  pages = {296--305},
  issn = {10907807},
  doi = {10.1016/j.jmr.2004.11.004},
  abstract = {In this paper, we intro duce optimal control -relat ed gradient-based numeri cal algorithms for the design of pulse sequences in NMR spectroscopy. This methodology is used for designing pulse sequences that maximize the coherence tran sfer between coupled spins in a given spe ed time, minimize the relaxation e ects in a given coherence tr ansfer step or minimize the time required to produce a given unitar y propagator, as desir ed. T he applicati on of these gradient ascent pulse engineering (GRAPE) methods to design pulse sequences that are robust to experimentally important parameter variation s, such as chemical shift dispersion or rf variations due to imperfecti ons such as rf-inhomogeneity is also explain ed.},
  journal = {Journal of Magnetic Resonance},
  language = {en},
  number = {2}
}

@article{krantzQuantumEngineerGuide2019a,
  title = {A {{Quantum Engineer}}'s {{Guide}} to {{Superconducting Qubits}}},
  author = {Krantz, Philip and Kjaergaard, Morten and Yan, Fei and Orlando, Terry P. and Gustavsson, Simon and Oliver, William D.},
  year = {2019},
  month = apr,
  doi = {10.1063/1.5089550},
  abstract = {The aim of this review is to provide quantum engineers with an introductory
guide to the central concepts and challenges in the rapidly accelerating field
of superconducting quantum circuits. Over the past twenty years, the field has
matured from a predominantly basic research endeavor to one that increasingly
explores the engineering of larger-scale superconducting quantum systems. Here,
we review several foundational elements -- qubit design, noise properties,
qubit control, and readout techniques -- developed during this period, bridging
fundamental concepts in circuit quantum electrodynamics (cQED) and
contemporary, state-of-the-art applications in gate-model quantum computation.},
  language = {en}
}

@misc{OptimalControlCoupleda,
  title = {Optimal Control of Coupled Spin Dynamics: Design of {{NMR}} Pulse Sequences by Gradient Ascent Algorithms. - {{PubMed}} - {{NCBI}}},
  howpublished = {https://www.ncbi.nlm.nih.gov/pubmed/15649756}
}

@misc{QuantumOptimalControl,
  title = {Quantum {{Optimal Control}} \textemdash{} {{QuTiP}} 4.0 {{Documentation}}},
  howpublished = {http://qutip.org/docs/latest/guide/guide-control.html}
}

@misc{QuantumUtilsMathematica,
  title = {{{QuantumUtils}/quantum-utils-mathematica}},
  howpublished = {https://github.com/QuantumUtils/quantum-utils-mathematica}
}

@misc{SchusterLabQuantumoptimalcontrol2020,
  title = {{{SchusterLab}}/Quantum-Optimal-Control},
  year = {2020},
  month = feb,
  abstract = {Contribute to SchusterLab/quantum-optimal-control development by creating an account on GitHub.},
  howpublished = {SchusterLab}
}

@article{sheldonProcedureSystematicallyTuning2016b,
  title = {Procedure for Systematically Tuning up Crosstalk in the Cross Resonance Gate},
  author = {Sheldon, Sarah and Magesan, Easwar and Chow, Jerry M. and Gambetta, Jay M.},
  year = {2016},
  month = jun,
  volume = {93},
  pages = {060302},
  issn = {2469-9926, 2469-9934},
  doi = {10.1103/PhysRevA.93.060302},
  abstract = {We present improvements in both theoretical understanding and experimental implementation of the cross resonance (CR) gate that have led to shorter two-qubit gate times and interleaved randomized benchmarking fidelities exceeding 99\%. The CR gate is an all-microwave two-qubit gate offers that does not require tunability and is therefore well suited to quantum computing architectures based on 2D superconducting qubits. The performance of the gate has previously been hindered by long gate times and fidelities averaging 94-96\%. We have developed a calibration procedure that accurately measures the full CR Hamiltonian. The resulting measurements agree with theoretical analysis of the gate and also elucidate the error terms that have previously limited the gate fidelity. The increase in fidelity that we have achieved was accomplished by introducing a second microwave drive tone on the target qubit to cancel unwanted components of the CR Hamiltonian.},
  archivePrefix = {arXiv},
  eprint = {1603.04821},
  eprinttype = {arxiv},
  journal = {Physical Review A},
  keywords = {Quantum Physics},
  number = {6}
}

@article{shiOptimizedCompilationAggregated2019b,
  title = {Optimized {{Compilation}} of {{Aggregated Instructions}} for {{Realistic Quantum Computers}}},
  author = {Shi, Yunong and Leung, Nelson and Gokhale, Pranav and Rossi, Zane and Schuster, David I. and Hoffman, Henry and Chong, Fred T.},
  year = {2019},
  month = apr,
  pages = {1031--1044},
  doi = {10.1145/3297858.3304018},
  abstract = {Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate this quantum assembly to electric signals (called control pulses) that implement the specified computation on specific physical devices. However, there is a mismatch between the operations defined by the 1- and 2-qubit logical ISA and their underlying physical implementation, so the current practice of directly translating logical instructions into control pulses results in inefficient, high-latency programs. To address this inefficiency, we propose a universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time. Our methodology then optimizes these aggregates by (1) finding commutative intermediate operations that result in more efficient schedules and (2) creating custom control pulses optimized for the aggregate (instead of individual 1- and 2-qubit operations). Compared to the standard gate-based compilation, the proposed approach realizes a deeper vertical integration of high-level quantum software and low-level, physical quantum hardware. We evaluate our approach on important near-term quantum applications on simulations of superconducting quantum architectures. Our proposed approach provides a mean speedup of \$5\textbackslash{}times\$, with a maximum of \$10\textbackslash{}times\$. Because latency directly affects the feasibility of quantum computation, our results not only improve performance but also have the potential to enable quantum computation sooner than otherwise possible.},
  archivePrefix = {arXiv},
  eprint = {1902.01474},
  eprinttype = {arxiv},
  journal = {Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems},
  keywords = {Computer Science - Computation and Language,Quantum Physics}
}

repository: brosand/qiskit-terra

repo_name: brosand/qiskit-terra


text:
@article{lee_relationship_2019,
 abstract = {© 2019 The Authors. Physiological Reports published by Wiley Periodicals, Inc. on behalf of The Physiological Society and the American Physiological Society. Maternal obesity during pregnancy has a detrimental impact on offspring renal development and function. This is pertinent to Indigenous Australians as they are twice as likely as non-Indigenous Australians to develop chronic kidney disease (CKD). The aim of this study was to examine whether there was an association between maternal adiposity and fetal kidney growth in late gestation (\textgreater28 weeks) and kidney function in infants, \textless2.5 years of age, from the Gomeroi gaaynggal cohort. Pre-pregnancy body mass index (BMI) was recorded at the first prenatal visit and maternal adiposity indicators (percent body fat and visceral fat area) measured at \textgreater28 weeks gestation by bioelectrical impedance analysis. Fetal kidney structure was assessed by ultrasound. Renal function indicators (urinary albumin:creatinine and protein:creatinine) were measured in infants from a spot urine collection from nappies. Multiple linear regression and multi-level mixed effects linear regression models with clustering were used to account for repeated measures of urine. 147 mother-child pairs were examined. Estimated fetal weight (EFW), but not fetal kidney size, was positively associated with maternal adiposity and pre-pregnancy BMI. When adjusted for smoking, combined kidney volume relative to EFW was negatively associated with maternal percentage body fat. Infant kidney function was not influenced by maternal adiposity and pre-pregnancy BMI (n = 84 observations). Current findings show that Indigenous babies born to obese mothers have reduced kidney size relative to EFW. We suggest that these babies are experiencing a degree of glomerular hyperfiltration in utero, and therefore are at risk of developing CKD in later life, especially if their propensity for obesity is maintained. Although no impact on renal function was observed at \textless2.5 years of age, long-term follow-up of offspring is required to evaluate potential later life impacts.},
 author = {Lee, Y.Q. and Lumbers, E.R. and Oldmeadow, C. and Collins, C.E. and Johnson, V. and Keogh, L. and Sutherland, K. and Gordon, A. and Smith, R. and Rae, K.M. and Pringle, K.G.},
 doi = {10.14814/phy2.14227},
 issn = {2051-817X},
 journal = {Physiological reports},
 month = {September},
 note = {Publisher: John Wiley & Sons Ltd.},
 number = {17},
 pages = {1--14},
 title = {The relationship between maternal adiposity during pregnancy and fetal kidney development and kidney function in infants: the Gomeroi gaaynggal study},
 volume = {7},
 year = {2019}
}

repository: ChrisOldmeadow/academic-kickstart

repo_name: ChrisOldmeadow/academic-kickstart


text:
@INPROCEEDINGS{puschmann:ISCIT:2012,
  author = {Puschmann, Andre and Khan, S Nawaz and Haider Mahdi, Ali and Kalil,
	Mohamed A. and Mitschele-Thiel, Andreas},
  title = {{An Architecture for Cognitive Radio Ad-Hoc Network Nodes}},
  booktitle = {12th International Symposium on Communications and Information Technologies
	(ISCIT)},
  year = {2012},
  address = {Gold Coast, Australia},
  month = {October},
  institution = {TU Ilmenau}
}

repository: andrepuschmann/academic-kickstart

repo_name: andrepuschmann/academic-kickstart


text:
include grub-mender-grubenv.inc

# Tag: 1.2.0
SRCREV = "db9c51ee77a975ac3bd81de8a18b1c8a9c92056d"

LICENSE = "Apache-2.0"
LIC_FILES_CHKSUM = "file://LICENSE;md5=a63d325b69180ec25a59e045c06ec468"

repository: lluiscampos/meta-mender

repo_name: lluiscampos/meta-mender

gha_language: Python


text:
@techreport{pagerank,
          number = {1999-66},
           month = {November},
          author = {Lawrence Page and Sergey Brin and Rajeev Motwani and Terry Winograd},
            note = {Previous number = SIDL-WP-1999-0120},
           title = {The PageRank Citation Ranking: Bringing Order to the Web.},
            type = {Technical Report},
       publisher = {Stanford InfoLab},
            year = {1999},
     institution = {Stanford InfoLab},
             url = {http://ilpubs.stanford.edu:8090/422/},
        abstract = {The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages. This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them. We compare PageRank to an idealized random Web surfer. We show how to efficiently compute PageRank for large numbers of pages. And, we show how to apply PageRank to search and to user navigation.}
}

@inproceedings{wtf,
 author = {Gupta, Pankaj and Goel, Ashish and Lin, Jimmy and Sharma, Aneesh and Wang, Dong and Zadeh, Reza},
 title = {WTF: The Who to Follow Service at Twitter},
 booktitle = {Proceedings of the 22Nd International Conference on World Wide Web},
 series = {WWW '13},
 year = {2013},
 isbn = {978-1-4503-2035-1},
 location = {Rio de Janeiro, Brazil},
 pages = {505--514},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/2488388.2488433},
 doi = {10.1145/2488388.2488433},
 acmid = {2488433},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {graph processing, hadoop, link prediction},
}

@article{salsa,
 author = {Lempel, R. and Moran, S.},
 title = {SALSA: The Stochastic Approach for Link-structure Analysis},
 journal = {ACM Trans. Inf. Syst.},
 issue_date = {April 2001},
 volume = {19},
 number = {2},
 month = apr,
 year = {2001},
 issn = {1046-8188},
 pages = {131--160},
 numpages = {30},
 url = {http://doi.acm.org/10.1145/382979.383041},
 doi = {10.1145/382979.383041},
 acmid = {383041},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Link-structure analysis, SALSA, TKC effect, hubs and authorities, random walks},
}

repository: cPolaris/school-is-fun

repo_name: cPolaris/school-is-fun

gha_language: Java


text:
require bug-app.inc

DESCRIPTION = "A simple app that lists consumable OSGi services as discovered by jSLP.  Requires several bundles to work including jSLP core, jSLP discovery, and the R-OSGi bundles."
HOMEPAGE = "http://buglabs.net/applications/Remote+Service+Logger"

DEPENDS += "com.buglabs.osgi ch.ethz.iks.slp service-tracker com.buglabs.common "

PV = "1"

SRC_LINK = "http://buglabs.net/program_version/download/444"

APIVERSION = ""

BROKEN = "1"

repository: overo/overo-oe-natty

repo_name: overo/overo-oe-natty

branch_name: HEAD


text:
require genext2fs_${PV}.bb
inherit native

do_stage () {
	install -m 0755 genext2fs ${STAGING_BINDIR}/
}

do_install () {
	:
}

SRC_URI[md5sum] = "b7b6361bcce2cedff1ae437fadafe53b"
SRC_URI[sha256sum] = "404dbbfa7a86a6c3de8225c8da254d026b17fd288e05cec4df2cc7e1f4feecfc"


text:
SECTION = "x11/utils"
DESCRIPTION = "gtk2 outliner written by Matthew Allum"
LICENSE = "GPLv2"
DEPENDS = "gtk+ libxml2"
PR = "r1"

# original src_uri, http://handhelds.org/~mallum/downloadables/figment/figment-${PV}.tar.gz, is now unfetchable
SRC_URI = "http://ftp.sh.cvut.cz/MIRRORS/rock/ROCK-2.0/gnome2/figment/figment-${PV}.tar.bz2 \
	file://dotdesktop-name-comment.patch"
S = "${WORKDIR}/figment-${PV}"

inherit autotools

SRC_URI[md5sum] = "4b317749c7a75c4f283c6ef5aaad4146"
SRC_URI[sha256sum] = "ebafecd9a34dbcb83bcbf69db3e9655e92af2eb0ede33d9f92d13ed5f2e7d8b2"


text:
@article{RN969,
 author = {Cheng, A. C. and Murdoch, D. R. and Harrell, L. J. and Reller, L. B.},
 doi = {10.1080/00365540510043257},
 journal = {Scandinavian Journal of Infectious Diseases},
 number = {9},
 pages = {642-646},
 title = {Clinical profile and strain relatedness of recurrent enterococcal bacteremia},
 type = {Journal Article},
 url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-25444453489&doi=10.1080%2f00365540510043257&partnerID=40&md5=597e80aa9d446e16c6b931e76eb57b71},
 volume = {37},
 year = {2005}
}


text:
@article{Aasi:LongLived2013,
 author = {J. Aasi et al.},
 collaboration = {LIGO Scientific Collaboration and Virgo Collaboration},
 doi = {10.1103/PhysRevD.88.122004},
 issue = {12},
 journal = {Phys. Rev. D},
 month = {Dec},
 numpages = {13},
 pages = {122004},
 publisher = {American Physical Society},
 title = {Search for long-lived gravitational-wave transients coincident with long gamma-ray bursts},
 url = {http://link.aps.org/doi/10.1103/PhysRevD.88.122004},
 volume = {88},
 year = {2013}
}

repository: mcoughlin/personal-website

repo_name: mcoughlin/personal-website

gha_language: TeX


text:
@misc{1,
      title={Sentimental LIAR: Extended Corpus and Deep Learning Models for Fake Claim Classification},
      author={Bibek Upadhayay and Vahid Behzadan},
      year={2020},
      eprint={2009.01047},
      archivePrefix={arXiv},
      primaryClass={cs.CL}

@article{2,
   title={What drives unverified information sharing and cyberchondria during the COVID-19 pandemic?},
   volume={29},
   ISSN={1476-9344},
   url={http://dx.doi.org/10.1080/0960085X.2020.1770632},
   DOI={10.1080/0960085x.2020.1770632},
   number={3},
   journal={European Journal of Information Systems},
   publisher={Informa UK Limited},
   author={Laato, Samuli and Islam, A. K. M. Najmul and Islam, Muhammad Nazrul and Whelan, Eoin},
   year={2020},
   month={May},
   pages={288–305}
}

@misc{3,
      title={A Survey on Natural Language Processing for Fake News Detection},
      author={Ray Oshikawa and Jing Qian and William Yang Wang},
      year={2020},
      eprint={1811.00770},
      archivePrefix={arXiv},
      primaryClass={cs.CL}
}

@misc{4,
      title={"Liar, Liar Pants on Fire": A New Benchmark Dataset for Fake News Detection},
      author={William Yang Wang},
      year={2017},
      eprint={1705.00648},
      archivePrefix={arXiv},
      primaryClass={cs.CL}
}

@Inbook{5,
author="K{\"o}hnken, G{\"u}nter",
editor="Lempp, Reinhart
and Sch{\"u}tze, Gerd
and K{\"o}hnken, G{\"u}nter",
title="Glaubw{\"u}rdigkeit",
bookTitle="Forensische Psychiatrie und Psychologie des Kindes- und Jugendalters",
year="1999",
publisher="Steinkopff",
address="Heidelberg",
pages="318--341",
abstract="Zeugenaussagen sind nur selten ein getreues Abbild dessen, wor{\"u}ber berichtet wird. Diskrepanzen zwischen tats{\"a}chlichen Ereignissen einerseits und deren Wahrnehmungen sowie den Berichten hier{\"u}ber andererseits k{\"o}nnen zwei m{\"o}gliche Ursachen haben:■ Zum einen ist die Wahrnehmung sowie der Bericht {\"u}ber das Wahrge-nommene das Ergebnis kognitiver Verarbeitungsprozesse. In jeder Phase der Informationsverarbeitung k{\"o}nnen, wie zahlreiche Untersuchungen gezeigt haben, Fehler auftreten. Details werden m{\"o}glicherweise nicht wahrgenommen, sie werden falsch enkodiert oder nicht im Ged{\"a}chtnis gespeichert. Weiterhin k{\"o}nnen nachtr{\"a}gliche Informationen den Ged{\"a}chtnisinhalt ver{\"a}ndern oder bestimmte Frageformulierungen unzutreffende Antworten provozieren (siehe Kap. 8.4). Wesentlich ist hierbei, da{\ss} es sich um unbeabsichtigte Irrt{\"u}mer handelt. Aussagefehler, die durch unbeabsichtigte Irrt{\"u}mer verursacht sind, betreffen die Genauigkeit einer Zeugenaussage (in Anlehnung an den in der englischsprachigen Literatur gebr{\"a}uchlichen Begriff „accuracy``).■ Daneben kann eine Aussage aber auch absichtlich vom Zeugen verf{\"a}lscht worden sein, d.h. eine andere Sachverhaltsdarstellung geben, als sie vom Zeugen subjektiv f{\"u}r zutreffend gehalten wird. In diesem Fall ist die Glaubw{\"u}rdigkeit der Aussage betroffen.",
isbn="978-3-662-21913-3",
doi="10.1007/978-3-662-21913-3_29",
url="https://doi.org/10.1007/978-3-662-21913-3_29"
}

@misc{6,
      title={Convolutional Neural Networks for Sentence Classification},
      author={Yoon Kim},
      year={2014},
      eprint={1408.5882},
      archivePrefix={arXiv},
      primaryClass={cs.CL}
}

@inproceedings{7,
    title = "Fake News Detection Through Multi-Perspective Speaker Profiles",
    author = "Long, Yunfei  and
      Lu, Qin  and
      Xiang, Rong  and
      Li, Minglei  and
      Huang, Chu-Ren",
    booktitle = "Proceedings of the Eighth International Joint Conference on Natural Language Processing (Volume 2: Short Papers)",
    month = nov,
    year = "2017",
    address = "Taipei, Taiwan",
    publisher = "Asian Federation of Natural Language Processing",
    url = "https://www.aclweb.org/anthology/I17-2043",
    pages = "252--256",
    abstract = "Automatic fake news detection is an important, yet very challenging topic. Traditional methods using lexical features have only very limited success. This paper proposes a novel method to incorporate speaker profiles into an attention based LSTM model for fake news detection. Speaker profiles contribute to the model in two ways. One is to include them in the attention model. The other includes them as additional input data. By adding speaker profiles such as party affiliation, speaker title, location and credit history, our model outperforms the state-of-the-art method by 14.5{\%} in accuracy using a benchmark fake news detection dataset. This proves that speaker profiles provide valuable information to validate the credibility of news articles.",
}

path: /Proyecto Final/Presentación/ref.bib


text:
set(REALSENSE_ROOT "/usr/local" CACHE PATH "Root directory of libREALSENSE")

find_path(REALSENSE_INCLUDE_DIR NAMES librealsense librealsense2 HINTS "${REALSENSE_ROOT}/include")
find_library(REALSENSE_LIBRARY NAMES realsense realsense2 HINTS "${REALSENSE_ROOT}/bin/x64" "${REALSENSE_ROOT}/lib")

find_package_handle_standard_args(REALSENSE DEFAULT_MSG REALSENSE_LIBRARY REALSENSE_INCLUDE_DIR)

mark_as_advanced(REALSENSE_LIBRARY REALSENSE_INCLUDE_DIR)

extension: cmake