{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"Julia-Papers-Metadata","owner":"JuliaPapers","isFork":false,"description":"Julia related publications.","allTopics":["bibtex","paper-with-code","julia"],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"Creative Commons Zero v1.0 Universal","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-30T16:47:56.728Z"}},{"type":"Public","name":"MatrixProductStates.jl","owner":"JuliaPapers","isFork":true,"description":"Julia implementation of algorithms for matrix product states","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-23T07:28:58.631Z"}},{"type":"Public","name":"TwoLociSingleParticleTrajectories","owner":"JuliaPapers","isFork":false,"description":"","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-30T05:37:40.552Z"}},{"type":"Public","name":"CRM-CFP","owner":"JuliaPapers","isFork":true,"description":"CRM-CFP concerns numerical results where the Circumcentered-Reflection Method (CRM) is used to solve the Convex Feasibility Problem (CFP) of finding a common point to the nonempty intersection of closed and convex sets.","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":4,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-01-12T17:59:10.269Z"}},{"type":"Public","name":"Abeta_SILK_julia_011421","owner":"JuliaPapers","isFork":true,"description":"","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-12T22:41:51.384Z"}},{"type":"Public","name":"DielectricUpdateTechnique.jl","owner":"JuliaPapers","isFork":true,"description":"","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-10T09:18:43.284Z"}},{"type":"Public","name":"MPM-Julia","owner":"JuliaPapers","isFork":true,"description":"Julia implementation of the material point method (MPM)","allTopics":["julia","julia-language","material-point-method","mpm"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":13,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-06T14:52:54.657Z"}},{"type":"Public","name":"EM3DANI","owner":"JuliaPapers","isFork":true,"description":"A Julia package for isotropic/anisotropic 3D forward modeling of frequency-domain electromagnetic (CSEM and MT) data.","allTopics":[],"primaryLanguage":{"name":"Fortran","color":"#4d41b1"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":8,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-04T08:44:23.908Z"}},{"type":"Public","name":"He-Kelly-Manela-2017-JFE","owner":"JuliaPapers","isFork":false,"description":"Replication code for He-Kelly-Manela (2017 JFE) main results. (julia 1.0 version)","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-10-06T08:34:43.006Z"}},{"type":"Public","name":"DiskJockey","owner":"JuliaPapers","isFork":true,"description":"Protoplanetary Disk Modeling for Dynamical Mass Derivation","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":7,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-04-25T15:50:58.152Z"}},{"type":"Public","name":"BayesEstDiffusion.jl","owner":"JuliaPapers","isFork":true,"description":"Code accompanying the paper Frank van der Meulen, Moritz Schauer: Bayesian estimation of discretely observed multi-dimensional diffusion processes using guided proposals ","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-16T10:37:44.282Z"}},{"type":"Public","name":"HAFcall","owner":"JuliaPapers","isFork":true,"description":"Haplotype calling package for low coverage Frequency calling","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-15T14:24:15.548Z"}},{"type":"Public","name":"optimalPLD","owner":"JuliaPapers","isFork":true,"description":"Code for paper \"Exact First-Choice Product Line Optimization\" by D. Bertsimas and V. V. Mišić","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":5,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-12-27T21:30:48.011Z"}},{"type":"Public","name":"whitefish_diffusion","owner":"JuliaPapers","isFork":true,"description":"","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-06-05T12:52:30.055Z"}},{"type":"Public","name":"whitefish_generation","owner":"JuliaPapers","isFork":true,"description":"Granular material structures generation engine","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-01-24T15:22:50.428Z"}},{"type":"Public","name":"PAINTER.jl","owner":"JuliaPapers","isFork":true,"description":"","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":10,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-03T11:01:32.009Z"}},{"type":"Public","name":"NS-LAMG","owner":"JuliaPapers","isFork":true,"description":"Algebric Multigrid Solver for Directed Graph Laplacian Systems","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-05-31T21:51:39.410Z"}},{"type":"Public","name":"BoundedRationalityAbstractionAndHierarchicalDecisionMaking","owner":"JuliaPapers","isFork":true,"description":"Supplementary code and Jupyter notebooks for publication: Bounded rationality, abstraction and hierarchical decision-making: an information-theoretic optimality principle","allTopics":["julia","paper-with-code"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2015-12-09T15:08:14.781Z"}},{"type":"Public","name":"KernelSpectralClustering.jl","owner":"JuliaPapers","isFork":true,"description":"A Julia implementation of a Kernel Spectral Clustering algorithm designed to handle massive networks on a single computer, which uses memory-mapping and parallelization to overcome memory and computational bottlenecks.","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2015-08-24T20:21:55.572Z"}}],"repositoryCount":19,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"JuliaPapers repositories"}