dotfiles

My dotfiles
git clone git://pcardensab.com/dotfiles
Log | Files | Refs | Submodules | README

commit cb0ef3d2cf4a898567d204828cae6fbb8e11e9b9
parent 49678d96376e6ab3ad3cbe516bac1981eb4e6b40
Author: Pablo Cárdenas <pablo.cardenas@imca.edu.pe>
Date:   Thu, 23 Jul 2026 01:37:50 -0300

bib: update formatting

Diffstat:
M.config/bib/references.bib | 81+++++++++++++++++++++++++++----------------------------------------------------
1 file changed, 28 insertions(+), 53 deletions(-)

diff --git a/.config/bib/references.bib b/.config/bib/references.bib @@ -269,8 +269,6 @@ publisher = "Springer Berlin Heidelberg", address = "Berlin, Heidelberg", pages = "197--208", - abstract = "Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end computers are reported but are accessible only to a few. Graphics Processing Units (GPUs) of today have high computation power and low price. They have a restrictive programming model and are tricky to use. The G80 line of Nvidia GPUs can be treated as a SIMD processor array using the CUDA programming model. We present a few fundamental algorithms -- including breadth first search, single source shortest path, and all-pairs shortest path -- using CUDA on large graphs. We can compute the single source shortest path on a 10 million vertex graph in 1.5 seconds using the Nvidia 8800GTX GPU costing {\$}600. In some cases optimal sequential algorithm is not the fastest on the GPU architecture. GPUs have great potential as high-performance co-processors.", -%ISBN = "97-83540-772-2", } @InProceedings{martin2009, @@ -282,8 +280,6 @@ publisher = "Springer Berlin Heidelberg", address = "Berlin, Heidelberg", pages = "904--913", - abstract = "We present several algorithms that solve the single-source shortest-path problem using CUDA. We have run them on a database, composed of hundreds of large graphs represented by adjacency lists and adjacency matrices, achieving high speedups regarding a CPU implementation based on Fibonacci heaps. Concerning correctness, we outline why our solutions work, and show that a previous approach [10] is incorrect.", -%ISBN="978-3-642-01970-8" } @Book{sutton2018, @@ -298,7 +294,6 @@ @Article{sims2017, author = "Louie Sims", year = "2017", - month = "09", title = "Speed Development - A Critical Review", URL = "https://www.researchgate.net/publication/320107786", } @@ -357,7 +352,6 @@ author = "Anna Nagurney and Qiang Qiang", title = "A network efficiency measure for congested networks", journal = "Europhysics Letters", - abstract = "In this paper, we propose a network efficiency measure for congested networks, that captures demands, costs, flows, and behavior. The network efficiency/performance measure can identify which network components, that is, nodes and links, have the greatest impact in terms of their removal, due to, for example, natural disasters, structural failures, terrorist attacks, etc., and, hence, are important from both vulnerability as well as security standpoints. The new measure is applied to the Braess paradox network in which the demands are varied over the horizon and explicit formulae are derived for the importance values of the network nodes and links. This measure is applicable to such congested networks as urban transportation networks and the Internet.", } @Article{xie2018, @@ -408,7 +402,6 @@ ISSN = "1084-6654", year = "2009", volume = "14", - pages = "2.7", URL = "https://dl.acm.org/doi/10.1145/1498698.1537602", } @@ -422,7 +415,6 @@ year = "2009", URL = "https://epubs.siam.org/doi/abs/10.1137/1.9781611972863.13", eprint = "https://epubs.siam.org/doi/pdf/10.1137/1.9781611972863.13", - abstract = "Abstract We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.", } @Article{delling2013, @@ -437,7 +429,6 @@ issue = "7", pages = "940--952", URL = "https://www.sciencedirect.com/science/article/abs/pii/S074373151200041X", - abstract = "We present a novel algorithm to solve the non-negative single-source shortest path problem on road networks and graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Because this sweep is independent of the source, we are able to reorder vertices in advance to exploit locality. Moreover, our algorithm takes advantage of features of modern CPU architectures, such as SSE and multiple cores. Compared to Dijkstra’s algorithm, our method needs fewer operations, has better locality, and is better able to exploit parallelism at multi-core and instruction levels. We gain additional speedup when implementing our algorithm on a GPU, where it is up to three orders of magnitude faster than Dijkstra’s algorithm on a high-end CPU. This makes applications based on all-pairs shortest-paths practical for continental-sized road networks. Several algorithms, such as computing the graph diameter, arc flags, or exact reaches, can be greatly accelerated by our method.", } @Article{delling2011, @@ -504,7 +495,6 @@ series = "Springer Tracts on Transportation and Traffic 15", edition = "1st ed. 2020", URL = "https://link.springer.com/book/10.1007/978-3-030-34102-2", -%ISBN = "978-3-030-34101-5,978-3-030-34102-2", } @Article{carvalho2021, @@ -526,8 +516,7 @@ title = "Percolation", author = "Geoffrey Grimmett", publisher = "Springer-Verlag Berlin Heidelberg", -%ISBN = "9783-540-6490-2-1,3-540-64902-6", - year = "1999", + year = "1999", series = "Grundlehren der mathematischen Wissenschaften 321", edition = "2", URL = "https://link.springer.com/book/10.1007/978-3-662-03981-6", @@ -583,7 +572,6 @@ author = "Sacha Friedli and Yvan Velenik", year = "2017", DOI = "https://doi.org/10.1017/9781316882603", -%ISBN={978-1-107-18482-4}, } @Book{schroeder2021, @@ -594,8 +582,6 @@ author = "Daniel V. Schroeder", publisher = "OUP Oxford", ISBN = "0-19-289554-0", -%isbn = {9780192895547}, -%isbn = {9780201380279}, } @Book{fernandez2002, @@ -615,7 +601,6 @@ series = "PAM", edition = "2", URL = "https://www.wiley.com/en-us/Real+Analysis%3A+Modern+Techniques+and+Their+Applications%2C+2nd+Edition-p-9780471317166", -%isbn = {9780471317166}, } @Book{royden2010, @@ -626,7 +611,6 @@ year = "2010", edition = "4", URL = "https://www.amazon.com/dp/013143747X", -%isbn = {9780131437470}, } @Book{athreya2006, @@ -668,8 +652,7 @@ @Book{stoer2002, title = "Introduction to Numerical Analysis", -%ISBN = "9781-475-7559-2-3", - DOI = "http://doi.org/10.1007/978-1-4757-5592-3", + DOI = "http://doi.org/10.1007/978-1-4757-5592-3", publisher = "Springer New York", author = "J. Stoer and R. Bulirsch", year = "2002", @@ -693,8 +676,7 @@ title = "{TeX} Reference Manual", author = "David Bausum", publisher = "Springer US", -%isbn = {978-0-7923-7673-6,978-1-4615-0941-7}, - year = "2002", + year = "2002", edition = "1", DOI = "http://dx.doi.org/10.1007/978-1-4615-0941-7", } @@ -703,8 +685,7 @@ title = "tmux 2: Productive Mouse-Free Development", author = "Brian P. Hogan", publisher = "Pragmatic Bookshelf", -%isbn = {9781680502213}, - year = "2016", + year = "2016", edition = "1", URL = "https://pragprog.com/titles/bhtmux2/tmux-2/", } @@ -750,8 +731,7 @@ title = "Low Level {X} Window Programming An Introduction by Examples", author = "Ross J. Maloney", publisher = "Springer", -%isbn = {9783319742496}, - year = "2017", + year = "2017", series = "", edition = "", volume = "", @@ -761,8 +741,7 @@ @Book{garcia2014, title = "Elementos de {\'a}lgebra", author = "A. Garcia and Y. Lequain", -%isbn={9788524401909}, - series = "Projeto Euclides", + series = "Projeto Euclides", year = "2012", publisher = "Instituto de Matem{\'a}tica Pura e Aplicada", } @@ -956,7 +935,6 @@ author = "Michael Reed and Barry Simon", publisher = "Academic Press", year = "1981", - volume = "Vol 1.", } @Book{yosida1995, @@ -1126,14 +1104,12 @@ publisher = "Springer", year = "1953", series = "Elements of Mathematics", - volume = "Chapter 1-5", URL = "https://link.springer.com/book/10.1007/978-3-642-61715-7", } @Article{talagrand1996, ISSN = "00911798, 2168894X", URL = "http://www.jstor.org/stable/2244967", - abstract = "Majorizing measures provided bounds for the supremum of stochastic processes. They represent the most general possible form of the chaining argument going back to Kolmogorov. Majorizing measures arose from the theory of Gaussian processes, but they now have applications far beyond the setting. The fundamental question is the construction of these measures. This paper focuses on the tools that have been developed for this purpose and, in particular, the use of geometric ideas. Applications are given to several natural problems where entropy methods are powerless.", author = "Michel Talagrand", journal = "The Annals of Probability", number = "3", @@ -1797,7 +1773,7 @@ author = "Alec Radford and Karthik Narasimhan", year = "2018", URL = "https://cdn.openai.com/research-covers/language-unsupervised/language_understanding_paper.pdf", - alias = "GPT-1", + alias = "GPT-1", } @InProceedings{radford2019, @@ -1806,14 +1782,13 @@ year = "2019", URL = "https://api.semanticscholar.org/CorpusID:160025533", localrefs = "Radford et al., 2018=radford2018", - alias = "GPT-2", + alias = "GPT-2", } @Article{brown2020, author = "Tom B. Brown and Benjamin Mann and Nick Ryder and Melanie Subbiah and Jared Kaplan and Prafulla Dhariwal and Arvind Neelakantan and Pranav Shyam and Girish Sastry and Amanda Askell and Sandhini Agarwal and Ariel Herbert{-}Voss and Gretchen Krueger and Tom Henighan and Rewon Child and Aditya Ramesh and Daniel M. Ziegler and Jeffrey Wu and Clemens Winter and Christopher Hesse and Mark Chen and Eric Sigler and Mateusz Litwin and Scott Gray and Benjamin Chess and Jack Clark and Christopher Berner and Sam McCandlish and Alec Radford and Ilya Sutskever and Dario Amodei", title = "Language Models are Few-Shot Learners", journal = "CoRR", - volume = "abs/2005.14165", year = "2020", URL = "https://arxiv.org/abs/2005.14165", eprinttype = "arXiv", @@ -1822,17 +1797,17 @@ biburl = "https://dblp.org/rec/journals/corr/abs-2005-14165.bib", bibsource = "dblp computer science bibliography, https://dblp.org", localrefs = "RWC+ 19=radford2019", - alias = "GPT-3", + alias = "GPT-3", } -@misc{hu2021, - title={LoRA: Low-Rank Adaptation of Large Language Models}, - author={Edward J. Hu and Yelong Shen and Phillip Wallis and Zeyuan Allen-Zhu and Yuanzhi Li and Shean Wang and Lu Wang and Weizhu Chen}, - year={2021}, - eprint={2106.09685}, - archivePrefix={arXiv}, - primaryClass={cs.CL}, - url={https://arxiv.org/abs/2106.09685}, +@Misc{hu2021, + title = "{LoRA}: Low-Rank Adaptation of Large Language Models", + author = "Edward J. Hu and Yelong Shen and Phillip Wallis and Zeyuan Allen-Zhu and Yuanzhi Li and Shean Wang and Lu Wang and Weizhu Chen", + year = "2021", + eprint = "2106.09685", + archiveprefix = "arXiv", + primaryclass = "cs.CL", + URL = "https://arxiv.org/abs/2106.09685", } @Misc{mikolov2013, @@ -1938,7 +1913,7 @@ year = "1989", series = "Chapman \& Hall/CRC Monographs on Statistics \& Applied Probability", edition = "2", - alias = "GLM", + alias = "GLM", } @Book{faraway2016, @@ -1948,7 +1923,7 @@ year = "2016", series = "Chapman \& Hall/CRC texts in statistical science series 124", edition = "Second edition.", - alias = "GAM,GLM", + alias = "GAM,GLM", } @Book{faraway2014, @@ -1966,7 +1941,7 @@ publisher = "Chapman \& Hall/CRC", year = "2006", series = "Texts in statistical science.", - alias = "GAM", + alias = "GAM", } @Book{chambers1992, @@ -2054,14 +2029,14 @@ keywords = "vectorization, raster, sketch, drawing", } -@misc{zhang2025, - title={Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models}, - author={Yanzhao Zhang and Mingxin Li and Dingkun Long and Xin Zhang and Huan Lin and Baosong Yang and Pengjun Xie and An Yang and Dayiheng Liu and Junyang Lin and Fei Huang and Jingren Zhou}, - year={2025}, - eprint={2506.05176}, - archivePrefix={arXiv}, - primaryClass={cs.CL}, - url={https://arxiv.org/abs/2506.05176}, +@Misc{zhang2025, + title = "Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models", + author = "Yanzhao Zhang and Mingxin Li and Dingkun Long and Xin Zhang and Huan Lin and Baosong Yang and Pengjun Xie and An Yang and Dayiheng Liu and Junyang Lin and Fei Huang and Jingren Zhou", + year = "2025", + eprint = "2506.05176", + archiveprefix = "arXiv", + primaryclass = "cs.CL", + URL = "https://arxiv.org/abs/2506.05176", } @Misc{zeng2024,