UP | HOME

Jeremy's sources of funding

Table of Contents

funding.png

1 Introduction

I have managed and been part various research projects, listed in the array below:

Grant/Award Role and Nb Duration Period Dedication Total amount Total amount Total amount Total amount
  Participants (years)   (h/week) CLP EUR CAD USD
Millenium Nucleus ICM/FIC P10-024F (2) CI (out of 18) 2 [2013-2014] 25       1,000,000
Fondecyt Regular 1120054 (3) PI (out of 4) 3 [2012-2014] 15 56,969,000 81,490.93 117,319.85 112,320
Fondecyt Regular 1110066 (4) CI (out of 3) 3 [2011-2013] 5 71,305,000     140,585
Taller de Proyecto (5) SI DNA [2011-now] 6 9,056,000      
Fundo de Visitas a la Investigación (6) SI DNA [2008-now] DNA 1,000,000 /year     2,000 /year
Fundo de Incentivo a la Investigación (7) SI DNA [2008-now] DNA 12,000,000     23,659
NSERC (8) SI 3 [2005-2008] DNA   41,662.21 60,000 57,444
Starting Grant (9) SI 1 [2004-2006] DNA   6,943.70 10,000 9,573
UBC Post Doctoral Fellowship (10) SI 2 [2002-2004] DNA        
INRIA Post Doctoral Fellowship (11) SI 1 [2002-2003] DNA        
Approximation and online algorithms (12) CI (out of 17) 3 [2001-2002] DNA        
Approximation and online algorithms (13) CI (out of 15) 1 [2000-2001] DNA        
  • PI stands for Principal Invesigator,
  • SI stands for Solo Investigator,
  • CI stands for Co-Investigator or participant,
  • DNA stands for "Does Not Apply".

The amounts in bold are the real amounts, others are approximation in other currencies for ease of comparison.

2 [2013-2014] Millenium Nucleus ICM/FIC P10-024F    CI

Title
Information and Coordination in Networks ("Información y Coordinación en Redes")
Project Manager
Jose Correa
Length
2 years
Period
[2013-2014]
Nb Participants
18
Budget
1,000,000 USD
Hourly Weeks
25

http://www.acgo.uchile.cl

  1. Objectives

    A través del proyecto Núcleo Milenio Información y Coordinación en Redes buscamos consolidar un grupo de investigación líder en el desarrollo, aplicación y diseminación de herramientas de Algoritmos, Combinatoria, Juegos y Optimización (ACGO), las cuales son críticas a la hora de abordar sistemas descentralizados masivos. La aparición reciente de grandes redes en ingeniería, biología y las ciencias sociales, presenta desafíos de modelamiento y algorítmicos sin precedentes, los cuales surgen del gran volumen de datos que deben ser manejados, del hecho de que la información está distribuida y llena de ruido, y de la presencia de agentes que interactúan con distintos objetivos. Estos desafíos constituyen la base temática de nuestra propuesta.

    El origen de nuestro grupo se remonta a agosto del 2008, cuando varios investigadores de los departamentos de Ciencias de la Computación, Ingeniería Industrial e Ingeniería Matemática de la Universidad de Chile, formamos un grupo de interés en las temáticas ACGO. Se inauguró un seminario semanal, el cual ha estado funcionando desde ese entonces, creando un intercambio activo que favorece la detección de intereses comunes. Este proyecto es un importante primer paso para incrementar nuestra actividad, permitiéndonos atraer, entrenar y retener más estudiantes y jóvenes investigadores.

  2. Publications

3 [2012-2014] Fondecyt Regular 1120054 "Compressed Data Structures and Compressability Measures"    SI

