Filtros : "2017" "Financiado pela DFG" Removidos: "TRABALHO DE EVENTO-ANAIS PERIODICO" "Universidade Estadual de Maringá (UEM)" "Tufaile, Adriana Pedrosa Biscaia" "TRABALHO DE EVENTO" Limpar

Filtros



Refine with date range


  • Source: BMC Neuroscience. Conference titles: Annual Computational Neuroscience Meeting (CNS). Unidade: FFCLRP

    Subjects: REDES NEURAIS, NEUROCIÊNCIAS

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PENA, Rodrigo Felipe de Oliveira et al. Determination of the spike‑train power spectrum statistics in modular networks with mixtures of diferent excitatory and inhibitory populations. BMC Neuroscience. London: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Disponível em: https://bmcneurosci.biomedcentral.com/track/pdf/10.1186/s12868-017-0371-2. Acesso em: 07 jul. 2024. , 2017
    • APA

      Pena, R. F. de O., Bernardi, D., Roque, A. C., & Lindner, B. (2017). Determination of the spike‑train power spectrum statistics in modular networks with mixtures of diferent excitatory and inhibitory populations. BMC Neuroscience. London: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Recuperado de https://bmcneurosci.biomedcentral.com/track/pdf/10.1186/s12868-017-0371-2
    • NLM

      Pena RF de O, Bernardi D, Roque AC, Lindner B. Determination of the spike‑train power spectrum statistics in modular networks with mixtures of diferent excitatory and inhibitory populations [Internet]. BMC Neuroscience. 2017 ; 18 59.[citado 2024 jul. 07 ] Available from: https://bmcneurosci.biomedcentral.com/track/pdf/10.1186/s12868-017-0371-2
    • Vancouver

      Pena RF de O, Bernardi D, Roque AC, Lindner B. Determination of the spike‑train power spectrum statistics in modular networks with mixtures of diferent excitatory and inhibitory populations [Internet]. BMC Neuroscience. 2017 ; 18 59.[citado 2024 jul. 07 ] Available from: https://bmcneurosci.biomedcentral.com/track/pdf/10.1186/s12868-017-0371-2
  • Source: Canadian Journal of Chemical Engineering. Unidade: EP

    Subjects: REDES NEURAIS, USINAGEM

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ASSENHAIMER, Cristhiane et al. Long-term monitoring of metalworking fluid emulsion aging using a spectroscopic sensor. Canadian Journal of Chemical Engineering, v. 95, n. 12, p. 2341-2349, 2017Tradução . . Disponível em: https://doi.org/10.1002/cjce.22931. Acesso em: 07 jul. 2024.
    • APA

      Assenhaimer, C., Domingos, A. S., Glasse, B., Fritsching, U., & Guardani, R. (2017). Long-term monitoring of metalworking fluid emulsion aging using a spectroscopic sensor. Canadian Journal of Chemical Engineering, 95( 12), 2341-2349. doi:10.1002/cjce.22931
    • NLM

      Assenhaimer C, Domingos AS, Glasse B, Fritsching U, Guardani R. Long-term monitoring of metalworking fluid emulsion aging using a spectroscopic sensor [Internet]. Canadian Journal of Chemical Engineering. 2017 ;95( 12): 2341-2349.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1002/cjce.22931
    • Vancouver

      Assenhaimer C, Domingos AS, Glasse B, Fritsching U, Guardani R. Long-term monitoring of metalworking fluid emulsion aging using a spectroscopic sensor [Internet]. Canadian Journal of Chemical Engineering. 2017 ;95( 12): 2341-2349.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1002/cjce.22931
  • Source: Discrete Mathematics. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CHEN, Guantao et al. Nonempty intersection of longest paths in series-parallel graphs. Discrete Mathematics, v. 340, n. 3, p. 287-304, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2016.07.023. Acesso em: 07 jul. 2024.
    • APA

      Chen, G., Ehrenmüller, J., Fernandes, C. G., Heise, C. G., Shan, S., Yang, P., & Yates, A. N. (2017). Nonempty intersection of longest paths in series-parallel graphs. Discrete Mathematics, 340( 3), 287-304. doi:10.1016/j.disc.2016.07.023
    • NLM

      Chen G, Ehrenmüller J, Fernandes CG, Heise CG, Shan S, Yang P, Yates AN. Nonempty intersection of longest paths in series-parallel graphs [Internet]. Discrete Mathematics. 2017 ; 340( 3): 287-304.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.disc.2016.07.023
    • Vancouver

      Chen G, Ehrenmüller J, Fernandes CG, Heise CG, Shan S, Yang P, Yates AN. Nonempty intersection of longest paths in series-parallel graphs [Internet]. Discrete Mathematics. 2017 ; 340( 3): 287-304.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.disc.2016.07.023
  • Source: Fluids. Unidades: EP, IPEN

    Subjects: ESCOAMENTO MULTIFÁSICO, SENSOR, USINAGEM

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SANDER, Sören et al. Emulsion flow analysis of a sensor probe for sustainable machine operation. Fluids, v. 2, n. 1, p. 1-8, 2017Tradução . . Disponível em: https://doi.org/10.3390/fluids201000. Acesso em: 07 jul. 2024.
    • APA

      Sander, S., Glasse, B., Grosche, L. C., Paiva, J. L. de, Guardani, R., & Fritsching, U. (2017). Emulsion flow analysis of a sensor probe for sustainable machine operation. Fluids, 2( 1), 1-8. doi:10.3390/fluids201000
    • NLM

      Sander S, Glasse B, Grosche LC, Paiva JL de, Guardani R, Fritsching U. Emulsion flow analysis of a sensor probe for sustainable machine operation [Internet]. Fluids. 2017 ;2( 1): 1-8.[citado 2024 jul. 07 ] Available from: https://doi.org/10.3390/fluids201000
    • Vancouver

      Sander S, Glasse B, Grosche LC, Paiva JL de, Guardani R, Fritsching U. Emulsion flow analysis of a sensor probe for sustainable machine operation [Internet]. Fluids. 2017 ;2( 1): 1-8.[citado 2024 jul. 07 ] Available from: https://doi.org/10.3390/fluids201000
  • Source: European Journal of Combinatorics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, v. 65, p. 276-287, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.008. Acesso em: 07 jul. 2024.
    • APA

      Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, 65, 276-287. doi:10.1016/j.ejc.2017.04.008
    • NLM

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
    • Vancouver

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
  • Source: European Journal of Combinatorics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, v. 65, p. 288-301, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.007. Acesso em: 07 jul. 2024.
    • APA

      Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, 65, 288-301. doi:10.1016/j.ejc.2017.04.007
    • NLM

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007
    • Vancouver

      Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 jul. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024