quasi 0.0.1 → 0.0.3

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: quasi
 version: !ruby/object:Gem::Version 
-  hash: 29
+  hash: 25
   prerelease: false
   segments: 
   - 0
   - 0
-  - 1
-  version: 0.0.1
+  - 3
+  version: 0.0.3
 platform: ruby
 authors: 
 - Thomas Adolfsson
@@ -17,37 +17,52 @@ cert_chain: []
 
 date: 2010-09-15 00:00:00 +10:00
 default_executable: 
-dependencies: []
-
-description: A gem for Low Discrepancy Sequences
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: minitest
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: narray
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id002
+description: A gem for Low Discrepancy Sequences. Currently Contains implementations of the Halton, and Niederreiter-Xing generator in various dimensions
 email: thoad747@gmail.com
 executables: []
 
 extensions: []
 
-extra_rdoc_files: 
-- lib/LowDiscrepancySequence.rb
-- lib/NX.rb
-- lib/halton.rb
-- lib/quasi.rb
-files: 
-- Manifest
-- Rakefile
-- lib/LowDiscrepancySequence.rb
-- lib/NX.rb
-- lib/halton.rb
-- lib/quasi.rb
-- quasi.gemspec
+extra_rdoc_files: []
+
+files: []
+
 has_rdoc: true
 homepage: http://gammabox.heroku.com
 licenses: []
 
 post_install_message: 
 rdoc_options: 
-- --line-numbers
-- --inline-source
-- --title
-- Quasi
+- --charset=UTF-8
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
@@ -64,14 +79,13 @@ required_rubygems_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      hash: 11
+      hash: 3
       segments: 
-      - 1
-      - 2
-      version: "1.2"
+      - 0
+      version: "0"
 requirements: []
 
-rubyforge_project: quasi
+rubyforge_project: 
 rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3

data/Manifest

@@ -1,7 +0,0 @@
-Manifest
-Rakefile
-lib/LowDiscrepancySequence.rb
-lib/NX.rb
-lib/halton.rb
-lib/quasi.rb
-quasi.gemspec

data/Rakefile

@@ -1,26 +0,0 @@
-require 'rubygems'
-require 'rake'
-require 'echoe'
-#require 'spec/rake/spectask'
-require 'lib/quasi'
-
-#task :default => :spec
-
-#desc "Run the Quasi specs"
-#task :spec do
-#  Spec::Rake::SpecTask.new do |t|
-#    t.spec_files = FileList['spec/**/*_spec.rb']
-#    t.rcov = true
-#    t.rcov_opts = ['--exclude', 'spec']
-#    t.spec_opts = ['--options', "spec/spec.opts"]
-#  end
-#end
-
-  Echoe.new('quasi', "0.0.1") do |p|
-    p.description = "A gem for Low Discrepancy Sequences"
-    p.url = "http://gammabox.heroku.com"
-    p.author = "Thomas Adolfsson"
-    p.email = "thoad747@gmail.com"
-    p.ignore_pattern = ["coverage/*", "*~"]
-    p.development_dependencies = []
-  end

data/lib/LowDiscrepancySequence.rb

@@ -1,164 +0,0 @@
-
-
-require 'rubygems'
-require 'narray'
-include Math
-
-#p>Interface and methods to compute L2-discrepancy for low discrepancy sequences.</p>
-
-module Quasi
-
-class LowDiscrepancySequence
-
-def initialize(dim)
-@dim = dim
-@index = 1 
-@x = NArray.float(dim)
-@y = NArray.float(dim)
-end
-
-def restart
-@index =1
-end
-
-def nextPoint(r)
-x= nextPoint
-for k in 0..@dim
-  r[k] = x[k]
-end
-end
-
-#L^2-DISCREPANCY
-
-def product(i,j,r)
-f=1.0
-for k in 0..@dim
-  f*=1.0-[r[i][k],r[j][k]].max
-end
-return f
-end 
-
-def productSQ( i, r)
-   f=1.0 
-     for k in 0..@dim
-       f*=(1.0-r[i][k]*r[i][k])
-     end
-     return f
-end  
-
-
-def L2_discrepancy(n, r)
-a,b =1.0,1.0
-for k in 0..@dim
-   a/=2
-   b/=3
-end
-
-sum_1,sum_2 =0.0,0.0
-
-loops=0
-for i in 0..n
-  for j in i+1..n
-    sum_1+=product(i,j,r)
-  end
-end
-
-sum_1*=2
-
-for i in 0..n
-  sum_1+=product(i,i,r)
-end
-
-sum_1/=(n*n)
-
-#second sum
-for i in 0..n
-  sum_2+=productSQ(i,r)
-end
-
-sum_2/=n 
-sum_2*=(2.0*a)
-return Math.sqrt(sum_1-sum_2+b)
-
-end
-
-#second method for all
-#add later
-
-# TRANSFORM UNIFORM -> MULTINORMAL
-#need thi, maybe narray
-
-def nextQuasiNormalVector
-x=nextPoint()
-z = Array.new(@dim)
-for k in 0..@dim-1
-  z[k]=n_inverse(x[k].to_f);
-end
-return z
-end
-
-def projectionOut(i,j, nPoints)
-  name=getName
-  puts i,j
-  puts nextPoint(x)
-end
-
-def n_inverse(x)
-sqrt_two_PI=2.5066282746310
-
-e_1 = -3.969683028665376e+01
-e_2 =  2.209460984245205e+02
-e_3 = -2.759285104469687e+02
-e_4 =  1.383577518672690e+02
-e_5 = -3.066479806614716e+01
-e_6 =  2.506628277459239e+00
-
-f_1 = -5.447609879822406e+01
-f_2 =  1.615858368580409e+02
-f_3 = -1.556989798598866e+02
-f_4 =  6.680131188771972e+01
-f_5 = -1.328068155288572e+01
-
-
-
-g_1 = -7.784894002430293e-03
-g_2 = -3.223964580411365e-01
-g_3 = -2.400758277161838e+00
-g_4 = -2.549732539343734e+00
-g_5 =  4.374664141464968e+00
-g_6 =  2.938163982698783e+00
-
-
-h_1 =  7.784695709041462e-03
-h_2 =  3.224671290700398e-01
-h_3 =  2.445134137142996e+00
-h_4 =  3.754408661907416e+00
-
-x_l   = 0.02425
-x_u  = 1.0 - x_l
-
-
-#lower
-
-if( x < x_l )
-  z = Math.sqrt(-2.0*Math.log(x))
-  z = (((((g_1*z+g_2)*z+g_3)*z+g_4)*z+g_5)*z+g_6) / ((((h_1*z+h_2)*z+h_3)*z+h_4)*z+1.0)
-elsif( x <= x_u )
-#central
-  z = x - 0.5; r = z*z
-  z = (((((e_1*r+e_2)*r+e_3)*r+e_4)*r+e_5)*r+e_6)*z / (((((f_1*r+f_2)*r+f_3)*r+f_4)*r+f_5)*r+1.0)
-
-#upper
-else 
-  z = Math.sqrt(-2.0*Math.log(1.0-x))
-  z = -(((((g_1*z+g_2)*z+g_3)*z+g_4)*z+g_5)*z+g_6) /  ((((h_1*z+h_2)*z+h_3)*z+h_4)*z+1.0)
-
-end
-
-return z
-
-
-end
-
-end #end of class
-end # end module