Length
3 years
Period
[2012-2014]
Nb Participants
4
Budget
112,320 MCLP
Hourly Weeks
15
  1. Members
    • Responsable: Barbay Jeremy
    • Inv-ext-contrap: Luca Castelli Aleardi
    • Inv-ext-contrap: Rao Srinivasa Satti
    • Inv-ext-contrap: Nodari Sitchinava
  2. Publications
    1. Journal
    2. Conferences
  3. Visits
    • I visited Luca Castelli-Aleardi in Paris in 2012;
    • Srinivas Rao visited me in Santiago in 2012;
    • Nodari Sitchinava visited me in Santiago in 2013;
    • Luca Castelli-Aleardi visited me in Santiago in 2014.
  4. Travels
    1. 2012:
      1. Visit to Coruña [2012-05-01 Tue]-[2012-05-04 Fri]
        • Visit to Nieve Brisaboa
        • Scientific talk: Sorting and Compression
        • Pedagogical Talk: Binary Relations
        • Meetings with
          • Nieve Brisaboa (Data Structures for RDF documents)
          • Jose Ramon Parama (Adaptive Computational Geometry)
          • Diego Secco (Synergy analysis of Adaptive Sorting)
          • Alejandro Fariña (Survey of Intersection Algorithms)
          • Angele (Boot Strapping Databases)
      2. Visit to Valladolid [2012-05-07 Mon]-[2012-05-04 Fri]
        • Visit to Miguel A. Martinez Prieto
        • Scientific talk: Sorting and Compression
        • Pedagogical Talk: Binary Relations
        • Meetings with
          • Miguel and his student Javier (Data Structures for RDF documents)
        • Thesis Exam of Javier with Claudio Gutierrez, Miguel and Xavier via Webconference
      3. Visit to Corvallis [2012-07-29 Sun]-[2012-08-05 Sun]
      4. Presentation at CCCG [2012-08-07 Tue 18:0]-[2012-08-10 Fri 15:0]
        • Adaptive Techinques for the computation of Optimal Boxes.
      5. Visit to Waterloo [2012-08-11 Sat]-[2012-08-15 Wed]
      6. Visit to Toronto [2012-08-16 Thu]-[2012-08-18 Sat]
    2. 2013:
      1. Comision de Estudio [2012-12-16 Sun]-[2013-06-04 Tue]

        Mientras mi comision de estudio, puse concentrarme mas en mi trabajo de investigacion:

        • He submitido dos trabajos a conferencias internacionales que fueron acceptados:
          1. "Maximum-Weight Planar Boxes in \(O(n^2)\) Time (and Better)" a la conferencia CCCG 2013, con co-autores Chan, Navarro y Perez-Lanter", que presentare en Canada en Augusto;
          2. "Theory and Implementation of Online Multiselection Algorithms", a la conferencia ESA 2013, con co-autores Gupta, Jo, Rao y Sorenson, que mi co-autor Ankur Gupta presentara en Francia en Septembre.
        • He terminado dos articulos de revistas:
          1. "Instance Optimal Geometric Algorithms", con co-autores Afshani y Chan, por cual espero respuesta de mis co-autores antes de submitir; y
          2. "Compressed Representations Of Permutations And Applications", con co-autor Navarro, submitido a la revista intenacional TCS.
        • He escrito un survey de 15 paginas intitulado "From Time to Space: Fast Algorithms that yield Small and Fast Data Structures", respondiendo a una invitacion por el evento "Conference on Space Efficient Data Structures, Streams and Algorithms (IanFest)", organizado como un Festschrift en el honor de los 66 anos de mi mentor Ian J. Munro. Planifico usar este survey en mi curso el proximo semestre, mientras le extendere en una tesis de 40 a 80 paginas, y potentialemente en un libro mas tarde.
        • He dado una charla sobre el mismo tema que mi survey, "From Time to Space: Fast Algorithms that yield Small and Fast Data Structures" en el laboratorio LIAFA de la universidad "Paris-Diderot", el Martes 26 de Marso 2013.
        • He collaborado con Luca Castelli Aleardi (Ecole Polytechnique, France) y Jean Cardinal (Universidad Libre de Belgica, Belgica) en el tema de la codificacion y compression de graphes complejos, lo que esta resultiendo en una applicacion de financiamiento para mas investigacion con la empresa Google.

        Estoy muy orgulloso de la produccion de 5 documentos de investigacion en un poco menos de 6 meses, ademas de haber reorganizado parcialemente mi entorno y methodologia de trabajo.

      2. Visit to Canada [2013-08-02 Fri]–[2013-08-19 Mon]
        1. Summer School in Computational Geometry and Data Structures, Waterloo, Ontario
        2. Conference CCCG, Waterloo, Ontario
        3. Conference WADS, London, Ontario
        4. Conference IanFest, Waterloo, Ontario
      3. Visit to Denmark [2014-01-04 Sat]-[2014-01-30 Thu]
        • Collaboration with Peyman Afshani
    3. 2014:

