patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
9,946,812 | 1 | 2 | 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method, the method comprising: dividing, by a processor, a first text into words; generating a converted character string by performing at least one of appending at least one character in at least either one of previous and subsequent positions of the target character string; replacing at least one character of the target character string; generating the retrieval condition for retrieval candidates in the words of the first text, wherein the retrieval condition improves extraction accuracy of the target character string by determining that a retrieval candidate is an exclusion candidate based on the retrieval candidate being appended to the converted character string, and the retrieval candidate matching the target character string and not matching the converted character string based on a ratio of a part of the retrieval candidate which matches the converted character string and corresponds to the target character string that is less than or equal to a reference frequency; and retrieving the target character string based on the retrieval condition. | 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method, the method comprising: dividing, by a processor, a first text into words; generating a converted character string by performing at least one of appending at least one character in at least either one of previous and subsequent positions of the target character string; replacing at least one character of the target character string; generating the retrieval condition for retrieval candidates in the words of the first text, wherein the retrieval condition improves extraction accuracy of the target character string by determining that a retrieval candidate is an exclusion candidate based on the retrieval candidate being appended to the converted character string, and the retrieval candidate matching the target character string and not matching the converted character string based on a ratio of a part of the retrieval candidate which matches the converted character string and corresponds to the target character string that is less than or equal to a reference frequency; and retrieving the target character string based on the retrieval condition. 2. The computer program product of claim 1 , further comprising generating the retrieval condition based on the ratio of the part matching the converted character string being equal to or less than the reference frequency among the parts which correspond to the target character string in the words of the first text. | 0.64059 |
8,682,823 | 15 | 18 | 15. A computer program product, encoded on a non-transitory computer-readable medium, operable on a data processing apparatus to perform operations comprising: receiving a target vector that includes one or more target vector dimensions; processing at least one of the target vector dimensions to determine a total number of magnitudes assigned to the processed target vector dimension; receiving a source vector that includes one or more source vector dimensions; processing the received source vector to determine a total number of features associated with the source vector; and resolving which of the magnitudes assigned to the processed target vector dimension to select based on one of the detected features associated with the source vector. | 15. A computer program product, encoded on a non-transitory computer-readable medium, operable on a data processing apparatus to perform operations comprising: receiving a target vector that includes one or more target vector dimensions; processing at least one of the target vector dimensions to determine a total number of magnitudes assigned to the processed target vector dimension; receiving a source vector that includes one or more source vector dimensions; processing the received source vector to determine a total number of features associated with the source vector; and resolving which of the magnitudes assigned to the processed target vector dimension to select based on one of the detected features associated with the source vector. 18. The computer program product of claim 15 , further operable to cause a data processing apparatus to perform operations comprising when detected that the total number of magnitudes assigned to the processed target vector dimension equals one, selecting the one assigned magnitude. | 0.86004 |
7,844,957 | 41 | 45 | 41. A system for processing messages comprising: a computer having at least one processor and a memory; a graphical message designer, for receiving input from a user for characterizing logical structure and physical structure of a particular message type in serialized form; metadata, comprising markup language information generated from said design-time input, for characterizing the logical structure and physical structure of the particular message type in serialized form; and code generation modules for automatically generating de novo source code, based on the metadata, that compiles into custom message handling components that are highly optimized for runtime processing of the particular message type, so that a runtime environment may employ the components for processing messages of said particular message type in a highly optimized manner. | 41. A system for processing messages comprising: a computer having at least one processor and a memory; a graphical message designer, for receiving input from a user for characterizing logical structure and physical structure of a particular message type in serialized form; metadata, comprising markup language information generated from said design-time input, for characterizing the logical structure and physical structure of the particular message type in serialized form; and code generation modules for automatically generating de novo source code, based on the metadata, that compiles into custom message handling components that are highly optimized for runtime processing of the particular message type, so that a runtime environment may employ the components for processing messages of said particular message type in a highly optimized manner. 45. The system of claim 41 , wherein said metadata includes a wire format specification for the particular message type. | 0.889094 |
7,934,201 | 8 | 14 | 8. A computer program product operable on a computer and stored in a non-transitory computer memory for testing and validating software, the computer program product performing a process of building an abstract model of a software application under test and a process of testing at least one region of the software under test, the computer program product comprising the instructions of: enabling a user to define at least one specific region of the software application under test by tagging at least one hierarchical element and at least one child region of the specific region by tagging at least one child element of the at least one hierarchical element; enabling a user to tag test objects within the software application under test; building the abstract model using hierarchical elements, child elements and test objects, the hierarchical elements, child elements and test objects indexing at least one object in the at least one region of the software under test; executing a test script to test the at least one object in the at least one region by navigating the abstract model using one or more of the following: a hierarchical element, a child element, and a test object; altering the software application under test by relocating or redefining the at least one region of the software application under test; and re-executing the test script to test the at least one object in the at least one region by navigating the abstract model using one or more of the following: the hierarchical element, the child element, and the test object, the re-executing performed without regeneration of the abstract model. | 8. A computer program product operable on a computer and stored in a non-transitory computer memory for testing and validating software, the computer program product performing a process of building an abstract model of a software application under test and a process of testing at least one region of the software under test, the computer program product comprising the instructions of: enabling a user to define at least one specific region of the software application under test by tagging at least one hierarchical element and at least one child region of the specific region by tagging at least one child element of the at least one hierarchical element; enabling a user to tag test objects within the software application under test; building the abstract model using hierarchical elements, child elements and test objects, the hierarchical elements, child elements and test objects indexing at least one object in the at least one region of the software under test; executing a test script to test the at least one object in the at least one region by navigating the abstract model using one or more of the following: a hierarchical element, a child element, and a test object; altering the software application under test by relocating or redefining the at least one region of the software application under test; and re-executing the test script to test the at least one object in the at least one region by navigating the abstract model using one or more of the following: the hierarchical element, the child element, and the test object, the re-executing performed without regeneration of the abstract model. 14. A computer program product of claim 8 , wherein the software application under test is programmed in one of HTML, XML, XHTML, CHTML, or XAML. | 0.843074 |
7,519,616 | 14 | 21 | 14. A method performed by a computer comprising: referencing one or more multimedia objects through a first set of one or more elements in a first document; associating the first set of one or more elements in the first document to a second set of one or more elements in a second document that is separate from the first document, the associating comprising referencing at least a portion of the first set of one or more elements to one or more elements in the second set of one or more elements; arranging the second set of one or more elements of the second document to indicate timing for the multimedia objects referenced by the first set of one or more elements in the first document; receiving an input to initiate an event affecting an element in the first set of one or more elements of the first document; providing a proxy element in the second document that is configured to reference initiation of the event; and rendering the multimedia objects based on the arranging of the second set of one or more elements. | 14. A method performed by a computer comprising: referencing one or more multimedia objects through a first set of one or more elements in a first document; associating the first set of one or more elements in the first document to a second set of one or more elements in a second document that is separate from the first document, the associating comprising referencing at least a portion of the first set of one or more elements to one or more elements in the second set of one or more elements; arranging the second set of one or more elements of the second document to indicate timing for the multimedia objects referenced by the first set of one or more elements in the first document; receiving an input to initiate an event affecting an element in the first set of one or more elements of the first document; providing a proxy element in the second document that is configured to reference initiation of the event; and rendering the multimedia objects based on the arranging of the second set of one or more elements. 21. The method of claim 14 further comprising associating the second set of one or more elements in the second document to a third set of one or more elements in a third document. | 0.526455 |
9,292,267 | 1 | 2 | 1. A method for compiling data, the method comprising: receiving an input query in a first language; translating the input query to a nested relational algebra (NRA) in the form of a first intermediate representation (IR), wherein the first IR comprises a high-level functional language including algebraic operators; implementing a set of algorithms of the algebraic operators to compile at least some of the first IR into a second IR, wherein the second IR comprises a hybrid language which utilizes a data-flow language and a set of lower-level extensions, and wherein the second IR is optimized by utilizing a set of specific optimizations targeting a part of the second IR that was compiled from a set of algebraic operators of the first IR, wherein the first IR is optimized by utilizing a set of functional optimizations on a set of non-algebra portions of the first IR, wherein the second IR is further optimized by utilizing a set of data-flow optimizations; and compiling at least one of: the first IR and the second IR, into a low-level code. | 1. A method for compiling data, the method comprising: receiving an input query in a first language; translating the input query to a nested relational algebra (NRA) in the form of a first intermediate representation (IR), wherein the first IR comprises a high-level functional language including algebraic operators; implementing a set of algorithms of the algebraic operators to compile at least some of the first IR into a second IR, wherein the second IR comprises a hybrid language which utilizes a data-flow language and a set of lower-level extensions, and wherein the second IR is optimized by utilizing a set of specific optimizations targeting a part of the second IR that was compiled from a set of algebraic operators of the first IR, wherein the first IR is optimized by utilizing a set of functional optimizations on a set of non-algebra portions of the first IR, wherein the second IR is further optimized by utilizing a set of data-flow optimizations; and compiling at least one of: the first IR and the second IR, into a low-level code. 2. The method of claim 1 , wherein all of the first IR is compiled into the second IR. | 0.865625 |
6,128,611 | 27 | 30 | 27. A program storage medium readable by a computer, the medium embodying one or more instructions executable by the computer to perform method steps for accessing a hierarchical database, the method comprising: (a) executing an objects framework in a computer to model the database as one or more data objects, wherein the one or more data objects: (i) provide a direct mapping of data within the hierarchical database; and (ii) encapsulate data retrieved from the hierarchical database; and (b) executing an Internet-enabled generic application program in the computer to access the hierarchical database via the objects framework. | 27. A program storage medium readable by a computer, the medium embodying one or more instructions executable by the computer to perform method steps for accessing a hierarchical database, the method comprising: (a) executing an objects framework in a computer to model the database as one or more data objects, wherein the one or more data objects: (i) provide a direct mapping of data within the hierarchical database; and (ii) encapsulate data retrieved from the hierarchical database; and (b) executing an Internet-enabled generic application program in the computer to access the hierarchical database via the objects framework. 30. The program storage medium of claim 27, wherein the data objects correspond to application views, database definitions, and data defined and stored in the database. | 0.819355 |
8,014,634 | 14 | 15 | 14. The system of claim 8 , wherein the computer-readable memory further includes instructions executable by the one or more processors and upon such execution cause the data processing apparatus to perform operations comprising: associating the graphical document under evaluation with one or more keywords; and receiving an advertisement request associated with a concept, and serve the graphical document under evaluation after the distribution approval is granted based on a correlation between the concept and the one or more keywords. | 14. The system of claim 8 , wherein the computer-readable memory further includes instructions executable by the one or more processors and upon such execution cause the data processing apparatus to perform operations comprising: associating the graphical document under evaluation with one or more keywords; and receiving an advertisement request associated with a concept, and serve the graphical document under evaluation after the distribution approval is granted based on a correlation between the concept and the one or more keywords. 15. The system of claim 14 , wherein the advertisement request includes a search query. | 0.95068 |
9,176,642 | 1 | 7 | 1. A computer-implemented system for displaying clusters via a dynamic user interface, comprising: a cluster spine module to display cluster spines, each comprising two or more clusters of documents; a compass framing at least a portion of one or more of the cluster spines in the display; a label generation module to generate at least one label to identify a concept of one of the framed cluster spines; a label display module to display the label circumferentially around the compass; and a concept module to change the concept as the compass moves over others of the cluster spines. | 1. A computer-implemented system for displaying clusters via a dynamic user interface, comprising: a cluster spine module to display cluster spines, each comprising two or more clusters of documents; a compass framing at least a portion of one or more of the cluster spines in the display; a label generation module to generate at least one label to identify a concept of one of the framed cluster spines; a label display module to display the label circumferentially around the compass; and a concept module to change the concept as the compass moves over others of the cluster spines. 7. A system according to claim 1 , further comprising: a marker to receive markings for one or more of the documents in at least one of the cluster spines; and a grouping module to graphically group the documents with the markings by placing the documents into one or more set-aside trays. | 0.741503 |
8,533,195 | 3 | 4 | 3. The topic modeling system as recited in claim 2 , the acts further comprising: providing each calculating unit of a second plurality of calculating units with at least a respective vector of the term-document matrix D and at least a respective vector of the topic-document matrix V, most recently updated, the multiple calculating units including the second plurality of calculating units; and wherein the minimizing the first equation while holding term-topic matrix U fixed includes: independently solving a respective vector of the topic-document matrix V at a respective calculating unit of the second plurality of calculating units based at least in part on the respective calculating unit minimizing a respective third equation that is a decomposition of the first equation. | 3. The topic modeling system as recited in claim 2 , the acts further comprising: providing each calculating unit of a second plurality of calculating units with at least a respective vector of the term-document matrix D and at least a respective vector of the topic-document matrix V, most recently updated, the multiple calculating units including the second plurality of calculating units; and wherein the minimizing the first equation while holding term-topic matrix U fixed includes: independently solving a respective vector of the topic-document matrix V at a respective calculating unit of the second plurality of calculating units based at least in part on the respective calculating unit minimizing a respective third equation that is a decomposition of the first equation. 4. The topic modeling system as recited in claim 3 , wherein the multiple calculating units include multiple processors of a single computer. | 0.95591 |
9,467,409 | 1 | 2 | 1. A method comprising: receiving, by a processor, an email message addressed to an email account; receiving, by the processor, a user request for display of the received email message; configuring, by the processor, the display of the received email message to comprise at least one user interface element that facilitates a user to request for other messages in the email account that are contextually relevant to the received email message; transmitting, by the processor, the received email message and the user interface element for display to the user; receiving, by the processor, a user activation of the user interface element; identifying, by the processor, at least one message in the user's email account that is contextually relevant to the received email message, comprising: constructing, by the processor, vectors representing the received email message and each of the other messages in the email account from the weights of relevant keywords extracted from the received message; ranking, by the processor, the plurality of clusters in a descending order of relevance based on respective ones of the relevant keywords associated with each of the plurality of clusters; selecting, by the processor, from the plurality of ranked clusters, a first ranked cluster as most relevant to the received email message; and ranking, by the processor, messages within the first ranked cluster based on respective similarities to the received message; automatically recommending, by the processor, search terms other than the relevant keywords, that are relevant to the received email message; and transmitting, by the processor, the at least one other contextually relevant message for display to the user. | 1. A method comprising: receiving, by a processor, an email message addressed to an email account; receiving, by the processor, a user request for display of the received email message; configuring, by the processor, the display of the received email message to comprise at least one user interface element that facilitates a user to request for other messages in the email account that are contextually relevant to the received email message; transmitting, by the processor, the received email message and the user interface element for display to the user; receiving, by the processor, a user activation of the user interface element; identifying, by the processor, at least one message in the user's email account that is contextually relevant to the received email message, comprising: constructing, by the processor, vectors representing the received email message and each of the other messages in the email account from the weights of relevant keywords extracted from the received message; ranking, by the processor, the plurality of clusters in a descending order of relevance based on respective ones of the relevant keywords associated with each of the plurality of clusters; selecting, by the processor, from the plurality of ranked clusters, a first ranked cluster as most relevant to the received email message; and ranking, by the processor, messages within the first ranked cluster based on respective similarities to the received message; automatically recommending, by the processor, search terms other than the relevant keywords, that are relevant to the received email message; and transmitting, by the processor, the at least one other contextually relevant message for display to the user. 2. The method of claim 1 , wherein receiving the user activation of the user interface element further comprises: receiving, by the processor, a tap on the user interface element. | 0.864394 |
9,317,605 | 34 | 35 | 34. The method of claim 1 , wherein the respective corpus score for the first corpus is based on a measure of past user behavior after submitting a query that has one or more terms in common with the obtained auto-completion. | 34. The method of claim 1 , wherein the respective corpus score for the first corpus is based on a measure of past user behavior after submitting a query that has one or more terms in common with the obtained auto-completion. 35. The method of claim 34 , wherein the measure of past user behavior is based only on behavior of a user who provided the one or more characters. | 0.964731 |
9,542,065 | 1 | 5 | 1. A mobile communication device comprising: a display; a processor coupled to the display; and a memory coupled to the processor containing instructions which when executed by the processor provide: at least one application; at least one skinning theme document; and a media engine comprising: a parser for parsing the at least one skinning theme document into a template describing rendering characteristics of a graphical interface, the skinning theme document identifying at least one data element; an interaction interface for receiving data from the at least one application associated with one or more of the at least one data element; and a renderer for rendering the received data in accordance with the template as the graphical interface wherein the graphical interface presents one or more data elements of the at least one application that is rendered, wherein the skinning theme document identifies at least one custom event, wherein the interaction interface further receives a notification from the at least one application of an occurrence of one or more of the at least one custom event, and wherein the renderer renders the graphical interface based on the occurrence of one or more of the at least one custom event. | 1. A mobile communication device comprising: a display; a processor coupled to the display; and a memory coupled to the processor containing instructions which when executed by the processor provide: at least one application; at least one skinning theme document; and a media engine comprising: a parser for parsing the at least one skinning theme document into a template describing rendering characteristics of a graphical interface, the skinning theme document identifying at least one data element; an interaction interface for receiving data from the at least one application associated with one or more of the at least one data element; and a renderer for rendering the received data in accordance with the template as the graphical interface wherein the graphical interface presents one or more data elements of the at least one application that is rendered, wherein the skinning theme document identifies at least one custom event, wherein the interaction interface further receives a notification from the at least one application of an occurrence of one or more of the at least one custom event, and wherein the renderer renders the graphical interface based on the occurrence of one or more of the at least one custom event. 5. The mobile communication device as claimed in claim 1 , wherein each application of the at least one application comprises: at least one application data element; and application code. | 0.849678 |
8,818,812 | 5 | 6 | 5. A grouped alphabet input method in an hour hand, a minute hand and a second hand of a watch, comprising: assigning a consonant of an initial phoneme depending on a length and direction of the hour hand; assigning a vowel of a medial phoneme depending on the length and direction of the minute hand; and forming a final phoneme depending on the length of the second hand, wherein the consonant is assigned in the same way as the initial phoneme, with the length of the final phoneme being shortest, so syllables are created in accordance with a combination principle of the initial phoneme, the media phoneme and the final phoneme based on at least one consonant and vowel, wherein, in said initial phoneme and said medial phoneme, the initial phoneme and the final phoneme are directed to expressing consonants or fortis by adding a stroke to the basic consonant group consisting of eight consonants of “n, g, b, z, ng, s, m, and d”, and the medial phoneme is directed to expressing a basic vowel group consisting of eight vowels of “o, wa, a, e, u, wuo, ue, and i”. | 5. A grouped alphabet input method in an hour hand, a minute hand and a second hand of a watch, comprising: assigning a consonant of an initial phoneme depending on a length and direction of the hour hand; assigning a vowel of a medial phoneme depending on the length and direction of the minute hand; and forming a final phoneme depending on the length of the second hand, wherein the consonant is assigned in the same way as the initial phoneme, with the length of the final phoneme being shortest, so syllables are created in accordance with a combination principle of the initial phoneme, the media phoneme and the final phoneme based on at least one consonant and vowel, wherein, in said initial phoneme and said medial phoneme, the initial phoneme and the final phoneme are directed to expressing consonants or fortis by adding a stroke to the basic consonant group consisting of eight consonants of “n, g, b, z, ng, s, m, and d”, and the medial phoneme is directed to expressing a basic vowel group consisting of eight vowels of “o, wa, a, e, u, wuo, ue, and i”. 6. The grouped alphabet input method according to claim 5 , wherein, in said basic consonant group and said basic vowel group, the basic consonant group is consisting of eight consonants of “n g, b, z, ng, s, m, and d” and the basic vowel group is consisting of eight vowels of “o, wa, a, e, u, wuo, ue, i” based on 12 o'clock, 1.5 o'clock, 3 o'clock, 4.5 o'clock, 6 o'clock, 7.5 o'clock, 9 o'clock and 10.5 o'clock, respectively, wherein the basic consonant group is expressed with the length of the hour hand of the watch, and the basic vowel group is expressed with the length of the minute hand of the watch, which are set as the initial phoneme and the medial phoneme, respectively, and wherein the stroke is included one by one to the basic consonant group, and expressed with the length shorter than that of the basic consonant group or the basic vowel group. | 0.565697 |
8,768,768 | 18 | 19 | 18. A computer readable medium having instructions encoded thereon, which, when executed by a processor, cause the processor to perform operations comprising: receiving a set of actions indicating interaction with web content, the set of actions including scored and unscored actions where a scored action is associated with a known score of at least one property of a user associated with the action; inferring initial scores for the web content based on the known scores of the scored actions; estimating initial scores for the unscored actions; inferring revised scores for the web content and inferring initial scores for the web content only associated with the unscored actions based on the known scores of the scored actions and the initial scores of the unscored actions; estimating, by one or more processors, revised scores for the unscored actions based on the revised scores for the web content associated with the scored actions and the initial scores for the web content only associated with the unscored actions; inferring, by the one or more processors, revised scores for at least a portion of the web content based on the known scores of the scored actions and the revised scores of the unscored actions; and performing a plurality of iterations of the estimating and inferring steps above. | 18. A computer readable medium having instructions encoded thereon, which, when executed by a processor, cause the processor to perform operations comprising: receiving a set of actions indicating interaction with web content, the set of actions including scored and unscored actions where a scored action is associated with a known score of at least one property of a user associated with the action; inferring initial scores for the web content based on the known scores of the scored actions; estimating initial scores for the unscored actions; inferring revised scores for the web content and inferring initial scores for the web content only associated with the unscored actions based on the known scores of the scored actions and the initial scores of the unscored actions; estimating, by one or more processors, revised scores for the unscored actions based on the revised scores for the web content associated with the scored actions and the initial scores for the web content only associated with the unscored actions; inferring, by the one or more processors, revised scores for at least a portion of the web content based on the known scores of the scored actions and the revised scores of the unscored actions; and performing a plurality of iterations of the estimating and inferring steps above. 19. The product of claim 18 wherein the actions are traversals. | 0.874502 |
6,018,742 | 8 | 9 | 8. The method of claim 1 including the step of generating a context table including a context record describing a context and including a context identifier for use in associating an entry in the context-dependent table with the context record. | 8. The method of claim 1 including the step of generating a context table including a context record describing a context and including a context identifier for use in associating an entry in the context-dependent table with the context record. 9. The method of claim 8 wherein the step of generating a context table comprises generating a user table including a record of user preferences. | 0.888804 |
8,375,072 | 15 | 17 | 15. The non-transitory computer readable storage medium as recited in claim 13 , wherein the hierarchical data structure comprises a plurality of predefined substructures, a particular predefined substructure of the plurality of predefined substructures selected in response to a categorization of a particular component of the plurality of components of the loss event. | 15. The non-transitory computer readable storage medium as recited in claim 13 , wherein the hierarchical data structure comprises a plurality of predefined substructures, a particular predefined substructure of the plurality of predefined substructures selected in response to a categorization of a particular component of the plurality of components of the loss event. 17. The non-transitory computer readable storage medium as recited in claim 15 , wherein the hierarchical data structure includes a plurality of nodes, a particular node being associated with a particular component of the plurality of components of the loss event and the electronic file folder hierarchy includes a plurality of electronic file folders, a particular electronic file folder being associated with the particular node of the hierarchical data structure. | 0.87652 |
8,332,864 | 12 | 14 | 12. The method of claim 1 , wherein the first and second business logic is executed via a web-based transport protocol. | 12. The method of claim 1 , wherein the first and second business logic is executed via a web-based transport protocol. 14. The method of claim 12 , wherein the web-based transport protocol is HTTPS. | 0.97587 |
9,104,755 | 15 | 16 | 15. The ontology enhancement system according to claim 14 , wherein an user interface is provided to at least an user to determine whether the enhanced ontology should be modified or further enhanced. | 15. The ontology enhancement system according to claim 14 , wherein an user interface is provided to at least an user to determine whether the enhanced ontology should be modified or further enhanced. 16. The ontology enhancement system according to claim 15 , wherein the user is a general user or a specific field expert, and different weighting values are assigned to the general user and the specific field expert. | 0.971767 |
8,548,973 | 1 | 7 | 1. A method comprising: extracting metadata attributes and associated attribute values from web search results, the web search results returned in response to a search request submitted by a user from a computer of the user to a web search engine, the search request comprising search criteria input by the user to the search engine, the search request input by the user using a user interface to the computer, the web search results comprising entries organized into a results list, each entry comprising data extracted from a data object searched by the web search engine and meeting the search criteria, the metadata attributes and associated attribute values extracted from the data objects corresponding to the entries of the results list, each metadata attribute comprising one or more associated attribute values, each metadata attribute comprising a category, each associated attribute value comprising value that corresponding to an associated metadata attribute, wherein the search request of the user does not include, in the search request, the metadata attribute and associated attribute values returned by the web search engine; prioritizing one or more of the extracted metadata attributes and the attribute values, wherein one or more of: the metadata attributes are prioritized based on a number of times attribute values of each metadata attribute occurs in the results list, wherein the metadata attributes are organized so a metadata attribute with a largest number of attribute value occurrences is displayed first in the display of metadata attributes to the user; and the metadata attributes are prioritized based on a number of occurrences for each metadata attribute and wherein presenting the metadata attributes to the user further comprises presenting a subset of metadata attributes to the user, the subset comprising metadata attributes occurring most often in the results list; presenting the prioritized extracted metadata attributes to a user for selection by the user, the prioritized extracted metadata attributes presented to the user on a portion of an electronic display displaying the web search results; receiving input from the user indicating a selected metadata attribute of the metadata attributes; presenting attribute values associated with the selected metadata attribute to the user for selection by the user, the extracted attribute values of the selected metadata attribute are presented to the user on a portion of an electronic display displaying the web search results; receiving input from the user indicating a selected attribute value of the attribute values associated with the selected metadata attribute; filtering the web search results based on the selected attribute value, wherein each entry in the filtered web search results comprises the selected attribute value; and displaying a filtered results list to the user, the filtered results list comprising the filtered web search results. | 1. A method comprising: extracting metadata attributes and associated attribute values from web search results, the web search results returned in response to a search request submitted by a user from a computer of the user to a web search engine, the search request comprising search criteria input by the user to the search engine, the search request input by the user using a user interface to the computer, the web search results comprising entries organized into a results list, each entry comprising data extracted from a data object searched by the web search engine and meeting the search criteria, the metadata attributes and associated attribute values extracted from the data objects corresponding to the entries of the results list, each metadata attribute comprising one or more associated attribute values, each metadata attribute comprising a category, each associated attribute value comprising value that corresponding to an associated metadata attribute, wherein the search request of the user does not include, in the search request, the metadata attribute and associated attribute values returned by the web search engine; prioritizing one or more of the extracted metadata attributes and the attribute values, wherein one or more of: the metadata attributes are prioritized based on a number of times attribute values of each metadata attribute occurs in the results list, wherein the metadata attributes are organized so a metadata attribute with a largest number of attribute value occurrences is displayed first in the display of metadata attributes to the user; and the metadata attributes are prioritized based on a number of occurrences for each metadata attribute and wherein presenting the metadata attributes to the user further comprises presenting a subset of metadata attributes to the user, the subset comprising metadata attributes occurring most often in the results list; presenting the prioritized extracted metadata attributes to a user for selection by the user, the prioritized extracted metadata attributes presented to the user on a portion of an electronic display displaying the web search results; receiving input from the user indicating a selected metadata attribute of the metadata attributes; presenting attribute values associated with the selected metadata attribute to the user for selection by the user, the extracted attribute values of the selected metadata attribute are presented to the user on a portion of an electronic display displaying the web search results; receiving input from the user indicating a selected attribute value of the attribute values associated with the selected metadata attribute; filtering the web search results based on the selected attribute value, wherein each entry in the filtered web search results comprises the selected attribute value; and displaying a filtered results list to the user, the filtered results list comprising the filtered web search results. 7. The method of claim 1 , wherein the attribute values are prioritized based on a number of occurrences for each attribute value and wherein presenting the attribute values to the user comprises presenting a subset of attribute values to the user, the subset comprising attribute values occurring most often in the results list. | 0.899142 |
8,554,760 | 15 | 16 | 15. The non-transitory machine-readable medium recited in claim 14 , wherein the one row comprises a null value for an inner table of the first query, and wherein the second predicate is not null-rejecting. | 15. The non-transitory machine-readable medium recited in claim 14 , wherein the one row comprises a null value for an inner table of the first query, and wherein the second predicate is not null-rejecting. 16. The non-transitory machine-readable medium recited in claim 15 , wherein the having clause comprises a third predicate that is conjunctive with the second predicate, wherein the third predicate comprises a FALSE value when the null value results from a non-correlated row between an inner table of the first query and an outer table of the first query. | 0.898053 |
10,157,231 | 8 | 11 | 8. A computer-implemented method for monitoring electronic interactions with unique items and identifying and analyzing significant attributes of the unique items, the computer-implemented method comprising: generating, by a computer system, user activity data by at least electronically communicating, over a computer network, with a plurality of user devices to receive monitoring data related to user interactions with unique items displayed by user interfaces of the plurality of user devices, wherein the monitoring data comprises position data related to a position of a unique item displayed by a user interface at a time of the user interaction; generating, by the computer system, one or more driver models configured to enable identification of which of a plurality of attributes of a selected unique item are driver attributes and to enable determination of values associated with the driver attributes, the plurality of attributes comprising at least a condition attribute and a feature attribute, wherein generating the one or more driver models comprises: using the position data to reduce any position bias present in the monitoring data; and using one or more of the following methods: linear regression, non-linear regression, model trees, nearest neighbor analysis; receiving, by the computer system, selected item data, the selected item data being related to the plurality of attributes of the selected unique item; and applying, by the computer system, one or more of the generated driver models to the selected item data to generate values associated with driver attributes of the selected unique item for use in generating recommendations of alternative unique items, wherein the computer system comprises a computer processor and electronic memory. | 8. A computer-implemented method for monitoring electronic interactions with unique items and identifying and analyzing significant attributes of the unique items, the computer-implemented method comprising: generating, by a computer system, user activity data by at least electronically communicating, over a computer network, with a plurality of user devices to receive monitoring data related to user interactions with unique items displayed by user interfaces of the plurality of user devices, wherein the monitoring data comprises position data related to a position of a unique item displayed by a user interface at a time of the user interaction; generating, by the computer system, one or more driver models configured to enable identification of which of a plurality of attributes of a selected unique item are driver attributes and to enable determination of values associated with the driver attributes, the plurality of attributes comprising at least a condition attribute and a feature attribute, wherein generating the one or more driver models comprises: using the position data to reduce any position bias present in the monitoring data; and using one or more of the following methods: linear regression, non-linear regression, model trees, nearest neighbor analysis; receiving, by the computer system, selected item data, the selected item data being related to the plurality of attributes of the selected unique item; and applying, by the computer system, one or more of the generated driver models to the selected item data to generate values associated with driver attributes of the selected unique item for use in generating recommendations of alternative unique items, wherein the computer system comprises a computer processor and electronic memory. 11. The computer-implemented method of claim 8 , wherein the generated values associated with the driver attributes of the selected unique item describe at least one of the following: an estimated price contribution of a driver attribute to an overall price of the selected unique item, a perceived value of a driver attribute, a level of desirability of a driver attribute. | 0.76148 |
9,230,130 | 3 | 5 | 3. The method of claim 2 , wherein the response to the electronic signature request comprises the receipt of signature of the electronic signature document by the third user, and the method further comprises: storing a second data structure comprising information corresponding to the signature of the electronic signature document, including information identifying the third user, date information, history information, and form data entered by the third user. | 3. The method of claim 2 , wherein the response to the electronic signature request comprises the receipt of signature of the electronic signature document by the third user, and the method further comprises: storing a second data structure comprising information corresponding to the signature of the electronic signature document, including information identifying the third user, date information, history information, and form data entered by the third user. 5. The method of claim 3 , wherein the access right comprises access to view the electronic signature document and to view the second data structure comprising information corresponding to the signature of the electronic signature document. | 0.928014 |
9,621,578 | 1 | 4 | 1. A computer-implemented method for detecting a network activity of interest, the method comprising: (a) obtaining, by one or more processors, a plurality of network packets from a network, wherein the obtained plurality of network packets comprises network packets categorized as Transmission Control Protocol (TCP) packets and Internet Protocol (IP) packets, wherein the obtained plurality of network packets include the network activity of interest; (b) creating, by the one or more processors, a combined packet from at least two network packets of the plurality of network packets obtained in (a), wherein creating the combined packet comprises converting, bitwise, content from a portion of a first network packet and a portion of a second network packet into a plurality of integers, wherein the first network packet represents a communication from a first node to a second node, and wherein the second network packet represents a communication from the second node to the first node, wherein the combined packet comprises the plurality of integers; (c) obtaining a stored meta-expression that: comprises a plurality of integers in an order, and corresponds to presence of the network activity of interest in network traffic; (d) determining whether the meta-expression obtained in (c) appears in the combined packet created in (b); (e) in response to determining that the meta-expression obtained in (c) appears in the combined packet created in (b), initiating an operation. | 1. A computer-implemented method for detecting a network activity of interest, the method comprising: (a) obtaining, by one or more processors, a plurality of network packets from a network, wherein the obtained plurality of network packets comprises network packets categorized as Transmission Control Protocol (TCP) packets and Internet Protocol (IP) packets, wherein the obtained plurality of network packets include the network activity of interest; (b) creating, by the one or more processors, a combined packet from at least two network packets of the plurality of network packets obtained in (a), wherein creating the combined packet comprises converting, bitwise, content from a portion of a first network packet and a portion of a second network packet into a plurality of integers, wherein the first network packet represents a communication from a first node to a second node, and wherein the second network packet represents a communication from the second node to the first node, wherein the combined packet comprises the plurality of integers; (c) obtaining a stored meta-expression that: comprises a plurality of integers in an order, and corresponds to presence of the network activity of interest in network traffic; (d) determining whether the meta-expression obtained in (c) appears in the combined packet created in (b); (e) in response to determining that the meta-expression obtained in (c) appears in the combined packet created in (b), initiating an operation. 4. The computer-implemented method of claim 1 , wherein the operation includes cloaking a network node of the network that transmitted the obtained plurality of network packets. | 0.892597 |
7,966,554 | 2 | 35 | 2. The apparatus of claim 1 wherein said text is a transcript of said audio security disclosure data. | 2. The apparatus of claim 1 wherein said text is a transcript of said audio security disclosure data. 35. The apparatus of claim 2 wherein the insertion of said second marker in the text is based on letters. | 0.965664 |
8,181,163 | 1 | 8 | 1. At a computer system, a method for synthesizing one or more code fragments in a software routine using one or more known inputs and corresponding expected outputs for portions of the software routine, the method comprising: an act of providing a software routine with one or more known inputs and corresponding one or more expected outputs for the software routine; an act of inferring software routine instructions based on the known inputs and corresponding expected outputs; and an act of synthesizing a correctly functioning code fragment based on the inferred instructions for use in the software routine. | 1. At a computer system, a method for synthesizing one or more code fragments in a software routine using one or more known inputs and corresponding expected outputs for portions of the software routine, the method comprising: an act of providing a software routine with one or more known inputs and corresponding one or more expected outputs for the software routine; an act of inferring software routine instructions based on the known inputs and corresponding expected outputs; and an act of synthesizing a correctly functioning code fragment based on the inferred instructions for use in the software routine. 8. The method of claim 1 , wherein the known inputs and corresponding expected outputs comprise source code modules and/or source code functions. | 0.858398 |
8,543,577 | 13 | 14 | 13. The one or more machine-readable of claim 12 , wherein the operations further comprise: applying a supervised labeling model to identify a label for the cross-channel cluster. | 13. The one or more machine-readable of claim 12 , wherein the operations further comprise: applying a supervised labeling model to identify a label for the cross-channel cluster. 14. The one or more machine-readable of claim 13 , wherein the operations further comprise: receiving, by the one or more computer systems, a request for information; and applying the supervised labeling model to the request for information to determine a label for the request. | 0.8888 |
10,019,990 | 5 | 6 | 5. The method of claim 1 , wherein the environment variable is based on a noise of an environment. | 5. The method of claim 1 , wherein the environment variable is based on a noise of an environment. 6. The method of claim 5 , wherein the environment variable is a signal-to-noise ratio. | 0.96687 |
8,612,882 | 13 | 14 | 13. The computer readable medium of claim 12 , wherein the refining step executed a collection refinement tools comprising at least one of: a suggestion widget; an item replacement selector; or a linked-view browsing module. | 13. The computer readable medium of claim 12 , wherein the refining step executed a collection refinement tools comprising at least one of: a suggestion widget; an item replacement selector; or a linked-view browsing module. 14. The computer readable medium of claim 13 that, when executed by a computing system, causes the computing system to further perform suggesting additional items based on metadata of suggested collection items. | 0.910517 |
7,805,390 | 1 | 4 | 1. A computer implemented method for inferring a probability of a first inference relating to an accident, the computer implemented method comprising: receiving a query at a database, on a data processing system, regarding a fact relating to the accident, wherein the first inference is absent from the database, wherein the database comprises a plurality of divergent data, wherein the plurality of divergent data includes a plurality of cohort data, wherein each datum of the database is conformed to the dimensions of the database, wherein each datum of the plurality of data has associated metadata and an associated key, wherein the associated metadata comprises data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum; establishing the fact as a frame of reference for the query, by a processing unit of the data processing system, wherein the frame of reference is used to determine data to be searched and rules to apply to the query, wherein the fact becomes a compound fact that includes multiple sub-facts on a subsequent iteration of the recursion process; mathematically refocusing the database such that the fact is modeled as a first center of an inverted star schema, and modeling each datum of the plurality of data in the inverted star schema around the fact; applying a first set of rules to the query, by the processing unit, wherein the first set of rules are determined for the query according to a second set of rules, wherein the first set of rules determine how the plurality of data are to be compared to the fact, wherein the first set of rules is prioritized, and wherein the first set of rules determine a first search space of the inverted star schema for the query including the associated metadata and associated key, wherein the second set of rules is a rule set used in a previous iteration of a recursive executing the query, by the processing unit, to create the probability of the first inference, wherein the probability of the first inference is determined from comparing the first search space according to the first set of rules; storing the probability of the first inference by the processing unit in a memory element of the data processing system; establishing the first inference as a second frame of reference, using the first set of rules to determine a third set of rules, wherein the third set of rules is a rule set used in a subsequent iteration of the recursive process; mathematically refocusing the database such that the first inference is modeled as a second center of the inverted star schema, and modeling each datum of the plurality of data in the inverted star schema around the first inference; and applying the third set of rules to create the probability of a second inference, wherein the third set of rules determines a second search space of the inverted star schema for the query including the associated metadata and associated key, wherein the probability of the second inference is determined from comparing the second search space according to the third set of rules; wherein the accident is selected from the group consisting of an airplane accident, a train accident, a maritime accident, a multi-vehicle accident, a single vehicle accident, a nuclear meltdown, a black-out, a building collapse, a failure of a bridge, a failure of a dam, a toxic spill, an explosion, and combinations thereof. | 1. A computer implemented method for inferring a probability of a first inference relating to an accident, the computer implemented method comprising: receiving a query at a database, on a data processing system, regarding a fact relating to the accident, wherein the first inference is absent from the database, wherein the database comprises a plurality of divergent data, wherein the plurality of divergent data includes a plurality of cohort data, wherein each datum of the database is conformed to the dimensions of the database, wherein each datum of the plurality of data has associated metadata and an associated key, wherein the associated metadata comprises data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum; establishing the fact as a frame of reference for the query, by a processing unit of the data processing system, wherein the frame of reference is used to determine data to be searched and rules to apply to the query, wherein the fact becomes a compound fact that includes multiple sub-facts on a subsequent iteration of the recursion process; mathematically refocusing the database such that the fact is modeled as a first center of an inverted star schema, and modeling each datum of the plurality of data in the inverted star schema around the fact; applying a first set of rules to the query, by the processing unit, wherein the first set of rules are determined for the query according to a second set of rules, wherein the first set of rules determine how the plurality of data are to be compared to the fact, wherein the first set of rules is prioritized, and wherein the first set of rules determine a first search space of the inverted star schema for the query including the associated metadata and associated key, wherein the second set of rules is a rule set used in a previous iteration of a recursive executing the query, by the processing unit, to create the probability of the first inference, wherein the probability of the first inference is determined from comparing the first search space according to the first set of rules; storing the probability of the first inference by the processing unit in a memory element of the data processing system; establishing the first inference as a second frame of reference, using the first set of rules to determine a third set of rules, wherein the third set of rules is a rule set used in a subsequent iteration of the recursive process; mathematically refocusing the database such that the first inference is modeled as a second center of the inverted star schema, and modeling each datum of the plurality of data in the inverted star schema around the first inference; and applying the third set of rules to create the probability of a second inference, wherein the third set of rules determines a second search space of the inverted star schema for the query including the associated metadata and associated key, wherein the probability of the second inference is determined from comparing the second search space according to the third set of rules; wherein the accident is selected from the group consisting of an airplane accident, a train accident, a maritime accident, a multi-vehicle accident, a single vehicle accident, a nuclear meltdown, a black-out, a building collapse, a failure of a bridge, a failure of a dam, a toxic spill, an explosion, and combinations thereof. 4. The computer implemented method of claim 1 wherein the method repeats until a threshold is reached, wherein the threshold is one of a number of recursions and a probability of inference. | 0.922414 |
9,374,284 | 1 | 7 | 1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score. | 1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score. 7. The method according to claim 1 , wherein the step of compiling and outputting a report includes reporting statistics of the Web page. | 0.637566 |
9,965,472 | 8 | 10 | 8. A question/answer creation system, comprising: a memory device; and a processor connected to the memory device, wherein the processor is configured to: import a document created by a content creator, the document having a set of questions based on content in the document, wherein the document is a single file; scan the content of the document and metadata in the document; automatically create a candidate question not entered by the content creator, creating the candidate question from the content in the document and the metadata of the document, wherein the metadata is not visible when the document is opened by a content user; automatically generate answers for the set of questions and the candidate question using the content in the document; present the set of questions, the candidate question, and the answers to a content creator for user verification of accuracy; and store a verified set of questions in the metadata of the document, wherein the verified set of questions comprises at least one verified question from the set of questions and the candidate question. | 8. A question/answer creation system, comprising: a memory device; and a processor connected to the memory device, wherein the processor is configured to: import a document created by a content creator, the document having a set of questions based on content in the document, wherein the document is a single file; scan the content of the document and metadata in the document; automatically create a candidate question not entered by the content creator, creating the candidate question from the content in the document and the metadata of the document, wherein the metadata is not visible when the document is opened by a content user; automatically generate answers for the set of questions and the candidate question using the content in the document; present the set of questions, the candidate question, and the answers to a content creator for user verification of accuracy; and store a verified set of questions in the metadata of the document, wherein the verified set of questions comprises at least one verified question from the set of questions and the candidate question. 10. The system of claim 8 , wherein importing the document further comprises: scanning viewable content of the document and metadata in the document to obtain the set of questions; and categorizing the set of questions based on the content of the document. | 0.809807 |
8,529,263 | 1 | 3 | 1. A method of constructing at least a part of a fiber-based garment by a user, comprising: providing a non-transitory computer readable medium having stored thereon computer-executable instructions; providing a display screen device; receiving electronic instructional content from a plurality of instructional manuals, the instructional content comprising a plurality of instructional parts; selecting a plurality of instructional parts to enable construction of at least part of a fiber-based garment; editing one or more of the plurality of instructional parts to create at least one edited instructional part; assembling the at least one edited instructional part with the plurality of instructional parts to create an integrated assembly instruction set; presenting the integrated assembly instruction set to the user by at least one of a user interface, a display screen device, a printed document and electronic voice instructions; tracking the progress of the user with respect to the integrated assembly instruction set; presenting at least one set of companion instructions to the user to execute, the companion instructions presented based upon user progress with respect to at least one of: i) a row of instructions, and ii) the plurality of instruction parts; and constructing at least a part of a fiber-based garment by the user. | 1. A method of constructing at least a part of a fiber-based garment by a user, comprising: providing a non-transitory computer readable medium having stored thereon computer-executable instructions; providing a display screen device; receiving electronic instructional content from a plurality of instructional manuals, the instructional content comprising a plurality of instructional parts; selecting a plurality of instructional parts to enable construction of at least part of a fiber-based garment; editing one or more of the plurality of instructional parts to create at least one edited instructional part; assembling the at least one edited instructional part with the plurality of instructional parts to create an integrated assembly instruction set; presenting the integrated assembly instruction set to the user by at least one of a user interface, a display screen device, a printed document and electronic voice instructions; tracking the progress of the user with respect to the integrated assembly instruction set; presenting at least one set of companion instructions to the user to execute, the companion instructions presented based upon user progress with respect to at least one of: i) a row of instructions, and ii) the plurality of instruction parts; and constructing at least a part of a fiber-based garment by the user. 3. The method of claim 1 , wherein the method further includes receiving user content wherein user content is combined with the integrated assembly instruction set. | 0.787013 |
9,363,634 | 1 | 3 | 1. A computer-implemented method comprising: receiving a user context of a user, wherein the user context specifies a location of a user device being used by the user; obtaining user activity data organized into sessions, each session being data representing a plurality of user activities performed by a distinct user during a respective time period, the sessions including sessions for multiple users; obtaining matching sessions for the received user context, each matching session being a distinct session that includes data representing activities performed by respective users having a user context matching the received user context during a time period represented by the matching session; obtaining general sessions, each general session including data representing activities performed by respective users during a time period represented by the general session; determining, from the obtained matching sessions and the obtained general sessions, one or more context-relevant activities that occur in the matching sessions more frequently than the one or more context-relevant activities occur in the general sessions, the one or more context-relevant activities being activities performed by users matching the received user context more frequently than by users in general; and providing information related to the one or more context-relevant activities in response to receiving the user context. | 1. A computer-implemented method comprising: receiving a user context of a user, wherein the user context specifies a location of a user device being used by the user; obtaining user activity data organized into sessions, each session being data representing a plurality of user activities performed by a distinct user during a respective time period, the sessions including sessions for multiple users; obtaining matching sessions for the received user context, each matching session being a distinct session that includes data representing activities performed by respective users having a user context matching the received user context during a time period represented by the matching session; obtaining general sessions, each general session including data representing activities performed by respective users during a time period represented by the general session; determining, from the obtained matching sessions and the obtained general sessions, one or more context-relevant activities that occur in the matching sessions more frequently than the one or more context-relevant activities occur in the general sessions, the one or more context-relevant activities being activities performed by users matching the received user context more frequently than by users in general; and providing information related to the one or more context-relevant activities in response to receiving the user context. 3. The method of claim 1 , wherein the context-relevant activities comprise users making a restaurant reservation at a particular restaurant, and wherein providing information related to the one or more context-relevant activities comprises providing information about the particular restaurant. | 0.779192 |
7,761,298 | 2 | 7 | 2. The method of claim 1 , wherein the documents relate to a first document based at least on a frame of time. | 2. The method of claim 1 , wherein the documents relate to a first document based at least on a frame of time. 7. The method of claim 2 , the method further comprising running an automatic transcription of the first document as a query on the collection of documents to retrieve related documents from the documents. | 0.887978 |
8,832,117 | 1 | 2 | 1. A processor-implemented method for disseminating content associated with a plurality of linked subject items in a knowledge base wherein individual subject items are associated with corresponding user-specific understanding values, the method comprising: ranking at least one of a plurality of candidate subject items for presentation to at least one user based on priority values associated with the candidate subject items, wherein the candidacies are determined and the priority values are computed based, at least in part, on: the user-specific understanding values corresponding to the at least one of a plurality of candidate subject items, the user-specific understanding values of at least one of a plurality of basic subject items linked to the at least one candidate subject item, and the user-specific understanding values of at least one of plurality of advanced subject items linked to the at least one candidate subject item. | 1. A processor-implemented method for disseminating content associated with a plurality of linked subject items in a knowledge base wherein individual subject items are associated with corresponding user-specific understanding values, the method comprising: ranking at least one of a plurality of candidate subject items for presentation to at least one user based on priority values associated with the candidate subject items, wherein the candidacies are determined and the priority values are computed based, at least in part, on: the user-specific understanding values corresponding to the at least one of a plurality of candidate subject items, the user-specific understanding values of at least one of a plurality of basic subject items linked to the at least one candidate subject item, and the user-specific understanding values of at least one of plurality of advanced subject items linked to the at least one candidate subject item. 2. The processor-implemented method of claim 1 , further comprising displaying content associated with the at least one of the plurality of candidate subject items in order of rank. | 0.821499 |
8,016,680 | 13 | 15 | 13. An educational multiplayer game from a server communicated through a learner connection to a learner's control module comprising: a. a multiplicity of characters arranged to be controlled by the players; b. a multiplicity of character possessions; c. a multiplicity of activities arranged for character participation using character possessions; d. a means for scoring activity success; e. selected activities arranged to require a possession for activity success; f. selected activities arranged for a character to obtain monetary units; g. a character object exchange arranged such that a character exchanges monetary units for possessions such that a virtual economy exists; h. one or more target education skills; i. the activities arranged in a first group including a target education skill practice and a second group without the target education skill; j. the first group activities arranged such that a skill mastery score is dependant on the errors in the target education skill; k. the first group activities further arranged to provide a variable performance attribute possession required for success in second group activities; and l. the second group activity score is dependant on the errors in the target education skill practice in the first group activity. | 13. An educational multiplayer game from a server communicated through a learner connection to a learner's control module comprising: a. a multiplicity of characters arranged to be controlled by the players; b. a multiplicity of character possessions; c. a multiplicity of activities arranged for character participation using character possessions; d. a means for scoring activity success; e. selected activities arranged to require a possession for activity success; f. selected activities arranged for a character to obtain monetary units; g. a character object exchange arranged such that a character exchanges monetary units for possessions such that a virtual economy exists; h. one or more target education skills; i. the activities arranged in a first group including a target education skill practice and a second group without the target education skill; j. the first group activities arranged such that a skill mastery score is dependant on the errors in the target education skill; k. the first group activities further arranged to provide a variable performance attribute possession required for success in second group activities; and l. the second group activity score is dependant on the errors in the target education skill practice in the first group activity. 15. The game of claim 13 further comprising one or more first group activities arranged to provide a possession with a variable appearance, the appearance arranged to improve with fewer errors in target education skill practice. | 0.915556 |
8,666,951 | 4 | 5 | 4. The method of claim 1 , further comprising: the computer recursively creating a merged topic map in a scope, the merged topic map including a topic map based index and instance ontology for each additional version of the enterprise meta-models; and the computer storing the merged topic map into a repository. | 4. The method of claim 1 , further comprising: the computer recursively creating a merged topic map in a scope, the merged topic map including a topic map based index and instance ontology for each additional version of the enterprise meta-models; and the computer storing the merged topic map into a repository. 5. The method of claim 4 , wherein the scope of the merged topic map is a scope newer than a scope of a previous version of the merged topic map. | 0.968817 |
8,850,384 | 1 | 9 | 1. A method comprising: receiving a user request for an action concerning a service candidate associated with a service-oriented architecture (SOA) service model, wherein the SOA service model specifies a plurality of service-oriented candidates and defines relationships between the plurality of service-oriented candidates, wherein each of the plurality of service-oriented candidates comprises at least one of a service candidate, a composition candidate comprising an aggregate of service candidates, or an operation candidate; tracking the relationships between the plurality of service-oriented candidates; determining a provider count indicating a number of times a service-oriented candidate is reused by other composition candidates in view of the tracked relationships; displaying a user interface corresponding to the requested action and the provider count; receiving user input for the service candidate via the user interface; and updating, by a processing device, the SOA service model in view of the user input for the service candidate and the requested action. | 1. A method comprising: receiving a user request for an action concerning a service candidate associated with a service-oriented architecture (SOA) service model, wherein the SOA service model specifies a plurality of service-oriented candidates and defines relationships between the plurality of service-oriented candidates, wherein each of the plurality of service-oriented candidates comprises at least one of a service candidate, a composition candidate comprising an aggregate of service candidates, or an operation candidate; tracking the relationships between the plurality of service-oriented candidates; determining a provider count indicating a number of times a service-oriented candidate is reused by other composition candidates in view of the tracked relationships; displaying a user interface corresponding to the requested action and the provider count; receiving user input for the service candidate via the user interface; and updating, by a processing device, the SOA service model in view of the user input for the service candidate and the requested action. 9. The method of claim 1 , further comprising: receiving a selection of an annotate function via the user interface; initiating a word processor to receive annotations for the service candidate from the user; and associating the annotations with the service candidate in the SOA service model. | 0.74654 |
9,563,624 | 8 | 9 | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in operations comprising: gathering statistics from a plurality of interactions with a user, wherein the statistics are gathered periodically with a defined frequency, and wherein the statistics identify words in the plurality of interactions and languages associated with the words; identifying, based on the statistics, a target language of the user, the target language being the language having a highest number of words used in the plurality of interactions; receiving a message for the user in a source language which is distinct from the target language; prior to presenting the message to the user, translating the message into the target language, to yield a translated message; and presenting the translated message in the target language to the user. | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in operations comprising: gathering statistics from a plurality of interactions with a user, wherein the statistics are gathered periodically with a defined frequency, and wherein the statistics identify words in the plurality of interactions and languages associated with the words; identifying, based on the statistics, a target language of the user, the target language being the language having a highest number of words used in the plurality of interactions; receiving a message for the user in a source language which is distinct from the target language; prior to presenting the message to the user, translating the message into the target language, to yield a translated message; and presenting the translated message in the target language to the user. 9. The system of claim 8 , the computer-readable storage medium having additional instructions stored which, when executed by the processor, result in operations comprising: analyzing words in the statistics to determine a subject matter of interest to the user; and determining whether to translate the message based on the subject matter of interest. | 0.501416 |
10,013,504 | 14 | 15 | 14. A computer program product for search with autosuggest, the computer program product being embodied in a tangible non-transitory computer readable storage medium and comprising computer instructions for: determining a plurality of potential query suggestions for a partially entered query string; merging a plurality of categories associated with a merchant web site into a merged category, comprising: determining a first weight for a first category based on a first query count associated with the first category; determining a second weight for a second category based on a second query count associated with the second category, the plurality of categories including the first category and the second category; and merging the first category and the second category into a single merged category, the single merged category being associated with the merged category, wherein the merging of the first category and the second category comprises: aggregating the first weight and the second weight to obtain a merged weight, the merged weight being associated with the merged category; and automatically suggesting a plurality of queries based on a query count for each of the queries, wherein at least one of the automatically suggested plurality of queries corresponds to the merged category. | 14. A computer program product for search with autosuggest, the computer program product being embodied in a tangible non-transitory computer readable storage medium and comprising computer instructions for: determining a plurality of potential query suggestions for a partially entered query string; merging a plurality of categories associated with a merchant web site into a merged category, comprising: determining a first weight for a first category based on a first query count associated with the first category; determining a second weight for a second category based on a second query count associated with the second category, the plurality of categories including the first category and the second category; and merging the first category and the second category into a single merged category, the single merged category being associated with the merged category, wherein the merging of the first category and the second category comprises: aggregating the first weight and the second weight to obtain a merged weight, the merged weight being associated with the merged category; and automatically suggesting a plurality of queries based on a query count for each of the queries, wherein at least one of the automatically suggested plurality of queries corresponds to the merged category. 15. The computer program product recited in claim 14 , wherein the query count corresponds to a popularity of the query. | 0.736842 |
10,121,211 | 1 | 17 | 1. A method for identifying waste in a process, comprising: receiving, by at least one computer, an image of one or more discarded products from a camera: performing, by the at least one computer, an object recognition process on the received image to identify the one or more discarded products within the image; acquiring, by the at least one computer, metadata relating to the one or more identified discarded products from the received image; recording, by the at least one computer, the metadata; analyzing, by the at least one computer, the metadata with a rules engine; determining, by the at least one computer, an overage amount of product as a function of the acquired metadata; deriving, by the at least one computer, a suggestion for waste reduction based on the determination; and generating, by the at least one computer, a report based on the recorded metadata, wherein the report includes the suggestion for waste reduction. | 1. A method for identifying waste in a process, comprising: receiving, by at least one computer, an image of one or more discarded products from a camera: performing, by the at least one computer, an object recognition process on the received image to identify the one or more discarded products within the image; acquiring, by the at least one computer, metadata relating to the one or more identified discarded products from the received image; recording, by the at least one computer, the metadata; analyzing, by the at least one computer, the metadata with a rules engine; determining, by the at least one computer, an overage amount of product as a function of the acquired metadata; deriving, by the at least one computer, a suggestion for waste reduction based on the determination; and generating, by the at least one computer, a report based on the recorded metadata, wherein the report includes the suggestion for waste reduction. 17. The method of claim 1 , wherein the generating, by the at least one computer, the report further includes generating a process change suggestion. | 0.865766 |
7,852,499 | 12 | 13 | 12. The method as set forth in claim 11 , further comprising: conditional upon the identifying initially not identifying any caption signatures, repeating the assigning and identifying wherein the repeated assigning employs a different text fragment representation. | 12. The method as set forth in claim 11 , further comprising: conditional upon the identifying initially not identifying any caption signatures, repeating the assigning and identifying wherein the repeated assigning employs a different text fragment representation. 13. The method as set forth in claim 12 , wherein the different text fragment representation comprises the initial text fragment representation with at least one additional text fragment attribute. | 0.920243 |
8,065,246 | 18 | 19 | 18. A storage medium storing instructions defining a function for optimizing a sum-of-exponentials function including a summation of exponentials of the form ∑ k = 1 K ⅇ β k T x by optimization operations comprising: upper bounding the sum of exponentials ∑ k = 1 K ⅇ β k T x by a product of sigmoids; upper bounding terms of the form log(1+e x ) in the product of sigmoids to generate a double majorization upper bound; minimizing the double majorization upper bound respective to the parameters β to generate optimized parameters β; and outputting the optimized sum-of-exponentials function represented at least by the optimized parameters β. | 18. A storage medium storing instructions defining a function for optimizing a sum-of-exponentials function including a summation of exponentials of the form ∑ k = 1 K ⅇ β k T x by optimization operations comprising: upper bounding the sum of exponentials ∑ k = 1 K ⅇ β k T x by a product of sigmoids; upper bounding terms of the form log(1+e x ) in the product of sigmoids to generate a double majorization upper bound; minimizing the double majorization upper bound respective to the parameters β to generate optimized parameters β; and outputting the optimized sum-of-exponentials function represented at least by the optimized parameters β. 19. The storage medium as set forth in claim 18 , wherein the optimization function is configured to optimize a softmax function of the form ⅇ β k T x ∑ k ′ = 1 K ⅇ β k ′ T x . | 0.866959 |
6,115,024 | 2 | 15 | 2. An image display device according to claim 1, wherein said image display means provisionally setting, in said image display mode of said display means, one of said fixed formats being presented in said text display mode to said designated format if said designated format has not been set, and displaying an image representative of part or whole of said object image data created by using said dummy data for said text data to be input to said predetermined entry items of said one of said fixed formats provisionally set to said designated format. | 2. An image display device according to claim 1, wherein said image display means provisionally setting, in said image display mode of said display means, one of said fixed formats being presented in said text display mode to said designated format if said designated format has not been set, and displaying an image representative of part or whole of said object image data created by using said dummy data for said text data to be input to said predetermined entry items of said one of said fixed formats provisionally set to said designated format. 15. An image display device according to claim 2, wherein said object image data is stamp image data for forming a stamp face of a stamp. | 0.960105 |
7,668,806 | 22 | 53 | 22. The method of claim 1 , wherein the first server comprises an XQueryX-enabled database. | 22. The method of claim 1 , wherein the first server comprises an XQueryX-enabled database. 53. A machine-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 22 . | 0.971495 |
8,370,156 | 25 | 26 | 25. One or more non-transitory computer-readable storage media storing computer-executable instructions that when executed on a computer partition a model, the media storing one or more instructions for: accessing a model implemented in a modeling environment, the accessing performed using the computer; automatically determining, using the computer, a partition of the model, the partition for use in partitioning the model into a first sub-model for a first deployment type and a second sub-model for a second deployment type, the partition satisfying a performance goal or a resource constraint on the overall model; displaying, on a display device, the partition within the model; and partitioning, using the computer, the model into the first and second sub-models based on the partition. | 25. One or more non-transitory computer-readable storage media storing computer-executable instructions that when executed on a computer partition a model, the media storing one or more instructions for: accessing a model implemented in a modeling environment, the accessing performed using the computer; automatically determining, using the computer, a partition of the model, the partition for use in partitioning the model into a first sub-model for a first deployment type and a second sub-model for a second deployment type, the partition satisfying a performance goal or a resource constraint on the overall model; displaying, on a display device, the partition within the model; and partitioning, using the computer, the model into the first and second sub-models based on the partition. 26. The computer-readable storage media of claim 25 , wherein the first sub-model is deployed on a software target and the second sub-model is deployed on a programmable hardware target. | 0.875668 |
8,527,534 | 1 | 3 | 1. A computer-implemented information retrieval system comprising: a query component configured to receive and process a query to retrieve a document having different language styles as data streams, the data streams including at least a first stream for a first portion of the document and a second stream for a second portion of the document, wherein the second stream is different from the first stream and the second portion is different from the first portion; a model component configured to create multiple language models for the data streams of the document, the multiple language models characterizing the data streams for document ranking, the multiple language models comprising at least a first language model for the first portion of the document and a second language model for the second portion of the document, wherein the second language model is different from the first language model; an estimation component configured to estimate mixture weights for the multiple language models; a smoothing component configured to apply smoothing to the multiple language models to generate similar cardinality among the multiple language models for linearly combining scores output by the multiple language models; and a processor configured to execute the query component, the model component, the estimation component, and the smoothing component. | 1. A computer-implemented information retrieval system comprising: a query component configured to receive and process a query to retrieve a document having different language styles as data streams, the data streams including at least a first stream for a first portion of the document and a second stream for a second portion of the document, wherein the second stream is different from the first stream and the second portion is different from the first portion; a model component configured to create multiple language models for the data streams of the document, the multiple language models characterizing the data streams for document ranking, the multiple language models comprising at least a first language model for the first portion of the document and a second language model for the second portion of the document, wherein the second language model is different from the first language model; an estimation component configured to estimate mixture weights for the multiple language models; a smoothing component configured to apply smoothing to the multiple language models to generate similar cardinality among the multiple language models for linearly combining scores output by the multiple language models; and a processor configured to execute the query component, the model component, the estimation component, and the smoothing component. 3. The system of claim 1 , wherein the data streams include multi-media streams for corresponding language styles of the document and a query stream. | 0.854776 |
9,665,543 | 1 | 9 | 1. A method for supporting links within a document containing text, the method comprising: identifying representations embedded within a word processor document of links to sources external to the word processor document, the word processor document produced using a word processor program running on a computing system and configured to create, edit and display both text and hyperlinks within the word processor document; appending the word processor document to include initial content representations comprising all content of each external source; identifying a current validity status automatically for each identified link representation during creation of the word processor document, at an initial time of publication of the word processing document and at a later time after initial publication, the validity status comprising accuracy of the link representation, functionality of the link representation, accessibility of the external sources and content of the external sources; expressing the identified current validity status of one or more of the identified link representations using aspects of the document other than the identified link representations; and providing notification to an author and readers of the word processor document of the current validity status. | 1. A method for supporting links within a document containing text, the method comprising: identifying representations embedded within a word processor document of links to sources external to the word processor document, the word processor document produced using a word processor program running on a computing system and configured to create, edit and display both text and hyperlinks within the word processor document; appending the word processor document to include initial content representations comprising all content of each external source; identifying a current validity status automatically for each identified link representation during creation of the word processor document, at an initial time of publication of the word processing document and at a later time after initial publication, the validity status comprising accuracy of the link representation, functionality of the link representation, accessibility of the external sources and content of the external sources; expressing the identified current validity status of one or more of the identified link representations using aspects of the document other than the identified link representations; and providing notification to an author and readers of the word processor document of the current validity status. 9. The method of claim 1 , wherein the step of identifying the current validity status further comprises: obtaining a present content representation of each external source; comparing the current content representations to the initial content representations; and identifying any inconsistencies between the two representations. | 0.807963 |
8,589,872 | 1 | 2 | 1. A method of identifying a variable type during coding of a software program written in a programming language, said method implemented by use of a processor of a data processing system, said method comprising: said processor receiving a first typed line of a software program from a programmer, said first typed line including a variable name of a variable and a first variable type string adjacent to the variable name, said first variable type string identifying a first variable type of the variable; said processor displaying the first typed line in a window; said processor generating a first declaration statement for the software program, said generating the first declaration statement determining the first variable type from the first variable type string, said first declaration statement including a first standard character string of the programming language that specifies the first variable type of the variable, said first standard character string differing from the first variable type string; said processor inserting the first declaration statement in a reserved variable declaration area of the window, said reserved variable declaration area being displayed in the window and configured to record declaration statements of the software program; and said processor displaying a first modified line in the window, said first modified line replacing the first typed line in the window, said first modified line consisting of a portion of the first typed line that does not include the first variable type string. | 1. A method of identifying a variable type during coding of a software program written in a programming language, said method implemented by use of a processor of a data processing system, said method comprising: said processor receiving a first typed line of a software program from a programmer, said first typed line including a variable name of a variable and a first variable type string adjacent to the variable name, said first variable type string identifying a first variable type of the variable; said processor displaying the first typed line in a window; said processor generating a first declaration statement for the software program, said generating the first declaration statement determining the first variable type from the first variable type string, said first declaration statement including a first standard character string of the programming language that specifies the first variable type of the variable, said first standard character string differing from the first variable type string; said processor inserting the first declaration statement in a reserved variable declaration area of the window, said reserved variable declaration area being displayed in the window and configured to record declaration statements of the software program; and said processor displaying a first modified line in the window, said first modified line replacing the first typed line in the window, said first modified line consisting of a portion of the first typed line that does not include the first variable type string. 2. The method of claim 1 , said method further comprising; after said displaying the first modified line, said processor receiving a second typed line of the software program from the programmer, said second typed line including the variable name of the variable and a second variable type string adjacent to the variable name, said second variable type string identifying a second variable type of the variable, said second variable type differing from the first variable type, said second variable type string differing from the first variable type string; said processor displaying the second typed line in the window; said processor generating a second declaration statement for the software program, said generating the second declaration statement determining the second variable type from the second variable type string, said second declaration statement including a second standard character string of the programming language that specifies the second variable type of the variable, said second standard character string differing from the second variable type string; said processor inserting the second declaration statement in the reserved variable declaration area of the window; and said processor displaying a second modified line in the window, said second modified line replacing the second typed line in the window, said second modified line consisting of a portion of the second typed line that does not include the second variable type string. | 0.557437 |
10,073,840 | 1 | 2 | 1. A method of automatically generating natural language patterns based on a knowledge graph, the method comprising: selecting a relation from a knowledge graph; extracting at least a first pair of words from the knowledge graph, wherein the first pair of words is connected by the relation; receiving a set of documents as a search result based on a first query, wherein the first query comprises at least one instruction to select documents based on the first pair of words; extracting, from the set of documents, at least one textual snippet based on the first query, wherein the at least one textual snippet includes at least in part the first pair of words; extracting a second query from a query click log, wherein the query click log comprises at least one search query against at least a part of the set of documents and at least one link to at least one document, and wherein the second query is associated with at least one link to the at least one document containing the at least one textual snippet; generating a first set of training patterns, wherein the first set of training patterns is based on association between the at least one textual snippet and the relation; generating a second set of training patterns, wherein the second set of training patterns is based on association between the second query and the relation; generating a third set of natural language patterns for the knowledge graph, wherein generating the set of natural language patterns further comprises selectively combining the first set of training patterns and the second set of training patterns based on at least one weight between the first set of training patterns and the second set of training patterns; and applying the generated third set of natural language patterns to the knowledge graph to automatically train a natural language dialog system. | 1. A method of automatically generating natural language patterns based on a knowledge graph, the method comprising: selecting a relation from a knowledge graph; extracting at least a first pair of words from the knowledge graph, wherein the first pair of words is connected by the relation; receiving a set of documents as a search result based on a first query, wherein the first query comprises at least one instruction to select documents based on the first pair of words; extracting, from the set of documents, at least one textual snippet based on the first query, wherein the at least one textual snippet includes at least in part the first pair of words; extracting a second query from a query click log, wherein the query click log comprises at least one search query against at least a part of the set of documents and at least one link to at least one document, and wherein the second query is associated with at least one link to the at least one document containing the at least one textual snippet; generating a first set of training patterns, wherein the first set of training patterns is based on association between the at least one textual snippet and the relation; generating a second set of training patterns, wherein the second set of training patterns is based on association between the second query and the relation; generating a third set of natural language patterns for the knowledge graph, wherein generating the set of natural language patterns further comprises selectively combining the first set of training patterns and the second set of training patterns based on at least one weight between the first set of training patterns and the second set of training patterns; and applying the generated third set of natural language patterns to the knowledge graph to automatically train a natural language dialog system. 2. The method of claim 1 , further comprising training a relation detection model using the set of natural language patterns for the knowledge graph. | 0.866487 |
7,610,228 | 23 | 24 | 23. A computer-based method for use in managing a service level associated with resources in a distributed information technology (IT) system based on financial terms, the method comprising the steps of: automatically constructing and maintaining, via a processor of a computer, an electronic contract that contains information pertaining to descriptions of one or more business transactions in IT terms, financial implications of one or more business transaction service levels, and reporting to be performed in one or more financial terms; automatically measuring, via the processor of the computer, the operation of at least one distributed element of the IT system in terms of one or more business metrics based on the electronic contract and based at least in part on input received from at least one agent nodule located in the at least one distributed element; automatically determining, via the processor of the computer, at least one financial optimization based at least part on the measured one or more business metrics of the at least one distributed element of the IT system and based at least in part on the electronic contract, the financial optimization being specified in the electronic contract at the time of construction such that, at the time the financial optimization is to be determined, the electronic contract is accessed to identify a particular financial metric of the financial optimization that is to be computed and to identify an operation for computing the particular financial metric, the one or more business metrics are converted to one or more financial equivalents wherein the one or more financial equivalents comprise a cost of a lost connection, a cost of down time, and a relationship between revenue and network latency; and automatically issuing, via the processor of the computer, at least one control command based on the at least one financial optimization, the command to be executed on the at least one distributed element by the at least one agent module located in the at least one distributed element. | 23. A computer-based method for use in managing a service level associated with resources in a distributed information technology (IT) system based on financial terms, the method comprising the steps of: automatically constructing and maintaining, via a processor of a computer, an electronic contract that contains information pertaining to descriptions of one or more business transactions in IT terms, financial implications of one or more business transaction service levels, and reporting to be performed in one or more financial terms; automatically measuring, via the processor of the computer, the operation of at least one distributed element of the IT system in terms of one or more business metrics based on the electronic contract and based at least in part on input received from at least one agent nodule located in the at least one distributed element; automatically determining, via the processor of the computer, at least one financial optimization based at least part on the measured one or more business metrics of the at least one distributed element of the IT system and based at least in part on the electronic contract, the financial optimization being specified in the electronic contract at the time of construction such that, at the time the financial optimization is to be determined, the electronic contract is accessed to identify a particular financial metric of the financial optimization that is to be computed and to identify an operation for computing the particular financial metric, the one or more business metrics are converted to one or more financial equivalents wherein the one or more financial equivalents comprise a cost of a lost connection, a cost of down time, and a relationship between revenue and network latency; and automatically issuing, via the processor of the computer, at least one control command based on the at least one financial optimization, the command to be executed on the at least one distributed element by the at least one agent module located in the at least one distributed element. 24. The method of claim 23 , wherein the measuring step comprises monitoring one or more IT parameters and evaluating results in terms of the one or more business metrics. | 0.796912 |
8,438,310 | 15 | 28 | 15. A method of providing web services for a business hierarchy, comprising: providing a website capable of simultaneously operating in one of a plurality of operational modes, wherein each of the plurality of operational modes corresponds to a respective geographic granularity of the business hierarchy, the operational modes including a local mode comprising content pertaining to a particular location, a regional mode comprising content pertaining to a plurality of locations, and a national mode comprising information pertaining to a plurality of regions; detecting an incoming request for web content from a user using a configuration module operating on a processor; selecting an operational mode responsive to the request based upon a geographic granularity associated with the user; and configuring the website to present content to the user according to the selected operational mode. | 15. A method of providing web services for a business hierarchy, comprising: providing a website capable of simultaneously operating in one of a plurality of operational modes, wherein each of the plurality of operational modes corresponds to a respective geographic granularity of the business hierarchy, the operational modes including a local mode comprising content pertaining to a particular location, a regional mode comprising content pertaining to a plurality of locations, and a national mode comprising information pertaining to a plurality of regions; detecting an incoming request for web content from a user using a configuration module operating on a processor; selecting an operational mode responsive to the request based upon a geographic granularity associated with the user; and configuring the website to present content to the user according to the selected operational mode. 28. The method of claim 15 , further comprising managing search engine marketing at one or more search engines for the business hierarchy. | 0.821705 |
8,095,575 | 1 | 2 | 1. A computer-implemented word processing presentation method, comprising: obtaining an unformatted data structure containing a series of characters representing content for a word processing document; accessing a series of first records in a data structure associated with the unformatted data structure file, wherein each first record contains data correlating a location of one or more characters in the unformatted data structure to a location for the one or more characters in the word processing document; generating a display of the word processing document by applying the correlating data from the series of records to the series of characters in the unformatted data structure; receiving a command to delete particular characters from the word processing document, wherein the particular characters are included in the unformatted data structure; and in response to receiving the command to delete characters, generating a record in the series of records that indicates that the particular characters are deleted from the word processing document while leaving the particular characters in the unformatted data structure unchanged. | 1. A computer-implemented word processing presentation method, comprising: obtaining an unformatted data structure containing a series of characters representing content for a word processing document; accessing a series of first records in a data structure associated with the unformatted data structure file, wherein each first record contains data correlating a location of one or more characters in the unformatted data structure to a location for the one or more characters in the word processing document; generating a display of the word processing document by applying the correlating data from the series of records to the series of characters in the unformatted data structure; receiving a command to delete particular characters from the word processing document, wherein the particular characters are included in the unformatted data structure; and in response to receiving the command to delete characters, generating a record in the series of records that indicates that the particular characters are deleted from the word processing document while leaving the particular characters in the unformatted data structure unchanged. 2. The method of claim 1 , wherein the series of records comprises records defining character locations in the word processing document, character formats in the word processing document, paragraph locations in the word processing document, and paragraph formats in the word processing document. | 0.690776 |
7,853,551 | 1 | 22 | 1. A computer implemented method for process data management, wherein said method can be implemented on computers using the internet, intranet, wireless communication network or mobile devices, the method comprising: (a) displaying a set of natural language prompts related to a problem for each of a plurality of structured stages; (b) receiving input in response to the prompts; (c) using project stages as a reference system for interface design; and (d) supporting transaction and collaboration among a plurality of users. | 1. A computer implemented method for process data management, wherein said method can be implemented on computers using the internet, intranet, wireless communication network or mobile devices, the method comprising: (a) displaying a set of natural language prompts related to a problem for each of a plurality of structured stages; (b) receiving input in response to the prompts; (c) using project stages as a reference system for interface design; and (d) supporting transaction and collaboration among a plurality of users. 22. The method of claim 1 , wherein a user's path is recorded and stored and can be compared with other user paths. | 0.876078 |
9,454,965 | 1 | 4 | 1. A method performed by a computer processor executing computer program instructions tangibly stored on a first computer-readable medium to perform a method comprising: (A) deriving, from a region of a document and a corresponding region of a spoken audio stream, a likelihood score representing a likelihood that the region of the document correctly represents content in the corresponding region of the spoken audio stream, and tangibly storing a representation of the likelihood score in a second computer-readable medium; (B) selecting a relevance score representing a measure of relevance of the region of the spoken audio stream, the measure of relevance representing a measure of importance that the region of the spoken audio stream be brought to the attention of a human proofreader, and tangibly storing a representation of the relevance score in a third computer-readable medium; (C) deriving, by dividing the relevance score by the likelihood score, an emphasis factor for modifying an emphasis placed on the region of the spoken audio stream when played back, and storing a representation of the emphasis factor in a fourth computer-readable medium; and (D) modifying, in accordance with the emphasis factor, the emphasis placed on the region of the spoken audio stream by gradually increasing an emphasis factor applied to at least one word occurring before a first word in the region of the spoken audio stream, producing an emphasis-adjusted audio stream. | 1. A method performed by a computer processor executing computer program instructions tangibly stored on a first computer-readable medium to perform a method comprising: (A) deriving, from a region of a document and a corresponding region of a spoken audio stream, a likelihood score representing a likelihood that the region of the document correctly represents content in the corresponding region of the spoken audio stream, and tangibly storing a representation of the likelihood score in a second computer-readable medium; (B) selecting a relevance score representing a measure of relevance of the region of the spoken audio stream, the measure of relevance representing a measure of importance that the region of the spoken audio stream be brought to the attention of a human proofreader, and tangibly storing a representation of the relevance score in a third computer-readable medium; (C) deriving, by dividing the relevance score by the likelihood score, an emphasis factor for modifying an emphasis placed on the region of the spoken audio stream when played back, and storing a representation of the emphasis factor in a fourth computer-readable medium; and (D) modifying, in accordance with the emphasis factor, the emphasis placed on the region of the spoken audio stream by gradually increasing an emphasis factor applied to at least one word occurring before a first word in the region of the spoken audio stream, producing an emphasis-adjusted audio stream. 4. The method of claim 1 , further comprising: (E) playing the emphasis-adjusted audio stream. | 0.779343 |
9,472,207 | 3 | 6 | 3. The method of claim 2 , wherein the wearable device is worn by the second person having an autism spectrum disorder. | 3. The method of claim 2 , wherein the wearable device is worn by the second person having an autism spectrum disorder. 6. The method of claim 3 , wherein the outputting comprises an output on a display of the wearable device. | 0.958529 |
6,018,708 | 27 | 28 | 27. A method as defined in claim 17, comprising the step of providing a plurality of standard text lexicons. | 27. A method as defined in claim 17, comprising the step of providing a plurality of standard text lexicons. 28. A method as defined in claim 27, comprising the step of selecting one of said plurality of standard text lexicons for use as a source in the step of inserting at least one orthography from the selected one of said plurality of standard text lexicons into said list. | 0.874534 |
9,886,428 | 5 | 6 | 5. The method of claim 1 further comprising: establishing one or more authority delegation type parameters, wherein the authority delegation type parameters identify modes by which to delegate authority to digitally sign the collaborative email document; assigning at least one authority delegation type parameter to the collaborative email document; and delegating, from at least one signatory to another signatory in accordance with the assigned at least one authority delegation type parameter, the authority to digitally sign the collaborative email document. | 5. The method of claim 1 further comprising: establishing one or more authority delegation type parameters, wherein the authority delegation type parameters identify modes by which to delegate authority to digitally sign the collaborative email document; assigning at least one authority delegation type parameter to the collaborative email document; and delegating, from at least one signatory to another signatory in accordance with the assigned at least one authority delegation type parameter, the authority to digitally sign the collaborative email document. 6. The method of claim 5 , wherein the modes by which to delegate authority to digitally sign the collaborative email document comprise: a mode in which the authority to digitally sign the collaborative email document is delegated according to authority delegation policies; a mode in which the authority to digitally sign the collaborative email document is delegated by an originator of the collaborative email document; and a mode in which one or more of the collaborators are authorized to delegate the authority to digitally sign the collaborative email document to at least one signatory. | 0.813676 |
9,208,439 | 13 | 18 | 13. A computing system comprising: one or more processors, a non-transitory computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving, from a mobile device, event data derived from contextual data collected using detectors that detect a physical context surrounding the mobile device; modifying a context graph that stores facts and assertions about a user's behavior and interests using the event data; in response to determining that there exists a registration for notification of changes that matches the modification to the context graph, sending a notification of context graph change to a recommender. | 13. A computing system comprising: one or more processors, a non-transitory computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving, from a mobile device, event data derived from contextual data collected using detectors that detect a physical context surrounding the mobile device; modifying a context graph that stores facts and assertions about a user's behavior and interests using the event data; in response to determining that there exists a registration for notification of changes that matches the modification to the context graph, sending a notification of context graph change to a recommender. 18. The computer-readable storage medium of claim 13 , wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising: receiving bulk upload of event data through an event posting interface; and modifying the context graph based on the received bulk upload event data. | 0.678571 |
8,151,292 | 34 | 35 | 34. The system of claim 1 , comprising a third module coupled to the second module, the third module receiving comments from the plurality of viewers in response to the viewing. | 34. The system of claim 1 , comprising a third module coupled to the second module, the third module receiving comments from the plurality of viewers in response to the viewing. 35. The system of claim 34 , wherein the comments are textual comments. | 0.966604 |
8,838,433 | 1 | 3 | 1. A computer-implemented selection system, comprising: linguistic data corpora that include an in-domain corpus and an out-domain corpus for domain adaptation for machine translation model training, the in-domain corpus and the out-domain corpus including multi-lingual data translated to the corpora in parallel; a relevance component that selects relevant multi-lingual data from the out-domain corpus based on a similarity measure, the similarity measure considering a difference of cross-entropy scores according to an in-domain language model and an out-domain language model, the relevant multi-lingual data utilized in combination with the in-domain corpus or in isolation without the in-domain corpus; and a processor that executes computer-executable instructions associated with at least the relevance component. | 1. A computer-implemented selection system, comprising: linguistic data corpora that include an in-domain corpus and an out-domain corpus for domain adaptation for machine translation model training, the in-domain corpus and the out-domain corpus including multi-lingual data translated to the corpora in parallel; a relevance component that selects relevant multi-lingual data from the out-domain corpus based on a similarity measure, the similarity measure considering a difference of cross-entropy scores according to an in-domain language model and an out-domain language model, the relevant multi-lingual data utilized in combination with the in-domain corpus or in isolation without the in-domain corpus; and a processor that executes computer-executable instructions associated with at least the relevance component. 3. The system of claim 1 , wherein the relevant multi-lingual data is selected based on the similarity measure that combines cross-entropy scores according to the in-domain language model on each of a source side and a target side. | 0.779159 |
7,707,173 | 1 | 5 | 1. A method for selecting a requested Web service from one of a plurality of providers, comprising: defining a set of metarules, wherein each of said metarules comprises at least one condition and at least one action to be used in response to an instance of said at least one condition, said at least one condition comprising at least one parameter representing a context of a user and said at least one action comprising at least one directive for selecting services; storing a set of alternative workflows for requested services, wherein each of said alternative workflows comprises multiple web services executed to accomplish a task and wherein each of said alternative workflows is associated with a different provider; retaining performance information from previous web service invocations of said providers; for each of said metarules, ranking said alternative workflows in said set of alternative workflows, based on said performance information, in order to output a set of context-dependent alternative workflows, including summaries of conditions under which each of said alternative workflows in said set of context-dependent alternative workflows should be executed; receiving a customer service request from a customer; matching context information from said customer with a summary of conditions for a first ranked one of said context-dependent alternative workflows; and automatically selecting said first ranked one of said context-dependent alternative workflows for execution in response to said customer service request. | 1. A method for selecting a requested Web service from one of a plurality of providers, comprising: defining a set of metarules, wherein each of said metarules comprises at least one condition and at least one action to be used in response to an instance of said at least one condition, said at least one condition comprising at least one parameter representing a context of a user and said at least one action comprising at least one directive for selecting services; storing a set of alternative workflows for requested services, wherein each of said alternative workflows comprises multiple web services executed to accomplish a task and wherein each of said alternative workflows is associated with a different provider; retaining performance information from previous web service invocations of said providers; for each of said metarules, ranking said alternative workflows in said set of alternative workflows, based on said performance information, in order to output a set of context-dependent alternative workflows, including summaries of conditions under which each of said alternative workflows in said set of context-dependent alternative workflows should be executed; receiving a customer service request from a customer; matching context information from said customer with a summary of conditions for a first ranked one of said context-dependent alternative workflows; and automatically selecting said first ranked one of said context-dependent alternative workflows for execution in response to said customer service request. 5. The method according to claim 1 , wherein said performance information comprises a long-term component that considers multiple instances of previous web service invocations, and an instance level component that considers individual service invocations. | 0.703488 |
4,461,000 | 22 | 23 | 22. The logic array according to claim 17 including next address means connecting to the output of said OR gate matrix and to said input means of said AND gate matrix for providing a next address to said AND gate matrix as a function of either or both the input word and the output of said OR gate matrix. | 22. The logic array according to claim 17 including next address means connecting to the output of said OR gate matrix and to said input means of said AND gate matrix for providing a next address to said AND gate matrix as a function of either or both the input word and the output of said OR gate matrix. 23. The logic array according to claim 22 wherein said control means includes test means for controlling said AND and OR gate matrixes and said next address means to address said AND gate matrix using test words. | 0.928038 |
8,458,179 | 13 | 15 | 13. A non-transitory computer-readable medium storing instructions which when executed by a computer cause the computer to perform a method for augmenting a privacy policy, the method comprising: obtaining a set of training documents and a seed keyword associated with the privacy policy; extracting a candidate keyword from the training documents; issuing at least one query comprising the candidate keyword to a corpus; receiving a set of result documents; evaluating an inference strength between the candidate keyword and a respective seed keyword, wherein evaluating the inference strength comprises evaluating a ratio between the number of search hits from a query containing both the candidate keyword and the respective seed keyword, and the number of search hits from a query containing only the candidate keyword; determining that the evaluated inference strength is greater than a predetermined threshold ratio; responsive to the evaluated inference strength being greater than the predetermined threshold ratio, augmenting the privacy policy by associating the candidate keyword with the privacy policy; and applying the augmented privacy policy to a subject document to determine whether the subject document triggers the privacy policy, wherein applying the augmented privacy policy comprises searching the subject document for occurrences of any of the candidate keywords associated with the augmented privacy policy. | 13. A non-transitory computer-readable medium storing instructions which when executed by a computer cause the computer to perform a method for augmenting a privacy policy, the method comprising: obtaining a set of training documents and a seed keyword associated with the privacy policy; extracting a candidate keyword from the training documents; issuing at least one query comprising the candidate keyword to a corpus; receiving a set of result documents; evaluating an inference strength between the candidate keyword and a respective seed keyword, wherein evaluating the inference strength comprises evaluating a ratio between the number of search hits from a query containing both the candidate keyword and the respective seed keyword, and the number of search hits from a query containing only the candidate keyword; determining that the evaluated inference strength is greater than a predetermined threshold ratio; responsive to the evaluated inference strength being greater than the predetermined threshold ratio, augmenting the privacy policy by associating the candidate keyword with the privacy policy; and applying the augmented privacy policy to a subject document to determine whether the subject document triggers the privacy policy, wherein applying the augmented privacy policy comprises searching the subject document for occurrences of any of the candidate keywords associated with the augmented privacy policy. 15. The computer-readable medium of claim 13 , wherein obtaining the seed keywords comprises issuing a query based on a sensitive topic to the corpus and extracting the seed keywords from a number of documents returned in response to the query. | 0.817365 |
9,807,093 | 19 | 20 | 19. The computer system of claim 15 , wherein the pre-determined type of metadata comprises a portion of the metadata in the electronic document. | 19. The computer system of claim 15 , wherein the pre-determined type of metadata comprises a portion of the metadata in the electronic document. 20. The computer system of claim 19 , wherein the processor is further configured to generate a request, to the user of the electronic device, for a selection of the metadata to be removed from the electronic document. | 0.888434 |
7,711,573 | 116 | 117 | 116. The method of claim 115 , wherein the required term of experience is rounded up to a unit of time. | 116. The method of claim 115 , wherein the required term of experience is rounded up to a unit of time. 117. The method of claim 116 , wherein the unit of time is a number of seconds, minutes, hours, days, weeks, months, years, or decades. | 0.975257 |
9,009,169 | 2 | 3 | 2. The method of claim 1 , further comprising ranking matched responses in said further set of matched responses, and wherein said presenting comprises presenting at least one matched response of said further set of matched responses responsive to said ranking. | 2. The method of claim 1 , further comprising ranking matched responses in said further set of matched responses, and wherein said presenting comprises presenting at least one matched response of said further set of matched responses responsive to said ranking. 3. The method of claim 2 , wherein said ranking takes into account said degree-of-match metrics calculated for matched responses in said further set of matched responses. | 0.954326 |
8,606,578 | 8 | 13 | 8. An apparatus comprising: a microphone to receive speech; a processor; and a computer-readable medium storing instructions that when executed by the processor: buffer N audio frames of a plurality of audio frames associated with an audio signal, where N is greater than 1; pre-compute scores for a subset of context dependent models (CDMs); perform a graphical model search associated with the N audio frames; determine that a score of a context independent model (CIM) associated with a CDM and an audio frame is to be used in lieu of a score for the CDM when a score for the CDM is required by the graphical model search and the score for the CDM has not been pre-computed; pre-compute all scores of CIMs associated with the N frames; and store the pre-computed scores associated with the CIMs in a context independent score cache (CI-CACHE) wherein determining the CIM score associated with the CDM comprises retrieving a score from the CI-CACHE based on a CIM to CDM mapping table. | 8. An apparatus comprising: a microphone to receive speech; a processor; and a computer-readable medium storing instructions that when executed by the processor: buffer N audio frames of a plurality of audio frames associated with an audio signal, where N is greater than 1; pre-compute scores for a subset of context dependent models (CDMs); perform a graphical model search associated with the N audio frames; determine that a score of a context independent model (CIM) associated with a CDM and an audio frame is to be used in lieu of a score for the CDM when a score for the CDM is required by the graphical model search and the score for the CDM has not been pre-computed; pre-compute all scores of CIMs associated with the N frames; and store the pre-computed scores associated with the CIMs in a context independent score cache (CI-CACHE) wherein determining the CIM score associated with the CDM comprises retrieving a score from the CI-CACHE based on a CIM to CDM mapping table. 13. The apparatus of claim 8 , wherein buffering of N frames worth of audio comprises performing feature extraction. | 0.796491 |
9,569,231 | 1 | 8 | 1. A method of providing interactive guidance to a user of a computerized application, the method comprising: receiving a user request to obtain interactive guidance with respect to said computerized application; based on the user request, selectively retrieving an interactive guidance script from a repository of previously-recorded interactive guidance scripts, wherein said interactive guidance script comprises instructions for performing one or more actions in said computerized application on behalf of the user, for displaying guidance text associated with at least one of said actions, and for enabling the user to enter data comprising a character string into one or more fields in the computerized application in response to at least some of said guidance text; and playing said interactive guidance script, to automatically execute said one or more actions in said computerized application on behalf of the user, to display said guidance text in association with at least one of said actions, and to enable the user to enter said data into said one or more fields in said computerized application, in response to at least some of said guidance text. | 1. A method of providing interactive guidance to a user of a computerized application, the method comprising: receiving a user request to obtain interactive guidance with respect to said computerized application; based on the user request, selectively retrieving an interactive guidance script from a repository of previously-recorded interactive guidance scripts, wherein said interactive guidance script comprises instructions for performing one or more actions in said computerized application on behalf of the user, for displaying guidance text associated with at least one of said actions, and for enabling the user to enter data comprising a character string into one or more fields in the computerized application in response to at least some of said guidance text; and playing said interactive guidance script, to automatically execute said one or more actions in said computerized application on behalf of the user, to display said guidance text in association with at least one of said actions, and to enable the user to enter said data into said one or more fields in said computerized application, in response to at least some of said guidance text. 8. The method of claim 1 , wherein the computerized application comprises an application selected from the group consisting of: an application configured to run on a computer, an application configured to run on a mobile phone, an application configured to run on a mobile computing device, an application configured to run on a handheld computing device, an Operating System, an application configured to run on a gaming console, an application configured to run on a gaming device, and an application configured to run on an electronic device having a User Interface (UI). | 0.694356 |
8,125,485 | 1 | 7 | 1. A method of animating speech of an avatar representing a participant in a mobile communication, the method comprising: selecting, by a computer, from data storage, one or more images to represent the participant; selecting, by the computer, from data storage, a generic animation template for the participant, the generic animation template having a mouth and at least one emotive feature, the mouth characterized by a mouth position; fitting, by the computer, the one or more images with the generic animation template; texture wrapping, by the computer, the one or more images over the generic animation template; displaying, by the computer, the one or more images texture wrapped over the generic animation template; receiving, by the computer, an audio speech signal derived from the mobile communication of the participant; identifying, by the computer, from the audio speech signal, a series of phonemes and one or more points of voice inflection greater than a predetermined threshold, each phoneme in the series of phonemes representing a portion of the audio speech signal; for each phoneme in the series of phonemes: identifying, by the computer, a new mouth position for the mouth of the generic animation template; altering, by the computer, the mouth position of the mouth of the generic animation template to the new mouth position; texture wrapping, by the computer, a portion of the one or more images corresponding to the altered mouth position of the mouth of the generic animation template; displaying, by the computer, the texture wrapped portion of the one or more images corresponding to the altered mouth position of the mouth of the generic animation template; and playing, by the computer, synchronously with the displayed texture wrapped portion of the one or more images, the portion of the audio speech signal represented by the phoneme; and for each point of voice inflection of the one or more points of inflection greater than the predetermined threshold, triggering, by the computer, a motion key-frame caption that alters display of the at least one emotive feature synchronously with playing, by the computer, a portion of the audio speech signal including the point of voice inflection greater than the predetermined threshold. | 1. A method of animating speech of an avatar representing a participant in a mobile communication, the method comprising: selecting, by a computer, from data storage, one or more images to represent the participant; selecting, by the computer, from data storage, a generic animation template for the participant, the generic animation template having a mouth and at least one emotive feature, the mouth characterized by a mouth position; fitting, by the computer, the one or more images with the generic animation template; texture wrapping, by the computer, the one or more images over the generic animation template; displaying, by the computer, the one or more images texture wrapped over the generic animation template; receiving, by the computer, an audio speech signal derived from the mobile communication of the participant; identifying, by the computer, from the audio speech signal, a series of phonemes and one or more points of voice inflection greater than a predetermined threshold, each phoneme in the series of phonemes representing a portion of the audio speech signal; for each phoneme in the series of phonemes: identifying, by the computer, a new mouth position for the mouth of the generic animation template; altering, by the computer, the mouth position of the mouth of the generic animation template to the new mouth position; texture wrapping, by the computer, a portion of the one or more images corresponding to the altered mouth position of the mouth of the generic animation template; displaying, by the computer, the texture wrapped portion of the one or more images corresponding to the altered mouth position of the mouth of the generic animation template; and playing, by the computer, synchronously with the displayed texture wrapped portion of the one or more images, the portion of the audio speech signal represented by the phoneme; and for each point of voice inflection of the one or more points of inflection greater than the predetermined threshold, triggering, by the computer, a motion key-frame caption that alters display of the at least one emotive feature synchronously with playing, by the computer, a portion of the audio speech signal including the point of voice inflection greater than the predetermined threshold. 7. The method of claim 1 wherein the identifying the new mouth position for the mouth of the generic animation template comprises retrieving coordinates of the new mouth position from a data structure in dependence upon an identification of the phoneme. | 0.752446 |
8,276,056 | 8 | 14 | 8. The device of claim 1 , wherein the binary format of scene description graph interpreter further comprises: a VideoObject2D node or a MovieTexture node connected to the audiovisual object demultiplexer and binary format of scene browser; a video object programmer interface connected to the VideoObject2D or MovieTexture node; an AudioSource node connected to the means for interacting with the user; an audio object programmer interface connected to the AudioSource node; an ImageTexture node connected to the means for interacting with the user; and an image object programmer interface connected to the ImageTexture node. | 8. The device of claim 1 , wherein the binary format of scene description graph interpreter further comprises: a VideoObject2D node or a MovieTexture node connected to the audiovisual object demultiplexer and binary format of scene browser; a video object programmer interface connected to the VideoObject2D or MovieTexture node; an AudioSource node connected to the means for interacting with the user; an audio object programmer interface connected to the AudioSource node; an ImageTexture node connected to the means for interacting with the user; and an image object programmer interface connected to the ImageTexture node. 14. The device of claim 8 , wherein the binary format of scene description graph interpreter further comprises: a script node; an interpreter programmer interface connected to the script node; and a scripting interface. | 0.898045 |
7,997,485 | 1 | 3 | 1. A computer-implemented system that facilitates content presentation, comprising: a profile component that facilitates user creation of user preferences data in a user profile of a user; a control component that facilitates the user's control to incrementally expose portions of the user preferences data from the user profile of the user to a vendor and to independently expose different amounts of the user preference data to each of a plurality of different vendors; and a content component that presents content of the vendor to the user based on the exposed portions of the user preferences data. | 1. A computer-implemented system that facilitates content presentation, comprising: a profile component that facilitates user creation of user preferences data in a user profile of a user; a control component that facilitates the user's control to incrementally expose portions of the user preferences data from the user profile of the user to a vendor and to independently expose different amounts of the user preference data to each of a plurality of different vendors; and a content component that presents content of the vendor to the user based on the exposed portions of the user preferences data. 3. The system of claim 1 , further comprising an enticement component that facilitates offering of an enticement in exchange for access to the user preferences. | 0.694656 |
9,400,841 | 9 | 12 | 9. A method for generating a first answer relationship in a first answer sequence of a plurality of answer sequences, the method comprising: receiving, from a user, a question; identifying, in response to the received question, a plurality of answer sequences, wherein each answer sequence of the plurality of answer sequences is a procedure that includes as parts of that procedure a plurality of answers to be used together by the user to complete a task associated with the question; identifying, in response to the received question, the first answer sequence of the plurality of answer sequences, the first answer sequence including a first answer and a second answer; analyzing, using the first answer and the second answer, a corpus to identify a set of influence factors corresponding to both the first answer and the second answer, wherein each influence factor of the set of influence factors is an interaction that is likely to occur if the first answer and the second answer are used together as provided for in the first answer sequence to complete the task; and generating, based on the set of influence factors, the first answer relationship between the first answer and the second answer. | 9. A method for generating a first answer relationship in a first answer sequence of a plurality of answer sequences, the method comprising: receiving, from a user, a question; identifying, in response to the received question, a plurality of answer sequences, wherein each answer sequence of the plurality of answer sequences is a procedure that includes as parts of that procedure a plurality of answers to be used together by the user to complete a task associated with the question; identifying, in response to the received question, the first answer sequence of the plurality of answer sequences, the first answer sequence including a first answer and a second answer; analyzing, using the first answer and the second answer, a corpus to identify a set of influence factors corresponding to both the first answer and the second answer, wherein each influence factor of the set of influence factors is an interaction that is likely to occur if the first answer and the second answer are used together as provided for in the first answer sequence to complete the task; and generating, based on the set of influence factors, the first answer relationship between the first answer and the second answer. 12. The method of claim 9 , further comprising: assigning a relationship score to the first answer relationship, the relationship score calculated based on the set of influence factors; and evaluating, based on the relationship score, the first answer relationship. | 0.883975 |
8,725,713 | 8 | 12 | 8. A computer implemented method for optimizing queries to data in a computer database comprising the steps of: retrieving an SQL statement; parsing the query for a clause that requires searching for a string in a database record; where there is a clause that requires searching for a text string, optimizing the query by determining a starting position other than the beginning position of the record wherein the determined starting position in the database record is based on historical records of previous queries in a starting position table; and executing the query to search for the text at the determined starting position. | 8. A computer implemented method for optimizing queries to data in a computer database comprising the steps of: retrieving an SQL statement; parsing the query for a clause that requires searching for a string in a database record; where there is a clause that requires searching for a text string, optimizing the query by determining a starting position other than the beginning position of the record wherein the determined starting position in the database record is based on historical records of previous queries in a starting position table; and executing the query to search for the text at the determined starting position. 12. The computer implemented method of claim 8 wherein the step of determining a starting position to search for the string in the database record based on records of similar historical queries comprises the steps of: searching each record of the starting position table for records that matches the query; defining a starting position to search the record based on the position where previous queries found the string in a predetermined number of the records that match the query. | 0.501037 |
9,152,926 | 8 | 14 | 8. A system for updating a classifier, comprising: a hardware processor that is configured to: receive a sample; assign a first importance weight to the sample based on a count of samples used to update the classifier; for each of a first plurality of weak learners, classify the sample using the weak learner, determine an outcome of the classification, and determine an updated error rate of the weak learner based on the outcome of the classification and the first importance weight; select a first weak learner from the first plurality of weak learners based on the updated error rate of the first weak learner; and update the classifier based on the first weak learner. | 8. A system for updating a classifier, comprising: a hardware processor that is configured to: receive a sample; assign a first importance weight to the sample based on a count of samples used to update the classifier; for each of a first plurality of weak learners, classify the sample using the weak learner, determine an outcome of the classification, and determine an updated error rate of the weak learner based on the outcome of the classification and the first importance weight; select a first weak learner from the first plurality of weak learners based on the updated error rate of the first weak learner; and update the classifier based on the first weak learner. 14. The system of claim 8 , wherein the sample is a medical imaging image. | 0.955689 |
7,975,238 | 14 | 15 | 14. In a Web communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying received hypertext documents, transmitted from sources on the Web, including at least one display page containing text, images and a plurality of embedded hyperlinks, each hyperlink being user selectable to access and display a respective linked hypertext document, a system for tracking bookmarking in received Web documents, said system comprising: a processor; a computer memory holding computer program instructions which when executed by the processor perform the method comprising: bookmarking, at one of said receiving display stations, selected received Web documents to thereby store, as bookmarks, direct links to the sources of said Web documents: comparing said stored bookmarks to hyperlinks in each Web document received at said one display station to determine if said hyperlinks have been bookmarked; and visually distinguishing each bookmarked hyperlink in said received displayed Web document. | 14. In a Web communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying received hypertext documents, transmitted from sources on the Web, including at least one display page containing text, images and a plurality of embedded hyperlinks, each hyperlink being user selectable to access and display a respective linked hypertext document, a system for tracking bookmarking in received Web documents, said system comprising: a processor; a computer memory holding computer program instructions which when executed by the processor perform the method comprising: bookmarking, at one of said receiving display stations, selected received Web documents to thereby store, as bookmarks, direct links to the sources of said Web documents: comparing said stored bookmarks to hyperlinks in each Web document received at said one display station to determine if said hyperlinks have been bookmarked; and visually distinguishing each bookmarked hyperlink in said received displayed Web document. 15. The Web communication system of claim 14 wherein said bookmarked hyperlinks are visually distinguished by displaying an indicator adjacent each bookmarked hyperlink. | 0.85097 |
9,471,874 | 13 | 14 | 13. The computer program product of claim 10 wherein the actions further comprise: identifying a plurality of follow-up postings corresponding to the identified question; analyzing each of the follow-up postings to identify a conversational move corresponding to each of the follow up postings, wherein at least one of the conversational postings is selected from the group consisting of an answer, a clarification, a rejection, or a different conversational move; and generating a contribution tree based on the follow-up postings and their identified conversational moves. | 13. The computer program product of claim 10 wherein the actions further comprise: identifying a plurality of follow-up postings corresponding to the identified question; analyzing each of the follow-up postings to identify a conversational move corresponding to each of the follow up postings, wherein at least one of the conversational postings is selected from the group consisting of an answer, a clarification, a rejection, or a different conversational move; and generating a contribution tree based on the follow-up postings and their identified conversational moves. 14. The computer program product of claim 13 wherein the actions further comprise: pruning one or more of the follow-up postings from the contribution tree based on a contribution analysis, wherein the pruned follow-up postings have a contribution analysis result selected from the group consisting of an answer leading to a new question, an overly deep follow-up posting, and another pruning criteria. | 0.921484 |
9,377,999 | 7 | 8 | 7. The development system of claim 1 , wherein each element type comprises a set properties and methods that define run time behavior for elements of that element type, and wherein the instructions configure the development system to: generate a plurality of search components, each search component corresponding to a given one of he different types and being configured to search the set of properties and methods for elements of the given type. | 7. The development system of claim 1 , wherein each element type comprises a set properties and methods that define run time behavior for elements of that element type, and wherein the instructions configure the development system to: generate a plurality of search components, each search component corresponding to a given one of he different types and being configured to search the set of properties and methods for elements of the given type. 8. The development system of claim 7 , wherein the instructions configure the development system to obtain the search result by selecting a search component from the plurality of search components that corresponds to the particular element type, identifying an element of the computer system that have the particular element type, and searching the identified element based on the user search query using the selected search component. | 0.77249 |
8,700,625 | 11 | 13 | 11. A computer program product, comprising: a non-transitory computer-readable medium having computer-readable program code embodied therein for identifying alternative products, the computer-readable medium comprising: computer-readable program code for analyzing information regarding a plurality of queries to identify a plurality of product-query pairs, each product-query pair comprising a query and a product that was previously selected from results for the query; computer-readable program code for determining, for each product-query pair, a number of times that the product was selected from results for the query; computer-readable program code for determining, for each product-query pair, whether the query of the product-query pair is associated with the product of the product-query pair based on the number of times that the product was selected from results for the query; computer-readable program code for analyzing the information regarding the plurality of queries to identify comparison queries directed to a comparison between two or more of a plurality of products; and computer-readable program code for determining whether a first product is an alternative to a second product based on a number of times that a query associated with the first product is included in a comparison query with a query associated with the second product. | 11. A computer program product, comprising: a non-transitory computer-readable medium having computer-readable program code embodied therein for identifying alternative products, the computer-readable medium comprising: computer-readable program code for analyzing information regarding a plurality of queries to identify a plurality of product-query pairs, each product-query pair comprising a query and a product that was previously selected from results for the query; computer-readable program code for determining, for each product-query pair, a number of times that the product was selected from results for the query; computer-readable program code for determining, for each product-query pair, whether the query of the product-query pair is associated with the product of the product-query pair based on the number of times that the product was selected from results for the query; computer-readable program code for analyzing the information regarding the plurality of queries to identify comparison queries directed to a comparison between two or more of a plurality of products; and computer-readable program code for determining whether a first product is an alternative to a second product based on a number of times that a query associated with the first product is included in a comparison query with a query associated with the second product. 13. The computer program product of claim 11 , wherein each comparison query comprises a comparison question in combination with a first query term for one of the plurality of products and a second query term for another one of the plurality of products. | 0.895301 |
4,843,589 | 1 | 6 | 1. In an electronic dictionary and language interpreter device wherein a first word or words represented in a first language are entered for retrieving a second word or words represented in a second language equivalent to the first word or words or for retrieving the definition of a word in either language, the improvement comprising: input means for entering a specific entry word; abbreviation memory means for storing a plurality of words in a word block in alphabetic order, said plurality of alphabetized words having letters in common forming common repeating parts of said plurality of words, wherein said plurality of words in the word block are stored in an abbreviated code format comprising abbreviated code information representing said common repeating parts of said plurality of words and additional data representing other letters of said plurality of words; retrieval means responsive to the input means for retrieving abbreviated code information and additional data to construct a retrieved word related to the specific entry word; and display means responsive to said retrieval means for displaying said retrieved word. | 1. In an electronic dictionary and language interpreter device wherein a first word or words represented in a first language are entered for retrieving a second word or words represented in a second language equivalent to the first word or words or for retrieving the definition of a word in either language, the improvement comprising: input means for entering a specific entry word; abbreviation memory means for storing a plurality of words in a word block in alphabetic order, said plurality of alphabetized words having letters in common forming common repeating parts of said plurality of words, wherein said plurality of words in the word block are stored in an abbreviated code format comprising abbreviated code information representing said common repeating parts of said plurality of words and additional data representing other letters of said plurality of words; retrieval means responsive to the input means for retrieving abbreviated code information and additional data to construct a retrieved word related to the specific entry word; and display means responsive to said retrieval means for displaying said retrieved word. 6. The device according to claim 1, wherein said abbreviation memory means stores address information related to said second word or words in said second language. | 0.709964 |
8,682,304 | 1 | 7 | 1. A method of providing voicemail to a mobile telephone, in which a caller initiates a voice call to the mobile telephone, but that call is diverted to a voicemail server, with the caller then leaving a voice message on the voicemail server, the method comprising the steps of: when a recording time of the voice message exceeds a maximum time, sending a standard notification to the mobile telephone indicating that an end-user of the mobile telephone has a new voicemail to listen to; when the recording time of the voice message is less than a maximum time: converting the voice message to an audio file format; sending or streaming the audio file to a voice to text transcription system comprising at least one computer adapted to play back the voice message to an operator to enable the operator to transcribe the voice message into the computer to generate a transcribed text message; including a unique identification in the transcribed text message that links the text message to the voice message held at the voicemail server; sending the transcribed text message to the mobile phone; and providing the voice message held at the server to the mobile telephone when the end-user of the mobile telephone selects or uses the unique identification. | 1. A method of providing voicemail to a mobile telephone, in which a caller initiates a voice call to the mobile telephone, but that call is diverted to a voicemail server, with the caller then leaving a voice message on the voicemail server, the method comprising the steps of: when a recording time of the voice message exceeds a maximum time, sending a standard notification to the mobile telephone indicating that an end-user of the mobile telephone has a new voicemail to listen to; when the recording time of the voice message is less than a maximum time: converting the voice message to an audio file format; sending or streaming the audio file to a voice to text transcription system comprising at least one computer adapted to play back the voice message to an operator to enable the operator to transcribe the voice message into the computer to generate a transcribed text message; including a unique identification in the transcribed text message that links the text message to the voice message held at the voicemail server; sending the transcribed text message to the mobile phone; and providing the voice message held at the server to the mobile telephone when the end-user of the mobile telephone selects or uses the unique identification. 7. The method of claim 1 in which the operator represents the mood of the caller leaving the voice message in the transcribed text message using either a written description or an emoticon. | 0.663701 |
9,582,572 | 2 | 6 | 2. The computing device of claim 1 , further comprising: search circuitry to search one or more content sources for relevant search results based on a current context of the concept model; and personalized content circuitry to (i) index the search results in the personalized search library according to the concept model and (ii) facilitate access to the personalized search library by the user. | 2. The computing device of claim 1 , further comprising: search circuitry to search one or more content sources for relevant search results based on a current context of the concept model; and personalized content circuitry to (i) index the search results in the personalized search library according to the concept model and (ii) facilitate access to the personalized search library by the user. 6. The computing device of claim 2 , wherein the computing device is a personalized content server. | 0.959493 |
9,020,880 | 14 | 24 | 14. A computer system to implement an inference procedure for responding to one or more configuration queries using configuration sub-models, the system comprising: a processor; and a storage medium having data encoded therein, the data comprising processor executable code for: dividing one or more configuration queries into multiple configuration sub-queries, wherein the one or more configuration queries represent one or more questions involving parts and part relationships in a configuration of a configurable product the multiple configuration sub-queries represent the one or more configuration queries, and the parts represent a composition of matter of the configurable product; processing each sub-query using at least one configuration sub-model per sub-query, wherein the configuration sub-models collectively model a configurable product; generating a response to the one or more configuration queries based upon the processing of each sub-query using at least one configuration sub-model per sub-query; and providing the response to the one or more configuration queries as data for display by a display device. | 14. A computer system to implement an inference procedure for responding to one or more configuration queries using configuration sub-models, the system comprising: a processor; and a storage medium having data encoded therein, the data comprising processor executable code for: dividing one or more configuration queries into multiple configuration sub-queries, wherein the one or more configuration queries represent one or more questions involving parts and part relationships in a configuration of a configurable product the multiple configuration sub-queries represent the one or more configuration queries, and the parts represent a composition of matter of the configurable product; processing each sub-query using at least one configuration sub-model per sub-query, wherein the configuration sub-models collectively model a configurable product; generating a response to the one or more configuration queries based upon the processing of each sub-query using at least one configuration sub-model per sub-query; and providing the response to the one or more configuration queries as data for display by a display device. 24. The computer system of claim 14 wherein the code is further executable by the processor for: dividing a consolidated configuration model into the configuration sub-models. | 0.800228 |
8,392,438 | 12 | 16 | 12. A server comprising hardware configured to perform operations comprising: obtaining two words to be identified; determining that a shortest edit distance between the two words is less than or equal to an edit distance threshold; determining whether both of the two words exist in a preset knowledge database; if at least one of the two words does not exist in the preset knowledge database, segmenting one or more unfound words; determining whether all of the words after segmentation exist in the knowledge database; and if all of the words after segmentation exist in the knowledge database, finding a smallest granularity type with highest weight value for each such word in the knowledge database; and if both of the two words exist in the preset knowledge database, finding the smallest granularity type with highest weight value for each word in the knowledge database; determining whether the two words have a same smallest granularity type with highest weight value; if the two words have the same smallest granularity type with highest weight value, determining that the two words are synonyms; and if the two words do not have the same smallest granularity type with highest weight value, determining that the two words are non-synonyms. | 12. A server comprising hardware configured to perform operations comprising: obtaining two words to be identified; determining that a shortest edit distance between the two words is less than or equal to an edit distance threshold; determining whether both of the two words exist in a preset knowledge database; if at least one of the two words does not exist in the preset knowledge database, segmenting one or more unfound words; determining whether all of the words after segmentation exist in the knowledge database; and if all of the words after segmentation exist in the knowledge database, finding a smallest granularity type with highest weight value for each such word in the knowledge database; and if both of the two words exist in the preset knowledge database, finding the smallest granularity type with highest weight value for each word in the knowledge database; determining whether the two words have a same smallest granularity type with highest weight value; if the two words have the same smallest granularity type with highest weight value, determining that the two words are synonyms; and if the two words do not have the same smallest granularity type with highest weight value, determining that the two words are non-synonyms. 16. A server as recited in claim 12 , wherein the operations further comprise, in responsive to determining that the two words are synonyms, saving such identified synonyms in a synonym database. | 0.896934 |
8,239,375 | 1 | 16 | 1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. | 1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. 16. The method of claim 1 further comprising displaying with the at least one search result a status of the search; and including as the status one of an in progress status, a canceled status and a completed status. | 0.900278 |
9,378,423 | 2 | 3 | 2. The method of claim 1 , further comprising: identifying a plurality of shots in the video content; creating a lattice of nodes that comprises at least one of a scene boundary node or a non-scene boundary node for each shot in the plurality of shots, wherein the lattice of nodes defines a plurality of paths beginning at a first shot of the plurality of shots and ending at a last shot of the plurality of shots; ranking the plurality of paths; and selecting, based on the ranking, which one of the plurality of paths is to define where boundaries of the scene are located in the video content. | 2. The method of claim 1 , further comprising: identifying a plurality of shots in the video content; creating a lattice of nodes that comprises at least one of a scene boundary node or a non-scene boundary node for each shot in the plurality of shots, wherein the lattice of nodes defines a plurality of paths beginning at a first shot of the plurality of shots and ending at a last shot of the plurality of shots; ranking the plurality of paths; and selecting, based on the ranking, which one of the plurality of paths is to define where boundaries of the scene are located in the video content. 3. The method of claim 2 , wherein creating the lattice of nodes comprises: calculating a probability that a current shot is a scene boundary; calculating a probability that the current shot is a non-scene boundary; and inserting the at least one of the scene boundary node or the non-scene boundary node for the current shot into the lattice based on the probability that the current shot is a scene boundary and the probability that the current shot is a non-scene boundary. | 0.74921 |
7,617,187 | 6 | 9 | 6. A system for searching a second dataset from a first dataset, the system comprising: a first dataset operating with a first collation, the first collation having a case sensitivity flag, an accent use sensitivity flag, a character width sensitivity flag, and a kana sensitivity flag for a first human language; a second dataset operating with a second collation different from the first collation; receiving means that accepts a first query from the first dataset against the second dataset; an algebrizer that rewrites the first query into a second query; an optimizer that chooses an index plan for the second query; a query execution unit that executes the second query; a processor, having access to memory for retrieving instructions, the instructions, when executed by the processor, causing the processor to perform acts comprising: receiving a first query from the first dataset, the first query being generated using the first collation associated with the first dataset, the first collation having the case sensitivity flag, the accent use sensitivity flag, the character width sensitivity flag, and the kana sensitivity flag for the first human language; rewriting the first query to form a second query, the second query comprising a second collation and a residue predicate, the second collation comprising a superset of the first collation, the second collation of the second query being broader than the first collation of the first query and being insensitive with respect to at least one of case, accent use, character width, and kana, the second collation encompassing the first collation, the second collation having an associated index for the second collation, and the residue predicate comprising an original search term from the first query including the first collation, wherein the residue predicate is selected to ensure that a set of results returned in response to the second query satisfies the case sensitivity flag, the accent use sensitivity flag, the character width sensitivity flag, and the kana sensitivity flag of the first collation; optimizing the second query by choosing an index plan that targets an index associated with multiple human languages that is useful in searching across a multiplicity of human language collations; executing the second query to search the first dataset; and returning information satisfying the first query; wherein the first and second datasets each comprise one of a database, a user session and an explicit user query. | 6. A system for searching a second dataset from a first dataset, the system comprising: a first dataset operating with a first collation, the first collation having a case sensitivity flag, an accent use sensitivity flag, a character width sensitivity flag, and a kana sensitivity flag for a first human language; a second dataset operating with a second collation different from the first collation; receiving means that accepts a first query from the first dataset against the second dataset; an algebrizer that rewrites the first query into a second query; an optimizer that chooses an index plan for the second query; a query execution unit that executes the second query; a processor, having access to memory for retrieving instructions, the instructions, when executed by the processor, causing the processor to perform acts comprising: receiving a first query from the first dataset, the first query being generated using the first collation associated with the first dataset, the first collation having the case sensitivity flag, the accent use sensitivity flag, the character width sensitivity flag, and the kana sensitivity flag for the first human language; rewriting the first query to form a second query, the second query comprising a second collation and a residue predicate, the second collation comprising a superset of the first collation, the second collation of the second query being broader than the first collation of the first query and being insensitive with respect to at least one of case, accent use, character width, and kana, the second collation encompassing the first collation, the second collation having an associated index for the second collation, and the residue predicate comprising an original search term from the first query including the first collation, wherein the residue predicate is selected to ensure that a set of results returned in response to the second query satisfies the case sensitivity flag, the accent use sensitivity flag, the character width sensitivity flag, and the kana sensitivity flag of the first collation; optimizing the second query by choosing an index plan that targets an index associated with multiple human languages that is useful in searching across a multiplicity of human language collations; executing the second query to search the first dataset; and returning information satisfying the first query; wherein the first and second datasets each comprise one of a database, a user session and an explicit user query. 9. The system of claim 6 , wherein the method step of rewriting the first query comprises rewriting the first query such that the second query is formed to search with a broader human language collation than the first query, and wherein the residue predicate comprises elements of the first query. | 0.501678 |
7,644,209 | 5 | 7 | 5. The method of claim 1 wherein the memory has stored therein a map file comprising an assignment of each linguistic element to a corresponding input member, at least some of the linguistic elements in the map file being in the alphabet, further comprising detecting a predetermined input comprising an actuation of a particular input member, and outputting at least a portion of a set of the linguistic elements from the map file that are assigned to the particular input member. | 5. The method of claim 1 wherein the memory has stored therein a map file comprising an assignment of each linguistic element to a corresponding input member, at least some of the linguistic elements in the map file being in the alphabet, further comprising detecting a predetermined input comprising an actuation of a particular input member, and outputting at least a portion of a set of the linguistic elements from the map file that are assigned to the particular input member. 7. The method of claim 5 , further comprising detecting as an input of the at least a first new linguistic element at least one of a navigational input and a selection input with respect to a linguistic element of the set of the linguistic elements. | 0.933741 |
9,542,453 | 19 | 21 | 19. A computer system for producing personalized search results, comprising: memory; one or more processors; one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including: instructions for receiving a search query from a user; instructions for identifying search results associated with the search query; instructions for identifying a user profile associated with the user, wherein the user profile includes a set of user-preferred search results determined, at least in part, by: instructions for identifying a set of candidate search results in a search history of the user, wherein each of the candidate search results has been selected by the user for at least a predefined minimum number of times; instructions for determining a popularity metric for each of the candidate search results; and instructions for selecting a subset of the candidate search results whose associated popularity metrics exceed a predefined threshold as the set of user-preferred search results; instructions for identifying in the search results, one or more search results that are associated with at least one of the user-preferred search results; instructions for ordering the search results based at least in part on the identification, in the search results, of the one or more search results that are associated with at least one of the user-preferred search results; and instructions for providing the ordered list of search results to the user. | 19. A computer system for producing personalized search results, comprising: memory; one or more processors; one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including: instructions for receiving a search query from a user; instructions for identifying search results associated with the search query; instructions for identifying a user profile associated with the user, wherein the user profile includes a set of user-preferred search results determined, at least in part, by: instructions for identifying a set of candidate search results in a search history of the user, wherein each of the candidate search results has been selected by the user for at least a predefined minimum number of times; instructions for determining a popularity metric for each of the candidate search results; and instructions for selecting a subset of the candidate search results whose associated popularity metrics exceed a predefined threshold as the set of user-preferred search results; instructions for identifying in the search results, one or more search results that are associated with at least one of the user-preferred search results; instructions for ordering the search results based at least in part on the identification, in the search results, of the one or more search results that are associated with at least one of the user-preferred search results; and instructions for providing the ordered list of search results to the user. 21. The computer system of claim 19 , wherein each of the candidate search results has been selected by the user for at least the predefined minimum number of times during a time period having at least a predefined minimum duration. | 0.730858 |
9,710,546 | 8 | 12 | 8. A recommendation system implemented in at least one computing device, comprising: a voiced input interface configured to receive an explicit declaration in the form of speech from a user of a computing device in real time without the computing device prompting the user, the explicit declaration includes a series of words and is configured to influence a subsequent recommendation, the computing device recognizing the explicit declaration by an identifier for an intelligent personal assistant of the user device that begins the explicit declaration; a speech processing module configured to process the series of words of the explicit declaration to generate a record; a rules generator configured to generate a recommendation rule based on the generated record, the recommendation rule including a logical expression; a recommendation engine configured to execute the recommendation rule to generate a recommendation for the user, the recommendation rule defining a manner in which a corresponding recommendation is provided; and an output interface configured to provide the generated recommendation to the user. | 8. A recommendation system implemented in at least one computing device, comprising: a voiced input interface configured to receive an explicit declaration in the form of speech from a user of a computing device in real time without the computing device prompting the user, the explicit declaration includes a series of words and is configured to influence a subsequent recommendation, the computing device recognizing the explicit declaration by an identifier for an intelligent personal assistant of the user device that begins the explicit declaration; a speech processing module configured to process the series of words of the explicit declaration to generate a record; a rules generator configured to generate a recommendation rule based on the generated record, the recommendation rule including a logical expression; a recommendation engine configured to execute the recommendation rule to generate a recommendation for the user, the recommendation rule defining a manner in which a corresponding recommendation is provided; and an output interface configured to provide the generated recommendation to the user. 12. The recommendation system of claim 8 , wherein the voiced input interface, the speech processing module, the rules generator, and the recommendation engine are located in a user device of the user. | 0.732713 |
10,061,797 | 1 | 8 | 1. A computer-implemented method comprising: receiving, at a social networking system from a user via a client device, metadata associated with a target object maintained by the social networking system; determining an amount of metadata previously received from the user and associated with one or more stored objects maintained by the social networking system; retrieving characteristics of the user derived from information stored by the social networking system if the amount of metadata previously received from the user is less than a threshold amount of metadata; identifying additional users of the social networking system having respective confidence values of at least a threshold confidence value, wherein the respective confidence values represent measures of accuracy of metadata provided by the respective additional users in association with the one or more objects maintained by the social networking system; comparing the characteristics of the user to characteristics of the identified additional users; calculating a confidence value associated with the user based on a similarity between the characteristics of the user and the characteristics of the identified additional users; and storing the metadata in association with the object if the confidence value associated with the user exceeds the threshold confidence value. | 1. A computer-implemented method comprising: receiving, at a social networking system from a user via a client device, metadata associated with a target object maintained by the social networking system; determining an amount of metadata previously received from the user and associated with one or more stored objects maintained by the social networking system; retrieving characteristics of the user derived from information stored by the social networking system if the amount of metadata previously received from the user is less than a threshold amount of metadata; identifying additional users of the social networking system having respective confidence values of at least a threshold confidence value, wherein the respective confidence values represent measures of accuracy of metadata provided by the respective additional users in association with the one or more objects maintained by the social networking system; comparing the characteristics of the user to characteristics of the identified additional users; calculating a confidence value associated with the user based on a similarity between the characteristics of the user and the characteristics of the identified additional users; and storing the metadata in association with the object if the confidence value associated with the user exceeds the threshold confidence value. 8. The computer-implemented method of claim 1 , wherein the characteristics of the user are selected from a group consisting of: demographic information associated with the user, one or more interests of the user, an employment history of the user, one or more interactions by the user with content having at least a threshold measure of similarity with the object, and any combination thereof. | 0.774083 |
7,519,908 | 6 | 7 | 6. The machine-implemented configuration tool of claim 1 , wherein the front-end layer comprises: a markup language generator to generate markup language files to be processed by the logic layer. | 6. The machine-implemented configuration tool of claim 1 , wherein the front-end layer comprises: a markup language generator to generate markup language files to be processed by the logic layer. 7. The machine-implemented configuration tool of claim 6 , wherein the markup language files are based, at least in part, on a received property file. | 0.960671 |
7,581,177 | 19 | 22 | 19. A method for generating an upgrade module for upgrading documents for processing by a solution module associated with a markup language schema, comprising: determining whether a particular version of the solution module has been created that warrants generation of the upgrade module; when the determination indicates that generation of the upgrade module is warranted, generating the upgrade module; configuring the upgrade module to modify an input structured document having particular data entry fields associated therewith to create an updated document which conforms to expected data entry fields associated with the particular version of the solution module; modifying the input structured document to create new data entry fields in the updated document provided that the new data entry fields are required in the particular version of the solution module even if the new data entry fields are considered optional by its schema; and displaying the updated document on a display device. | 19. A method for generating an upgrade module for upgrading documents for processing by a solution module associated with a markup language schema, comprising: determining whether a particular version of the solution module has been created that warrants generation of the upgrade module; when the determination indicates that generation of the upgrade module is warranted, generating the upgrade module; configuring the upgrade module to modify an input structured document having particular data entry fields associated therewith to create an updated document which conforms to expected data entry fields associated with the particular version of the solution module; modifying the input structured document to create new data entry fields in the updated document provided that the new data entry fields are required in the particular version of the solution module even if the new data entry fields are considered optional by its schema; and displaying the updated document on a display device. 22. The method according to claim 19 , further comprising: configuring the upgrade module to omit data entry fields in the input structured document from the updated document such that the updated document conforms to the expected data entry fields associated with the particular version of the solution module. | 0.806592 |
10,146,769 | 13 | 15 | 13. A computer program product comprising a non-transitory computer readable storage medium having instructions encoded thereon that, when executed by one or more processors, cause the one or more processors to: receive, from a client device of a user, textual feedback associated with a metadata and a provider, the textual feedback including a plurality of words, the textual feedback describing a transportation service provided by the provider for the user; determine a feature vector for the textual feedback by characterizing the plurality of words and the metadata; determine a first safety sub-score by applying the feature vector to a first classifier associated with a first category of safety risk, the first classifier being a machine learning model trained using a first training feature vector characterizing a first set of textual feedback associated with the first category of safety risk; determine a second safety sub-score by applying the feature vector to a second classifier associated with a second category of safety risk different than the first category of safety risk, the second classifier being a different machine learning model trained using a second training feature vector characterizing a second set of textual feedback associated with the second category of safety risk; and determine a safety score for the provider using a third classifier based, at least in part, on the first safety sub-score and the second safety sub-score. | 13. A computer program product comprising a non-transitory computer readable storage medium having instructions encoded thereon that, when executed by one or more processors, cause the one or more processors to: receive, from a client device of a user, textual feedback associated with a metadata and a provider, the textual feedback including a plurality of words, the textual feedback describing a transportation service provided by the provider for the user; determine a feature vector for the textual feedback by characterizing the plurality of words and the metadata; determine a first safety sub-score by applying the feature vector to a first classifier associated with a first category of safety risk, the first classifier being a machine learning model trained using a first training feature vector characterizing a first set of textual feedback associated with the first category of safety risk; determine a second safety sub-score by applying the feature vector to a second classifier associated with a second category of safety risk different than the first category of safety risk, the second classifier being a different machine learning model trained using a second training feature vector characterizing a second set of textual feedback associated with the second category of safety risk; and determine a safety score for the provider using a third classifier based, at least in part, on the first safety sub-score and the second safety sub-score. 15. The non-transitory computer readable storage medium of claim 13 , wherein the feature vector characterizes the plurality of words and the metadata using a plurality of dimensions associated with the plurality of words and one or more dimensions associated with the metadata. | 0.724206 |
8,959,101 | 1 | 16 | 1. A system for enabling a user to locate information of interest in different human languages, comprising: one or more databases containing terms in a first human language, wherein the terms are organized into a hierarchical structure; a first computer executing search interface software recorded on a computer-readable medium and associated with a collection of information in a second human language, wherein the search interface software when executed causes the first computer to receive search queries in the second human language and to communicate search results from the collection of information in the second human language; and a second computer executing user interface software recorded on a computer-readable medium, wherein the user interface software when executed causes the second computer to communicate with the one or more databases, the search interface software, and a user, and to: access the terms in the first human language from the one or more databases; communicate with the user to allow the user to navigate through the terms in accordance with the hierarchical structure; receive an indication that the user has selected one or more of the terms in the first human language; generate a draft search query in the second human language based on a translation of the selected one or more terms; display the draft search query in the second human language to the user; receive a revised search query in the second human language from the user; communicate the revised search query in the second human language to the first computer executing the search interface software; receive from the first computer search results in the second human language; and communicate the search results in the second human language to the user, wherein the one or more databases, the first computer, and the second computer are in communication with a computer network. | 1. A system for enabling a user to locate information of interest in different human languages, comprising: one or more databases containing terms in a first human language, wherein the terms are organized into a hierarchical structure; a first computer executing search interface software recorded on a computer-readable medium and associated with a collection of information in a second human language, wherein the search interface software when executed causes the first computer to receive search queries in the second human language and to communicate search results from the collection of information in the second human language; and a second computer executing user interface software recorded on a computer-readable medium, wherein the user interface software when executed causes the second computer to communicate with the one or more databases, the search interface software, and a user, and to: access the terms in the first human language from the one or more databases; communicate with the user to allow the user to navigate through the terms in accordance with the hierarchical structure; receive an indication that the user has selected one or more of the terms in the first human language; generate a draft search query in the second human language based on a translation of the selected one or more terms; display the draft search query in the second human language to the user; receive a revised search query in the second human language from the user; communicate the revised search query in the second human language to the first computer executing the search interface software; receive from the first computer search results in the second human language; and communicate the search results in the second human language to the user, wherein the one or more databases, the first computer, and the second computer are in communication with a computer network. 16. The system of claim 1 , the second computer further executing user reporting software recorded on a computer-readable medium, wherein the user reporting software when executed causes the second computer to communicate with the user interface software and to record one or more of: the revised search query, the search results, and an identity of the user. | 0.74611 |
8,539,463 | 17 | 28 | 17. A method for processing source code comprising: receiving source code; parsing the source code to obtain a high level intermediate representation of the source code; detecting, in the high level intermediate representation of the source code, high level constructs in the high level intermediate representation of the source code that satisfy constraints for parallel-merging high level constructs; and parallel-merging the high level constructs to generate new high level parallel-merged constructs in a modified high level intermediate representation of the source code that enable runtime operations of the high level constructs to execute in parallel using executable code generated from the modified high level intermediate representation; and executing, if the parallel execution of the runtime operations causes an error, executable code generated from unmodified representations of the high level constructs so the runtime operations of the high level constructs execute sequentially during runtime. | 17. A method for processing source code comprising: receiving source code; parsing the source code to obtain a high level intermediate representation of the source code; detecting, in the high level intermediate representation of the source code, high level constructs in the high level intermediate representation of the source code that satisfy constraints for parallel-merging high level constructs; and parallel-merging the high level constructs to generate new high level parallel-merged constructs in a modified high level intermediate representation of the source code that enable runtime operations of the high level constructs to execute in parallel using executable code generated from the modified high level intermediate representation; and executing, if the parallel execution of the runtime operations causes an error, executable code generated from unmodified representations of the high level constructs so the runtime operations of the high level constructs execute sequentially during runtime. 28. The method of claim 17 , wherein parallel-merging includes: merging constructs that are pure linear code in their lowered form to a most frequently taken control flow path in a control flow region for the single construct that when lowered is a control flow region; and providing fail-safe error correction support for instances when the most frequently taken control flow path is not taken. | 0.673013 |
9,715,333 | 54 | 59 | 54. The portable device of claim 37 , wherein the processor is programmed to control the display device to display a set of functional icons corresponding to different actions to be taken by the processor upon subsequent selection by the user. | 54. The portable device of claim 37 , wherein the processor is programmed to control the display device to display a set of functional icons corresponding to different actions to be taken by the processor upon subsequent selection by the user. 59. The portable device of claim 54 , wherein one of the functional icons in the set of functional icons corresponds to an action for causing the display device to display synonyms of the word at the text insertion point. | 0.956701 |
9,003,281 | 11 | 14 | 11. A help document generating method carried out by an image processing apparatus capable of executing a plurality of processes, the method comprising: accepting designation of at least one of said plurality of processes; generating a workflow defining said one or more processes accepted; storing help information associating for each of the plurality of processes a process name as identification information for identification of each of the plurality of processes with a process explanation as an explanation of each of the plurality of processes; generating a help document corresponding to said generated workflow; generating a summary page having listed thereon identification information for identification of each of said one or more processes defined by said generated workflow generated by said workflow generating; controlling display of the help document generated; reading one or more help information items corresponding respectively to the one or more process defined by the generated workflow to generate one or more details pages respectively including the one or more help information items read; associating identification information items of the one or more process included in the summary page with the one or more details pages generated; and when any of the identification information items of the one or more processes included in the summary page is designated, displaying the details page associated with the identification information items designated. | 11. A help document generating method carried out by an image processing apparatus capable of executing a plurality of processes, the method comprising: accepting designation of at least one of said plurality of processes; generating a workflow defining said one or more processes accepted; storing help information associating for each of the plurality of processes a process name as identification information for identification of each of the plurality of processes with a process explanation as an explanation of each of the plurality of processes; generating a help document corresponding to said generated workflow; generating a summary page having listed thereon identification information for identification of each of said one or more processes defined by said generated workflow generated by said workflow generating; controlling display of the help document generated; reading one or more help information items corresponding respectively to the one or more process defined by the generated workflow to generate one or more details pages respectively including the one or more help information items read; associating identification information items of the one or more process included in the summary page with the one or more details pages generated; and when any of the identification information items of the one or more processes included in the summary page is designated, displaying the details page associated with the identification information items designated. 14. The help document generating method according to claim 11 , further comprising: executing said one or more processes defined by said generated workflow; storing a history of the one or more processes executed; and when execution of said one or more processes defined by said workflow is interrupted before completion of all the processes and then said execution is restarted, modifying said summary page corresponding to said workflow based on said stored history. | 0.788999 |
8,744,197 | 5 | 8 | 5. A method comprising: acquiring at one or more servers, each of the servers having a processor and a memory, a plurality of eigenvectors, each having a corresponding eigenvalue, wherein the plurality of eigenvectors are based on a plurality of tokenized electronic documents having unstructured text, the plurality of tokenized electronic documents forming a data matrix, and the unstructured text includes background terms and nonbackground terms; and classifying the plurality of eigenvectors and their corresponding eigenvalues into one or more background eigenvectors and background eigenvalues, and one or more nonbackground eigenvectors and nonbackground eigenvalues, wherein the background eigenvectors correspond to the background terms and the nonbackground eigenvectors correspond to nonbackground terms; acquiring a threshold; comparing the nonbackground eigenvalues with the threshold; and providing the nonbackground eigenvectors whose corresponding nonbackground eigenvalues exceed the threshold, wherein the provided nonbackground eigenvectors are used for clustering the plurality of documents. | 5. A method comprising: acquiring at one or more servers, each of the servers having a processor and a memory, a plurality of eigenvectors, each having a corresponding eigenvalue, wherein the plurality of eigenvectors are based on a plurality of tokenized electronic documents having unstructured text, the plurality of tokenized electronic documents forming a data matrix, and the unstructured text includes background terms and nonbackground terms; and classifying the plurality of eigenvectors and their corresponding eigenvalues into one or more background eigenvectors and background eigenvalues, and one or more nonbackground eigenvectors and nonbackground eigenvalues, wherein the background eigenvectors correspond to the background terms and the nonbackground eigenvectors correspond to nonbackground terms; acquiring a threshold; comparing the nonbackground eigenvalues with the threshold; and providing the nonbackground eigenvectors whose corresponding nonbackground eigenvalues exceed the threshold, wherein the provided nonbackground eigenvectors are used for clustering the plurality of documents. 8. The method of claim 5 , wherein at least one of the acquired plurality of eigenvectors is generated by: constructing a guess eigenvector to a distributed matrix, wherein the distributed matrix is related to the data matrix and the transpose of the data matrix; partitioning the guess eigenvector into one or more sub-vectors; distributing the one or more sub-vectors to one or more server slaves that contain at least one tokenized electronic document; acquiring from the one or more server slaves, a second vector that corresponds to the multiplication of the sub-vector that was distributed to the server slave with the tokenized electronic document contained on that server slave; assembling the acquired vectors into a single reconstituted vector; determining whether the reconstituted vector is an eigenvector of the distributed matrix; and providing the reconstituted vector if it is an eigenvector of the distributed matrix. | 0.556505 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.