Get a Freelance Job

We are seeking for developers that have experience in building a
1) Social CRM
2) Must have knowledge of building Multitenant CRM
3) Must have knowledge on Cloud platform like Heroku
4) Must have knowledge in Ruby on Rails and PHP and MYSQL
5) Experince with a telephony software that integrates with other application will be a major plus
6) Knowledge of building platform as a service like force will be a major asset

If you have the following expertise please respond looking to start t…

Volume trading with Force Index
EA Reset initial compare Volume value every 00 GMT new date.
So in picture eurotrades 915

Reset Value of Volume at 2011.09.16 00:00 is 1141.
Set trigger to open any position at 1142 x2 = 2282.

Entry Signal
1) Signal a Buy position as candle close volume level was 2293 > 2282 & Force Index below 0 or bearish divergence occur.
2) Signal a Sell position as candle close volume level was 2362 > 2282 & Force Index was above 0 or Bullish Divergence occur…

I have a password on a site that I need to use a brute force to access.

I have the username and can reset the password easily because there is no email sent out, the password is just reset in the database.

The random generated password is between 6 and 7 numbers. (Numeric)
Sometimes it is reset to a 6 digit number, sometimes 7 digits.

Hello,

We need someone to integrate our wordpress contact form with Salesforce. We need to get this work done as soon as possible. So please quote accordingly. Thank you

Hello,

We need someone to integrate our contact us form with Sales force. The form is in WordPress. Please quote as soon as possible. Thank you

The deadline is Oct 25th in C only and not in C++
Traveling Salesman Problem Project
Background
A very famous permutation problem is the Traveling Salesman Problem. One version of this problem is: given n cities with different distances among them, what is the least cost to visit all cities? Unfortunately, the brute-force method of solving this problems requires that we assess (n – 1)! permutations of the cities (why?). How feasible is this?

However, not all is lost. For computationally “hard” problems such as this one we have means to find good if not strictly optimal solutions – say within 5-10% of optimal. (Note that “computationally hard” problems are formalized as “np-complete” or “np-hard.”

One way to address this problem might be based upon a simplified approach to the permutation form of genetic algorithms. As always, Wikipedia has some good information on this technique.

Here is a basic approach (based upon an algorithm presented at Wikipedia) to solve our problem:
1. Choose the initial population of tours (generate a set of permutations of the orderings of the cities)
2. Evaluate the fitness of each individual tour
3. Repeat
1. Select best-ranking individuals to reproduce or as elites (see below)
2. Breed new generation through crossover or mutation or both (genetic operations) and give birth to offspring
3. Evaluate the individual fitness of each offspring
4. Replace worst ranked part of the current population with offspring
4. Until termination
Subsequent Generations will be made up of:

Mutations:
Make a minor change (for instance, randomly swap two or four cities) to make a slightly different version of a good order.

Crossovers:
Splice the end of one ordering to the end of another. This is not simple to realize with permutations (why?)

Elites
Do not cross over or mutate the few best individuals, but rather, keep them as-is.
Or, make copies of them and mutate the copies.

Termination of the Algorithm:
You will repeat the process of creating a generation of tours, checking for the best, determining elites and creating mutations, until the program reaches a terminating condition. Typical ways to terminate include:

In C. DEADLINE: October 25th. travelingSalesmanPr.c
Background
A very famous permutation problem is the Traveling Salesman Problem. One version of this problem is: given n cities with different distances among them, what is the least cost to visit all cities? Unfortunately, the brute-force method of solving this problems requires that we assess (n – 1)! permutations of the cities (why?). How feasible is this?

However, not all is lost. For computationally “hard” problems such as this one we have means to find good if not strictly optimal solutions – say within 5-10% of optimal. (Note that “computationally hard” problems are formalized as “np-complete” or “np-hard.”

One way to address this problem might be based upon a simplified approach to the permutation form of genetic algorithms. As always, Wikipedia has some good information on this technique.

Here is a basic approach (based upon an algorithm presented at Wikipedia) to solve our problem:
1. Choose the initial population of tours (generate a set of permutations of the orderings of the cities)
2. Evaluate the fitness of each individual tour
3. Repeat
1. Select best-ranking individuals to reproduce or as elites (see below)
2. Breed new generation through crossover or mutation or both (genetic operations) and give birth to offspring
3. Evaluate the individual fitness of each offspring
4. Replace worst ranked part of the current population with offspring
4. Until termination
Subsequent Generations will be made up of:

Mutations:
Make a minor change (for instance, randomly swap two or four cities) to make a slightly different version of a good order.

Crossovers:
Splice the end of one ordering to the end of another. This is not simple to realize with permutations (why?)

Elites
Do not cross over or mutate the few best individuals, but rather, keep them as-is.
Or, make copies of them and mutate the copies.

Termination of the Algorithm:
You will repeat the process of creating a generation of tours, checking for the best, determining elites and creating mutations, until the program reaches a terminating condition. Typical ways to terminate include:

I am looking to collect information from a few fields (name, e-mail, phone number – nothing mandatory) on my wordpress page and submit them to my salesforce account securely. I am running a hostmonster account and can purchase a static ip if necessary. Additionally, I am using WordPress as a CMS.

We need a software that does the following:

The ipod is placed on a dock on a kiosk with no user interaction. The app needs to delete all current content on the ipod and then copy specific files to the ipod and place in a specific place (podcast folder)

The screen must show current progress.

Ipod nano 3rd Gen and ipod nano 4th gen will be used.

Must record a simple report file to show how many have been updated, how frequently etc.

No commercial value as will be bespoke for internal communication purposes.

Timeframe – 2 weeks

Really simple for a pro.