4 [2011-2013] Fondecyt Regular 1110066 "Compact Data Structures for Information Retrieval"    CI

Project Manager
Gonzalo Navarro
Length
3 years
Period
[2011-2013]
Nb Participants
3
Budget
140,585 MCLP
Hourly Weeks
5
  1. Publications

5 [2011-now] Fundo Pedagogico EI2001: Taller de Proyecto    PI

Project Manager
Jérémy Barbay
Period
[2009-now]
Nb Participants
1

6 [2008-now] Fundo de Visitas a la Investigación (FVI)    PI

Period
[2008-now]
Budget
1,000 MCLP per year

Funding for one international academic visit a year, under the condition that the visitors holds a PhD, gives a research talk and stays a minimum of three weeks in Chile. It amounts to 1,000 MCLP, which is usually sufficient to pay for a small appartment with kitchen for the period involved.

  1. Visitors
    1. 2013 Nodari Sitchinava
      • Planned Collaboration: "Parallel Adaptive Algorithms"
    2. 2012 Srinivas Rao
      • Planned Collaboration: "Compressed Data Structures for LRM and RMQ queries"
      • Talks:
        • "B-Tree indexes on flash memory"
        • "Space efficient two dimensional range minimum data structures"
    3. 2011 Yakov Nekrich
      • Planned Collaboration: "Estructuras de datos compactas".
    4. 2009 Arash Farzan
      • Talk: "Towards unifying succinct representations of trees"
    5. 2008 Peyman Afshani
      • Planned Collaboration: "Adaptive Algorithms in Computational Geometry"
      • Talk: "Range Queries in Computational Geometry"

7 [2008-now] Fundo de Incentivo a la Investigación (FII)    SI

Period
[2008-now]
Nb Participants
1
Budget
12,000 MCLP (≈ 23,659 USD)

Funding from the Department of Computer Science (DCC) of the Faculty of Physical and Mathematical Sciences of the University of Chile, which monthly amount is computed based on the research productivity (in terms of scientific publications).

Year Amount Received Amount received
  1.00 CLP 0.00181830 USD
2014 7453200 13552.154
2013 9168479 16671.045
2012 5833732 10607.475
2011 4841868 8803.9686
2010 1684178 3062.3409
2009 614481 1117.3108
2008 1956760 3557.9767

8 [2005-2008] NSERC    SI

Length
3 years
Period
[2005-2008]
Nb Participants
1
Budget
57,444
  1. Publications

9 [2004-2006] Starting Grant from the University of Waterloo    SI

Length
1 year
Period
[2004-2006]
Nb Participants
1
Budget
9,573 CAD

10 [2002-2004] UBC Post Doctoral Fellowship    SI

Length
2 years
Period
[2002-2004]
Nb Participants
1
Advisors
Will Evans, Joël Friedman, David Kirkpatrick.

11 [2002-2003] INRIA Post Doctoral Fellowship    SI

Length
1 year
Period
[2002-2003]
Nb Participants
1

12 [2001-2002] Approximation and online algorithms (APPOL2)    CI

Length
1 year
Period
[2001-2002]
Nb Participants
17

13 [2000-2001] Approximation and online algorithms (APPOL)    CI

Length
1 year
Period
[2000-2001]
Nb Participants
15