Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    University Learning and Anti-Plagiarism Back-End Services

    Manjur Kolhar*, Abdalla Alameen

    CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1215-1226, 2021, DOI:10.32604/cmc.2020.012658

    Abstract Plagiarism refers to the use of other people’s ideas and information without acknowledging the source. In this research, anti-plagiarism software was designed especially for the university and its campuses to identify plagiarized text in students’ written assignments and laboratory reports. The proposed framework collected original documents to identify plagiarized text using natural language processing. Our research proposes a method to detect plagiarism by applying the core concept of text, which is semantic associations of words and their syntactic composition. Information on the browser was obtained through Request application programming interface by name Url.AbsoluteUri, and it is stored in a centralized… More >

  • Open Access

    ARTICLE

    On Multi-Thread Crawler Optimization for Scalable Text Searching

    Guang Sun1, Huanxin Xiang2, Shuanghu Li1,*

    Journal on Big Data, Vol.1, No.2, pp. 89-106, 2019, DOI:10.32604/jbd.2019.07235

    Abstract Web crawlers are an important part of modern search engines. With the development of the times, data has exploded and humans have entered a “big data era”. For example, Wikipedia carries the knowledge from all over the world, records the real-time news that occurs every day, and provides users with a good database of data, but because of the large amount of data, it puts a lot of pressure on users to search. At present, single-threaded crawling data can no longer meet the requirements of text crawling. In order to improve the performance and program versatility of single-threaded crawlers, a… More >

Displaying 1-10 on page 1 of 2. Per Page