louismullie

require 'graph-rank'
require 'treat'

# Implements the PageRank algorithm for
# unsupervised extractive summarization.
# 
# Reference: R. Mihalcea and P. Tarau, “TextRank: 
# Bringing Order into Texts,” in Proceedings of 
# EMNLP 2004. Association for Computational 
# Linguistics, 2004, pp. 404–411.

akshayjshah

/* Fetch data from GitHub Archive using Google's BigQuery */
select actor, repository_language, count(repository_language) as pushes
from [githubarchive:github.timeline]
where type='PushEvent'
    and repository_language != ''
    and PARSE_UTC_USEC(created_at) >= PARSE_UTC_USEC('2012-01-01 00:00:00')
    and PARSE_UTC_USEC(created_at) < PARSE_UTC_USEC('2013-01-01 00:00:00')
group by actor, repository_language;

xissy

request = require 'request'

youTubeMovieInfo = 
  youTubeMovieId: 'videoId'

url = "http://www.youtube.com/get_video_info?video_id=#{youTubeMovieInfo.youTubeMovieId}"
request.get url, (err, res, body) ->
  return callback(false)  if err
  return callback(false)  if res.statusCode isnt 200

zythum

王
江
周
胡
刘
李
吴
毛
温
习

jnozsc

// ==UserScript==
// @name          Better Douban Navigation
// @author        jnozsc
// @namespace     http://www.douban.com/people/1563045/
// @description   I need a better douban navigation
// @include       http://www.douban.com/*
// @match         http://www.douban.com/*
// @include       http://book.douban.com/*
// @match         http://book.douban.com/*
// @include       http://music.douban.com/*

paulmillr

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter(user => user.followers > 1000)

voidfiles

"""
From this paper: http://acl.ldc.upenn.edu/acl2004/emnlp/pdf/Mihalcea.pdf 

I used python with nltk, and pygraph to do an implmentation of of textrank.

for questions: http://twitter.com/voidfiles

"""
import nltk
import itertools

kejun

// ==UserScript==
// @name           RepeatFM
// @namespace      org.kejun
// @description    FM单曲循环(纯属个人瞎玩, 要求Firefox4+)
// @include        http://douban.fm, http://douban.fm/*
// ==/UserScript==

var isRepeat = localStorage.getItem('is_repeat_fm')|0;

function importCSS(str) {

jakedobkin

# http://projecteuler.net/problem=100
# algabraic rearrangement to 2b**2-2b-t**2+t = 0 (where b is blue balls, t is total balls)
# this is a diophantine equation, which can be solved recursively- to get formulas for next b,t:
# http://www.alpertron.com.ar/QUAD.HTM, put in coeeficients above - got that from Dreamshire

b = 85
t = 120

while t < 10**12:
# i learned that this allows you to set both at once so you don't have to use an intermediate variable

kennethreitz

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import urllib2

gh_url = 'https://api.github.com'

req = urllib2.Request(gh_url)

password_manager = urllib2.HTTPPasswordMgrWithDefaultRealm()