Fujitsu Corporation

Albert Reinhardt

David Loren Marvit

Stergios Stergiou

Yannis Labrou

B Thomas Adler

Hitoshi Matsumoto

Kenji Nagahashi

Jawahar Jain

John J Sidorowich

Rajalakshmi Balakrishnan

Alex Gilman

Dave Marvit

In one embodiment, a set of target search terms for a search is received. Candidate terms are selected, where a candidate term is selected to reduce an ontology space of the search. The candidate terms are sent to a computer to recommend the candidate terms as search terms. In another embodiment, a document stored in one or more tangible media is accessed. A set of target tags for the document is received. Terms are selected, where a term is selected to reduce an ontology space of the document. The terms are sent to a computer to recommend the terms as tags.

Recommending terms to specify ontology space

A peer-to-peer network in which a respective uploaders is paid for uploading content in accordance with a request for the content by a respective downloader. More specifically, the respective uploader is paid an amount determined in accordance with quality of service factors committed to in advance of the uploading by the respective uploader, quality of service factors actually provided to the respective downloader by the respective uploader or a quality of service requested by the respective downloader. A central system reconciles payment from the respective uploader, to a respective downloader and to a content rights holder.

Peer-to-peer network with paid uploaders

A predetermined number of temporary terms are obtained that have the highest differential affinity to each of a number of candidate terms. Each temporary term and the associated differential affinity is placed into a set of temporary terms. An average differential affinity is calculated for each temporary term of the set of temporary terms, the average differential affinity representing an average of differential affinities from the each temporary term to every term of the initial set of terms. One or more terms with an average differential affinity that fails to satisfy a predetermined threshold are removed from the temporary set. One or more terms of the temporary set with differential affinities above the threshold are placed into the set of candidate terms. One or more terms of the set of candidate terms are selected and output to a user.

Determining candidate terms related to terms of a query

According to certain embodiments, facilitating display of terms includes facilitating display of a graphical user interface. One or more first input terms entered into a user entry window of the graphical user interface are received. One or more first output terms related to the first input terms are determined. Display of a first graphical cloud comprising the first output terms is facilitated. The first input terms are modified to yield one or more second input terms. One or more second output terms related to the second input terms are determined. Display of a second graphical cloud comprising the second output terms is facilitated.

Facilitating display of an interactive and dynamic cloud of terms related to one or more input terms

Implementing an expanded search and providing expanded search results comprises receiving a search query generated by a user. A type of expansion to apply to the search query is determined. Expanded search queries are automatically generated according to the determined expansion type without intervention from the user. A search is executed on each one of the expanded search queries to retrieve search results, and the search results are provided for presentation to the user in modules. A module comprises search results for one of the expanded search queries.

Growing community of inventors

Albany, CA, United States of America

Albert Reinhardt