Created
January 12, 2017 04:46
-
-
Save vznvzn/7c6240e029b9502fadfaa8b85adc3922 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def f2(n) | |
n = (n * 3 + 1) / 2 while (n % 2 == 1) | |
n /= 2 while (n % 2 == 0) | |
return n | |
end | |
def adv(x) | |
n1 = n = x['n'] | |
l = [n] | |
while (n >= n1 && n != 1) | |
n = f2(n) | |
l << n | |
end | |
x['l'] = l | |
x['ls'] = l.size | |
x['ns'] = x['n'].to_s(2).length | |
x['h'] = x['ls'].to_f / x['ns'] | |
x['h2'] = (x['h'] * $g).to_i | |
return x | |
end | |
def next2(z) | |
l = [z] | |
p = z['p'] + 1 | |
l << adv({'n'=>z['n'] + 2**p, 'p'=>p}) | |
l << z.merge({'p'=>p}) | |
return l | |
end | |
def insert(l, x) | |
l << x | |
end | |
def delete(l, j) | |
z = l.delete_at(j) | |
return z | |
end | |
def sum(l) | |
t = 0 | |
l.each { |x| t += x } | |
return t | |
end | |
def stat(l) | |
l = [0] if (l.empty?) | |
t = t2 = 0 | |
l.each \ | |
{ | |
|x| | |
t += x | |
t2 += x ** 2 | |
} | |
c = l.size | |
a = t.to_f / c | |
z = t2.to_f / c - a ** 2 | |
sd = Math.sqrt(z < 0 ? 0 : z) | |
return a, sd, l.max.to_f | |
end | |
def dist(l) | |
l2 = [] | |
l.each_with_index \ | |
{ | |
|x, i| | |
h = x[1]['h2'] | |
l2[h] = [] if (l2[h].nil?) | |
l2[h] << i | |
} | |
l1 = (0...l2.size).sort_by { |i| l2[i].nil? ? 0 : l2[i].size } | |
return l2, l1 | |
end | |
def rank(l1, l2) | |
l1h, l1s = dist(l1) | |
l2h, l2s = dist(l2) | |
j = l1s.find { |x| !l2h[x].nil? && (l1h[x].nil? || l1h[x].size < $n) } | |
j = l2h.size - 1 if (j.nil?) | |
k = l2s.find { |x| !l2h[x].nil? } | |
l = (0...l2.size).to_a | |
l = l.sort_by { |x| l2[x][1]['ls'] } | |
k = l.find { |x| x != j } | |
return l2h[j][rand(l2h[j].size)], k | |
end | |
def opt(c) | |
l = [] | |
l1 = [] | |
insert(l, next2({'n'=>1, 'p'=>0})) | |
puts('# ' + Time.now.to_s) | |
t = Time.now.to_i | |
c.times \ | |
{ | |
|i| | |
$stderr.puts([i, sprintf('%.1fm', (Time.now.to_i - t) / 60.0), Time.now.to_s].join("\t")) if (i % 100 == 0) | |
j, k = rank(l1, l) | |
if (l.size > 1000) then | |
z2 = delete(l, [j, k].max) | |
z1 = delete(l, [j, k].min) | |
l1 += [z1, z2] | |
z = j < k ? z1 : z2 | |
else | |
z = delete(l, j) | |
l1 += [z] | |
end | |
insert(l, next2(z[1])) | |
insert(l, next2(z[2])) | |
$stdout.flush | |
} | |
puts('# ' + Time.now.to_s) | |
return l1.map { |x| x[1] } | |
end | |
def stat2(l, t) | |
return stat(l).map { |x| x / t } | |
end | |
def d(s) | |
c = s.split('').select { |x| x == '1' }.size | |
d = c.to_f / s.length | |
return d | |
end | |
def data(x) | |
n = x['n'] | |
ns = n.to_s(2) | |
nl = ns.length | |
m = nl / 2 | |
nsh = ns[0..m] | |
nsl = ns[m..-1] | |
asdm1 = stat2(ns.split(/0+/).map { |y| y.length }, nl) | |
l1 = ns.split(/1+/) | |
l1.shift | |
asdm0 = stat2(l1.map { |y| y.length }, nl) | |
return [nl, x['ls'], x['h2'], d(ns), d(nsh), d(nsl), asdm1].flatten | |
end | |
def out(fn, l) | |
f = File.open("#{fn}.txt", 'w') | |
l.each { |x| f.puts(x.join("\t")) } | |
f.close | |
end | |
def sample(c) | |
l = opt(c) | |
a = {} | |
h = {} | |
l.each \ | |
{ | |
|x| | |
n = x['n'] | |
h2 = x['h2'] | |
h[h2] = h.fetch(h2, {}).merge!({ n => nil }) | |
a[n] = x | |
} | |
# h.sort.each { |k, v| p([k, v.size]) }; exit; | |
l3 = [] | |
c1 = 10 | |
h1 = h.select { |k, v| v.size >= c1 }.sort | |
h1.each_with_index \ | |
{ | |
|kv, n| | |
k, v = kv | |
l1 = v.keys.sort | |
c1.times \ | |
{ | |
|i| | |
n = l1[(i.to_f / (c1 - 1) * (l1.size - 1)).to_i] | |
l3 << a[n] | |
} | |
} | |
l2 = l3.map { |x| data(x) } | |
return l2 | |
end | |
def avg(l) | |
return nil if (l.empty?) | |
return sum(l) / l.size | |
end | |
def near2(l, j, l3) | |
l2 = [] | |
l.size.times \ | |
{ | |
|i| | |
next if (i % $m == 0) | |
d = 0 | |
l3.each { |x| d += (l[i][x] - l[j][x]) ** 2 } | |
l2 << [i, d] | |
} | |
l2 = l2.sort_by { |x| x[1] } | |
r = (0..2) | |
c = r.to_a.size | |
d = r.map { |x| 1.0 / l2[x][1] } | |
p = r.map { |x| l[l2[x][0]] } | |
t = sum(d) | |
return sum(p.map { |x| x[$c] }) / c if (!t.finite?) | |
w = d.map { |x| x / t } | |
z = 0 | |
r.each { |x| z += (w[x] * p[x][$c]) } | |
return z | |
end | |
def inc(x, y) | |
x[0] += y | |
x[1] += 1 | |
return x | |
end | |
def avg(x) | |
return x[0] / x[1] | |
end | |
def near(l, l3) | |
e2 = [[0.0, 0], [0.0, 0]] | |
l2 = [] | |
l.size.times \ | |
{ | |
|i| | |
x = near2(l, i, l3) | |
e = (l[i][$c] - x) ** 2 | |
inc(e2[{false => 0, true => 1}[i % $m == 0]], e) | |
l2 << x | |
} | |
return e2.map { |x| avg(x) }, l2 | |
end | |
def compare(l) | |
l2 = (($c + 1)...l[0].size).to_a | |
l1 = (2..l2.size).to_a | |
i = 0 | |
begin | |
l1d = l1.dup | |
c = l1d.delete_at(rand(l1d.size)) | |
l3 = [] | |
l2d = l2.dup | |
c.times { l3 << l2d.delete_at(rand(l2d.size)) } | |
l3.sort! | |
next if ($s0.member?(l3) || $s.member?(l3)) | |
$s0[l3] = nil | |
$l0 << [l3, near(l, l3)] | |
i += 1 | |
end while (i < 50) | |
$l0 = $l0.sort_by { |x| x[1][0][0] } | |
return $l0.shift | |
end | |
$n = 40 | |
$g = 50 | |
l = sample(2000) | |
# out('out', l) | |
$c = 2 | |
c = l[0].size | |
$m = 40 | |
$s = {} | |
$s0 = {} | |
$l0 = [] | |
loop \ | |
{ | |
l1 = compare(l) | |
$stderr.puts([$l0.size, l1[0], l1[1][0]].inspect) | |
puts([l1[0].size, l1[1][0]].join("\t")) | |
$stdout.flush | |
$s[l1[0]] = nil | |
l2 = l1[1][1] | |
l = l.transpose | |
l << l2 | |
l = l.transpose | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment