text:
@book{utility,
  title={Utility of the Future: An MIT Energy Iniative Response to an Industry in Transition},
  author={P{\'e}rez-Arriaga, I. and Knittle, C. and MIT Energy Initiative},
  year={2016},
  publisher={MIT Energy Initiative}
}

@article{Baker2012OptimalIO,
  title={Optimal integration of intermittent energy sources using distributed multi-step optimization},
  author={Kristi Baker and Gordon L. Hug and Xin Li},
  journal={2012 IEEE Power and Energy Society General Meeting},
  year={2012},
  pages={1-8}
}

@ARTICLE{zonal_int,
author={I. Aravena and A. Papavasiliou},
journal={IEEE Transactions on Power Systems},
title={Renewable Energy Integration in Zonal Markets},
year={2017},
volume={32},
number={2},
pages={1334-1349},
keywords={power markets;Central Western European system;European energy market;deterministic unit commitment;power systems operation;renewable energy integration;stochastic unit commitment;transmission constraints representation;zonal market design;zonal markets;zonal network management;Computational modeling;Couplings;Energy resolution;Europe;Pricing;Real-time systems;Renewable energy sources;European electricity markets;market coupling;market efficiency losses;renewable energy policy;zonal energy markets},
doi={10.1109/TPWRS.2016.2585222},
ISSN={0885-8950},
month={March}}

@ARTICLE{paolone,
author={A. Borghetti and M. Bosetti and S. Grillo and S. Massucco and C. A. Nucci and M. Paolone and F. Silvestro},
journal={IEEE Systems Journal},
title={Short-Term Scheduling and Control of Active Distribution Systems With High Penetration of Renewable Resources},
year={2010},
volume={4},
number={3},
pages={313-322},
keywords={distribution networks;linear programming;power generation scheduling;power system management;transformers;active distribution systems;dispatchable generators;distribution management systems;electric distribution systems;embedded generators;medium voltage 120 buses network;mixed integer linear programming algorithm;multiobjective optimization problem;on load tap changers;photovoltaic field;reactive power compensators;renewable resources;short term scheduling;three phase power flow calculation;transformers;wind plants;Constraint optimization;Control systems;Distributed control;Distributed power generation;Energy management;Innovation management;On load tap changers;Power system management;Resource management;Transformers;Active distribution networks;distributed generation;energy dispatch optimization;operation of distribution networks;smartgrids;sustainable energy generation},
doi={10.1109/JSYST.2010.2059171},
ISSN={1932-8184},
month={Sept}}

@article{LorcaSun,
author = {Lorca, Alvaro and Sun, Xu},
year = {2017},
month = {08},
pages = {1-1},
title = {The Adaptive Robust Multi-Period Alternating Current Optimal Power Flow Problem},
volume = {PP},
booktitle = {IEEE Transactions on Power Systems}
}

@article{adaptative,
author={D. Bertsimas and E. Litvinov and X. A. Sun and J. Zhao and T. Zheng},
journal={IEEE Transactions on Power Systems},
title={Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem},
year={2013},
volume={28},
number={1},
pages={52-63},
keywords={approximation theory;distributed power generation;power system security;statistical distributions;stochastic programming;Benders decomposition type algorithm;ISO New England;adaptive robust optimization;electric power system operations;hard-to-obtain probability distribution;nodal net injection uncertainty;outer approximation technique;price responsive demand;real-world large scale power system;security constrained unit commitment problem;stochastic programming approach;two-stage adaptive robust unit commitment model;variable generation resources;wind power;Adaptation models;Approximation algorithms;Computational modeling;Optimization;Robustness;Security;Uncertainty;Bilevel mixed-integer optimization;power system control and reliability;robust and adaptive optimization;security constrained unit commitment},
doi={10.1109/TPWRS.2012.2205021},
ISSN={0885-8950},
month={Feb}}

@article{Oren,
author = {Anthony Papavasiliou and Shmuel S. Oren},
title = {Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network},
journal = {Operations Research},
volume = {61},
number = {3},
pages = {578-592},
year = {2013},
doi = {10.1287/opre.2013.1174},

URL = {
        https://doi.org/10.1287/opre.2013.1174

},
eprint = {
        https://doi.org/10.1287/opre.2013.1174

}
,
}

@ARTICLE{Farivar_Relax1,
author={M. Farivar and S. H. Low},
journal={IEEE Transactions on Power Systems},
title={Branch Flow Model: Relaxations and Convexification 2014;Part I},
year={2013},
volume={28},
number={3},
pages={2554-2564},
keywords={network topology;phase shifters;power system management;power system simulation;branch flow model;conic program;convexification;mesh networks;network topology;optimal power flow;phase shifters;radial networks;Convex relaxation;load flow control;optimal power flow;phase control;power system management},
doi={10.1109/TPWRS.2013.2255317},
ISSN={0885-8950},
month={Aug}}

@ARTICLE{Farivar_Relax2,
author={M. Farivar and S. H. Low},
journal={IEEE Transactions on Power Systems},
title={Branch Flow Model: Relaxations and Convexification 2014;Part II},
year={2013},
volume={28},
number={3},
pages={2565-2572},
keywords={convex programming;load flow;power system management;OPF;branch flow model;conic program;current angles;mesh network convexification;mesh optimization;network topology;optimal power flow;power flow;radial networks;relaxation steps;voltage angles;Convex relaxation;load flow control;optimal power flow;phase control;power system management},
doi={10.1109/TPWRS.2013.2255318},
ISSN={0885-8950},
month={Aug}}

@ARTICLE{Nali,
author={W. Wei and J. Wang and N. Li and S. Mei},
journal={IEEE Transactions on Smart Grid},
title={Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach},
year={2017},
volume={8},
number={6},
pages={2974-2987},
keywords={Pareto optimisation;concave programming;convex programming;load flow;network theory (graphs);ε-constraint method;Pareto front;biobjective OPF problem;convex functions;convex relaxation;convexified penalization problems;linear functions;maximum loadability problem;meshed networks;nonconvex branch power flow equation;nonconvex constraint;nonparametric scalarization model;normal boundary intersection method;optimal power flow problems;power flow constraints;power flow insolvability;radial networks;second-order cone inequality;second-order cone programming relaxation model;semidefinite programming relaxation method;sequential convex optimization approach;Computational modeling;Convex functions;Linear programming;Optimization;Programming;Reactive power;Robustness;Bi-objective optimization;convex optimization;difference-of-convex programming;maximum loadability;optimal power flow;radial network},
doi={10.1109/TSG.2017.2684183},
ISSN={1949-3053},
month={Nov}}

@ARTICLE{BM1,
author={B. Martin and E. De Jaeger and F. Glineur},
journal={CIRED - Open Access Proceedings Journal},
title={Comparison of convex formulations for the joint planning of microgrids},
year={2017},
volume={2017},
number={1},
pages={2174-2178},
keywords={convex programming;distributed power generation;integer programming;power distribution planning;power generation planning;convex programming;distribution planning;generation planning;microgrid joint planning;mixed integer programme;nonlinear integer programme},
doi={10.1049/oap-cired.2017.0841},
ISSN={},
month={}}

@INPROCEEDINGS{BM2,
author={B. Martin and E. De Jaeger and F. Glineur},
booktitle={2017 IEEE Manchester PowerTech},
title={A robust convex optimization framework for autonomous network planning under load uncertainty},
year={2017},
volume={},
number={},
pages={1-6},
keywords={concave programming;distributed power generation;integer programming;investment;power distribution economics;power generation economics;power generation planning;RES-based generation;SOC relaxation;autonomous microgrid planning;autonomous network planning;load consumption;load uncertainty;mixed-integer nonconvex decision problem;robust convex optimization;second-order cone;Generators;Investment;Load modeling;Microgrids;Planning;Robustness;Uncertainty;Convex optimization;Expansion planning;Microgrid;Robust optimization},
doi={10.1109/PTC.2017.7981053},
ISSN={},
month={June}}

@article{RLSurvey,
title = "Reinforcement Learning for Electric Power System Decision and Control: Past Considerations and Perspectives",
journal = "IFAC-PapersOnLine",
volume = "50",
number = "1",
pages = "6918 - 6927",
year = "2017",
note = "20th IFAC World Congress",
issn = "2405-8963",
doi = "https://doi.org/10.1016/j.ifacol.2017.08.1217",
url = "http://www.sciencedirect.com/science/article/pii/S2405896317317238",
author = "Mevludin Glavic and Raphaël Fonteneau and Damien Ernst",
keywords = "Electric power system, reinforcement learning, control, decision"
}

@article{ZARRABIAN2016179,
title = "Reinforcement learning approach for congestion management and cascading failure prevention with experimental application",
journal = "Electric Power Systems Research",
volume = "141",
pages = "179 - 190",
year = "2016",
issn = "0378-7796",
doi = "https://doi.org/10.1016/j.epsr.2016.06.041",
url = "http://www.sciencedirect.com/science/article/pii/S0378779616302504",
author = "Sina Zarrabian and Rabie Belkacemi and Adeniyi A. Babalola",
keywords = "Blackout, Cascading failure, Q-learning, Real-time, Reinforcement learning, Smart grids"
}

@ARTICLE{fuzzy,
author={S. S. Khorramabadi and A. Bakhshai},
journal={IEEE Journal of Emerging and Selected Topics in Power Electronics},
title={Intelligent Control of Grid-Connected Microgrids: An Adaptive Critic-Based Approach},
year={2015},
volume={3},
number={2},
pages={493-504},
keywords={adaptive control;backpropagation;distributed power generation;dynamic programming;feedback;fuzzy control;learning (artificial intelligence);neurocontrollers;power control;power generation control;PI control;critic-based adaptive control system;error backpropagation;fuzzy critic agent;grid-connected microgrid system;grid-connected operation mode;intelligent power control approach;neuro-dynamic programming;neuro-fuzzy controller;output layer weight online tuning;power oscillations;reinforcement learning algorithm;reinforcement signal evaluation;system feedback;transient response time;Adaptive systems;Control systems;Fuzzy systems;Microgrids;Neural networks;Power electronics;Pragmatics;Critic-based learning;microgrids;neuro-fuzzy control;synchronous reference frame;voltage sourced converters (VSCs)},
doi={10.1109/JESTPE.2014.2331188},
ISSN={2168-6777},
month={June}}

@ARTICLE{volt_control,
author={Y. Xu and W. Zhang and W. Liu and F. Ferrese},
journal={IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
title={Multiagent-Based Reinforcement Learning for Optimal Reactive Power Dispatch},
year={2012},
volume={42},
number={6},
pages={1742-1751},
keywords={distributed processing;learning (artificial intelligence);load dispatching;multi-agent systems;power engineering computing;reactive power;active power loss;consensus-based global information discovery algorithm;distributed Q-learning algorithm;distributed multiagent-based reinforcement learning method;global rewards;learning process;operational constraint;optimal reactive power dispatch;power system;Algorithm design and analysis;Capacitors;Learning systems;Optimization;Reactive power;Average consensus;Q-learning;distributed optimization;multiagent system;reactive power dispatch},
doi={10.1109/TSMCC.2012.2218596},
ISSN={1094-6977},
month={Nov}}

@Article{Battery,
AUTHOR = {Mbuwir, Brida V. and Ruelens, Frederik and Spiessens, Fred and Deconinck, Geert},
TITLE = {Battery Energy Management in a Microgrid Using Batch Reinforcement Learning},
JOURNAL = {Energies},
VOLUME = {10},
YEAR = {2017},
NUMBER = {11},
URL = {http://www.mdpi.com/1996-1073/10/11/1846},
ISSN = {1996-1073},
ABSTRACT = {Motivated by recent developments in batch Reinforcement Learning (RL), this paper contributes to the application of batch RL in energy management in microgrids. We tackle the challenge of finding a closed-loop control policy to optimally schedule the operation of a storage device, in order to maximize self-consumption of local photovoltaic production in a microgrid. In this work, the fitted Q-iteration algorithm, a standard batch RL technique, is used by an RL agent to construct a control policy. The proposed method is data-driven and uses a state-action value function to find an optimal scheduling plan for a battery. The battery’s charge and discharge efficiencies, and the nonlinearity in the microgrid due to the inverter’s efficiency are taken into account. The proposed approach has been tested by simulation in a residential setting using data from Belgian residential consumers. The developed framework is benchmarked with a model-based technique, and the simulation results show a performance gap of 19%. The simulation results provide insight for developing optimal policies in more realistically-scaled and interconnected microgrids and for including uncertainties in generation and consumption for which white-box models become inaccurate and/or infeasible.},
DOI = {10.3390/en10111846}
}

@article{Gemine,
  author    = {Quentin Gemine and
               Damien Ernst and
               Bertrand Corn{\'{e}}lusse},
  title     = {Active network management for electrical distribution systems: problem
               formulation and benchmark},
  journal   = {CoRR},
  volume    = {abs/1405.2806},
  year      = {2014},
  url       = {http://arxiv.org/abs/1405.2806},
  archivePrefix = {arXiv},
  eprint    = {1405.2806},
  timestamp = {Wed, 07 Jun 2017 14:41:58 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GemineEC14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{evcity,
author = {Delnooz, A and Mol, Carlo},
year = {2012},
month = {11},
pages = {},
title = {State-of-the-art in business models for charging services: the EVCITY approach}
}

@article{Niels,
author = {Leemput, Niels},
year = {2015},
title = {Grid-supportive Charging Infrastructure for Plug-in Electric Vehicles},
journal = {PhD Thesis},
publisher={KULeuven}
}

@mastersthesis{Quentin,
  author       = {Quentin Lété},
  title        = {Optimal planning of robust DSO grid},
  school       = {Ecole polytechnique de Louvain, Université catholique de Louvain},
  year         = {2018 (ongoing)},
  note         = {Prom. : Papavasiliou, Anthony ; de Maere d'Aertrycke, Gauthier.}
}

@article{DunningHuchetteLubin2017,
author = {Iain Dunning and Joey Huchette and Miles Lubin},
title = {JuMP: A Modeling Language for Mathematical Optimization},
journal = {SIAM Review},
volume = {59},
number = {2},
pages = {295-320},
year = {2017},
doi = {10.1137/15M1020575},
}

repository: qlete/ANManagement

repo_name: qlete/ANManagement


text:
@InProceedings{chen16e,
  title = {Communication Efficient Distributed Agnostic Boosting},
  author = {Chen, Shang-Tse and Balcan, Maria-Florina and Chau, Duen Horng},
  pages = {1299-1307},
  abstract = {We consider the problem of learning from distributed data in the agnostic setting, i.e., in the presence of arbitrary forms of noise. Our main contribution is a general distributed boosting-based procedure for learning an arbitrary concept space, that is simultaneously noise tolerant, communication efficient, and computationally efficient. This improves significantly over prior works that were either communication efficient only in noise-free scenarios or computationally prohibitive. Empirical results on large synthetic and real-world datasets demonstrate the effectiveness and scalability of the proposed approach.},
}

license: MIT

repository: mreid/papersite

license_type: permissive

repo_name: mreid/papersite

branch_name: refs/heads/master

gha_license_id: MIT

gha_language: TeX

extension: bib


text:
@techreport{johannesNoEvidenceThat2019,
 abstract = {These days, young people report to be in a state of permanent alertness due to their smartphones. This state has been defined as smartphone vigilance, an awareness that one can always get connected to others in combination with a permanent readiness to respond to incoming smartphone notifications. We argue that receiving a notification makes users vigilant and activates goals (e.g., checking the message) that interfere with other goals needed to perform a task. We thus hypothesized that smartphone vigilance impairs maintenance of current task-goals in working memory, resulting in increased goal-neglect. To test this hypothesis, we conducted a preregistered experiment that examined the effect of smartphone vigilance (incoming notifications) on goal-neglect in a modified Stroop task. We found evidence that participants perceived notifications as distracting, but vigilance did not lead to increased goal-neglect. To the contrary, there was tentative evidence that vigilant participants performed better at the task.},
 author = {Johannes, Niklas and Veling, Harm and Buijzen, Moniek},
 copyright = {All rights reserved},
 doi = {10.31234/osf.io/5me97},
 file = {Johannes et al. - 2019 - No Evidence that Smartphone Notifications Lead to .pdf:C\:\\Users\∋kla\\Zotero\\storage\\FT5KFEUD\\Johannes et al. - 2019 - No Evidence that Smartphone Notifications Lead to .pdf:application/pdf},
 institution = {PsyArXiv},
 month = {September},
 title = {No evidence that smartphone notifications lead to goal-neglect},
 type = {preprint},
 url = {https://osf.io/5me97},
 urldate = {2019-09-09},
 year = {2019}
}

repository: niklasjohannes/website

repo_name: niklasjohannes/website

branch_name: refs/heads/main


text:
IF (NOT MPI_FOUND)

FIND_PATH(MPI_INCLUDE_DIR mpi.h
  /usr/lib/openmpi/include
  /usr/local/lib/openmpi/include
  r:/usr/lib/openmpi/include
  c:/usr/lib/openmpi/include
  ${DISTR_PREFIX}/lib/openmpi/include
  DOC "Directory containing openmpi headers"
)

SET(LIBSEARCHPATHS
	/usr/lib/openmpi/lib
	/usr/lib/openmpi/lib/openmpi
	/usr/local/lib/openmpi/lib
	R:/usr/lib/openmpi/lib
	${DISTR_PREFIX}/lib/openmpi/lib
)

FIND_LIBRARY(MPI_LIBRARY
	NAMES
		mpi
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_CXX_LIBRARY
	NAMES
		mpi_cxx
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_F77_LIBRARY
	NAMES
		mpi_f77
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_F90_LIBRARY
	NAMES
		mpi_f90
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_OPEN_LIBRARY
	NAMES
		open-pal
		open-rte
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_MCA_LIBRARY
	NAMES
		mca_common_sm
	PATHS 	${LIBSEARCHPATHS}
)

FIND_LIBRARY(MPI_OMPITV_LIBRARY
	NAMES
		ompitv
	PATHS 	${LIBSEARCHPATHS}
)

set(MPI_LIBRARY_D ${MPI_LIBRARY})
set(MPI_CXX_LIBRARY_D ${MPI_CXX_LIBRARY})
set(MPI_F77_LIBRARY_D ${MPI_F77_LIBRARY})
set(MPI_F90_LIBRARY_D ${MPI_F90_LIBRARY})
set(MPI_OPEN_LIBRARY_D ${MPI_OPEN_LIBRARY})
set(MPI_MCA_LIBRARY_D ${MPI_MCA_LIBRARY})
set(MPI_OMPITV_LIBRARY_D ${MPI_OMPITV_LIBRARY})

IF (MPI_INCLUDE_DIR AND MPI_LIBRARY_D AND MPI_LIBRARY AND MPI_CXX_LIBRARY_D AND MPI_CXX_LIBRARY AND MPI_F77_LIBRARY_D AND MPI_F77_LIBRARY AND MPI_F90_LIBRARY_D AND MPI_F90_LIBRARY AND MPI_OPEN_LIBRARY_D AND MPI_OPEN_LIBRARY AND MPI_MCA_LIBRARY_D AND MPI_MCA_LIBRARY AND MPI_OMPITV_LIBRARY_D AND MPI_OMPITV_LIBRARY)
	SET(MPI_FOUND TRUE)
ENDIF (MPI_INCLUDE_DIR AND MPI_LIBRARY_D AND MPI_LIBRARY AND MPI_CXX_LIBRARY_D AND MPI_CXX_LIBRARY AND MPI_F77_LIBRARY_D AND MPI_F77_LIBRARY AND MPI_F90_LIBRARY_D AND MPI_F90_LIBRARY AND MPI_OPEN_LIBRARY_D AND MPI_OPEN_LIBRARY AND MPI_MCA_LIBRARY_D AND MPI_MCA_LIBRARY AND MPI_OMPITV_LIBRARY_D AND MPI_OMPITV_LIBRARY)

IF (MPI_FOUND)
	IF (NOT Mpi_FIND_QUIETLY)
		MESSAGE(STATUS "Found MPI: ${MPI_LIBRARY}")
	ENDIF (NOT Mpi_FIND_QUIETLY)
ELSE (MPI_FOUND)
	 IF (Mpi_FIND_REQUIRED)
		MESSAGE(FATAL_ERROR "Could not find Mpi")
	ENDIF (Mpi_FIND_REQUIRED)
ENDIF (MPI_FOUND)

ENDIF (NOT MPI_FOUND)

repository: open-mpi/ompi-www

repo_name: open-mpi/ompi-www

extension: cmake


text:
# Copyright (c) 2021 LG Electronics, Inc.

require pcl.inc

PV = "1.10.1+git${SRCPV}"
SRCREV = "cbed174ba0a0c9ef021015d54d3b60320d808593"

repository: DasRoteSkelett/meta-ros

repo_name: DasRoteSkelett/meta-ros

extension: bb


text:
set(CMAKE_CONFIGURATION_TYPES Debug)

set(SRC_FILES
  ${CMAKE_CURRENT_SOURCE_DIR}/Dir/foo.cpp
  ${CMAKE_CURRENT_SOURCE_DIR}/Dir/DirNested/foo_nested.cpp
)

set(PREFIXED_SRC_FILES
  ${CMAKE_CURRENT_SOURCE_DIR}/Prefixed/bar.cpp
  ${CMAKE_CURRENT_SOURCE_DIR}/Prefixed/PrefixedNested/bar_nested.cpp
)

add_custom_target(SourceGroupTree SOURCES ${SRC_FILES} ${PREFIXED_SRC_FILES})

source_group(TREE ${CMAKE_CURRENT_SOURCE_DIR} FILES ${SRC_FILES})
source_group(TREE ${CMAKE_CURRENT_SOURCE_DIR}/Prefixed PREFIX SourcesPrefix FILES ${PREFIXED_SRC_FILES})

repository: jakubrak/CMake

repo_name: jakubrak/CMake

gha_license_id: NOASSERTION


text:
DESCRIPTION = "Yet Another V4L2 Test Application"
LICENSE = "GPLv2"
LIC_FILES_CHKSUM = "file://COPYING.GPL;md5=751419260aa954499f7abaabaa882bbe"

SRC_URI = "git://git.ideasonboard.org/yavta.git;protocol=git"
SRCREV = "d62cb9d7435525660fd5c97941c7cf57921370b3"

PV = "0.0"
S = "${WORKDIR}/git"

do_install() {
	install -d ${D}${bindir}
	install -m 0755 yavta ${D}${bindir}
}


text:
file(REMOVE_RECURSE
  "CMakeFiles/test_multiset_32.dir/multiset.cpp.o"
  "test_multiset_32.pdb"
  "test_multiset_32"
)

# Per-language clean rules from dependency scanning.
foreach(lang CXX)
  include(CMakeFiles/test_multiset_32.dir/cmake_clean_${lang}.cmake OPTIONAL)
endforeach()

repository: noahhsmith/starid

repo_name: noahhsmith/starid


text:
@font-face {
    font-family: 'RellyanCharlotte';
    src: local('RellyanCharlotte'), url(fonts/rellyan_charlotte.ttf);
  }

extension: css


text:
DESCRIPTION = "Python HTTP for Humans."
HOMEPAGE = "http://python-requests.org"
LICENSE = "Apache-2.0"
LIC_FILES_CHKSUM = "file://LICENSE;md5=34400b68072d710fecd0a2940a0d1658"

SRC_URI += "file://setup.py-Support-idna-version-3.1.patch"

SRC_URI[sha256sum] = "27973dd4a904a4f13b263a19c866c13b92a39ed1c964655f025f3f8d3d75b804"

inherit pypi setuptools3

RDEPENDS_${PN} += " \
    ${PYTHON_PN}-email \
    ${PYTHON_PN}-json \
    ${PYTHON_PN}-ndg-httpsclient \
    ${PYTHON_PN}-netserver \
    ${PYTHON_PN}-pyasn1 \
    ${PYTHON_PN}-pyopenssl \
    ${PYTHON_PN}-pysocks \
    ${PYTHON_PN}-urllib3 \
    ${PYTHON_PN}-chardet \
    ${PYTHON_PN}-idna \
"

CVE_PRODUCT = "requests"

BBCLASSEXTEND = "native nativesdk"

repository: ni/meta-openembedded

repo_name: ni/meta-openembedded

branch_name: refs/heads/nilrt/master/hardknott

gha_language: BitBake


text:
SUMMARY = "executive_smach"
HOMEPAGE = "http://ros.org/wiki/executive_smach"
LICENSE  = "BSD"
LIC_FILES_CHKSUM = "file://executive_smach/stack.xml;md5=53f92ff16d88de835ed07d4b02984a49"

inherit catkin

SRC_URI  = "hg://kforge.ros.org/smach;module=executive_smach;rev=executive_smach-1.2.0;proto=http"

DEPENDS += "\
	genmsg \
	langs \
"

RDEPENDS_${PN} = "\
	actionlib \
	ros \
	ros_comm \
	common_msgs \
"

S = "${WORKDIR}"


text:
@article{econgradmh2022,
  title = {Graduate Student Mental Health: Lessons from American Economics Departments},
  author = {Bolotnyy, Valentin and Basilico, Matthew and Barreira, Paul},
  journal = {Journal of Economic Literature},
  year = 2022,
  month = December,
  volume = 60,
  number = 4,
  pages = 1188-1222,
  doi = 10.1257/jel.20201555,
  url = https://www.aeaweb.org/articles?id=10.1257/jel.20201555
}


text:
DESCRIPTION = "SAM"
LICENSE = "CLOSED"

FILESEXTRAPATHS_prepend := "${THISDIR}/files/:"

inherit cmake systemd

SYSTEMD_SERVICE_${PN} = "sam.service"

SRC_URI = "\
	file://sam.service \
	file://opt.mount \
	gitsm://github.com/isir/SAM.git;branch=next;protocol=git \
	"
SRCREV = "06283a7e11a9d39982327fc26e945b3bd170fa3f"

S = "${WORKDIR}/git"

do_install() {
    install -d ${D}/opt
    install -d ${D}${systemd_system_unitdir}
    install -m 0644 ${WORKDIR}/sam.service ${D}${systemd_system_unitdir}
    install -m 0644 ${WORKDIR}/opt.mount ${D}${systemd_system_unitdir}
}

FILES_${PN} += "/opt \
		${systemd_system_unitdir}/sam.service \
		${systemd_system_unitdir}/opt.mount"

DEPENDS = "libeigen espeak i2c-tools mosquitto userland wiringpi"
RDEPENDS_${PN} = "espeak i2c-tools libmosquitto1 mosquitto userland wiringpi"

RDEPENDS_${PN}-dev = "libeigen-dev"

repository: isir/meta-sam

repo_name: isir/meta-sam


text:
# Install external libraries

find_package(Git QUIET)

if(NOT GIT_FOUND AND SELENE_BUILD_TESTS)
    message(FATAL_ERROR "Git not found. Git is required for initializing/updating submodules.")
endif()

# Catch2
if(SELENE_BUILD_TESTS)
    execute_process(COMMAND ${GIT_EXECUTABLE} submodule update --init -- external/Catch2
                    WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
                    RESULT_VARIABLE GIT_SUBMODULE_RESULT_CATCH)
    if(NOT GIT_SUBMODULE_RESULT_CATCH EQUAL "0")
        message(FATAL_ERROR "Catch2 Git submodule could not be initialized or updated.")
    endif()
endif()

repository: kmhofmann/selene

repo_name: kmhofmann/selene


text:
require libgpg-error.inc

PR = "${INC_PR}.1"

SRC_URI[md5sum] = "ff409db977e4a4897aa09ea420a28a2f"
SRC_URI[sha256sum] = "7baf0a33a717c5d5b24faf592ba16fc5e962f1537f46b11f6ed003010a8ff1e9"

repository: overo/overo-oe-natty

repo_name: overo/overo-oe-natty

branch_name: HEAD


text:
@article{MR3685115,
 author = {Meeks, III, William H. and Mira, Pablo and Pérez, Joaquín},
 doi = {10.1093/imrn/rnw159},
 fjournal = {International Mathematics Research Notices. IMRN},
 issn = {1073-7928},
 journal = {Int. Math. Res. Not. IMRN},
 mrclass = {53C30 (22E15 53C42)},
 mrnumber = {3685115},
 mrreviewer = {Sebastian Klein},
 number = {15},
 pages = {4796--4813},
 title = {Embeddedness of spheres in homogeneous three-manifolds},
 url = {https://doi.org/10.1093/imrn/rnw159},
 year = {2017}
}

repository: torralbofco/geometric-analysis-fork

repo_name: torralbofco/geometric-analysis-fork


text:
@article{doi:10.1021/acs.jctc.0c00447,
author = {Urbanek, Miroslav and Camps, Daan and Van Beeumen, Roel and de Jong, Wibe A.},
title = {Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion},
journal = {Journal of Chemical Theory and Computation},
volume = {16},
number = {9},
pages = {5425-5431},
year = {2020},
doi = {10.1021/acs.jctc.0c00447},
    note ={PMID: 32822184},
URL = {
        https://doi.org/10.1021/acs.jctc.0c00447
},
eprint = {
        https://doi.org/10.1021/acs.jctc.0c00447
}
}

repository: campsd/academic-kickstart

repo_name: campsd/academic-kickstart


text:
@Manual{forecast,
  title = {forecast: Forecasting functions for time series},
  author = {Rob J Hyndman},
  year = {2009},
  note = {R package version 2.03},
  url = {http://CRAN.R-project.org/package=forecast},
}
@Manual{R,
  title = {R: A Language and Environment for Statistical Computing},
  author = {{R Development Core Team}},
  organization = {R Foundation for Statistical Computing},
  address = {Vienna, Austria},
  year = {2009},
  note = {{ISBN} 3-900051-07-0},
  url = {http://www.R-project.org},
}
@Manual{tseries,
  title = {tseries: Time Series Analysis and Computational Finance},
  author = {Adrian Trapletti and Kurt Hornik},
  year = {2009},
  note = {R package version 0.10-22.},
  url = {http://CRAN.R-project.org/package=tseries},
}
@Manual{stats,
  title = {R: A Language and Environment for Statistical Computing},
  author = {{R Development Core Team}},
  organization = {R Foundation for Statistical Computing},
  address = {Vienna, Austria},
  year = {2009},
  note = {{ISBN} 3-900051-07-0},
  url = {http://www.R-project.org},
}
@Book{MASS,
  title = {Modern Applied Statistics with S},
  author = {W. N. Venables and B. D. Ripley},
  publisher = {Springer},
  edition = {Fourth},
  address = {New York},
  year = {2002},
  note = {ISBN 0-387-95457-0},
  url = {http://www.stats.ox.ac.uk/pub/MASS4},
}

repository: SiggyF/bibliography

repo_name: SiggyF/bibliography


text:
% Exemplos de bibliografia latex
@book{niven1965mathematics,
  title={Mathematics of choice: or, How to count without counting},
  author={Niven, Ivan},
  volume={15},
  year={1965},
  publisher={MAA},
  address={Nova York}
}

@article{vazquez2004analise,
	title={An{\'a}lise Combinat{\'o}ria: alguns aspectos hist{\'o}ricos e uma abordagem pedag{\'o}gica},
	author={VAZQUEZ, Cristiane MR and NOGUTI, Fabiane CH},
	journal={Recife: VII Encontro Nacional de Educa{\c{c}}{\~a}o Matem{\'a}tica},
	pages={22},
	year={2004}
}

@book{dantas2013probabilidade,
	title={Probabilidade: Um Curso Introdut{\'o}rio Vol. 10},
	author={Dantas, Carlos Alberto Barbosa},
	year={2013},
	publisher={Edusp},
	address={S{\~a}o Paulo}
}

repository: leansdr/mongoStudy

repo_name: leansdr/mongoStudy


text:
@inproceedings{Harper2004bs,
 abstract = {Movement, or mobility, is key to the accessibility, design, and usability of many hypermedia resources (websites); and key to good mobility is context and preview by probing. This is especially the case for visually impaired users when a hypertext anchor is inaccurately described or is described out of context. This means confusion and disorientation. Mobility is similarly reduced when the link target of the anchor has no relationship to the expected information present on the hypertext node (web-page). We suggest that confident movement with purpose, ease, and accuracy can only be achieved when complete contextual information and an accurate description of the proposed destination (preview) are available. Our past work (1) deriving mobility heuristics from mobility models, (2) transforming web-pages based on these heuristics, and (3) building tools to analyse and access these transformed pages; has shown us that a tool to expand context and preview would be useful. In this paper we describe the development of such a middleware tool to automatically and dynamically annotate web-pages with additional context information present within the page, and preview information present within hypertext link destinations found on the page.},
 author = {Harper, Simon and Goble, Carole and Stevens, Robert and Yesilada, Yeliz},
 booktitle = {Proceedings of the ACM SIGACCESS Conference on Computers and Accessibility},
 doi = {http://dx.doi.org/10.1145/1028630.1028643},
 isbn = {1-58113-911-X},
 keywords = {Accessibility,Document Engineering,Human Centred Web,Metrics,Modelling,Tools,ViCRAM,Visual Complexity,Visual Impairment,Web Accessibility},
 month = {oct},
 pages = {63--70},
 publisher = {ACM Press},
 title = {Middleware to Expand Context and Preview in Hypertext},
 url = {http://www.simonharper.info/publications/Harper2004bs.pdf},
 year = {2004}
}

repository: sharpic/academic-kickstart

repo_name: sharpic/academic-kickstart


text:
@inproceedings{10.1145/2934732.2940298,
author = {Gonzalo, Julio},
title = {Monitoring Reputation in the Wild Online West},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2940298},
doi = {10.1145/2934732.2940298},
abstract = {Monitoring Online Reputation has already become a key part of Public Relations for organizations and individuals; and current search technologies do not suffice to help reputation experts to cope with the vast stream of online content relevant to their clients. One of the reasons is that the amount of relevant content for medium and large companies and typical public figures is too large to be handled manually, but too small to be handled with the statistical techniques that are typically effective at Web scale.In the talk we will overview some of the main challenges that Information Access Technologies must face to assist online reputation experts in their monitoring tasks, and present some of the results obtained by the UNED research group in the areas of:• Entity Name Disambiguation: in order to track online content mentioning an entity (companies, organizations, brands, individuals, etc.), recall is essential and queries are, as a consequence, short and potentially ambiguous (consider company names such as Blackberry, Orange or Apple). Automatic filtering of irrelevant content is a crucial preliminary step to perform a reputational analysis of online content.• Topic Tracking for Reputation Analysis: Once the stream of relevant content mentioning the entity of interest is isolated, experts need to identify conversations, i.e., issues related to the client that may have an effect on their reputation. These are usually fine-grained topics with a large variability in terms of size, and they are not trivial to detect with conventional techniques.• Alert detection and Reputational priority: One of the main challenges of reputation monitoring is detecting issues before they explode and become serious Public Relations problems. A necessary step is determining, for new topics, what is their priority from a reputational point of view, and which should be treated immediately (reputation alerts).• Identification and Profiling of Opinion Makers: a key issue for effective alert detection is listening to opinion makers, i.e. people with audience and perceived authority whose opinion influences the state of public opinion. While offline authorities and opinion makers are usually a few, easy to identify individuals, in online media detecting opinion makers is a challenging task.• Automatic Generation of Reputation Reports (Reputation-Oriented Summarization): Ideally, an automatic reputation monitoring system would be able to fulfill all the above tasks, and synthesize the analysis in a summary (a reputation report). We will discuss how to build such a summary from a computational point of view, and how it differs from conventional summarization tasks.In the talk we will make a special emphasis on the features of the Replab test collections for Online Reputation Monitoring, which provide over half a million manual annotations provided by reputation experts on Twitter data, and are the basis of UNED experiments in the field.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {1},
numpages = {1},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2940297,
author = {Oliver, Nuria},
title = {Data-Driven Human Behavior Models: Opportunities and Challenges},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2940297},
doi = {10.1145/2934732.2940297},
abstract = {We live in a world of data, of big data, a big part of which has been generated by humans through their interactions with both the physical and digital world. A key element in the exponential growth of human behavioral data is the mobile phone. There are more mobile phones in the world as humans which has turned the mobile phone into the piece of technology with the highest levels of adoption in human history. We carry them with us all through the day (and night, in many cases), leaving digital traces of our physical interactions. Mobile phones have become sensors of human activity both in the large scale and also as the most personal devices.In my talk, I present some of the work that we are doing at Telefonica Research in the area of modeling humans from human behavioral data collected from mobile phones. The data may be data that is automatically collected by the mobile network infrastructure --in particular Call Detail Records or CDRs---or data that is collected by an experimental mobile application through a user study. All projects entail data analytics and machine learning in order to build accurate models of individual or aggregate behavior.In particular, I describe four projects: (1) a project to automatically infer personality from Call Detail Records [1]; (2) MobiScore, a project to automatically assess a credit score from Call Detail Records [2]; Borapp, a mobile app that is able to detect boredom from patterns of phone usage [3] and a project to automatically predict crime hotspots in a city from human dynamics and demographic data [4].I conclude by highlighting opportunities and challenges associated with building data-driven models of human behavior.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {2},
numpages = {1},
keywords = {Computational Social Sciences, Data-driven Human Behavior Modeling, Machine Learning, Artificial Intelligence},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934734,
author = {Losada, David E. and Parapar, Javier},
title = {Injecting Multiple Psychological Features into Standard Text Summarisers},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934734},
doi = {10.1145/2934732.2934734},
abstract = {Automatic Text Summarisation is an essential technology to cope with the overwhelming amount of documents that are daily generated. Given an information source, such as a webpage or a news article, text summarisation consists of extracting content from it and present it in a condensed form for human consumption. Summaries are crucial to facilitate information access. The reader is provided with the key information in a concise and fluent way. This speeds up navigation through large repositories of data. With the rapid growth of online contents, creating manual summaries is not an option. Extractive summarisation methods are based on selecting the most important sentences from the input. To meet this aim, a ranking of candidate sentences is often built from a reduced set of sentence features. In this paper, we show that that many features derived from psychological studies are valuable for constructing extractive summaries. These features encode psychological aspects of communication and are a good guidance for selecting salient sentences. We use Quantitative Text Analysis tools for extracting these features and inject them into state-of-the-art extractive summarisers. Incorporating these novel components into existing extractive summarisers requires to combine and weight a high number of sentence features. In this respect, we show that Particle Swarm Optimisation is a viable approach to set the feature's weights. Following standard evaluation practice (DUC benchmarks), we also demonstrate that our novel summarisers are highly competitive.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {3},
numpages = {8},
keywords = {LIWC, Summarisation, PSO, psychological features},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934735,
author = {Iglesias-Franjo, Est\'{\i}baliz and Vilares, Jes\'{u}s},
title = {Any Papyrus about "a Hand over a Stool and a Bread Loaf, Followed by a Boat"? Dealing with Hieroglyphic Texts in IR},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934735},
doi = {10.1145/2934732.2934735},
abstract = {Digital Heritage deals with the use of computing and information technologies for the preservation and study of the human cultural legacy. Within this context, we present here a Text Retrieval system developed specifically to work with Egyptian hieroglyphic texts for its use by Egyptologists and Linguists in the study and preservation of Ancient Egyptian scripts. We intend to make it freely available to the Egyptology research community. To the best of our knowledge this is the first tool of its kind.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {4},
numpages = {8},
keywords = {digital heritage, manuel de codage, egyptology, Text retrieval, egyptian hieroglyphs},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934733,
author = {Mosbah, Mawloud and Boucheham, Bachir},
title = {Improving the Performance of Color-Based Signatures through Dynamic Selection of Adequate CCV-Threshold},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934733},
doi = {10.1145/2934732.2934733},
abstract = {Color Coherence Vector (CCV) is an indexing method derived from histograms signature that attempts to integrate spatial information in these structures. Owing to its remarkable importance, many recent works have addressed CCV signature and some early indexing methods have been inspired from it. An essential issue with CCV is how to set the threshold value allowing distinction between coherent and non-coherent regions. Usually, this threshold, whose value has dramatic impact on CBIR performances, is set statically by the developer of the CBIR system. In this paper, we focus on the CCV threshold value through proposing two algorithms setting it dynamically according to the image query. The first algorithm belongs to the soft computing and relies on features fusion mechanism. The second one belongs to the cloud computing paradigm and relies on Google Image Engine. The two proposed algorithms belong to the pseudo relevance feedback approach that does not require any user assistance. The experiments conducted on the Wang database (COREL-1K) reveals that the proposed algorithms yield very promising results where they enhance CCV performances with fixed threshold and they are efficient compared to the features Fusion mechanism when considering the indexing time.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {5},
numpages = {4},
keywords = {CBIR, Recall, CCV, Precision, Dynamic Threshold},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934746,
author = {Fern\'{a}ndez, Diego and da Silva, Xacobe Mac\'{\i}a and N\'{o}voa, Francisco J. and Cacheda, Fidel and Carneiro, V\'{\i}ctor},
title = {Using Collaborative Filtering in a New Domain: Traffic Analysis},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934746},
doi = {10.1145/2934732.2934746},
abstract = {The importance of information systems is increasing every day. In order to ensure their right operation, it is necessary to analyze a huge amount of traffic generated by different devices. However, classical techniques for operation and management are reactive and not proactive, what can evolve in a failure in the system.In this work we propose a new approach where we analyze network traffic using Collaborative Filtering. In other domains, these systems have proved to filter thousands of items according to user needs and tastes. They can predict user preferences and recommend relevant items for the user. In this sense, in this new domain, relevant items are data flows, so our goal is to recommend flows which are related to the traffic already captured.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {6},
numpages = {8},
keywords = {Recommender Systems, OCCF, unary ratings, Collaborative Filtering, IDS, Computer Networks, network flows},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934742,
author = {Ezpeleta, Enaitz and Zurutuza, Urko and Hidalgo, Jos\'{e} Mar\'{\i}a G\'{o}mez},
title = {Short Messages Spam Filtering Using Personality Recognition},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934742},
doi = {10.1145/2934732.2934742},
abstract = {In this era of smartphones and online social networks, short messages communications tools are growing up, attracting spam and non-legitimate campaigns. Those campaigns, besides being an illegal online activities, are a direct threat to the privacy of the users. Previous short messages spam filtering techniques focus on automatic text classification and while none of them take message personality feature into account. Focusing on phone Short Message Service (SMS) messages, this work demonstrates that it is possible to improve spam filtering in short message services using personality recognition techniques. Using a publicly available labelled (spam/legitimate) SMS dataset, we apply personality recognition techniques to each message and aggregate the personality feature to the original dataset, creating a new one. We compare the results of the best classifiers and filters over the different datasets (with and without personality) in order to demonstrate the influence of the personality. Experiments show that personality feature helps to improve SMS spam filtering improving both the accuracy, reaching to a 98.94%, and the false positive rates.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {7},
numpages = {7},
keywords = {Spam, Personality, SMS},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934747,
author = {S\'{a}nchez, Pablo and Bellog\'{\i}n, Alejandro and Cantador, Iv\'{a}n},
title = {Studying the Effect of Data Structures on the Efficiency of Collaborative Filtering Systems},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934747},
doi = {10.1145/2934732.2934747},
abstract = {Recommender systems is an active research area where the major focus has been on how to improve the quality of generated recommendations, but less attention has been paid on how to do it in an efficient way. This aspect is increasingly important because the information to be considered by recommender systems is growing exponentially. In this paper we study how different data structures affect the performance of these systems. Our results with two public datasets provide relevant insights regarding the optimal data structures in terms of memory and time usages. Specifically, we show that classical data structures like Binary Search Trees and Red-Black Trees can beat more complex and popular alternatives like Hash Tables.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {8},
numpages = {4},
keywords = {Efficiency, Collaborative Filtering, Data Structures},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934737,
author = {Valcarce, Daniel and Parapar, Javier and Barreiro, \'{A}lvaro},
title = {Additive Smoothing for Relevance-Based Language Modelling of Recommender Systems},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934737},
doi = {10.1145/2934732.2934737},
abstract = {The use of Relevance-Based Language Models for top-N recommendation has become a promising line of research. Previous works have used collection-based smoothing methods for this task. However, a recent analysis on RM1 (an estimation of Relevance-Based Language Models) in document retrieval showed that this type of smoothing methods demote the IDF effect in pseudo-relevance feedback. In this paper, we claim that the IDF effect from retrieval is closely related to the concept of novelty in recommendation. We perform an axiomatic analysis of the IDF effect on RM2 concluding that this kind of smoothing methods also demotes the IDF effect in recommendation. By axiomatic analysis, we find that a collection-agnostic method, Additive smoothing, does not demote this property. Our experiments confirm that this alternative improves the accuracy, novelty and diversity figures of the recommendations.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {9},
numpages = {8},
keywords = {Relevance-Based Language Models, Recommender systems, collaborative filtering},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934740,
author = {de Campos, Luis M. and Fern\'{a}ndez-Luna, Juan M. and Huete, Juan F.},
title = {Comparing Monolithic and Committee-Based Profiles for Politician Recommendation},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934740},
doi = {10.1145/2934732.2934740},
abstract = {In a parliamentary setting, citizen could be interested in knowing those Members of Parliament (MPs) who are working in different areas or involved in the resolution of some people's problems. These topics of interest are usually represented by means of a profile. In this paper, the politicians' profiles are built considering the speeches in parliamentary sessions. However, in most of the cases a single profile is not the best alternative to represent MPs' interests because the specific terms related to a given topic are mixed with others, so that the MPs' preferences are diluted. The alternative is to build different subprofiles containing each one the most representative keywords for each topic, creating in this way a richer representation. We present a first approach to build subprofiles based on the MPs' speeches in different committee and plenary sessions, which will be compared, in terms of performance, to monolithic profiles for an MP content-based recommendation task.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {10},
numpages = {8},
keywords = {Members of Parliaments, Profiles, Subprofiles, Information Retrieval, Content-based Recommendation},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934745,
author = {Tomeo, Paolo and Fern\'{a}ndez-Tob\'{\i}as, Ignacio and Di Noia, Tommaso and Cantador, Iv\'{a}n},
title = {Exploiting Linked Open Data in Cold-Start Recommendations with Positive-Only Feedback},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934745},
doi = {10.1145/2934732.2934745},
abstract = {In recommender systems, user preferences can be acquired either explicitly by means of ratings, or implicitly --e.g., by processing text reviews, and by mining item browsing and purchasing records. Most existing collaborative filtering approaches have been designed to deal with numerical ratings, such as the 5-star ratings in Amazon and Netflix, for both rating prediction and item ranking (a.k.a. top-N recommendation) tasks. In many e-commerce and social network sites, however, user preferences are usually expressed in the form of binary and unary (positive-only) ratings, such as the thumbs up/down in YouTube and the likes in Facebook, respectively. Moreover, in these cases, the well-known problem of cold-start --i.e., the scarcity of user preferences-- is highly remarkable. To address this situation, we explore a number of graph-based and matrix factorization recommendation models that jointly exploit user ratings and item metadata. In this work, such metadata are automatically obtained from DBpedia --the queriable and structured version of Wikipedia which is considered as the core knowledge repository of the Linked Open Data initiative--, and the models are evaluated with a Facebook dataset covering three distinct domains, namely books, movies and music. The results achieved in our experiments show that the proposed hybrid recommendation models, which exploit rating and semantic data, outperform content-based and collaborative filtering baselines.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {11},
numpages = {8},
keywords = {DBpedia, Facebook, Recommender systems, hybrid recommendation, cold-start, positive-only feedback, Linked Data},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934736,
author = {Pamp\'{\i}n, Humberto Jes\'{u}s Corona and Peleteiro, Ana},
title = {A Time-Aware Exploration of RecSys15 Challenge Dataset},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934736},
doi = {10.1145/2934732.2934736},
abstract = {E-commerce is currently one of the main applications of recommender systems, since it generates vast amounts of data that can be used to make predictions and analyse users's behaviour. In this paper we present an overview of the public dataset used for the RecSys Challenge 2015. We describe the basic statistical properties of this dataset and how events (clicks and purchases) are distributed over products (items) and users (sessions). We also present a time-aware analysis of the dataset, with the aim to better understand the change of user behaviour within time cycles, and how it affects the activity in user purchases. We further study the relation between categories, the solely type of metadata present in this completely anonymised dataset. We are interested both in how these categories are distributed and how users and items interact with them. Finally, along the paper we explain the implications that the results obtained from our analysis may have when building models for the challenge.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {12},
numpages = {4},
keywords = {E-commerce, Recommender Systems, Dataset exploration},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934743,
author = {Menk, Alan and Sebasti\'{a}, Laura},
title = {Predicting the Human Curiosity from Users' Profiles on Facebook},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934743},
doi = {10.1145/2934732.2934743},
abstract = {Nowadays, social networks store a massive amount of data, which can say a lot about our personality. Given the ease to access the internet everywhere at any time, many people use social networks in daily life, reflecting in a certain way their behaviour from the "real world" to the "virtual world", by storing in social networks what they like, hate, feel, where they travel to, their relationships, opinions, etc. Once obtained the access to this data, some authors have tried to infer the personality of the individual without the use of long questionnaires, only working with data in an implicit way, that is, transparently to user. In this scenario, our work is focused on predicting just one of the human personality traits, the Curiosity. In this paper, we analyse the information that can be extracted from the users' profile on Facebook and the set of features that can be used to describe their degree of curiosity. Finally, we generate a prediction model in the form of a decision tree.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {13},
numpages = {8},
keywords = {Social Network, Data Mining, Personality, Curiosity},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934744,
author = {Claude, Francisco and Konow, Roberto and Ladra, Susana},
title = {Fast Compressed-Based Strategies for Author Profiling of Social Media Texts},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934744},
doi = {10.1145/2934732.2934744},
abstract = {Given a text, it may be useful to determine the age, gender, native language, nationality, personality and other demographic attributes of its author. This task is called author profiling, and has been studied by different areas, especially from linguistics and natural language processing, by extracting different content- and style-based features from training documents and then using various machine learning approaches.In this paper we address the author profiling task by using several compression-inspired strategies. More specifically, we generate different models to identify the age and the gender of the author of a given document without analysing or extracting specific features from the textual content, making them style-oblivious approaches.We compare and analyse their behaviour over datasets of different nature. Our results show that by using simple compression-inspired techniques we are able to obtain very competitive results in terms of accuracy and we are orders of magnitude faster for the evaluation phase when compared to other state-of-the-art complex and resource-demanding techniques.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {14},
numpages = {6},
keywords = {compression-based classification, author profiling, age and gender prediction, entropy},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934748,
author = {Tramullas, Jes\'{u}s and Garrido-Picazo, Piedad and S\'{a}nchez-Casab\'{o}n, Ana I.},
title = {Research on Wikipedia Vandalism: A Brief Literature Review},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934748},
doi = {10.1145/2934732.2934748},
abstract = {Research on vandalism in Wikipedia has been of interest for the last decade. This paper performs a literature review on the subject, with the goal of identifying the main research topics and approaches, methods and techniques used. 67 papers have been reviewed. Results showed that the authorship of three-quarters of papers are from Computer Science researchers. Other identified authors come from Humanities and Social Sciences, and Education. Main topic is the detection of vandalism, although there is a increasing interest about content quality. The most commonly used technique is machine learning, based on feature analysis. It draws attention to the lack of research on information behavior of vandals.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {15},
numpages = {4},
keywords = {vandalism, Wikipedia, literature review},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934738,
author = {Flores, Enrique and Moreno, Lidia and Rosso, Paolo},
title = {Detecting Source Code Re-Use with Ensemble Models},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934738},
doi = {10.1145/2934732.2934738},
abstract = {Source code re-use has been usually faced from a compiler perspective. Considering the source code as a piece of text, we are able to use natural language techniques for the detection of source code re-use. This paper describes the use of ensemble models in the task of source code re-use detection. Ensembles of Information Retrieval (IR) models are constructed using common classifiers. The IR-inspired models are compared with the ensembles in C and Java programming languages. The use of ensemble classifiers shows promising results for detecting source code re-use.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {16},
numpages = {7},
keywords = {re-use detection, source code re-use retrieval, source code re-use, ensemble classifiers},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934739,
author = {Moreno, Valent\'{\i}n and G\'{e}nova, Gonzalo and Alejandres, Manuela and Fraga, Anabel},
title = {Automatic Classification of Web Images as UML Diagrams},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934739},
doi = {10.1145/2934732.2934739},
abstract = {Our purpose in this research is to develop a methodology to automatically and efficiently classify web images as UML static diagrams, and to produce a computer tool that implements this function. The tool receives as input a bitmap file (in different formats) and tells whether the image corresponds to a diagram. The tool does not require that the images are explicitly or implicitly tagged as UML diagrams. The tool extracts graphical characteristics from each image (such as grayscale histogram, color histogram and elementary geometric forms) and uses a combination of rules to classify it. The rules are obtained with machine learning techniques (rule induction) from a sample of 19000 web images manually classified by experts. In this work we do not consider the textual contents of the images.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {17},
numpages = {8},
keywords = {UML diagram recognition, Rule induction, Image processing},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934741,
author = {Reyes-Alvarez, Liudmila and Fern\'{a}ndez, Jaime and Rodr\'{\i}guez-Mu\~{n}iz, Luis J. and D\'{\i}az, Irene},
title = {Ontological Models for Information Retrieval of Product-Service: Trends and Open Issues},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934741},
doi = {10.1145/2934732.2934741},
abstract = {More and more companies need a model for product-service information retrieval. All businesses agree on the need of a common vocabulary among customers, commercial partners and suppliers. Building ontologies as models of knowledge representation about product-service information is increasingly seen as a key to enable interoperability between software agents and people on the Web or through to network connections. In addition, in recent years it has strengthened the alliance between industry and scientific research communities. The development of ontology-based smart catalogs captures their attention. This work surveys ontological models for information retrieval on product-service in the industry. Research trends previously addressed and open issues are discussed. Besides, some of the solutions on functionality and behavior of ontologies-based product-service are presented as an alternative to achieve an optimal level during information retrieval using smart catalogs in business scenarios.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {18},
numpages = {10},
keywords = {Ontology, Product-Service, Business sceneries, Functionality and behavior, Ontological models},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934749,
author = {Vitelli, Maria Carmela and D\'{\i}az, Irene and Troiano, Luigi},
title = {A Method to Generate Equiprobale Runs in TFPG Models},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934749},
doi = {10.1145/2934732.2934749},
abstract = {FDIR functionalities play a key role in several fields and a lot of techniques and methods have been developed in order to make them possible. TFPG is a causal model that captures the temporal aspects of failure propagation in a wide variety of engineering systems. As other sources of information, they require to be stored and retrieved. A key to index and query a TFPG documental base is in the sequence of events, i.e. runs, they are able to model. In this paper we propose a method to produce equiprobable runs of the TFPG model that can be used as support to index generation.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {19},
numpages = {7},
keywords = {Linear Extensions, FDIR},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934751,
author = {Blank, Daniel and Henrich, Andreas},
title = {Assessing Interestingness and Importance of Information Retrieval Course Topics in a Course for Three Different Target Groups},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934751},
doi = {10.1145/2934732.2934751},
abstract = {Teaching an information retrieval (IR) course for three different target groups is challenging. These target groups are i) resident students at the University of Bamberg, Germany ii) remote full-time students from other Bavarian universities, and iii) remote but part-time students from all parts of Germany which usually study the course besides their day-to-day work relationship. As a consequence, we have participants with heterogeneous previous knowledge and potentially different expectations with respect to the course content.In this paper we will only briefly describe the didactic aspects and challenges of the course. The clear focus of the paper lies on an in-depth quantitative evaluation how various IR topics presented in the lectures and tutorials fit the needs of the different target groups. We evaluate interestingness and importance of the course topics according to the students' impressions. The goal of the evaluation is to get hints for future refinements of IR course content---in general but also with respect to the needs of different target groups.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {20},
numpages = {8},
keywords = {Distance Learning, Teaching Information Retrieval, Evaluation of Course Content},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934750,
author = {Johnson, Frances},
title = {Evaluating Usability: A Two-Fold Assessment},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934750},
doi = {10.1145/2934732.2934750},
abstract = {This paper presents the progressive application of methods used in usability assessment to a single system, Searchit, a meta-search engine used by some academic libraries in the UK to allow a search across a range of databases as well as in the library's own collection. Students studying on a course in Information Retrieval Systems at Manchester Metropolitan University assessed its usability using methods of heuristic based inspections, cognitive walkthrough and in the collection of behavioural data from a user study. Both the value and the limitations of these methods are exemplified in the resulting demonstration of what can be learnt about the usability of Searchit, and what can be learnt about the information searching and the users of the system. The exercise accomplishes a two-fold assessment, of the system usability and of the activity of information search. The students acquire skills in employing usability methods and the opportunity to learn about the search activities the retrieval system is designed to support.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {21},
numpages = {7},
keywords = {user experience, evaluation, information retrieval, Usability},
location = {Granada, Spain},
series = {CERI '16}
}

@inproceedings{10.1145/2934732.2934752,
author = {MacFarlane, Andrew and Russell-Rose, Tony},
title = {Search Strategy Formulation: A Framework For Learning},
year = {2016},
isbn = {9781450341417},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2934732.2934752},
doi = {10.1145/2934732.2934752},
abstract = {Healthcare information professionals perform systematic literature reviews to gather the evidence needed to answer specific research questions and formulate policy. However, performing a systematic review is a resource-intensive and time consuming undertaking, often taking years to complete. Moreover, the output relies heavily on the quality of the initial search strategy in ensuring that the scope is sufficiently exhaustive and not biased by easily accessible studies. In this paper we introduce a structured methodology and a framework for learning which together aim to embody best practices from the community and provide support for many of the common issues in search strategy development.},
booktitle = {Proceedings of the 4th Spanish Conference on Information Retrieval},
articleno = {22},
numpages = {8},
keywords = {systematic reviews, Information retrieval, education, training},
location = {Granada, Spain},
series = {CERI '16}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr