offline
Last seen: Apr 19, 2014 7:59 AM EDT
Hire Me!
Rate: $20.00 USD/hour
Follow Invite to Project
 

Nathan Burles

NaMaNet.biz

Username: nathanburles

  • Has not made a deposit.
  • Has verified their email address.
  • Has completed their profile.
  • Has verified their secure phone number.
  • Verified
  • Payment is not verified.

Location: York, United Kingdom

Member since: May 2008

Reputation:

5.0/5

(8 reviews)

5.2
[see more]

No user has recommended this freelancer.

My projects:

  • $850.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    Jun 6, 2010

    Excellent work and assistance with this project. Hire NaMaNet with confidence!

    Project Description:CMS - Drupal website using architecture and coding from previous Hollywood Hills NC and Mid-town North Hollywood NC websites which include Drupal and custom modules using screens supplied by us for theme...
    [more]
  • $450.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    May 26, 2009

    Rating: 5.0/5.0

    Project Description:[Project Description hidden]
    [more]
  • $875.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    Mar 28, 2009

    This is my second project using NaMaNet and as with the first one... excellent work. They go the extra mile too. Intuitive and helpful with creative solutions. Excellent programming skills. Hire with confidence, but I get them first :)

    Project Description:[Project Description hidden]
    [more]
  • $450.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    Jan 14, 2009

    Rating: 5.0/5.0

    Project Description:[Project Description hidden]
    [more]
  • $850.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    Oct 24, 2008

    NaMaNet are incredible! This was a Drupal site from scratch and their knowledge, professionalism, response, communication, timeliness, creativity and inventiveness, sincere concern for the project, and going the extra distance to solve an issue are top notch. So much so that I gave them a bonus and am hiring them on all future Drupal (and non-Drupal if applicable) work. This project is a real success story. You can hire them with complete confidence and then some! Thank you Nathan and Mark!

    Project Description:This spec is for a CMS site prototype.? We have created 6 ?€œhybrid?€ CMS NC sites previously using PHP and MySQL and need to upgrade our product offering to full CMS. Using our theme...
    [more]
  • $450.00 USD
    5.0
    Profile image for Seller shmerls

    shmerls

    Oct 2, 2008

    Rating: 5.0/5.0

    Project Description:[Project Description hidden]
    [more]
  • $85.00 USD
    5.0
    Profile image for Seller zbronek

    zbronek

    Sep 6, 2008

    very good worker.

    Project Description:[Project Description hidden]
    [more]
  • $7.00 USD
    5.0
    Profile image for Seller ronghestervw

    ronghestervw

    Aug 13, 2008

    Very smart and experience worker.

    Project Description: I am looking for some one experienced in CMS (knowledge of two or more popular cms is desired). This project is simple all you have to do is take the existing module in drupal (That i will provide...
    [more]
    Nathan Burles has not completed any projects.
    Nathan Burles does not have any work in progress.
    Nathan Burles has not bid on any projects.
    Nathan Burles does not have any open projects.
    Nathan Burles does not have any work in progress.
[see more]

Portfolio

[see more]

Résumé

Education

1st Class with Honours, Master of Engineering in Computer Systems and Software Engineering

University of York

2005-2010

Publications

Full Implementation of an Estimation of Distribution Algorithm on a GPU

GECCO 2011

An implementation of an Estimation of Distribution Algorithm (specifically a variant of the Bayesian Optimisation Algorithm) using GPGPU.<br /><br />Winner of the GECCO GPGPU Challenge 2011 (http://www.gpgpgpu.com/gecco2011).

A rule chaining architecture using a correlation matrix memory

Springer Berlin Heidelberg

This paper describes an architecture based on superimposed distributed representations and distributed associative memories which is capable of performing rule chaining. The use of a distributed representation allows the system to utilise memory efficiently, and the use of superposition reduces the time complexity of a tree search to O(d), where d is the depth of the tree. Our experimental results show that the architecture is capable of rule chaining effectively, but that further investigation is needed to

Improving the Associative Rule Chaining Architecture

Springer Berlin Heidelberg

This paper describes improvements to the rule chaining architecture presented in [1]. The architecture uses distributed associative memories to allow the system to utilise memory efficiently, and superimposed distributed representations in order to reduce the time complexity of a tree search to O(d), where d is the depth of the tree. This new work reduces the memory required by the architecture, and can also further reduce the time complexity.<br /><br />[1] A Rule Chaining Architecture Using a Correlation Matrix M

Extending the Associative Rule Chaining Architecture for Multiple Arity Rules

Neural-Symbolic Learning and Reasoning Workshop at IJCAI 2013

The Associative Rule Chaining Architecture uses distributed associative memories and superimposed distributed representations in order to perform rule chaining efficiently [1]. Previous work has focused on rules with only a single antecedent, in this work we extend the architecture to work with multiple-arity rules and show that it continues to operate effectively.<br /><br />[1] A Rule Chaining Architecture Using a Correlation Matrix Memory, 2012

ENAMeL: A Language for Binary Correlation Matrix Memories

Springer US

Despite their relative simplicity, correlation matrix memories (CMMs) are an active area of research, as they are able to be integrated into more complex architectures such as the Associative Rule Chaining Architecture (ARCA) [1]. In this architecture, CMMs are used effectively in order to reduce the time complexity of a tree search from O(b^d) to O(d)—where b is the branching factor and d is the depth of the tree. This paper introduces the Extended Neural Associative Memory Language (ENAMeL)—a domain speci