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.
This paper presents our recent attempt to make a super-large scale spoken-term detection system, which can detect any keyword uttered in a 2,000-hour speech database within a few seconds. There are three problems to achieve such a system. The system must be able to detect out-of-vocabulary (OOV) terms (OOV problem
This paper introduces a novel keyword searching paradigm in relational databases (DBs), where the result of a search is a ranked set of object summaries (OSs). An OS summarizes all data held about a data subject (DS) in the database. More precisely, it is a tree with a tuple containing the keyword as a root and
Conventional top-k spatial keyword queries require users to explicitly specify their preferences between spatial proximity and keyword relevance. In this work we investigate how to eliminate this requirement by enhancing the conventional queries with interaction, resulting in Interactive Top-k Spatial Keyword (ITkSK
demonstrate the effective searching results, the homologous searching and keyword analysis for Cytochrome CYP450 enzymes is illustrated as an example to emphasize the importance of structural feature conservation among remote homologous organisms and to exploit the advantages of such characteristics for remote protein matching
In this paper, we propose the ldquoaddedrdquo use of proximity search to a Web search query for narrowing down the set of documents returned as answers to a keyword based search query. This approach adds value to Web search query results by allowing users to better express what they are looking for. Most of the
could not provide effective clues to real innovation. The authors consider that the most perplexing problem during innovative thinking is to find the genuine problem of objective design; therefore, the proposed idea introducing a keyword recognition approach based on a specific keyword bank and its corresponding TRIZ
system to assist the users in easily accessing the information and have an enjoyable experience browsing Kotenseki images. There are two main functions comprising keyword-based and image-based queries. We also provide automatic detection of objects within the original images to create a database of feature vectors. Our
prefer to eat, approximated budget for each person and few other defined parameters as searching keyword. While searching, the system will fetch the entries from the database according to user defined parameters, convert each item's metadata to fuzzy parameters and pass the list to a fuzzy controller. Then the controller
produced unsatisfactory results for the patent queries, since the inherent search systems would have come from the traditional keyword based models so that it has been inevitable to result in too many unrelated items. This has made the patent experts keep spending a lot of time to refine the results manually. We propose two
to be the best approach in the literature. In this paper, however, we show that their proposal seems unlikely to be implementable with the latest technology, due to a large amount of computation cost involved. Then, we provide an improved method to turn the keyword search more practical, which cannot only avoid the
engineering problems. To reuse previous design resolution, this paper presents a function based patent retrieval approach in which the initial keywords are represented as “verb + noun”, and then the verbs and nouns are automatically expanded into verb set and noun set using Functional Basis and WordNet. The verb
This article dials with the problems of information search in company knowledge management system by keywords and belonging to some category. The approach of weight coefficients correction based on user activity statistics is considered; also, associative analysis that allows to determine keywords bonds in measure of
and managed. Adaptation, personalization, usage statistics are some of the LMS functionality. But due to the exponential availability of Learning Objects, it leads to increase in difficulty to find the right resource to the user based on the context of learning or his/her preferences. When we search through keywords it
As an approach to search /retrieve such objects as pictures, music, perfumes and apparels on the Internet, sensitivity-vectors or kansei-vectors are useful since textual keywords are not sufficient to find objects that users want. The sensitivity-vector is an array of values each indicates a degree of feeling or
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.