The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
copying ones' thought, idea, and represents it as own idea without giving proper acknowledgement to the original author. In research area, it is a serious crime and still now not so many systems have been developed to detect plagiarism. Our area of focus is on the keywords or index terms present in different research papers
needs. In this paper, we present the design, architecture and implementation of an open-source keyword-based paradigm for the search of software resources in Grid infrastructures, called Minersoft. A key goal of Minersoft is to annotate automatically all the software resources with keyword-rich metadata. Using advanced
In this paper, we consider the problem of securing mobile-cloud storage services. We design and develop a novel and secure searchable encryption scheme for mobile devices. In the proposed algorithm, a content based index is constructed and a locality sensitive hashing is used to allow the user to store his files on the cloud in a secure way and then perform a secure query and a fuzzy search. Moreover,...
Reusing software components (e.g. classes or modules) improves software quality and developer's productivity. Unfortunately, developers may miss many reusing opportunities since current keyword based component search systems cannot provide reusable components if the developers do not use them. This paper proposes a
QExpandator is proposed that improves the effectiveness in code search by expanding query terms with search topic and content specific keywords. It extracts user queries and clicked code fragments from the previous search history and represents each query in a vector document. Jaccard similarity score is calculated for each term
Peers search contents with information of contents such as keywords in many peer-to-peer contents sharing systems. In many peer-to-peer contents search architectures, queries are forwarded to peers which belong to clusters related with the keywords. Since clusters are basically constructed regardless of physical
author's keywords co-occurrence in the dataset selected. The scope of the data is limited by the sources of the literature used, in this case the LACLO and ICALT conferences and relevant Journals in the area, between years 2009 and 2016. We use the SciMat tool for this purpose and we present the analysis performed in the
builds another index, mapping the bug report keywords with developer bug fixing expertise. On arrival of new bug reports, the final module queries the two indexes using the new bug report terms, and applies tf-idf technique on the query result to calculate an ERBA score for developers. Finally, an ascending ordered list on
Question-oriented text retrieval, aka natural language-based text retrieval, has been widely used in software engineering. Earlier work has concluded that questions with the same keywords but different interrogatives (such as how, what) should result in different answers. But what is the difference? How to identify
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.