Skip to content

Instantly share code, notes, and snippets.

View liuyuuan's full-sized avatar

liuyuuan liuyuuan

18 followers · 31 following
View GitHub Profile
@liuyuuan
liuyuuan / ChatGPT-Dan-Jailbreak.md
Created March 28, 2023 03:39 — forked from coolaj86/ChatGPT-Dan-Jailbreak.md
@liuyuuan
liuyuuan / 1.rsync_tips_and_tricks.md
Created July 8, 2019 06:36 — forked from dusenberrymw/1.rsync_tips_and_tricks.md
Rsync Tips & Tricks

Rsync Tips & Tricks

  • rsync -auzPhv --delete --exclude-from=rsync_exclude.txt SOURCE/ DEST/ -n
    • -a -> --archive; recursively sync, preserving symbolic links and all file metadata
    • -u -> --update; skip files that are newer on the receiver; sometimes this is inaccurate (due to Git, I think...)
    • -z -> --compress; compression
    • -P -> --progress + --partial; show progress bar and resume interupted transfers
    • -h -> --human-readable; human-readable format
    • -v -> --verbose; verbose output
  • -n -> --dry-run; dry run; use this to test, and then remove to actually execute the sync
@liuyuuan
liuyuuan / rank_metrics.py
Created May 12, 2018 07:02 — forked from bwhite/rank_metrics.py
Ranking Metrics
"""Information Retrieval metrics
Useful Resources:
http://www.cs.utexas.edu/~mooney/ir-course/slides/Evaluation.ppt
http://www.nii.ac.jp/TechReports/05-014E.pdf
http://www.stanford.edu/class/cs276/handouts/EvaluationNew-handout-6-per.pdf
http://hal.archives-ouvertes.fr/docs/00/72/67/60/PDF/07-busa-fekete.pdf
Learning to Rank for Information Retrieval (Tie-Yan Liu)
"""
import numpy as np
@liuyuuan
liuyuuan / Monaco_Linux-Powerline.ttf
Created April 7, 2013 15:09 — forked from dsc8x/Monaco_Linux-Powerline.ttf
@liuyuuan
liuyuuan / Hint.md
Created August 28, 2012 10:15 — forked from yuvipanda/Hint.md
Insertion Sort Solutions (InterviewStreet CodeSprint Fall 2011)

The answer is the number of inversions in the array, which is the number of pairs i,j such that i < j and a[i] > a[j]. Counting this is a fairly classical problem with many solutions such as using data structures such as Balanced Trees or Binary Indexed Trees. Another particularly elegant solution involves modifying merge sort to count the number of inversions when merging the two sorted halves in the algorithm.