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
0.99
|
|---|---|---|---|---|---|
7,882,119 | 1 | 17 |
1. A document alignment method comprising: inputting source leaves of a source document in first tree structured format, the first tree structured format comprising nodes which are ultimately connected with the source leaves by paths, text content of the source document being distributed among the source leaves; inputting target leaves of a target document in second tree structured format, the second tree structured format comprising nodes which are ultimately connected with the target leaves by paths, text content of the target document being distributed among the target leaves; assigning a cost to each of a plurality of matches based on text content of the leaves, each match comprising elements selected from the group consisting of: a source leaf and a target leaf, an unmatched source leaf, and an unmatched target leaf; identifying a set of matches for which a total cost is minimal, wherein each of the input source and target leaves is in at least one of the identified matches; identifying, from the set of identified matches, groups of matches wherein each match in the group has a leaf in common; identifying, from the groups, probable matches in which more than one target leaf is matched with at least one source leaf and probable matches where more than one source leaf is matched with a target leaf; outputting an alignment between leaves of the target document and leaves of the source document which includes the probable matches.
|
1. A document alignment method comprising: inputting source leaves of a source document in first tree structured format, the first tree structured format comprising nodes which are ultimately connected with the source leaves by paths, text content of the source document being distributed among the source leaves; inputting target leaves of a target document in second tree structured format, the second tree structured format comprising nodes which are ultimately connected with the target leaves by paths, text content of the target document being distributed among the target leaves; assigning a cost to each of a plurality of matches based on text content of the leaves, each match comprising elements selected from the group consisting of: a source leaf and a target leaf, an unmatched source leaf, and an unmatched target leaf; identifying a set of matches for which a total cost is minimal, wherein each of the input source and target leaves is in at least one of the identified matches; identifying, from the set of identified matches, groups of matches wherein each match in the group has a leaf in common; identifying, from the groups, probable matches in which more than one target leaf is matched with at least one source leaf and probable matches where more than one source leaf is matched with a target leaf; outputting an alignment between leaves of the target document and leaves of the source document which includes the probable matches. 17. The method of claim 1 , wherein the source document is a natural language document and the target document is a natural language document in the same language and wherein the source and target leaves include text in the natural language.
| 0.900986 |
9,576,262 | 8 | 14 |
8. A system, comprising: a processor coupled to a memory, the processor configured to execute the following computer-executable components stored in the memory: a decision component that automatically predicts an outcome based on an input and a predictive model; a model builder component that automatically trains multiple predictive models comprising a hierarchical predictive model across multiple levels of granularity based on accumulated data; and a model selection component that activates for use to predict the outcome a root predictive model of the hierarchical predictive model and one or more child predictive model that outperforms a parent predictive model at a more specific level of granularity than the parent predictive model, wherein the parent predictive model is at an immediately preceding and more generic level in the hierarchy than the child predictive model.
|
8. A system, comprising: a processor coupled to a memory, the processor configured to execute the following computer-executable components stored in the memory: a decision component that automatically predicts an outcome based on an input and a predictive model; a model builder component that automatically trains multiple predictive models comprising a hierarchical predictive model across multiple levels of granularity based on accumulated data; and a model selection component that activates for use to predict the outcome a root predictive model of the hierarchical predictive model and one or more child predictive model that outperforms a parent predictive model at a more specific level of granularity than the parent predictive model, wherein the parent predictive model is at an immediately preceding and more generic level in the hierarchy than the child predictive model. 14. The system of claim 8 further comprises the decision component further predicts the outcome based on the input and a most specific predictive model that is active in the hierarchical predictive model and suited for a type of the input.
| 0.5 |
9,697,828 | 5 | 24 |
5. A computer-implemented method comprising: as implemented by one or more computing devices configured to execute specific instructions, obtaining from a client device: audio input comprising a plurality of portions of audio data, wherein less than all of the plurality of portions of audio data comprise audio data corresponding to a keyword detected by the client device; contextual information associated with the audio input; and information indicating a portion of audio data, of the plurality of portions of the audio data, that likely corresponds to the keyword; obtaining acoustic information and environmental information from the portion of audio data that likely corresponds to the keyword; determining that the portion of audio data corresponds to the keyword using a detection model configured to generate a detection score using the audio input, the contextual information, the environmental information, and the acoustic information, wherein a detection score satisfying a detection threshold indicates audio data corresponding to the keyword is present in the audio input; and performing an action corresponding to a request in the audio input.
|
5. A computer-implemented method comprising: as implemented by one or more computing devices configured to execute specific instructions, obtaining from a client device: audio input comprising a plurality of portions of audio data, wherein less than all of the plurality of portions of audio data comprise audio data corresponding to a keyword detected by the client device; contextual information associated with the audio input; and information indicating a portion of audio data, of the plurality of portions of the audio data, that likely corresponds to the keyword; obtaining acoustic information and environmental information from the portion of audio data that likely corresponds to the keyword; determining that the portion of audio data corresponds to the keyword using a detection model configured to generate a detection score using the audio input, the contextual information, the environmental information, and the acoustic information, wherein a detection score satisfying a detection threshold indicates audio data corresponding to the keyword is present in the audio input; and performing an action corresponding to a request in the audio input. 24. The computer-implemented method of claim 5 , wherein the detection model is a server-side detection model.
| 0.846369 |
5,539,427 | 14 | 15 |
14. Apparatus for indexing a segment of a stored document, comprising: a display for displaying at least one document; an input device for receiving index commands; a segment selector for selecting a segment of the document to be indexed; a storage device for storing coordinates and bounds of the segment as data for an index; an indexing processor for locating the index containing the coordinates and bounds of the segment and identifying the segment within the index; and a second display field for displaying the segment as an indexing entry by using the coordinates and bounds of the segment to retrieve the segment from the document.
|
14. Apparatus for indexing a segment of a stored document, comprising: a display for displaying at least one document; an input device for receiving index commands; a segment selector for selecting a segment of the document to be indexed; a storage device for storing coordinates and bounds of the segment as data for an index; an indexing processor for locating the index containing the coordinates and bounds of the segment and identifying the segment within the index; and a second display field for displaying the segment as an indexing entry by using the coordinates and bounds of the segment to retrieve the segment from the document. 15. The apparatus of claim 14 the segment selector comprises a hand-held stylus.
| 0.5 |
9,311,490 | 1 | 5 |
1. A method, comprising: sending, by a first computing device, to a second computing device, first communication data; receiving, by the first computing device, from the second computing device, second communication data; in response to determining that a data privacy attribute of the second computing device is equivalent to a predetermined data privacy attribute, protecting, by the first computing device, the second communication data, by at least: converting, by the first computing device, the first communication data to a first set of text; converting, by the first computing device, the second communication data to a second set of text; and applying, by the first computing device, a privacy filter to the first set of text to generate a first filtered set of filtered text by removing from the first set of text, any text that is repeated in the second set of text; determining, by the first computing device, a first keyword from the filtered set of text; sending, by the first computing device, to a third computing device, the first keyword; and receiving, by the first computing device, from the third computing device, contextual data associated with the first keyword.
|
1. A method, comprising: sending, by a first computing device, to a second computing device, first communication data; receiving, by the first computing device, from the second computing device, second communication data; in response to determining that a data privacy attribute of the second computing device is equivalent to a predetermined data privacy attribute, protecting, by the first computing device, the second communication data, by at least: converting, by the first computing device, the first communication data to a first set of text; converting, by the first computing device, the second communication data to a second set of text; and applying, by the first computing device, a privacy filter to the first set of text to generate a first filtered set of filtered text by removing from the first set of text, any text that is repeated in the second set of text; determining, by the first computing device, a first keyword from the filtered set of text; sending, by the first computing device, to a third computing device, the first keyword; and receiving, by the first computing device, from the third computing device, contextual data associated with the first keyword. 5. The method of claim 1 , wherein the predetermined data privacy attribute indicates that the second communication data is private data.
| 0.749084 |
8,706,742 | 1 | 29 |
1. A system for computerized derivation of leads from a huge body of data, the system comprising: an electronic repository including a multiplicity of accesses to a respective multiplicity of electronic documents and metadata including metadata parameters having metadata values characterizing each of said multiplicity of electronic documents; a document rater using a processor to run a first computer algorithm on said multiplicity of electronic documents which yields a score which rates each of said multiplicity of electronic documents; and a metadata-based document discriminator using the processor to run a second computer algorithm on at least some of said metadata which yields leads, each lead comprising at least one metadata value for at least one metadata parameter, whose value correlates with the score of said electronic documents, wherein said discriminator is operative to perform the following for each of a multiplicity of logical conditions defined over the individual documents' metadata: a. access a subset of said multiplicity of electronic documents wherein membership in said subset, of an individual document from among said multiplicity of electronic documents, is determined by whether or not a current logical condition defined over said individual documents' metadata, is true; b. compute at least one first value, including a proportion of documents having a relevance score whose value is “relevant”, over at least one subset; c. Provide a second value including a proportion of documents having a relevance score whose value is “relevant” from among all of said multiplicity of electronic documents; and d. compare said first value to the second value, define said logical condition defined over said individual documents' metadata as a lead when said first and second values differ by at least a predetermined extent and generate an output indication of the lead.
|
1. A system for computerized derivation of leads from a huge body of data, the system comprising: an electronic repository including a multiplicity of accesses to a respective multiplicity of electronic documents and metadata including metadata parameters having metadata values characterizing each of said multiplicity of electronic documents; a document rater using a processor to run a first computer algorithm on said multiplicity of electronic documents which yields a score which rates each of said multiplicity of electronic documents; and a metadata-based document discriminator using the processor to run a second computer algorithm on at least some of said metadata which yields leads, each lead comprising at least one metadata value for at least one metadata parameter, whose value correlates with the score of said electronic documents, wherein said discriminator is operative to perform the following for each of a multiplicity of logical conditions defined over the individual documents' metadata: a. access a subset of said multiplicity of electronic documents wherein membership in said subset, of an individual document from among said multiplicity of electronic documents, is determined by whether or not a current logical condition defined over said individual documents' metadata, is true; b. compute at least one first value, including a proportion of documents having a relevance score whose value is “relevant”, over at least one subset; c. Provide a second value including a proportion of documents having a relevance score whose value is “relevant” from among all of said multiplicity of electronic documents; and d. compare said first value to the second value, define said logical condition defined over said individual documents' metadata as a lead when said first and second values differ by at least a predetermined extent and generate an output indication of the lead. 29. The system according to claim 1 wherein said metadata-based document discriminator comprises Microsoft's dsofile.dllm.
| 0.940196 |
9,110,880 | 9 | 10 |
9. The system of claim 8 , wherein the candidate portion includes a homophone and the language model includes second contiguous sequence of items that includes a corresponding homophone.
|
9. The system of claim 8 , wherein the candidate portion includes a homophone and the language model includes second contiguous sequence of items that includes a corresponding homophone. 10. The system of claim 9 , wherein obtaining the acoustic score includes determining whether the candidate portion includes a homophone.
| 0.5 |
9,376,117 | 1 | 14 |
1. A system of a vehicle comprising: a sensor set including one or more sensors configured to measure sensor data describing a task and a driver of the vehicle; an onboard vehicle computer including a tangible memory, a processor, a task tracker and a familiarity application, wherein the task tracker and the familiarity application are stored in the tangible memory which is communicatively coupled to the processor; wherein the task tracker, responsive to being executed by the processor, causes the processor to determine, based on the sensor data describing the task, a vehicle operation to be proactively performed by the task tracker to autocomplete the task for the driver of the vehicle; wherein the familiarity application, responsive to being executed by the processor, causes the processor to: estimate how familiar the driver is with the vehicle operation based on the sensor data describing the driver of the vehicle; retrieve a template explanation associated with the vehicle operation; adapt the template explanation, based on the estimate of how familiar the driver is with the vehicle operation, to generate a driver familiarity adapted explanation describing the autocomplete of the vehicle operation; and provide the driver familiarity adapted explanation to the driver.
|
1. A system of a vehicle comprising: a sensor set including one or more sensors configured to measure sensor data describing a task and a driver of the vehicle; an onboard vehicle computer including a tangible memory, a processor, a task tracker and a familiarity application, wherein the task tracker and the familiarity application are stored in the tangible memory which is communicatively coupled to the processor; wherein the task tracker, responsive to being executed by the processor, causes the processor to determine, based on the sensor data describing the task, a vehicle operation to be proactively performed by the task tracker to autocomplete the task for the driver of the vehicle; wherein the familiarity application, responsive to being executed by the processor, causes the processor to: estimate how familiar the driver is with the vehicle operation based on the sensor data describing the driver of the vehicle; retrieve a template explanation associated with the vehicle operation; adapt the template explanation, based on the estimate of how familiar the driver is with the vehicle operation, to generate a driver familiarity adapted explanation describing the autocomplete of the vehicle operation; and provide the driver familiarity adapted explanation to the driver. 14. The system of claim 1 , wherein the familiarity application includes two or more template explanations for the vehicle operation and wherein the steps further comprise: determining which of the two or more template explanations were not used in a most recent performance of the vehicle operation by the task tracker; forming a set of one or more template explanations that were not used in the most recent performance of the vehicle operation by the task tracker; and wherein the retrieving step includes retrieving the template explanation from the set of one or more template explanations that were not used in the most recent performance of the vehicle operation by the task tracker.
| 0.5 |
9,111,011 | 8 | 13 |
8. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: responsive to obtaining a first query including one or more characters and a first user location where the first query was issued: identifying a first point of interest within a first predefined proximity to the first user location; identifying a second point of interest within a second predefined proximity to the first user location; determining a first category of the first point of interest and a second category of the second point of interest; identifying, using a database that maps categories to queries issued by users at locations within predefined proximities to points of interest having the first category, a first category-specific query suggestion in accordance with the first category and a second category-specific query suggest in accordance with the second category, including: determining a first category-specific count representing a total number of times the first query was issued by users from user locations having the first category; determining a second category-specific count representing a total number of times the first query was issued by users from user locations having the second category; and providing the first category-specific query suggestion in accordance with the first category-specific count and the second category-specific query suggestion in accordance with the second category-specific count, wherein the first category-specific query suggestion includes the one or more characters included in the first query, and the second category-specific query suggestion includes the one or more characters included in the first query; and providing, to a user, one or more query suggestions including the first category-specific query suggestion and the second category-specific query suggestion.
|
8. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: responsive to obtaining a first query including one or more characters and a first user location where the first query was issued: identifying a first point of interest within a first predefined proximity to the first user location; identifying a second point of interest within a second predefined proximity to the first user location; determining a first category of the first point of interest and a second category of the second point of interest; identifying, using a database that maps categories to queries issued by users at locations within predefined proximities to points of interest having the first category, a first category-specific query suggestion in accordance with the first category and a second category-specific query suggest in accordance with the second category, including: determining a first category-specific count representing a total number of times the first query was issued by users from user locations having the first category; determining a second category-specific count representing a total number of times the first query was issued by users from user locations having the second category; and providing the first category-specific query suggestion in accordance with the first category-specific count and the second category-specific query suggestion in accordance with the second category-specific count, wherein the first category-specific query suggestion includes the one or more characters included in the first query, and the second category-specific query suggestion includes the one or more characters included in the first query; and providing, to a user, one or more query suggestions including the first category-specific query suggestion and the second category-specific query suggestion. 13. The system of claim 8 , wherein determining a first category of the first point of interest comprises: identifying the first category in accordance with a database that maps points of interest to categories.
| 0.641156 |
8,528,018 | 16 | 19 |
16. An apparatus, comprising: a memory element configured to store data; a processor operable to execute instructions associated with the data; a connector configured to interface with the memory element and the processor, wherein the apparatus is configured for: evaluating a video file in a network environment; determining an identity of at least one speaker associated with the video file in order to generate an identity attribute; performing speech to text operations associated with the video file in order to generate at least one text attribute; generating a visual worthiness rating based, at least, on the identity attribute and the text attribute associated with the video file, wherein the visual worthiness rating is reflective of a visual significance of image content in the video file; rendering the visual worthiness rating to the end user prior to the video file being played; and wherein the additional attribute is generated and used in formulating the visual worthiness rating, the attribute being an author attribute reflective of authorship of the video file.
|
16. An apparatus, comprising: a memory element configured to store data; a processor operable to execute instructions associated with the data; a connector configured to interface with the memory element and the processor, wherein the apparatus is configured for: evaluating a video file in a network environment; determining an identity of at least one speaker associated with the video file in order to generate an identity attribute; performing speech to text operations associated with the video file in order to generate at least one text attribute; generating a visual worthiness rating based, at least, on the identity attribute and the text attribute associated with the video file, wherein the visual worthiness rating is reflective of a visual significance of image content in the video file; rendering the visual worthiness rating to the end user prior to the video file being played; and wherein the additional attribute is generated and used in formulating the visual worthiness rating, the attribute being an author attribute reflective of authorship of the video file. 19. The apparatus of claim 16 , wherein timestamps of the video file are captured in order to alert a particular user of specific sections of the video file having a particular visual worthiness rating.
| 0.512077 |
8,374,325 | 1 | 14 |
1. A system for bilingual communication between a first party and a second party through a remote live interpreter, comprising: a portable device for the first party communicating in a first language at a location-specific site comprising a microphone, an ear phone for the first party, a display screen, and a camera, wherein the portable device is configured to transmit via an internet network a request for a live interpreter of a selected different language to a network server that maintains a database of interpreters and languages able to be interpreted by interpreters, wherein the portable device for the first party receives user input indicative of identification of a communication device for a second party communicating in the selected different language at the location-specific site with the first party, wherein the portable device receives a second party communication in the selected different language from the communication device for the second party; and wherein, in response to the request for the live interpreter of the selected different language, the portable device establishes a connection via the internet network with a third party communication device for the remote live interpreter at a remote site and in communication with the network server, wherein the portable device transmits to the third party communication device a first party communication in the first language from the first party and the second party communication in the selected different language from the second party, and wherein the portable device is configured to transmit to the third party communication device an encrypted transmission of the second party communication in the selected different language and to receive from the third party communication device an encrypted transmission of the second party communication in the first language for output at the ear phone for the first party.
|
1. A system for bilingual communication between a first party and a second party through a remote live interpreter, comprising: a portable device for the first party communicating in a first language at a location-specific site comprising a microphone, an ear phone for the first party, a display screen, and a camera, wherein the portable device is configured to transmit via an internet network a request for a live interpreter of a selected different language to a network server that maintains a database of interpreters and languages able to be interpreted by interpreters, wherein the portable device for the first party receives user input indicative of identification of a communication device for a second party communicating in the selected different language at the location-specific site with the first party, wherein the portable device receives a second party communication in the selected different language from the communication device for the second party; and wherein, in response to the request for the live interpreter of the selected different language, the portable device establishes a connection via the internet network with a third party communication device for the remote live interpreter at a remote site and in communication with the network server, wherein the portable device transmits to the third party communication device a first party communication in the first language from the first party and the second party communication in the selected different language from the second party, and wherein the portable device is configured to transmit to the third party communication device an encrypted transmission of the second party communication in the selected different language and to receive from the third party communication device an encrypted transmission of the second party communication in the first language for output at the ear phone for the first party. 14. A method of using the system of claim 1 , comprising: receiving user input of a selection of language from a list on the display screen of the portable device; electronically connecting the portable device for the first party at the location-specific site with the third party communication device of the remote live interpreter at the remote site in a timely manner; and beginning a communication between the first party and the second party that flows similar to a two-way conversation in real time with each party receiving communication in the respective language of that party.
| 0.5 |
7,493,293 | 8 | 9 |
8. The method of claim 1 , wherein the terms within the document include terms of a chemical nature.
|
8. The method of claim 1 , wherein the terms within the document include terms of a chemical nature. 9. The method of claim 8 , wherein all the terms of a chemical nature within the document are identified.
| 0.5 |
9,462,351 | 14 | 15 |
14. The system of claim 12 , wherein the control circuitry is further configured to: transmit the media program with an audio track in the alternate language based on determining the media guidance data related to the media program is not available in the preferred language.
|
14. The system of claim 12 , wherein the control circuitry is further configured to: transmit the media program with an audio track in the alternate language based on determining the media guidance data related to the media program is not available in the preferred language. 15. The system of claim 14 , wherein the media program is available with audio tracks in both the alternate language and the preferred language.
| 0.5 |
9,026,430 | 11 | 17 |
11. An electronic device comprising: a storage unit, storing a basic corpus and a temporary corpus, the basic corpus recording a vast amount of vocabularies, words and phrases and the frequency of use of each word and each phrase, the temporary corpus recording the mapping relationship between at least one substitute vocabulary and at least one temporary meaning; an input unit, configured for generating signals in response to a user's input; a voice and character converting module, configured for converting the signals into a textualized message in a predetermined language; a language analysis module, configure for segmenting the textualized message into at least one vocabulary, obtaining at least one vocabularized segment comprising the at least one vocabulary, segmenting the textualized message based on the vocabularized segments and a sentence construction rule, obtaining at least one sentence segment, retrieving the frequency of use of each segmented vocabulary from the basic corpus, obtaining a first language understanding result of the textualized message by analyzing the at least one vocabularized segments and the at least one sentence segments, based on the retrieved frequency of use of each segmented vocabulary; a determination module, configured for selecting a plurality of textualized messages consecutively converted within a predetermined time period, the selected textualized messages including said textualized message segmented by the language analysis module and analyzing the selected textualized messages, using a contextual understanding method, so as to determine whether the first language understanding result is a reasonable understanding, determining at least one substitute vocabulary causing the unreasonable understanding, and determining whether the temporary corpus records the determined at least one substitute vocabulary; and an intelligent conversation module, configured for determining a reply message based on a reasonable language understanding result, the temporary corpus, and the basic corpus; wherein the language analysis module is further configured for determining temporary meaning of each determined substitute vocabulary not recorded in the temporary corpus by analyzing the context comprising the determined substitute vocabulary to obtain a second understanding result of the textualized message, and updating the temporary corpus by storing the mapping relationship between the determined at least one substitute vocabulary and the temporary meaning therein.
|
11. An electronic device comprising: a storage unit, storing a basic corpus and a temporary corpus, the basic corpus recording a vast amount of vocabularies, words and phrases and the frequency of use of each word and each phrase, the temporary corpus recording the mapping relationship between at least one substitute vocabulary and at least one temporary meaning; an input unit, configured for generating signals in response to a user's input; a voice and character converting module, configured for converting the signals into a textualized message in a predetermined language; a language analysis module, configure for segmenting the textualized message into at least one vocabulary, obtaining at least one vocabularized segment comprising the at least one vocabulary, segmenting the textualized message based on the vocabularized segments and a sentence construction rule, obtaining at least one sentence segment, retrieving the frequency of use of each segmented vocabulary from the basic corpus, obtaining a first language understanding result of the textualized message by analyzing the at least one vocabularized segments and the at least one sentence segments, based on the retrieved frequency of use of each segmented vocabulary; a determination module, configured for selecting a plurality of textualized messages consecutively converted within a predetermined time period, the selected textualized messages including said textualized message segmented by the language analysis module and analyzing the selected textualized messages, using a contextual understanding method, so as to determine whether the first language understanding result is a reasonable understanding, determining at least one substitute vocabulary causing the unreasonable understanding, and determining whether the temporary corpus records the determined at least one substitute vocabulary; and an intelligent conversation module, configured for determining a reply message based on a reasonable language understanding result, the temporary corpus, and the basic corpus; wherein the language analysis module is further configured for determining temporary meaning of each determined substitute vocabulary not recorded in the temporary corpus by analyzing the context comprising the determined substitute vocabulary to obtain a second understanding result of the textualized message, and updating the temporary corpus by storing the mapping relationship between the determined at least one substitute vocabulary and the temporary meaning therein. 17. The electronic device as described in claim 11 , wherein the determination module is further configured for determining whether current conversation between the electronic device and the user is over, and deleting the temporary corpus when the current conversation is over.
| 0.789514 |
8,826,199 | 1 | 29 |
1. A computer implemented method of developing a system architecture, performed by at least one processor of at least one computing device, comprising: defining, by the at least one processor, a plurality of resources constraints max N R1 , . . . max N Rn , for a plurality of kinds of resources R 1 . . . Rn, wherein each resource constraint maxN Ri is a maximum number of a kind of resource Ri available to construct the system architecture, wherein 1≦i≦n and n is an integer greater than 1; defining, by the at least one processor, a plurality of constraint values comprising a constraint value for each optimization parameter of at least three optimization parameters for the system architecture, wherein the at least three optimization parameters comprise a final optimization parameter; defining, by the at least one processor, a design space as a plurality of variants representing different combinations of a number of each kind of resource R 1 , Rn available to construct the system architecture, wherein each variant is a vector of the form:
V n =( N R1 , . . . N Rn ) wherein N Ri 1≦i≦n represents the number of the kind of resource Ri, wherein based on the resource constraints, 1≦N Ri ≦max N Ri ; determining, by the at least one processor, a plurality of satisfying sets of variants by, for each of the optimization parameters except for the final optimization parameter: generating a universe of discourse set by sorting the plurality of variants of the design space; assigning a membership value to each variant of the universe of discourse set, wherein each membership value is within an interval [0,1], wherein, for each respective variant of the universe of discourse set, the membership value assigned to said each respective variant indicates a position of said each respective variant in the universe of discourse set; determining a satisfying set of variants from the universe of discourse set by determining a border variant of the universe of discourse set, wherein each variant of the satisfying set substantially satisfies the constraint value for the optimization parameter, wherein the border variant is the last variant of the universe of discourse set to satisfy the constraint value for the optimization parameter such that all variants to one side of the border variant in the universe of discourse set satisfy the constraint value for the optimization parameter and all variants to the other side of the border variant in the universe of discourse set do not satisfy the constraint value for the optimization parameter, and wherein the border variant is determined by performing a fuzzy search of the universe of discourse set using the corresponding membership values; determining, by the at least one processor, a set of variants based on an intersection of the plurality of satisfying sets of variants for the optimization parameters except the final optimization parameter; for the final optimization parameter: generating an ordered list of variants by sorting the set of variants; selecting a variant from the set of variants based on a position of the variant in the ordered list of variants; and developing, using at least one of the at least one processor and at least one other computer hardware, the system architecture using the selected variant.
|
1. A computer implemented method of developing a system architecture, performed by at least one processor of at least one computing device, comprising: defining, by the at least one processor, a plurality of resources constraints max N R1 , . . . max N Rn , for a plurality of kinds of resources R 1 . . . Rn, wherein each resource constraint maxN Ri is a maximum number of a kind of resource Ri available to construct the system architecture, wherein 1≦i≦n and n is an integer greater than 1; defining, by the at least one processor, a plurality of constraint values comprising a constraint value for each optimization parameter of at least three optimization parameters for the system architecture, wherein the at least three optimization parameters comprise a final optimization parameter; defining, by the at least one processor, a design space as a plurality of variants representing different combinations of a number of each kind of resource R 1 , Rn available to construct the system architecture, wherein each variant is a vector of the form:
V n =( N R1 , . . . N Rn ) wherein N Ri 1≦i≦n represents the number of the kind of resource Ri, wherein based on the resource constraints, 1≦N Ri ≦max N Ri ; determining, by the at least one processor, a plurality of satisfying sets of variants by, for each of the optimization parameters except for the final optimization parameter: generating a universe of discourse set by sorting the plurality of variants of the design space; assigning a membership value to each variant of the universe of discourse set, wherein each membership value is within an interval [0,1], wherein, for each respective variant of the universe of discourse set, the membership value assigned to said each respective variant indicates a position of said each respective variant in the universe of discourse set; determining a satisfying set of variants from the universe of discourse set by determining a border variant of the universe of discourse set, wherein each variant of the satisfying set substantially satisfies the constraint value for the optimization parameter, wherein the border variant is the last variant of the universe of discourse set to satisfy the constraint value for the optimization parameter such that all variants to one side of the border variant in the universe of discourse set satisfy the constraint value for the optimization parameter and all variants to the other side of the border variant in the universe of discourse set do not satisfy the constraint value for the optimization parameter, and wherein the border variant is determined by performing a fuzzy search of the universe of discourse set using the corresponding membership values; determining, by the at least one processor, a set of variants based on an intersection of the plurality of satisfying sets of variants for the optimization parameters except the final optimization parameter; for the final optimization parameter: generating an ordered list of variants by sorting the set of variants; selecting a variant from the set of variants based on a position of the variant in the ordered list of variants; and developing, using at least one of the at least one processor and at least one other computer hardware, the system architecture using the selected variant. 29. The method of claim 1 wherein the system architecture comprises a Register Transfer Level control timing sequence.
| 0.956296 |
9,886,094 | 13 | 15 |
13. A gesture recognition engine comprising: a processor arranged to receive an input stream of image frames depicting an articulating entity; an instance level representation engine arranged to compute instance level features from individual ones of the image frames and to send the computed features to a trained machine learning system; and the processor arranged to receive in response at least one gesture class from a plurality of possible gesture classes; wherein the trained machine learning system comprises at least one multiple decision boundary classifier comprising a plurality of decision boundaries arranged to divide an instance level feature space into a plurality of regions, at least one region being associated with a gesture primitive; and wherein the instance level features are calculated from one or more instances where each instance is a temporally non-sequential subset of frames depicting a complete gesture of the gesture class made by the articulated entity.
|
13. A gesture recognition engine comprising: a processor arranged to receive an input stream of image frames depicting an articulating entity; an instance level representation engine arranged to compute instance level features from individual ones of the image frames and to send the computed features to a trained machine learning system; and the processor arranged to receive in response at least one gesture class from a plurality of possible gesture classes; wherein the trained machine learning system comprises at least one multiple decision boundary classifier comprising a plurality of decision boundaries arranged to divide an instance level feature space into a plurality of regions, at least one region being associated with a gesture primitive; and wherein the instance level features are calculated from one or more instances where each instance is a temporally non-sequential subset of frames depicting a complete gesture of the gesture class made by the articulated entity. 15. The gesture recognition engine of claim 13 comprising a body position engine arranged to compute body position features and a body part articulation state detector arranged to compute body part articulation state features.
| 0.695418 |
7,543,026 | 6 | 8 |
6. The method of claim 5 further comprising: receiving addressee information about an addressee to whom a message is intended at the e-mail address; and wherein the providing the suggested correction includes generating the suggested correction based on the addressee information, wherein the addressee information provides information in addition to the email address.
|
6. The method of claim 5 further comprising: receiving addressee information about an addressee to whom a message is intended at the e-mail address; and wherein the providing the suggested correction includes generating the suggested correction based on the addressee information, wherein the addressee information provides information in addition to the email address. 8. The method of claim 6 further comprising: gathering the addressee information from the message intended to the addressee.
| 0.5 |
8,504,560 | 6 | 8 |
6. A computing system comprising: one or more processors; and computer storage storing machine-executable instructions including one or more modules configured for execution by the one or more processors in order to cause the computing system to at least: receive, by the one or more processors, a first set of information identifying an input set of documents, said input set comprising a plurality of documents; identify, by the one or more processors, an additional document that is not a member of the input set, but which is citationally related to at least some of the documents in the input set; calculate, by the one or more processors, a data value that represents a degree to which said document is citationally related to at least some of the documents in the input set, said data value dependent upon at least (a) how many citational relationships exist at generations higher than a first generation between the input set of documents and said additional document, and (b) generation levels of said citational relationships, wherein calculating said data value comprises assigning different amounts of weight to citational relationships of different generation levels, said amounts of weight being based at least in part on a generational citation count determined for each of the different generation levels and an analysis in which multi-generation citational relationships between documents are used to predict existences of first generation citational relationships between documents, said analysis performed over a document population; and store the data value in computer storage in association with identifiers of the input set of documents.
|
6. A computing system comprising: one or more processors; and computer storage storing machine-executable instructions including one or more modules configured for execution by the one or more processors in order to cause the computing system to at least: receive, by the one or more processors, a first set of information identifying an input set of documents, said input set comprising a plurality of documents; identify, by the one or more processors, an additional document that is not a member of the input set, but which is citationally related to at least some of the documents in the input set; calculate, by the one or more processors, a data value that represents a degree to which said document is citationally related to at least some of the documents in the input set, said data value dependent upon at least (a) how many citational relationships exist at generations higher than a first generation between the input set of documents and said additional document, and (b) generation levels of said citational relationships, wherein calculating said data value comprises assigning different amounts of weight to citational relationships of different generation levels, said amounts of weight being based at least in part on a generational citation count determined for each of the different generation levels and an analysis in which multi-generation citational relationships between documents are used to predict existences of first generation citational relationships between documents, said analysis performed over a document population; and store the data value in computer storage in association with identifiers of the input set of documents. 8. The computing system of claim 6 , wherein the analysis performed over the document population comprises a statistical analysis.
| 0.887737 |
9,734,222 | 2 | 3 |
2. The method of claim 1 further comprising consulting the script if data in said result set is to be edited.
|
2. The method of claim 1 further comprising consulting the script if data in said result set is to be edited. 3. The method of claim 2 further comprising editing said data in the result set prior to the converting.
| 0.5 |
8,125,669 | 11 | 12 |
11. A method comprising: A processor examining graphic user interface (GUI) logic; identifying flaws in the logic that expose security damage; mapping a visual invariant to a program invariant; discovering inputs to GUI logic that include user actions and an execution context to cause the program invariant to be violated, the discovering comprising document object trees, active scripts, and user actions that cause the visual invariant to be violated; and constructing real visual spoofing attacks based on the inputs to GUI logic.
|
11. A method comprising: A processor examining graphic user interface (GUI) logic; identifying flaws in the logic that expose security damage; mapping a visual invariant to a program invariant; discovering inputs to GUI logic that include user actions and an execution context to cause the program invariant to be violated, the discovering comprising document object trees, active scripts, and user actions that cause the visual invariant to be violated; and constructing real visual spoofing attacks based on the inputs to GUI logic. 12. The method of claim 11 , wherein browser status bar spoofing is uncovered by examining source code for logic correctness of mouse-handling functionality of markup language elements.
| 0.587054 |
8,051,459 | 23 | 24 |
23. The system of claim 20 wherein the enforcement module includes a decision module configured for making access control decisions based on TC-related policies in addition to SELinux Type Enforcement.
|
23. The system of claim 20 wherein the enforcement module includes a decision module configured for making access control decisions based on TC-related policies in addition to SELinux Type Enforcement. 24. The system of claim 23 further comprising TC service functions configured for obtaining values of the TC-related attributes.
| 0.5 |
10,055,394 | 1 | 14 |
1. A method comprising: presenting a document in a graphical user interface of a document editing application on a display of a first user device associated with a first user; receiving, at the first user device, first information describing a first user modification to the document; in response to receiving the first information, changing the presentation of the document on the first user device to reflect the first user modification to the document; receiving, from a second user device, second information describing a second user modification to the document; in response to receiving the second information, changing the presentation of the document on the first user device to reflect the second user modification to the document; in accordance with an automatic determination that the first user modification to the document corresponds to the first user, forgoing presenting an animation associated with the first user modification to the document; and in accordance with an automatic determination that the second user modification to the document corresponds to a second user different from the first user, presenting an animation associated with the second user modification to the document.
|
1. A method comprising: presenting a document in a graphical user interface of a document editing application on a display of a first user device associated with a first user; receiving, at the first user device, first information describing a first user modification to the document; in response to receiving the first information, changing the presentation of the document on the first user device to reflect the first user modification to the document; receiving, from a second user device, second information describing a second user modification to the document; in response to receiving the second information, changing the presentation of the document on the first user device to reflect the second user modification to the document; in accordance with an automatic determination that the first user modification to the document corresponds to the first user, forgoing presenting an animation associated with the first user modification to the document; and in accordance with an automatic determination that the second user modification to the document corresponds to a second user different from the first user, presenting an animation associated with the second user modification to the document. 14. The method of claim 1 , wherein the second user modification comprises editing an image, and the animation comprises a shaking animation.
| 0.744565 |
9,734,109 | 1 | 5 |
1. A multi-channel, selectable identity tagging (MCSIT) data translator, comprising: a word monitor port configured to: receive a word generated by a specified one of a plurality of controllable components, wherein the word comprises a shared address that does not distinguish between the controllable components and that contains no identifying information for the specified controllable component; and generate a channel identifier (ID) uniquely identifying the specified controllable component and a word type corresponding to the word; and a channel ID tagger configured to determine whether to tag the word with the channel ID based on the word type and, based on the determination, to generate a processed word.
|
1. A multi-channel, selectable identity tagging (MCSIT) data translator, comprising: a word monitor port configured to: receive a word generated by a specified one of a plurality of controllable components, wherein the word comprises a shared address that does not distinguish between the controllable components and that contains no identifying information for the specified controllable component; and generate a channel identifier (ID) uniquely identifying the specified controllable component and a word type corresponding to the word; and a channel ID tagger configured to determine whether to tag the word with the channel ID based on the word type and, based on the determination, to generate a processed word. 5. The MCSIT data translator of claim 1 , wherein: the word monitor port is provided in an information processing (IP) core, the IP core comprises a plurality of input channels, each of the input channels configured to receive words from a corresponding one of the controllable components, and the word monitor port is configured to generate the channel ID based on which of the input channels is active when the word is received.
| 0.576772 |
7,913,228 | 28 | 29 |
28. The method of claim 27 , further comprising generating translations in one or more alternative languages for a documentation system.
|
28. The method of claim 27 , further comprising generating translations in one or more alternative languages for a documentation system. 29. The method of claim 28 , further comprising switching between the one or more alternative languages.
| 0.5 |
8,620,663 | 1 | 3 |
1. A speech synthesis system comprising a server device and a client device connected so as to be capable of communicating with each other, wherein: the server device includes: a speech element information storing unit configured to store speech element information and speech element identification information in association with each other so that, in a case that speech element information representing respective speech elements included in speech uttered by a speech registering user are arranged in the order of arrangement of the speech elements in the speech, at least one of the speech element identification information identifying the respective speech element information has different information from information arranged in accordance with a predetermined rule; a speech-element-identification-information receiving unit configured to receive the speech element identification information from the client device; and a speech element information transmitting unit configured to transmit the speech element information stored in association with the received speech element identification information to the client device; and the client device includes: a speech-element-identification-information storing unit configured to store speech element specification information specifying a speech element and the speech element identification information in association with each other; a text information accepting unit configured to accept text information representing text; a speech-element-identification-information transmitting unit configured to generate speech element specification information based on the accepted text information, and transmit speech element identification information stored in association with the generated speech element specification information, to the server device; and a speech synthesizing unit configured to receive speech element information from the server device and, based on the received speech element information, generate speech information obtained by converting text represented by the accepted text information into speech, wherein: the speech element identification information is information representing an integer; and the speech element information storing unit is configured to store the speech element information and the speech element identification information in association with each other so that, in a case that integers represented by the speech element identification information corresponding to speech elements are arranged in the order of arrangement of the speech elements in the speech, the integers include a pair of two adjacent integers in which an integer at the end has a different value from a value obtained by adding 1 to an integer at the beginning.
|
1. A speech synthesis system comprising a server device and a client device connected so as to be capable of communicating with each other, wherein: the server device includes: a speech element information storing unit configured to store speech element information and speech element identification information in association with each other so that, in a case that speech element information representing respective speech elements included in speech uttered by a speech registering user are arranged in the order of arrangement of the speech elements in the speech, at least one of the speech element identification information identifying the respective speech element information has different information from information arranged in accordance with a predetermined rule; a speech-element-identification-information receiving unit configured to receive the speech element identification information from the client device; and a speech element information transmitting unit configured to transmit the speech element information stored in association with the received speech element identification information to the client device; and the client device includes: a speech-element-identification-information storing unit configured to store speech element specification information specifying a speech element and the speech element identification information in association with each other; a text information accepting unit configured to accept text information representing text; a speech-element-identification-information transmitting unit configured to generate speech element specification information based on the accepted text information, and transmit speech element identification information stored in association with the generated speech element specification information, to the server device; and a speech synthesizing unit configured to receive speech element information from the server device and, based on the received speech element information, generate speech information obtained by converting text represented by the accepted text information into speech, wherein: the speech element identification information is information representing an integer; and the speech element information storing unit is configured to store the speech element information and the speech element identification information in association with each other so that, in a case that integers represented by the speech element identification information corresponding to speech elements are arranged in the order of arrangement of the speech elements in the speech, the integers include a pair of two adjacent integers in which an integer at the end has a different value from a value obtained by adding 1 to an integer at the beginning. 3. The speech synthesis system according to claim 1 , wherein the speech element information storing unit is configured to store the speech element information and the speech element identification information in association with each other so that an integer represented by speech element identification information corresponding to one of two similar speech elements becomes a value obtained by adding 1 to an integer represented by speech element identification information corresponding to the other of the two similar speech elements.
| 0.5 |
8,537,983 | 8 | 14 |
8. A tangible computer-readable storage medium comprising computer-executable instructions configured to cause at least one computer processor to: analyze an audio communication between a first party and a second party to develop a transcript of the audio communication; analyze words spoken during the audio communication to develop a set of keywords, in which the set of keywords comprises a subset of the words spoken during the audio communication; provide a graphical user interface (“GUI”) to display on a computer monitor, the GUI comprising a timeline representing the audio communication; display a plurality of sets of icons on the GUI in conjunction with the timeline, wherein each set of icons comprises a text-based icon and an audio-based icon representing an occurrence of a keyword in the audio communication, the keyword being from the set of keywords and the text-based icon and the audio-based icon being displayed on the GUI at one or more locations with respect to the timeline proximate to a time of the occurrence of the keyword in the audio communication; receive an input from a user as a result of the user selecting a particular text-based icon or a particular audio-based icon representing a particular occurrence of a particular keyword in the audio communication; and after receiving the input: display a portion of the transcript containing the particular occurrence of the particular keyword if the user selected the particular text-based icon representing the particular occurrence of the particular keyword; and play a portion of the audio communication containing the particular occurrence of the particular keyword if the user selected the particular audio-based icon representing the particular occurrence of the particular keyword.
|
8. A tangible computer-readable storage medium comprising computer-executable instructions configured to cause at least one computer processor to: analyze an audio communication between a first party and a second party to develop a transcript of the audio communication; analyze words spoken during the audio communication to develop a set of keywords, in which the set of keywords comprises a subset of the words spoken during the audio communication; provide a graphical user interface (“GUI”) to display on a computer monitor, the GUI comprising a timeline representing the audio communication; display a plurality of sets of icons on the GUI in conjunction with the timeline, wherein each set of icons comprises a text-based icon and an audio-based icon representing an occurrence of a keyword in the audio communication, the keyword being from the set of keywords and the text-based icon and the audio-based icon being displayed on the GUI at one or more locations with respect to the timeline proximate to a time of the occurrence of the keyword in the audio communication; receive an input from a user as a result of the user selecting a particular text-based icon or a particular audio-based icon representing a particular occurrence of a particular keyword in the audio communication; and after receiving the input: display a portion of the transcript containing the particular occurrence of the particular keyword if the user selected the particular text-based icon representing the particular occurrence of the particular keyword; and play a portion of the audio communication containing the particular occurrence of the particular keyword if the user selected the particular audio-based icon representing the particular occurrence of the particular keyword. 14. The tangible computer-readable storage medium of claim 8 , wherein the GUI displays an information resource icon at a location with respect to the timeline proximate to a time when the first party accessed an information resource during the audio communication.
| 0.736581 |
8,332,383 | 54 | 55 |
54. A computer-implemented method to process a data search request, the method including: receiving the data search request, the data search request including a plurality of constraints that includes a first keyword; associating the first keyword to at least one category; performing a search of a data source based on the data search request to find and count a number of data items; formulating a search definition that includes the at least one category in response to an identification of the number of data items in excess of a predetermined threshold minimum number of data items, the search definition formulated to exclude at least one constraint of the plurality of constraints; performing a search of the data source based on the search definition; and calculating a data item count corresponding to the search definition.
|
54. A computer-implemented method to process a data search request, the method including: receiving the data search request, the data search request including a plurality of constraints that includes a first keyword; associating the first keyword to at least one category; performing a search of a data source based on the data search request to find and count a number of data items; formulating a search definition that includes the at least one category in response to an identification of the number of data items in excess of a predetermined threshold minimum number of data items, the search definition formulated to exclude at least one constraint of the plurality of constraints; performing a search of the data source based on the search definition; and calculating a data item count corresponding to the search definition. 55. The computer-implemented method of claim 54 , wherein the plurality of constraints includes a second keyword that is utilized in the search definition.
| 0.5 |
9,626,081 | 18 | 24 |
18. A computer program product comprising a storage medium embodied with computer program instructions that when executed by a computer cause the computer to implement: receiving a geographic location indicator associated with a plurality of geographic location-based rules stored in a database; monitoring a user input interface of an interactive user display for a user input string comprising a minimum number of characters; generating a suggestion request to retrieve a data set from the plurality of geographic location-based rules stored in the database that match the geographic location indicator and the user input string based on determining that the user input string includes at least the minimum number of characters, the geographic location-based rules constraining a plurality of numeric classification codes and corresponding descriptions based on the geographic location indicator, and a same numeric classification code having a different corresponding description defined by the geographic location-based rules; receiving the data set in response to the suggestion request; formatting the data set as a list comprising one or more entries, each of the entries comprising one of the numeric classification codes and one of the corresponding descriptions based on the geographic location indicator; and outputting the list on the interactive user display as one or more user selectable instances of the one or more entries.
|
18. A computer program product comprising a storage medium embodied with computer program instructions that when executed by a computer cause the computer to implement: receiving a geographic location indicator associated with a plurality of geographic location-based rules stored in a database; monitoring a user input interface of an interactive user display for a user input string comprising a minimum number of characters; generating a suggestion request to retrieve a data set from the plurality of geographic location-based rules stored in the database that match the geographic location indicator and the user input string based on determining that the user input string includes at least the minimum number of characters, the geographic location-based rules constraining a plurality of numeric classification codes and corresponding descriptions based on the geographic location indicator, and a same numeric classification code having a different corresponding description defined by the geographic location-based rules; receiving the data set in response to the suggestion request; formatting the data set as a list comprising one or more entries, each of the entries comprising one of the numeric classification codes and one of the corresponding descriptions based on the geographic location indicator; and outputting the list on the interactive user display as one or more user selectable instances of the one or more entries. 24. The computer program product of claim 18 , wherein the data set received in response to the suggestion request further comprises a synonym match of the user input string.
| 0.857377 |
9,805,126 | 1 | 5 |
1. A method comprising, by one or more computer systems of a social-networking system: receiving, from a client device of a first user of the social-networking system, a search query comprising one or more characters inputted by the first user, the one or more characters being received as the first user inputs the one or more characters at the client device into a user interface of the social-networking system; identifying one or more entities associated with the social-networking system matching the one or more characters of the search query; ranking each of the identified entities matching the search query based on a calculated likelihood that the user will interact with a search result corresponding to the identified entity, wherein the calculated likelihood that the user will interact with the search result corresponding to the identified entity is based at least in part on a historical behavior of the user in selecting one or more prior search results related to the identified entity; boosting one or more ranks of one or more of the identified entities matching the search query based on: one or more business objectives of the social-networking system, wherein at least one of the business objectives comprises encouraging the first user to interact with the identified entity based on a level of social relevance of the identified entity with respect to the first user; and a level of the user's interaction with one or more features of the social-networking system associated with the identified entity, wherein the boosting is designed to increase the level of the user's interaction with the one or more features of the social-networking system associated with the identified entity; and sending, to the client device of the first user and in response to the received search query, one or more search results for presentation to the user as the user inputs the one or more characters at the client device into the user interface, each search result corresponding to one of the identified entities, the search results being presented according to the ranking and boosting of the corresponding identified entities, the presentation of the search results to the user enabling the user to select one or more of the search results to interact with.
|
1. A method comprising, by one or more computer systems of a social-networking system: receiving, from a client device of a first user of the social-networking system, a search query comprising one or more characters inputted by the first user, the one or more characters being received as the first user inputs the one or more characters at the client device into a user interface of the social-networking system; identifying one or more entities associated with the social-networking system matching the one or more characters of the search query; ranking each of the identified entities matching the search query based on a calculated likelihood that the user will interact with a search result corresponding to the identified entity, wherein the calculated likelihood that the user will interact with the search result corresponding to the identified entity is based at least in part on a historical behavior of the user in selecting one or more prior search results related to the identified entity; boosting one or more ranks of one or more of the identified entities matching the search query based on: one or more business objectives of the social-networking system, wherein at least one of the business objectives comprises encouraging the first user to interact with the identified entity based on a level of social relevance of the identified entity with respect to the first user; and a level of the user's interaction with one or more features of the social-networking system associated with the identified entity, wherein the boosting is designed to increase the level of the user's interaction with the one or more features of the social-networking system associated with the identified entity; and sending, to the client device of the first user and in response to the received search query, one or more search results for presentation to the user as the user inputs the one or more characters at the client device into the user interface, each search result corresponding to one of the identified entities, the search results being presented according to the ranking and boosting of the corresponding identified entities, the presentation of the search results to the user enabling the user to select one or more of the search results to interact with. 5. The method of claim 1 , wherein the search results are provided as real-time suggestions responsive to the one or more characters thus far inputted by the first user.
| 0.850177 |
7,743,079 | 9 | 14 |
9. A computer implemented system for managing data across a semantic data view and a presentation data view, the system comprising: a memory storage; and a processing unit coupled to the memory storage, wherein the processing unit is operative to: maintain a semantic model corresponding to the semantic data view, the semantic model having at least one node including at least one sub-node; maintain a presentation model corresponding to the presentation data view, the presentation model corresponding to a graphical representation of the semantic model, the presentation model including at least one shape corresponding to the at least one node, the presentation model configured to select the at least one shape when at least one of the following are selected in the semantic data view: the at least one node and the at least one sub-node; operate on the semantic model and the presentation model according to a received command, wherein operating on the semantic model and the presentation model comprises performing operations on both the presentation data view and the semantic data view, wherein performing operation on both the presentation data view and the semantic data view comprises displaying a first unfocused representation of the at least one node in the semantic data view in response to the received command comprising a selection of at least one shape in the presentation data view, wherein the at least one node of the semantic data view corresponds to the at least one shape of the presentation data view; and switch between the presentation data view and the semantic data view, wherein in response to a switch between the presentation data view and the semantic data view, the processing unit being further operative to: display an insertion point at the at least one node of the semantic data view in response to the switch to the semantic data view from the presentation data view, the at least one node of the semantic data view corresponding to the at least one shape of the presentation view and having text associated with the at least one shape, wherein the at least one shape is displayed in the presentation data view in a second unfocused representation.
|
9. A computer implemented system for managing data across a semantic data view and a presentation data view, the system comprising: a memory storage; and a processing unit coupled to the memory storage, wherein the processing unit is operative to: maintain a semantic model corresponding to the semantic data view, the semantic model having at least one node including at least one sub-node; maintain a presentation model corresponding to the presentation data view, the presentation model corresponding to a graphical representation of the semantic model, the presentation model including at least one shape corresponding to the at least one node, the presentation model configured to select the at least one shape when at least one of the following are selected in the semantic data view: the at least one node and the at least one sub-node; operate on the semantic model and the presentation model according to a received command, wherein operating on the semantic model and the presentation model comprises performing operations on both the presentation data view and the semantic data view, wherein performing operation on both the presentation data view and the semantic data view comprises displaying a first unfocused representation of the at least one node in the semantic data view in response to the received command comprising a selection of at least one shape in the presentation data view, wherein the at least one node of the semantic data view corresponds to the at least one shape of the presentation data view; and switch between the presentation data view and the semantic data view, wherein in response to a switch between the presentation data view and the semantic data view, the processing unit being further operative to: display an insertion point at the at least one node of the semantic data view in response to the switch to the semantic data view from the presentation data view, the at least one node of the semantic data view corresponding to the at least one shape of the presentation view and having text associated with the at least one shape, wherein the at least one shape is displayed in the presentation data view in a second unfocused representation. 14. The computer implemented system of claim 9 , further comprising the processing unit being operative to receive tabbing input configured to tab through shapes in the presentation data view wherein a hierarchal tabbing order for tabbing through the shapes is determined by the semantic model.
| 0.565089 |
7,613,731 | 70 | 89 |
70. A computer system for presenting an electronic document to a viewer to facilitate comprehension and control display and speed of delivery, the computer system including a computer program product, the computer program product comprising: program instructions that group selected words into a cognitive cluster to be treated as a single word; program instructions that assign an emphasis value to each word and cognitive cluster in the electronic document using a knowledge database thereby generating a first tagged file of assigned emphasis values for each word and cognitive cluster; program instructions that process the first tagged file, including deriving emphasis values for recognizability and comprehensibility, to generate a second tagged file of derived emphasis values; program instructions that process the second tagged file, including facilitating editing of properties of selected words and cognitive clusters in the electronic document, to generate a property deliverable file that dynamically controls the presentation of the electronic document to the viewer; a printer or an electronic display device; and program instructions that present the electronic document to the viewer on the electronic display device or to the printer.
|
70. A computer system for presenting an electronic document to a viewer to facilitate comprehension and control display and speed of delivery, the computer system including a computer program product, the computer program product comprising: program instructions that group selected words into a cognitive cluster to be treated as a single word; program instructions that assign an emphasis value to each word and cognitive cluster in the electronic document using a knowledge database thereby generating a first tagged file of assigned emphasis values for each word and cognitive cluster; program instructions that process the first tagged file, including deriving emphasis values for recognizability and comprehensibility, to generate a second tagged file of derived emphasis values; program instructions that process the second tagged file, including facilitating editing of properties of selected words and cognitive clusters in the electronic document, to generate a property deliverable file that dynamically controls the presentation of the electronic document to the viewer; a printer or an electronic display device; and program instructions that present the electronic document to the viewer on the electronic display device or to the printer. 89. The computer system for presenting an electronic document of claim 70 wherein the computer program product further comprises program instructions that enable editing of the derived recognizability value and the derived comprehensibility value for each word or a portion of the electronic document.
| 0.550746 |
9,275,147 | 10 | 11 |
10. The method of claim 1 , further comprising: providing instructions to the user device that, when executed by the user device, cause the user device to display a user interface for a mapping application, the user interface including a user interface element for receiving queries from a user and a displayed map; receiving an indication from the user device that a user has selected a query suggestions; and providing instructions to the user device to update the displayed map based on the selected query suggestion.
|
10. The method of claim 1 , further comprising: providing instructions to the user device that, when executed by the user device, cause the user device to display a user interface for a mapping application, the user interface including a user interface element for receiving queries from a user and a displayed map; receiving an indication from the user device that a user has selected a query suggestions; and providing instructions to the user device to update the displayed map based on the selected query suggestion. 11. The method of claim 10 , wherein the general query suggestions are category labels and the specific query suggestions are geographic locations, and wherein the general query suggestions are stored in a query repository including data matching each general query suggestion with one or more specific query suggestions.
| 0.5 |
7,668,806 | 1 | 2 |
1. A method of processing a query, comprising the computer-implemented steps of: receiving the query, wherein the query specifies certain operations to be performed, wherein the certain operations comprise a first set of one or more operations that are to be performed on a markup language data source; wherein the first set of one or more operations includes a second set of one or more operations; determining that the first set of one or more operations can be performed at any one of a plurality of entities; wherein the plurality of entities includes one or more of an XML database server, a relational database server, and a middle-tier engine; generating a plurality of execution plans for executing the query, wherein the plurality of execution plans include: a first execution plan indicating a first entity at which the second set of one or more operations are to be performed; and a second execution plan indicating a second entity at which the second set of one or more operations are to be performed; selecting, based on a particular set of criteria, a particular execution plan from the plurality of execution plans; wherein selecting the particular execution plan from the plurality of execution plans comprises one or more of: selecting the particular execution plan based at least in part on costs determined for the plurality of execution plans; and selecting the particular execution plan by using one or more rules to determine which execution plan, of the plurality of execution plans, to use for executing the query; wherein the selected particular execution plan indicates a first server at which the second set of one or more operations are to be performed; determining that a third set of one or more operations are to be performed at the middle-tier engine, wherein the first set of one or more operations include all operations in the third set of one or more operations, and the third set of one or more operations include no operation that are in the second set of one or more operations; sending a request to the first server to perform the second set of one or more operations; receiving a response to the request, wherein the response contains results of performing the second set of one or more operations on the markup language data source; and generating results for the query based at least in part on the results of performing the second set of one or more operations; wherein the steps of generating the plurality of execution plans and selecting the particular execution plan are performed by one or more computing devices.
|
1. A method of processing a query, comprising the computer-implemented steps of: receiving the query, wherein the query specifies certain operations to be performed, wherein the certain operations comprise a first set of one or more operations that are to be performed on a markup language data source; wherein the first set of one or more operations includes a second set of one or more operations; determining that the first set of one or more operations can be performed at any one of a plurality of entities; wherein the plurality of entities includes one or more of an XML database server, a relational database server, and a middle-tier engine; generating a plurality of execution plans for executing the query, wherein the plurality of execution plans include: a first execution plan indicating a first entity at which the second set of one or more operations are to be performed; and a second execution plan indicating a second entity at which the second set of one or more operations are to be performed; selecting, based on a particular set of criteria, a particular execution plan from the plurality of execution plans; wherein selecting the particular execution plan from the plurality of execution plans comprises one or more of: selecting the particular execution plan based at least in part on costs determined for the plurality of execution plans; and selecting the particular execution plan by using one or more rules to determine which execution plan, of the plurality of execution plans, to use for executing the query; wherein the selected particular execution plan indicates a first server at which the second set of one or more operations are to be performed; determining that a third set of one or more operations are to be performed at the middle-tier engine, wherein the first set of one or more operations include all operations in the third set of one or more operations, and the third set of one or more operations include no operation that are in the second set of one or more operations; sending a request to the first server to perform the second set of one or more operations; receiving a response to the request, wherein the response contains results of performing the second set of one or more operations on the markup language data source; and generating results for the query based at least in part on the results of performing the second set of one or more operations; wherein the steps of generating the plurality of execution plans and selecting the particular execution plan are performed by one or more computing devices. 2. The method of claim 1 , wherein selecting based on the particular set of criteria comprises: determining a first set of costs associated with performing the first set of one or more operations at the first server; determining a second set of costs associated with performing the first set of one or more operations at the middle-tier engine; and wherein the particular set of criteria comprises the first set of costs and the second set of costs.
| 0.811977 |
10,025,803 | 2 | 5 |
2. The method of claim 1 wherein: the group definition syntax provides for assignment of a group ID to each defined group; the group IDs can be used in SQL functions as an argument in SQL functions in place of a column name; the defining of the first group of columns includes assignment of a first group ID to the first group of columns; and the performance of the first group function includes placing the first group ID into an argument portion of an SQL function.
|
2. The method of claim 1 wherein: the group definition syntax provides for assignment of a group ID to each defined group; the group IDs can be used in SQL functions as an argument in SQL functions in place of a column name; the defining of the first group of columns includes assignment of a first group ID to the first group of columns; and the performance of the first group function includes placing the first group ID into an argument portion of an SQL function. 5. The method of claim 2 wherein: the table definition syntax includes listing an ordered list of column name assignments; and the group definition syntax includes placing delimiting characters within the ordered list of column names to delimit the groups.
| 0.520599 |
9,887,891 | 1 | 12 |
1. A system for generating a graph segment providing a gist or summary of an online social network conversation, the system comprising: a processor; a memory; a module stored in the memory and operable on the processor for generating a graph segment providing a gist or summary of an online social network conversation, the module being configured to cause the processor to perform a set of functions comprising: generating a graph of the online social network conversation, wherein the graph of the online social network conversation comprises a plurality of nodes and each node connecting at least one other node by an edge, each node representing a message of the online social network conversation and each edge corresponding to an action by a participant in the online social network conversation; determining an edge weight for each edge; analyzing the graph of the online social network conversation using at least the edge weight of at least some of the edges to generate a graph segment; and generating the graph segment, the graph segment comprising a reduced number of nodes of the graph of the online social network conversation based on analyzing the graph of the online social network conversation and the graph segment providing a gist or summary comprising an abbreviated view of the online social network conversation based on the analysis, each node of the reduced number of nodes corresponding to its own respective node of the graph of the online social network conversation.
|
1. A system for generating a graph segment providing a gist or summary of an online social network conversation, the system comprising: a processor; a memory; a module stored in the memory and operable on the processor for generating a graph segment providing a gist or summary of an online social network conversation, the module being configured to cause the processor to perform a set of functions comprising: generating a graph of the online social network conversation, wherein the graph of the online social network conversation comprises a plurality of nodes and each node connecting at least one other node by an edge, each node representing a message of the online social network conversation and each edge corresponding to an action by a participant in the online social network conversation; determining an edge weight for each edge; analyzing the graph of the online social network conversation using at least the edge weight of at least some of the edges to generate a graph segment; and generating the graph segment, the graph segment comprising a reduced number of nodes of the graph of the online social network conversation based on analyzing the graph of the online social network conversation and the graph segment providing a gist or summary comprising an abbreviated view of the online social network conversation based on the analysis, each node of the reduced number of nodes corresponding to its own respective node of the graph of the online social network conversation. 12. The system of claim 1 , wherein determining the edge weight for each edge comprises weighting edges associated with more recent messages higher than edges associated with older messages.
| 0.896175 |
10,152,319 | 11 | 16 |
11. One or more tangible, machine-readable, non-transitory media storing instructions that, when executed by one or more hardware processors, effectuate operations comprising: causing an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtaining an instance of the ontology, wherein the ontology instance comprises information indicating attributes for an application of the set of applications; using the ontology instance to generate supplemental information for the running executable program, wherein the supplemental information defines one or more functionalities of the application; extracting class information from the ontology; using the class information to generate a programming interface, wherein the programming interface allows the executable program to access the supplemental information; and providing the supplemental information as input to the running executable program via the programming interface, wherein the supplemental information, at least in part, causes the one or more functionalities of the application to be made available via the running executable program.
|
11. One or more tangible, machine-readable, non-transitory media storing instructions that, when executed by one or more hardware processors, effectuate operations comprising: causing an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtaining an instance of the ontology, wherein the ontology instance comprises information indicating attributes for an application of the set of applications; using the ontology instance to generate supplemental information for the running executable program, wherein the supplemental information defines one or more functionalities of the application; extracting class information from the ontology; using the class information to generate a programming interface, wherein the programming interface allows the executable program to access the supplemental information; and providing the supplemental information as input to the running executable program via the programming interface, wherein the supplemental information, at least in part, causes the one or more functionalities of the application to be made available via the running executable program. 16. The media of claim 11 , wherein the instructions further effectuate operations comprising: extracting axiom information from the ontology, and using the axiom information to generate a set of logic rules, wherein at least part of the supplemental information is generated using the set of logic rules.
| 0.5 |
7,684,619 | 1 | 3 |
1. A method for providing text flow around a non-rectangular graphic, comprising: using a processor to find the intersection, if any, between a proposed text rectangle and the graphic; and using the processor to identify as a valid text area within the proposed text rectangle a valid rectangle, if any, that is not within the bounds in the x-direction of an area of intersection between the proposed text rectangle and the graphic; and further comprising, in the event no valid text area is found, using the processor to look ahead by: extending the bottom of the proposed rectangle to the bottom of the graphic to form an extended rectangle; uniting the graphic with the extended rectangle; subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle; skipping ahead in the y-direction by a distance equal to the bottom of the extended rectangle minus the bottom of the proposed rectangle if the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle is empty; and skipping ahead in the y-direction by a distance equal to the top of the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle minus the bottom of the proposed rectangle if the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle is not empty.
|
1. A method for providing text flow around a non-rectangular graphic, comprising: using a processor to find the intersection, if any, between a proposed text rectangle and the graphic; and using the processor to identify as a valid text area within the proposed text rectangle a valid rectangle, if any, that is not within the bounds in the x-direction of an area of intersection between the proposed text rectangle and the graphic; and further comprising, in the event no valid text area is found, using the processor to look ahead by: extending the bottom of the proposed rectangle to the bottom of the graphic to form an extended rectangle; uniting the graphic with the extended rectangle; subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle; skipping ahead in the y-direction by a distance equal to the bottom of the extended rectangle minus the bottom of the proposed rectangle if the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle is empty; and skipping ahead in the y-direction by a distance equal to the top of the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle minus the bottom of the proposed rectangle if the result of subtracting the graphic and the proposed rectangle from the union of the graphic with the extended rectangle is not empty. 3. A method as recited in claim 1 , wherein identifying as a valid text area within the proposed text rectangle a valid rectangle, if any, that is not within the bounds in the x-direction of an area of intersection between the proposed text rectangle and the graphic includes determining the bounds in the x-direction of each area of intersection and considering each such area of intersection to be a hole within which text may not be included.
| 0.572115 |
9,009,090 | 1 | 3 |
1. A method comprises: storing a plurality of models in a database, with the models of a type that produce predictions of the likelihood of an event occurring in the future, the models having permission levels that specify the access rights to control access to the models by users; receiving a search query to search the database that stores the plurality of models, with the models having the permission levels that specify access rights that control access to the models in the database by users, executing the search query to produce search results that are provided based on search terms included in the search query; sending by a computer system the search results to a user system; receiving by the computer system a selection of a model from the search results; and sending by a computer system a message to the user system, the message based on the access rights associated with the model, with the message including at least one option to access the model.
|
1. A method comprises: storing a plurality of models in a database, with the models of a type that produce predictions of the likelihood of an event occurring in the future, the models having permission levels that specify the access rights to control access to the models by users; receiving a search query to search the database that stores the plurality of models, with the models having the permission levels that specify access rights that control access to the models in the database by users, executing the search query to produce search results that are provided based on search terms included in the search query; sending by a computer system the search results to a user system; receiving by the computer system a selection of a model from the search results; and sending by a computer system a message to the user system, the message based on the access rights associated with the model, with the message including at least one option to access the model. 3. The method of claim 1 further comprising: rendering a user interface that provides a listing of models in response to the search query, with the listing including a model type, a text field that contains a summary of a model description, and at least one access rights level.
| 0.5 |
9,171,530 | 1 | 5 |
1. A music creation apparatus comprising: at least one input device; at least one output device; at least one processor; and at least one memory device which stores a plurality of instructions, which when executed by the at least one processor, cause the at least one processor to: (a) receive an input of characters unrelated to musical notes through the at least one input device; (b) receive a selection of a recipe through the at least one input device; (c) determine whether each character is a valid character, wherein a valid character includes a number or a letter of an alphabet; (d) remove each invalid character; (e) transform the remaining characters into a string of musical notes by executing an algorithm corresponding to the recipe; and (f) output the string of musical notes in a human readable format through the at least one output device.
|
1. A music creation apparatus comprising: at least one input device; at least one output device; at least one processor; and at least one memory device which stores a plurality of instructions, which when executed by the at least one processor, cause the at least one processor to: (a) receive an input of characters unrelated to musical notes through the at least one input device; (b) receive a selection of a recipe through the at least one input device; (c) determine whether each character is a valid character, wherein a valid character includes a number or a letter of an alphabet; (d) remove each invalid character; (e) transform the remaining characters into a string of musical notes by executing an algorithm corresponding to the recipe; and (f) output the string of musical notes in a human readable format through the at least one output device. 5. The music creation apparatus of claim 1 , wherein the at least one processor is configured to enable the string of musical notes to be modified by adding or removing musical notes or applying major/minor musical note adjustments.
| 0.6375 |
10,109,274 | 10 | 12 |
10. A recognition system device comprising: processing circuitry coupled to a memory, the processing circuitry being configured to: receive a first model that converts subwords serving as elements of words into the words, the subwords being one or more phonemes or one or more syllables; produce, on the basis of the first model, a first finite state transducer that includes a first path having transitions converting one or more first subwords into one or more first words and a second path having cyclic paths to which one or more second subwords are assigned and a transition to which a class is assigned, a first state of the second path being the same as a first state of the first path; produce a third finite state transducer by composing the first finite state transducer with a second finite state transducer produced on the basis of a language model that includes the class; and produce a fifth finite state transducer by composing a seventh finite state transducer with a fourth finite state transducer, the fourth finite state transducer being produced on the basis of a second model and including a third path, the second model including an additional word, one or more subwords and the class that correspond to the additional word, the seventh finite state transducer being produced by composing the third finite state transducer with a sixth finite state transducer that includes a transition provided with an input symbol and an output symbol to both of which the class is assigned and a transition provided with the input and output symbols to both of which at least one of starting information indicating a start of the cyclic paths and ending information indicating an end of the cyclic paths is assigned; and a searcher configured to recognize a second word corresponding to an input speech by using the fifth finite state transducer, wherein the searcher outputs the second word other than the additional word, without performing conversion by the fourth finite state transducer, and outputs the additional word that is an output symbol on a fourth path of the fifth finite state transducer, the fourth path is generated by composing a fifth path of the seventh finite state transducer with the third path, one of the output symbols on the third path is the additional word, an input symbol string on the third path includes one or more third subwords and the class, and corresponds to an output symbol string of the fifth path, and the class which appears in the input symbol string on the third path and appears in the output symbol string of the fifth path controls an appearance location of the additional word.
|
10. A recognition system device comprising: processing circuitry coupled to a memory, the processing circuitry being configured to: receive a first model that converts subwords serving as elements of words into the words, the subwords being one or more phonemes or one or more syllables; produce, on the basis of the first model, a first finite state transducer that includes a first path having transitions converting one or more first subwords into one or more first words and a second path having cyclic paths to which one or more second subwords are assigned and a transition to which a class is assigned, a first state of the second path being the same as a first state of the first path; produce a third finite state transducer by composing the first finite state transducer with a second finite state transducer produced on the basis of a language model that includes the class; and produce a fifth finite state transducer by composing a seventh finite state transducer with a fourth finite state transducer, the fourth finite state transducer being produced on the basis of a second model and including a third path, the second model including an additional word, one or more subwords and the class that correspond to the additional word, the seventh finite state transducer being produced by composing the third finite state transducer with a sixth finite state transducer that includes a transition provided with an input symbol and an output symbol to both of which the class is assigned and a transition provided with the input and output symbols to both of which at least one of starting information indicating a start of the cyclic paths and ending information indicating an end of the cyclic paths is assigned; and a searcher configured to recognize a second word corresponding to an input speech by using the fifth finite state transducer, wherein the searcher outputs the second word other than the additional word, without performing conversion by the fourth finite state transducer, and outputs the additional word that is an output symbol on a fourth path of the fifth finite state transducer, the fourth path is generated by composing a fifth path of the seventh finite state transducer with the third path, one of the output symbols on the third path is the additional word, an input symbol string on the third path includes one or more third subwords and the class, and corresponds to an output symbol string of the fifth path, and the class which appears in the input symbol string on the third path and appears in the output symbol string of the fifth path controls an appearance location of the additional word. 12. The recognition system according to claim 10 , wherein the processing circuitry removes the class, and the starting information or the ending information from input symbols of transitions included in the seventh finite state transducer.
| 0.5 |
8,971,630 | 4 | 5 |
4. The method of claim 1 , wherein isolating the plurality of glyph-based character representations includes: detecting character gaps in the line of glyph-based character representations; creating a histogram of distances for the detected character gaps; constructing a graph according to the detected character gaps; assigning a penalty to arcs of the graph wherein the penalty is based in part on the histogram of distances; and selecting a path in the graph associated with the character cells based on said penalty and arcs of the graph.
|
4. The method of claim 1 , wherein isolating the plurality of glyph-based character representations includes: detecting character gaps in the line of glyph-based character representations; creating a histogram of distances for the detected character gaps; constructing a graph according to the detected character gaps; assigning a penalty to arcs of the graph wherein the penalty is based in part on the histogram of distances; and selecting a path in the graph associated with the character cells based on said penalty and arcs of the graph. 5. The method of claim 4 , wherein the graph is a linear division graph (LDG), which is constructed by performing steps including: isolating values substantially near maxima values in the histogram of distances, wherein the isolated values are associated with respective detected character gaps; creating arcs for each detected character gap; assigning a penalty to the arcs; creating paths for the LDG; calculating aggregate penalties for each path associated with the LDG based on the penalties assigned to the arcs; and selecting a desired path from among the paths associated with the LDG based on the aggregate penalties associated with the paths.
| 0.5 |
8,233,671 | 9 | 10 |
9. A method, comprising: scanning at least a portion of a document having text to generate a raster file; processing the raster file to delineate text blocks; characterizing a first text block of the text blocks into a hierarchical level based on a format attribute in the first text block and on a format attribute in a second text block proximal to the first text block; and providing to a user an interface allowing the user to hierarchically navigate the text blocks as they are read to the user, wherein the characterizing the first text block into the hierarchical level is based on whether a character dimension within the first text block is bigger than a character dimension in a different block by about ten percent or more.
|
9. A method, comprising: scanning at least a portion of a document having text to generate a raster file; processing the raster file to delineate text blocks; characterizing a first text block of the text blocks into a hierarchical level based on a format attribute in the first text block and on a format attribute in a second text block proximal to the first text block; and providing to a user an interface allowing the user to hierarchically navigate the text blocks as they are read to the user, wherein the characterizing the first text block into the hierarchical level is based on whether a character dimension within the first text block is bigger than a character dimension in a different block by about ten percent or more. 10. The method of claim 9 , wherein the processing includes identifying the text blocks by performing optical character recognition on the raster file.
| 0.5 |
9,798,776 | 1 | 7 |
1. A computer-implemented method comprising: identifying, by one or more processors, a sequence of character sub strings in a character string; generating, by the one or more processors, context objects for performing a search, the context objects including associations between search categories and character substrings; storing, by the one or more processors and in a first context object, an association between a first search category and a first character substring in the sequence of character sub strings; comparing, by the one or more processors, a second character substring in the sequence of character substrings and a second search category; determining, by the one or more processors, that the first character substring in the sequence of character substrings corresponds to a third search category; storing, by the one or more processors and in a second context object, an association between the third search category and the first character substring; and searching, by the one or more processors, indexed information using at least the second context object.
|
1. A computer-implemented method comprising: identifying, by one or more processors, a sequence of character sub strings in a character string; generating, by the one or more processors, context objects for performing a search, the context objects including associations between search categories and character substrings; storing, by the one or more processors and in a first context object, an association between a first search category and a first character substring in the sequence of character sub strings; comparing, by the one or more processors, a second character substring in the sequence of character substrings and a second search category; determining, by the one or more processors, that the first character substring in the sequence of character substrings corresponds to a third search category; storing, by the one or more processors and in a second context object, an association between the third search category and the first character substring; and searching, by the one or more processors, indexed information using at least the second context object. 7. The computer-implemented method of claim 1 , further comprising: determining that the second character substring of the sequence of character substrings does not correspond to the second search category of the sequence of the search categories; and discarding the association between the first search category and the first character substring.
| 0.62527 |
7,624,105 | 41 | 42 |
41. A search engine for determining whether a selected portion of an input string including a plurality of input characters matches a regular expression including an inexact pattern, comprising: means for receiving a microprogram embodying the inexact pattern and comprising a plurality of commands, wherein each command embodies a different portion of the inexact pattern; means for delegating each command to a corresponding co-processor that is dedicated to execute the command; and means for processing the commands in the corresponding co-processors, wherein each co-processor implements an associated portion of an inexact pattern match operation between the input string and the inexact pattern, wherein the inexact pattern comprises a specified range of instances of selected characters each belonging to a specified set of characters.
|
41. A search engine for determining whether a selected portion of an input string including a plurality of input characters matches a regular expression including an inexact pattern, comprising: means for receiving a microprogram embodying the inexact pattern and comprising a plurality of commands, wherein each command embodies a different portion of the inexact pattern; means for delegating each command to a corresponding co-processor that is dedicated to execute the command; and means for processing the commands in the corresponding co-processors, wherein each co-processor implements an associated portion of an inexact pattern match operation between the input string and the inexact pattern, wherein the inexact pattern comprises a specified range of instances of selected characters each belonging to a specified set of characters. 42. The search engine of claim 41 , further comprising: means for selectively disabling each of the co-processors in response to results from one or more other co-processors.
| 0.769841 |
8,583,422 | 23 | 24 |
23. A computer-implemented method for recognizing new types of linguistic patterns for use in a pattern database, the method comprising, performing, using a processor, a first level linguistic analysis of a natural language document to recognize and tag words indicative of objects and actions in the natural language document; performing a second level linguistic analysis of the natural language document by comparing the tags created during the first level linguistic analysis to linguistic patterns stored in a linguistic knowledge database and by creating semantic relationship labels indicative of semantic relationship linguistic patterns in the natural language document, the semantic relationship linguistic patterns including cause-effect relationships patterns; and performing a third level linguistic analysis of the natural language document by recognizing a new type of semantic relationship linguistic pattern based on the semantic relationship labels created during the second level linguistic analysis and on target semantic relationship patterns that generically describe semantic relationships between words or phrases, the target semantic relationships being derived in part from cause-effect relationships between words or phrases, the new type of semantic relationship linguistic pattern identifying a new semantic relationship between words or phrases in the natural language document.
|
23. A computer-implemented method for recognizing new types of linguistic patterns for use in a pattern database, the method comprising, performing, using a processor, a first level linguistic analysis of a natural language document to recognize and tag words indicative of objects and actions in the natural language document; performing a second level linguistic analysis of the natural language document by comparing the tags created during the first level linguistic analysis to linguistic patterns stored in a linguistic knowledge database and by creating semantic relationship labels indicative of semantic relationship linguistic patterns in the natural language document, the semantic relationship linguistic patterns including cause-effect relationships patterns; and performing a third level linguistic analysis of the natural language document by recognizing a new type of semantic relationship linguistic pattern based on the semantic relationship labels created during the second level linguistic analysis and on target semantic relationship patterns that generically describe semantic relationships between words or phrases, the target semantic relationships being derived in part from cause-effect relationships between words or phrases, the new type of semantic relationship linguistic pattern identifying a new semantic relationship between words or phrases in the natural language document. 24. The computer-implemented method of claim 23 , wherein: performing the first level linguistic analysis includes recognizing and tagging components of at least one eSAO set; performing the second level linguistic analysis includes creating labels indicative of cause-effect patterns in the natural language document, the labels identifying words or phrases in the natural language document as components of the cause-effect patterns; and performing the third level linguistic analysis includes recognizing the new type of semantic relationship linguistic pattern using the labels indicative of cause-effect patterns created during the second level linguistic analysis, wherein the new type of semantic relationship linguistic pattern identifies a new semantic relationship between the words or phrases that are the components of the cause-effect patterns.
| 0.5 |
10,015,124 | 11 | 12 |
11. A non-transitory computer readable medium having stored thereon software instructions that, when executed by a processor, cause the processor to automatically suggest content in a messaging application by performing operations including: posting, within the messaging application displayed on a second device, a first message including a first image transmitted by a first device of a first user; programmatically generating one or more suggested responses to the first message, the one or more suggested responses generated based on a first semantic concept associated with a first image content in the first image; transmitting instructions causing rendering of at least one suggested response of the one or more suggested responses in the messaging application as one or more suggestions to a second user; and receiving a selection of a selected suggested response of the at least one suggested response in the messaging application based on user input provided by the second user of the second device.
|
11. A non-transitory computer readable medium having stored thereon software instructions that, when executed by a processor, cause the processor to automatically suggest content in a messaging application by performing operations including: posting, within the messaging application displayed on a second device, a first message including a first image transmitted by a first device of a first user; programmatically generating one or more suggested responses to the first message, the one or more suggested responses generated based on a first semantic concept associated with a first image content in the first image; transmitting instructions causing rendering of at least one suggested response of the one or more suggested responses in the messaging application as one or more suggestions to a second user; and receiving a selection of a selected suggested response of the at least one suggested response in the messaging application based on user input provided by the second user of the second device. 12. The non-transitory computer readable medium of claim 11 , wherein the operation of programmatically generating the one or more suggested responses comprises generating the one or more suggested responses using one or more of a graph-based learning model and a grammar-based model.
| 0.779503 |
7,657,555 | 13 | 14 |
13. A method for a database search system, the method comprising: maintaining a bidded search listing database of bidded search listings, each bidded search listing having an associated search term; forming a related searches database using the bidded search listing database, including using the bidded search database, forming a list of uniform resource locators (URLs) associated with internet web sites to be accessed; removing duplicate URLs from the list; if a URL on the list is similar to another URL on the list, crawling a predetermined number of potentially duplicate URLs; comparing bodies of the URL on the list and the potentially duplicate URLs; if the body of the URL on the list is similar to the body of the potentially duplicate URL, suspending crawling of the potentially duplicate URLs, storing the body of the URL on the list in the related searches database for subsequent search; receiving at a search engine web server associated with the bidded search listing database a search query from a user over a data link; returning a search results page to the user over the data link, including positioning bidded search listings from the bidded search listing database having a search term matching the search query in a first portion of the search results page, positioning related search listings from the related search database in a second portion of the search results page, and communicating the search results page to the user.
|
13. A method for a database search system, the method comprising: maintaining a bidded search listing database of bidded search listings, each bidded search listing having an associated search term; forming a related searches database using the bidded search listing database, including using the bidded search database, forming a list of uniform resource locators (URLs) associated with internet web sites to be accessed; removing duplicate URLs from the list; if a URL on the list is similar to another URL on the list, crawling a predetermined number of potentially duplicate URLs; comparing bodies of the URL on the list and the potentially duplicate URLs; if the body of the URL on the list is similar to the body of the potentially duplicate URL, suspending crawling of the potentially duplicate URLs, storing the body of the URL on the list in the related searches database for subsequent search; receiving at a search engine web server associated with the bidded search listing database a search query from a user over a data link; returning a search results page to the user over the data link, including positioning bidded search listings from the bidded search listing database having a search term matching the search query in a first portion of the search results page, positioning related search listings from the related search database in a second portion of the search results page, and communicating the search results page to the user. 14. The method of claim 13 wherein positioning related search listings comprises placing hypertext links in the second portion of the search results page, each hypertext link corresponding to a search term of a bidded search listing of the bidded search listings database.
| 0.726908 |
7,953,730 | 11 | 12 |
11. The system of claim 10 , wherein the search history navigation interface is configured to provide for display the plurality of search nodes arranged based at least in part on a search category associated with each search node.
|
11. The system of claim 10 , wherein the search history navigation interface is configured to provide for display the plurality of search nodes arranged based at least in part on a search category associated with each search node. 12. The system of claim 11 , wherein the search history navigation interface is configured to provide for display a listing of search results associated with each search node being displayed.
| 0.5 |
8,401,853 | 2 | 3 |
2. The method of claim 1 , wherein the metadata comprises demographic features.
|
2. The method of claim 1 , wherein the metadata comprises demographic features. 3. The method of claim 2 , wherein the demographic features comprise at least one of age, gender, socio-economic group, nationality, and region.
| 0.5 |
8,626,742 | 1 | 2 |
1. A method of processing correlated keywords, the method comprising: providing a web page having a first input box and an embedded window object that provides a frame for a second input box and a keyword list container; receiving a primary keyword inputted by a user into the first input box of the web page; establishing a link between the embedded window object in the web page and a server and obtaining, from the server via the link, candidate related keywords of the primary keyword; creating a keyword list to present the candidate related keywords in the web page by the embedded window object; presenting, in the keyword list container of the frame of the embedded window object in the web page, the keyword list to the user; obtaining at least one related keyword from the keyword list, wherein the at least one related keyword corresponds to a respective candidate related keyword selected by the user; adding the at least one related keyword into the second input box of the frame of the embedded window object in the web page; and presenting, the second input box of the frame of the embedded window object in the web page to the user, wherein the first input box with the primary keyword therein, the second input box with the at least one related keyword therein and the keyword list container with the candidate related keywords therein are concurrently presented, and the concurrent presentation further comprises determining whether a number of the at least one related keyword in the second input box being greater than or equal to a predetermined threshold, and closing the keyword list if affirmative.
|
1. A method of processing correlated keywords, the method comprising: providing a web page having a first input box and an embedded window object that provides a frame for a second input box and a keyword list container; receiving a primary keyword inputted by a user into the first input box of the web page; establishing a link between the embedded window object in the web page and a server and obtaining, from the server via the link, candidate related keywords of the primary keyword; creating a keyword list to present the candidate related keywords in the web page by the embedded window object; presenting, in the keyword list container of the frame of the embedded window object in the web page, the keyword list to the user; obtaining at least one related keyword from the keyword list, wherein the at least one related keyword corresponds to a respective candidate related keyword selected by the user; adding the at least one related keyword into the second input box of the frame of the embedded window object in the web page; and presenting, the second input box of the frame of the embedded window object in the web page to the user, wherein the first input box with the primary keyword therein, the second input box with the at least one related keyword therein and the keyword list container with the candidate related keywords therein are concurrently presented, and the concurrent presentation further comprises determining whether a number of the at least one related keyword in the second input box being greater than or equal to a predetermined threshold, and closing the keyword list if affirmative. 2. The method as recited in claim 1 , wherein the at least one related keyword comprises a plurality of related keyword, and the method further comprising: acquiring the plurality of related keywords by adding corresponding candidate related keywords selected by the user using a plurality of addition operations.
| 0.719031 |
7,725,321 | 6 | 9 |
6. The system of claim 1 , wherein said semantic decoding is based on a term frequency calculation, which term frequency calculation is based on calculating a lexical distance between each word in said recognized speech utterance data with each word of one or more topic query entries.
|
6. The system of claim 1 , wherein said semantic decoding is based on a term frequency calculation, which term frequency calculation is based on calculating a lexical distance between each word in said recognized speech utterance data with each word of one or more topic query entries. 9. The system of claim 6 , wherein semantic decoding further includes a semantic similarity calculation, which semantic similarity calculation is based on identifying a semantic distance between two like parts of speech of said recognized speech utterance data and each of said one or more topic query entries.
| 0.5 |
7,855,972 | 26 | 27 |
26. A method of controlling usage of network resources on a communications network based on the identity of an authenticated user, the method comprising acts of: creating, with at least one computer, one or more packet rules for analyzing packets received at one or more network devices of the communications network, each rule including a condition and action to be taken as part of providing a service of the communications network if a packet received at a device satisfies the condition, wherein the one or more packet rules are defined to examine any portion of a packet; storing, with at least one computer, the one or more packet rules; creating, with at least one computer, one or more service abstractions, each service abstraction representing a communications network service to be provided to users of the communications network, each service abstraction including a named set of one or more of the packet rules that, in combination, provide the represented communications network service; storing, with at least one computer, the one or more service abstractions; associating, by at least one computer and by the one or more service abstractions, with the identity of the authenticated user of the communications network; in response to receipt of a packet at any of the network devices from the authenticated user, using, by one of the network devices, the one or more service abstractions associated with the identity of the authenticated user to control usage of network resources on the communications network, the using including applying the packet rules in the one or more service abstractions to the packet; and creating, with at least one computer, one or more role abstractions, each role abstraction representing a role of users with respect to the communications network, and each role abstraction including a set of one or more service abstractions representing communications network services to be provided to users associated with the represented role, and wherein the act of associating one or more service abstractions with the identity of the authenticated user includes associating the identity of the authenticated user with one or more of the role abstractions.
|
26. A method of controlling usage of network resources on a communications network based on the identity of an authenticated user, the method comprising acts of: creating, with at least one computer, one or more packet rules for analyzing packets received at one or more network devices of the communications network, each rule including a condition and action to be taken as part of providing a service of the communications network if a packet received at a device satisfies the condition, wherein the one or more packet rules are defined to examine any portion of a packet; storing, with at least one computer, the one or more packet rules; creating, with at least one computer, one or more service abstractions, each service abstraction representing a communications network service to be provided to users of the communications network, each service abstraction including a named set of one or more of the packet rules that, in combination, provide the represented communications network service; storing, with at least one computer, the one or more service abstractions; associating, by at least one computer and by the one or more service abstractions, with the identity of the authenticated user of the communications network; in response to receipt of a packet at any of the network devices from the authenticated user, using, by one of the network devices, the one or more service abstractions associated with the identity of the authenticated user to control usage of network resources on the communications network, the using including applying the packet rules in the one or more service abstractions to the packet; and creating, with at least one computer, one or more role abstractions, each role abstraction representing a role of users with respect to the communications network, and each role abstraction including a set of one or more service abstractions representing communications network services to be provided to users associated with the represented role, and wherein the act of associating one or more service abstractions with the identity of the authenticated user includes associating the identity of the authenticated user with one or more of the role abstractions. 27. The method of claim 26 , further comprising an act of: configuring, with at least one computer, a network device of the communications network with one or more packet rules according to one of the role abstractions.
| 0.5 |
9,753,839 | 9 | 12 |
9. A computer system, comprising: a processor coupled with a communications interface and a non-transitory computer readable medium storing processor executable instructions comprising a protocol evaluation engine that evaluates one or more test scripts configured to cause the processor to: receive a test script and a plurality of requirements for the test script via the communications interface, wherein the plurality of requirements facilitate evaluation of the test script and are in pre-determined format; develop a set of protocol evaluators based on the plurality of requirements evaluator wherein the set of protocol evaluators comprises a business requirements, a validation language requirements evaluator, a template evaluator, a completeness evaluator and a descriptiveness evaluator, wherein each protocol evaluator contains one or more factors; store the developed set of protocol evaluators in a computer readable memory; execute each protocol evaluator with a protocol evaluation engine, wherein: execution of the business requirements evaluator controls the protocol evaluator to determine whether the test script tests specified business requirements, execution of the language requirements evaluator controls the protocol evaluator to determine whether the test script is written in a specified language, execution of the template evaluator controls the protocol evaluator to determine whether the test script is prepared using a specified template, execution of the completeness evaluator controls the protocol evaluator to determine whether the test script meets completeness requirements, and execution of the descriptiveness evaluator controls the protocol evaluator to determine whether the test script meets descriptiveness requirements, wherein execution of each protocol evaluator with the protocol evaluation engine the further comprises: assigning an initial score to the test script; for each protocol evaluator: comparing the one or more factors of the protocol evaluators with the test script, and determining whether the test script deviates with at least one of the one or more factors, and in response assigning a deviation thereto; determining a deductible points for each deviation according to a pre-determined rule up to a maximum deductible points, and determining a final score for the evaluator for the test script by subtracting the deductible points from the initial score for the test script to obtain the final score; and generate a group score for a plurality of test scripts based on a pre- determined category and the final score of the plurality of test scripts for identifying a tester for the test script based on the group score.
|
9. A computer system, comprising: a processor coupled with a communications interface and a non-transitory computer readable medium storing processor executable instructions comprising a protocol evaluation engine that evaluates one or more test scripts configured to cause the processor to: receive a test script and a plurality of requirements for the test script via the communications interface, wherein the plurality of requirements facilitate evaluation of the test script and are in pre-determined format; develop a set of protocol evaluators based on the plurality of requirements evaluator wherein the set of protocol evaluators comprises a business requirements, a validation language requirements evaluator, a template evaluator, a completeness evaluator and a descriptiveness evaluator, wherein each protocol evaluator contains one or more factors; store the developed set of protocol evaluators in a computer readable memory; execute each protocol evaluator with a protocol evaluation engine, wherein: execution of the business requirements evaluator controls the protocol evaluator to determine whether the test script tests specified business requirements, execution of the language requirements evaluator controls the protocol evaluator to determine whether the test script is written in a specified language, execution of the template evaluator controls the protocol evaluator to determine whether the test script is prepared using a specified template, execution of the completeness evaluator controls the protocol evaluator to determine whether the test script meets completeness requirements, and execution of the descriptiveness evaluator controls the protocol evaluator to determine whether the test script meets descriptiveness requirements, wherein execution of each protocol evaluator with the protocol evaluation engine the further comprises: assigning an initial score to the test script; for each protocol evaluator: comparing the one or more factors of the protocol evaluators with the test script, and determining whether the test script deviates with at least one of the one or more factors, and in response assigning a deviation thereto; determining a deductible points for each deviation according to a pre-determined rule up to a maximum deductible points, and determining a final score for the evaluator for the test script by subtracting the deductible points from the initial score for the test script to obtain the final score; and generate a group score for a plurality of test scripts based on a pre- determined category and the final score of the plurality of test scripts for identifying a tester for the test script based on the group score. 12. The computer system of claim 9 , wherein the instructions configured to cause the one or more processors to generate the group score further comprise instructions configured to cause the one or more processors to add up the final scores according to the pre-determined category.
| 0.598291 |
9,547,821 | 5 | 6 |
5. The method of claim 1 , wherein the rescaling comprises reshaping the gray scale image to a square gray scale image.
|
5. The method of claim 1 , wherein the rescaling comprises reshaping the gray scale image to a square gray scale image. 6. The method of claim 5 , wherein the predefined size is 128×128 pixels.
| 0.5 |
7,581,245 | 9 | 16 |
9. A method for evaluating computer system passwords, the method comprising: obtaining, for each user of a computer system, password information generated by performing a security procedure on a password entry; sequentially performing, for each user, the security procedure on sequenced entries of a dictionary until either a match with the password information is detected or the sequenced entries are exhausted; and adjusting the sequence of a sequenced entry in the dictionary based on the number of matches detected for the sequenced entry.
|
9. A method for evaluating computer system passwords, the method comprising: obtaining, for each user of a computer system, password information generated by performing a security procedure on a password entry; sequentially performing, for each user, the security procedure on sequenced entries of a dictionary until either a match with the password information is detected or the sequenced entries are exhausted; and adjusting the sequence of a sequenced entry in the dictionary based on the number of matches detected for the sequenced entry. 16. The method of claim 9 , further comprising ranking the sequenced entries based on the number of matches detected for each sequenced entry.
| 0.875 |
8,578,263 | 20 | 21 |
20. The system of claim 19 wherein the computer processing unit is further configured to extract, from the structured document, structural elements having classification identifiers corresponding to the second user classification of the session copy of second user profile, the system further comprising: means for writing the extracted structural elements into the session structured document in the session document.
|
20. The system of claim 19 wherein the computer processing unit is further configured to extract, from the structured document, structural elements having classification identifiers corresponding to the second user classification of the session copy of second user profile, the system further comprising: means for writing the extracted structural elements into the session structured document in the session document. 21. The system of claim 20 wherein the computer processing unit is further configured to filter the presentation grammar, in dependence upon the extracted structural elements, into a session grammar in the session document.
| 0.5 |
9,223,897 | 1 | 6 |
1. A method performed by one or more server devices, the method comprising: obtaining, by the one or more server devices, a rank position map, the rank position map specifying, for a plurality of rank positions, an expected utility rate for a document presented at a particular one of the plurality of rank positions as a search result, the expected utility rate being derived from an aggregate quantity of selections of the document presented as a search result at the particular one of the plurality of rank positions; determining, by the one or more server devices, an expected utility rate, for a particular document, based on the obtained rank position map and based on a quantity of times that the particular document was presented as a search result at particular ones of the plurality of rank positions; determining, by the one or more server devices, an actual utility rate for the particular document based on an actual quantity of selections of the particular document and based on a total quantity of times that the particular document was presented as a search result; calculating, by the one or more server devices, a correction factor, for the particular document, based on the determined expected utility rate and the determined actual utility rate; determining, by the one or more server devices, a confidence level for the correction factor, the confidence level representing a measure of confidence associated with the correction factor; adjusting, by the one or more server devices, the correction factor based on the determined confidence level; selecting, by the one or more server devices and based on determining that the confidence level is less than an aggregation threshold, a set of documents, the particular document being included in the set of documents; calculating, by the one or more server devices, an aggregated correction factor for the set of documents; using, by the one or more server devices, the aggregated correction factor as the correction factor for the particular document; adjusting, by the one or more server devices, a score of the particular document based on the correction factor; and providing, for presentation, a ranked list of search results, one of the search results corresponding to the particular document, and a ranking of the search result corresponding to the particular document being based on the adjusted score.
|
1. A method performed by one or more server devices, the method comprising: obtaining, by the one or more server devices, a rank position map, the rank position map specifying, for a plurality of rank positions, an expected utility rate for a document presented at a particular one of the plurality of rank positions as a search result, the expected utility rate being derived from an aggregate quantity of selections of the document presented as a search result at the particular one of the plurality of rank positions; determining, by the one or more server devices, an expected utility rate, for a particular document, based on the obtained rank position map and based on a quantity of times that the particular document was presented as a search result at particular ones of the plurality of rank positions; determining, by the one or more server devices, an actual utility rate for the particular document based on an actual quantity of selections of the particular document and based on a total quantity of times that the particular document was presented as a search result; calculating, by the one or more server devices, a correction factor, for the particular document, based on the determined expected utility rate and the determined actual utility rate; determining, by the one or more server devices, a confidence level for the correction factor, the confidence level representing a measure of confidence associated with the correction factor; adjusting, by the one or more server devices, the correction factor based on the determined confidence level; selecting, by the one or more server devices and based on determining that the confidence level is less than an aggregation threshold, a set of documents, the particular document being included in the set of documents; calculating, by the one or more server devices, an aggregated correction factor for the set of documents; using, by the one or more server devices, the aggregated correction factor as the correction factor for the particular document; adjusting, by the one or more server devices, a score of the particular document based on the correction factor; and providing, for presentation, a ranked list of search results, one of the search results corresponding to the particular document, and a ranking of the search result corresponding to the particular document being based on the adjusted score. 6. The method of claim 1 , where the rank position map is associated with a particular query type.
| 0.905405 |
8,185,096 | 7 | 20 |
7. A non-transitory computer readable storage medium storing a computer program product, comprising: computer code for providing at least one user profile page for receiving user input that is capable of being used to define a user profile associated with a user; computer code for receiving a selection of content, utilizing the at least one user profile page, the content including a plurality of content channels; computer code for updating the user profile based on the selection of content; computer code for receiving a delivery mode selection of at least two delivery modes, the at least two delivery modes including a first delivery mode in which at least a first portion of the content is to be delivered to the user and a second delivery mode in which at least a second portion of the content is to be delivered to the user, at least one of the two delivery modes including a short message service delivery mode involving a short message service; computer code for delivering the at least first portion of the content to the user utilizing the first delivery mode; computer code for delivering the at least second portion of the content to the user utilizing the second delivery mode; computer code for populating the user profile based on an interaction with the short message service; computer code for receiving a schedule for receiving a message utilizing the short message service; computer code for delivering the message comprising particular content to a user handset, based on the schedule; computer code for receiving a command sequence including a first constant portion and a second variable portion, utilizing the short message service, where the first constant portion provides context for the second variable portion; computer code for delivering a short message service response to the command sequence utilizing the short message service, the short message service response including response information identified as a function of both the first constant portion and second variable portion of the command sequence; computer code for delivering a content menu utilizing the short message service in a form of a menu short message service message including: a first menu selection option indicating a first menu short form command including a first one or more characters associated with a first content, a second menu selection option indicating a second menu short form command including a second one or more characters associated with a second content, and a third menu selection option indicating a third menu short form command including a third one or more characters associated with a third content; computer code for receiving the first menu short form command associated with the first content, in response to the menu short message service message; computer code for receiving the second menu short form command associated with the second content, in response to the menu short message service message; computer code for receiving the third menu short form command associated with the third content, in response to the menu short message service message; computer code for, in response to the receipt of the first menu short form command associated with the first content, delivering the first content; computer code for, in response to the receipt of the second menu short form command associated with the second content, delivering the second content; and computer code for, in response to the receipt of the third menu short form command associated with the third content, delivering the third content.
|
7. A non-transitory computer readable storage medium storing a computer program product, comprising: computer code for providing at least one user profile page for receiving user input that is capable of being used to define a user profile associated with a user; computer code for receiving a selection of content, utilizing the at least one user profile page, the content including a plurality of content channels; computer code for updating the user profile based on the selection of content; computer code for receiving a delivery mode selection of at least two delivery modes, the at least two delivery modes including a first delivery mode in which at least a first portion of the content is to be delivered to the user and a second delivery mode in which at least a second portion of the content is to be delivered to the user, at least one of the two delivery modes including a short message service delivery mode involving a short message service; computer code for delivering the at least first portion of the content to the user utilizing the first delivery mode; computer code for delivering the at least second portion of the content to the user utilizing the second delivery mode; computer code for populating the user profile based on an interaction with the short message service; computer code for receiving a schedule for receiving a message utilizing the short message service; computer code for delivering the message comprising particular content to a user handset, based on the schedule; computer code for receiving a command sequence including a first constant portion and a second variable portion, utilizing the short message service, where the first constant portion provides context for the second variable portion; computer code for delivering a short message service response to the command sequence utilizing the short message service, the short message service response including response information identified as a function of both the first constant portion and second variable portion of the command sequence; computer code for delivering a content menu utilizing the short message service in a form of a menu short message service message including: a first menu selection option indicating a first menu short form command including a first one or more characters associated with a first content, a second menu selection option indicating a second menu short form command including a second one or more characters associated with a second content, and a third menu selection option indicating a third menu short form command including a third one or more characters associated with a third content; computer code for receiving the first menu short form command associated with the first content, in response to the menu short message service message; computer code for receiving the second menu short form command associated with the second content, in response to the menu short message service message; computer code for receiving the third menu short form command associated with the third content, in response to the menu short message service message; computer code for, in response to the receipt of the first menu short form command associated with the first content, delivering the first content; computer code for, in response to the receipt of the second menu short form command associated with the second content, delivering the second content; and computer code for, in response to the receipt of the third menu short form command associated with the third content, delivering the third content. 20. The non-transitory computer readable storage medium of claim 7 , further comprising: computer code for causing display of at least one advertisement page for receiving advertiser input that is capable of being used to create at least one created advertisement associated with an advertiser, and for receiving additional advertiser input that is capable of being used to define an advertisement campaign associated with the at least one created advertisement of the advertiser; computer code for receiving a time of day to be stored in association with the advertisement campaign, utilizing the at least one advertisement page; computer code for receiving an advertisement-related location to be stored in association with the advertisement campaign, utilizing the at least one advertisement page; computer code for receiving a user type to be stored in association with the advertisement campaign, utilizing the at least one advertisement page; and computer code for delivering the at least one created advertisement of the advertiser, based on the time of day of the advertisement campaign, the advertisement-related location of the advertisement campaign, and the user type of the advertisement campaign.
| 0.5 |
7,693,267 | 17 | 18 |
17. The system of claim 12 , wherein the identified key elements are organized in categories in the email.
|
17. The system of claim 12 , wherein the identified key elements are organized in categories in the email. 18. The system of claim 17 , wherein the categories are selected from the group consisting of subject matter, action item, phone numbers, and scheduled times, and wherein the key elements contained in the email are color coded according to their categories.
| 0.5 |
7,949,941 | 28 | 31 |
28. The method of claim 1 , wherein the XSLT stylesheet is a first XSLT stylesheet, further comprising: at request compile time, computing a rewritten XSLT stylesheet by rewriting the first XSLT stylesheet; wherein computing the rewritten XSLT stylesheet includes said step of determining, based at least in part on the structural description that constrains the set of one or more XML documents to the hierarchy of nodes that may be present in the set of one or more XML documents, which particular one or more transformation templates to use to transform the set of one or more XML documents; and wherein the rewritten XSLT stylesheet includes fewer dynamic template matching calls than the first XSLT stylesheet.
|
28. The method of claim 1 , wherein the XSLT stylesheet is a first XSLT stylesheet, further comprising: at request compile time, computing a rewritten XSLT stylesheet by rewriting the first XSLT stylesheet; wherein computing the rewritten XSLT stylesheet includes said step of determining, based at least in part on the structural description that constrains the set of one or more XML documents to the hierarchy of nodes that may be present in the set of one or more XML documents, which particular one or more transformation templates to use to transform the set of one or more XML documents; and wherein the rewritten XSLT stylesheet includes fewer dynamic template matching calls than the first XSLT stylesheet. 31. The method of claim 28 , wherein determining which one or more transformation templates to use to transform the set of one or more XML documents comprises: based at least in part on the structural description that constrains the set of one or more XML documents to the hierarchy of nodes that may be present in the set of one or more XML documents, constructing a corresponding sample document that represents possible structures of the XML documents in the set of one or more XML documents; submitting the sample document to an XSLT engine for transformation based at least in part on the XSLT stylesheet and for tracing execution paths associated with the transformation, wherein the execution paths indicate, for each node contained in the sample document, which particular transformation template to use to transform the corresponding node.
| 0.5 |
8,875,111 | 9 | 12 |
9. A hardware computer-readable storage device comprising computer program instructions for enabling execution of a computer program function having a plurality of instructions including at least one branch instruction and at least one exception handler, the program instructions executable by a processor to perform actions including: a) in response to detecting an invocation of the computer program function, generating a data structure representing the computer program function, the data structure including at least one directed graph, each of the plurality of instructions represented by a corresponding instruction node of the at least one directed graph; b) inserting, into the at least one directed graph, a back edge corresponding to each target of each branch instruction, the back edge indicating an instruction node representing the branch instruction corresponding to the target; c) employing the back edge to insert at least one instruction node into the at least one directed graph; d) inserting, into the at least one directed graph, at least one instruction type meta-node, each instruction type meta-node having one or more edges to a corresponding one or more instruction nodes of the at least one directed graph, the one or more instruction nodes representative of a type of instruction corresponding to the instruction type meta-node; e) employing the one or more edges of the at least one instruction type meta-node to insert at least one other instruction node into the at least one directed graph; and f) translating the data structure to an intermediate language representation of the computer program function.
|
9. A hardware computer-readable storage device comprising computer program instructions for enabling execution of a computer program function having a plurality of instructions including at least one branch instruction and at least one exception handler, the program instructions executable by a processor to perform actions including: a) in response to detecting an invocation of the computer program function, generating a data structure representing the computer program function, the data structure including at least one directed graph, each of the plurality of instructions represented by a corresponding instruction node of the at least one directed graph; b) inserting, into the at least one directed graph, a back edge corresponding to each target of each branch instruction, the back edge indicating an instruction node representing the branch instruction corresponding to the target; c) employing the back edge to insert at least one instruction node into the at least one directed graph; d) inserting, into the at least one directed graph, at least one instruction type meta-node, each instruction type meta-node having one or more edges to a corresponding one or more instruction nodes of the at least one directed graph, the one or more instruction nodes representative of a type of instruction corresponding to the instruction type meta-node; e) employing the one or more edges of the at least one instruction type meta-node to insert at least one other instruction node into the at least one directed graph; and f) translating the data structure to an intermediate language representation of the computer program function. 12. The hardware computer-readable storage device of claim 9 , the actions further including translating the intermediate language representation to a native code representation of the computer program function and enabling execution of the computer program function.
| 0.653247 |
7,873,205 | 5 | 6 |
5. The method for classifying defects according to claim 1 , wherein the third likelihoods are calculated of by using a classification model comprising a relation of the classes of the learning type classification and the classes of the rule-based classification.
|
5. The method for classifying defects according to claim 1 , wherein the third likelihoods are calculated of by using a classification model comprising a relation of the classes of the learning type classification and the classes of the rule-based classification. 6. The method for classifying defects according to claim 5 , further comprising: generating a plurality of classification models; determining a likelihood of the adequacy of each classification model; and deciding a class likelihood according to the determined model likelihood.
| 0.5 |
9,792,014 | 13 | 16 |
13. A computer-readable storage medium having instructions stored thereon that, when executed by a processor, perform a method comprising: rendering an item listing view of a plurality of items; rendering an in-place menu and action commands in place of a first item of the plurality of items in response to receiving an indication of an in-place menu selection for the first item, wherein the in-place menu replaces the space of the first item in a view of the first item; while the in-place menu and action commands are in the place of the first item, receiving an indication of an in-place menu selection for a second item of the plurality of the items; rendering the in-place menu and action commands in pace of a second item of the plurality of items in response to the receiving the indication of the in-place menu selection for the second stern without receiving a pre-indication to invoke a multi-select mode, wherein the in-place menu replaces the space of the second item in a view of the second item; and removing the in-place menu and action commands for display in place of the first item, wherein the second stern comprises an item selected while selection of the first item is maintained with a visual indication of the selection.
|
13. A computer-readable storage medium having instructions stored thereon that, when executed by a processor, perform a method comprising: rendering an item listing view of a plurality of items; rendering an in-place menu and action commands in place of a first item of the plurality of items in response to receiving an indication of an in-place menu selection for the first item, wherein the in-place menu replaces the space of the first item in a view of the first item; while the in-place menu and action commands are in the place of the first item, receiving an indication of an in-place menu selection for a second item of the plurality of the items; rendering the in-place menu and action commands in pace of a second item of the plurality of items in response to the receiving the indication of the in-place menu selection for the second stern without receiving a pre-indication to invoke a multi-select mode, wherein the in-place menu replaces the space of the second item in a view of the second item; and removing the in-place menu and action commands for display in place of the first item, wherein the second stern comprises an item selected while selection of the first item is maintained with a visual indication of the selection. 16. The medium of claim 13 , having further instructions stored thereon that, when executed by the processor, perform the method further comprising: determining a context of item state for the first item and providing action commands for the in-place menu according to the item state of the first item.
| 0.81851 |
8,423,485 | 25 | 29 |
25. An annotation apparatus that assigns a symbol as metadata to real-world information, the apparatus comprising: a learning information storage that stores learning information including a transformation obtained by a canonical correlation analysis based on a plurality of combinations of first and second features to derive latent variables based on at least one of the first and second features, latent variables obtained for each of the combinations of the first and second features using the transformation, and information required to obtain a probability of occurrence of an arbitrary first feature from the latent variable and a probability of occurrence of an arbitrary second feature from the latent variable for each of the latent variables, the first features respectively extracted from first data as a feature of the first data that indicates the real-world information, the second features respectively extracted from second data as a feature of the second data that corresponds to the first data, the latent variables respectively indicating an abstract concept that connects the real-world information with the symbol corresponding to the real-world information; an input reception module that receives an input of a new first data; a first feature extracting module that extracts a new first feature indicating a feature of the new first data based on the received new first data; a probability calculating module that calculates a probability of occurrence of the second feature of the second data indicating a single symbol from the extracted new first feature based on the learning information stored in the learning information storage; and a symbol assignment module that assigns the symbol to the new first data based on the probability calculated by the probability calculating module.
|
25. An annotation apparatus that assigns a symbol as metadata to real-world information, the apparatus comprising: a learning information storage that stores learning information including a transformation obtained by a canonical correlation analysis based on a plurality of combinations of first and second features to derive latent variables based on at least one of the first and second features, latent variables obtained for each of the combinations of the first and second features using the transformation, and information required to obtain a probability of occurrence of an arbitrary first feature from the latent variable and a probability of occurrence of an arbitrary second feature from the latent variable for each of the latent variables, the first features respectively extracted from first data as a feature of the first data that indicates the real-world information, the second features respectively extracted from second data as a feature of the second data that corresponds to the first data, the latent variables respectively indicating an abstract concept that connects the real-world information with the symbol corresponding to the real-world information; an input reception module that receives an input of a new first data; a first feature extracting module that extracts a new first feature indicating a feature of the new first data based on the received new first data; a probability calculating module that calculates a probability of occurrence of the second feature of the second data indicating a single symbol from the extracted new first feature based on the learning information stored in the learning information storage; and a symbol assignment module that assigns the symbol to the new first data based on the probability calculated by the probability calculating module. 29. An annotation apparatus according to claim 25 , wherein the symbol assignment module extracts the symbol indicated by the second feature of the second data indicating the single symbol in decreasing order of the probability in accordance with a predetermined criterion and generates a new second feature corresponding to the new first feature based on the extracted symbol.
| 0.801788 |
10,140,975 | 12 | 13 |
12. The method of claim 11 , comprising: submitting a third search query that includes the transcription of the fourth utterance.
|
12. The method of claim 11 , comprising: submitting a third search query that includes the transcription of the fourth utterance. 13. The method of claim 12 , wherein the fourth utterance is followed by a pause of longer than the fixed duration, wherein the third search query is submitted after the pause.
| 0.5 |
8,442,972 | 1 | 3 |
1. A computer-implemented method comprising: constructing an association graph that includes one or more terms as vertices linked by edges, which edges have respective edge scores that represent respective strengths of association of the respective vertices linked thereby; receiving from a user a search query that comprises one or more of the terms of the association graph; responsively to the search query, generating, using the association graph, refinement options that comprise respective terms of the association graph, and presenting information to the user, including the refinement options for optional addition to the search query; identifying a portion of the refinement options, and corresponding terms, that the user did not select; using the association graph, assigning respective ranking scores to search results generated responsively to the search query, including lowering one or more of the ranking scores of the respective search results that are characterized by the non-selected portion of the refinement options, by damping the edge score of an edge of the association graph between two of the vertices respectively representing two of the non-selected terms; ranking the search results according to the ranking scores; and presenting the ranked search results to the user.
|
1. A computer-implemented method comprising: constructing an association graph that includes one or more terms as vertices linked by edges, which edges have respective edge scores that represent respective strengths of association of the respective vertices linked thereby; receiving from a user a search query that comprises one or more of the terms of the association graph; responsively to the search query, generating, using the association graph, refinement options that comprise respective terms of the association graph, and presenting information to the user, including the refinement options for optional addition to the search query; identifying a portion of the refinement options, and corresponding terms, that the user did not select; using the association graph, assigning respective ranking scores to search results generated responsively to the search query, including lowering one or more of the ranking scores of the respective search results that are characterized by the non-selected portion of the refinement options, by damping the edge score of an edge of the association graph between two of the vertices respectively representing two of the non-selected terms; ranking the search results according to the ranking scores; and presenting the ranked search results to the user. 3. The method according to claim 1 , wherein receiving the search query comprises receiving a first search query from the user, wherein presenting the information comprises presenting the information including first search results generated responsively to the first search query, and the refinement options, wherein the method further comprises receiving a second search query from the user after receiving the first search query, wherein assigning the respective ranking scores comprises assigning the respective ranking scores to second search results generated responsively to the second search query, including lowering one or more of the ranking scores of the respective second search results that are characterized by the non-selected portion of the refinement options, wherein ranking the search results comprises ranking the second search results, and wherein presenting the ranked search results comprises presenting the second ranked search results.
| 0.5 |
9,754,589 | 14 | 17 |
14. A computer-implemented method comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving text corresponding to at least a portion of a user input; executing a first natural language understanding (“NLU”) process using the text, wherein the first NLU process is associated with a first subject matter, wherein the first NLU process produces a first NLU result, and wherein the first NLU result is associated with a first score indicative of a confidence in the first NLU result; executing a second NLU process using the text, wherein the second NLU process is associated with a second subject matter, wherein the second NLU process generates a second NLU result, and wherein the second NLU result is associated with a second score indicative of a confidence in the second NLU result; selecting the first NLU result based at least partly on the first score and the second score; and generating a response based at least partly on the first NLU result.
|
14. A computer-implemented method comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving text corresponding to at least a portion of a user input; executing a first natural language understanding (“NLU”) process using the text, wherein the first NLU process is associated with a first subject matter, wherein the first NLU process produces a first NLU result, and wherein the first NLU result is associated with a first score indicative of a confidence in the first NLU result; executing a second NLU process using the text, wherein the second NLU process is associated with a second subject matter, wherein the second NLU process generates a second NLU result, and wherein the second NLU result is associated with a second score indicative of a confidence in the second NLU result; selecting the first NLU result based at least partly on the first score and the second score; and generating a response based at least partly on the first NLU result. 17. The computer-implemented method of claim 14 , wherein the first NLU result comprises an interpretation of the text as one of: a request for information regarding the first subject matter; a statement comprising information regarding the first subject matter; or a request for execution of a command associated with the first subject matter.
| 0.673624 |
8,312,370 | 1 | 3 |
1. A system for assembly of structured documents, the system comprising: a memory configured to store documents; at least one processor configured to: identify a template for generating a document, wherein the template defines at least one field having a specified position and length within the document; store a copy of the template to the memory so as to initialize the document; store characters based on data associated with the at least one field to a location of the memory associated with the at least one field of the document, wherein, based at least in part on the text and the length of the field, the processor stores, to portions of the memory associated with the document, at least one indicator of at least one portion of the at least one field to be removed from the document; wherein the at least one indicator of the at least one portion of the at least one field to be removed comprises at least one specified character value; wherein the at least one specified character value comprises at least two byte values, the byte values comprising a first of the byte values indicative of a start-of-heading of a character encoding of the document and at least a second of the byte values indicative of a number of characters to be removed from the document; and at least one circuit configured to: access the document from the memory; and remove the at least one portion of the at least one field based on the at least one indicator so as to generate a portion of an assembled document.
|
1. A system for assembly of structured documents, the system comprising: a memory configured to store documents; at least one processor configured to: identify a template for generating a document, wherein the template defines at least one field having a specified position and length within the document; store a copy of the template to the memory so as to initialize the document; store characters based on data associated with the at least one field to a location of the memory associated with the at least one field of the document, wherein, based at least in part on the text and the length of the field, the processor stores, to portions of the memory associated with the document, at least one indicator of at least one portion of the at least one field to be removed from the document; wherein the at least one indicator of the at least one portion of the at least one field to be removed comprises at least one specified character value; wherein the at least one specified character value comprises at least two byte values, the byte values comprising a first of the byte values indicative of a start-of-heading of a character encoding of the document and at least a second of the byte values indicative of a number of characters to be removed from the document; and at least one circuit configured to: access the document from the memory; and remove the at least one portion of the at least one field based on the at least one indicator so as to generate a portion of an assembled document. 3. The system of claim 1 , wherein the assembled document is reduced in size relative to the document as copied from the template.
| 0.835859 |
8,930,765 | 1 | 6 |
1. A method for testing a compiler comprising: compiling a code corpus comprising a plurality of test programs corresponding to a particular programming language, the code corpus being compiled by a first version of a compiler to generate first compiler output; compiling the code corpus using a second version of the compiler to generate second compiler output, the second version of the compiler including different functionality than the first version of the compiler; retrieving, by one or more computing devices, at least one test corresponding to the first compiler output and the second compiler output; and executing, by the one or more computing devices, the at least one test to generate a regression result for the second version of the compiler.
|
1. A method for testing a compiler comprising: compiling a code corpus comprising a plurality of test programs corresponding to a particular programming language, the code corpus being compiled by a first version of a compiler to generate first compiler output; compiling the code corpus using a second version of the compiler to generate second compiler output, the second version of the compiler including different functionality than the first version of the compiler; retrieving, by one or more computing devices, at least one test corresponding to the first compiler output and the second compiler output; and executing, by the one or more computing devices, the at least one test to generate a regression result for the second version of the compiler. 6. The method of claim 1 , wherein the first compiler output comprises a plurality of first internal decisions made by the first version of the compiler and wherein the second compiler output comprises a plurality of second internal decisions made by the second version of the compiler, the method further comprising: associating the plurality of first internal decisions and the plurality of second internal decisions with a particular test program of the plurality of test programs; and storing the associated plurality of first internal decisions and the associated plurality of second internal decisions in a data record.
| 0.5 |
6,064,958 | 1 | 7 |
1. A pattern recognition method, comprising the steps of: calculating a probability of each probabilistic model expressing features of each recognition category with respect to each input feature vector derived from each input signal, wherein the probabilistic model represents a feature parameter subspace in which feature vectors of each recognition category exist and the feature parameter subspace is expressed by using mixture distributions of one-dimensional discrete distributions with arbitrary distribution shapes which are arranged in respective dimensions; and outputting a recognition category expressed by a probabilistic model with a highest probability among a plurality of probabilistic models as a recognition result.
|
1. A pattern recognition method, comprising the steps of: calculating a probability of each probabilistic model expressing features of each recognition category with respect to each input feature vector derived from each input signal, wherein the probabilistic model represents a feature parameter subspace in which feature vectors of each recognition category exist and the feature parameter subspace is expressed by using mixture distributions of one-dimensional discrete distributions with arbitrary distribution shapes which are arranged in respective dimensions; and outputting a recognition category expressed by a probabilistic model with a highest probability among a plurality of probabilistic models as a recognition result. 7. The method of claim 1, further comprising the step of: estimating parameters of the discrete distributions from training data, by first training a continuous distribution type model with a number of mixture component distributions equal to a desired number of distributions to be mixed in the mixture distribution, and then training a probabilistic model obtained by discretizing each continuous distribution of the continuous distribution type model as an initial model.
| 0.679296 |
9,158,775 | 18 | 23 |
18. The apparatus of claim 17 , wherein the fetching unit also retrieves the fresh content items based on a user preference for the fresh content items from at least one of a time period, a data source, the geographic location and a list of interests.
|
18. The apparatus of claim 17 , wherein the fetching unit also retrieves the fresh content items based on a user preference for the fresh content items from at least one of a time period, a data source, the geographic location and a list of interests. 23. The apparatus of claim 18 , wherein the real-time index indexes the content items according to keywords.
| 0.732673 |
10,124,203 | 1 | 14 |
1. A student desk configured to incorporate brain-based movement into learning activities comprising: a frame comprising a table support including leg member portions extending upwardly from a front portion of the frame and a non-rotating seat support extending upwardly from a rear portion of the frame; a rotatable seat carried by the seat support and configured to rotate about the non-rotating seat support from a resting position to a first ending position in a first direction and from a resting position to a second ending position in a second direction; a table carried by the table support, the table having a substantially flat and smooth top face, a bottom face, and a near edge proximate to the seat; a sensory relief disposed a surface of the table other than the top face, the sensory relief comprising at least one face having at least one tactilely discernable feature accessible by a user of the student desk; a swinging footrest rotatably mounted between the leg member portions of the frame; a torsion spring having a pair of legs; a pair of barriers disposed on the seat support and associated with the torsion spring, each barrier configured to remain stationary while the seat rotates and to prevent one leg of the torsion spring from traveling in one direction from the resting position; and a pair of projections extending from the seat and operatively engaging one leg of the torsion spring, each projection moving with the seat as the seat rotates, the torsion spring opposing rotation of the seat by applying a force to the projection via the associated leg.
|
1. A student desk configured to incorporate brain-based movement into learning activities comprising: a frame comprising a table support including leg member portions extending upwardly from a front portion of the frame and a non-rotating seat support extending upwardly from a rear portion of the frame; a rotatable seat carried by the seat support and configured to rotate about the non-rotating seat support from a resting position to a first ending position in a first direction and from a resting position to a second ending position in a second direction; a table carried by the table support, the table having a substantially flat and smooth top face, a bottom face, and a near edge proximate to the seat; a sensory relief disposed a surface of the table other than the top face, the sensory relief comprising at least one face having at least one tactilely discernable feature accessible by a user of the student desk; a swinging footrest rotatably mounted between the leg member portions of the frame; a torsion spring having a pair of legs; a pair of barriers disposed on the seat support and associated with the torsion spring, each barrier configured to remain stationary while the seat rotates and to prevent one leg of the torsion spring from traveling in one direction from the resting position; and a pair of projections extending from the seat and operatively engaging one leg of the torsion spring, each projection moving with the seat as the seat rotates, the torsion spring opposing rotation of the seat by applying a force to the projection via the associated leg. 14. The student desk of claim 1 wherein the sensory relief is disposed on the table bottom face proximate to the near edge.
| 0.888182 |
7,765,200 | 25 | 27 |
25. A computer readable storage medium containing program instructions executable on a processing system for query problem determination; the program instructions comprising: receiving a database query; creating a query execution plan for problem determination of the database query, the query execution plan comprising a plurality of query plan operators; executing the query execution plan; displaying a progress indicator for each of the plurality of query plan operators during execution of the query execution plan in response to progress information; communicating progress information to a query progress analyzer for performing debugging operations; and performing debugging operations during execution of the query execution plan by a query progress analyzer, wherein performing the debugging operations comprises: skipping at least a portion of the query execution plan; pausing execution of the query execution plan at a designated point; inspecting the query execution plan including one or more of looking up variables in the query execution plan and stepping through the query execution plan to inspect different portions of the query execution for problem determination, while the query execution is paused; resuming execution of the query execution plan from the designated point; and providing updated progress information to update display of the progress indicator, wherein upon the query execution plan's invocation, a wrapper function intervenes and jumps into debugging logic which increments a counter for the current query plan operator, and executes any additional instructions corresponding to the query plan operator, wherein the additional instructions include graphically displaying the progress as an enhancement to a query explain tool, wherein the query explain tool would poll the current status of the actual cardinalities processed for each part of the query execution plan and utilizing the existing explain facility.
|
25. A computer readable storage medium containing program instructions executable on a processing system for query problem determination; the program instructions comprising: receiving a database query; creating a query execution plan for problem determination of the database query, the query execution plan comprising a plurality of query plan operators; executing the query execution plan; displaying a progress indicator for each of the plurality of query plan operators during execution of the query execution plan in response to progress information; communicating progress information to a query progress analyzer for performing debugging operations; and performing debugging operations during execution of the query execution plan by a query progress analyzer, wherein performing the debugging operations comprises: skipping at least a portion of the query execution plan; pausing execution of the query execution plan at a designated point; inspecting the query execution plan including one or more of looking up variables in the query execution plan and stepping through the query execution plan to inspect different portions of the query execution for problem determination, while the query execution is paused; resuming execution of the query execution plan from the designated point; and providing updated progress information to update display of the progress indicator, wherein upon the query execution plan's invocation, a wrapper function intervenes and jumps into debugging logic which increments a counter for the current query plan operator, and executes any additional instructions corresponding to the query plan operator, wherein the additional instructions include graphically displaying the progress as an enhancement to a query explain tool, wherein the query explain tool would poll the current status of the actual cardinalities processed for each part of the query execution plan and utilizing the existing explain facility. 27. The computer readable medium of claim 25 , wherein performing the debugging operations further comprises: skipping at least an unmodified portion of the query execution plan.
| 0.805677 |
7,698,331 | 1 | 2 |
1. A method of generating a search result list in response to a search query from a searcher using a computer network, the method executed with a computer having a processor, the method comprising: (a) maintaining a first database including a first plurality of search listings comprising sponsored search listings having a sponsored content; (b) maintaining a second database including documents having a general web content; (c) receiving, by the processor, a search query from the searcher; (d) identifying, by the processor, from the first database a first set of search listings comprising sponsored search listings having documents generating a match with the search query, and from the second database a second set of search listings comprising general web listings having documents generating a match with the same search query as used to identify the sponsored first set of search listings; (e) determining, by the processor, a confidence score for each listing from the first set of search listings, wherein the confidence score is determined in accordance with a relevance of each listing when compared to the listings of the second set of search listings after execution of step (d); (f) ranking, by the processor, the sponsored first set of search listings in accordance, at least in part, with the confidence score for each search listing thereof, wherein the processor associates the sponsored first set of search listings with at least one feature different than the relevance of each search listing when compared to the listings of the second set of search listings, and the processor further orders the sponsored first set of search listings in accordance with the at least one feature, the at least one feature comprising any of a number of clicks, a click-through rate, and a conversion rate derived from historical click-through and conversion data from user activity on the sponsored first set of search listings; (g) computing a plurality of demotion terms related to a plurality of the top-ranked sponsored first set of search listings, wherein the demotion terms capture non-ideal characteristics thereof; (h) updating the confidence score of each of the top-ranked sponsored first set of search listings based on the plurality of demotion terms; and (i) re-ranking the top-ranked sponsored first set of search listings according to the updated confidence scores.
|
1. A method of generating a search result list in response to a search query from a searcher using a computer network, the method executed with a computer having a processor, the method comprising: (a) maintaining a first database including a first plurality of search listings comprising sponsored search listings having a sponsored content; (b) maintaining a second database including documents having a general web content; (c) receiving, by the processor, a search query from the searcher; (d) identifying, by the processor, from the first database a first set of search listings comprising sponsored search listings having documents generating a match with the search query, and from the second database a second set of search listings comprising general web listings having documents generating a match with the same search query as used to identify the sponsored first set of search listings; (e) determining, by the processor, a confidence score for each listing from the first set of search listings, wherein the confidence score is determined in accordance with a relevance of each listing when compared to the listings of the second set of search listings after execution of step (d); (f) ranking, by the processor, the sponsored first set of search listings in accordance, at least in part, with the confidence score for each search listing thereof, wherein the processor associates the sponsored first set of search listings with at least one feature different than the relevance of each search listing when compared to the listings of the second set of search listings, and the processor further orders the sponsored first set of search listings in accordance with the at least one feature, the at least one feature comprising any of a number of clicks, a click-through rate, and a conversion rate derived from historical click-through and conversion data from user activity on the sponsored first set of search listings; (g) computing a plurality of demotion terms related to a plurality of the top-ranked sponsored first set of search listings, wherein the demotion terms capture non-ideal characteristics thereof; (h) updating the confidence score of each of the top-ranked sponsored first set of search listings based on the plurality of demotion terms; and (i) re-ranking the top-ranked sponsored first set of search listings according to the updated confidence scores. 2. The method of claim 1 , wherein each search listing is associated with one or more search terms.
| 0.859375 |
9,953,638 | 13 | 15 |
13. One or more non-transitory computer-readable media storing executable instructions that, when executed by a processor, cause a system to: receive a sequence of speech features that characterize an unknown speech input provided on an audio input channel controlled by an application executing on the system; receive meta-data that characterizes the audio input channel, an audio codec applied when generating the sequence of speech features, and a type of the application; transform the sequence of speech features using one or more trained mapping functions including a feature-space maximum mutual information (fMMI) mapping function, the one or more trained mapping functions controlled by the meta-data that characterizes the audio input channel, the audio codec applied when generating the sequence of speech features, and the type of the application, the fMMI mapping function using neural network based posterior estimates that use the meta-data as input, wherein transforming the sequence of speech features comprises reducing a dimensionality of the sequence of speech features; and perform automatic speech recognition of the transformed speech features.
|
13. One or more non-transitory computer-readable media storing executable instructions that, when executed by a processor, cause a system to: receive a sequence of speech features that characterize an unknown speech input provided on an audio input channel controlled by an application executing on the system; receive meta-data that characterizes the audio input channel, an audio codec applied when generating the sequence of speech features, and a type of the application; transform the sequence of speech features using one or more trained mapping functions including a feature-space maximum mutual information (fMMI) mapping function, the one or more trained mapping functions controlled by the meta-data that characterizes the audio input channel, the audio codec applied when generating the sequence of speech features, and the type of the application, the fMMI mapping function using neural network based posterior estimates that use the meta-data as input, wherein transforming the sequence of speech features comprises reducing a dimensionality of the sequence of speech features; and perform automatic speech recognition of the transformed speech features. 15. The one or more non-transitory computer-readable media of claim 13 , wherein the one or more trained mapping functions include a linear discriminant analysis (LDA) mapping function.
| 0.557416 |
9,575,946 | 1 | 5 |
1. A system comprising: a speech recognition processor to convert speech to text; a first text display for displaying to a user a first sequence of text items, an active text item, and an active cursor position, wherein ones of the first sequence of text items are separated by text boundaries, wherein the first sequence of text items is limited to a maximum number of text items, wherein the first active text item corresponds to one of the sequence of text items, and wherein the active cursor position is associated with either a displayed text item or a text boundary; a second text display for displaying a second sequence of text items and a second active text item, wherein the second sequence of text items includes the first sequence of text items, and wherein the second text display is synchronized with the first text display so that the first active text item and second active text item are the same; a user control to enable the user to adjust the first active text item and the active cursor position within the first sequence of text items; and a text editing module to: determine the first sequence of text items to display from the second sequence of text items based upon the active cursor position and the maximum number of text items; receive new text from the speech recognition processor; determine if the active cursor position is an active text boundary or an active text item; if the active cursor position is an text boundary, insert the new text between the displayed text items separated by the active text boundary; and if the active cursor position is an active text item, replace a displayed text item text item with the new text, wherein the first and second text displays are text displays within an automobile passenger compartment, wherein the first text display is positioned directly in front of an automobile driver, and wherein the second text display is positioned to one side of the automobile driver.
|
1. A system comprising: a speech recognition processor to convert speech to text; a first text display for displaying to a user a first sequence of text items, an active text item, and an active cursor position, wherein ones of the first sequence of text items are separated by text boundaries, wherein the first sequence of text items is limited to a maximum number of text items, wherein the first active text item corresponds to one of the sequence of text items, and wherein the active cursor position is associated with either a displayed text item or a text boundary; a second text display for displaying a second sequence of text items and a second active text item, wherein the second sequence of text items includes the first sequence of text items, and wherein the second text display is synchronized with the first text display so that the first active text item and second active text item are the same; a user control to enable the user to adjust the first active text item and the active cursor position within the first sequence of text items; and a text editing module to: determine the first sequence of text items to display from the second sequence of text items based upon the active cursor position and the maximum number of text items; receive new text from the speech recognition processor; determine if the active cursor position is an active text boundary or an active text item; if the active cursor position is an text boundary, insert the new text between the displayed text items separated by the active text boundary; and if the active cursor position is an active text item, replace a displayed text item text item with the new text, wherein the first and second text displays are text displays within an automobile passenger compartment, wherein the first text display is positioned directly in front of an automobile driver, and wherein the second text display is positioned to one side of the automobile driver. 5. A system according to claim 1 , wherein the text items include multi-word text phrases.
| 0.840989 |
9,589,579 | 7 | 8 |
7. A method comprising: identifying a natural language processing system that is associated with a virtual assistant; evaluating the natural language processing system by processing test user input with the natural language processing system, the test user input having been previously associated with a particular result; determining that the processing does not identify the particular result; and causing display of a user interface with an indicator associated with the test user input to enable a user to modify an element of the natural language processing system that is associated with at least one of the test user input or the particular result that has been previously associated with the test user input, the indicator indicating that the processing does not identify the particular result.
|
7. A method comprising: identifying a natural language processing system that is associated with a virtual assistant; evaluating the natural language processing system by processing test user input with the natural language processing system, the test user input having been previously associated with a particular result; determining that the processing does not identify the particular result; and causing display of a user interface with an indicator associated with the test user input to enable a user to modify an element of the natural language processing system that is associated with at least one of the test user input or the particular result that has been previously associated with the test user input, the indicator indicating that the processing does not identify the particular result. 8. The method of claim 7 , wherein the test user input is associated with the particular result by at least one of the user or another user.
| 0.894419 |
8,006,268 | 1 | 4 |
1. A method implemented by a client device having a processor executing instructions stored in computer-readable storage media, the method comprising: receiving video signals broadcast on a multiplexed channel of a broadcast network; extracting from the received video signals a closed captioning stream of textual data; creating an active list comprising a plurality of first search terms by presenting a plurality of questions at a user interface to be answered by a viewer to develop the first search terms for creating the active list; creating a passive list comprising a plurality of second search terms by: monitoring closed captioning textual data during receipt of one or more previously received closed captioning streams of textual data of received video signals that the viewer has viewed or recorded, extracting words and phrases as potential search terms from the closed captioning textual data, and automatically selecting the plurality of second search terms from the potential search terms based on a recentness and a frequency of occurrence of the extracted words and phrases; searching the stream of textual data for occurrences of textual data matching one or more of the first search terms in the active list or one or more of the second search terms in the passive list, the searching comprising: storing content programming corresponding to the received video signals in a buffer; comparing, by the processor, the closed captioning stream of textual data to both the active list and the passive list; determining whether a number of matches of the first search terms of the active list and the second search terms of the passive list with the textual data exceeds a threshold number, wherein the number of matches is based on a combination, over a period of time, of a number of hits with respect to the first search terms in the active list and a number of hits with respect to the second search terms in the passive list; and applying a greater weight to the first search terms in the active list than a weight applied to the second search terms in the passive list when counting the number of matches; when the number of matches of the first search terms of the active list and the second search terms of the passive list does not exceed the threshold number after a predetermined period of time, ceasing to search a first closed captioning stream of textual data from a first channel before an end of the first closed captioning stream is reached, deleting the corresponding content programming from the buffer, and searching instead a second closed captioning stream of textual data from a second channel; and notifying the viewer when the number of matches exceeds the threshold number that content programming determined to be of interest to the viewer has been located.
|
1. A method implemented by a client device having a processor executing instructions stored in computer-readable storage media, the method comprising: receiving video signals broadcast on a multiplexed channel of a broadcast network; extracting from the received video signals a closed captioning stream of textual data; creating an active list comprising a plurality of first search terms by presenting a plurality of questions at a user interface to be answered by a viewer to develop the first search terms for creating the active list; creating a passive list comprising a plurality of second search terms by: monitoring closed captioning textual data during receipt of one or more previously received closed captioning streams of textual data of received video signals that the viewer has viewed or recorded, extracting words and phrases as potential search terms from the closed captioning textual data, and automatically selecting the plurality of second search terms from the potential search terms based on a recentness and a frequency of occurrence of the extracted words and phrases; searching the stream of textual data for occurrences of textual data matching one or more of the first search terms in the active list or one or more of the second search terms in the passive list, the searching comprising: storing content programming corresponding to the received video signals in a buffer; comparing, by the processor, the closed captioning stream of textual data to both the active list and the passive list; determining whether a number of matches of the first search terms of the active list and the second search terms of the passive list with the textual data exceeds a threshold number, wherein the number of matches is based on a combination, over a period of time, of a number of hits with respect to the first search terms in the active list and a number of hits with respect to the second search terms in the passive list; and applying a greater weight to the first search terms in the active list than a weight applied to the second search terms in the passive list when counting the number of matches; when the number of matches of the first search terms of the active list and the second search terms of the passive list does not exceed the threshold number after a predetermined period of time, ceasing to search a first closed captioning stream of textual data from a first channel before an end of the first closed captioning stream is reached, deleting the corresponding content programming from the buffer, and searching instead a second closed captioning stream of textual data from a second channel; and notifying the viewer when the number of matches exceeds the threshold number that content programming determined to be of interest to the viewer has been located. 4. The method according to claim 1 , further comprising: displaying at least one occurrence of textual data matching the one or more first search terms or the one or more second search terms in context with adjacent words in the closed captioning stream of textual data such that the occurrence and respective context facilitate: vertical scrolling between a plurality of sources of occurrences of textual data matching said one or more search terms in the closed captioning stream of the plurality of sources; and horizontal scrolling illustrating chronological occurrences of textual data matching said one or more search terms in the closed captioning stream of a respective source.
| 0.604046 |
9,368,102 | 3 | 5 |
3. The method of claim 1 , further comprising: identifying at least one emotion indicator transmitted with the text data; and adding expression to the synthesized speech based on the identified at least one emotion indicator.
|
3. The method of claim 1 , further comprising: identifying at least one emotion indicator transmitted with the text data; and adding expression to the synthesized speech based on the identified at least one emotion indicator. 5. The method of claim 3 , wherein an emotion indicator includes punctuation, letter case, an acronym, emotion icon, annotated text, or a key word.
| 0.814394 |
7,730,395 | 3 | 9 |
3. The method of claim 1 further comprising the step of: storing said one or more virtual tags with said one or more transformation rules as a respective one or more virtual tag objects in a virtual tag repository; and retrieving said one or more stored virtual tag objects from said virtual repository when subsequently accessing said electronic document, said stored one or more transformation rules being used to generate said virtual page.
|
3. The method of claim 1 further comprising the step of: storing said one or more virtual tags with said one or more transformation rules as a respective one or more virtual tag objects in a virtual tag repository; and retrieving said one or more stored virtual tag objects from said virtual repository when subsequently accessing said electronic document, said stored one or more transformation rules being used to generate said virtual page. 9. The method of claim 3 further comprising the steps of: monitoring consecutive instances of said stored one or more virtual tags; categorizing the type of said stored one or more virtual tag having consecutive instances with characteristics to form a definition for said one or more virtual tags; and matching related one or more virtual tags to form a virtual link in said virtual tag repository.
| 0.7625 |
8,051,459 | 21 | 22 |
21. The system of claim 20 wherein the TC-related attributes include a user:profile:role:type:system profile reflecting TC requirements.
|
21. The system of claim 20 wherein the TC-related attributes include a user:profile:role:type:system profile reflecting TC requirements. 22. The system of claim 21 wherein the extended SELinux policy module further includes user:role:type attributes for SELinux.
| 0.5 |
7,836,437 | 13 | 16 |
13. A method, implemented at least in part by a computing device comprising one or more data storage components, the method comprising: storing, using one or more of the data storage components, an image of a virtual setting; storing, using one or more of the data storage components, at least one semantic tag with the image; storing, using one or more of the data storage components, a relation between the semantic tag and at least one portion of the image; storing, using one or more of the data storage components, a plurality of different computer-controlled characters, each having a different semantic knowledgebase associated therewith in which the semantic knowledgebase for each computer-controlled character is independent of the image and the semantic tag stored in relation to the at least one portion of the image; responding to a query, by a user of the virtual setting, of the at least one portion of the image, by dynamically providing a natural language output associated with a given one of the computer-controlled characters, in which the natural language output is based on a combination of the semantic tag and the semantic knowledgebase associated with the given computer-controlled character such that a response from another computer-controlled character, with a different associated semantic knowledgebase, is different from the natural language output from the given computer-controlled character; enabling a user to take the virtual photograph of an arbitrarily selected scene within the virtual world, in which the scene comprises the virtual object; and storing a depiction of the scene comprising the virtual object as a virtual photograph, including storing the semantic annotation associated with the virtual object in a state the semantic annotation has at the time the virtual photograph is taken, with the virtual photograph, in which the semantic annotation is attached to the image of the virtual object in the virtual photograph.
|
13. A method, implemented at least in part by a computing device comprising one or more data storage components, the method comprising: storing, using one or more of the data storage components, an image of a virtual setting; storing, using one or more of the data storage components, at least one semantic tag with the image; storing, using one or more of the data storage components, a relation between the semantic tag and at least one portion of the image; storing, using one or more of the data storage components, a plurality of different computer-controlled characters, each having a different semantic knowledgebase associated therewith in which the semantic knowledgebase for each computer-controlled character is independent of the image and the semantic tag stored in relation to the at least one portion of the image; responding to a query, by a user of the virtual setting, of the at least one portion of the image, by dynamically providing a natural language output associated with a given one of the computer-controlled characters, in which the natural language output is based on a combination of the semantic tag and the semantic knowledgebase associated with the given computer-controlled character such that a response from another computer-controlled character, with a different associated semantic knowledgebase, is different from the natural language output from the given computer-controlled character; enabling a user to take the virtual photograph of an arbitrarily selected scene within the virtual world, in which the scene comprises the virtual object; and storing a depiction of the scene comprising the virtual object as a virtual photograph, including storing the semantic annotation associated with the virtual object in a state the semantic annotation has at the time the virtual photograph is taken, with the virtual photograph, in which the semantic annotation is attached to the image of the virtual object in the virtual photograph. 16. The method of claim 13 , wherein the image comprises pixels that each have associated with them color component values and an object identifier, wherein the at least one portion of the image has a single object identifier associated with each of the pixels comprised in that portion of the image.
| 0.651163 |
9,465,790 | 1 | 6 |
1. A method comprising: receiving textual data, and storing the received data in memory; analyzing the stored data, wherein the analysis comprises: identifying at least one sentence from the stored data; parsing parts of speech of each word of the at least one identified sentence using a linguistic parser, including parsing a verb from the at least one parsed sentence, and identifying a verb usage pattern in the at least one identified sentence; forming a low level subject-verb-object (SVO) triplet for the at least one parsed sentence, including identifying a subject, verb, and object of the at least one parsed sentence, wherein the identification of the subject, verb, and object comprises joining the identified verb usage pattern with a form of the identified verb to ascertain linguistic taxonomy; forming a high level SVO triplet for the at least one parsed sentence, including determining a subject category for the subject, a verb category for the verb, and an object category for the object based on the taxonomy; and classifying the at least one parsed sentence based on the high level SVO triplet; and summarizing the analysis of the stored data, including: producing an analysis report reflective of the analysis; and converting the produced analysis report into a summary report reflective of the analysis report, including clustering the received textual data into one or more statement clusters, wherein the summary report comprises the statement clusters.
|
1. A method comprising: receiving textual data, and storing the received data in memory; analyzing the stored data, wherein the analysis comprises: identifying at least one sentence from the stored data; parsing parts of speech of each word of the at least one identified sentence using a linguistic parser, including parsing a verb from the at least one parsed sentence, and identifying a verb usage pattern in the at least one identified sentence; forming a low level subject-verb-object (SVO) triplet for the at least one parsed sentence, including identifying a subject, verb, and object of the at least one parsed sentence, wherein the identification of the subject, verb, and object comprises joining the identified verb usage pattern with a form of the identified verb to ascertain linguistic taxonomy; forming a high level SVO triplet for the at least one parsed sentence, including determining a subject category for the subject, a verb category for the verb, and an object category for the object based on the taxonomy; and classifying the at least one parsed sentence based on the high level SVO triplet; and summarizing the analysis of the stored data, including: producing an analysis report reflective of the analysis; and converting the produced analysis report into a summary report reflective of the analysis report, including clustering the received textual data into one or more statement clusters, wherein the summary report comprises the statement clusters. 6. The method of claim 1 , wherein the joining of the identified verb usage pattern with a form of the identified verb comprises providing a mapping from the verb usage pattern to the identified verb based on a reference to an existing linguistic resource.
| 0.5 |
8,914,356 | 16 | 18 |
16. The computer readable storage medium of claim 15 , wherein the querying further comprises: marking the item type if the querying returns zero instances of the item type and if no other item type is marked.
|
16. The computer readable storage medium of claim 15 , wherein the querying further comprises: marking the item type if the querying returns zero instances of the item type and if no other item type is marked. 18. The computer readable storage medium of claim 16 , wherein the operations further comprises: unmarking the item type if subsequently querying another item type returns one or more instances of the another item type.
| 0.5 |
7,634,456 | 16 | 17 |
16. The medium of claim 15 , wherein the one or more annotations for each selected choice comprising: one or more semantically different alternatives to the selected choice that each, if used in the database query language statement, produce the same result; reasons for not performing one or more rewrites of the database query language statement; and information to be displayed to a developer of the database query language statement.
|
16. The medium of claim 15 , wherein the one or more annotations for each selected choice comprising: one or more semantically different alternatives to the selected choice that each, if used in the database query language statement, produce the same result; reasons for not performing one or more rewrites of the database query language statement; and information to be displayed to a developer of the database query language statement. 17. The medium of claim 16 , wherein the executed instructions further perform the method comprising: associating the one or more annotations for each selected choice to a corresponding operator of the database query language statement.
| 0.5 |
9,633,365 | 9 | 26 |
9. A system comprising: one or more computers; a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, causes the one or more computers to perform operations comprising: receiving data indicating that a first user performed a conversion action in response to a first ad, wherein the received data includes an ad ID for the first ad and a first limited ID cookie that only identifies an encrypted user ID for the first user; decrypting the first limited ID cookie to obtain the user ID of the first user; creating a conversion record that includes the user ID for the first user an entity ID for an entity associated with the first ad, and the conversion action performed by the first user; receiving an ad request over a network from a client device of a second user, the ad request including a second limited ID cookie that only identifies an encrypted user ID for the second user; decrypting the second limited ID cookie to obtain the user ID of the second user; determining that the second user is a social contact of the first user in a social network based on the user ID of the second user and the user ID of the first user; in response to receiving the ad request, selecting a second ad with an ad ID; determining, based on the ad ID of the second ad, that the second ad is associated with a same entity as the first ad that is associated with the conversion action performed by the first user; retrieving conversion records containing the entity ID for the same entity, wherein the retrieved conversion records include at least the created conversion record; constructing a detailed annotation for display in the second ad based on the created conversion record that contains the user ID for the first user, wherein the detailed annotation identifies (i) the user ID of the first user, (ii) the conversion action performed by the first user, and (iii) the same entity; and sending the detailed annotation over the network to the client device in a format suitable for presentation on a display of the client device in conjunction with the selected ad.
|
9. A system comprising: one or more computers; a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, causes the one or more computers to perform operations comprising: receiving data indicating that a first user performed a conversion action in response to a first ad, wherein the received data includes an ad ID for the first ad and a first limited ID cookie that only identifies an encrypted user ID for the first user; decrypting the first limited ID cookie to obtain the user ID of the first user; creating a conversion record that includes the user ID for the first user an entity ID for an entity associated with the first ad, and the conversion action performed by the first user; receiving an ad request over a network from a client device of a second user, the ad request including a second limited ID cookie that only identifies an encrypted user ID for the second user; decrypting the second limited ID cookie to obtain the user ID of the second user; determining that the second user is a social contact of the first user in a social network based on the user ID of the second user and the user ID of the first user; in response to receiving the ad request, selecting a second ad with an ad ID; determining, based on the ad ID of the second ad, that the second ad is associated with a same entity as the first ad that is associated with the conversion action performed by the first user; retrieving conversion records containing the entity ID for the same entity, wherein the retrieved conversion records include at least the created conversion record; constructing a detailed annotation for display in the second ad based on the created conversion record that contains the user ID for the first user, wherein the detailed annotation identifies (i) the user ID of the first user, (ii) the conversion action performed by the first user, and (iii) the same entity; and sending the detailed annotation over the network to the client device in a format suitable for presentation on a display of the client device in conjunction with the selected ad. 26. The system of claim 9 , wherein the data indicating that the first user performed the conversion action is received from an application executing outside of a web browser.
| 0.808114 |
9,639,818 | 1 | 7 |
1. A system comprising: At least one processor; and A non-transitory computer-readable storage medium configured to store instructions executable by the at least one processor, the system further including: An event type generator configured to cause the at least one processor to provide a training set for training a supervised machine learning algorithm to classify documents with respect to an event type, the even generator including A request handler configured to receive the event type and at least one example document designated as being associated with the event type; A text analyzer configured to extract first entities from the at least one example document; and A result manager configured to execute to first search against an indexed corpus of documents, using the first entities, to obtain first search results, and further configured to receive at least one selected document from the first search results, Wherein the request hander is further configured to extract second entities from the at least one selected document, and execute a second search against the indexed corpus of documents, using the second entities, to obtain second search results, and Wherein the event type generator is further configured to provide the at least one example document, the first search results, and the second search results as the training set, Wherein the event type generator is configured to provide the training set in an iteration fashion, in which the at least one selected document and the second search results represent the first two iterations thereof, and in which iterations are halted when a corresponding halt criteria is satisfied, and Wherein the system further comprises a record generator configured to cause the at least one processor to receive a plurality of documents associated with a plurality suppliers, the second generator including an event including an event classifier configured to execute a supplier-independent, event-based classification of each with respect to the event type, wherein the record generator is further configured to cause the at least one processor to provide supplier-specified data records, based on the event-based classification, and generate a graphical view of a selected supplier with respect to at least one performance indicator, in conjunction with a at least one corresponding supplier-specific data record.
|
1. A system comprising: At least one processor; and A non-transitory computer-readable storage medium configured to store instructions executable by the at least one processor, the system further including: An event type generator configured to cause the at least one processor to provide a training set for training a supervised machine learning algorithm to classify documents with respect to an event type, the even generator including A request handler configured to receive the event type and at least one example document designated as being associated with the event type; A text analyzer configured to extract first entities from the at least one example document; and A result manager configured to execute to first search against an indexed corpus of documents, using the first entities, to obtain first search results, and further configured to receive at least one selected document from the first search results, Wherein the request hander is further configured to extract second entities from the at least one selected document, and execute a second search against the indexed corpus of documents, using the second entities, to obtain second search results, and Wherein the event type generator is further configured to provide the at least one example document, the first search results, and the second search results as the training set, Wherein the event type generator is configured to provide the training set in an iteration fashion, in which the at least one selected document and the second search results represent the first two iterations thereof, and in which iterations are halted when a corresponding halt criteria is satisfied, and Wherein the system further comprises a record generator configured to cause the at least one processor to receive a plurality of documents associated with a plurality suppliers, the second generator including an event including an event classifier configured to execute a supplier-independent, event-based classification of each with respect to the event type, wherein the record generator is further configured to cause the at least one processor to provide supplier-specified data records, based on the event-based classification, and generate a graphical view of a selected supplier with respect to at least one performance indicator, in conjunction with a at least one corresponding supplier-specific data record. 7. The system of claim 1 , wherein selection of the second search result is received from among initial second search results provided in conjunction with the at least one selected document from the first search results.
| 0.586466 |
7,546,278 | 1 | 2 |
1. A computer-readable storage device containing instructions for controlling a computer system to generate a distance metric for pairs of categories of a hierarchical taxonomy for documents, by a method comprising: providing for each pair of categories in the taxonomy a path length between the categories, the taxonomy being represented by nodes and edges between nodes, each node representing a category, the edges representing a hierarchy of the categories, wherein a path length for a pair of categories is the number of edges in the shortest path between nodes representing the categories, each pair of categories referring to each possible combination of two different categories; providing for each pair of categories in the taxonomy a term space distance indicating distance between term feature vectors representing terms of documents within the categories, each term feature vector for a document including frequencies for keywords in the document; generating a distance metric between pairs of categories based on minimization of the differences between path lengths and distances derived from new feature vector representations of the categories and minimization of the differences between term space distances between term feature vectors and distances derived from the new feature vector representations; classifying documents into categories of the hierarchical taxonomy using the generated distance metric; organizing search results of documents into categories based on the classification of the documents into categories; and presenting to a user the search results as organized into the categories wherein the term space distances are F-norm distances.
|
1. A computer-readable storage device containing instructions for controlling a computer system to generate a distance metric for pairs of categories of a hierarchical taxonomy for documents, by a method comprising: providing for each pair of categories in the taxonomy a path length between the categories, the taxonomy being represented by nodes and edges between nodes, each node representing a category, the edges representing a hierarchy of the categories, wherein a path length for a pair of categories is the number of edges in the shortest path between nodes representing the categories, each pair of categories referring to each possible combination of two different categories; providing for each pair of categories in the taxonomy a term space distance indicating distance between term feature vectors representing terms of documents within the categories, each term feature vector for a document including frequencies for keywords in the document; generating a distance metric between pairs of categories based on minimization of the differences between path lengths and distances derived from new feature vector representations of the categories and minimization of the differences between term space distances between term feature vectors and distances derived from the new feature vector representations; classifying documents into categories of the hierarchical taxonomy using the generated distance metric; organizing search results of documents into categories based on the classification of the documents into categories; and presenting to a user the search results as organized into the categories wherein the term space distances are F-norm distances. 2. The computer-readable storage device of claim 1 including training a document classifier using the distance metric.
| 0.5 |
7,941,468 | 1 | 3 |
1. A method utilizing a computer for finding patent infringers, comprising: receiving patent information related to at least one patent, associated patent support data relating to the patent information, and reference materials; analyzing the patent information, the associated patent support data relating to the patent information, and the reference materials; creating a patent search profile based at least in part on analysis of the patent information, the associated patent support data relating to the patent information, and the reference materials, the patent search profile at least including keywords associated with the at least one patent; analyzing claim structure of the at least one patent to determine a dependency relationship among at least two claims of the at least one patent; based on analysis of the claim structure of the at least one patent, utilizing the keywords of the patent search profile determined to be included in the at least two claims having the dependency relationship together when conducting a search for the patent infringers; searching sources of public information utilizing the patent search profile for the patent infringers of the at least one patent and providing patent search results identifying the patent infringers of the at least one patent; and generating a patent search results report.
|
1. A method utilizing a computer for finding patent infringers, comprising: receiving patent information related to at least one patent, associated patent support data relating to the patent information, and reference materials; analyzing the patent information, the associated patent support data relating to the patent information, and the reference materials; creating a patent search profile based at least in part on analysis of the patent information, the associated patent support data relating to the patent information, and the reference materials, the patent search profile at least including keywords associated with the at least one patent; analyzing claim structure of the at least one patent to determine a dependency relationship among at least two claims of the at least one patent; based on analysis of the claim structure of the at least one patent, utilizing the keywords of the patent search profile determined to be included in the at least two claims having the dependency relationship together when conducting a search for the patent infringers; searching sources of public information utilizing the patent search profile for the patent infringers of the at least one patent and providing patent search results identifying the patent infringers of the at least one patent; and generating a patent search results report. 3. The method of claim 1 , wherein the patent information includes first information included in the at least one patent, the patent support data includes second information included in a prosecution history of the at least one patent, and the reference materials include other public information.
| 0.81846 |
10,038,786 | 12 | 21 |
12. An apparatus, comprising: at least one processor; and a storage module having stored therein machine executable instructions, that when executed by the at least one processor, cause the apparatus to: determine one or more mood metrics in each of two or more chat stages of a real-time textual conversation between an agent and a customer, wherein said determining the one or more mood metrics for a chat stage of the real-time textual conversation, by the processor, further comprises determining an overall mood for the chat stage based on a polarity based approach by: assigning polarity labels to features present in the chat stage; assigning polarity strength scores for the polarity labels assigned to the features present in the chat stage; calculating weighted polarity scores for the features based on aggregation of the polarity labels and the polarity strength scores to determine the overall mood for the chat stage; and determining the overall mood based on a subjectivity-based approach by removing terms classified as objective from the real-time textual conversation prior to assigning the polarity labels and the polarity strength scores; track changes in the one or more mood metrics across the two or more chat stages of the real-time textual conversation between the agent and the customer; and determine at least one action associated with the real-time textual conversation based on the changes in the one or more mood metrics; and an input-output (I/O) module; wherein the at least one processor is further configured to cause the apparatus to perform the at least one action by enabling the I/O module to any of: displaying one or more textual recommendations to the agent so as to enable the agent to use the one or more textual recommendations in the real-time textual conversation to thereby cause a target outcome of the real-time textual conversation; displaying information associated with the at least one action to a supervisor monitoring the real-time textual conversation and causing the I/O module to provide the information associated with the at least one action to the agent engaged in the real-time textual conversation based on an input received from the supervisor so as to enable the agent to perform the at least one action thereby causing a target outcome of the real-time textual conversation; monitoring an agent engagement score associated with the two or more chat stages of the real-time textual conversation; storing the real-time textual conversation with a timestamp of the real-time textual conversation; and displaying one or more textual recommendations to the agent so as to enable the agent to use the one or more textual recommendations in the real-time textual conversation to thereby cause a target outcome of the real-time textual conversation.
|
12. An apparatus, comprising: at least one processor; and a storage module having stored therein machine executable instructions, that when executed by the at least one processor, cause the apparatus to: determine one or more mood metrics in each of two or more chat stages of a real-time textual conversation between an agent and a customer, wherein said determining the one or more mood metrics for a chat stage of the real-time textual conversation, by the processor, further comprises determining an overall mood for the chat stage based on a polarity based approach by: assigning polarity labels to features present in the chat stage; assigning polarity strength scores for the polarity labels assigned to the features present in the chat stage; calculating weighted polarity scores for the features based on aggregation of the polarity labels and the polarity strength scores to determine the overall mood for the chat stage; and determining the overall mood based on a subjectivity-based approach by removing terms classified as objective from the real-time textual conversation prior to assigning the polarity labels and the polarity strength scores; track changes in the one or more mood metrics across the two or more chat stages of the real-time textual conversation between the agent and the customer; and determine at least one action associated with the real-time textual conversation based on the changes in the one or more mood metrics; and an input-output (I/O) module; wherein the at least one processor is further configured to cause the apparatus to perform the at least one action by enabling the I/O module to any of: displaying one or more textual recommendations to the agent so as to enable the agent to use the one or more textual recommendations in the real-time textual conversation to thereby cause a target outcome of the real-time textual conversation; displaying information associated with the at least one action to a supervisor monitoring the real-time textual conversation and causing the I/O module to provide the information associated with the at least one action to the agent engaged in the real-time textual conversation based on an input received from the supervisor so as to enable the agent to perform the at least one action thereby causing a target outcome of the real-time textual conversation; monitoring an agent engagement score associated with the two or more chat stages of the real-time textual conversation; storing the real-time textual conversation with a timestamp of the real-time textual conversation; and displaying one or more textual recommendations to the agent so as to enable the agent to use the one or more textual recommendations in the real-time textual conversation to thereby cause a target outcome of the real-time textual conversation. 21. The apparatus of claim 12 , wherein the apparatus is further configured to determine the at least one action based on a statistical analysis of one or more completed textual conversations.
| 0.828265 |
7,813,926 | 20 | 21 |
20. The system of claim 17 wherein a training component invokes the speech recognition component to recognize the input utterances from the one or more sets of training data during multiple training iterations.
|
20. The system of claim 17 wherein a training component invokes the speech recognition component to recognize the input utterances from the one or more sets of training data during multiple training iterations. 21. The system of claim 20 wherein the training component uses the classification error rate to determine whether to perform additional training iterations.
| 0.5 |
9,519,640 | 10 | 11 |
10. A method for presenting a translation of information at a location to a wearer of a see-through head mounted display apparatus, comprising: receiving from the wearer a selection of input data for translation at the location of the wearer; determining three dimensional locations of objects within a field of view of the wearer at the location; receiving a selection of input data based on an object within the field of view for translation in the field of view of the wearer; retrieving wearer profile information bearing on an accuracy of a translation; analyzing the input data to select a type of translation to perform, the types of translations comprising each of a linguistic translation from a first language to a second language, an informational translation which provides additional information regarding a particular subject or scene in the input data and a context translation which provides information on an emotional state of a person in the field of view should be provided based on the input data, wherein the linguistic, informational and context translations are different types of translations; determining wearer proficiency in a language of subject matter in the analyzed input data from the wearer profile information; determining a complexity of the translation based on the determined wearer knowledge; determining one of a plurality of output formats for the translation; performing one or more of the linguistic translation, the informational translation or the context translation on the input data based on determining a translation type and the determined translation complexity, the translation based on wearer feedback on translation accuracy of previous translations; and rendering the translation in at least one of the plurality of output formats, the plurality of output formats comprising an audio output format and a visual output format in the see-through head mounted display.
|
10. A method for presenting a translation of information at a location to a wearer of a see-through head mounted display apparatus, comprising: receiving from the wearer a selection of input data for translation at the location of the wearer; determining three dimensional locations of objects within a field of view of the wearer at the location; receiving a selection of input data based on an object within the field of view for translation in the field of view of the wearer; retrieving wearer profile information bearing on an accuracy of a translation; analyzing the input data to select a type of translation to perform, the types of translations comprising each of a linguistic translation from a first language to a second language, an informational translation which provides additional information regarding a particular subject or scene in the input data and a context translation which provides information on an emotional state of a person in the field of view should be provided based on the input data, wherein the linguistic, informational and context translations are different types of translations; determining wearer proficiency in a language of subject matter in the analyzed input data from the wearer profile information; determining a complexity of the translation based on the determined wearer knowledge; determining one of a plurality of output formats for the translation; performing one or more of the linguistic translation, the informational translation or the context translation on the input data based on determining a translation type and the determined translation complexity, the translation based on wearer feedback on translation accuracy of previous translations; and rendering the translation in at least one of the plurality of output formats, the plurality of output formats comprising an audio output format and a visual output format in the see-through head mounted display. 11. The method of claim 10 wherein an intelligent translation includes determining subject matter in the input data, retrieving supplementation information on the subject matter; determining wearer knowledge of the subject matter from the wearer profile information; determining a complexity of supplemental knowledge information and outputting the information.
| 0.54534 |
8,185,553 | 8 | 10 |
8. A system comprising at least one processor programmed to: receive an input data stream comprising speech data documenting a physician's encounter with a patient, the input data stream comprising latent information associated with a type of medical report appropriate for documenting the encounter with the patient; process the input data stream to identify the latent information; based on the identified latent information, identify the type of medical report appropriate for documenting the encounter with the patient; activate a template specific to the identified type of medical report appropriate for documenting the encounter with the patient, wherein the template specifies at least a plurality of data fields required for documenting the encounter with the patient; obtain, from the input data stream, information corresponding to at least one of the data fields specified by the activated template; and populate the template with the obtained information to generate a medical report that documents the encounter with the patient.
|
8. A system comprising at least one processor programmed to: receive an input data stream comprising speech data documenting a physician's encounter with a patient, the input data stream comprising latent information associated with a type of medical report appropriate for documenting the encounter with the patient; process the input data stream to identify the latent information; based on the identified latent information, identify the type of medical report appropriate for documenting the encounter with the patient; activate a template specific to the identified type of medical report appropriate for documenting the encounter with the patient, wherein the template specifies at least a plurality of data fields required for documenting the encounter with the patient; obtain, from the input data stream, information corresponding to at least one of the data fields specified by the activated template; and populate the template with the obtained information to generate a medical report that documents the encounter with the patient. 10. The system of claim 8 , wherein the latent information comprises information about at least one medical fact selected from the group consisting of a medical problem, an allergy, a medical treatment, a medication and a medical procedure.
| 0.6 |
8,402,118 | 1 | 5 |
1. A computer program product to generate and manage logical units (LUNs) in a storage network environment, the computer program product comprising a computer-usable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising: computer-usable program code to determine a type for a LUN; computer-usable program code to identify at least one server that will access the LUN; computer-usable program code to identify a storage system that will host the LUN; computer-usable program code to generate a LUN name that encapsulates the type, the at least one server, and the storage system; computer-usable program code to assign the LUN name to the LUN; and computer-usable program code to debug a problem associated with the LUN by determining, from the LUN name, at least one of the type, the at least one server, and the storage system associated with the LUN.
|
1. A computer program product to generate and manage logical units (LUNs) in a storage network environment, the computer program product comprising a computer-usable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising: computer-usable program code to determine a type for a LUN; computer-usable program code to identify at least one server that will access the LUN; computer-usable program code to identify a storage system that will host the LUN; computer-usable program code to generate a LUN name that encapsulates the type, the at least one server, and the storage system; computer-usable program code to assign the LUN name to the LUN; and computer-usable program code to debug a problem associated with the LUN by determining, from the LUN name, at least one of the type, the at least one server, and the storage system associated with the LUN. 5. The computer program product of claim 1 , wherein generating a LUN name comprises storing abbreviations for at least one of the type, the at least one server, and the storage system in the LUN name.
| 0.5 |
7,479,943 | 11 | 19 |
11. A portable electronic system comprising: a processor; a bus coupled to said processor; an electronic display device coupled to said bus; a memory device coupled to said bus; and a data input device coupled to said bus and configured to provide multiple different methods of data input to the portable electronic system, said data input device comprising: a data input surface for detecting a gesture performed thereon by a user and for facilitating recognition of said gesture as corresponding to a particular data input, wherein said data input surface is responsive to a touch thereon and is spaced apart from the display device, and a user removable template having one of a plurality of marking configurations, wherein each marking configuration facilitates operating said data input surface in one of a plurality of functional configurations, wherein said user removable template is positioned over said data input surface for dividing said data input surface into a first data input area and a second data input area, wherein said first data input area is configured to facilitate recognition of one or more first gestures, and wherein said second data input area is configured to facilitate recognition of one or more second gestures associated with one of said functional configurations.
|
11. A portable electronic system comprising: a processor; a bus coupled to said processor; an electronic display device coupled to said bus; a memory device coupled to said bus; and a data input device coupled to said bus and configured to provide multiple different methods of data input to the portable electronic system, said data input device comprising: a data input surface for detecting a gesture performed thereon by a user and for facilitating recognition of said gesture as corresponding to a particular data input, wherein said data input surface is responsive to a touch thereon and is spaced apart from the display device, and a user removable template having one of a plurality of marking configurations, wherein each marking configuration facilitates operating said data input surface in one of a plurality of functional configurations, wherein said user removable template is positioned over said data input surface for dividing said data input surface into a first data input area and a second data input area, wherein said first data input area is configured to facilitate recognition of one or more first gestures, and wherein said second data input area is configured to facilitate recognition of one or more second gestures associated with one of said functional configurations. 19. An electronic system as recited in claim 11 further comprising one or more communication ports.
| 0.805882 |
9,685,171 | 16 | 19 |
16. A method comprising: detecting a first sound representative of a target voice and a second sound representative of noise, the first sound being captured by a first microphone and the second sound being captured by a second microphone; implementing a delay with respect to a first audio signal that represents the noise and refraining from delaying a second audio signal that represents the target voice; terminating the delay based at least in part on detecting the noise; processing, by a first adaptive filter, the target voice to generate a target voice estimate, the target voice estimate representing a first estimate of the target voice of a user associated with the first sound; processing, by the first adaptive filter, the noise to generate a noise estimate, the noise estimate representing a second estimate of the noise within an environment associated with the user; and generating, by a second adaptive filter different from the first adaptive filter, an enhanced target voice based at least in part on at least one of the target voice estimate or the noise estimate.
|
16. A method comprising: detecting a first sound representative of a target voice and a second sound representative of noise, the first sound being captured by a first microphone and the second sound being captured by a second microphone; implementing a delay with respect to a first audio signal that represents the noise and refraining from delaying a second audio signal that represents the target voice; terminating the delay based at least in part on detecting the noise; processing, by a first adaptive filter, the target voice to generate a target voice estimate, the target voice estimate representing a first estimate of the target voice of a user associated with the first sound; processing, by the first adaptive filter, the noise to generate a noise estimate, the noise estimate representing a second estimate of the noise within an environment associated with the user; and generating, by a second adaptive filter different from the first adaptive filter, an enhanced target voice based at least in part on at least one of the target voice estimate or the noise estimate. 19. The method as recited in claim 16 , further comprising determining the enhanced target voice based at least in part on a suppression of the noise.
| 0.791667 |
7,583,205 | 1 | 9 |
1. A method of disambiguating an input into a handheld electronic device having an input apparatus, an output apparatus, and a memory having stored therein a plurality of language objects and a plurality of frequency objects, each of at least some of the language objects being associated with an associated frequency object, the input apparatus including a plurality of input members, each of at least some of the input members having a plurality of linguistic elements assigned thereto, the method comprising: detecting an ambiguous input; identifying a first language object corresponding with a first portion of the ambiguous input and having a length equal to the length of the first portion; identifying a second language object corresponding with a second portion of the ambiguous input; identifying an alternate first language object corresponding with an alternate first portion of the ambiguous input and having a length equal to the length of the alternate first portion; identifying an alternate second language object corresponding with an alternate second portion of the ambiguous input; and outputting a solution representative of the first language object and at least a portion of the second language object and an alternate solution representative of the alternate first language object and at least a portion of the alternate second language object.
|
1. A method of disambiguating an input into a handheld electronic device having an input apparatus, an output apparatus, and a memory having stored therein a plurality of language objects and a plurality of frequency objects, each of at least some of the language objects being associated with an associated frequency object, the input apparatus including a plurality of input members, each of at least some of the input members having a plurality of linguistic elements assigned thereto, the method comprising: detecting an ambiguous input; identifying a first language object corresponding with a first portion of the ambiguous input and having a length equal to the length of the first portion; identifying a second language object corresponding with a second portion of the ambiguous input; identifying an alternate first language object corresponding with an alternate first portion of the ambiguous input and having a length equal to the length of the alternate first portion; identifying an alternate second language object corresponding with an alternate second portion of the ambiguous input; and outputting a solution representative of the first language object and at least a portion of the second language object and an alternate solution representative of the alternate first language object and at least a portion of the alternate second language object. 9. The method of claim 1 , further comprising outputting as the solution an output representative of the first language object and an initial portion of the second language object having a length equal to the length of the second portion of the ambiguous input.
| 0.766547 |
8,489,625 | 1 | 4 |
1. A method implemented at least partially by a processor, the method comprising: constructing a graph by extracting queries from mobile search logs and identifying users that sent the queries, times at which the users sent the queries, and locations from which the users sent the queries; calculating a similarity between the users from the graph based at least in part on similarities between the queries, the times at which the users submitted the queries, and the locations from which the users submitted the queries; receiving, from a mobile computing device of a particular user, a query input associated with a current time and with a current location of the mobile computing device; and at least partly in response to the receiving of the query input: identifying, from the graph, one or more queries previously submitted by users that have previously submitted the query input, the one or more other queries comprising candidate queries; and computing a relatedness of each of the candidate queries to the received query input based at least in part on: (1) a calculated similarity between a respective user that submitted the candidate query and the particular user, (2) a difference between the current time associated with the received query input and a time when the candidate query was submitted, and (3) a distance between the current location associated with the received query input and a location where the candidate query was submitted; and removing, from the mobile search logs, one or more submitted queries that are not associated with time and location information.
|
1. A method implemented at least partially by a processor, the method comprising: constructing a graph by extracting queries from mobile search logs and identifying users that sent the queries, times at which the users sent the queries, and locations from which the users sent the queries; calculating a similarity between the users from the graph based at least in part on similarities between the queries, the times at which the users submitted the queries, and the locations from which the users submitted the queries; receiving, from a mobile computing device of a particular user, a query input associated with a current time and with a current location of the mobile computing device; and at least partly in response to the receiving of the query input: identifying, from the graph, one or more queries previously submitted by users that have previously submitted the query input, the one or more other queries comprising candidate queries; and computing a relatedness of each of the candidate queries to the received query input based at least in part on: (1) a calculated similarity between a respective user that submitted the candidate query and the particular user, (2) a difference between the current time associated with the received query input and a time when the candidate query was submitted, and (3) a distance between the current location associated with the received query input and a location where the candidate query was submitted; and removing, from the mobile search logs, one or more submitted queries that are not associated with time and location information. 4. The method of claim 1 , further comprising: ranking the candidate queries based at least in part on the computed relatedness of each of the candidate queries to the received query input; and recommending at least a portion of the candidate queries based at least in part on the candidate queries and the received query input have many common users, both submitted the received query input about a same time, and both submitted the received query input at about a same location of mobile computing devices.
| 0.572391 |
8,286,102 | 17 | 19 |
17. A system, comprising: a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to implement a gesture module configured to: display a digital image on an electronic device, wherein the electronic device is configured to receive sets of gestural inputs; receive, via the electronic device, a gestural input set, wherein the gestural input set comprises a plurality of gestures, and wherein each given gesture of the received plurality of gestures: corresponds to one of multiple different regions within the digital image; and specifies a respective type of image processing constraint for processing the corresponding one of the multiple different regions within the digital image, wherein the respective type of image processing constraint depends on the gesture type of the given gesture; wherein the plurality of gestures in the received gestural input set include multiple different types of gestures such that the received gestural input set collectively specifies multiple types of image processing constraints; analyze the received gestural input set to determine, for each region of the multiple different regions, the respective type of image processing constraint for processing the region, as specified by the given gesture of the received plurality of gestures that corresponds to the region; and subsequent to receipt of the plurality of gestures including multiple different types of gestures, perform a particular image processing operation on the multiple different regions within the digital image according to each region's respective specified image processing constraint as specified by the type of gesture applied to that region.
|
17. A system, comprising: a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to implement a gesture module configured to: display a digital image on an electronic device, wherein the electronic device is configured to receive sets of gestural inputs; receive, via the electronic device, a gestural input set, wherein the gestural input set comprises a plurality of gestures, and wherein each given gesture of the received plurality of gestures: corresponds to one of multiple different regions within the digital image; and specifies a respective type of image processing constraint for processing the corresponding one of the multiple different regions within the digital image, wherein the respective type of image processing constraint depends on the gesture type of the given gesture; wherein the plurality of gestures in the received gestural input set include multiple different types of gestures such that the received gestural input set collectively specifies multiple types of image processing constraints; analyze the received gestural input set to determine, for each region of the multiple different regions, the respective type of image processing constraint for processing the region, as specified by the given gesture of the received plurality of gestures that corresponds to the region; and subsequent to receipt of the plurality of gestures including multiple different types of gestures, perform a particular image processing operation on the multiple different regions within the digital image according to each region's respective specified image processing constraint as specified by the type of gesture applied to that region. 19. The system of claim 17 , wherein said performing a particular image processing operation on the multiple different regions within the digital image each according to its respective specified image processing constraint comprises generating an image constraint mask dependent on the gesture types of the plurality of gestures, wherein said generating the image constraint mask is dependent on the multiple different regions of the digital image.
| 0.5 |
8,078,453 | 1 | 6 |
1. A method of computer analysis of at least one communication originated from a person, comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine risk posed by the person from at least one of emotional state or emotional tone represented by the text of the group of words in each of the at least one communication; and in response to the determined risk posed by the person from the at least one of emotional state or emotional tone generating with a computer an output communication pertaining to the risk posed by the person from the at least one of emotional state or emotional tone of the at least one communication.
|
1. A method of computer analysis of at least one communication originated from a person, comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine risk posed by the person from at least one of emotional state or emotional tone represented by the text of the group of words in each of the at least one communication; and in response to the determined risk posed by the person from the at least one of emotional state or emotional tone generating with a computer an output communication pertaining to the risk posed by the person from the at least one of emotional state or emotional tone of the at least one communication. 6. A method in accordance with claim 1 wherein the output communication includes a responsive action that should be taken in response to the determined risk.
| 0.71558 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.