I am a Philosophy Professor at a liberal arts college currently doing some research that requires a program that does some rather specific computations. The winning bidder on this project will be able to complete the program in a very timely manner and there will be many opportunities in the near future for related work, especially if I acquire further funding for this and related projects. I do not have any programming experience but my programming friends tell me this is a very simple job.
I will give a synopsis of what I require here, but please see the enclosed PDF document with all needed details. I would like this project completed within a few days of the winning bid.
The program will take as input two numbers. The first number, m, will represent the total number of objects in a set, S. I’ll illustrate by supposing that we’re talking about a set of jellybeans. The second number, n, will represent the number of objects (jellybeans) in the set S with some property P. As an example of the property P, we’ll say we’re looking at red jellybeans. Given two inputs of n and m, The program will keep fixed the ratio of red jellybeans to total jellybeans as n/m.
Step ONE: The program will label every jellybean with a number 1…m and arbitrarily assigns n jellybeans the property P, and keep track of which do and which do not.
Step TWO: After such labeling, the program will carve up the set S into all the logically possible partitions of S with the following feature: no two subsets of S in the partition have the same fraction of red jellybeans.
Step THREE: Upon listing, labeling, and saving all of these partitions, the program will then proceed to take every possible pair of these partitions and compute the following:
Let’s say that program is comparing Partition 1 with Partition 2. The program will locate Jellybean 1 in Partition 1, locate the subset in which it is a part in Partition 1, and see the fraction of red jellybeans of this subset and record it. The program will then locate Jellybean 1 in Partition 2, locate the subset in which it is a part in Partition 2, and see the fraction of red jellybeans of this subset and record it. The program will then take the average of these two fractions, and assign Jellybean 1 to this fraction. The program will do this will every jellybean in Partition 1 and Partition 2. Upon completion, the result ought to be a list of Jellybeans assigned to fractions. The program will then check to see if this list is in the set of all partitions generated in Step TWO. If it is, the program will save the list and record that it is the result of computing from Partition 1 and 2. If it is not, the program may discard this list and proceed to compute this again for EVERY REMAINING PAIR of partitions.
The goal of the program is to see, for any n,m, how many partitions there are with the properties listed in Step Two, and to see how many pairs of these partitions are such that, after computing according to Step THREE, the result is a partition that is generated in Step TWO. The answer to this question is what will inform my research. The output of the program should be a number of the partitions generated by Step Two, and the number of positive results generated from Step Three. I should also be able to ask the program to list the Partitions that yield positive results via Step Three.
I prefer a programmer who is able to communicate effectively with people who do not know much about programming, and who can code a program I can operate on my Mac Snow Leopard.
Hi Barry, Your project looks interesting. I've read through the PDF, and I have a couple of questions about the algorithm. Please see the message board; I'll post my questions there. Thanks, -dave
26 freelancer bu iş için ortalamada 292$ teklif veriyor
Hello. I am a computer science student. We do a lot of this type of computations in university. I would use java for this program since it work on every operating system.
Hi, I'm very much interested in your project and I'd like to help you. Sure I can provide u the perfect solution in 2 days, and communication is not a problem for me. Thanks,