text:
@Article{BarBea,
  Title = {Chromatic Structures in stable homotopy theory},
  Author = {Tobias Barthel and Agnès Beaudry},
  journal = {ArXiv e-prints},
  archivePrefix = "arXiv",
  eprint = {1901.09004},
  URL = {https://arxiv.org/abs/1901.09004},
  Year = {2019}
}
@Article{BalmerTTG,
  Title = {Tensor triangular geometry},
  Author = {Paul Balmer},
  journal = {Proceedings of the ICM},
  Year = {2010}
}
@Article{Moore1981,
  Title                    = {Principal component analysis in linear systems: Controllability, observability, and model reduction},
  Author                   = {Moore, B.},
  Journal                  = {Automatic Control, IEEE Transactions on},
  Year                     = {1981},

  Month                    = {Feb},
  Note                     = {Test the annotated bilbiography.},
  Number                   = {1},
  Pages                    = { 17 - 32},
  Volume                   = {26},

  Annote                   = {Seminal work of Moore. While not the first paper on model order reduction in control, it was the first that made it popular and presented a simple technique to obtain a good approximation.},
  Doi                      = {10.1109/TAC.1981.1102568},
  ISSN                     = {0018-9286},
  Keywords                 = { Controllability, linear systems; Multivariable systems; Observability, linear systems; Reduced-order systems, linear;},
  Owner                    = {richard},
  Timestamp                = {2017.01.27}
}
@Article{GGN2013,
  Title = {Universality of multiplicative infinite loop space machines},
  Author = {David Gepner and Moritz Groth and Thomas Nikolaus},
  Year = {2013},
  Journal ={Algebr. Geom. Topol. 15}
}
@Article{GKRW,
  Title = {Cellular $E_k$-algebras},
  Author = {Galatius, Søren and Kupers, Alexander and Randall-Williams, Oscar},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = "1805.07184",
  journal = {ArXiv e-prints}
}

@Article{BSS,
  Title = {Chromatic homotopy theory is asymptotically algebraic},
  Author = {Tobias Barthel and Nathaniel Stapleton and Tomer Schlank},
  Year = {2017},
  journal = {ArXiv e-prints},
archivePrefix = "arXiv",
   eprint = {1711.00844},
  URL = {https://arxiv.org/abs/1711.00844}
}
@Article{BouLocSpc,
  Title = {Localization of spaces with respect to homology},
  Author = {A. K. Bousfield},
  Year = {1974},
  Journal = {Topology}
}
@Article{SegCatCoh,
  Title = {Categories and cohomology theories},
  Author = {Graeme Segal},
  Year = {1972},
  Journal = {Topology}
}

@Article{Mah15,
  Title = {$C^*$-algebraic drawings of dendroidal sets},
  Author = {Snigdhayan Mahanta},
  Year = {2015},
  journal = {Algebr. Geom. Topol., 19 (3), 1171--1206, 2019},
archivePrefix = "arXiv",
   eprint = {1501.05799},
  URL = {https://arxiv.org/abs/1501.05799}
 }
@Article{FST19,
  Title = {Backprop as Functor},
  Author = {Brendan Fong and David Spivak and Remy Tuyéras},
  Year = {2019},
  journal = {LICS 2019},
  archivePrefix = "arXiv",
   eprint = {1711.10455},
  URL = {https://arxiv.org/abs/1711.10455}
}
@Article{Haine19,
  Title = {On coherent topoi \& coherent 1-localic $\infty$-topoi},
  Author = {Peter J. Haine},
  Year = {2019},
  archivePrefix = "arXiv",
  journal = {ArXiv e-prints},
  eprint = {1904.01877}
}
@Article{GHWZ18,
  Title = {Compositional Game Theory},
  Author = {Neil Ghani and Jules Hedges and Viktor Winschel and Philipp Zahn},
  Year = {2018},
  journal = {LICS 2018},
  archivePrefix = "arXiv",
  eprint = {1603.04641},
  URL = {https://arxiv.org/abs/1603.04641}
}
@Article{Sturtz19,
  Title = {The equivalence of the categories of Giry-algebras and super convex spaces},
  Author = {Kirk Sturtz},
  Year = {2019},
  journal = {ArXiv e-prints},
  archivePrefix = "arXiv",
  eprint = {1907.03209},
  URL = {https://arxiv.org/abs/1907.03209},
  Annote = {Author has previously published and corrected erroneous similar results (comparing Giry algebras and convex measure spaces). This paper may bear double-checking.}
}
@Article{Hedges19,
  Title = {From open learners to open games},
  Author = {Jules Hedges},
  Year = {2019},
  jorunal = {ArXiv e-prints},
  archivePrefix = "arXiv",
  eprint = {1902.08666},
  URL = {https://arxiv.org/abs/1902.08666}
}
@Article{Balmer17,
  Title = {Nilpotence theorems via homological residue fields},
  Author = {Paul Balmer},
  Year = {2017},
  archivePrefix = "arXiv",
  eprint = {1710.04799},
  URL = {https://arxiv.org/abs/1710.04799}
}
@Article{BHM18,
  Title = {A Whitehead theorem for periodic homotopy groups},
  Author = {Tobias Barthel and Gijs Heuts and Lennart Meier},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1811.04030},
  URL = {https://arxiv.org/abs/1811.04030}
}
@Article{BGT10,
  Title = {A universal characterization of higher algebraic K-theory},
  Author = {Andrew J. Blumberg and David Gepner and Goncalo Tabuada},
  Year = {2010},
  archivePrefix = "arXiv",
  eprint = {1001.2282},
  URL = {https://arxiv.org/abs/1001.2282}
}
@Article{CHP18,
  Title = {Discrete dynamics and differentiable stacks},
  Author = {Alejandro Cabrera and Matias del Hoyo and Enrique Pujals},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1804.00220},
  URL = {https://arxiv.org/abs/1804.00220}
}

@Article{Caramello19,
  Title = {Denseness conditions, morphisms and equivalences of toposes},
  Author = {Olivia Caramello},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1906.08737},
  URL = {https://arxiv.org/abs/1906.08737}
}
@Article{CH19,
  Title = {Homotopy-coherent algebra via Segal conditions},
  Author = {Hongyi Chu and Rune Haugseng},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.03977},
  URL = {https://arxiv.org/abs/1907.03977}
}
@Article{FMT19,
  Title = {Functorial Question Answering},
  Author = {Giovanni de Felice and Konstantinos Meichanetzidis and Alexis Toumi},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1905.07408},
  URL = {https://arxiv.org/abs/1905.07408}
}
@Article{FS18RegularLogic,
  Title = {Graphical Regular Logic},
  Author = {Brendan Fong and David I Spivak},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1812.05765},
  URL = {https://arxiv.org/abs/1812.05765}
}
@Article{FS18HypergraphCats,
  Title = {Hypergraph Categories},
  Author = {Brendan Fong and David I Spivak},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1806.08304},
  URL = {https://arxiv.org/abs/1806.08304}
}
@Article{Gavranovic19,
  Title = {Compositional Deep Learning},
  Author = {Bruno Gavranović},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.08292},
  URL = {https://arxiv.org/abs/1907.08292}
}
@Article{Gepner19,
  Title = {An Introduction to Higher Categorical Algebra},
  Author = {David Gepner},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.02904},
  URL = {https://arxiv.org/abs/1907.02904}
}
@Article{Heuts19,
  Title = {Lie algebra models for unstable homotopy theory},
  Author = {Gijs Heuts},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.13055},
  URL = {https://arxiv.org/abs/1907.13055}
}
@Article{Hinich18,
  Title = {So, what is a derived functor?},
  Author = {V. Hinich},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1811.12255},
  URL = {https://arxiv.org/abs/1811.12255}
}
@Article{KU17,
  Title = {A categorical semantics for causal structure},
  Author = {Aleks Kissinger and Sander Uijlen},
  Year = {2017},
  archivePrefix = "arXiv",
  eprint = {1701.04732},
  URL = {https://arxiv.org/abs/1701.04732}
}
@Article{LT19,
  Title = {Enriched Regular Theories},
  Author = {Stephen Lack and Giacomo Tendas},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.02301},
  URL = {https://arxiv.org/abs/1907.02301}
}
@Article{Posur19,
  Title = {Methods of constructive category theory},
  Author = {Sebastian Posur},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1908.04132},
  URL = {https://arxiv.org/abs/1908.04132}
}
@Article{SS14,
  Title = {Virtual vector bundles and graded Thom spectra},
  Author = {Steffen Sagave and Christian Schlichtkrull},
  Year = {2014},
  archivePrefix = "arXiv",
  eprint = {1410.4492},
  URL = {https://arxiv.org/abs/1410.4492}
}
@Article{Wu19,
  Title = {An Open Petri Net Implementation of Gene Regulatory Networks},
  Author = {Yanying Wu},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1907.11316},
  URL = {https://arxiv.org/abs/1907.11316}
}
@Article{SSV16,
  Title = {Dynamical Systems and Sheaves},
  Author = {Patrick Schultz and David I. Spivak and Christina Vasilakopoulou},
  Year = {2016},
  archivePrefix = "arXiv",
  eprint = {1609.08086},
  URL = {https://arxiv.org/abs/1609.08086}
}
@Article{BP17,
  Title = {A Compositional Framework for Reaction Networks},
  Author = {John C. Baez and Blake S. Pollard},
  Year = {2017},
  archivePrefix = "arXiv",
  eprint = {1704.02051},
  URL = {https://arxiv.org/abs/1704.02051}
}
@Article{BF13,
  Title = {Quantum Techniques for Studying Equilibrium in Reaction Networks},
  Author = {John C. Baez and Brendan Fong},
  Year = {2013},
  archivePrefix = "arXiv",
  eprint = {1305.4988},
  URL = {https://arxiv.org/abs/1305.4988},
  Annote = {Not actually related to compositional methods (of course, the title doesn't really say that it is, so...)}
}
@Article{BHW18,
  Title = {The algebra of predicting agents},
  Author = {Joe Bolt and Jules Hedges and Viktor Winschel},
  Year = {2018},
  archivePrefix = "arXiv",
  eprint = {1803.10131},
  URL = {https://arxiv.org/abs/1803.10131},
  Annote = {A long discussion of the algebra of fixpoint agents}
}
@Article{Fong15,
  Title = {Decorated Cospans},
  Author = {Brendan Fong},
  Year = {2015},
  archivePrefix = "arXiv",
  eprint = {1502.00872},
  URL = {https://arxiv.org/abs/1502.00872}
}
@Book{LeeSmoMan,
  Title                    = {Smooth Manifolds},
  Author                   = {Lee, J. M.}
}
@Misc{RezkQuasi,
  Title = {Stuff about Quasicategories},
  Author = {Charles Rezk},
  Annote = {Lecture notes for a course about quasicategories. See project 1.}
}

@Book{LuHiTop,
  Title                    = {Higher Topos Theory},
  Author                   = {Lurie, J.},
  Publisher                = {Princeton University Press},
  Year                     = {2009},
  Annote                   = {Reference on the theory of quasicategories, as well as on infinity,1 topoi}
}

@Book{LuHiAlg,
  Title                    = {Higher Algebra},
  Author                   = {Lurie, J.},
  Year                     = {2017}
}
@Book{Hatcher,
  Title                    = {Algebraic Topology},
  Author                   = {Hatcher, A.},
  Publisher                = {Cambridge University Press},
  Year                     = {2001},
  Annote                   = {Standard introductory textbook on algebraic topology. Fairly comprehensive description of (singular) homology and cohomology, and of higher homotopy groups. Fairly geometric in flavor}
}

@Book{Zhu,
  Title                    = {An Introduction to Operator Algebras},
  Author                   = {Zhu, K.},
  Publisher                = {CRC Press},
  Year                     = {1993},
  Annote                   = {A standard textbook on operator algebras. Covers Banach algebras, C*-algebras, Von Neumann-algebras.}
}

@Book{MacLaneMoerdijk,
  Title                    = {Sheaves in Geometry and Logic},
  Author                   = {Saunders Mac Lane and Ieke Moerdijk},
  Publisher                = {Springer-Verlag New York, Inc.},
  Year                     = {1992},
  Annote                   = {Popular book on topos theory. Still forming opinion.}
}
@Book{Goerss-Jardine,
  Title                    = {Simplicial homotopy theory},
  Author                   = {Goerss, P.G. and Jardine, J.F.},
  Publisher                = {Birkh{\"a}user Verlag AG},
  Year                     = {2009},
  Annote                   = {Standard reference, both on the basic theory of simplicial sets and on their "homotopy theory"}
}

@Book{Munkres,
  Title                    = {Topology},
  Author                   = {Munkres, J. R.},
  Publisher                = {Prentice Hall, Inc.},
  Year                     = {2000},
  Edition                  = {2nd},
  Annote                   = {The de facto reference and textbook on point-set topology. One of the greatest textbooks of all time}
}
@Book{AndersonAndMoore,
  Title                    = {Optimal Control: Linear Quadratic Methods},
  Author                   = {Anderson, B.D.O. and Moore, J.B.},
  Publisher                = {Prentice-Hall, Inc.},
  Year                     = {1990},

  Annote                   = {A major book on the theory LQ methods in discrete and continuous control.  Excellent exposition of the Hamilton-Jacobi-Bellman equations to derive the optimal LQR/LQE solutions.},
  Owner                    = {richard},
  Timestamp                = {2017.01.26}
}

@Book{StrunkWhite,
  Title                    = {Elements of Style},
  Author                   = {William Strunk and E.B. White},
  Publisher                = {Longman},
  Year                     = {2000},

  Address                  = {New York, NY},
  Edition                  = {4th},

  Annote                   = {People like this book, personally, I do not think it is good for technical writing.}
}

@Book{NumLinAlg,
  Title                    = {Numerical Linear Algebra},
  Author                   = {Lloyd N. Trefethen and David Bau},
  Publisher                = {Society for Industrial and Applied Mathematics},
  Year                     = {1997},

  Address                  = {Philadelphia, PA},

  Annote                   = {Excellent book for the introduction to numerical linear algebra.  I used the SVD results as an example for the logbook template.},
  Comment                  = {pp. 361, ISBN: 0-89871-361-7, },
  Owner                    = {richard},
  Timestamp                = {2017.01.27}
}
@Article{Hedges17,
  Title = {Morphisms of open games},
  Author = {Jules Hedges},
  Year = {2017},
  archivePrefix = "arXiv",
  eprint = {1711.07059},
  URL = {https://arxiv.org/abs/1711.07059}
}
@Article{HH19,
  Title = {Foundations of brick diagrams},
  Author = {Jules Hedges and Jelle Herold},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1908.10660},
  URL = {https://arxiv.org/abs/1908.10660}
}
@Article{FongSpivakRRCat,
  Title = {Regular and relational categories: Revisiting 'Cartesian bicategories I'},
  Author = {Brendan Fong and David I Spivak},
  Year = {2019},
  archivePrefix = "arXiv",
  eprint = {1909.00069},
  URL = {https://arxiv.org/abs/1909.00069}
}

repository: AyeGill/personal-site

repo_name: AyeGill/personal-site


text:
@book{Forsyth:2002:CVM:580035,
 author = {Forsyth, David A. and Ponce, Jean},
 title = {Computer Vision: A Modern Approach},
 year = {2002},
 isbn = {0130851981},
 publisher = {Prentice Hall Professional Technical Reference},
}

@book{szeliski2010computer,
  title={Computer vision: algorithms and applications},
  author={Szeliski, Richard},
  year={2010},
  publisher={Springer Science \& Business Media}
}

@Book{Hartley2004,
    author = "Hartley, R.~I. and Zisserman, A.",
    title = "Multiple View Geometry in Computer Vision",
    edition = "Second",
    year = "2004",
    publisher = "Cambridge University Press, ISBN: 0521540518"
}

@article{HARTLEY1997146,
	title = "Triangulation",
	journal = "Computer Vision and Image Understanding",
	volume = "68",
	number = "2",
	pages = "146 - 157",
	year = "1997",
	issn = "1077-3142",
	doi = "https://doi.org/10.1006/cviu.1997.0547",
	url = "http://www.sciencedirect.com/science/article/pii/S1077314297905476",
	author = "Richard I. Hartley and Peter Sturm"
}

license: MIT

repository: andfoy/cpd-exercises

license_type: permissive

repo_name: andfoy/cpd-exercises

branch_name: refs/heads/master

extension: bib


text:
---
---

@string{aps = {American Physical Society,}}

@misc{lazarevich2023yolobench,
      title={YOLOBench: Benchmarking Efficient Object Detectors on Embedded Systems},
      author={Ivan Lazarevich and Matteo Grimaldi and Ravish Kumar and Saptarshi Mitra and Shahrukh Khan and Sudhakar Sah},
      bibtex_show={true},
      year={2023},
      eprint={2307.13901},
      archivePrefix={arXiv},
      primaryClass={cs.CV},
      abstract = {We present YOLOBench, a benchmark comprised of 550+ YOLO-based object detection models on 4 different datasets and 4 different embedded hardware platforms (x86 CPU, ARM CPU, Nvidia GPU, NPU). We collect accuracy and latency numbers for a variety of YOLO-based one-stage detectors at different model scales by performing a fair, controlled comparison of these detectors with a fixed training environment (code and training hyperparameters). Pareto-optimality analysis of the collected data reveals that, if modern detection heads and training techniques are incorporated into the learning process, multiple architectures of the YOLO series achieve a good accuracy-latency trade-off, including older models like YOLOv3 and YOLOv4. We also evaluate training-free accuracy estimators used in neural architecture search on YOLOBench and demonstrate that, while most state-of-the-art zero-cost accuracy estimators are outperformed by a simple baseline like MAC count, some of them can be effectively used to predict Pareto-optimal detection models. We showcase that by using a zero-cost proxy to identify a YOLO architecture competitive against a state-of-the-art YOLOv8 model on a Raspberry Pi 4 CPU. The code and data are available.},
      abbr={ICCVW},
      selected={true},
      pdf={https://arxiv.org/pdf/2307.13901.pdf},
      code = {https://github.com/Deeplite/deeplite-torch-zoo}
}

@InProceedings{Ganji_2023_CVPR,
    author    = {Ganji, Darshan C. and Ashfaq, Saad and Saboori, Ehsan and Sah, Sudhakar and Mitra, Saptarshi and AskariHemmat, MohammadHossein and Hoffman, Alexander and Hassanien, Ahmed and L\'eonardon, Mathieu},
    title     = {DeepGEMM: Accelerated Ultra Low-Precision Inference on CPU Architectures Using Lookup Tables},
    booktitle = {Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops},
    bibtex_show={true},
    month     = {June},
    year      = {2023},
    pages     = {4655-4663},
    abstract = {A lot of recent progress has been made in ultra low-bit quantization, promising significant improvements in latency, memory footprint and energy consumption on edge devices. Quantization methods such as Learned Step Size Quantization can achieve model accuracy that is comparable to full-precision floating-point baselines even with sub-byte quantization. However, it is extremely challenging to deploy these ultra low-bit quantized models on mainstream CPU devices because commodity SIMD (Single Instruction, Multiple Data) hardware typically supports no less than 8-bit precision. To overcome this limitation, we propose DeepGEMM, a lookup table based approach for the execution of ultra low-precision convolutional neural networks on SIMD hardware. The proposed method precomputes all possible products of weights and activations, stores them in a lookup table, and efficiently accesses them at inference time to avoid costly multiply-accumulate operations. Our 2-bit implementation outperforms corresponding 8-bit integer kernels in the QNNPACK framework by up to 1.74x on x86 platforms.},
    abbr={CVPRW},
    selected={true},
    pdf={https://openaccess.thecvf.com/content/CVPR2023W/ECV/papers/Ganji_DeepGEMM_Accelerated_Ultra_Low-Precision_Inference_on_CPU_Architectures_Using_Lookup_CVPRW_2023_paper.pdf},
}

@inproceedings{10.1145/3489517.3530424,
author = {Mor\`{\i}, Pierpaolo and Vemparala, Manoj-Rohit and Fasfous, Nael and Mitra, Saptarshi and Sarkar, Sreetama and Frickenstein, Alexander and Frickenstein, Lukas and Helms, Domenik and Nagaraja, Naveen Shankar and Stechele, Walter and Passerone, Claudio},
bibtex_show={true},
title = {Accelerating and Pruning CNNs for Semantic Segmentation on FPGA},
year = {2022},
isbn = {9781450391429},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3489517.3530424},
doi = {10.1145/3489517.3530424},
abstract = {Semantic segmentation is one of the popular tasks in computer vision, providing pixel-wise annotations for scene understanding. However, segmentation-based convolutional neural networks require tremendous computational power. In this work, a fully-pipelined hardware accelerator with support for dilated convolution is introduced, which cuts down the redundant zero multiplications. Furthermore, we propose a genetic algorithm based automated channel pruning technique to jointly optimize computational complexity and model accuracy. Finally, hardware heuristics and an accurate model of the custom accelerator design enable a hardware-aware pruning framework. We achieve 2.44X lower latency with minimal degradation in semantic prediction quality (−1.98 pp lower mean intersection over union) compared to the baseline DeepLabV3+ model, evaluated on an Arria-10 FPGA. The binary files of the FPGA design, baseline and pruned models can be found in github.com/pierpaolomori/SemanticSegmentationFPGA},
booktitle = {Proceedings of the 59th ACM/IEEE Design Automation Conference},
pages = {145–150},
numpages = {6},
location = {San Francisco, California},
series = {DAC '22},
abbr={DAC},
selected={true},
pdf={https://drive.google.com/file/d/1SFMNmo-657CvXmbcGjfKQeN_PnK8NOf_/view?usp=sharing},
code = {https://github.com/pierpaolomori/SemanticSegmentationFPGA}
}

@mastersthesis{Thesis_Saptarshi_Mitra_2a_print.pdf,
	author = {Mitra, Saptarshi},
  bibtex_show={true},
  booktitle={Master's Thesis, Chair of Integrated Systems, Tecnical University of Munich},
	title = {Accelerating Semantic Image Segmentation on FPGA},
	year = {2021},
	school = {Technische Universität München},
	month = {},
	adress = {81375 Munich},
	pages = {},
	language = {en},
	abstract = {From healthcare to autonomous driving, Deep Neural Networks (DNN) dominate over the traditional Computer Vision (CV) approaches in terms of accuracy and efficiency. Exponential increase of DNN applications require tremendous computation power of the underlying hardware resources. Naturally, the superior performance of DNN models comes at the cost of a huge memory footprint and complex calculations. Even if Graphics Processing Units (GPU) are the main work-horse during the training of DNNs for their massive computational capabilities, they are not suitable for mobile deployments. Field-programmable Gate Array (FPGA) provides the best trade-off between performance, power-consumption and design flexibility. Semantic image segmentation is one of the most complex tasks in computer vision, providing pixel-wise annotations for complete scene understanding. For a critical application like autonomous driving, DeepLabV3+ model provides the state-of-the-art Mean Intersection-Over-Union (mIOU) for semantic segmentation on the CityScapes dataset. In this work, a fully pipelined hardware accelerator implementing novel dilated convolution was introduced. Using this accelerator, an end-end DeepLabV3+ deployment was possible on an FPGA. This architecture exploits hardware optimizations like 3-D loop unrolling, memory tiling to maximize use of computational resources and provides 2.34 times latency improvement with respect to the baseline architecture. Further, a Genetic Algorithm (GA) based automated channel pruning technique was used to jointly optimize hardware usage and model accuracy. Finally, hardware awareness was incorporated in the pruning search by hardware heuristics and an accurate model of the custom accelerator.},
	keywords = {CNN; DNN; Semantic Segmentation; Hardware Acceleration; FPGA; HLS; OpenCL; Pruning},
	note = {},
  abbr={Master Thesis},
  pdf={https://mediatum.ub.tum.de/doc/1649493/1649493.pdf}
}

@INPROCEEDINGS{8328275,
  bibtex_show={true},
  author={Pradhan, Anish and Basu, Soumi and Sarkar, Sreetama and Mitra, Saptarshi and Roy, Sanjay Dhar},
  booktitle={2018 10th International Conference on Communication Systems & Networks (COMSNETS)},
  title={Implementation of relay hopper model for reliable communication of IoT devices in LTE environment through D2D link},
  abstract={Internet of things (IoT) is an emerging technology

that can bring about a revolution in our day-to-day lives. Device-
to-device (D2D) communication is an energy and spectral efficient

solution to the growing problem of scarcity of free spectrum and
overloading of base stations in cellular networks. The concept
of using D2D communication in IoT networks has already been
proposed. But the reliability of the links established by reusing
the resource blocks allocated to licensed cellular users has not
been investigated earlier. In this paper, our objective is to provide
connectivity between IoT devices and the associated gateway
using D2D communication ensuring that links established are
reliable, and at the same time improve performance by providing
connectivity to the maximum number of IoT devices. We propose
a three step approach to achieve this. In the first step, the IoT
devices satisfying the Quality of Service (QoS) constraint are
selected and matched with appropriate reuse candidates, that is,
the cellular user equipments (CUEs) by an optimum resource

allocation scheme. Next, link reliability of these links are com-
puted and weak links are discarded. Finally, the disconnected IoT

devices are rerouted to the IoT gateway via IoT devices possessing
strong links following a relay hopper model. Simulation results
indicate significant improvement in the network performance
metrics, namely, access rate and sum throughput of IoT devices.},
  year={2018},
  volume={},
  number={},
  pages={569-572},
  doi={10.1109/COMSNETS.2018.8328275},
  preview={comsnets1.png},
  abbr={COMSNETS},
  pdf={https://drive.google.com/file/d/1SFMNmo-657CvXmbcGjfKQeN_PnK8NOf_/view?usp=sharing}
}

@INPROCEEDINGS{8118009,
  author={Sarkar, Sayan and Ghosh, Gautam and Mohanta, Amitrakshar and Ghosh, Atreye and Mitra, Saptarshi},
  bibtex_show={true},
  booktitle={2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT)},
  title={Arduino based foot pressure sensitive smart safety system for industrial robots},
  year={2017},
  volume={},
  number={},
  pages={1-6},
  abstract={Machine learning is one important aspect of automation. The research on automation raises a fundamental question: Can machines learn to act & behave like humans? Safe & efficient robot-human interaction - known as `collaborative robotics' or `cobotics' - has the power to transform production & assembly lines. The probability of industrial mishaps involving robots (like that in SKH metals, Manesar, August 2015) has increased with time. Companies using robots have burgeoned more safety programmes but they have some drawbacks. A real-time, MEMS sensor (PZT material) based, economical approach is proposed ensuring the safety in robotic workspace by shutting the robot system off or slowing it down upon human entry. During operation if a fault is detected at the robotic arm, the cabin operator is informed through the Human Machine Interface (HMI). The Arduino trips the robot when the operator steps on the piezoelectric mat (Doormat) while entering the workspace. The conventional safety switch can be bypassed since it is manual & sometimes problematic where fast response troubleshooting action is required but our proposed design has relatively less failure rate than traditional one. The unification of Arduino UNO & Relay, based on `OR' logic protects the personnel from any unexpected robotic behaviour even when he fails to trigger the safety switch. The status of the robotic arm can be monitored distantly by IOT integration. It is programmed with a calculated threshold value of the foot pressure corresponding to 60 Kg of body mass for the circuit tripping to avoid false triggering. As this operation is part of a process plant, operators can increase the speed of other similar processes in the unit to compensate for the loss of production.},
  doi={10.1109/ICECCT.2017.8118009},
  preview={icecct.png},
  abbr={ICECC},
  pdf={https://drive.google.com/file/d/1HIlN1QEvVTc9dqvTZ0W3GlnTWA61m5GG/view?usp=sharing}
}

@INPROCEEDINGS{8075838,
  author={Sarkar, Sreetama and Mitra, Saptarshi and Nath, Tamoghno and Roy, Sanjay Dhar},
  booktitle={2017 International Electrical Engineering Congress (iEECON)},
  bibtex_show={true},
  title={Performance of different power control schemes for a hybrid LTE system with channel impairment},
  abstract={With the rapid increase in the use of smartphones and data traffic load on the base stations increasing everyday, an alternative mode of communication is the need of the hour. Device-to-device (D2D) communication allows devices to connect to each other directly without the intervention of the base station. Besides, it provides high spectrum efficiency and a much better signal-to-interference-plus-noise ratio (SINR) performance as compared to cellular communication. However, it may generate significant interference to cellular users when the same resources are shared by both the systems. Resource scheduling and power control are two key measures to deal with the interference between cellular and D2D user equipment (UE). In this paper, we have focused mainly on power control in D2D communication. The main objective is to study the impact of channel imperfections like multipath fading and shadowing on different power control schemes. The system consisting of a D2D pair incorporated into an Orthogonal Frequency Division Multiple Access (OFDMA) cellular system is simulated for different combinations of power control schemes for cellular and D2D users. The variations in SINR performance of the system, when fading and shadowing are introduced in the channel along with pathloss, illustrates the effect of these parameters on the Long Term Evolution (LTE) power control schemes. Also the change in outage probability has been investigated by adding more D2D pairs to the system so that it resembles a D2D communication system in realtime scenario..},
  year={2017},
  volume={},
  number={},
  pages={1-4},
  doi={10.1109/IEECON.2017.8075838},
  preview={IEECON.png},
  abbr={IEECON},
  pdf={https://drive.google.com/file/d/0B0_3fFtRovy8eUpPQVk2TW5FTEk/view?usp=sharing&resourcekey=0-_J1YAAGzJvwbxWmcFd6vmw}
}

@book{einstein1956investigations,
  bibtex_show={true},
  title={Investigations on the Theory of the Brownian Movement},
  author={Einstein, Albert},
  year={1956},
  publisher={Courier Corporation,},
  preview={brownian-motion.gif},
}

@article{einstein1950meaning,
  abbr={AJP},
  bibtex_show={true},
  title={The meaning of relativity},
  author={Einstein, Albert and Taub, AH},
  journal={American Journal of Physics,},
  volume={18},
  number={6},
  pages={403--404},
  year={1950},
  publisher={American Association of Physics Teachers,}
}

@article{PhysRev.47.777,
  abbr={PhysRev},
  title={Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?},
  author={Einstein, A. and Podolsky, B. and Rosen, N.},
  abstract={In a complete theory there is an element corresponding to each element of reality. A sufficient condition for the reality of a physical quantity is the possibility of predicting it with certainty, without disturbing the system. In quantum mechanics in the case of two physical quantities described by non-commuting operators, the knowledge of one precludes the knowledge of the other. Then either (1) the description of reality given by the wave function in quantum mechanics is not complete or (2) these two quantities cannot have simultaneous reality. Consideration of the problem of making predictions concerning a system on the basis of measurements made on another system that had previously interacted with it leads to the result that if (1) is false then (2) is also false. One is thus led to conclude that the description of reality as given by a wave function is not complete.},
  journal={Phys. Rev.,},
  volume={47},
  issue={10},
  pages={777--780},
  numpages={0},
  year={1935},
  month={May},
  publisher=aps,
  doi={10.1103/PhysRev.47.777},
  url={http://link.aps.org/doi/10.1103/PhysRev.47.777},
  html={https://journals.aps.org/pr/abstract/10.1103/PhysRev.47.777},
  pdf={example_pdf.pdf},

}

@article{einstein1905molekularkinetischen,
  title={{\"U}ber die von der molekularkinetischen Theorie der W{\"a}rme geforderte Bewegung von in ruhenden Fl{\"u}ssigkeiten suspendierten Teilchen},
  author={Einstein, A.},
  journal={Annalen der physik,},
  volume={322},
  number={8},
  pages={549--560},
  year={1905},
  publisher={Wiley Online Library}
}

@article{einstein1905movement,
  abbr={Ann. Phys.},
  title={Un the movement of small particles suspended in statiunary liquids required by the molecular-kinetic theory 0f heat},
  author={Einstein, A.},
  journal={Ann. Phys.,},
  volume={17},
  pages={549--560},
  year={1905}
}

@article{einstein1905electrodynamics,
  title={On the electrodynamics of moving bodies},
  author={Einstein, A.},
  year={1905}
}

gha_language: JavaScript


text:
@article{eqsat-2021,
    author = {Yichen Yang, Phitchaya Mangpo Phothilimthana, Yisu Remy Wang, Max Willsey, Sudip Roy, Jacques Pienaar},
    title = {Equality Saturation for Tensor Graph Superoptimization},
    journal = {arXiv:2101.01332},
    year = {2021},
}

@article{taso-2019,
    author    = {Zhihao Jia, Oded Padon, James Thomas, Todd Warszawski, Matei Zaharia, Alex Aiken},
    title     = {TASO: Optimizing Deep Learning Computation with Automatic Generation of Graph Substitutions},
    journal   = {In Proceedings of the Conference on Systems and Machine Learning (SysML)},
    year      = {2019},
}

repository: jedhsu/tulip

repo_name: jedhsu/tulip

branch_name: refs/heads/main


text:
.jimu-widget-draw{
	width: 100%;
	height: 100%;
	min-width: 270px;
	min-height: 192px;
	font-size: 14px;
}

.jimu-widget-draw .measure-section{
	display: none;
	width: 100%;
	margin-top: 12px;
}

.jimu-widget-draw .area-units-tip{
	height: 30px;
	line-height: 30px;
	padding-left: 17px;
}

.jimu-rtl .jimu-widget-draw .area-units-tip{
	padding-left: 0;
	padding-right: 17px;
}

.jimu-widget-draw .distance-units-tip{
	height: 30px;
	line-height: 30px;
	padding-left: 17px;
}

.jimu-rtl .jimu-widget-draw .distance-units-tip{
	padding-left: 0;
	padding-right: 17px;
}

.jimu-widget-draw .dijitArrowButtonContainer{
	width: 40px;
}

.jimu-widget-draw .dijitSelect{
	height: 40px;
	width: 100%;
}

.jimu-widget-draw .dijitReset.dijitLeft.dijitButtonNode.dijitArrowButton.dijitDownArrowButton{
	width:100%;
}

.jimu-widget-draw .dijitReset.dijitLeft.dijitButtonNode.dijitArrowButton.dijitUpArrowButton{
	width:100%;
}

.jimu-widget-draw .dijitReset.dijitLeft.dijitButtonNode.dijitArrowButton.dijitDownArrowButton .dijitArrowButtonInner{
	width:100%;
}

.jimu-widget-draw .dijitReset.dijitLeft.dijitButtonNode.dijitArrowButton.dijitUpArrowButton .dijitArrowButtonInner{
	width:100%;
}

.jimu-widget-draw .operations{
	margin-top: 20px;
	text-align: center;
}

.jimu-widget-draw .operations .jimu-btn{
	padding: 0 18px;
	height: 32px;
	line-height: 33px;
	margin-right: 10px;
	margin-bottom: 10px;
	min-width: 10px;
}

.jimu-rtl .jimu-widget-draw .operations .jimu-btn{
	margin-right: 0;
	margin-left: 10px;
}

.jimu-widget-draw .operations .jimu-btn.last-btn{
	margin-right: 0;
}

.jimu-rtl .jimu-widget-draw .operations .jimu-btn.last-btn{
	margin-left: 0;
}

extension: css


text:
@Manual{base,
  title = {R: A Language and Environment for Statistical Computing},
  author = {{R Core Team}},
  organization = {R Foundation for Statistical Computing},
  address = {Vienna, Austria},
  year = {2020},
  url = {https://www.R-project.org/},
}
@Manual{BiocManager,
  title = {BiocManager: Access the Bioconductor Project Package Repository},
  author = {Martin Morgan},
  year = {2021},
  note = {R package version 1.30.12},
  url = {https://CRAN.R-project.org/package=BiocManager},
}
@Manual{dendsort,
  title = {dendsort: Modular Leaf Ordering Methods for Dendrogram Nodes},
  author = {Ryo Sakai},
  year = {2015},
  note = {R package version 0.3.3},
  url = {https://CRAN.R-project.org/package=dendsort},
}
@Article{dnapath,
  title = {Integrating Gene Regulatory Pathways into Differential Network Analysis of Gene Expression Data},
  author = {Tyler Grimes and Steven Potter and Somnath Datta},
  journal = {Scientific reports},
  year = {2019},
  volume = {9},
  page = {5479},
  publisher = {Nature Publishing Group},
}
@Article{DOSE,
  title = {DOSE: an R/Bioconductor package for Disease Ontology Semantic and Enrichment analysis},
  author = {Guangchuang Yu and Li-Gen Wang and Guang-Rong Yan and Qing-Yu He},
  journal = {Bioinformatics},
  year = {2015},
  volume = {31},
  number = {4},
  pages = {608-609},
  url = {http://bioinformatics.oxfordjournals.org/content/31/4/608},
  doi = {10.1093/bioinformatics/btu684},
}
@Manual{dplyr,
  title = {dplyr: A Grammar of Data Manipulation},
  author = {Hadley Wickham and Romain François and Lionel Henry and Kirill Müller},
  year = {2021},
  note = {R package version 1.0.5},
  url = {https://CRAN.R-project.org/package=dplyr},
}
@Article{edgeR,
  title = {edgeR: a Bioconductor package for differential expression analysis of digital gene expression data},
  author = {Mark D Robinson and Davis J McCarthy and Gordon K Smyth},
  journal = {Bioinformatics},
  volume = {26},
  number = {1},
  pages = {139-140},
  year = {2010},
  doi = {10.1093/bioinformatics/btp616},
}

@Article{edgeR,
  author = {Davis J McCarthy and Yunshun Chen and Gordon K Smyth},
  title = {Differential expression analysis of multifactor RNA-Seq experiments with respect to biological variation},
  year = {2012},
  journal = {Nucleic Acids Research},
  volume = {40},
  number = {10},
  pages = {4288-4297},
  doi = {10.1093/nar/gks042},
}
@Manual{factoextra,
  title = {factoextra: Extract and Visualize the Results of Multivariate Data Analyses},
  author = {Alboukadel Kassambara and Fabian Mundt},
  year = {2020},
  note = {R package version 1.0.7},
  url = {https://CRAN.R-project.org/package=factoextra},
}
@Manual{ggnewscale,
  title = {ggnewscale: Multiple Fill and Colour Scales in 'ggplot2'},
  author = {Elio Campitelli},
  year = {2021},
  note = {R package version 0.4.5},
  url = {https://CRAN.R-project.org/package=ggnewscale},
}
@Book{ggplot2,
  author = {Hadley Wickham},
  title = {ggplot2: Elegant Graphics for Data Analysis},
  publisher = {Springer-Verlag New York},
  year = {2016},
  isbn = {978-3-319-24277-4},
  url = {https://ggplot2.tidyverse.org},
}
@Manual{ggrepel,
  title = {ggrepel: Automatically Position Non-Overlapping Text Labels with
'ggplot2'},
  author = {Kamil Slowikowski},
  year = {2021},
  note = {R package version 0.9.1},
  url = {https://CRAN.R-project.org/package=ggrepel},
}
@Manual{githubinstall,
  title = {githubinstall: A Helpful Way to Install R Packages Hosted on GitHub},
  author = {Koji Makiyama},
  year = {2018},
  note = {R package version 0.2.2},
  url = {https://CRAN.R-project.org/package=githubinstall},
}
@Manual{gridExtra,
  title = {gridExtra: Miscellaneous Functions for "Grid" Graphics},
  author = {Baptiste Auguie},
  year = {2017},
  note = {R package version 2.3},
  url = {https://CRAN.R-project.org/package=gridExtra},
}
@Article{limma,
  author = {Matthew E Ritchie and Belinda Phipson and Di Wu and Yifang Hu and Charity W Law and Wei Shi and Gordon K Smyth},
  title = {{limma} powers differential expression analyses for {RNA}-sequencing and microarray studies},
  journal = {Nucleic Acids Research},
  year = {2015},
  volume = {43},
  number = {7},
  pages = {e47},
  doi = {10.1093/nar/gkv007},
}
@Manual{org.Hs.eg.db,
  title = {org.Hs.eg.db: Genome wide annotation for Human},
  author = {Marc Carlson},
  year = {2020},
  note = {R package version 3.12.0},
}
@Manual{org.Mm.eg.db,
  title = {org.Mm.eg.db: Genome wide annotation for Mouse},
  author = {Marc Carlson},
  year = {2020},
  note = {R package version 3.12.0},
}
@Manual{pheatmap,
  title = {pheatmap: Pretty Heatmaps},
  author = {Raivo Kolde},
  year = {2019},
  note = {R package version 1.0.12},
  url = {https://CRAN.R-project.org/package=pheatmap},
}
@Manual{reactome.db,
  title = {reactome.db: A set of annotation maps for reactome},
  author = {Willem Ligtenberg},
  year = {2020},
  note = {R package version 1.74.0},
}
@Article{ReactomePA,
  title = {ReactomePA: an R/Bioconductor package for reactome pathway analysis and visualization},
  author = {Guangchuang Yu and Qing-Yu He},
  journal = {Molecular BioSystems},
  year = {2016},
  volume = {12},
  number = {12},
  pages = {477-479},
  pmid = {26661513},
  url = {http://pubs.rsc.org/en/Content/ArticleLanding/2015/MB/C5MB00663E},
  doi = {10.1039/C5MB00663E},
}
@Manual{readr,
  title = {readr: Read Rectangular Text Data},
  author = {Hadley Wickham and Jim Hester},
  year = {2020},
  note = {R package version 1.4.0},
  url = {https://CRAN.R-project.org/package=readr},
}
@Manual{Rgraphviz,
  title = {Rgraphviz: Provides plotting capabilities for R graph objects},
  author = {Kasper Daniel Hansen and Jeff Gentry and Li Long and Robert Gentleman and Seth Falcon and Florian Hahne and Deepayan Sarkar},
  year = {2020},
  note = {R package version 2.34.0},
}
@Manual{SeqNet,
  title = {SeqNet: Generate RNA-Seq Data from Gene-Gene Association Networks},
  author = {Tyler Grimes and Somnath Datta},
  year = {2019},
  note = {R package version 1.1.0},
  url = {https://CRAN.R-project.org/package=SeqNet},
}
@Manual{tibble,
  title = {tibble: Simple Data Frames},
  author = {Kirill Müller and Hadley Wickham},
  year = {2021},
  note = {R package version 3.1.0},
  url = {https://CRAN.R-project.org/package=tibble},
}
@Article{tidyverse,
  title = {Welcome to the {tidyverse}},
  author = {Hadley Wickham and Mara Averick and Jennifer Bryan and Winston Chang and Lucy D'Agostino McGowan and Romain François and Garrett Grolemund and Alex Hayes and Lionel Henry and Jim Hester and Max Kuhn and Thomas Lin Pedersen and Evan Miller and Stephan Milton Bache and Kirill Müller and Jeroen Ooms and David Robinson and Dana Paige Seidel and Vitalie Spinu and Kohske Takahashi and Davis Vaughan and Claus Wilke and Kara Woo and Hiroaki Yutani},
  year = {2019},
  journal = {Journal of Open Source Software},
  volume = {4},
  number = {43},
  pages = {1686},
  doi = {10.21105/joss.01686},
}
@Manual{topGO,
  title = {topGO: Enrichment Analysis for Gene Ontology},
  author = {Adrian Alexa and Jorg Rahnenfuhrer},
  year = {2020},
  note = {R package version 2.42.0},
}
@Manual{viridis,
  title = {viridis: Default Color Maps from 'matplotlib'},
  author = {Simon Garnier},
  year = {2018},
  note = {R package version 0.5.1},
  url = {https://CRAN.R-project.org/package=viridis},
}


text:
# test cases for boolean expressions

assert(1 != false && 1 != true)
assert(0 != false && 0 != true)
assert(!!1 == true)
assert(!!0 == false)

a = true
b = false
assert(!!list == true)
assert(a && b == false)
assert(!(a && b))
def test(a, b)
    while !(a && b)
        assert(false)
    end
end
test(true, true)

gha_license_id: MIT

gha_language: C

extension: be


text:
# generated from genmsg/cmake/pkg-msg-paths.cmake.develspace.in

set(race_MSG_INCLUDE_DIRS "/home/diogo/sims_ws/src/f1_10_sim/race/msg")
set(race_MSG_DEPENDENCIES sensor_msgs)

extension: cmake


text:
@inproceedings{10.1145/133160.133167,
author = {Harman, Donna},
title = {Relevance Feedback Revisited},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133167},
doi = {10.1145/133160.133167},
abstract = {Researchers have found relevance feedback to be effective in interactive information retrieval, although few formal user experiments have been made. In order to run a user experiment on a large document collection, experiments were performed at NIST to complete some of the missing links found in using the probabilistic retrieval model. These experiments, using the Cranfield 1400 collection, showed the importance of query expansion in addition to query reweighting, and showed that adding as few as 20 well-selected terms could result in performance improvements of over 100%. Additionally it was shown that performing multiple iterations of feedback is highly effective.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {1–10},
numpages = {10},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133169,
author = {Aalbersberg, IJsbrand Jan},
title = {Incremental Relevance Feedback},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133169},
doi = {10.1145/133160.133169},
abstract = {Although relevance feedback techniques have been investigated for more than 20 years, hardly any of these techniques has been implemented in a commercial full-text document retrieval system. In addition to pure performance problems, this is due to the fact that the application of relevance feedback techniques increases the complexity of the user interface and thus also the use of a document retrieval system. In this paper we concentrate on a relevance feedback technique that allows easily understandable and manageable user interfaces, and at the same time provides high-quality retrieval results. Moreover, the relevance feedback technique introduced unifies as well as improves other well-known relevance feedback techniques.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {11–22},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133171,
author = {Tague-Sutcliffe, Jean},
title = {Measuring the Informativeness of a Retrieval Process},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133171},
doi = {10.1145/133160.133171},
abstract = {Evaluation of information retrieval systems should be based on measures of the information provided by the retrieval process, “informativeness” measures which take into account the interactive and full-text nature of present-day systems and the different types of questions which are asked of them. Desirable properties for an informativeness measure are developed, including context sensitivity, user centrality, and logarithmic response. A hypergraph-based framework for measuring the informativeness of a retrieval process is presented and a measure developed which satisfies the desired properties. The measure is compared to previously developed information measures and illustrated via an application.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {23–36},
numpages = {14},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133172,
author = {Lewis, David D.},
title = {An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133172},
doi = {10.1145/133160.133172},
abstract = {Syntactic phrase indexing and term clustering have been widely explored as text representation techniques for text retrieval. In this paper we study the properties of phrasal and clustered indexing languages on a text categorization task, enabling us to study their properties in isolation from query interpretation issues. We show that optimal effectiveness occurs when using only a small proportion of the indexing terms available, and that effectiveness peaks at a higher feature set size and lower effectiveness level for a syntactic phrase indexing than for word-based indexing. We also present results suggesting that traditional term clustering method are unlikely to provide significantly improved text representations. An improved probabilistic text categorization method is also presented.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {37–50},
numpages = {14},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133175,
author = {Blosseville, M. J. and H\'{e}brail, G. and Monteil, M. G. and P\'{e}not, N.},
title = {Automatic Document Classification: Natural Language Processing, Statistical Analysis, and Expert System Techniques Used Together},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133175},
doi = {10.1145/133160.133175},
abstract = {In this paper we describe an automated method of classifying research project descriptions: a human expert classifies a sample set of projects into a set of disjoint and pre-defined classes, and then the computer learns from this sample how to classify new projects into these classes. Both textual and non-textual information associated with the projects are used in the learning and classification phases. Textual information is processed by two methods of analysis: a natural language analysis followed by a statistical analysis. Non-textual information is processed by a symbolic learning technique. We present the results of some experiments done on real data: two different classifications of our research projects.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {51–58},
numpages = {8},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133177,
author = {Masand, Brij and Linoff, Gordon and Waltz, David},
title = {Classifying News Stories Using Memory Based Reasoning},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133177},
doi = {10.1145/133160.133177},
abstract = {We describe a method for classifying news stories using Memory Based Reasoning (MBR) a k-nearest neighbor method), that does not require manual topic definitions. Using an already coded training database of about 50,000 stories from the Dow Jones Press Release News Wire, and SEEKER [Stanfill] (a text retrieval system that supports relevance feedback) as the underlying match engine, codes are assigned to new, unseen stories with a recall of about 80% and precision of about 70%. There are about 350 different codes to be assigned. Using a massively parallel supercomputer, we leverage the information already contained in the thousands of coded stories and are able to code a story in about 2 seconds. Given SEEKER, the text retrieval system, we achieved these results in about two person-months. We believe this approach is effective in reducing the development time to implement classification systems involving large number of topics for the purpose of classification, message routing etc.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {59–65},
numpages = {7},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133179,
author = {Keen, E. Michael},
title = {Term Position Ranking: Some New Test Results},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133179},
doi = {10.1145/133160.133179},
abstract = {Presents seven sets of laboratory results testing variables in term position ranking which produce a phrase effect by weighting the distance between proximate terms. Results of the 73 tests conducted by this project are included, covering variant term position algorithms, sentence boundaries, stopword counting, every pairs testing, field selection, and combinations of algorithm including collection frequency, record frequency and searcher weighted. The discussion includes the results of tests by Fagan and by Croft, the need for term stemming, proximity as a precision device, comparisons with Boolean, and the quality of test collections.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {66–76},
numpages = {11},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133180,
author = {Crouch, Carolyn J. and Yang, Bokyung},
title = {Experiments in Automatic Statistical Thesaurus Construction},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133180},
doi = {10.1145/133160.133180},
abstract = {A well constructed thesaurus has long been recognized as a valuable tool in the effective operation of an information retrieval system. This paper reports the results of experiments designed to determine the validity of an approach to the automatic construction of global thesauri (described originally by Crouch in [1] and [2] based on a clustering of the document collection. The authors validate the approach by showing that the use of thesauri generated by this method results in substantial improvements in retrieval effectiveness in four test collections. The term discrimination value theory, used in the thesaurus generation algorithm to determine a term's membership in a particular thesaurus class, is found not to be useful in distinguishing a “good” from an  “indifferent” or “poor” thesaurus class). In conclusion, the authors suggest an alternate approach to automatic thesaurus construction which greatly simplifies the work of producing viable thesaurus classes. Experimental results show that the alternate approach described herein in some cases produces thesauri which are comparable in retrieval effectiveness to those produced by the first method at much lower cost.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {77–88},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133181,
author = {Grefenstette, Gregory},
title = {Use of Syntactic Context to Produce Term Association Lists for Text Retrieval},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133181},
doi = {10.1145/133160.133181},
abstract = {One aspect of world knowledge essential to information retrieval is knowing when two words are related. Knowing word relatedness allows a system given a user's query terms to retrieve relevant documents not containing those exact terms. Two words can be said to be related if they appear in the same contexts Document co-occurrence gives a measure of word relatedness that has proved to be too rough to be useful. The relatively recent apparition of on-line dictionaries and robust and rapid parsers permits the extraction of finer word contexts from large corpora. In this paper, we will describe such an extraction technique that uses only coarse syntactic analysis and no domain knowledge. This technique produces lists of words related to any work appearing in a corpus. When the closest related terms were used in query expansion of a standard information retrieval testbed, the results were much better than that given by document co-occurence techniques, and slightly better than using unexpanded queries, supporting the contention that semantically similar words were indeed extracted by this technique.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {89–97},
numpages = {9},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133183,
author = {Anick, Peter G. and Flynn, Rex A.},
title = {Versioning a Full-Text Information Retrieval System},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133183},
doi = {10.1145/133160.133183},
abstract = {In this paper, we present an approach to the incorporation of object versioning into a distributed full-text information retrieval system. We propose an implementation based on “partially versioned” index sets, arguing that its space overhead and query-time performance make it suitable for full-text IR, with its heavy dependence on inverted indexing. We develop algorithms for computing both historical queries and time range queries and show how these algorithms can be applied to a number of problems in distributed information management, such as data replication, caching, transactional consistency, and hybrid media repositories.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {98–111},
numpages = {14},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133185,
author = {Burkowski, Forbes J.},
title = {Retrieval Activities in a Database Consisting of Heterogeneous Collections of Structured Text},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133185},
doi = {10.1145/133160.133185},
abstract = {The first part of this paper briefly describes a mathematical framework (called the containment model) that provides the operations and data structures for a text dominated database with a hierarchical structure. The database is considered to be a hierarchical collection of continuous extents each extent being a word, word phrase, text element or non-text element. The filter operations making up a search command are expressed in terms of containment criteria that specify whether a contiguous extent will be selected or rejected during a search. This formalism, comprised of the mathematical framework and its associated language, defines a conceptual layer upon which we can construct a well-defined higher level layer, specifically the user interface that serves to provide a level of  functionality that is closer to the needs of the user and the application domain.With the conceptual layer established, we go on to describe the design and implementation of a versatile interface which handles queries that search and navigate a heterogeneous collection of structured documents. Interface functionality is provided by a set of “worker” modules supported by an “environment” that is the same for all interfaces. The interface environment allows a worker to communicate with the underlying text retrieval engine using a well-defined command protocol that is based on a small set of filter operators. The overall design emphasizes: a) interface flexibility for a variety of search and browsing capabilities, b) the modular independence of the  interface with respect to its underlying retrieval engine, and c) the advantages to be accrued by defining retrieval commands using operators that are part of a text algebra that provides a sound theoretical foundation for the database.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {112–125},
numpages = {14},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133186,
author = {Deerwester, Scott C. and Waclena, Keith and LaMar, Michelle},
title = {A Textual Object Management System},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133186},
doi = {10.1145/133160.133186},
abstract = {Computer programs that access significant amounts of text usually include code that manipulates the textual objects that comprise it. Such programs include electronic mail readers, typesetters and, in particular, full-text information retrieval systems. Such code is often unsatisfying in that access to textual objects is either efficient, or flexible, but not both. A programming language like Awk or Perl provides very general facilities for describing textual objects, but at the cost of rescanning the text for every textual object. At the other extreme, full-text information retrieval systems usually offer access to a very limited number of kinds of textual objects, but this access is very efficient. The system described in this paper is a programming tool for managing textual  objects. It provides a great deal of flexibility, giving access to very complex document structure, with a large number of constituent kinds of textual objects. Further, it provides access to these objects very efficiently, both in terms of time and auxiliary space, by being very careful to access secondary storage only when absolutely necessary.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {126–139},
numpages = {14},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133188,
author = {Nie, Jian-Yun},
title = {Towards a Probabilistic Modal Logic for Semantic-Based Information Retrieval},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133188},
doi = {10.1145/133160.133188},
abstract = {Semantic-based approaches to Information Retrieval make a query evaluation similar to an inference process based on semantic relations. Semantic-based approaches find out hidden semantic relationships between a document and a query, but quantitative estimation of the correspondence between them is often empiric. On the other hand, probabilistic approaches usually consider only statistical relationships between terms. It is expected that improvement may be brought by integrating these two approaches. This paper demonstrates, using some particular probabilistic models which are strongly related to modal logic, that such an integration is feasible and natural. A new model is developed on the basis of an extended modal logic. It has the advantages of : (1) augmenting a semantic-based approach with a probabilistic measurement, and (2) augmenting a probabilistic approach with finer semantic relations than just statistical ones. It is shown that this model verifies most of the conditions for an absolute probability function.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {140–151},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133190,
author = {Wang, Z. W. and Wong, S. K. M. and Yao, Y. Y.},
title = {An Analysis of Vector Space Models Based on Computational Geometry},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133190},
doi = {10.1145/133160.133190},
abstract = {This paper analyzes the properties, structures and limitations of vector-based models for information retrieval from the computational geometry point of view. It is shown that both the pseudo-cosine and the standard vector space models can be viewed as special cases of a generalized linear model. More importantly, both the necessary and sufficient conditions have been identified, under which ranking functions such as the inner-product, cosine, pseudo-cosine, Dice, covariance and product-moment correlation measures can be used to rank the documents. The structure of the solution region for acceptable ranking is analyzed and an algorithm for finding all the solution vectors is suggested.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {152–160},
numpages = {9},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133191,
author = {Bartell, Brian T. and Cottrell, Garrison W. and Belew, Richard K.},
title = {Latent Semantic Indexing is an Optimal Special Case of Multidimensional Scaling},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133191},
doi = {10.1145/133160.133191},
abstract = {Latent Semantic Indexing (LSI) is a technique for representing documents, queries, and terms as vectors in a multidimensional real-valued space. The representtions are approximations to the original term space encoding, and are found using the matrix technique of Singular Value Decomposition. In comparison Multidimensional Scaling (MDS) is a class of data analysis techniques for representing data points as points in a multidimensional real-valued space. The objects are represented so that inter-point similarities in the space match inter-object similarity information provided by the researcher. We illustrate how the document representations given by LSI are equivalent to the optimal representations found when solving a particular MDS problem in which the given inter-object similarity  information is provided by the inner product similarities between the documents themselves. We further analyze a more general MDS problem in which the interdocument similarity information, although still in inner product form is arbitrary with respect to the vector space encoding of the documents.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {161–167},
numpages = {7},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133194,
author = {Glavitsch, Ulrike and Sch\"{a}uble, Peter},
title = {A System for Retrieving Speech Documents},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133194},
doi = {10.1145/133160.133194},
abstract = {An information retrieval model is presented for the retrieval of speech documents, i.e. audio recordings containing speech. The indexing vocabulary consists of indexing features that have the following characteristics. First, they are easy to recognize by speech recognition methods. Second, the number of different indexing features is small such that a reasonable amount of training data is sufficent to train the hidden Markov models that are used by the speech recognition process. Third, the retrieval method based on such indexing features achieves an acceptable retrieval effectiveness as shown by experiments on text collections. Fourth, these indexing features cannot only be identified in speech documents but also in text documents. From the last characteristic follows that speech  documents and text documents can be retrieved simultaneously. Analogously, the queries may contain either speech or text. Thus, we have a simple multimedia retrieval model where two different medias are indexed coherently. We also describe a prototype retrieval system under development.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {168–176},
numpages = {9},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133195,
author = {Margulis, Eugene L.},
title = {N-Poisson Document Modelling},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133195},
doi = {10.1145/133160.133195},
abstract = {This paper is a report of a study investigating the validity of the Multiple Poisson (nP) model of word distribution in document collections. An nP distribution is a mixture of n Poisson distributions with different means. We describe a practical algorithm for determining if a certain word is distributed acording to an nP distribution and computing the distribution parameters. The algorithm was applied to every word in four different document collections. It was found that over 70% of frequently occurring words and terms indeed behave according to the nP distributions. The results indicate that the proportion of nP words depends on the collection size, document length and the frequency  of the individual words. Most of the nP words recognised are distributed according to the mixture of relatively few single Poisson distributions (two, three or four). There is an indication that the number of single Poisson components in the mixture of relatively few single Poisson distributions (two, three or four). There is an indication that the number of single Poisson components in the mixture depends on the collection frequency of words.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {177–189},
numpages = {13},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133197,
author = {Hess, Michael},
title = {An Incrementally Extensible Document Retrieval System Based on Linguistic and Logical Principles},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133197},
doi = {10.1145/133160.133197},
abstract = {Most natural language based document retrieval systems use the syntax structures of constituent phrases of documents as index terms. Many of these systems also attempt to reduce the syntactic variability of natural language by some normalisation procedure applied to these syntax structures. However, the retrieval performance of such systems remains fairly disappointing. Some systems therefore use a meaning representation language to index and retrieve documents. In this paper, a system is presented that uses Horn Clause Logic as meaning representation language, employs advanced techniques from natural Language Processing to achieve incremental extensibility, and uses methods from Logic Programming to achieve robustness in the face of insufficient data.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {190–197},
numpages = {8},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133199,
author = {Cooper, William S. and Gey, Fredric C. and Dabney, Daniel P.},
title = {Probabilistic Retrieval Based on Staged Logistic Regression},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133199},
doi = {10.1145/133160.133199},
abstract = {The goal of a probabilistic retrieval system design is to rank the elements of the search universe in descending order of their estimated probability of usefulness to the user. Previously explored methods for computing such a ranking have involved the use of statistical independence assumptions and multiple regression analysis on a learning sample. In this paper these techniques are recombined in a new way to achieve greater accuracy of probabilistic estimate without undue additional computational complexity. The novel element of the proposed design is that the regression analysis be carried out in two or more levels or stages. Such an approach allows composite or grouped retrieval clues to be analyzed in an orderly manner -- first within groups, and then between. It compensates automatically for systematic biases introduced by the statistical simplifying assumptions, and gives rise to search algorithms of reasonable computational efficiency.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {198–210},
numpages = {13},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133202,
author = {Fuhr, Norbert},
title = {Integration of Probabilistic Fact and Text Retrieval},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133202},
doi = {10.1145/133160.133202},
abstract = {In this paper, a model for combining text and fact retrieval is described. A query is a set of conditions, where a single condition is either a text or fact condition. Fact conditions can be interpreted as being vague, thus leading to nonbinary weights for fact conditions with respect to database objects. For text conditions, we use descriptions of the occurence of terms in documents instead of precomputed indexing weights, thus treating terms similar to attributes. Probabilistic indexing weights for conditions are computed by introducing the notion of correctness (or acceptability) of a condition w.r.t. an object. These indexing weights are used in retrieval for a probabilistic ranking of objects based on the retrieval for a probabilistic ranking of objects based on the  retrieval-with-probabilistic-indexing (RPI) model, for which a new derivation is given here.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {211–222},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133203,
author = {Croft, W. Bruce and Smith, Lisa A. and Turtle, Howard R.},
title = {A Loosely-Coupled Integration of a Text Retrieval System and an Object-Oriented Database System},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133203},
doi = {10.1145/133160.133203},
abstract = {Document management systems are needed for many business applications. This type of system would combine the functionality of a database system, (for describing, storing and maintaining documents with complex structure and relationships) with a text retrieval system (for effective retrieval based on full text). The retrieval model for a document management system is complicated by the variety and complexity of the objects that are represented. In this paper, we describe an approach to complex object retrieval using a probabilistic inference net model, and an implementation of this approach using a loose coupling of an object-oriented database system (IRIS) and a text retrieval system based on inference nets (INQUERY). The resulting system is used to store long, structured documents and can retrieve document components (sections, figures, etc.) based on their contents or the contents of related components. The lessons learnt from the implementation are discussed.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {223–232},
numpages = {10},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133205,
author = {Dumais, Susan T. and Nielsen, Jakob},
title = {Automating the Assignment of Submitted Manuscripts to Reviewers},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133205},
doi = {10.1145/133160.133205},
abstract = {The 117 manuscripts submitted for the Hypertext '91 conference were assigned to members of the review committee, using a variety of automated methods based on information retrieval principles and Latent Semantic Indexing. Fifteen reviewers provided exhaustive ratings for the submitted abstracts, indicating how well each abstract matched their interests. The automated methods do a fairly good job of assigning relevant papers for review, but they are still somewhat poorer than assignments made manually by human experts and substantially poorer than an assignment perfectly matching the reviewers' own ranking of the papers. A new automated assignment method called “n of 2n” achieves better performance than human experts by sending reviewers more papers than they actually have to review and then allowing them to choose part of their review load themselves.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {233–244},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133207,
author = {Agosti, Maristella and Masotti, Maurizio},
title = {Design of an OPAC Database to Permit Different Subject Searching Accesses in a Multi-Disciplines Universities Library Catalogue Database},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133207},
doi = {10.1145/133160.133207},
abstract = {This paper presents searching approaches and user interface capabilities of DUO, an Online Public Access Catalogue (OPAC) designed to permit the users of three Universities of the Northeast of Italy different subject searching accesses to the co-operative multi-disciplines library catalogue database.The co-operative catalogue database is managed by one of the software systems developed under the italian national project for library automation: the SBN project. Since the SBN database has not been designed to be efficiently accessed for end-user searches, the DUO database has been designed to avoid duplication of the SBN database data and to be usable for making efficient subjects accesses to the catalogue documents. The DUO design choices are presented, in particular the  main choice of designing a “virtual” document that corresponds to each SBN document and that has unstructured data usable for subject search purposes.The paper presents a new kind of user-OPAC dialogue that makes available to the user different search approaches and on-line dictionaries. In particular the user during the interaction with the search tool can represent his information needs with the support of interface capabilities that are based on retrieval path history, and words and codes on-line dictionaries.DUO is the first Italian OPAC that has been made openly available to users of universities and research institutions. For this reason, it is also the first time that OPAC log data is going to be collected in Italy. This work mainly intends to  make a modern OPAC available to the users of a SBN catalogue database, but it is going to permit also to build up a knowledge on OPAC usage in Italy.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {245–255},
numpages = {11},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133208,
author = {Robertson, Alexander M. and Willett, Peter},
title = {Searching for Historical Word-Forms in a Database of 17th-Century English Text Using Spelling-Correction Methods},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133208},
doi = {10.1145/133160.133208},
abstract = {This paper discusses the application of algorithmic spelling-correction techniques to the identification of those words in a database of 17th century English text that are most similar to a query word in modern English. The experiments have used n-gram matching, non-phonetic coding and dynamic programming methods for spelling correction, and have demonstrated that high-recall searches can be carried out, although some of the searches are very demanding of computational resources. The methods are, in principle, applicable to historical texts in many languages and from many diffeent periods.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {256–265},
numpages = {10},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133209,
author = {Fox, Edward A. and Chen, Qi Fan and Heath, Lenwood S.},
title = {A Faster Algorithm for Constructing Minimal Perfect Hash Functions},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133209},
doi = {10.1145/133160.133209},
abstract = {Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is very close to the theoretical lower bound, i.e., around 2 bits per key. The various stages of processing are detailed, along with analytical and empirical results, including timing for a set of over 3.8 million keys that was processed on a NeXTstation in about 6 hours.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {266–273},
numpages = {8},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133210,
author = {Moffat, Alistair and Zobel, Justin},
title = {Parameterised Compression for Sparse Bitmaps},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133210},
doi = {10.1145/133160.133210},
abstract = {Full-text retrieval systems often use either a bitmap or an inverted file to identify which documents contain which terms, so that the documents containing any combination of query terms can be quickly located. Bitmaps of term occurrences are large, but are usually sparse, and thus are amenable to a variety of compression techniques. Here we consider techniques in which the encoding of each bitvector within the bitmap is parameterised, so that a different code can be used for each bitvector. Our experimental results show that the new methods yield better compression than previous techniques.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {274–285},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133211,
author = {Grandi, Fabio and Tiberio, Paolo and Zezula, Pavel},
title = {Frame-Sliced Partitioned Parallel Signature Files},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133211},
doi = {10.1145/133160.133211},
abstract = {The retrieval capabilities of the signature file access method have become very attractive for many data processing applications dealing with both formatted and unformatted data. However, performance is still a problem, mainly when large files are used and fast response required. In this paper, a high performance signature file organization is proposed, integrating the latest developments both in storage structure and parallel computing architectures. It combines horizontal and vertical approaches to the signature file fragmentation. In this way, a new, mixed decomposition scheme, particularly suitable for parallel implementation, is achieved. The organization, based on this fragmentation scheme, is called Fragmented Signature File. Performance analysis shows that  this organization provides very good and relatively stable performance, covering the full range of possible queries. For the same degree of parallelism, it outperforms any other parallel signature file organization that has been defined so far. The proposed method also has other important advantages concerning processing of dynamic files, adaptability to the number of available processors, load balancing, and, to some extent, fault-tolerant query processing.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {286–287},
numpages = {2},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133212,
author = {Allen, Bryce},
title = {Cognitive Differences in End User Searching of a CD-ROM Index},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133212},
doi = {10.1145/133160.133212},
abstract = {Cognitive abilities of fifty university students were tested using eight tests from the Kit of Factor-Referenced Cognitive Tests. All students searched for references on the same topic using a standard computerized index, and performance in the searches was analyzed using a variety of measures. Effects for cognitive differences, as well as for differences in demographic characteristics and knowledge, were identified using multiple regression. Perceptual speed had an effect on the quality of searches, and logical reasoning, verbal comprehension, and spatial scanning abilities influenced search tactics. It is suggested that information retrieval systems can be made more accessible to users with different levels of cognitive abilities through improvements that will assist users to scan lists of terms, choose appropriate vocabulary for searching, and select useful references.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {298–309},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133213,
author = {Sonnenwald, Diane H.},
title = {Developing a Theory to Guide the Process of Designing Information Retrieval Systems},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133213},
doi = {10.1145/133160.133213},
abstract = {The dominant approaches to information retrieval system design are based on rational theory and cognitive engineering. However, these theories as well as approaches in other disciplines, reviewed in this paper, do not account for communication, or interaction, among design participants which is critical to design outcomes. This research attempts to develop a descriptive design model that accounts for communication among users, designers, and developers throughout the design process. A pilot study has been completed and a preliminary model that represents a first step in understanding participants' evolving perceptions and expectations of the design process and its outcomes is described in this paper.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {310–317},
numpages = {8},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133214,
author = {Cutting, Douglass R. and Karger, David R. and Pedersen, Jan O. and Tukey, John W.},
title = {Scatter/Gather: A Cluster-Based Approach to Browsing Large Document Collections},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133214},
doi = {10.1145/133160.133214},
abstract = {Document clustering has not been well received as an information retrieval tool. Objections to its use fall into two main categories: first, that clustering is too slow for large corpora (with running time often quadratic in the number of documents); and second, that clustering does not appreciably improve retrieval.We argue that these problems arise only when clustering is used in an attempt to improve conventional search techniques. However, looking at clustering as an information access tool in its own right obviates these objections, and provides a powerful new access paradigm. We present a document browsing technique that employs document clustering as its primary operation. We also present fast (linear time) clustering algorithms which support this interactive browsing paradigm.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {318–329},
numpages = {12},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133215,
author = {Chalmers, Matthew and Chitson, Paul},
title = {Bead: Explorations in Information Visualization},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133215},
doi = {10.1145/133160.133215},
abstract = {We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling.Many areas of scientific research involve complex multivariate data. One example of this is Information Retrieval. Document comparisons may be done using a large number of variables. Such conditions do not favour the more well-known methods of visualization and graphical analysis, as it is rarely feasible to map each variable onto one aspect of even a three-dimensional, coloured and textured space.Bead is a prototype system for the graphically-based exploration of information. In this system, articles in a bibliography are represented by particles in 3-space. By using physically-based modelling techniques to  take advantage of fast methods for the approximation of potential fields, we represent the relationships between articles by their relative spatial positions. Inter-particle forces tend to make similar articles move closer to one another and dissimilar ones move apart. The result is a 3D scene which can be used to visualize patterns in the high-D information space.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {330–337},
numpages = {8},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133216,
author = {Williamson, Christopher and Shneiderman, Ben},
title = {The Dynamic HomeFinder: Evaluating Dynamic Queries in a Real-Estate Information Exploration System},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133216},
doi = {10.1145/133160.133216},
abstract = {We designed, implemented, and evaluated a new concept for visualizing and searching databases utilizing direct manipulation called dynamic queries. Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as sliders, and see the results immediately. By providing a graphical visualization of the database and search results, users can find trends and exceptions easily. User testing was done with eighteen undergraduate students who performed significantly faster using a dynamic queries interface compared to both a natural language system and paper printouts. The interfaces were used to explore a real-estate database and find homes meeting specific search criteria.},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {338–346},
numpages = {9},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

@inproceedings{10.1145/133160.133217,
author = {Krovetz, Robert},
title = {Panel on Corpus Linguistics and Information Retrieval},
year = {1992},
isbn = {0897915232},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/133160.133217},
doi = {10.1145/133160.133217},
booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {348–351},
numpages = {4},
location = {Copenhagen, Denmark},
series = {SIGIR '92}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr


text:
@inproceedings{LasekGagolewski2015:ekstraklasa,
   author = {Jan Lasek and Marek Gagolewski},
   title = {Predictive efficacy of a new association football league format in {P}olish {E}kstraklasa},
   year = {2015},
   booktitle = {Proc. Machine Learning and Data Mining for Sports Analytics'15},
   note = {in press}
}

@inproceedings{LasekGagolewski2015:fireman,
   author = {Jan Lasek and Marek Gagolewski},
   title = {The winning solution to the {AAIA'15} {D}ata {M}ining {C}ompetition: {T}agging firefighter activities at a fire scene},
   year = {2015},
   booktitle = {Proc. FedCSIS 2015},
   note = {in press}
}

repository: hubenjm/bibliography

repo_name: hubenjm/bibliography


text: .Smartprison .banner img[data-v-e8d0a9be]{width:100%}.Smartprison .Program[data-v-e8d0a9be]{padding:50px 0;margin:0 auto;max-width:1200px}.Smartprison .Program .title[data-v-e8d0a9be]{text-align:left;font-size:25px;font-weight:700;color:#080808;margin-bottom:15px}.Smartprison .Program .subtitle[data-v-e8d0a9be]{font-size:15px;margin-top:20px;line-height:30px;color:#080808;text-indent:2em;text-align:left;margin-bottom:15px}.Smartprison .Program .item[data-v-e8d0a9be]{margin-left:200px;width:800px;height:auto}.Smartprison .Program .prisonProgram[data-v-e8d0a9be]{position:relative;max-width:1140px;margin:20px auto;padding:20px 30px;text-align:center;background-color:rgba(222,230,238,.7)}.Smartprison .Program .prisonProgram .title1[data-v-e8d0a9be]{padding-top:10px;font-weight:700;font-size:25px;color:#333;text-align:left}.Smartprison .Program .prisonProgram .subtitle1[data-v-e8d0a9be]{font-size:15px;margin-top:20px;color:#333;text-indent:2em;text-align:left;margin-bottom:15px}.Smartprison .Program .prisonProgram .button[data-v-e8d0a9be]{position:absolute;bottom:20px;left:30px;width:133px;height:36px;line-height:36px;color:#000;font-size:12px;display:inline-block;border:1px solid #666;text-align:center}


text:
@InProceedings{steinhardta15,
  supplementary = {Supplementary:steinhardta15-supp.zip},
  title = {Reified Context Models},
  author = {Jacob Steinhardt and Percy Liang},
  pages = {1043-1052},
  abstract = {A classic tension exists between exact inference in a simple model and approximate inference in a complex model. The latter offers expressivity and thus accuracy, but the former provides coverage of the space, an important property for confidence estimation and learning with indirect supervision. In this work, we introduce a new approach, reified context models, to reconcile this tension. Specifically, we let the choice of factors in a graphical model (the contexts) be random variables inside the model itself. In this sense, the contexts are reified and can be chosen in a data-dependent way. Empirically, we show that our approach obtains expressivity and coverage on three sequence modeling tasks.},
}

repository: mreid/papersite

repo_name: mreid/papersite

gha_language: TeX


text:
@inproceedings{silva:cbsoft:2014:,
 author = {Campos, E.C. and Souza, L.B.L. and Maia, Marcelo de A.},
 title = {Nuggets Miner: Assisting Developers by Harnessing the StackOverflow},
 booktitle = {Proc. of the Brazilian Conference on Software: Theory and Practice (CBSoft 2014) - Tool Session},
 series = {CBSOFT'14},
 year = {2014},
 location = {Macei\'o, Brazil},
 pages = {8pp},
 numpages = {8},
 address = {Macei\'o, Brazil},
 keywords = {github, stackoverflow, crowd knowledge, ide integration},
}