Get a Freelance Job

I have a data processing program that exports ascii files similar to the attached. I need a VBA program in Excel that will allow me to select multiple files of this type, and import them into an excel workbook. Each file would need to be delimited into a separate worksheet in the workbook, with the worksheet name changed to the ascii file name.

Notice in the ascii file that the depth values are negative at the beginning of the file. I would like these negative values to be deleted from the file at some point, as well as the first 10 records following the first positive depth value (this is when the instrument is coming to equilibrium and these data are meaningless).

Next, I would like the column headers to be changed to something a bit easier to understand for the end users. While 95% of the time the column headers will be the same as in the example file, there may be instances where some of these do not appear and/or additional ones are added (depending on the equipment used). I’d be satisfied if these nine headers were changed as follows:
DepSM

Hi,

I am looking for some help to install Depth JS on Mac OSX 10.6, please quote if you are able to assist. I am having problems getting the plugin for Chrome to work.

Please quote if you can help

ScriptLan

Tags:

<CF_Google searchterm=”my search phrase” domain=”www.acme.com” depth=”100″>

<CF_Yahoo searchterm=”my search phrase” domain=”www.acme.com” depth=”100″>

<CF_Bing searchterm=”my search phrase” domain=”www.acme.com” depth=”100″>

<CF_Ask searchterm=”my search phrase” domain=”www.acme.com” depth=”100″>

Basically, when called, the tag will do a query to the search engine indicated.

- Tag name indicates which search engine to use
- SearchTerm indicates which search phrase to query
- Domain indicates what domain name to match
- Depth = the number of ranks deep to check

Each search engine allows a parameter in the URL on the GET operation that indicates the number of rows to return. If depth = 100, you will do one CFHTTP GET operation with that parameter in the URL, indicating to return one result page with 100 records. You should not be doing 10 queries to get 10 results per query.

When you get the results, they should be parsed and placed into an array.

IMPORTANT: We ONLY want natural search results. Ignore all Pay-Per-Click / Sponsored Search, as well as any Local Search (ie. the maps). Do not include them when calculating ranks.

Take just the natural results, loop through, and build four arrays:
title[x] = the title (ie. hyperlink text)
description[x] = the description shown in the results
domain[x] = the clean domain name of the listing
theurl[x] = the URL of the listing

NOTE: : Do not create an array url[x] because “url” is a reserved word in ColdFusion and this will only cause you problems. Please name it “theurl”

So the custom tag will first create those four one-dimensional arrays, do the CFHTTP get and then loop over, populating the results. Those results will then be available as the 4 arrays.

You will also create a variable called “ranksfound” initially set = “”

If you find the domain name while going down the page, you will APPEND that rank to the RanksFound variable. So if it is found at ranks 7 and 12 and 23, then RanksFound = 7,12,23

This is a simple task – I’ve built it before. I just don’t have the time right now. It just takes a good eye to parse the rows and figure out what the “delimiter phrases” are that start and end each “row” of data.

To be paid, this must work accurately on all four engines. Please do NOT send me something broken. Make sure you run it and compare the results to on-screen results. If your titles from listing 7 are shown with the domain name from listing 8, that is unacceptable!

I hope to award this quickly.

Thank you

I want a complete c++ program with your own DFS algorithm *as simple as possible* to solve the following problem.
We have a sliding puzzle with one black,two white tiles and an empty space B_WW.
The order of operators are:
A tile can move to an adjacent empty location (cost 1)
A tile can hop over one tile (cost 1) or hop over 2 tiles (cost 2)
The goal is to have all white tiles to the left(dont care for empty position)
The output of the program should be like plain English instructions ie:
1)blank tile slides one position to the right
2)blank tile hop over one tile to the right
3)…
4)…
5)Goal: i.e WWB_

I need an application that can solve the n-queens puzzle using the different types of searchs, listed below:

-Breadth-first search
-Depth-first search
-Iterative Depth
-Bidirectional search
-Best-first search
-Greedy
-A*
-A* with iterative depth
-A* SRM

Program just have to be able to solve the specific case of 8 queens

Input
-User should be able to choose the type of search he wants to use to solve the puzzle
-After showing a solution, user can decide if he wants to see another solution, or if he wants to return to main menu.

Output
-Program should display the solution by writing a board of 8×8 using * and Q, where * are blank spaces and Q are queens (of course).
Q * * * * * * *
* * * * Q * * *
* * * * * * * Q
* * * * * Q * *
* * Q * * * * *
* * * * * * Q *
* Q * * * * * *
* * * Q * * * *
-Program should be able to display all possible solutions for this problem
-Also it is needed that the program shows the time it took it to solve the puzzle, every time it has to display a solution

Interface
-This is a console application
-Program will start with a menu where user can select the type of search to be used or to exit the program
1) Breadth-first search
2) Depth-first search
3) Iterative Depth
4) Bidirectional search
5) Best-first search
6) Greedy
7) A*
A* with iterative depth
9) A* SRM
10) Exit
-After showing a solution, it should ask the user if he wants to see a different solution, where Y = yes and N = no

Logic of the program
-It’s really up to you to decide how the program will generate the graphs and do the searches, but i need the code very well documented, to make it easy for me to understand how the program works

Exceptions/Error handling
-In case a user select an option out of range or wrong letter, program should display a small error message, letting the user know that the option he selected is not valid, and the program should wait until it gets a valid request.
-In case that the puzzle can not be solved or can not get all the possible solutions (not sure if that can happen), program should display a message letting the know the user that it can not get a solution or any more solutions using that type search.

*****All this needs to be done by next Monday (May 3rd)*****