Graphics-Based User Interface - Java Programming Assignment Help

Download Solution Order New Solution
Assignment Task
Graphics-Based User Interface - Java Programming Assignment Help

You are required to write an application or script in the language of your choice but without any additional libraries beyond those that come with the basic installation.
Your script or application must run from the command line or shell and take in two arguments. The first argument will be a set of IR engine results in the format: Weight; Enginett; Doctigankscore weightenginett; Dodtrankscore weight engine; Doc#;rank score etc With one rank per line ranked from most relevant to least relevant. Eg: (each column is tab-delimited) 1;100;1 2;24;1 3;5;1000 4;24;900 1;233;0.9 2;13;0.92 3;84;901 4;12;850 Engine number will not change in a column, nor will weight. Document number can be any number between 1 and 1500 Rank score can be any umber but will always decrease or remain constant as the rows increment. Two documents can have a same rank score. There is no set number of results per engine, your script/application will need to cut each result set off at a fair point or at the shortest result set available. The second argument will be a list of document Engine IDs and weights in the format engine; weight[tabjenginelD; weight eg: A;1.0 8;1.2 the weight will always be a two-digit number with one decimal place ranging from 0.1 to 9.9
Your script must use :
1. Interleaving
2. CombSUM
3. LCM
to produce a set of three top 100 documents, one for each fusion technique.

You must write a script or application to run from command line or shell with no graphics based user interface or menu options.
Your script or application must accept two arguments. The first will be the training data, the second will be the live data.
When executed your script or application must generates probfuse model from the training data which will be given in the format:
1;A;RNNRUNNRURRRUNUNNNNRR;10
1;B;RUURRNNRNNNNRRURUNNRN;15
2;A;RNRRRNNNRUUUUNNRRNRRN;10
2;B;RNNNNRURUNNRUNRRNNNNR;12
These represent 2 test runs from each engine A and Engine B. There will be a maximum of 26 engines represented by a single letter and a maximum of 20 runs from each engine. Where R = a relevant result, N = a non-relevant result, U = an unknown result Ranking is from left to right in descending order (1 2 3 4 5 6 ....)
Each Run will be on a separate line and will be preceded with the number of the run and the letter of the engine it was taken from. The final number is the number of relevant documents in the corpus for that query run.
The second argument will be a single number in the range of 3 to 20. This will be the number of sectors you must use in your model.
Once the profuse model is complete you must apply it to the file provided in the third argument. The Live clata file will give a list of Document IDs and the Engine ID they were produced by. Your script or application must take the live results and by applying the model developed by the training phase, generate a ranked list of a top 20 documents from the results provided.

This Java Programming Assignment has been solved by our Java Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

Get It Done! Today

Country
Applicable Time Zone is AEST [Sydney, NSW] (GMT+11)
+

Every Assignment. Every Solution. Instantly. Deadline Ahead? Grab Your Sample Now.