The program must be written in ANSI C according to Brainstorm’s Standard Operating Procedure. The "gotoless" source code must be ready to be compiled on a Linux box with the GNU toolset (C compiler, linker, and make).
The purpose of the Quantitative Matching Module is to compare two weighted sets of parameters and return an overall matching percentage. The parameters’ weight will be different for each set.
The module must have mainly four functions. The main function must call the other three to compare two Boolean values, two single choice values, or two multiple choice values respectively. Each of those three functions must return a match percentage.
Boolean: 0 and 0 = 100%; 0 and 1 = 0%; 1 and 1 = 100%
Single choice: 1 and 1 = 100%; 2 and 3 = 0%; 5 and 1 = 0%; 3 and 3 = 100%
Multiple choice: 2, 3 and 2, 3 = 100%; 2, 3 and 3, 5 = 50 %; 2, 3, 4 and 1, 4, 5 = 33%
The main function must use the results of the individual matching functions plus the weight assigned to each parameter to generate a global matching percentage. There may be an unlimited number of Boolean, single, and multiple choice entries. The number of inputs of each type will be a parameter passed to this function.
It’s not as difficult as it sounds, actually it should be very easy to code. To avoid wasting time we suggest that the programmer submits the matching algorithm to us before start coding.
The SOP and an HTML file to simulate different inputs are included.
1) Complete source code of all work done.
2) Deliverables must be full source code in ready-to-compile condition.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc.).
* * *This broadcast message was sent to all bidders on Monday Jan 24, 2005 1:09:13 PM:
There is now detailed information and additional files for QUANTITATIVE MATCHING MODULE project. Please review and submit a firm bid.
GNU C/C++ compiler, linker, and make.