The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
Sriram Srinivasan•Deepak Kumar Vasthimal•Purshotam Shah
A method and system for dynamically providing location based answers to users is disclosed.
Yahoo! 2014. All rights reserved.
English (United States)
This text was extracted from a Microsoft Word document.
This is the abbreviated version, containing approximately
52% of the total text.
Method and System
for Dynamically Providing Location Based Answers to Users
A method and system for dynamically providing location
based answers to users is disclosed.
Disclosed is a method and system for dynamically providing
location based answers to users. The method
and system dynamically provides answers to questions posed by a user on the
happenings at a particular location. An
application (app) installed on a mobile device of the user seeks answers from one
or more users who are at that particular location. Thereafter, the answers received from the one
or more users are dynamically provided to the user.
In a scenario, a user ‘U’ poses a question ‘Q’, which is
mapped to a location ‘L’ and a topic ‘T’ by a notification system. The notification system receives the question
Q posed by the user U and computes a list ‘N’ of users who are at/near the
location L to obtain answers for the question.
Thereafter, the users in the computed list N are ranked, wherein the
users are ranked based on the likelihood of providing answers to the questions. The likelihood can be calculated based on
past responses of the users. In
accordance with the scenario, the top users ‘K’, where K < N in the list are
notified/alerted for answering the question Q.
Subsequently, the answers submitted by each of the K users are processed
and one or more of the answers submitted by the K users are presented to the
user U. If none of the K users provide
an answer to the question Q within the first minute of alert, a new set of
users are notified to obtain answers, wherein the new set of users can be the
next K users according to the ranking.
With each passing minute, the number of users’ notified increases, until
an answer is provided or the list of users is exhausted.
In a scenario, the notification system initially indentifies
the topic T and location L of the question Q posed by the user U. Ther...