Difference between revisions of "Team:HFUT-China/Description"

Line 1: Line 1:
{{HFUT-China}}
 
 
 
<html>
 
<html>
  

Revision as of 09:01, 26 August 2017

Description

Hfut Software Team
          - Project Description

What for?

Generally speaking, our system is a project search engine.

The system is based on a project library that stores information (including the profile, the purpose, the process, the results etc.) of all the teams’ projects in the past years and updates daily to keep up with the times. The system provides a variety of ways for searching information. And by the special processing of the information, we also optimize the searching performance and ensure the effectiveness of search results.


How?

Way of Search:
  • Search by Category The system gives basic classification of previous projects, you can use the category tags to search.

  • Search by Bioblock By searching for a bioblock, you can get all the related information of the previous projects.

  • Search by Combination of Bioblocks By searching for two bioblocks, you can get projects related to the two bioblocks.

  • Search by Key Techniques By searching for the key techniques used in the project, you can get the previous projects that used the same technique.


Optimize performance:

Search for performance protection:
  • The captured data is structured in the database by reasonable prior analysis processing, so that the retrieval and the time consumption of the data analysis are not felt during the retrieval process.


Guarantee the effectiveness :
  • In the initial processing of storage, the data is sorted by algorithm through keywords. Content that is relevant to the keywords will be placed ahead. And the searching results will be sorted by algorithm as well.

  • The sorting algorithm itself is a model. When user looks at the searching results, the system will know which kind of information is more useful to the user according to the user's feedback. Through this information collection training and screening model, the system itself will optimize the sorting algorithm.