text:
@article{vicsek:1995,
  title={Novel type of phase transition in a system of self-driven particles},
  author={Vicsek, Tam{\'a}s and Czir{\'o}k, Andr{\'a}s and Ben-Jacob, Eshel and Cohen, Inon and Shochet, Ofer},
  journal={Physical review letters},
  volume={75},
  number={6},
  pages={1226},
  year={1995},
  publisher={APS},
  doi={10.1103/PhysRevLett.75.1226}
}

@article{vaughan:2008,
  title={Massively multi-robot simulation in stage},
  author={Vaughan, Richard},
  journal={Swarm intelligence},
  volume={2},
  pages={189--208},
  year={2008},
  publisher={Springer},
  doi={10.1007/s11721-008-0014-4}
}

@article{mondada:2004,
  title={SWARM-BOT: A new distributed robotic concept},
  author={Mondada, Francesco and Pettinaro, Giovanni C and Guignard, Andre and Kwee, Ivo W and Floreano, Dario and Deneubourg, Jean-Louis and Nolfi, Stefano and Gambardella, Luca Maria and Dorigo, Marco},
  journal={Autonomous robots},
  volume={17},
  pages={193--221},
  year={2004},
  publisher={Springer},
  doi={10.1023/B:AURO.0000033972.50769.1c}
}

@inproceedings{carpin:2007,
  title={USARSim: a robot simulator for research and education},
  author={Carpin, Stefano and Lewis, Mike and Wang, Jijun and Balakirsky, Stephen and Scrapper, Chris},
  booktitle={Proceedings 2007 IEEE International Conference on Robotics and Automation},
  pages={1400--1405},
  year={2007},
  organization={IEEE},
  doi={10.1109/ROBOT.2007.363180}
}

@book{balch:1998teambots,
  title={Behavioral diversity in learning robot teams},
  author={Balch, Tucker R},
  year={1998},
  publisher={Georgia Institute of Technology}
}

@inproceedings{pinciroli:2011,
  title={ARGoS: a modular, multi-engine simulator for heterogeneous swarm robotics},
  author={Pinciroli, Carlo and Trianni, Vito and O'Grady, Rehan and Pini, Giovanni and Brutschy, Arne and Brambilla, Manuele and Mathews, Nithin and Ferrante, Eliseo and Di Caro, Gianni and Ducatelle, Frederick and others},
  booktitle={2011 IEEE/RSJ International Conference on Intelligent Robots and Systems},
  pages={5027--5034},
  year={2011},
  organization={IEEE},
  doi={10.1109/IROS.2011.6094829}
}

@article{calderon:2022,
  title={Swarm robotics: Simulators, platforms and applications review},
  author={Calder{\'o}n-Arce, Cindy and Brenes-Torres, Juan Carlos and Solis-Ortega, Rebeca},
  journal={Computation},
  volume={10},
  number={6},
  pages={80},
  year={2022},
  publisher={MDPI},
  doi={10.3390/computation10060080}
}

@inproceedings{reynolds:1987,
  title={Flocks, herds and schools: A distributed behavioral model},
  author={Reynolds, Craig W},
  booktitle={Proceedings of the 14th annual conference on Computer graphics and interactive techniques},
  pages={25--34},
  year={1987},
  doi={10.1145/37402.37406}
}

@article{toner:1998,
  title={Flocks, herds, and schools: A quantitative theory of flocking},
  author={Toner, John and Tu, Yuhai},
  journal={Physical review E},
  volume={58},
  number={4},
  pages={4828},
  year={1998},
  publisher={APS},
  doi={10.1103/PhysRevE.58.4828}
}

@article{balch:1998,
  title={Behavior-based formation control for multirobot teams},
  author={Balch, Tucker and Arkin, Ronald C},
  journal={IEEE transactions on robotics and automation},
  volume={14},
  number={6},
  pages={926--939},
  year={1998},
  publisher={IEEE},
  doi={10.1109/70.736776}
}

@article{reif:1999,
  title={Social potential fields: A distributed behavioral control for autonomous robots},
  author={Reif, John H and Wang, Hongyan},
  journal={Robotics and Autonomous Systems},
  volume={27},
  number={3},
  pages={171--194},
  year={1999},
  publisher={Elsevier},
  doi={10.1016/S0921-8890(99)00004-4}
}

@article{spears:1999,
  title={Using artificial physics to control agents},
  author={Spears, WM and Gordon, DF},
  journal={International Conference on Information Intelligence and Systems},
  year={1999},
  doi={10.1109/ICIIS.1999.810278}
}

@article{helbing:2000,
  title={Simulating dynamical features of escape panic},
  author={Helbing, D, Farkas, I and Vicsek, T},
  journal={Nature},
  year={2000},
  doi={10.1038/35035023}
}

@article{leonard:2001,
  title={Virtual leaders, artificial potentials and coordinated control of groups},
  author={Leonard, NE and Fiorelli, E},
  journal={IEEE Conference on Decision and Control},
  year={2001},
  doi={10.1109/CDC.2001.980728}
}

@article{pinciroli:2008,
  title={Lattice Formation in Space for a Swarm of Pico Satellites},
  author={Pinciroli, Carlo and Birattari, Mauro and Tuci, Elio and Dorigo, Marco and del Rey Zapatero, Marco and Vinko, Tamas and Izzo, Dario},
  journal={Ant Colony Optimization and Swarm Intelligence},
  year={2008},
  doi={10.1007/978-3-540-87527-7_36}
}

@article{jadbabaie:2003,
  title={Coordination of groups of mobile autonomous agents using nearest neighbor rules},
  author={Jadbabaie, A and Jie, Lin and Morse, AS},
  journal={IEEE Trans Automat Contr},
  year={2003},
  doi={10.1109/TAC.2003.812781}
}

@article{couzin:2005,
  title={Effective leadership and decision-making in animal groups on the move},
  author={Couzin, ID and Krause, J and Franks, NR and Levin, SA},
  journal={Nature},
  year={2005},
  doi={10.1038/nature03236}
}

@article{freeman:2009,
  title={Modelling Group Navigation: Dominance and Democracy in Homing Pigeons},
  author={Freeman, R and Biro, D},
  journal={J Navigation},
  year={2009},
  doi={10.1017/S0373463308005080}
}

@article{chamanbaz:2017,
  title={Swarm-Enabling Technology for Multi-Robot Systems},
  author={Chamanbaz, M and Mateo, D and Zoss, BM and Tokić, G and Wilhelm, E and Bouffanais, R and et al.},
  journal={Front Robot AI},
  year={2017},
  doi={10.3389/frobt.2017.00012}
}

@inproceedings{erez:2015,
  title={Simulation tools for model-based robotics: Comparison of bullet, havok, mujoco, ode and physx},
  author={Erez, Tom and Tassa, Yuval and Todorov, Emanuel},
  booktitle={2015 IEEE international conference on robotics and automation (ICRA)},
  pages={4397--4404},
  year={2015},
  organization={IEEE},
  doi={10.1109/ICRA.2015.7139807}
}

@article{zoss:2018,
  title={Distributed system of autonomous buoys for scalable deployment and monitoring of large waterbodies},
  author={Zoss, BM and Mateo, D and Kuan, YK and Tokić, G and Chamanbaz, M and Goh, L and et al.},
  journal={Auton Robot},
  year={2017},
  doi={10.1007/s10514-018-9702-0}
}

@article{dorigo:2021,
  title={Swarm Robotics: Past, Present, and Future},
  author={Dorigo, M and Theraulaz, G and Trianni, V},
  journal={Proc IEEE},
  year={2021},
  doi={10.1109/JPROC.2021.3072740}
}

@article{dias:2021,
  title={Swarm Robotics: A Perspective on the Latest Reviewed Concepts and Applications},
  author={Dias, PGF and Silva, MC and Rocha Filho, GP and Vargas, PA and Cota, LP and Pessin, G},
  journal={Sensors},
  year={2021},
  doi={10.3390/s21062062}
}

@article{spears:2004,
  title={Distributed, Physics-Based Control of Swarms of Vehicles},
  author={Spears, WM and Spears, DF and Hamann, JC and Heil, R},
  journal={Autonomous Robots},
  year={2004},
  doi={10.1023/B:AURO.0000033970.96785.f2}
}

@book{trianni:2008,
  title={Evolutionary Swarm Robotics},
  author={Trianni, V},
  volume={108},
  publisher={Springer Berlin Heidelberg},
  year={2008},
  doi={10.1007/978-3-540-77612-3}
}

@article{pinciroli:2015,
  title={Buzz: An Extensible Programming Language for Self-Organizing Heterogeneous Robot Swarms},
  author={Pinciroli, C and Lee-Brown, A and Beltrame, G},
  journal={IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)},
  year={2015},
  doi={10.1109/IROS.2016.7759558}
}

@article{testa:2021,
  title={ChoiRbot: A ROS 2 Toolbox for Cooperative Robotics},
  author={Testa, A and Camisa, A and Notarstefano, G},
  journal={IEEE Robot Autom Lett},
  year={2021},
  doi={10.1109/LRA.2021.3061366}
}

@article{kaiser:2022,
  title={ROS2SWARM - A ROS 2 Package for Swarm Robot Behaviors},
  author={Kaiser, TK and Begemann, MJ and Plattenteich, T and Schilling, L and Schildbach, G and Hamann, H},
  journal={International Conference on Robotics and Automation (ICRA)},
  year={2022},
  doi={10.1109/ICRA46639.2022.9812417}
}

@article{brambilla:2013,
  title={Swarm robotics: a review from the swarm engineering perspective},
  author={Brambilla, M and Ferrante, E and Birattari, M and Dorigo, M},
  journal={Swarm Intell},
  year={2013},
  doi={10.1007/s11721-012-0075-2}
}

repository: mrsonandrade/pyswarming

repo_name: mrsonandrade/pyswarming


text:
DESCRIPTION = "Units to initialize usb gadgets"

PR = "r19"

LICENSE = "MIT"
LIC_FILES_CHKSUM = "file://${COREBASE}/LICENSE;md5=3f40d7994397109285ec7b81fdeb3b58"

COMPATIBLE_MACHINE = "(ti33x)"
PACKAGE_ARCH = "${MACHINE_ARCH}"

SRC_URI = "file://storage-gadget-init.service \
           file://network-gadget-init.service \
           file://udhcpd.service \
           file://udhcpd.conf \
           file://bone-gmass-eject.rules \
           file://udhcpd.rules \
           file://g-storage-reinsert.sh \
           file://g-ether-start-service.sh \
           file://g-ether-load.sh \
           file://update-image-info-on-mmcblk0p1.sh \
          "

do_install() {
	install -d ${D}${base_libdir}/systemd/system/basic.target.wants
	install -m 0644 ${WORKDIR}/*.service ${D}${base_libdir}/systemd/system

	for i in ${WORKDIR}/storage-gadget-init.service ; do
		install -m 0644 $i ${D}${base_libdir}/systemd/system
		ln -sf ../$(basename $i) ${D}${base_libdir}/systemd/system/basic.target.wants/
	done

	install -d ${D}${sysconfdir}/udev/rules.d
	install -m 0644 ${WORKDIR}/*.rules ${D}${sysconfdir}/udev/rules.d
	install -m 0644 ${WORKDIR}/*.conf ${D}${sysconfdir}

	install -d ${D}${bindir}
	install -m 0755 ${WORKDIR}/*.sh ${D}${bindir}
}

PACKAGES =+ "${PN}-storage ${PN}-network ${PN}-udhcpd"

ALLOW_EMPTY_${PN} = "1"

FILES_${PN}-storage = "${base_libdir}/systemd/system/storage-gadget-init.service \
                       ${base_libdir}/systemd/system/basic.target.wants/storage-gadget-init.service \
                       ${bindir}/g-storage-reinsert.sh \
                       ${bindir}/update-image-info-on-mmcblk0p1.sh \
                       ${sysconfdir}/udev/rules.d/bone-gmass-eject.rules"

FILES_${PN}-network = "${base_libdir}/systemd/system/network-gadget-init.service \
                       ${base_libdir}/systemd/system/basic.target.wants/network-gadget-init.service \
                       ${bindir}/g-ether-load.sh \
                       ${bindir}/g-ether-start-service.sh \
                       ${sysconfdir}/udev/rules.d/udhcpd.rules"

FILES_${PN}-udhcpd = "${base_libdir}/systemd/system/udhcpd.service \
                      ${base_libdir}/systemd/system/basic.target.wants/udhcpd.service \
                      ${sysconfdir}/udhcpd.conf"

RRECOMMENDS_${PN} = "${PN}-storage ${PN}-network ${PN}-udhcpd"

license: MIT

repository: Angstrom-distribution/meta-ti

license_type: permissive

repo_name: Angstrom-distribution/meta-ti

branch_name: refs/heads/master

gha_license_id: MIT

gha_language: BlitzBasic

extension: bb


text:
require hyperion-image-base.inc

DESCRIPTION = "Standard full-featured Linux system with hyperion"

IMAGE_INSTALL += " \
    packagegroup-basic \
    packagegroup-base \
    packagegroup-core-full-cmdline \
    "

repository: ThomArmax/meta-hyperion

repo_name: ThomArmax/meta-hyperion

gha_language: SourcePawn


text:
// Demo bot built with BearyChat RTM
//
//      ./rtm -rtmToken <your-BearyChat-RTM-token-here>
package main

import (
	"flag"
	"log"
	"time"

	"github.com/bcho/bearychat.go"
)

const (
	RTM_API_BASE = "https://rtm.bearychat.com"
)

var rtmToken string

func main() {
	flag.Parse()

	rtmClient, err := bearychat.NewRTMClient(
		rtmToken,
		bearychat.WithRTMAPIBase(RTM_API_BASE),
	)
	if err != nil {
		log.Fatal(err)
	}

	user, wsHost, err := rtmClient.Start()
	if err != nil {
		log.Fatal(err)
	}

	log.Printf("rtm connected as %s", user.Name)

	rtmLoop, err := bearychat.NewRTMLoop(wsHost)
	if err != nil {
		log.Fatal(err)
	}

	if err := rtmLoop.Start(); err != nil {
		log.Fatal(err)
	}
	defer rtmLoop.Stop()

	go rtmLoop.Keepalive(time.NewTicker(2 * time.Second))

	errC := rtmLoop.ErrC()
	messageC, err := rtmLoop.ReadC()
	if err != nil {
		log.Fatal(err)
	}

	for {
		select {
		case err := <-errC:
			log.Printf("rtm loop error: %+v", err)
			if err := rtmLoop.Stop(); err != nil {
				log.Fatal(err)
			}
			return
		case message := <-messageC:
			if !message.IsChatMessage() {
				continue
			}
			log.Printf(
				"rtm loop received: %s from %s",
				message["text"],
				message["uid"],
			)

			if message.IsFromMe(*user) {
				continue
			}

			if err := rtmLoop.Send(message.Refer("Pardon?")); err != nil {
				log.Fatal(err)
			}
		}
	}
}

func init() {
	flag.StringVar(&rtmToken, "rtmToken", "", "BearyChat RTM token")
}

extension: go


text:
DESCRIPTION = "Emberwind HTML5 is a HTML5 port of the C++ implementation of Emberwind."
HOMEPAGE = "https://github.com/operasoftware/Emberwind"
LICENSE = "BSD-3-Clause"

RDEPENDS_${PN} = "crosswalk"

SRC_URI += "git://github.com/operasoftware/Emberwind.git;rev=78a2811ee9db28bd566427253c3e4fe8a9ac78b3 \
    file://manifest.json \
    file://emberwind.desktop \
    file://emberwind"

S = "${WORKDIR}/git"

LIC_FILES_CHKSUM = "file://${S}/LICENSE;md5=5706b15318cb4073ca7b04aa1e74620d"

do_install() {
    install -d ${D}${libdir}/emberwind/
    install -m 0644 ${S}/icon_114x114.png ${D}${libdir}/emberwind
    install -m 0644 ${S}/index.html ${D}${libdir}/emberwind
    install -m 0644 ${WORKDIR}/manifest.json ${D}${libdir}/emberwind
    cp -Pr ${S}/resources ${D}${libdir}/emberwind/
    cp -Pr ${S}/src ${D}${libdir}/emberwind/

    install -d ${D}${bindir}/
    install -m 0755 ${WORKDIR}/emberwind ${D}${bindir}/emberwind

    install -d ${D}${datadir}/applications/
    install -m 0644 ${WORKDIR}/emberwind.desktop ${D}${datadir}/applications/emberwind.desktop
}

FILES_${PN} = "${bindir}/emberwind ${datadir}/applications/* ${libdir}/emberwind/*"

repository: joone/meta-crosswalk

repo_name: joone/meta-crosswalk

gha_language: BitBake


text:
DESCRIPTION = "An image for easy evaluation of the TES IP Cores, including a full command line and handy development tools."

include tes-base.inc

IMAGE_INSTALL_append_cyclone5 = " tes-itb-cyclone5"

# Add TES kernel modules
IMAGE_INSTALL += "cdc-mod d2d-mod"
MACHINE_EXTRA_RDEPENDS += "kernel-module-cdc kernel-module-d2d"

#
# Add very handy development tools
#
IMAGE_INSTALL += " pkgconfig gdbserver openssh-sftp-server gdb"
IMAGE_INSTALL += " \
	valgrind \
	devmem2 \
	i2c-tools \
	e2fsprogs-resize2fs \
	sshfs-fuse \
	rsync \
"

#
# Add the TES tutorials and tests
#
#	dnx-integration-test
IMAGE_INSTALL += " \
	smartwatch-demo \
"

#
# Add KMS library test to image (modetest, ...)
#
CORE_IMAGE_EXTRA_INSTALL += " \
	libdrm-tests \
"

#
# Add debugging and developer utilities
#
EXTRA_IMAGE_FEATURES += "debug-tweaks"
EXTRA_IMAGE_FEATURES_tesdebug += "tools-profile dbg-pkgs"
PACKAGE_DEBUG_SPLIT_STYLE_tesdebug = "debug-file-directory"

#
# Inhibit striping (to enable readable profiling tool outputs)
#
INHIBIT_PACKAGE_STRIP_tesdebug = "1"

#
# Add smart package manager
#
#IMAGE_FEATURES += "package-management"

#
# Set EXT3 partition to 2GB == 2097152kB
#
IMAGE_ROOTFS_SIZE = "2097152"

export IMAGE_BASENAME="tes-ip-evalkit-image"

###############################################################################
# SDK section
#

#
# Add Linux Kernel sources to SDK
#
TOOLCHAIN_TARGET_TASK += " \
	kernel-devsrc \
	libdrm-dev \
	smartwatch-demo-devsrc \
"
TOOLCHAIN_HOST_TASK += "nativesdk-kernel-devsrc-env"

repository: c-thaler/meta-tes

repo_name: c-thaler/meta-tes


text:
DESCRIPTION = "A mode switching tool for controlling 'flip flop' (multiple device) USB gear"
LICENSE = "GPLv2"
LIC_FILES_CHKSUM = "file://COPYING;md5=94d55d512a9ba36caa9b7df079bae19f"

DEPENDS = "virtual/libusb0"

SRC_URI = "http://www.draisberghof.de/usb_modeswitch/usb-modeswitch-${PV}.tar.bz2 \
           file://0001-usbmodeswitch-leave-stripping-to-packager.patch \
           file://0002-usb-modeswitch-leave-script-munging-to-recipe.patch"
SRC_URI[md5sum] = "c393603908eceab95444c5bde790f6f0"
SRC_URI[sha256sum] = "ce47a3dec3e4c93e0a2fcea64278d0e289e6e78d8e1381c54f03986e443ab90f"

do_install() {
    sed 's_!/usr/bin_!'"${bindir}"'_' <usb_modeswitch.tcl >usb_modeswitch_dispatcher
    oe_runmake install DESTDIR=${D}
}

FILES_${PN} = "${bindir} ${sysconfdir} ${base_libdir}/udev/usb_modeswitch ${sbindir} ${localstatedir}/lib/usb_modeswitch"
RDEPENDS_${PN} = "tcl"
RRECOMMENDS_${PN} = "usb-modeswitch-data"

repository: linkessence/Galileo

repo_name: linkessence/Galileo


text:
SUMMARY = "Extended Module Player Library"
HOMEPAGE = "http://xmp.sourceforge.net/"
LICENSE = "LGPL-2.1-only"
LIC_FILES_CHKSUM = "file://README;beginline=59;md5=9cee4cd08e9762f4a8fda61cb39d430d"

inherit autotools-brokensep pkgconfig

SRC_URI = "${SOURCEFORGE_MIRROR}/project/xmp/${BPN}/${PV}/${BPN}-${PV}.tar.gz"
SRC_URI[md5sum] = "3a2afcbbb720fb2931e79aeb66e724f7"
SRC_URI[sha256sum] = "353535cc84c8cddae8decec4e65fa4c51fc64f22eb0891bc3dae6eaf25f9cccf"

repository: schnitzeltony/meta-musicians

repo_name: schnitzeltony/meta-musicians


text:
package alias

import "strings"

type Alias struct {
	// alias' key
	Name string
	// whole command
	Command []string

	// list of args in the command
	args []string
}

func (a *Alias) computeArgs() {
	a.args = []string{}
	for _, cmd := range a.Command {
		argSplitterIndex := strings.Index(cmd, "=")
		if argSplitterIndex != -1 {
			a.args = append(a.args, cmd[:argSplitterIndex])
		}
	}
}

func (a *Alias) Args() []string {
	if a.args == nil {
		a.computeArgs()
	}
	return a.args
}

repository: scaleway/scaleway-cli

repo_name: scaleway/scaleway-cli

gha_language: Go


text:
// Code generated by go-swagger; DO NOT EDIT.

package models

// This file was generated by the swagger tool.
// Editing this file might prove futile when you re-run the swagger generate command

import (
	"github.com/go-openapi/strfmt"
	"github.com/go-openapi/swag"
)

// DatacenterSpecGCP DatacenterSpecGCP describes a GCP datacenter
//
// swagger:model DatacenterSpecGCP
type DatacenterSpecGCP struct {

	// Region to use, for example "europe-west3", for a full list of regions see
	// https://cloud.google.com/compute/docs/regions-zones/
	Region string `json:"region,omitempty"`

	// Optional: Regional clusters spread their resources across multiple availability zones.
	// Refer to the official documentation for more details on this:
	// https://cloud.google.com/kubernetes-engine/docs/concepts/regional-clusters
	Regional bool `json:"regional,omitempty"`

	// List of enabled zones, for example [a, c]. See the link above for the available
	// zones in your chosen region.
	ZoneSuffixes []string `json:"zone_suffixes"`
}

// Validate validates this datacenter spec g c p
func (m *DatacenterSpecGCP) Validate(formats strfmt.Registry) error {
	return nil
}

// MarshalBinary interface implementation
func (m *DatacenterSpecGCP) MarshalBinary() ([]byte, error) {
	if m == nil {
		return nil, nil
	}
	return swag.WriteJSON(m)
}

// UnmarshalBinary interface implementation
func (m *DatacenterSpecGCP) UnmarshalBinary(b []byte) error {
	var res DatacenterSpecGCP
	if err := swag.ReadJSON(b, &res); err != nil {
		return err
	}
	*m = res
	return nil
}

repository: baurmatt/go-kubermatic

repo_name: baurmatt/go-kubermatic


text:
DESCRIPTION = "Apache Portable Runtime (APR) companion library"
SECTION = "libs"
DEPENDS = "apr expat gdbm"
MAINTAINER = "Mustafa Yuecel <yuecelm@ee.ethz.ch>"
LICENSE = "Apache License, Version 2.0"

PR = "r0"

# apache mirrors?
SRC_URI = "http://mirror.switch.ch/mirror/apache/dist/apr/${P}.tar.gz"

EXTRA_OECONF = "--with-apr=${STAGING_BINDIR} --with-dbm=gdbm --with-gdbm=${STAGING_DIR}/${HOST_SYS} --with-expat=${STAGING_DIR}/${HOST_SYS}"

inherit autotools lib_package binconfig

do_configure() {
  oe_runconf
}

do_stage() {
  oe_libinstall -a -so -C .libs libaprutil-1 ${STAGING_LIBDIR}
}

repository: Terentyev/familiar-linux

repo_name: Terentyev/familiar-linux


text:
package model

import (
	"encoding/json"

	"strings"
)

type ResetReplicaReqPartitions struct {
	// 分区ID。

	Partition *int32 `json:"partition,omitempty"`
	// 副本期望所在的broker ID。其中Array首位为leader副本，所有分区需要有同样数量的副本，副本数不能大于总broker的数量。

	Replicas *[]int32 `json:"replicas,omitempty"`
}

func (o ResetReplicaReqPartitions) String() string {
	data, err := json.Marshal(o)
	if err != nil {
		return "ResetReplicaReqPartitions struct{}"
	}

	return strings.Join([]string{"ResetReplicaReqPartitions", string(data)}, " ")
}


text:
require qt5-${PV}.inc
require ${PN}.inc

SRC_URI[md5sum] = "393a352f82f1f0000157834751a29578"
SRC_URI[sha256sum] = "772d230019c52452dc661e864debf1fd520460bddce8d8abda70a4dcc00e8d5f"


text:
@article{pmid32830215,
 author = {Geelhoed, B.  and Börschel, C. S.  and Niiranen, T.  and Palosaari, T.  and Havulinna, A. S.  and Fouodo, C. J. K.  and Scheinhardt, M. O.  and Blankenberg, S.  and Jousilahti, P.  and Kuulasmaa, K.  and Zeller, T.  and Salomaa, V.  and Schnabel, R. B. },
 journal = {Europace},
 month = {10},
 number = {10},
 pages = {1463--1469},
 title = {Assessment of causality of natriuretic peptides and atrial fibrillation and heart failure: a Mendelian randomization study in the FINRISK cohort},
 volume = {22},
 year = {2020}
}

repository: hypertensioncenter/academic-kickstart

repo_name: hypertensioncenter/academic-kickstart

gha_language: TeX

extension: bib


text:
% This file was created with JabRef 2.7.
% Encoding: UTF8

@article{muller2001design,
	title={Design and analysis of low-complexity interference mitigation on vector channels},
	author={Muller, Ralf R and Verd{\'u}, Sergio},
	journal={IEEE Journal on Selected Areas in Communications},
	volume={19},
	number={8},
	pages={1429--1441},
	year={2001},
	publisher={Citeseer}
}

@article{hachem2004simple,
	title={Simple polynomial detectors for CDMA downlink transmissions on frequency-selective channels},
	author={Hachem, Walid},
	journal={IEEE Transactions on Information Theory},
	volume={50},
	number={1},
	pages={164--171},
	year={2004},
	publisher={IEEE}
}

@article{yang2015fifty,
	title={Fifty years of MIMO detection: The road to large-scale MIMOs},
	author={Yang, Shaoshi and Hanzo, Lajos},
	journal={IEEE Communications Surveys \& Tutorials},
	volume={17},
	number={4},
	pages={1941--1988},
	year={2015},
	publisher={IEEE}
}

@article{lu2015low,
	title={Low complexity polynomial expansion detector with deterministic equivalents of the moments of channel Gram matrix for massive MIMO uplink},
	author={Lu, An-An and Gao, Xiqi and Zheng, Yahong Rosa and Xiao, Chengshan},
	journal={IEEE Transactions on Communications},
	volume={64},
	number={2},
	pages={586--600},
	year={2015},
	publisher={IEEE}
}

@article{tang2016high,
	title={High precision low complexity matrix inversion based on Newton iteration for data detection in the massive MIMO},
	author={Tang, Chuan and Liu, Cang and Yuan, Luechao and Xing, Zuocheng},
	journal={IEEE Communications Letters},
	volume={20},
	number={3},
	pages={490--493},
	year={2016},
	publisher={IEEE}
}

@article{chen2017low,
	title={A low complexity data detection algorithm for uplink multiuser massive MIMO systems},
	author={Chen, Jung-Chieh},
	journal={IEEE Journal on Selected Areas in Communications},
	volume={35},
	number={8},
	pages={1701--1714},
	year={2017},
	publisher={IEEE}
}

@article{zhang2018recent,
	title={Recent Research on Massive MIMO Propagation Channels: A Survey},
	author={Zhang, Ping and Chen, Jianqiao and Yang, Xiaoli and Ma, Nan and Zhang, Zhi},
	journal={IEEE Communications Magazine},
	volume={56},
	number={12},
	pages={22--29},
	year={2018},
	publisher={IEEE}
}

@ARTICLE{LuAnAn,
	author={A. {Lu} and X. {Gao} and Y. R. {Zheng} and C. {Xiao}},
	journal={IEEE Transactions on Communications},
	title={Low Complexity Polynomial Expansion Detector With Deterministic Equivalents of the Moments of Channel Gram Matrix for Massive MIMO Uplink},
	year={2016},
	volume={64},
	number={2},
	pages={586-600},
	keywords={antenna arrays;communication complexity;correlation methods;higher order statistics;least mean squares methods;mathematical operators;MIMO communication;polynomial approximation;polynomial matrices;radio links;Rician channels;signal detection;low complexity polynomial expansion detector;deterministic equivalents;channel gram matrix moments;massive MIMO uplink;low complexity PE detector;multiple-input multiple-output uplink channel;user equipments;multiple antenna UE;base station;jointly correlated Rician fading channel;computational complexity reduction;minimum mean square error detector;MMSE detector;approximate matrix polynomial coefficient computation;operator-valued free probability;operator-valued moment-cumulant formula;Detectors;MIMO;Matrices;Complexity theory;Antennas;Polynomials;Uplink;Operator-valued free probability;massive multi input multi-output (MIMO);deterministic equivalent;polynomial expansion (PE) detector;Operator-valued free probability;massive multi-input multi-output (MIMO);deterministic equivalent;polynomial expansion (PE) detector},
	doi={10.1109/TCOMM.2015.2506700},
	ISSN={0090-6778},
	month={Feb},}

@ARTICLE{SunchenBD,
	author={C. {Sun} and X. {Gao} and S. {Jin} and M. {Matthaiou} and Z. {Ding} and C. {Xiao}},
	journal={IEEE Transactions on Communications},
	title={Beam Division Multiple Access Transmission for Massive MIMO Communications},
	year={2015},
	volume={63},
	number={6},
	pages={2170-2184},
	keywords={antenna arrays;array signal processing;channel estimation;correlation methods;matrix algebra;mean square error methods;MIMO communication;multi-access systems;radio transceivers;statistical analysis;wireless channels;beam division multiple access transmission scheme;massive MIMO communications;multicarrier multiuser multiple-input multiple-output systems;MU-MIMO systems;base station;fully correlated channel matrix;beam domain channel model;channel gains;closed-form upper bound;ergodic sum-rate;optimal downlink transmission;statistical channel state information;BDMA transmission scheme;multiple single-user MIMO channels;channel estimation overhead reduction;mean square error minimization;optimal pilot design criterion;MSE;Zadoff-Chu sequence utilization;Covariance matrices;Upper bound;MIMO;Antennas;Downlink;Symmetric matrices;Arrays;Beam division multiple access (BDMA);massive MIMO;statistical channel state information (CSI);sum-rate upper bound;Beam division multiple access (BDMA);massive MIMO;statistical channel state information (CSI);sum-rate upper bound},
	doi={10.1109/TCOMM.2015.2425882},
	ISSN={0090-6778},
	month={June},}

@ARTICLE{LixiaoS,
	author={X. {Gao} and B. {Jiang} and X. {Li} and A. B. {Gershman} and M. R. {McKay}},
	journal={IEEE Transactions on Information Theory},
	title={Statistical Eigenmode Transmission Over Jointly Correlated MIMO Channels},
	year={2009},
	volume={55},
	number={8},
	pages={3735-3750},
	keywords={convex programming;eigenvalues and eigenfunctions;iterative methods;matrix algebra;MIMO communication;statistical analysis;wireless channels;statistical eigenmode transmission;jointly correlated MIMO channel;statistical channel state information;ergodic capacity;eigenmode channel coupling matrix;convex optimization technique;iterative water-filling algorithm;closed-form tight upper bound;MIMO;Transmitters;Upper bound;Sensor arrays;Channel state information;Councils;Fading;Statistics;Signal processing algorithms;Iterative algorithms;Capacity bound;convex optimization;ergodic capacity;multiple-input multiple-output (MIMO) channel;permanents;power allocation;statistical eigenmode transmission},
	doi={10.1109/TIT.2009.2023737},
	ISSN={0018-9448},
	month={Aug},}

@ARTICLE{SunboAngle,
	author={X. {Sun} and X. {Gao} and G. Y. {Li} and W. {Han}},
	journal={IEEE Transactions on Vehicular Technology},
	title={Single-Site Localization Based on a New Type of Fingerprint for Massive MIMO-OFDM Systems},
	year={2018},
	volume={67},
	number={7},
	pages={6134-6145},
	keywords={data compression;indoor radio;matrix algebra;MIMO communication;OFDM modulation;pattern clustering;massive MIMO-OFDM systems;mobile devices;rich scattering environments;fingerprint-based single-site localization method;massive multiple-input multiple-output orthogonal frequency-division multiplexing systems;angle delay channel power matrix fingerprint;instantaneous channel state information;delay domains;fingerprint similarity criterion;efficient location estimation method;fingerprint compression method;two-stage fingerprint clustering algorithm;location-based services;matching complexity;storage overhead reduction;database preprocessing;Wireless communication;Estimation;Databases;Delays;Wireless sensor networks;Discrete Fourier transforms;Computational complexity;Fingerprint localization;massive MIMO-OFDM;fingerprint compression;database preprocessing},
	doi={10.1109/TVT.2018.2813058},
	ISSN={0018-9545},
	month={July},}

@ARTICLE{Youli1,
	author={L. {You} and X. {Gao} and A. L. {Swindlehurst} and W. {Zhong}},
	journal={IEEE Transactions on Signal Processing},
	title={Channel Acquisition for Massive MIMO-OFDM With Adjustable Phase Shift Pilots},
	year={2016},
	volume={64},
	number={6},
	pages={1461-1476},
	keywords={antenna arrays;channel estimation;mean square error methods;MIMO communication;OFDM modulation;telecommunication scheduling;channel acquisition;massive MIMO-OFDM;adjustable phase shift pilot;APSP;massive multiple-input multiple-output system;orthogonal frequency division multiplexing;pilot overhead reduction;channel space-frequency correlation;channel power angle-delay spectrum;channel sparsity;massive antenna array;channel estimation;channel prediction;mean square error;channel power distribution;pilot phase shift scheduling algorithm;symbol data model;spectral efficiency;phase shift orthogonal pilot approach;Channel estimation;OFDM;MIMO;Channel models;Delays;Arrays;Wireless communication;Adjustable phase shift pilots;channel acquisition;channel estimation;channel prediction;massive MIMO-OFDM;pilot phase shift scheduling},
	doi={10.1109/TSP.2015.2502550},
	ISSN={1053-587X},
	month={March},}

@ARTICLE{Youli2,
	author={L. {You} and X. {Gao} and X. {Xia} and N. {Ma} and Y. {Peng}},
	journal={IEEE Transactions on Wireless Communications},
	title={Pilot Reuse for Massive MIMO Transmission over Spatially Correlated Rayleigh Fading Channels},
	year={2015},
	volume={14},
	number={6},
	pages={3352-3366},
	keywords={channel estimation;mean square error methods;MIMO communication;Rayleigh channels;statistical analysis;telecommunication scheduling;massive MIMO transmission;spatially correlated Rayleigh fading channels;pilot reuse;massive multiuser multiple-input multiple-output transmission;channel spatial correlations;channel power angle spectrum;sum mean square error;channel estimation;closed-form robust multiuser uplink receiver;downlink precoder;low complexity pilot scheduling algorithm;channel statistics;Channel estimation;MIMO;Covariance matrices;Arrays;Training;Robustness;Wireless communication;Pilot reuse;massive MIMO;multiuser MIMO;pilot scheduling;robust transmission;Pilot reuse;massive MIMO;multiuser MIMO;pilot scheduling;robust transmission},
	doi={10.1109/TWC.2015.2404839},
	ISSN={1536-1276},
	month={June},}

@ARTICLE{SICD,
	author={P. {Patel} and J. {Holtzman}},
	journal={IEEE Journal on Selected Areas in Communications},
	title={Analysis of a simple successive interference cancellation scheme in a DS/CDMA system},
	year={1994},
	volume={12},
	number={5},
	pages={796-807},
	keywords={spread spectrum communication;radiofrequency interference;interference suppression;code division multiple access;signal detection;phase shift keying;parameter estimation;diversity reception;fading;DS/CDMA system;near/far effects compensation;power control;fading;multiuser detection;channel estimates;channel parameters;received amplitude;received phase;successive interference cancellation;coherent BPSK modulation;parameter estimation;linear correlator;noncoherent modulation;Mary orthogonal modulation;multipath diversity combining;Interference cancellation;Parameter estimation;Correlators;Diversity reception;Multiaccess communication;Power control;Fading;Multiuser detection;Amplitude estimation;Phase estimation},
	doi={10.1109/49.298053},
	ISSN={0733-8716},
	month={June},}

@ARTICLE{PIC,
	author={D. {Divsalar} and M. K. {Simon} and D. {Raphaeli}},
	journal={IEEE Transactions on Communications},
	title={Improved parallel interference cancellation for CDMA},
	year={1998},
	volume={46},
	number={2},
	pages={258-268},
	keywords={code division multiple access;interference suppression;parallel processing;computational complexity;channel capacity;Gaussian channels;phase shift keying;pseudonoise codes;signal processing;multipath channels;spread spectrum communication;radiofrequency interference;code-division multiple access;CDMA;nonlinear parallel interference cancellation;linear implementation complexity;parallel processing;reliability;estimated received data;user interference generation;user interference cancellation;simulation results;AWGN channel;binary phase-shift keying;BPSK data modulation;PN code;multipath channel;tentative decision devices;spread spectrum communication;Interference cancellation;Multiaccess communication;Signal processing;Parallel processing;Spread spectrum communication;Additive noise;Decorrelation;Propulsion;Laboratories;Space technology},
	doi={10.1109/26.659484},
	ISSN={0090-6778},
	month={Feb},}

@ARTICLE{MICD,
	author={ {Jianfeng Weng} and {Guoqiang Xue} and {Tho Le-Ngoc} and S. {Tahar}},
	journal={IEEE Journal on Selected Areas in Communications},
	title={Multistage interference cancellation with diversity reception for asynchronous QPSK DS/CDMA systems over multipath fading channels},
	year={1999},
	volume={17},
	number={12},
	pages={2162-2180},
	keywords={quadrature phase shift keying;code division multiple access;spread spectrum communication;diversity reception;Rayleigh channels;intersymbol interference;error statistics;interference suppression;multipath channels;multistage interference cancellation;diversity reception;QPSK;DS/CDMA systems;multiple-access interference;quadrature phase shift keying;asynchronous direct-sequence code division multiple access;frequency-selective multipath fading channels;Rayleigh fading channels;self-interference;intersymbol interference;symbol decision;RAKE combining;bit error probability;Gaussian approximation;characteristic function method;channel estimation error effects;Interference cancellation;Diversity reception;Microwave integrated circuits;Multiple access interference;Quadrature phase shift keying;Multiaccess communication;Fading;Intersymbol interference;Channel estimation;Frequency conversion},
	doi={10.1109/49.814833},
	ISSN={0733-8716},
	month={Dec},}

@INPROCEEDINGS{DFD,
	author={M. {Magarini} and A. {Spalvieri} and G. {Tartara}},
	booktitle={11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525)},
	title={Comparison between two methods for delayed decision feedback sequence estimation},
	year={2000},
	volume={2},
	number={},
	pages={1300-1304 vol.2},
	keywords={delays;feedback;maximum likelihood sequence estimation;data communication;matched filters;filtering theory;radio receivers;delayed decision feedback sequence estimation;suboptimal receiver design;data transmission;frequency selective channels;maximum likelihood sequence estimation;MLSE;truncated channel memory;suboptimal reception;DDFSE;Viterbi processor;per-survivor decision feedback equalizer;mean-square whitened matched filter;simulation results;wideband communication services;radio systems;Delay estimation;Maximum likelihood estimation;Decision feedback equalizers;Matched filters;Viterbi algorithm;Frequency estimation;Bit error rate;Data communication;Wideband;Mobile communication},
	doi={10.1109/PIMRC.2000.881629},
	ISSN={},
	month={Sep.},}

@INPROCEEDINGS{PDADector,
	author={ {Yang Xiaohui} and {Wang Yi} and {Li Lihua} and {Zhang Ping}},
	booktitle={Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.},
	title={MIMO-PDA detector for TD-SCDMA-MIMO system},
	year={2005},
	volume={1},
	number={},
	pages={147-150},
	keywords={time division multiple access;code division multiple access;MIMO systems;3G mobile communication;multiuser detection;antenna arrays;probability;TD-SCDMA-MIMO system;multiple input multiple output;3GPP;probabilistic data association;multiuser detection;multiple antennas processing;Detectors;MIMO;Time division synchronous code division multiple access;Personal digital assistants;Channel estimation;Multiuser detection;Multiaccess communication;Transmitting antennas;Detection algorithms;Receiving antennas},
	doi={10.1109/WCNM.2005.1544004},
	ISSN={2161-9646},
	month={Sep.},}

@INPROCEEDINGS{LRDetector,
	author={I. {Liu} and C. {Liao} and F. {Lan} and Y. {Huang}},
	booktitle={2012 IEEE Asia Pacific Conference on Circuits and Systems},
	title={Low-complexity lattice reduction architecture using interpolation-based QR decomposition for MIMO-OFDM systems},
	year={2012},
	volume={},
	number={},
	pages={224-227},
	keywords={error statistics;interpolation;matrix algebra;MIMO communication;OFDM modulation;low-complexity lattice reduction architecture;interpolation-based QR decomposition;MIMO-OFDM system;LR technique;orthogonal-frequency division-multiplexing system;iteration loop;lattice matrix;BER performance;3GPP-LTE system;Lattices;MIMO;Signal to noise ratio;Abstracts;Complexity theory;Lattice Reduction;QR decomposition;LLL algorithm;MIMO;OFDM},
	doi={10.1109/APCCAS.2012.6419012},
	ISSN={},
	month={Dec},}

@INPROCEEDINGS{DFD2,
	author={A. {Duel-Hallen}},
	booktitle={Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference},
	title={Performance of multiuser zero-forcing and MMSE decision-feedback detectors for CDMA channels},
	year={1993},
	volume={},
	number={},
	pages={82-86 vol.4},
	keywords={code division multiple access;maximum likelihood estimation;signal detection;fading;telecommunication channels;feedback;white noise;radio receivers;multiuser zero-forcing detector;MMSE decision-feedback detectors;CDMA channels;interference rejection;code-division multiple-access;minimum mean square error;multiuser decision-feedback detectors;partial feedback;full feedback;maximum-likelihood detector;white noise;channel model;two-stage receivers;linear decorrelating detector;channel conditions;performance analysis;flat Rayleigh fading channel;asynchronous channel;Detectors;Multiaccess communication;Multiple access interference;Mean square error methods;Feedback;Maximum likelihood detection;White noise;Decorrelation;Performance analysis;Code division multiplexing},
	doi={10.1109/GLOCOM.1993.318433},
	ISSN={},
	month={Nov},}


text:
@inproceedings{10.1145/3247202,
author = {Polyzotis, Neoklis},
title = {Session Details: Data Mining and Clustering},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3247202},
doi = {10.1145/3247202},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
numpages = {1},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458504,
author = {Hu, Meishan and Sun, Aixin and Lim, Ee-Peng},
title = {Event Detection with Common User Interests},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458504},
doi = {10.1145/1458502.1458504},
abstract = {In this paper, we aim at detecting events of common user interests from huge volume of user-generated content. The degree of interest from common users in an event is evidenced by a significant surge of event-related queries issued to search for documents (e.g., news articles, blog posts) relevant to the event. Taking the stream of queries from users and the stream of documents as input, our proposed framework seamlessly integrates the two streams into a single stream of query profiles. A query profile is a set of documents matching a query at a given time. With the single stream of query profiles, the well-studied techniques in event detection (e.g., incremental clustering) could be easily applied. In our experiments using real data collected from Blog and News search engines respectively, the proposed technique achieved very high event detection accuracy.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {1–8},
numpages = {8},
keywords = {query profile, blog, event detection, popular queries},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458505,
author = {Senellart, Pierre and Mittal, Avin and Muschick, Daniel and Gilleron, R\'{e}mi and Tommasi, Marc},
title = {Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458505},
doi = {10.1145/1458502.1458505},
abstract = {We present an original approach to the automatic induction of wrappers for sources of the hidden Web that does not need any human supervision. Our approach only needs domain knowledge expressed as a set of concept names and concept instances. There are two parts in extracting valuable data from hidden-Web sources: understanding the structure of a given HTML form and relating its fields to concepts of the domain, and understanding how resulting records are represented in an HTML result page. For the former problem, we use a combination of heuristics and of probing with domain instances; for the latter, we use a supervised machine learning technique adapted to tree-like information on an automatic, imperfect, and imprecise, annotation using the domain knowledge. We show experiments that demonstrate the validity and potential of the approach.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {9–16},
numpages = {8},
keywords = {wrapper, probing, web service, deep web, form, hidden web, information extraction, invisible web},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458506,
author = {Shnaiderman, Lila and Shmueli, Oded and Bordawekar, Rajesh},
title = {PIXSAR: Incremental Reclustering of Augmented XML Trees},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458506},
doi = {10.1145/1458502.1458506},
abstract = {XML is one of the primary encoding schemes for data and knowledge. We investigate incremental physical data clustering in systems that store XML documents using a native format. We formulate the XML clustering problem as an augmented (with sibling edges) tree partitioning problem and propose the PIXSAR (Practical Incremental XML Sibling Augmented Reclustering) algorithm for incrementally clustering XML documents. We show the fundamental importance of workload-driven dynamically rearranging storage.PIXSAR incrementally executes reclustering operations on selected subgraphs of the global augmented document tree. The subgraphs are implied by significant changes in the workload. As the workload changes, PIXSAR incrementally djusts the XML data layout so as to better fit the workload. PIXSAR's main parameters are the radius, in pages, of the augmented portion to be reclustered and the way reclustering is triggered. We briefly explore some of the effects of indexes; a full treatment of indexes is the subject of another paper.We use an experimental data clustering system that includes a fast disk simulator and File System simulator for storing native XML data. We use a novel method for 'exporting' the Saxon query processor into our setting. Experimental results indicate that using PIXSAR significantly reduces the number of page faults (counting ALL page faults incurred while querying the document as well as maintenance operations) thereby resulting in improved query performance.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {17–24},
numpages = {8},
keywords = {XML, reclustering, incremental},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458507,
author = {Zhu, Jianhan},
title = {A Study of the Relationship between Ad Hoc Retrieval and Expert Finding in Enterprise Environment},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458507},
doi = {10.1145/1458502.1458507},
abstract = {Ad hoc retrieval returns a ranked list of documents in response to a search query, while expert finding returns a ranked list of people in response to an expertise request in the form of a search query, e.g., "information retrieval". In current state of the art expert finding approaches, ad hoc retrieval is a key component for locating documents relevant to the expertise request. While ad hoc retrieval has been well researched in information retrieval, no previous work has been carried out on the effects of document retrieval in expert finding. The main contribution of this paper is that we are the first to study the effect of document retrieval in expert finding via a background smoothing parameter in a language modeling approach and two document features, namely, anchor text and indegree. Our research gives insight into how to design an effective approach for both ad hoc retrieval and expert finding in enterprise environment. Our experiments on the TREC (Text REtrieval Conference) 2007 Enterprise Track CSIRO (Australian Commonwealth Scientific and Research Organization) dataset shows that background smoothing helps improve ad hoc retrieval but does not help or even hurt expert finding, anchor text helps expert finding but hurt ad hoc retrieval when weighted high, and indegree helps expert finding but does not help improve ad hoc retrieval significantly.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {25–30},
numpages = {6},
keywords = {ad hoc retrieval, expert finding, language models},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458508,
author = {Huang, Shen and Wu, Xiaoyuan and Bolivar, Alvaro},
title = {The Effect of Title Term Suggestion on E-Commerce Sites},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458508},
doi = {10.1145/1458502.1458508},
abstract = {Most E-Commerce websites rely on title keyword search to accurately retrieve the items for sale in a particular category. We have found that the titles of many items on eBay are shortened or not very specific, which leads to ineffective results when searched. One possible solution is to recommend the sellers relevant and informative terms for title expansion without any change of search function. The related technique has been explored in previous work such as query expansion and keyword suggestion. In this paper, we study the effect of term suggestion on title-based search. A frequently used approach, co-occurrence, is tested on a dataset collected from eBay website (www.ebay.com). Besides, for suggestion algorithm, we take into account three particular features in our application scenario, including concept term, description relevance and chance-to-be viewed. Although the experiments are conducted on eBay data, we believe that considering E-Commerce particularities will help us to customize the suggestion according to the requirements of web commerce.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {31–38},
numpages = {8},
keywords = {term suggestion, e-commerce, keyword suggestion},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/3247203,
author = {Chan, Chee-Yong},
title = {Session Details: System Issues},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3247203},
doi = {10.1145/3247203},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
numpages = {1},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458510,
author = {Klein, Martin and Nelson, Michael L.},
title = {A Comparison of Techniques for Estimating IDF Values to Generate Lexical Signatures for the Web},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458510},
doi = {10.1145/1458502.1458510},
abstract = {For bounded datasets such as the TREC Web Track the computation of term frequency (TF) and inverse document frequency (IDF) is not difficult. However, since IDF cannot be directly calculated for the entire web, it must be estimated. We see a need to estimate accurate IDF values to generate TF-IDF based lexical signatures (LSs) of web pages. Future applications for generating such LSs require a real time IDF computation. Therefore we conducted a comparison study of different methods to estimate IDF values of web pages. Our objective is to investigate how accurate these estimation methods are compared to the a baseline. We use the Google N-grams as our baseline and compare it against two IDF estimation techniques which are based on: 1) a "local universe" consisting of textual content and the according document frequencies from copies of URLs from the Internet Archive and 2) "screen scraping", a technique to query the Google web interface for document frequencies. We found a term overlap of 70 to 80% between the results of the two methods and the baseline. We further discovered a great agreement in rank correlation of TF-IDF ranked terms between our methods. Kendall τ is approximately 0.8 and the M-Score (penalizing discordances in higher ranks) is even higher, it peaks at well above 0.9. These preliminary results lead us to the conclusion that both methods are appropriate for creating accurate IDF values for web pages.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {39–46},
numpages = {8},
keywords = {lexical signature, inverse document frequency},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458511,
author = {Marin, Mauricio and Paredes, Rodrigo and Bonacic, Carolina},
title = {High-Performance Priority Queues for Parallel Crawlers},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458511},
doi = {10.1145/1458502.1458511},
abstract = {Large scale data centers for crawlers are able to maintain a very large number of active http connections in order to download as fast as possible the usually huge number of web pages from given sections of the WWW. This generates a continuous stream of new URLs of documents to be downloaded and it is clear that the associated work-load can only be served efficiently with proper parallel computing techniques. The incoming new URLs have to be organized by a priority measure in order to download the most relevant documents first. Efficiently managing them along with other synchronization issues such as URLs downloaded by different processing nodes forming a cluster of computers are the matters of this paper. We propose efficient and scalable strategies which consider intra-node multi-core multi-threading on an inter-nodes distributed memory environment, including efficient use of secondary memory.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {47–54},
numpages = {8},
keywords = {priority queues, parallel and distributed computing},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458512,
author = {Garcia-Alvarado, Carlos and Ordonez, Carlos},
title = {Information Retrieval from Digital Libraries in SQL},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458512},
doi = {10.1145/1458502.1458512},
abstract = {Information retrieval techniques have been traditionally exploited outside of relational database systems, due to storage overhead, the complexity of programming them inside the database system, and their slow performance in SQL implementations. This project supports the idea that searching and querying digital libraries with information retrieval models in relational database systems can be performed with optimized SQL queries and User-Defined Functions. In our research, we propose several techniques divided into two phases: storing and retrieving. The storing phase includes executing document pre-processing, stop-word removal and term extraction, and the retrieval phase is implemented with three fundamental IR models: the popular Vector Space Model, the Okapi Probabilistic Model, and the Dirichlet Prior Language Model. We conduct experiments using article abstracts from the DBLP bibliography and the ACM Digital Library. We evaluate several query optimizations, compare the on-demand and the static weighting approaches, and we study the performance with conjunctive and disjunctive queries with the three ranking models. Our prototype proved to have linear scalability and a satisfactory performance with medium-sized document collections. Our implementation of the Vector Space Model is competitive with the two other models.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {55–62},
numpages = {8},
keywords = {documents, SQL, query optimization, ranking},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458513,
author = {Doka, Katerina and Tsoumakos, Dimitrios and Koziris, Nectarios},
title = {HiPPIS: An Online P2P System for Efficient Lookups on d-Dimensional Hierarchies},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458513},
doi = {10.1145/1458502.1458513},
abstract = {In this paper we describe HiPPIS, a system that enables efficient storage and on-line querying of multidimensional data organized into concept hierarchies and dispersed over a network. Our scheme utilizes an adaptive algorithm that automatically adjusts the level of indexing according to the granularity of the incoming queries, without assuming any prior knowledge of the workload. Efficient roll-up and drill-down operations take place in order to maximize the performance by minimizing query flooding. Extensive experimental evaluations show that, on top of the advantages that a distributed storage offers, our method answers the large majority of incoming queries, both point and aggregate ones, without flooding the network. At the same time, it manages to preserve the hierarchical nature of data. These characteristics are maintained even after sudden shifts in the workload.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {63–70},
numpages = {8},
keywords = {distributed hash table, data warehousing, concept hierarchies},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458514,
author = {Karnstedt, Marcel and Sattler, Kai-Uwe and Ha\ss{}, Michael and Hauswirth, Manfred and Sapkota, Brahmananda and Schmidt, Roman},
title = {Approximating Query Completeness by Predicting the Number of Answers in DHT-Based Web Applications},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458514},
doi = {10.1145/1458502.1458514},
abstract = {Due to the rapid development of theWeb, applications based on the P2P paradigm gain more and more interest. Recently, such systems start to evolve to adopt standard database functionalities in terms of complex query processing support. This goes far beyond simple key lookups, as provided by standard DHT systems, which makes estimating the completeness of query answers a crucial challenge. In this paper, we discuss the semantics of completeness for complex queries in P2P database systems and propose methods based on the notion of routing graphs for estimating the number of expected query answers. Further, we discuss probabilistic guarantees for the estimated values and evaluate the proposed methods through an implemented system.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {71–78},
numpages = {8},
keywords = {query processing, query completeness, probabilistic guarantees, dht},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/3247204,
author = {Polyzotis, Neoklis},
title = {Session Details: Web 2.0 and Social Networks},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3247204},
doi = {10.1145/3247204},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
numpages = {1},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458516,
author = {Kinsella, Sheila and Budura, Adriana and Skobeltsyn, Gleb and Michel, Sebastian and Breslin, John G. and Aberer, Karl},
title = {From Web 1.0 to Web 2.0 and Back -: How Did Your Grandma Use to Tag?},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458516},
doi = {10.1145/1458502.1458516},
abstract = {We consider the applicability of terms extracted from anchortext as a source of Web page descriptions in the form of tags. With a relatively simple and easy-to-use method, we show that anchortext significantly overlaps with tags obtained from the popular tagging portal del.icio.us. Considering the size and diversity of the user community potentially involved in social tagging, this observation is rather surprising. Furthermore, we show by an evaluation using human-created relevance assessments the general suitability of the anchortext tag generation in terms of user-perceived precision values. The awareness of this easy-to-obtain source of tags could trigger the rise of new tagging portals pushed by this automatic bootstrapping process or be applied in already existing portals to increase the number of tags per page by merely looking at the anchortext which exists anyway.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {79–86},
numpages = {8},
keywords = {tag prediction, anchortext, social tagging, Web 2.0},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458517,
author = {Abiteboul, Serge and Greenshpan, Ohad and Milo, Tova},
title = {Modeling the Mashup Space},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458517},
doi = {10.1145/1458502.1458517},
abstract = {We introduce a formal model for capturing the notion of mashup in its globality. The basic component in our model is the mashlet. A mashlet may query data sources, import other mashlets, use external Web services, and specify complex interaction patterns between its components. A mashlet state is modeled by a set of relations and its logic specified by datalog-style active rules. We are primarily concerned with changes in a mashlet state relations and rules. The interactions with users and other applications, as well as the consequent effects on the mashlets composition and behavior, are captured by streams of changes. The model facilitates dynamic mashlets composition, interaction and reuse, and captures the fundamental behavioral aspects of mashups.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {87–94},
numpages = {8},
keywords = {information, integration, model, data, mashups, web},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458518,
author = {Biancalana, Claudio and Micarelli, Alessandro and Squarcella, Claudio},
title = {<i>Nereau</i>: A Social Approach to Query Expansion},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458518},
doi = {10.1145/1458502.1458518},
abstract = {Classical query expansion techniques can be roughly divided into two groups: the statistical approach, which consists of the selection of top-ranked terms from relevant sources based on co-occurrence values, and the semantic approach, where candidate terms are chosen based on their meaning. In this paper we present a novel approach, in which the classical cooccurrence matrix is enhanced with metadata retrieved from social bookmarking services in order to overcome its lack of semantic attributes. The implemented system, named Nereau, combines methods from the areas of Information Retrieval and Social Network Analysis: given the original query, our system performs multiple expansions and presents results divided into categories. We use a new approach to web personalization based on user collaboration sharing of information about web documents. Our evaluation results are encouraging and suggest that personalization based on social bookmarking and tagging is a useful addition to web toolset and that the subject is worth further research, in particular with regard to increasing popularity of social and collaborative services in the WWW today.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {95–102},
numpages = {8},
keywords = {personalized web search, keyword co-occurrences, social bookmarking, keyword exraction, query expansion},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458519,
author = {Park, Jaehui and Fukuhara, Tomohiro and Ohmukai, Ikki and Takeda, Hideaki and Lee, Sang-goo},
title = {Web Content Summarization Using Social Bookmarks: A New Approach for Social Summarization},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458519},
doi = {10.1145/1458502.1458519},
abstract = {An increasing number of Web applications are allowing users to play more active roles for enriching the source content. The enriched data can be used for various applications such as text summarization, opinion mining and ontology creation. In this paper, we propose a novel Web content summarization method that creates a text summary by exploiting user feedback (comments and tags) in a social bookmarking service. We had manually analyzed user feedback in several representative social services including del.icio.us, Digg, YouTube, and Amazon.com. We found that (1) user comments in each social service have its own characteristics with respect to summarization, and (2) a tag frequency rank does not necessarily represent its usefulness for summarization. Based on these observations, we conjecture that user feedback in social bookmarking services is more suitable for summarization than other type of social services. We implemented prototype system called SSNote that analyzes tags and user comments in del.icio.us, and extracts summaries. Performance evaluations of the system were conducted by comparing its output summary with manual summaries generated by human evaluators. Experimental results show that our approach highlights the potential benefits of user feedback in social bookmarking services.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {103–110},
numpages = {8},
keywords = {social summarizartion, user feedback, social bookmarking service},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458520,
author = {Fersini, Elisabetta and Messina, Enza and Archetti, Francesco},
title = {Granular Modeling of Web Documents: Impact on Information Retrieval Systems},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458520},
doi = {10.1145/1458502.1458520},
abstract = {One of the most important tasks in Information Retrieval (IR) is related to web page information extraction and processing. It is a common approach to consider a web page as an atomic unit and to model its textual content as a "bag-of-words". However, this kind of representation does not reflect how people perceive a web page. A granular document representation, in terms of semantic objects, can help in identifying semantic areas of a web page and using them for different IR goals. In this paper we use a granular representation to define a new metric for evaluating semantic object importance and to enhance the performance of IR systems. In particular we show that this new metric can be used not only for classification goals, in which instances are assumed as independent and identically distributed, but also to gauge the strength of relationship between hypertextual documents and exploit this information for improving page ranking performance.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {111–118},
numpages = {8},
keywords = {web page ranking, visual layout analysis, document classification, relational granular document modeling},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/3247205,
author = {Chan, Chee-Yong},
title = {Session Details: Ranking and Similarity Search},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3247205},
doi = {10.1145/3247205},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
numpages = {1},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458522,
author = {Shao, Bo and Li, Tao and Ogihara, Mitsunori},
title = {Quantify Music Artist Similarity Based on Style and Mood},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458522},
doi = {10.1145/1458502.1458522},
abstract = {Music artist similarity has been an active research topic in music information retrieval for a long time since it is especially useful for music recommendation and organization. However, it is a difficult problem. The similarity varies significantly due to different artistic aspects considered and most importantly, it is hard to quantify. In this paper, we propose a new framework for quantifying artist similarity. In the framework, we focus on style and mood aspects of artists whose descriptions are extracted from the authoritative information available at the All Music Guide website. We then generate style--mood joint taxonomies using hierarchical co-clustering algorithm, and quantify the semantic similarities between the style/mood terms based on the taxonomy structure and the positions of these terms in the taxonomies. Finally we calculate the artist similarities according to all the style/mood terms used to describe them. Experiments are conducted to show the effectiveness of our framework.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {119–124},
numpages = {6},
keywords = {music artist similarity, similarity quantification, hierarchical co-clustering},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458523,
author = {Giannopoulos, Giorgos and Dalamagas, Theodore and Eirinaki, Magdalini and Sellis, Timos},
title = {Boosting the Ranking Function Learning Process Using Clustering},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458523},
doi = {10.1145/1458502.1458523},
abstract = {As the Web continuously grows, the results returned by search engines are too many to review. Lately, the problem of personalizing the ranked result list based on user feedback has gained a lot of attention. Such approaches usually require a big amount of user feedback on the results, which is used as training data. In this work, we present a method that overcomes this issue by exploiting all search results, both rated and unrated, in order to train a ranking function. Given a small initial set of user feedback for some search results, we first perform clustering on all results returned by the search. Based on the clusters created, we extend the initial set of rated results, including new, unrated results. Then, we use a popular training method (Ranking SVM) to train a ranking function using the expanded set of results. The experiments show that our method approximates sufficiently the results of an "ideal" system where all results of each query should be rated in order to be used as training data, something that is not feasible in a real-world scenario.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {125–132},
numpages = {8},
keywords = {search engine, clickthrough data, training, relevance judgement, clustering, ranking},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458524,
author = {Sun, Yang and Li, Huajing and Councill, Isaac G. and Huang, Jian and Lee, Wang-Chien and Giles, C. Lee},
title = {Personalized Ranking for Digital Libraries Based on Log Analysis},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458524},
doi = {10.1145/1458502.1458524},
abstract = {Given the exponential increase of indexable context on the Web, ranking is an increasingly difficult problem in information retrieval systems. Recent research shows that implicit feedback regarding user preferences can be extracted from web access logs in order to increase ranking performance. We analyze the implicit user feedback from access logs in the CiteSeer academic search engine and show how site structure can better inform the analysis of clickthrough feedback providing accurate personalized ranking services tailored to individual information retrieval systems. Experiment and analysis shows that our proposed method is more accurate on predicting user preferences than any non-personalized ranking methods when user preferences are stable over time. We compare our method with several non-personalized ranking methods including ranking SVMlight as well as several ranking functions specific to the academic document domain. The results show that our ranking algorithm can reach 63.59% accuracy in comparison to 50.02% for ranking SVMlight and below 43% for all other single feature ranking methods. We also show how the derived personalized ranking vectors can be employed for other ranking-related purposes such as recommendation systems.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {133–140},
numpages = {8},
keywords = {web usage mining, personalized ranking},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458525,
author = {Pon, Raymond K. and C\'{a}rdenas, Alfonso F. and Buttler, David J.},
title = {Online Selection of Parameters in the Rocchio Algorithm for Identifying Interesting News Articles},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458525},
doi = {10.1145/1458502.1458525},
abstract = {We show that users have different reading behavior when evaluating the interestingness of articles, calling for different parameter configurations for information retrieval algorithms for different users. Better recommendation results can be made if parameters for common information retrieval algorithms, such as the Rocchio algorithm, are learned dynamically instead of being statically fixed a priori. By dynamically learning good parameter configurations, Rocchio can adapt to differences in user behavior among users. We show that by adaptively learning online the parameters of a simple retrieval algorithm, similar recommendation performance can be achieved as more complex algorithms or algorithms that require extensive fine-tuning. Also we have also shon that online parameter learning can yield 10% better results than best performing filter from the TREC11 adaptive filter task.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {141–148},
numpages = {8},
keywords = {personalization, news filtering, news recommendation},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

@inproceedings{10.1145/1458502.1458526,
author = {Blanco, Lorenzo and Crescenzi, Valter and Merialdo, Paolo and Papotti, Paolo},
title = {Supporting the Automatic Construction of Entity Aware Search Engines},
year = {2008},
isbn = {9781605582603},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1458502.1458526},
doi = {10.1145/1458502.1458526},
abstract = {Several web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Although it is easy for a human reader to recognize these instances, current search engines are unaware of them. Technologies for the Semantic Web aim at achieving this goal; however, so far they have been of little help in this respect, as semantic publishing is very limited.We have developed a method to automatically search on the web for pages that publish data representing an instance of a certain conceptual entity. Our method takes as input a small set of sample pages: it automatically infers a description of the underlying conceptual entity and then searches the web for other pages containing data representing the same entity. We have implemented our method in a system prototype, which has been used to conduct several experiments that have produced interesting results.},
booktitle = {Proceedings of the 10th ACM Workshop on Web Information and Data Management},
pages = {149–156},
numpages = {8},
keywords = {resource discovery, web exploration, entity aware search engines},
location = {Napa Valley, California, USA},
series = {WIDM '08}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr

branch_name: refs/heads/main


text:
// Copyright 2011 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

//go:build js
// +build js

package x509

func loadSystemRoots() (*CertPool, error) {
	roots := NewCertPool()
	return roots, nil
}

func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
	return nil, nil
}

repository: smallstep/zcrypto

repo_name: smallstep/zcrypto

gha_license_id: NOASSERTION


text:
// (c) 2012 Alexander Solovyov
// under terms of ISC license

// Generating example site

package gostatic

import (
	"io/ioutil"
	"os"
	"path/filepath"
	"strings"
	"unicode"
)

var ExampleConfig = `
TEMPLATES = site.tmpl
SOURCE = src
OUTPUT = site
TITLE = Example Site
URL = https://example.com/
AUTHOR = Your Name

blog/*.md:
	config
	ext .html
	directorify
	tags tags/*.tag
	markdown
	template post
	template page

*.tag: blog/*.md
	ext .html
	directorify
	template tag
	markdown
	template page

blog.atom: blog/*.md
	inner-template

index.html: blog/*.md
	config
	inner-template
	template page
`

var ExampleMakefile = `
GS ?= gostatic

compile:
	$(GS) config

w:
	$(GS) -w config
`

var ExampleTemplate = `
{{ define "header" }}<!doctype html>

  <meta charset="utf-8">
  <meta name="author" content="{{ html .Site.Other.Author }}">
  <link rel="alternate" type="application/atom+xml" title="{{ html .Site.Other.Title }} feed" href="{{ .Rel "blog.atom" }}">
  <title>{{ .Site.Other.Title }}{{ if .Title }}: {{ .Title }}{{ end }}</title>
  <link href="//netdna.bootstrapcdn.com/bootstrap/3.0.0/css/bootstrap.min.css" rel="stylesheet">
  <link rel="stylesheet" type="text/css" href="{{ .Rel "static/style.css" }}">

{{ end }}

{{ define "footer" }}

{{ end }}

{{define "date"}}
<time datetime="{{ .Format "2006-01-02T15:04:05Z07:00" }}">
  {{ .Format "2006, January 02" }}
</time>
{{end}}

{{ define "page" }}{{ template "header" . }}
  {{ .Content }}
{{ template "footer" . }}{{ end }}

{{ define "post" }}

{{ .Title }}

      {{ template "date" .Date }} —
      {{ range $i, $t := .Tags }}{{if $i}},{{end}}
      {{ $t }}{{ end }}

  {{ .Content }}

{{ end }}

{{define "tag"}}
# Pages tagged with {{ .Title }}
{{ range .Site.Pages.WithTag .Title }}
- [{{ .Title }}](../../{{ .Url }})
{{ end }}
{{ end }}
`

var ExampleIndex = `
title: Main Page
----

{{ range .Site.Pages.Children "blog/" }}

    {{ template "date" .Date }} - {{ .Title }}

{{ end }}

`

var ExampleFeed = `
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:thr="http://purl.org/syndication/thread/1.0">
  <id>{{ .Site.Other.Url }}</id>
  <title>{{ .Site.Other.Title }}</title>
  {{ with .Site.Pages.Children "blog/" }}
  <updated>{{ .First.Date.Format "2006-01-02T15:04:05Z07:00" }}</updated>
  {{ end }}
  <author><name>{{ .Site.Other.Author }}</name></author>
  <link href="{{ .Site.Other.Url }}" rel="alternate"></link>
  <generator uri="https://github.com/piranha/gostatic">gostatic</generator>

{{ with .Site.Pages.Children "blog/" }}
{{ range .Slice 0 5 }}
<entry>
  <id>{{ .Url }}</id>
  <author><name>{{ or .Other.Author .Site.Other.Author }}</name></author>
  <title type="html">{{ html .Title }}</title>
  <published>{{ .Date.Format "2006-01-02T15:04:05Z07:00" }}</published>
  {{ range .Tags }}
  <category term="{{ . }}"></category>
  {{ end }}
  <link href="{{ .Site.Other.Url }}/{{ .Url }}" rel="alternate"></link>
  <content type="html">
    {{/* .Process runs here in case only feed changed */}}
    {{ with cut "
" "
" .Process.Content }}
      {{ html . }}
    {{ end }}
  </content>
</entry>
{{ end }}
{{ end }}
</feed>
`

var ExamplePost = `
title: First Post
date: 2012-12-12
tags: blog
----
My first post with [gostatic](https://github.com/piranha/gostatic).
`

var ExampleStyle = `
/* put your style rules here */
`

func WriteExample(dir string) error {
	WriteFile(dir, "config", ExampleConfig)
	WriteFile(dir, "Makefile", ExampleMakefile)
	WriteFile(dir, "site.tmpl", ExampleTemplate)
	WriteFile(dir, "src/index.html", ExampleIndex)
	WriteFile(dir, "src/blog/first.md", ExamplePost)
	WriteFile(dir, "src/blog.atom", ExampleFeed)
	WriteFile(dir, "src/static/style.css", ExampleStyle)
	return nil
}

func WriteFile(dir string, fn string, content string) error {
	path := filepath.Join(dir, filepath.FromSlash(fn))
	dir = filepath.Dir(path)

	if err := os.MkdirAll(dir, 0755); err != nil {
		return err
	}

	towrite := []byte(strings.TrimLeftFunc(content, unicode.IsSpace))
	if err := ioutil.WriteFile(path, towrite, 0644); err != nil {
		return err
	}

	return nil
}

license: ISC

repository: piranha/gostatic

repo_name: piranha/gostatic

gha_license_id: ISC


text:
package comment

type TrashCountTask struct {
	Id	interface{}	`json:"id,omitempty" name:"id" title:"评论ID"`
	Pid	interface{}	`json:"pid,omitempty" name:"pid" title:"父级别"`
	Eid	int64	`json:"eid" name:"eid" title:"评论目标ID"`
	Uid	interface{}	`json:"uid,omitempty" name:"uid" title:"用户ID,0不验证"`
	Q	interface{}	`json:"q,omitempty" name:"q" title:"内容模糊查询"`
}

func (T *TrashCountTask) GetName() string {
	return "trash/count.json"
}

func (T *TrashCountTask) GetTitle() string {
	return "获取回收站中评论数量"
}


text:
macro(error text)
  set(RunCMake_TEST_FAILED "${text}")
  return()
endmacro()

macro(parseGlobalSections arg_out_pre arg_out_post testName)
  set(out_pre ${arg_out_pre})
  set(out_post ${arg_out_post})
  set(sln "${RunCMake_TEST_BINARY_DIR}/${testName}.sln")
  if(NOT EXISTS "${sln}")
    error("Expected solution file ${sln} does not exist")
  endif()
  file(STRINGS "${sln}" lines)
  set(sectionLines "")
  set(store FALSE)
  foreach(line IN LISTS lines)
    if(line MATCHES "^\t*Global\n?$")
      set(store TRUE)
    elseif(line MATCHES "^\t*EndGlobal\n?$")
      set(store FALSE)
    elseif(store)
      list(APPEND sectionLines "${line}")
    endif()
  endforeach()
  set(sectionName "")
  set(sectionType "")
  foreach(line IN LISTS sectionLines)
    if(line MATCHES "^\t*GlobalSection\\((.*)\\) *= *(pre|post)Solution\n?$")
      set(sectionName "${CMAKE_MATCH_1}")
      set(sectionType ${CMAKE_MATCH_2})
      list(APPEND ${out_${sectionType}} "${sectionName}")
      if(DEFINED ${out_${sectionType}}_${sectionName})
        error("Section ${sectionName} defined twice")
      endif()
      set(${out_${sectionType}}_${sectionName} "")
    elseif(line MATCHES "\t*EndGlobalSection\n?$")
      set(sectionName "")
      set(sectionType "")
    elseif(sectionName)
      string(REGEX MATCH "^\t*([^=]*)=([^\n]*)\n?$" matches "${line}")
      if(NOT matches)
        error("Bad syntax in solution file: '${line}'")
      endif()
      string(STRIP "${CMAKE_MATCH_1}" key)
      string(STRIP "${CMAKE_MATCH_2}" value)
      list(APPEND ${out_${sectionType}}_${sectionName} "${key}=${value}")
    endif()
  endforeach()
endmacro()

macro(getProjectNames arg_out_projects)
  set(${arg_out_projects} "")
  set(sln "${RunCMake_TEST_BINARY_DIR}/${test}.sln")
  if(NOT EXISTS "${sln}")
    error("Expected solution file ${sln} does not exist")
  endif()
  file(STRINGS "${sln}" project_lines REGEX "^Project\\(")
  foreach(project_line IN LISTS project_lines)
    string(REGEX REPLACE ".* = \"" "" project_line "${project_line}")
    string(REGEX REPLACE "\", .*"  "" project_line "${project_line}")
    list(APPEND ${arg_out_projects} "${project_line}")
  endforeach()
endmacro()

macro(testGlobalSection prefix sectionName)
  if(NOT DEFINED ${prefix}_${sectionName})
    error("Section ${sectionName} does not exist")
  endif()
  if(NOT "${${prefix}_${sectionName}}" STREQUAL "${ARGN}")
    error("Section ${sectionName} content mismatch\n  expected: ${ARGN}\n  actual: ${${prefix}_${sectionName}}")
  endif()
endmacro()

extension: cmake


text:
@article{zanghellini_2004,
    doi = {10.1088/0953-4075/37/4/004},
    year = 2004,
    volume = {37},
    pages = {763},
    author = {Zanghellini, J. and Kitzler, M. and Brabec, T. and Scrinzi, A.},
    title = {Testing the multi-configuration time-dependent Hartree{\textendash}Fock method},
    journal = {Journal of Physics B: Atomic, Molecular and Optical Physics},
}

@book{griffiths2010introduction,
  title={Introduction to quantum mechanics},
  author={Griffiths, David J},
  year={2010},
  publisher={Prentice Hall, second edition}
}

@book{joachain2012atoms,
 author = {Joachain, C. J. and Kylstra, N. J. and Potvliege, R. M.},
 title = {Atoms in Intense Laser Fields},
 year = {2009},
 publisher = {Cambridge University Press},
 doi = {10.1017/cbo9780511993459},
}

@article{colbert-sinc,
    author = {Colbert,Daniel T.  and Miller,William H. },
    title = {A novel discrete variable representation for quantum mechanical reactive scattering via the S‐matrix Kohn method},
    journal = {The Journal of Chemical Physics},
    volume = {96},
    number = {3},
    pages = {1982-1991},
    year = {1992},
    doi = {10.1063/1.462100},
}

@article{colbert-dvr,
    author = {Groenenboom,Gerrit C.  and Colbert,Daniel T. },
    title = {Combining the discrete variable representation with the S‐matrix Kohn method for quantum reactive scattering},
    journal = {The Journal of Chemical Physics},
    volume = {99},
    number = {12},
    pages = {9681},
    year = {1993},
    doi = {10.1063/1.465450},
}