Algorithmically 0.1.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: c91ca3b58d7d092993dc20a3f8ecf2434f34fd45
+  data.tar.gz: e3506c96aa0aae8e90cd47c463430bd0cbf2111a
+SHA512:
+  metadata.gz: 3a9feda8f6f49348e02129966da3e153ba96134ea893415ceaa18623e8b84baf750fa26e81c9f1e6a23b2ac704f63a39a905f5772fb6ea66ccdd785ba28d1fa5
+  data.tar.gz: f9ee9e53fe0449c5f32686fd751cc1f0ea47b84e82c96bdad03daf741497c47f02b3bf3d3c9d7eb3d21e592c9a09b2f91cf561909b91493da63dbcdcea407a46

data/.gitignore

@@ -0,0 +1,2 @@
+/pkg/
+.idea

data/Algorithmically.gemspec

@@ -0,0 +1,31 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'Algorithmically/version'
+
+Gem::Specification.new do |spec|
+  spec.name = 'Algorithmically'
+  spec.version = Algorithmically::VERSION
+  spec.authors = ['popac']
+  spec.email = ['web.guru.serbia@gmail.com']
+
+  spec.summary = %q{Algorithmically}
+  spec.description = %q{Nature-Inspired Programming Recipes}
+  spec.homepage = 'https://github.com/popac/Algorithmically'
+  spec.license = 'MIT'
+
+  if spec.respond_to?(:metadata)
+    spec.metadata['allowed_push_host'] = 'https://rubygems.org'
+  else
+    raise 'RubyGems 2.0 or newer is required to protect against public gem pushes.'
+  end
+
+  spec.files = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir = 'exe'
+  spec.executables = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  spec.add_development_dependency 'bundler', '~> 1.13', '>= 1.13.1'
+  spec.add_development_dependency 'rake', '~> 11.3'
+  spec.add_development_dependency 'pry', '~> 0.10.4'
+end

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,49 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, we pledge to respect all people who
+contribute through reporting issues, posting feature requests, updating
+documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free
+experience for everyone, regardless of level of experience, gender, gender
+identity and expression, sexual orientation, disability, personal appearance,
+body size, race, ethnicity, age, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or unprofessional conduct
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This code of conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer at web.guru.serbia@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[http://contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/3/0/

data/Gemfile

@@ -0,0 +1,3 @@
+source 'https://rubygems.org'
+
+gemspec

data/Gemfile.lock

@@ -0,0 +1,28 @@
+PATH
+  remote: .
+  specs:
+    Algorithmically (0.1.1)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    coderay (1.1.1)
+    method_source (0.8.2)
+    pry (0.10.4)
+      coderay (~> 1.1.0)
+      method_source (~> 0.8.1)
+      slop (~> 3.4)
+    rake (11.3.0)
+    slop (3.6.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  Algorithmically!
+  bundler (~> 1.13, >= 1.13.1)
+  pry (~> 0.10.4)
+  rake (~> 11.3)
+
+BUNDLED WITH
+   1.13.1

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 popac
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,20 @@
+# Algorithmically
+
+Nature-Inspired Programming Recipes 
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'Algorithmically'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install Algorithmically
+

data/Rakefile

@@ -0,0 +1,2 @@
+require 'bundler/gem_tasks'
+task :default => :spec

data/bin/console

@@ -0,0 +1,7 @@
+#!/usr/bin/env ruby
+
+require 'bundler/setup'
+require 'Algorithmically'
+
+require 'pry'
+Pry.start

data/bin/setup

@@ -0,0 +1,6 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install

data/lib/Algorithmically.rb

@@ -0,0 +1,7 @@
+require 'Algorithmically/version'
+require 'Algorithmically/Stochastic/random_search'
+require 'Algorithmically/Stochastic/adaptive_random_search'
+
+module Algorithmically
+  include Stochastic
+end

data/lib/Algorithmically/Stochastic/adaptive_random_search.rb

@@ -0,0 +1,82 @@
+module Stochastic
+
+  class AdaptiveRandomSearch
+
+    def initialize(max_iter, bounds, init_factor, s_factor, l_factor, iter_mult, max_no_impr)
+      problem_size = bounds
+      @bounds1 = Array.new(problem_size) {|i| [-5, +5]}
+      @max_iter = max_iter
+      @init_factor = init_factor
+      @s_factor = s_factor
+      @l_factor = l_factor
+      @iter_mult = iter_mult
+      @max_no_impr = max_no_impr
+      @best = search(@max_iter, @bounds1, @init_factor, @s_factor, @l_factor, @iter_mult, @max_no_impr)
+      puts "Done. Best Solution: c=#{@best[:cost]}, v=#{@best[:vector].inspect}"
+    end
+
+    def objective_function(vector)
+      vector.inject(0) { |sum, x| sum + (x ** 2.0) }
+    end
+
+    def rand_in_bounds(min, max)
+      min + ((max-min) * rand())
+    end
+
+    def random_vector(minmax)
+      Array.new(minmax.size) do |i|
+        rand_in_bounds(minmax[i][0], minmax[i][1])
+      end
+    end
+
+    def take_step(minmax, current, step_size)
+      position = Array.new(current.size)
+      position.size.times do |i|
+        min = [minmax[i][0], current[i]-step_size].max
+        max = [minmax[i][1], current[i]+step_size].min
+        position[i] = rand_in_bounds(min, max)
+      end
+      position
+    end
+
+    def large_step_size(iter, step_size, s_factor, l_factor, iter_mult)
+      step_size * l_factor if iter > 0 and iter.modulo(iter_mult) == 0
+      step_size * s_factor
+    end
+
+    def take_steps(bounds, current, step_size, big_stepsize)
+      step, big_step = {}, {}
+      step[:vector] = take_step(bounds, current[:vector], step_size)
+      step[:cost] = objective_function(step[:vector])
+      big_step[:vector] = take_step(bounds, current[:vector], big_stepsize)
+      big_step[:cost] = objective_function(big_step[:vector])
+      return step, big_step
+    end
+
+    def search(max_iter, bounds, init_factor, s_factor, l_factor, iter_mult, max_no_impr)
+      step_size = (bounds[0][1]-bounds[0][0]) * init_factor
+      current, count = {}, 0
+      current[:vector] = random_vector(bounds)
+      current[:cost] = objective_function(current[:vector])
+      max_iter.times do |iter|
+        big_stepsize = large_step_size(iter, step_size, s_factor, l_factor, iter_mult)
+        step, big_step = take_steps(bounds, current, step_size, big_stepsize)
+        if step[:cost] <= current[:cost] or big_step[:cost] <= current[:cost]
+          if big_step[:cost] <= step[:cost]
+            step_size, current = big_stepsize, big_step
+          else
+            current = step
+          end
+          count = 0
+        else
+          count += 1
+          count, step_size = 0, (step_size/s_factor) if count >= max_no_impr
+        end
+        puts " > iteration #{(iter+1)}, best=#{current[:cost]}"
+      end
+      current
+    end
+
+  end
+
+end

data/lib/Algorithmically/Stochastic/random_search.rb

@@ -0,0 +1,37 @@
+module Stochastic
+
+  class RandomSearch
+
+    def initialize(size, max_iter)
+      problem_size = size
+      search_space = Array.new(problem_size) { |i| [-5, +5] }
+      maximum_iterations = max_iter
+      best_solution = self.search(search_space, maximum_iterations)
+      puts "Done. Best Solution: c = #{best_solution[:cost]}, v = #{best_solution[:vector].inspect}"
+    end
+
+    def objective_function(vector)
+      vector.inject(0) { |sum, x| sum + (x ** 2.0) }
+    end
+
+    def random_vector(minmax)
+      Array.new(minmax.size) do |i|
+        minmax[i][0] + ((minmax[i][1]) - minmax[i][0] * rand())
+      end
+    end
+
+    def search(search_space, maximum_iterations)
+      best_solution = nil
+      maximum_iterations.times do |iterate|
+        search_candidate = {}
+        search_candidate[:vector] = random_vector(search_space)
+        search_candidate[:cost] = objective_function(search_candidate[:vector])
+        best_solution = search_candidate if best_solution.nil? or search_candidate[:cost] < best_solution[:cost]
+        puts " > iteration = #{(iterate + 1)}, best = #{best_solution[:cost]}"
+      end
+      best_solution
+    end
+
+  end
+
+end

data/lib/Algorithmically/version.rb

@@ -0,0 +1,3 @@
+module Algorithmically
+  VERSION = '0.1.1'
+end

metadata

@@ -0,0 +1,107 @@
+--- !ruby/object:Gem::Specification
+name: Algorithmically
+version: !ruby/object:Gem::Version
+  version: 0.1.1
+platform: ruby
+authors:
+- popac
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-09-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.13'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 1.13.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.13'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 1.13.1
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '11.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '11.3'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.10.4
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.10.4
+description: Nature-Inspired Programming Recipes
+email:
+- web.guru.serbia@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- Algorithmically.gemspec
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/Algorithmically.rb
+- lib/Algorithmically/Stochastic/adaptive_random_search.rb
+- lib/Algorithmically/Stochastic/random_search.rb
+- lib/Algorithmically/version.rb
+homepage: https://github.com/popac/Algorithmically
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.6.6
+signing_key: 
+specification_version: 4
+summary: Algorithmically
+test_files: []