• Stars
    star
    144
  • Rank 255,590 (Top 6 %)
  • Language
    Jupyter Notebook
  • License
    Apache License 2.0
  • Created almost 8 years ago
  • Updated over 1 year ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

End-to-end earthquake detection pipeline via efficient time series similarity search

FAST

fast_index

FAST is an end-to-end and unsupervised earthquake detection pipeline. It is a useful tool for seismologists to extract more small earthquakes from continuous seismic data. FAST is able to run on different machines by using Google Colab, Linux, or Docker.

  • To run FAST with Google Colab, click here for the tutorial.

  • To run FAST with Linux, click here for the tutorial.

  • To run FAST with Docker, click here for the tutorial.

Check out the user guide to learn more about FAST and how to use it on your own dataset.

FAST User Guide Contents

  1. FAST Overview
    Click here for a summary of the FAST algorithm and why you might want to use it on your seismic data.

  2. Install
    Go here to learn how to install and run the FAST software on your computer.

    1. Google Colab

    2. Linux

    3. Docker

  3. Tutorial
    Learn how FAST detects earthquakes on the Hector Mine data set.

  4. How to Set Parameters
    Click here to learn how to test FAST on your own data sets.

    1. FAST Checklist

    2. Getting Seismic Data

    3. Input and Preprocessing

    4. Fingerprint

    5. Similarity Search

    6. Network Detection

    7. FAST Output

    8. Phase Picking

    9. Earthquake Location

    10. Example Parameters
      Click here to see data sets FAST has been used on to detect earthquakes.

  5. References
    Read publications about FAST here.

References

You can find more details about the pipeline and guidelines for setting parameters in our extended user guide. You may also check out the following papers:

More Repositories

1

ColBERT

ColBERT: state-of-the-art neural search (SIGIR'20, TACL'21, NeurIPS'21, NAACL'22, CIKM'22, ACL'23, EMNLP'23)
Python
2,998
star
2

macrobase

MacroBase: A Search Engine for Fast Data
Java
661
star
3

ARES

Automated Evaluation of RAG Systems
Python
460
star
4

noscope

Accelerating network inference over video
Python
434
star
5

sparser

Sparser: Raw Filtering for Faster Analytics over Raw Data
C
427
star
6

dawn-bench-entries

DAWNBench: An End-to-End Deep Learning Benchmark and Competition
Python
257
star
7

ASAP

ASAP: Prioritizing Attention via Time Series Smoothing
Jupyter Notebook
184
star
8

FrugalGPT

FrugalGPT: better quality and lower cost for LLM applications
Python
167
star
9

index-baselines

Simple baselines for "Learned Indexes"
HTML
156
star
10

gavel

Code for "Heterogenity-Aware Cluster Scheduling Policies for Deep Learning Workloads", which appeared at OSDI 2020
Jupyter Notebook
124
star
11

equivariant-transformers

Equivariant Transformer (ET) layers are image-to-image mappings that incorporate prior knowledge on invariances with respect to continuous transformations groups (ICML 2019). Paper: https://arxiv.org/abs/1901.11399
Jupyter Notebook
88
star
12

stk

Python
86
star
13

selection-via-proxy

Python
77
star
14

sinkhorn-label-allocation

Sinkhorn Label Allocation is a label assignment method for semi-supervised self-training algorithms. The SLA algorithm is described in full in this ICML 2021 paper: https://arxiv.org/abs/2102.08622.
Python
53
star
15

readinggroup

45
star
16

cs145-2017

Jupyter Notebook
43
star
17

Willump

Willump Is a Low-Latency Useful Machine learning Platform.
Python
42
star
18

Baleen

Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrieval (NeurIPS'21)
Python
42
star
19

msketch

Moments Sketch Code
Jupyter Notebook
39
star
20

Uniserve

A runtime implementation of data-parallel actors.
Java
38
star
21

wmsketch

Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
C++
38
star
22

dawn-bench-models

Python
36
star
23

momentsketch

Simplified Moment Sketch Implemntation
Java
36
star
24

blazeit

Its BlazeIt because it's blazing fast
C++
28
star
25

optimus-maximus

To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
Python
26
star
26

ACORN

state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
C++
25
star
27

acidrain

2AD analysis prototype and logs from sample applications
Python
22
star
28

lit-code

Code for LIT, ICML 2019
Python
21
star
29

POP

Code for "Solving Large-Scale Granular Resource Allocation Problems Efficiently with POP", which appeared at SOSP 2021
Python
20
star
30

loa

Public code for LOA
Python
18
star
31

omg

Python
17
star
32

pytorch-distributed

Fork of diux-dev/imagenet18
Python
13
star
33

tasti

Semantic Indexes for Machine Learning-based Queries over Unstructured Data (SIGMOD 2022)
Python
13
star
34

cs245-as1

Student files for CS245 Programming Assignment 1: In-memory data layout
Java
12
star
35

offload-annotations

A new approach for bringing heterogeneous computing to existing libraries and workloads.
Python
9
star
36

Willump-Simple

Willump Is a Low-Latency Useful Machine learning Platform.
Python
8
star
37

cs245-as3-public

Durable transactions assignment for CS245
Java
7
star
38

InQuest

Accelerating Aggregation Queries on Unstructured Streams of Data
Python
7
star
39

cs245-as2-public

Scala
7
star
40

training_on_a_dime

Scripts and logs for "Analysis and Expoitation of Dynamic Pricing in the Public Cloud for ML Training", which is to appear at DISPA 2020
Jupyter Notebook
7
star
41

SparseJointShift

Model Performance Estimation and Explanation When Labels and A Few Features Shifts
Python
7
star
42

DROP

Java
6
star
43

tKDC

Repository for tKDE Experiments
Jupyter Notebook
6
star
44

sketchstore

Algorithms for compressing and merging large collections of sketches
Jupyter Notebook
5
star
45

parallel-lb-simulator

Java
4
star
46

crosstrainer

CrossTrainer: Practical Domain Adaptation with Loss Reweighting
Python
4
star
47

smol

C++
4
star
48

supg

Python
3
star
49

fast-tree

C++
3
star
50

abae

Accelerating Approximate Aggregation Queries with Expensive Predicates (VLDB 21)
Python
3
star
51

graphIO

Automated Lower Bounds on the I/O Complexity of Computation Graphs
Python
3
star
52

futuretea-whyrust

Why Rust presentation at FutureTea, 3/13
Rust
3
star
53

ezmode

An iterative algorithm for selecting rare events in large, unlabeled datasets
Python
1
star
54

willump-dfs

Applying Willump design to deep feature synthesis
Python
1
star
55

fexipro-benchmarking

C++
1
star
56

macrobase-cpp

1
star
57

swag-python

Situationally aWAre decodinG
Python
1
star