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,797,724 | 8 | 10 | 8. A method for securely providing access to a content file, the method comprising the steps of: (a) requesting, by a user via a client device, access to a content file; (b) filtering, by a filtering mechanism, the request by applying pre-determined rules; (c) creating, by a transport mechanism executing on the client device, a document container on the client device; (d) receiving, by the document container from a server, the content file following said filtering; (e) storing, by a storage buffer on the client device, the received content file in a volatile memory element; (f) invoking, by the document container, an application program associated with the content file, the application program providing a set of menu commands for interacting with the application program; and (g) generating, by the document container, a replacement set of menu commands comprising a subset of the set of menu commands provided by the application program. | 8. A method for securely providing access to a content file, the method comprising the steps of: (a) requesting, by a user via a client device, access to a content file; (b) filtering, by a filtering mechanism, the request by applying pre-determined rules; (c) creating, by a transport mechanism executing on the client device, a document container on the client device; (d) receiving, by the document container from a server, the content file following said filtering; (e) storing, by a storage buffer on the client device, the received content file in a volatile memory element; (f) invoking, by the document container, an application program associated with the content file, the application program providing a set of menu commands for interacting with the application program; and (g) generating, by the document container, a replacement set of menu commands comprising a subset of the set of menu commands provided by the application program. 10. The method of claim 8 wherein said rules are applied based upon a category of the content file requested. | 0.5 |
10,049,197 | 1 | 7 | 1. A computing system for implementing an authentication and verification system, the system comprising: physical storage media configured to store information that represents audio characteristics of sounds generated by a speaker; and one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtain an input mapping between user-selectable input options and a set of prompts that represent words; obtain a target sequence of prompts that corresponds to the target personal identification sequence; obtain a redirection mapping and effectuate presentation of the redirection mapping to the unidentified user prior to effectuating presentation of the set of prompts; effectuate a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtain one or more audio files comprising sound generated by the unidentified user in response to the presentation; make a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticate the unidentified user responsive to a positive first determination; make a second determination whether the obtained one or more audio files match the audio characteristics of the sounds generated by the speaker; automatically verify the unidentified user responsive to a positive second determination; and effectuate a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. | 1. A computing system for implementing an authentication and verification system, the system comprising: physical storage media configured to store information that represents audio characteristics of sounds generated by a speaker; and one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtain an input mapping between user-selectable input options and a set of prompts that represent words; obtain a target sequence of prompts that corresponds to the target personal identification sequence; obtain a redirection mapping and effectuate presentation of the redirection mapping to the unidentified user prior to effectuating presentation of the set of prompts; effectuate a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtain one or more audio files comprising sound generated by the unidentified user in response to the presentation; make a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticate the unidentified user responsive to a positive first determination; make a second determination whether the obtained one or more audio files match the audio characteristics of the sounds generated by the speaker; automatically verify the unidentified user responsive to a positive second determination; and effectuate a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. 7. The system of claim 1 , wherein the target personal identification sequence includes numerical digits in a range from zero to nine. | 0.843091 |
7,739,141 | 8 | 12 | 8. A computer program product in a computer readable storage medium for providing a consulting assessment environment, the computer program product comprising: computer usable program code stored in the computer readable storage medium, wherein the computer usable program code is adapted to cause a processor in a computer to perform steps comprising: determining an intended use for the consulting assessment environment, wherein the intended use is one of defining assessment business logic and conducting a self-assessment, wherein defining assessment business logic is performed by a consultant, wherein conducting a self-assessment is performed by the consultant or a client, and wherein self-assessment data is stored separately from the assessment business logic; responsive to determining that the intended use is defining assessment business logic, defining a data template, an assessment framework template, a suggested actions template, and a report template to create the assessment business logic for multiple types of assessments for assessing businesses, further comprising: encoding the data template, the assessment framework template, the suggested actions template, and the report template with formulas and logic rule definitions to define how self-assessment data is used to generate assessment results and recommendations; translating a plurality of hypotheses into interview questions for assessing a current state of a business; and encoding proprietary information and trade secrets into the data template, the assessment framework template, the suggested actions template, and the report template, wherein the proprietary information and the trade secrets of the consulting assessment environment are accessible to the consultant and are made inaccessible to clients using a hiding feature; responsive to determining that the intended use is conducting a self-assessment, receiving the self-assessment data about the business through a questionnaire, wherein the questionnaire is defined using the data template encoded with the interview questions and business-related domain knowledge of business practices; responsive to receiving the self-assessment data about the business, computing at least one assessment score based on the formulas and the logic rule definitions encoded in the assessment framework template; responsive to computing the at least one assessment score, determining an appropriate action based on the at least one assessment score and the suggested actions template encoded with business-related domain knowledge that defines actions to achieve desired states of businesses; and reporting results of the self-assessment data based on the at least one assessment score and the appropriate action in accordance with the report template, wherein the data template, the assessment framework template, and the suggested actions template encode business-related domain knowledge including at least one of best practices, business consultant expertise, and business goals, and wherein the proprietary information and the trade secrets of the consulting assessment environment are hidden from the client. | 8. A computer program product in a computer readable storage medium for providing a consulting assessment environment, the computer program product comprising: computer usable program code stored in the computer readable storage medium, wherein the computer usable program code is adapted to cause a processor in a computer to perform steps comprising: determining an intended use for the consulting assessment environment, wherein the intended use is one of defining assessment business logic and conducting a self-assessment, wherein defining assessment business logic is performed by a consultant, wherein conducting a self-assessment is performed by the consultant or a client, and wherein self-assessment data is stored separately from the assessment business logic; responsive to determining that the intended use is defining assessment business logic, defining a data template, an assessment framework template, a suggested actions template, and a report template to create the assessment business logic for multiple types of assessments for assessing businesses, further comprising: encoding the data template, the assessment framework template, the suggested actions template, and the report template with formulas and logic rule definitions to define how self-assessment data is used to generate assessment results and recommendations; translating a plurality of hypotheses into interview questions for assessing a current state of a business; and encoding proprietary information and trade secrets into the data template, the assessment framework template, the suggested actions template, and the report template, wherein the proprietary information and the trade secrets of the consulting assessment environment are accessible to the consultant and are made inaccessible to clients using a hiding feature; responsive to determining that the intended use is conducting a self-assessment, receiving the self-assessment data about the business through a questionnaire, wherein the questionnaire is defined using the data template encoded with the interview questions and business-related domain knowledge of business practices; responsive to receiving the self-assessment data about the business, computing at least one assessment score based on the formulas and the logic rule definitions encoded in the assessment framework template; responsive to computing the at least one assessment score, determining an appropriate action based on the at least one assessment score and the suggested actions template encoded with business-related domain knowledge that defines actions to achieve desired states of businesses; and reporting results of the self-assessment data based on the at least one assessment score and the appropriate action in accordance with the report template, wherein the data template, the assessment framework template, and the suggested actions template encode business-related domain knowledge including at least one of best practices, business consultant expertise, and business goals, and wherein the proprietary information and the trade secrets of the consulting assessment environment are hidden from the client. 12. The computer program product of claim 8 further comprising: providing an interface for the client to conduct the self-assessment to gather the self-assessment data about the business, wherein the self-assessment data is used to determine the current state of the business, and wherein automated data synthesis is performed to relate the current state of the business to a desired state of the business in real time. | 0.65429 |
8,392,445 | 9 | 10 | 9. The method of claim 1 , wherein each first parent query is a high quality parent query for the particular child query, and each second parent query for a particular candidate sibling query is a high quality parent query for the particular sibling query. | 9. The method of claim 1 , wherein each first parent query is a high quality parent query for the particular child query, and each second parent query for a particular candidate sibling query is a high quality parent query for the particular sibling query. 10. The method of claim 9 , wherein a high quality parent query has a high inverse document frequency in a corpus of documents. | 0.5 |
8,478,903 | 28 | 35 | 28. A method, in a content delivery system operative in a computer network for delivering content to client machines, the computer network comprising a plurality of origin servers, each of said origin servers having resources associated therewith, and the content delivery system comprising at least one shared repeater server operable to replicate resources associated with the plurality of origin servers, the method comprising: associating the at least one repeater server with a first alias name, wherein requests for a first resource located on a first origin server are directed, based at least in part on said first alias name, to the at least one repeater server for delivery of the first resource from said at least one repeater server; associating the at least one repeater server with a second alias name, wherein requests for a second resource located on a second origin server are directed, based at least in part on said second alias name, to the at least one repeater server for delivery of the second resource from said at least one repeater server, wherein the second origin server is distinct from the first origin server; providing a table listing origin servers having content located thereon, wherein said content is authorized for delivery to client machines via the at least one shared repeater server, and wherein the origin servers comprise the first origin server and the second origin server; and wherein the at least one repeater server is further constructed and adapted to analyze, using the table, an alias name received with a client request for a particular resource to determine an origin server associated with the particular resource. | 28. A method, in a content delivery system operative in a computer network for delivering content to client machines, the computer network comprising a plurality of origin servers, each of said origin servers having resources associated therewith, and the content delivery system comprising at least one shared repeater server operable to replicate resources associated with the plurality of origin servers, the method comprising: associating the at least one repeater server with a first alias name, wherein requests for a first resource located on a first origin server are directed, based at least in part on said first alias name, to the at least one repeater server for delivery of the first resource from said at least one repeater server; associating the at least one repeater server with a second alias name, wherein requests for a second resource located on a second origin server are directed, based at least in part on said second alias name, to the at least one repeater server for delivery of the second resource from said at least one repeater server, wherein the second origin server is distinct from the first origin server; providing a table listing origin servers having content located thereon, wherein said content is authorized for delivery to client machines via the at least one shared repeater server, and wherein the origin servers comprise the first origin server and the second origin server; and wherein the at least one repeater server is further constructed and adapted to analyze, using the table, an alias name received with a client request for a particular resource to determine an origin server associated with the particular resource. 35. A method as recited in claim 28 , wherein the table further comprises, for each of the listed origin servers, information from the group consisting of: a reflector name and a committed aggregate information rate (CAIR). | 0.790414 |
8,825,648 | 1 | 7 | 1. A method comprising: under a control of one or more processors, identifying multiple concept-units from a multi-language document corpus, a respective concept-unit including a set of documents in a plurality of languages describing a particular concept, the identifying including identifying one or more hyperlinks or references within a respective document that identify one or more other documents in one or more other languages relating to the particular concept; and modeling the concept-units of the multi-language document corpus by maintaining a separation of term-by-document matrices for the plurality of languages to create a generative model, the generative model representing: a plurality of universal topics, at least one respective universal topic being defined by a plurality of topic word distributions in the plurality of languages, at least one of the plurality of topic word distributions for a respective universal topic corresponding to a respective language from the plurality of languages and including one or more words in the respective language with corresponding probability values characterizing the respective universal topic; and a topic distribution for at least one concept-unit, the topic distribution for a respective concept-unit including one or more universal topics and their distributions for the respective concept-unit, the set of documents in the different plurality of languages of the respective concept-unit being constrained to share a common topic distribution. | 1. A method comprising: under a control of one or more processors, identifying multiple concept-units from a multi-language document corpus, a respective concept-unit including a set of documents in a plurality of languages describing a particular concept, the identifying including identifying one or more hyperlinks or references within a respective document that identify one or more other documents in one or more other languages relating to the particular concept; and modeling the concept-units of the multi-language document corpus by maintaining a separation of term-by-document matrices for the plurality of languages to create a generative model, the generative model representing: a plurality of universal topics, at least one respective universal topic being defined by a plurality of topic word distributions in the plurality of languages, at least one of the plurality of topic word distributions for a respective universal topic corresponding to a respective language from the plurality of languages and including one or more words in the respective language with corresponding probability values characterizing the respective universal topic; and a topic distribution for at least one concept-unit, the topic distribution for a respective concept-unit including one or more universal topics and their distributions for the respective concept-unit, the set of documents in the different plurality of languages of the respective concept-unit being constrained to share a common topic distribution. 7. A method as recited in claim 1 , further comprising: obtaining topic distributions of documents of a classified document corpus; obtaining topic distributions of documents of an unclassified document corpus; comparing topic distributions between the documents of the unclassified document corpus and the documents of the classified document corpus; and classifying one or more documents of the unclassified document corpus according to classifications of documents in the classified document corpus having common topic distributions with the one or more documents of the unclassified document corpus. | 0.5 |
9,262,391 | 8 | 9 | 8. The processing system according to claim 1 , further comprising: a display to display the presentation in a raw format. | 8. The processing system according to claim 1 , further comprising: a display to display the presentation in a raw format. 9. The processing system according to claim 8 , further comprising: a field programmable gate array to route the presentation between the memory buffer and the display, and to accept the presentation as an input from a computer. | 0.5 |
7,814,208 | 1 | 7 | 1. A method of communicating between computers, comprising the steps of: (1) transmitting from a first computer to an intermediate server computer a first HTTP POST message through a firewall that is open to outbound Internet traffic, wherein the first HTTP POST message requests establishment of a connection between the first computer and the intermediate server computer over a first return path; (2) receiving from the intermediate server computer a response including a connection identifier corresponding to the first return path; (3) periodically transmitting from the intermediate server computer to the first computer a “keep alive” message over the first return path, if no further messages are sent to the first computer within a period of time; (4) exchanging encryption keys between the first computer and the intermediate server computer; (5) repeating steps (1) through (4) between a second computer and the intermediate server computer, thereby creating a second return path between the second computer and the intermediate server computer; (6) transmitting encrypted information from the first computer through the firewall to the intermediate server computer using further HTTP POST messages; and (7) transmitting the encrypted information from the intermediate server over the second return path. | 1. A method of communicating between computers, comprising the steps of: (1) transmitting from a first computer to an intermediate server computer a first HTTP POST message through a firewall that is open to outbound Internet traffic, wherein the first HTTP POST message requests establishment of a connection between the first computer and the intermediate server computer over a first return path; (2) receiving from the intermediate server computer a response including a connection identifier corresponding to the first return path; (3) periodically transmitting from the intermediate server computer to the first computer a “keep alive” message over the first return path, if no further messages are sent to the first computer within a period of time; (4) exchanging encryption keys between the first computer and the intermediate server computer; (5) repeating steps (1) through (4) between a second computer and the intermediate server computer, thereby creating a second return path between the second computer and the intermediate server computer; (6) transmitting encrypted information from the first computer through the firewall to the intermediate server computer using further HTTP POST messages; and (7) transmitting the encrypted information from the intermediate server over the second return path. 7. The method of claim 1 , wherein the first firewall and the second firewall are configured not to allow incoming network messages, unless the incoming network messages are responsive to network messages initiated by a computer inside the firewall. | 0.676623 |
7,624,007 | 11 | 15 | 11. A distributed method of recognizing and responding in real time to a user question posed within an application program executing on a client device, comprising: receiving query data generated by the client device over a network; considering a context experienced by a user within the application and loading one or both of appropriate grammars or dictionaries for the context; processing the query data at a server device to form a query text associated with the user question using the appropriate grammars and dictionaries; submitting the query text to a database query engine and a natural language engine so as to simultaneously process the query text using the natural language engine to identify any word phrases in the query text, and retrieve a first set of question/answer pairs from a question/answer pair database using the database query engine; forming a combined query to a question/answer pair database using the database query engine, the combined query being based on the query text concatenated with the word phrases and retrieving a second set of question/answer pairs using the combined query; evaluating the first and second sets of question/answer pairs by comparing word phrases in the sets of question/answer pairs with the word phrases from the query text to identify at least one question/answer pair that best matches the user question; and providing an answer to the user question in real-time over a distributed query system, the answer being determined from the question/answer pair that best matches the user question. | 11. A distributed method of recognizing and responding in real time to a user question posed within an application program executing on a client device, comprising: receiving query data generated by the client device over a network; considering a context experienced by a user within the application and loading one or both of appropriate grammars or dictionaries for the context; processing the query data at a server device to form a query text associated with the user question using the appropriate grammars and dictionaries; submitting the query text to a database query engine and a natural language engine so as to simultaneously process the query text using the natural language engine to identify any word phrases in the query text, and retrieve a first set of question/answer pairs from a question/answer pair database using the database query engine; forming a combined query to a question/answer pair database using the database query engine, the combined query being based on the query text concatenated with the word phrases and retrieving a second set of question/answer pairs using the combined query; evaluating the first and second sets of question/answer pairs by comparing word phrases in the sets of question/answer pairs with the word phrases from the query text to identify at least one question/answer pair that best matches the user question; and providing an answer to the user question in real-time over a distributed query system, the answer being determined from the question/answer pair that best matches the user question. 15. The method of claim 11 , wherein the query data is transmitted over the network using an Internet-based protocol. | 0.802365 |
8,041,119 | 1 | 7 | 1. A method for determining the orientation of Chinese words, the method comprising the steps of: (a) scanning, using a scanner, a paper document containing a Chinese word to generate a word image, the word image having a plurality of pixels, including a plurality of dark pixels forming the Chinese word and a plurality of bright pixels; (b) generating, by a processor, a plurality of horizontal coordinates corresponding to a plurality of vertical lines of the word image; (c) counting, by the processor, a plurality of vertical projections, each of which is the number of dark pixels on the vertical line associated with each of the horizontal coordinates; (d) selecting, by the processor, a first coordinate and a second coordinate, corresponding to the largest and second largest vertical projections, respectively; (e) selecting, by the processor, a third coordinate between the first coordinate and the second coordinate; and (f) determining, by the processor, the orientation of the Chinese word as right-side up if the third coordinate is located to the left of a center of the word image and as upside down if the third coordinate is located to the right of the center of the word image. | 1. A method for determining the orientation of Chinese words, the method comprising the steps of: (a) scanning, using a scanner, a paper document containing a Chinese word to generate a word image, the word image having a plurality of pixels, including a plurality of dark pixels forming the Chinese word and a plurality of bright pixels; (b) generating, by a processor, a plurality of horizontal coordinates corresponding to a plurality of vertical lines of the word image; (c) counting, by the processor, a plurality of vertical projections, each of which is the number of dark pixels on the vertical line associated with each of the horizontal coordinates; (d) selecting, by the processor, a first coordinate and a second coordinate, corresponding to the largest and second largest vertical projections, respectively; (e) selecting, by the processor, a third coordinate between the first coordinate and the second coordinate; and (f) determining, by the processor, the orientation of the Chinese word as right-side up if the third coordinate is located to the left of a center of the word image and as upside down if the third coordinate is located to the right of the center of the word image. 7. The method of claim 1 further comprising the step of determining whether the third coordinate is located to the right of the word image center and whether the distance between the third coordinate and the word image center is greater than a fourth value multiplying the word image width and the step of determining the word image as upside down if the determination result is yes. | 0.658036 |
7,739,658 | 21 | 22 | 21. A method as claimed in claim 17 , wherein the set of data objects further comprises multiple versions corresponding to a set of available user preferences; and further comprising: determining a user preference from the request message whereby the selecting step selects the data object according to the user preference. | 21. A method as claimed in claim 17 , wherein the set of data objects further comprises multiple versions corresponding to a set of available user preferences; and further comprising: determining a user preference from the request message whereby the selecting step selects the data object according to the user preference. 22. A method as claimed in claim 21 , wherein the multiple versions comprise versions in each of a set of languages and wherein the user preference comprises a preferred language. | 0.5 |
7,739,218 | 1 | 10 | 1. A computer readable medium embodying instructions executable by a processor to perform a method for managing electronic information, the method comprising: storing electronic files embodying the electronic information in a shared information repository that is shared by a community of client access devices, wherein the electronic files are categorized according to an ontology, wherein the ontology comprises an ontological model that is incrementally built and adapted over time based on multi-user interactions with the electronic information of the system; and incrementally adapting the ontology over time based on categorization rules that are automatically learned from knowledge obtained as a result of the multi-user interactions, wherein the multi-user interactions include one of accepting an automatic categorization of the electronic information and specifying a category of the electronic information. | 1. A computer readable medium embodying instructions executable by a processor to perform a method for managing electronic information, the method comprising: storing electronic files embodying the electronic information in a shared information repository that is shared by a community of client access devices, wherein the electronic files are categorized according to an ontology, wherein the ontology comprises an ontological model that is incrementally built and adapted over time based on multi-user interactions with the electronic information of the system; and incrementally adapting the ontology over time based on categorization rules that are automatically learned from knowledge obtained as a result of the multi-user interactions, wherein the multi-user interactions include one of accepting an automatic categorization of the electronic information and specifying a category of the electronic information. 10. The computer readable medium of claim 1 , wherein storing electronic files in a shared information repository further comprises allowing a client access device to associate unique metadata to one or more electronic files stored in the shared information repository. | 0.677458 |
8,612,445 | 15 | 16 | 15. The method of claim 13 , wherein the scores of the one or more partitions are based on centrality values of partitions in a graph corresponding to the composition, comprising: constructing at least one data array corresponding to at least one similarity matrix representing the plurality of similarity coefficients of the partitions; using said similarity matrix to build a graph showing connections between the partitions, wherein the partitions are nodes of the graph and edges of the graph show association of nodes based on the similarity between the connected nodes; scoring the one or more partitions based on centrality values of their corresponding nodes in the graph. | 15. The method of claim 13 , wherein the scores of the one or more partitions are based on centrality values of partitions in a graph corresponding to the composition, comprising: constructing at least one data array corresponding to at least one similarity matrix representing the plurality of similarity coefficients of the partitions; using said similarity matrix to build a graph showing connections between the partitions, wherein the partitions are nodes of the graph and edges of the graph show association of nodes based on the similarity between the connected nodes; scoring the one or more partitions based on centrality values of their corresponding nodes in the graph. 16. The method of claim 15 , wherein the centrality values are calculated by numerically solving at least one eigenvalue equation associated with the graph. | 0.75 |
8,713,054 | 12 | 55 | 12. A computer-implemented method to assist an information security classification process of an organization for security classification and marking of an electronic document on a computer system, said method comprising: a. performing on at least one computer system, b. establishing an electronic document security regimen comprising at least one criterion of an information security classification process, c. displaying a user classification dialogue for at least one informational portion of an electronic document, where said user classification dialogue comprising a menu of choices, where said menu of choices comprising at least one element for selection, and where said at least one element is associated with said at least one criterion of said electronic document security regimen, d. retrieving said at least one element where said at least one element is selected, e. establishing a classification mark from said at least one criterion associated with the retrieved said at least one element, and f. inserting said classification mark into said electronic document. | 12. A computer-implemented method to assist an information security classification process of an organization for security classification and marking of an electronic document on a computer system, said method comprising: a. performing on at least one computer system, b. establishing an electronic document security regimen comprising at least one criterion of an information security classification process, c. displaying a user classification dialogue for at least one informational portion of an electronic document, where said user classification dialogue comprising a menu of choices, where said menu of choices comprising at least one element for selection, and where said at least one element is associated with said at least one criterion of said electronic document security regimen, d. retrieving said at least one element where said at least one element is selected, e. establishing a classification mark from said at least one criterion associated with the retrieved said at least one element, and f. inserting said classification mark into said electronic document. 55. The method of claim 12 , wherein said inserting said classification mark into said electronic document, said classification mark is embedded into an electronic shell of said electronic document. | 0.797131 |
9,376,117 | 1 | 2 | 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. 2. The system of claim 1 , wherein the sensor set includes one or more in-vehicle cameras and the sensor data describes an image of the driver. | 0.896377 |
8,271,501 | 1 | 6 | 1. A method of web search by a search engine among rich media objects, the method comprising: maintaining, by a search engine for each of a plurality of users, a reputation score quantifying each user's activity of tagging rich media objects; counting a number of tags that include a particular searchable term, the particular searchable term among a plurality of searchable terms, the tags associated with a rich media object, the tag associations created by one or more of the plurality of users, the tags comprising text describing the rich media object, the text including the particular searchable term, the rich media object lacking a searchable textual element prior to the tag associations; calculating, by the search engine, a search result score for the particular searchable term included within tags of the rich media object, the search result score based on the number of tags associated with the rich media object that include the particular searchable term and the reputation scores of the users that associated the tags having the particular searchable term with the rich media object, the search result score specific to the particular searchable term, the rich media object having a distinct search result score for each of two or more searchable terms included in tags for the rich media object; and recording, by the search engine, in a primary search index, each search result score for each of the two or more searchable terms of the rich media object. | 1. A method of web search by a search engine among rich media objects, the method comprising: maintaining, by a search engine for each of a plurality of users, a reputation score quantifying each user's activity of tagging rich media objects; counting a number of tags that include a particular searchable term, the particular searchable term among a plurality of searchable terms, the tags associated with a rich media object, the tag associations created by one or more of the plurality of users, the tags comprising text describing the rich media object, the text including the particular searchable term, the rich media object lacking a searchable textual element prior to the tag associations; calculating, by the search engine, a search result score for the particular searchable term included within tags of the rich media object, the search result score based on the number of tags associated with the rich media object that include the particular searchable term and the reputation scores of the users that associated the tags having the particular searchable term with the rich media object, the search result score specific to the particular searchable term, the rich media object having a distinct search result score for each of two or more searchable terms included in tags for the rich media object; and recording, by the search engine, in a primary search index, each search result score for each of the two or more searchable terms of the rich media object. 6. The method of claim 1 further comprising: maintaining, by the search engine for at least one of the users, a personal search index in addition to the primary search index, including recording in the personal search index only tags associated by the at least one user with one or more rich media objects uploaded to a web server by the at least one user; receiving, by the search engine from the at least one user, a search request, the search request including as a search term one or more of the tags recorded in the user's personal search index; and returning, by the search engine in dependence upon the user's personal search index and the primary search index, one or more search results, the search results including one or more rich media objects. | 0.5 |
5,524,193 | 18 | 33 | 18. A computer for displaying a sequence of graphics, text, video and audio events, said computer comprising: means for displaying a plurality of triggers and a plurality of filter icons, each of said plurality of filter icons representing a respective one of a plurality of filters; means for selecting one of said plurality of triggers; means for selecting one of said plurality of filter icons; means for displaying a sequence of graphics, text, video and audio events connected to a selected trigger and a selected filter icon; wherein each of said plurality of filters designates a unique characteristic of events in said sequence of graphics, text, video and audio events connected to said selected trigger, and wherein each of said respective one of said plurality of filters is linked to a designated plurality of triggers and said selected trigger is linked to a designated plurality of filters. | 18. A computer for displaying a sequence of graphics, text, video and audio events, said computer comprising: means for displaying a plurality of triggers and a plurality of filter icons, each of said plurality of filter icons representing a respective one of a plurality of filters; means for selecting one of said plurality of triggers; means for selecting one of said plurality of filter icons; means for displaying a sequence of graphics, text, video and audio events connected to a selected trigger and a selected filter icon; wherein each of said plurality of filters designates a unique characteristic of events in said sequence of graphics, text, video and audio events connected to said selected trigger, and wherein each of said respective one of said plurality of filters is linked to a designated plurality of triggers and said selected trigger is linked to a designated plurality of filters. 33. The computer of claim 18 wherein said selected trigger is a section of an audio event. | 0.587156 |
8,280,823 | 288 | 294 | 288. The graphical user interface of claim 283 , wherein the required term of experience, or an alternative required term of experience, is rounded up to a unit of time. | 288. The graphical user interface of claim 283 , wherein the required term of experience, or an alternative required term of experience, is rounded up to a unit of time. 294. The graphical user interface of claim 288 , wherein to satisfy the search string, the parsed resume associated with each said at least one matching resume includes the required skill or experience-related phrase for at least one of said at least one search phrase, and the term of experience for the required skill or experience-related phrase is greater than or equal to the required term of experience. | 0.5 |
9,703,769 | 7 | 11 | 7. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: inserting, via a discriminative classification approach, boundary tags into speech utterance text, the boundary tags identifying boundaries selected from a group comprising phrase boundaries, sentence boundaries, and paragraph boundaries, wherein the discriminative classification approach utilizes syntactic features before and after each word being tagged, to yield boundary marked speech utterance text and unedited text; identifying a coordinating conjunction within the unedited text based on a conjunction tag, wherein the conjunction tag comprises conjunction span information indicating how many words to the left of the conjunction tag a corresponding conjunction includes; and identifying clauses in the speech utterance text based on the boundary marked speech utterance text and the coordinating conjunction. | 7. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: inserting, via a discriminative classification approach, boundary tags into speech utterance text, the boundary tags identifying boundaries selected from a group comprising phrase boundaries, sentence boundaries, and paragraph boundaries, wherein the discriminative classification approach utilizes syntactic features before and after each word being tagged, to yield boundary marked speech utterance text and unedited text; identifying a coordinating conjunction within the unedited text based on a conjunction tag, wherein the conjunction tag comprises conjunction span information indicating how many words to the left of the conjunction tag a corresponding conjunction includes; and identifying clauses in the speech utterance text based on the boundary marked speech utterance text and the coordinating conjunction. 11. The system of claim 7 , wherein a single classifier performs the inserting of the boundary tags, the identifying of the coordinating conjunction, and the identifying of the clauses in the speech utterance text. | 0.67378 |
8,522,140 | 16 | 26 | 16. A system for automatically positioning a plurality of text elements in an area of a markup language design of at least a portion of a document, the markup language design defining a plurality of text elements each haying a defined relative vertical positioning order, and further defining one or more vertical spacing distances, the one or more vertical spacing distances comprising one or more of either or both of a defined vertical spacing distance between adjacent text elements in the markup language design and a defined vertical spacing distance between data within the text elements in the markup language design, the system comprising: one or more design tools configured to access the markup language design of the document, allow a user to specify text content for one or more text elements in a markup language design, determine which of the plurality of text elements have specified text content, determine at least the height of each of the determined text elements having specified text content, and based on at least the determined text element heights, the one or more vertical spacing distances, and the defined positioning order, position each of those text elements having specified text content in the area such that each text element in the area is vertically separated from each adjacent text element by a defined spacing distance, whereby the layout of the text elements having specified text content is determined; and one or more processors configured to execute the design tools. | 16. A system for automatically positioning a plurality of text elements in an area of a markup language design of at least a portion of a document, the markup language design defining a plurality of text elements each haying a defined relative vertical positioning order, and further defining one or more vertical spacing distances, the one or more vertical spacing distances comprising one or more of either or both of a defined vertical spacing distance between adjacent text elements in the markup language design and a defined vertical spacing distance between data within the text elements in the markup language design, the system comprising: one or more design tools configured to access the markup language design of the document, allow a user to specify text content for one or more text elements in a markup language design, determine which of the plurality of text elements have specified text content, determine at least the height of each of the determined text elements having specified text content, and based on at least the determined text element heights, the one or more vertical spacing distances, and the defined positioning order, position each of those text elements having specified text content in the area such that each text element in the area is vertically separated from each adjacent text element by a defined spacing distance, whereby the layout of the text elements having specified text content is determined; and one or more processors configured to execute the design tools. 26. The system of claim 16 , wherein the one or more design tools are downloaded from one or more server computer systems. | 0.954066 |
9,886,444 | 8 | 9 | 8. The method of claim 1 wherein said asymmetrically encrypted electronic file is decrypted to obtain a decrypted file, wherein said decrypted file is associated with a file characteristic, wherein said electronic zip file archive also includes an asymmetrically encrypted version of said file characteristic, wherein said asymmetrically encrypted version of said file characteristic is decrypted. | 8. The method of claim 1 wherein said asymmetrically encrypted electronic file is decrypted to obtain a decrypted file, wherein said decrypted file is associated with a file characteristic, wherein said electronic zip file archive also includes an asymmetrically encrypted version of said file characteristic, wherein said asymmetrically encrypted version of said file characteristic is decrypted. 9. The method of claim 8 wherein said decrypting said file characteristic employs asymmetric decrypting. | 0.5 |
9,213,937 | 1 | 3 | 1. A computer-implemented method of synaptic gating in a network, the method being performed by one or more processors configured to execute computer program modules, the method comprising: generating an output at a node of the network, the output configured to inhibit a gating unit of the network; based on at least one spiking input signal, at least one continuous input signal and a teaching signal, pausing generation of the output; and based on the pausing, activating the gating unit, thereby effectuating the synaptic gating; wherein: generation of the output is characterized by an active node state configured in accordance with a supervised learning process; the pausing of the output generation is characterized by an inactive node state configured based on the teaching signal; and the teaching signal comprises one or more spikes configured to transition the node into the inactive state. | 1. A computer-implemented method of synaptic gating in a network, the method being performed by one or more processors configured to execute computer program modules, the method comprising: generating an output at a node of the network, the output configured to inhibit a gating unit of the network; based on at least one spiking input signal, at least one continuous input signal and a teaching signal, pausing generation of the output; and based on the pausing, activating the gating unit, thereby effectuating the synaptic gating; wherein: generation of the output is characterized by an active node state configured in accordance with a supervised learning process; the pausing of the output generation is characterized by an inactive node state configured based on the teaching signal; and the teaching signal comprises one or more spikes configured to transition the node into the inactive state. 3. The method of claim 1 , wherein the output is encoded using a continuous representation. | 0.873961 |
7,983,927 | 20 | 21 | 20. The method of claim 1 , further comprising rating the interaction record to establish a user-rated value of content in the interaction record. | 20. The method of claim 1 , further comprising rating the interaction record to establish a user-rated value of content in the interaction record. 21. The method of claim 20 , further comprising rating the user within the community of users based upon an aggregate rating of interaction records that the user rated. | 0.5 |
8,639,554 | 1 | 4 | 1. A system comprising: a computer processor; a display connected to the computer processor to display order images associated with a medical prescription order; an order receiving module executable by the computer processor to receive the medical prescription order; an image quality control processing module, executable by the computer processor, to determine whether the medical prescription order requires conversion to an image, to monitor the quality of captures of the order images, and to selectively accept and/or reject the order images captured by a scanner responsive to monitored image quality; an order header processing module executable by the computer processor to review and receive non-clinical data associated with the medical prescription order; an order completion processing module executable by the computer processor to receive and review clinical data associated with the medical prescription order; a protocol resolution processing module executable by the computer processor to resolve applicable protocols associated with the medical prescription order; and a command and control processing module to monitor and determine whether the medical prescription order remains in any one of a plurality of system queues longer than a predefined value. | 1. A system comprising: a computer processor; a display connected to the computer processor to display order images associated with a medical prescription order; an order receiving module executable by the computer processor to receive the medical prescription order; an image quality control processing module, executable by the computer processor, to determine whether the medical prescription order requires conversion to an image, to monitor the quality of captures of the order images, and to selectively accept and/or reject the order images captured by a scanner responsive to monitored image quality; an order header processing module executable by the computer processor to review and receive non-clinical data associated with the medical prescription order; an order completion processing module executable by the computer processor to receive and review clinical data associated with the medical prescription order; a protocol resolution processing module executable by the computer processor to resolve applicable protocols associated with the medical prescription order; and a command and control processing module to monitor and determine whether the medical prescription order remains in any one of a plurality of system queues longer than a predefined value. 4. The system of claim 1 , further comprising: a scanner connected to the computer processor to scan documents associated with medical prescription order. | 0.915755 |
8,706,500 | 12 | 14 | 12. A computer program product for establishing a multimodal personality for a multimodal application, the computer program product disposed upon a computer-readable storage device, the computer program product comprising computer program instructions capable of selecting, for use by the multimodal application, a vocal demeanor from a plurality of vocal demeanors, the vocal demeanor being characterized by a first attribute; selecting, for use by the multimodal application, a visual demeanor from a plurality of visual demeanors, the visual demeanor being characterized by a second attribute, wherein: the visual demeanor is selectable separately from the vocal demeanor; the visual demeanor is selected based on analyzing one or more aspects of a user's history; and the vocal and visual demeanors are selected such that the first attribute of the vocal demeanor matches the second attribute of the visual demeanor; and incorporating, by the multimodal application, the matching vocal and visual demeanors as a multimodal personality into the multimodal application, wherein the signal bearing medium comprises a recordable medium. | 12. A computer program product for establishing a multimodal personality for a multimodal application, the computer program product disposed upon a computer-readable storage device, the computer program product comprising computer program instructions capable of selecting, for use by the multimodal application, a vocal demeanor from a plurality of vocal demeanors, the vocal demeanor being characterized by a first attribute; selecting, for use by the multimodal application, a visual demeanor from a plurality of visual demeanors, the visual demeanor being characterized by a second attribute, wherein: the visual demeanor is selectable separately from the vocal demeanor; the visual demeanor is selected based on analyzing one or more aspects of a user's history; and the vocal and visual demeanors are selected such that the first attribute of the vocal demeanor matches the second attribute of the visual demeanor; and incorporating, by the multimodal application, the matching vocal and visual demeanors as a multimodal personality into the multimodal application, wherein the signal bearing medium comprises a recordable medium. 14. The computer program product of claim 12 wherein selecting a visual demeanor comprises selecting a visual demeanor in dependence upon a history of multimodal interactions between the multimodal application and a user. | 0.716667 |
4,715,011 | 1 | 9 | 1. A calculator for use by teachers for converting numeric scores into student letter grades comprising: means for inputting a high numeric standard and a low numeric standard; means for calculating numeric ranges between said high and low numeric standards, each of said ranges corresponding to a letter grade; means for inputting a student numeric score; means for determining the numeric range encompassing the student numeric score and for determining the corresponding student letter grade; and display means for displaying the corresponding student letter grade. | 1. A calculator for use by teachers for converting numeric scores into student letter grades comprising: means for inputting a high numeric standard and a low numeric standard; means for calculating numeric ranges between said high and low numeric standards, each of said ranges corresponding to a letter grade; means for inputting a student numeric score; means for determining the numeric range encompassing the student numeric score and for determining the corresponding student letter grade; and display means for displaying the corresponding student letter grade. 9. A calculator as defined in claim 1 wherein said determining means includes means for determining a grade point for each student numeric score, and wherein said display means includes means for displaying the grade point. | 0.533473 |
8,214,360 | 14 | 17 | 14. An apparatus in a clustering search engine, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive, from a requesting client of a requesting user, a search query, a bookmark data structure, and a viewed content history of the requesting user, wherein the viewed content history comprises at least a portion of a browser history maintained by the Web browser at the requesting client; perform a search to obtain a search result set comprising a plurality of data elements that satisfy the search query; classify the search result set using the bookmark data structure to generate a clustered result set, wherein the clustered result set comprises the plurality of data elements clustered into a base taxonomy of categories and wherein the base taxonomy of categories is defined by the bookmark data structure; classify the viewed content history of the requesting user into the base taxonomy of categories, wherein the base taxonomy of categories comprises a plurality of categories; rank the categories of the clustered result set according to the classification of the viewed content history to form a ranked cluster result set; and return the clustered result set to the requesting client, wherein the bookmark data structure is maintained by a Web browser at the requesting client. | 14. An apparatus in a clustering search engine, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive, from a requesting client of a requesting user, a search query, a bookmark data structure, and a viewed content history of the requesting user, wherein the viewed content history comprises at least a portion of a browser history maintained by the Web browser at the requesting client; perform a search to obtain a search result set comprising a plurality of data elements that satisfy the search query; classify the search result set using the bookmark data structure to generate a clustered result set, wherein the clustered result set comprises the plurality of data elements clustered into a base taxonomy of categories and wherein the base taxonomy of categories is defined by the bookmark data structure; classify the viewed content history of the requesting user into the base taxonomy of categories, wherein the base taxonomy of categories comprises a plurality of categories; rank the categories of the clustered result set according to the classification of the viewed content history to form a ranked cluster result set; and return the clustered result set to the requesting client, wherein the bookmark data structure is maintained by a Web browser at the requesting client. 17. The apparatus of claim 14 , wherein the instructions further cause the processor to: present a selectable control in association with a given data element in the clustered result set, such that responsive to the requesting user selecting the selectable control, the requesting client stores a bookmark for the given data element within a corresponding folder or subfolder in the bookmark data structure. | 0.5 |
8,902,988 | 8 | 9 | 8. The method of claim 1 , wherein the method comprises a method of decoding video data, the method further comprising: receiving a bitstream that represents encoded transform coefficients associated with the retained coefficient block within the first transform unit having the first size; selecting contexts for the encoded transform coefficients according to the joint context model; and entropy decoding the encoded transform coefficients into the retained coefficient block within the first transform unit having the first size based on the selected contexts. | 8. The method of claim 1 , wherein the method comprises a method of decoding video data, the method further comprising: receiving a bitstream that represents encoded transform coefficients associated with the retained coefficient block within the first transform unit having the first size; selecting contexts for the encoded transform coefficients according to the joint context model; and entropy decoding the encoded transform coefficients into the retained coefficient block within the first transform unit having the first size based on the selected contexts. 9. The method of claim 8 , further comprising: inverse transforming the transform coefficients of the retained coefficient block within the first transform unit having the first size into residual pixel values; and generating the first transform unit having the first size by adding zeros to the retained coefficient block. | 0.5 |
9,477,749 | 1 | 3 | 1. A system for determining causal factors in unstructured data, the system comprising: an unstructured data collection component configured to collect unstructured data from one or more sources of text; a natural language processing component configured to process text from the unstructured data to extract features from the unstructured data; a report generation component configured to generate a report based on features extracted from the unstructured data; a report presentation component configured to present the report to an operator and to allow the operator to select an observation from the report; a root cause component configured to determine one or more causal factors associated with the observation by calculating an impact of one or more of the features of the unstructured data on the observation selected by the operator using a baseline for comparison with the observation selected, the baseline being determined by the operator as either data comprising one or more features in which the observation is not present or data originating in a particular time period comprising one or more features in which the observation is present, and the impact on a measurable characteristic of the observation selected being calculated based on a comparison of one or more of the features of the unstructured data associated with the presence of the observation and features of the unstructured data associated with the baseline, the measurable characteristic being a volume-based metric, a sentiment metric, a satisfaction metric, or another user-defined metric, at least one of the one or more causal factors comprising one or more of the features; a memory configured to store the unstructured data collection component, the natural language processing component, the report generation component, the report presentation component, and the root cause component; and at least one processor to implement the unstructured data collection component, the natural language processing component, the report generation component, the report presentation component, and the root cause component. | 1. A system for determining causal factors in unstructured data, the system comprising: an unstructured data collection component configured to collect unstructured data from one or more sources of text; a natural language processing component configured to process text from the unstructured data to extract features from the unstructured data; a report generation component configured to generate a report based on features extracted from the unstructured data; a report presentation component configured to present the report to an operator and to allow the operator to select an observation from the report; a root cause component configured to determine one or more causal factors associated with the observation by calculating an impact of one or more of the features of the unstructured data on the observation selected by the operator using a baseline for comparison with the observation selected, the baseline being determined by the operator as either data comprising one or more features in which the observation is not present or data originating in a particular time period comprising one or more features in which the observation is present, and the impact on a measurable characteristic of the observation selected being calculated based on a comparison of one or more of the features of the unstructured data associated with the presence of the observation and features of the unstructured data associated with the baseline, the measurable characteristic being a volume-based metric, a sentiment metric, a satisfaction metric, or another user-defined metric, at least one of the one or more causal factors comprising one or more of the features; a memory configured to store the unstructured data collection component, the natural language processing component, the report generation component, the report presentation component, and the root cause component; and at least one processor to implement the unstructured data collection component, the natural language processing component, the report generation component, the report presentation component, and the root cause component. 3. The system of claim 1 , further comprising: an unstructured metadata component configured to determine structured data features associated with an unstructured text document of the unstructured data; wherein at least one of the one or more causal features is selected by the root cause component from the structured data features. | 0.733173 |
8,576,097 | 1 | 10 | 1. A method comprising: receiving a syntax element to be encoded as a code word, wherein the syntax element relates to at least one of a coded block pattern, a transform split pattern, or motion partition information; determining, by a computing device, a mapping between the syntax element and the code word on the basis of a hierarchy level in a tree structure, wherein the tree structure relates to at least one of a transform block size, a prediction block size, or a block size, and wherein the hierarchy level represents division of a block into smaller blocks; using the mapping to obtain the code word; and updating the mapping. | 1. A method comprising: receiving a syntax element to be encoded as a code word, wherein the syntax element relates to at least one of a coded block pattern, a transform split pattern, or motion partition information; determining, by a computing device, a mapping between the syntax element and the code word on the basis of a hierarchy level in a tree structure, wherein the tree structure relates to at least one of a transform block size, a prediction block size, or a block size, and wherein the hierarchy level represents division of a block into smaller blocks; using the mapping to obtain the code word; and updating the mapping. 10. The method according to claim 1 , wherein the hierarchy level corresponds with a set of nodes with equal distance from a root of the tree structure. | 0.835141 |
8,799,448 | 7 | 10 | 7. A method for generating a rule pack comprising a plurality of monitoring rules for monitoring a computer, said method comprising: receiving, by a computer system, said plurality of monitoring rules, said plurality of monitoring rules specified in a markup language, each of said plurality of monitoring rules associated with a respective one of a plurality of rule manifest files, wherein at least one of the plurality of rule manifest files includes a node comprising settings that are unique to a particular monitoring service; combining, by the computer system, said plurality of monitoring rules to produce said rule pack, wherein said rule pack relates to performance criteria factors comprising at least one of average processor use, memory use, or percent of full disk space, wherein the combining comprises merging the settings that are unique to the particular monitoring service from the node of the at least one of the plurality of rule manifest files with generic health monitoring rules; adding, by the computer system, to said rule pack at least one common setting that applies to two or more monitoring rules in said rule pack to specify how the two or more monitoring rules are applied, wherein adding to said rule pack said at least one common setting comprises evaluating a monitoring rule in said rule pack, determining whether a common setting applies to the evaluated monitoring rule, and, if so, adding the common setting in at least one common setting node; and converting, by the computer system, said rule pack from said markup language to a binary file. | 7. A method for generating a rule pack comprising a plurality of monitoring rules for monitoring a computer, said method comprising: receiving, by a computer system, said plurality of monitoring rules, said plurality of monitoring rules specified in a markup language, each of said plurality of monitoring rules associated with a respective one of a plurality of rule manifest files, wherein at least one of the plurality of rule manifest files includes a node comprising settings that are unique to a particular monitoring service; combining, by the computer system, said plurality of monitoring rules to produce said rule pack, wherein said rule pack relates to performance criteria factors comprising at least one of average processor use, memory use, or percent of full disk space, wherein the combining comprises merging the settings that are unique to the particular monitoring service from the node of the at least one of the plurality of rule manifest files with generic health monitoring rules; adding, by the computer system, to said rule pack at least one common setting that applies to two or more monitoring rules in said rule pack to specify how the two or more monitoring rules are applied, wherein adding to said rule pack said at least one common setting comprises evaluating a monitoring rule in said rule pack, determining whether a common setting applies to the evaluated monitoring rule, and, if so, adding the common setting in at least one common setting node; and converting, by the computer system, said rule pack from said markup language to a binary file. 10. A method according to claim 7 , wherein at least one of said plurality of monitoring rules specifies an event to monitor. | 0.797078 |
8,290,953 | 8 | 14 | 8. A system, comprising: a memory that stores resource names; and a processor programmed to: identify rule attributes for each of a plurality of prioritized naming rules, where a combination of the rule attributes represents a plurality of identifiers that uniquely identify resources via one or more of the plurality of prioritized naming rules; determine a naming context that makes the combination of the rule attributes for each of the plurality of prioritized naming rules unique; correlate the resource names for a plurality of resources generated by a plurality of management products within a single management domain based upon the plurality of prioritized naming rules comprising being programmed to correlate the resource names for the plurality of resources using the determined naming context and the identified rule attributes for each of the plurality of prioritized naming rules; determine whether each of the plurality of resources has more than one valid name within the single management domain based upon the correlated resource names for the plurality of resources; and select, for each resource determined to have more than one valid name within the single management domain, one of the valid names as a master name for the resource using the plurality of prioritized naming rules. | 8. A system, comprising: a memory that stores resource names; and a processor programmed to: identify rule attributes for each of a plurality of prioritized naming rules, where a combination of the rule attributes represents a plurality of identifiers that uniquely identify resources via one or more of the plurality of prioritized naming rules; determine a naming context that makes the combination of the rule attributes for each of the plurality of prioritized naming rules unique; correlate the resource names for a plurality of resources generated by a plurality of management products within a single management domain based upon the plurality of prioritized naming rules comprising being programmed to correlate the resource names for the plurality of resources using the determined naming context and the identified rule attributes for each of the plurality of prioritized naming rules; determine whether each of the plurality of resources has more than one valid name within the single management domain based upon the correlated resource names for the plurality of resources; and select, for each resource determined to have more than one valid name within the single management domain, one of the valid names as a master name for the resource using the plurality of prioritized naming rules. 14. The system of claim 8 , where, in being programmed to select, for each resource determined to have more than one valid name within the single management domain, one of the valid names as the master name for the resource using the plurality of prioritized naming rules, the processor is programmed to select one of a first name instance created for the resource and a name instance created with a highest priority rule among the plurality of prioritized naming rules. | 0.719905 |
8,756,276 | 7 | 10 | 7. A computer program product comprising a non-transitory computer-readable storage medium storing executable code, the code when executed performs steps comprising: identifying a first set of third-party content objects associated with a user of a social networking system; determining a delivery time range associated with the first set of third-party content objects describing when to provide the third-party content objects; determining whether to provide a first set of notifications of the first set of third-party content objects to a user device of the user based on the delivery time range and when a last notification of third-party content objects was provided to the client device; providing the first set of notifications of the first set of third-party content objects to the user device based on the determination; identifying a higher frequency of user interactions with the first set of notifications in a time period within the delivery time range compared to another time period within the delivery time range; and increasing a rate at which to provide a second set of notifications of third-party content objects during the time period based at least in part on the identified higher frequency of the received interactions in the time period, wherein the rate is a number of notifications that can be sent to the user during the time period. | 7. A computer program product comprising a non-transitory computer-readable storage medium storing executable code, the code when executed performs steps comprising: identifying a first set of third-party content objects associated with a user of a social networking system; determining a delivery time range associated with the first set of third-party content objects describing when to provide the third-party content objects; determining whether to provide a first set of notifications of the first set of third-party content objects to a user device of the user based on the delivery time range and when a last notification of third-party content objects was provided to the client device; providing the first set of notifications of the first set of third-party content objects to the user device based on the determination; identifying a higher frequency of user interactions with the first set of notifications in a time period within the delivery time range compared to another time period within the delivery time range; and increasing a rate at which to provide a second set of notifications of third-party content objects during the time period based at least in part on the identified higher frequency of the received interactions in the time period, wherein the rate is a number of notifications that can be sent to the user during the time period. 10. The computer program product of claim 7 , wherein identifying the higher frequency of user interactions with the first set of notifications comprises: identifying patterns in the user interactions with the first set of notifications, the patterns describing the characteristics of the interactions of the user with the first set of notifications. | 0.5 |
9,672,811 | 1 | 3 | 1. A method for processing an input window of an audio signal for speech recognition, the input window having a plurality of frames, the method comprising: extracting auditory attention features from each of the frames of the input window; extracting phone posteriors from each of the frames of the input window; generating combined boundary posteriors from a combination of the auditory attention features and the phone posteriors using machine learning by augmenting the extracted phone posteriors by feeding the phone posteriors of neighboring frames into a machine learning algorithm to generate phone posterior context information; estimating boundaries in speech contained in the audio signal from the combined boundary posteriors; and performing speech recognition using the estimated boundaries. | 1. A method for processing an input window of an audio signal for speech recognition, the input window having a plurality of frames, the method comprising: extracting auditory attention features from each of the frames of the input window; extracting phone posteriors from each of the frames of the input window; generating combined boundary posteriors from a combination of the auditory attention features and the phone posteriors using machine learning by augmenting the extracted phone posteriors by feeding the phone posteriors of neighboring frames into a machine learning algorithm to generate phone posterior context information; estimating boundaries in speech contained in the audio signal from the combined boundary posteriors; and performing speech recognition using the estimated boundaries. 3. The method of claim 1 , wherein said generating combined boundary posteriors includes: feeding the auditory attention features into a machine learning algorithm of a first boundary classifier to output a first set of boundary posteriors; feeding the phone posteriors into a machine learning algorithm of a second boundary classifier to output a second set of boundary posteriors; calibrating the first set of boundary posteriors and the second set of boundary posteriors to determine relative weights for the first set of boundary posteriors and a second set of boundary posteriors; and assigning the relative weights to the first set of boundary posteriors and the second set of boundary posteriors to output the combined boundary posteriors. | 0.5 |
8,489,623 | 10 | 11 | 10. A method comprising: receiving first input data; accessing an object-property mapping associated with an ontology for a data store, wherein the ontology comprises a plurality of data object types and a plurality of object property types; based on the object-property mapping, identifying a data object type, of the plurality of data object types, that is associated with input data rows in the first input data, wherein the data object type is mapped to two or more object property types; selecting, from a plurality of parser definitions, one or more parser definitions that match the input data rows; transforming the input data rows into data object instances of the identified data object type by using the one or more parser definitions, wherein each of the one or more parser definitions specifies two or more sub-definitions, wherein each of the two or more sub-definitions specifies how to transform one or more data values from one or more of the input data rows into one or more modified data values that are each compatible with a component of one of the plurality of the object property types of the ontology for the data store; wherein each component is associated with a data type of data; wherein transforming the input data rows into the data object instances further comprises creating a particular data object instance for a particular data row of the input data rows at least in part by performing: reading one or more data values from the particular row; for the particular data object instance: creating a component of an object property type that is associated with a matching one of the two or more sub-definition specified in the one of the one or more parser definitions; storing a particular data value of the one or more data values in the component that is associated with the matching sub-definition; storing the data object instances in the data store; wherein the method is performed by one or more computer systems. | 10. A method comprising: receiving first input data; accessing an object-property mapping associated with an ontology for a data store, wherein the ontology comprises a plurality of data object types and a plurality of object property types; based on the object-property mapping, identifying a data object type, of the plurality of data object types, that is associated with input data rows in the first input data, wherein the data object type is mapped to two or more object property types; selecting, from a plurality of parser definitions, one or more parser definitions that match the input data rows; transforming the input data rows into data object instances of the identified data object type by using the one or more parser definitions, wherein each of the one or more parser definitions specifies two or more sub-definitions, wherein each of the two or more sub-definitions specifies how to transform one or more data values from one or more of the input data rows into one or more modified data values that are each compatible with a component of one of the plurality of the object property types of the ontology for the data store; wherein each component is associated with a data type of data; wherein transforming the input data rows into the data object instances further comprises creating a particular data object instance for a particular data row of the input data rows at least in part by performing: reading one or more data values from the particular row; for the particular data object instance: creating a component of an object property type that is associated with a matching one of the two or more sub-definition specified in the one of the one or more parser definitions; storing a particular data value of the one or more data values in the component that is associated with the matching sub-definition; storing the data object instances in the data store; wherein the method is performed by one or more computer systems. 11. The method of claim 10 , comprising: iterating through the plurality of parser definitions in one or more iterations; at each of the one or more iterations, determining whether there is a match between one or more of the input data rows and a parser definition. | 0.5 |
8,829,322 | 1 | 11 | 1. A method for free rhythm musical input, the method comprising: receiving musical input comprising a sequence of notes; determining an optimal metrical grid corresponding to the sequence of notes, wherein the optimal metrical grid is defined as the metrical grid that optimally represents the sequence of notes, and wherein determining the optimal metrical grid is based in part on an a priori probability of the occurrence of the optimal metrical grid, wherein the a priori probability is independent of the sequence of notes; annotating the musical input with the optimal metrical grid; and storing a representation of the annotated musical input. | 1. A method for free rhythm musical input, the method comprising: receiving musical input comprising a sequence of notes; determining an optimal metrical grid corresponding to the sequence of notes, wherein the optimal metrical grid is defined as the metrical grid that optimally represents the sequence of notes, and wherein determining the optimal metrical grid is based in part on an a priori probability of the occurrence of the optimal metrical grid, wherein the a priori probability is independent of the sequence of notes; annotating the musical input with the optimal metrical grid; and storing a representation of the annotated musical input. 11. The method of claim 1 , wherein the sequence of notes is represented as a sequence of MIDI events. | 0.753623 |
9,606,784 | 1 | 2 | 1. A computer-implemented method for determining a common sequence of ordered statements, comprising: creating a global list comprising a first set of links generated from a first sequence of statements of a first script, wherein a link in the first set of links indicates an ordered mapping between a source statement and a destination statement selected from the first sequence of statements, and an ordered mapping indicates that a source statement is executed before a destination statement is executed; adding, to the global list, a second set of links generated from a second sequence of statements of a second script, wherein a link in the second set of links indicates an ordered mapping between a source statement and a destination statement selected from the second sequence of statements; determining, from the global list, two or more links having equivalent source statements and equivalent destination statements; adding at least one of the two or more links to a first group of common sequences; and storing the first group of common sequences in a database. | 1. A computer-implemented method for determining a common sequence of ordered statements, comprising: creating a global list comprising a first set of links generated from a first sequence of statements of a first script, wherein a link in the first set of links indicates an ordered mapping between a source statement and a destination statement selected from the first sequence of statements, and an ordered mapping indicates that a source statement is executed before a destination statement is executed; adding, to the global list, a second set of links generated from a second sequence of statements of a second script, wherein a link in the second set of links indicates an ordered mapping between a source statement and a destination statement selected from the second sequence of statements; determining, from the global list, two or more links having equivalent source statements and equivalent destination statements; adding at least one of the two or more links to a first group of common sequences; and storing the first group of common sequences in a database. 2. The computer-implemented method of claim 1 , further comprising: determining that a first link of the first group of common sequences has a destination statement equivalent to a source statement of a second link of the first group of common sequences; determining that the first link and the second link were each generated from sequences of statements of two or more common scripts; generating a third link comprising a source statement of the first link and a destination statement of the second link; adding the third link to a second group of common sequences; and storing the second group of common sequences in the database. | 0.5 |
8,019,769 | 1 | 15 | 1. A method for determining valid citation patterns in text within an electronic document using a processor, the method comprising: accessing, from a memory, at least one citation pattern, wherein each citation pattern includes a set of citation components which together define a predetermined pattern of citation components, each citation component associated with a set of citation component criteria; comparing text in the electronic document with the predetermined pattern of the citation components corresponding to the at least one citation pattern; and determining valid citation patterns in the text by identifying the predetermined pattern of citation components corresponding to the at least one citation pattern in the text. | 1. A method for determining valid citation patterns in text within an electronic document using a processor, the method comprising: accessing, from a memory, at least one citation pattern, wherein each citation pattern includes a set of citation components which together define a predetermined pattern of citation components, each citation component associated with a set of citation component criteria; comparing text in the electronic document with the predetermined pattern of the citation components corresponding to the at least one citation pattern; and determining valid citation patterns in the text by identifying the predetermined pattern of citation components corresponding to the at least one citation pattern in the text. 15. The method according to claim 1 , wherein one or more of: at least one citation pattern, sets of citation components, or set of citation component criteria, are regular expressions. | 0.821083 |
9,984,314 | 11 | 14 | 11. A classification system comprising: a general classifier configured to classify multiple aspects of content of an image stream; a template store including multiple different specialized classifier templates, each of the specialized classifier templates being configured to classify a subset of the multiple aspects; and a classifier selection system configured to re-train one of the multiple different specialized classifier templates to generate a specialized classifier for a particular subset of the multiple aspects, and to determine when to switch between using the general classifier to classify the multiple aspects of content of the image stream and using the specialized classifier to classify the multiple aspects of content of the image stream. | 11. A classification system comprising: a general classifier configured to classify multiple aspects of content of an image stream; a template store including multiple different specialized classifier templates, each of the specialized classifier templates being configured to classify a subset of the multiple aspects; and a classifier selection system configured to re-train one of the multiple different specialized classifier templates to generate a specialized classifier for a particular subset of the multiple aspects, and to determine when to switch between using the general classifier to classify the multiple aspects of content of the image stream and using the specialized classifier to classify the multiple aspects of content of the image stream. 14. The classification system as recited in claim 11 , the general classifier comprising a first deep neural network, and the specialized classifier comprising a second deep neural network that is shallower than the first deep neural network. | 0.854041 |
8,918,344 | 14 | 15 | 14. A device comprising a processor and a memory; the memory configured to store samples and target values; the samples comprising temporal windows of token instances to which a user was exposed, wherein the temporal windows of token instances comprise a window comprising instantiations of first and second tokens that have overlapping instantiation periods; the samples further comprise data on previous instantiations of the first and second tokens, to which the user was exposed; and the target values correspond to the temporal windows of token instances and represent affective responses of the user to the token instances from the temporal windows of token instances; wherein the affective responses comprise at least one of: values representing emotional responses, and values of a user measurement channel of the user; the processor configured to train a machine learning-based user response model using date comprising: the samples, the data on previous instantiations of the first and second tokens, and the corresponding target values stored in the memory; and the processor is further configured to generate, based on the machine learning-based user response model, a habituation-compensated library that comprises for each token of the first and second tokens: a first expected affective response of the user to an instance of the token after a first number of previous exposures to instantiations of the token, and a second expected affective response of the user to an instance of the token after a second number, that is greater than the first number, of previous exposures to instantiations of the token; wherein for the first token, the first expected affective response is stronger than the second expected affective response, while for the second token, the first expected affective response is weaker than the second expected affective response. | 14. A device comprising a processor and a memory; the memory configured to store samples and target values; the samples comprising temporal windows of token instances to which a user was exposed, wherein the temporal windows of token instances comprise a window comprising instantiations of first and second tokens that have overlapping instantiation periods; the samples further comprise data on previous instantiations of the first and second tokens, to which the user was exposed; and the target values correspond to the temporal windows of token instances and represent affective responses of the user to the token instances from the temporal windows of token instances; wherein the affective responses comprise at least one of: values representing emotional responses, and values of a user measurement channel of the user; the processor configured to train a machine learning-based user response model using date comprising: the samples, the data on previous instantiations of the first and second tokens, and the corresponding target values stored in the memory; and the processor is further configured to generate, based on the machine learning-based user response model, a habituation-compensated library that comprises for each token of the first and second tokens: a first expected affective response of the user to an instance of the token after a first number of previous exposures to instantiations of the token, and a second expected affective response of the user to an instance of the token after a second number, that is greater than the first number, of previous exposures to instantiations of the token; wherein for the first token, the first expected affective response is stronger than the second expected affective response, while for the second token, the first expected affective response is weaker than the second expected affective response. 15. The device of claim 14 , wherein the habituation-compensated library comprises expected emotional responses of the user to instantiations of tokens. | 0.5 |
8,266,656 | 6 | 21 | 6. The non-transitory computer readable media of claim 5 , wherein the search criteria set can be dynamically revised such that the search result window displays a revised list of television programs corresponding to the revised search criteria set. | 6. The non-transitory computer readable media of claim 5 , wherein the search criteria set can be dynamically revised such that the search result window displays a revised list of television programs corresponding to the revised search criteria set. 21. The onscreen television program guide of claim 6 , wherein the search result set further includes a program name for each of the television programs displayed in the search result window. | 0.517677 |
9,275,044 | 1 | 7 | 1. A method for finding synonyms comprising: receiving a first input word into a computer; receiving a second input word which approximates an intended meaning of the first input word into the computer; the computer generating a first generation list of synonyms for the first input word; the computer generating a first generation list of synonyms for the second input word; generating a combined list of synonyms from the first list of synonyms and the second list of synonyms; and the computer generating a second generation list of synonyms for the first input word which contains the synonyms of each word contained within the first generation list of synonyms for the first input word and a second generation list of synonyms for the second input word which contains the synonyms of each word contained within the first generation list of synonyms for the second input word. | 1. A method for finding synonyms comprising: receiving a first input word into a computer; receiving a second input word which approximates an intended meaning of the first input word into the computer; the computer generating a first generation list of synonyms for the first input word; the computer generating a first generation list of synonyms for the second input word; generating a combined list of synonyms from the first list of synonyms and the second list of synonyms; and the computer generating a second generation list of synonyms for the first input word which contains the synonyms of each word contained within the first generation list of synonyms for the first input word and a second generation list of synonyms for the second input word which contains the synonyms of each word contained within the first generation list of synonyms for the second input word. 7. The method according to claim 1 , wherein the computer creates additional lists of synonyms and results if the results list has an inadequate number of entries relative to a threshold. | 0.640385 |
9,946,971 | 23 | 26 | 23. The system according to claim 22 , wherein the project repository stores the available electronic document and updates the project repository interface when one or more new electronic documents are implemented in the project. | 23. The system according to claim 22 , wherein the project repository stores the available electronic document and updates the project repository interface when one or more new electronic documents are implemented in the project. 26. The system according to claim 23 , further comprising: a knowledge base processor assigning a retention policy and a quality rank to the knowledge associated with each electronic document based on the project requirements and configured to remove outdated data based on the retention policy. | 0.769891 |
8,527,517 | 19 | 24 | 19. A method for generating a knowledge base system comprising: providing in memory a knowledge base comprising a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; with a processor, for each a plurality of candidate relations to be added to the knowledge base, the candidate relation comprising first and second arguments and a predicate which links the arguments: determining if the predicate in the relation exists in a predicate table and if so, retrieving a corresponding predicate identifier from the predicate table, determining if argument types of the first and second arguments in the candidate relation match respective argument types that are encoded in the predicate identifier, the argument types being selected from a finite set of argument types; if the argument types of the first and second arguments in the candidate relation match the argument types encoded in the predicate identifier, for at least one of the arguments in the candidate relation, determining if the argument exists in a respective linked table corresponding to the encoded argument type, and if so retrieving its identifier, and if the argument does not exist, adding the respective argument as a new entry in the entity table with a respective identifier; and where a record does not yet exist in the records table which includes the candidate relation, creating a new record in the records table which includes the argument identifier of the at least one argument and the retrieved predicate identifier. | 19. A method for generating a knowledge base system comprising: providing in memory a knowledge base comprising a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; with a processor, for each a plurality of candidate relations to be added to the knowledge base, the candidate relation comprising first and second arguments and a predicate which links the arguments: determining if the predicate in the relation exists in a predicate table and if so, retrieving a corresponding predicate identifier from the predicate table, determining if argument types of the first and second arguments in the candidate relation match respective argument types that are encoded in the predicate identifier, the argument types being selected from a finite set of argument types; if the argument types of the first and second arguments in the candidate relation match the argument types encoded in the predicate identifier, for at least one of the arguments in the candidate relation, determining if the argument exists in a respective linked table corresponding to the encoded argument type, and if so retrieving its identifier, and if the argument does not exist, adding the respective argument as a new entry in the entity table with a respective identifier; and where a record does not yet exist in the records table which includes the candidate relation, creating a new record in the records table which includes the argument identifier of the at least one argument and the retrieved predicate identifier. 24. A computer program product comprising a non-transitory storage medium which stores instructions, which when executed by a computer processor perform the method of claim 19 . | 0.682796 |
8,970,609 | 1 | 6 | 1. A computer-implemented method for generating a visual representation of a continuous computation language (CCL) document, comprising: accessing the CCL document, the CCL document including one or more CCL statements, wherein the one or more CCL statements include instruction logic that when executed by one or more processors manipulates real-time data; converting the one or more CCL statements to visual objects as a representation of instruction logic of the CCL document graphically on a display device, wherein the converting further comprises: for each CCL statement, generating a plurality of parent nodes based on CCL statement keywords; identifying different connection types between the plurality of parent nodes, wherein the connection types are based on semantics between the plurality of parent nodes; and drawing different connections between the plurality of parent nodes based on the different connection types; determining a number of instructions in each CCL statement that generated a parent node in the plurality of parent nodes; and based on the number of instructions, generating child nodes for the parent node, one child node per instruction in each CCL statement. | 1. A computer-implemented method for generating a visual representation of a continuous computation language (CCL) document, comprising: accessing the CCL document, the CCL document including one or more CCL statements, wherein the one or more CCL statements include instruction logic that when executed by one or more processors manipulates real-time data; converting the one or more CCL statements to visual objects as a representation of instruction logic of the CCL document graphically on a display device, wherein the converting further comprises: for each CCL statement, generating a plurality of parent nodes based on CCL statement keywords; identifying different connection types between the plurality of parent nodes, wherein the connection types are based on semantics between the plurality of parent nodes; and drawing different connections between the plurality of parent nodes based on the different connection types; determining a number of instructions in each CCL statement that generated a parent node in the plurality of parent nodes; and based on the number of instructions, generating child nodes for the parent node, one child node per instruction in each CCL statement. 6. The computer-implemented method of claim 1 , wherein a parent node represents a store. | 0.91953 |
7,743,079 | 15 | 16 | 15. A computer-readable storage medium which stores a set of instructions which when executed performs a method for managing data across a semantic data view and a presentation data view, the method executed by the set of instructions comprising: maintaining a semantic model corresponding to the semantic data view, the semantic model having at least one node; maintaining 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 two shapes corresponding to the at least one node, the presentation model configured to select the at least two shapes when the at least one node is selected in the semantic data view; operating 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 in response to the received command being directed to one of 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 an unfocused representation of the at least one node of the semantic data view in response to the received command comprising a selection of at least one of the at least two shapes in the presentation data view, and selecting text corresponding to the at least one node of the plurality of nodes in the semantic data view in response to the received command comprising a command to switch focus to the semantic data view from the presentation data view, wherein the text corresponding to the at least one node of the plurality of nodes in the semantic data view is associated with the selected at least one shape of the plurality of shapes in the presentation data view; and displaying an insertion point at a default node of the semantic data view in response to a transition shape being selected in the presentation data view, wherein the transition shape does not correspond to the at least one node in the semantic data view. | 15. A computer-readable storage medium which stores a set of instructions which when executed performs a method for managing data across a semantic data view and a presentation data view, the method executed by the set of instructions comprising: maintaining a semantic model corresponding to the semantic data view, the semantic model having at least one node; maintaining 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 two shapes corresponding to the at least one node, the presentation model configured to select the at least two shapes when the at least one node is selected in the semantic data view; operating 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 in response to the received command being directed to one of 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 an unfocused representation of the at least one node of the semantic data view in response to the received command comprising a selection of at least one of the at least two shapes in the presentation data view, and selecting text corresponding to the at least one node of the plurality of nodes in the semantic data view in response to the received command comprising a command to switch focus to the semantic data view from the presentation data view, wherein the text corresponding to the at least one node of the plurality of nodes in the semantic data view is associated with the selected at least one shape of the plurality of shapes in the presentation data view; and displaying an insertion point at a default node of the semantic data view in response to a transition shape being selected in the presentation data view, wherein the transition shape does not correspond to the at least one node in the semantic data view. 16. The computer-readable storage medium of claim 15 , further comprising updating the semantic model in the semantic data view and the presentation model in the presentation data view in response to operating on the semantic model and the presentation model according to the received command. | 0.601902 |
8,527,529 | 8 | 9 | 8. The computer program product of claim 6 , further comprising the step of presenting a relevance ranking that is based on said relative position of said at least two search terms. | 8. The computer program product of claim 6 , further comprising the step of presenting a relevance ranking that is based on said relative position of said at least two search terms. 9. The computer program product of claim 8 , further comprising the step of sorting a plurality of documents satisfying said search query based on said relevance ranking. | 0.5 |
9,047,347 | 1 | 10 | 1. A computer-implemented method of merging text analysis results, comprising: processing, by a computer system, a plurality of text information according to a first text processing service to generate a first plurality of instances annotated according to a first taxonomy having a first set of elements; processing, by the computer system, the plurality of text information according to a second text processing service to generate a second plurality of instances annotated according to a second taxonomy having a second set of elements; calculating, by the computer system, a first coefficient between a first set of instances and a second set of instances according to a first corrected, weakened Jaccard factor, wherein the first set of instances corresponds to a first element of the first set of elements and wherein the second set of instances corresponds to a second element of the second set of elements; calculating, by the computer system, a second coefficient between the first set of instances and the second set of instances according to a second corrected, weakened Jaccard factor; calculating, by the computer system, a third coefficient between the first set of instances and the second set of instances according to a third corrected, weakened Jaccard factor; determining, by the computer system, that the first element is a subtype of the second element, that the second element is a subtype of the first element, or that the first element is associated with the second element, according to the first coefficient, the second coefficient and the third coefficient; and merging, by the computer system, the first taxonomy and the second taxonomy according to the first element and the second element being associated, the first element being the subtype of the second element, or the second element being the subtype of the first element, wherein the first corrected, weakened Jaccard factor corresponds to a Jaccard factor having a numerator and a denominator, wherein the Jaccard factor is corrected in the numerator with a first correction factor and weakened in the denominator with a first weakening factor, wherein the second corrected, weakened Jaccard factor corresponds to a ratio between a first corrected intersection size and a first corrected instance set size, wherein the first corrected intersection size is a size of an intersection of the first set of instances and the second set of instances corrected with a second correction factor, and wherein the first corrected instance set size is a size of the first set of instances deducted by a number of instances only found by the first text processing service multiplied with a second weakening factor, and wherein the third corrected, weakened Jaccard factor corresponds to a ratio between a second corrected intersection size and a second corrected instance set size, wherein the second corrected intersection size is a size of an intersection of the first set of instances and the second set of instances corrected with a third correction factor, and wherein the second corrected instance set size is a size of the second set of instances deducted by a number of instances only found by the second text processing service multiplied with a third weakening factor. | 1. A computer-implemented method of merging text analysis results, comprising: processing, by a computer system, a plurality of text information according to a first text processing service to generate a first plurality of instances annotated according to a first taxonomy having a first set of elements; processing, by the computer system, the plurality of text information according to a second text processing service to generate a second plurality of instances annotated according to a second taxonomy having a second set of elements; calculating, by the computer system, a first coefficient between a first set of instances and a second set of instances according to a first corrected, weakened Jaccard factor, wherein the first set of instances corresponds to a first element of the first set of elements and wherein the second set of instances corresponds to a second element of the second set of elements; calculating, by the computer system, a second coefficient between the first set of instances and the second set of instances according to a second corrected, weakened Jaccard factor; calculating, by the computer system, a third coefficient between the first set of instances and the second set of instances according to a third corrected, weakened Jaccard factor; determining, by the computer system, that the first element is a subtype of the second element, that the second element is a subtype of the first element, or that the first element is associated with the second element, according to the first coefficient, the second coefficient and the third coefficient; and merging, by the computer system, the first taxonomy and the second taxonomy according to the first element and the second element being associated, the first element being the subtype of the second element, or the second element being the subtype of the first element, wherein the first corrected, weakened Jaccard factor corresponds to a Jaccard factor having a numerator and a denominator, wherein the Jaccard factor is corrected in the numerator with a first correction factor and weakened in the denominator with a first weakening factor, wherein the second corrected, weakened Jaccard factor corresponds to a ratio between a first corrected intersection size and a first corrected instance set size, wherein the first corrected intersection size is a size of an intersection of the first set of instances and the second set of instances corrected with a second correction factor, and wherein the first corrected instance set size is a size of the first set of instances deducted by a number of instances only found by the first text processing service multiplied with a second weakening factor, and wherein the third corrected, weakened Jaccard factor corresponds to a ratio between a second corrected intersection size and a second corrected instance set size, wherein the second corrected intersection size is a size of an intersection of the first set of instances and the second set of instances corrected with a third correction factor, and wherein the second corrected instance set size is a size of the second set of instances deducted by a number of instances only found by the second text processing service multiplied with a third weakening factor. 10. The computer-implemented method of claim 1 , further comprising: processing, by the computer system, the plurality of text information according to a third text processing service to generate a third plurality of instances annotated according to a third taxonomy having a third set of elements; and merging, by the computer system, the first taxonomy, the second taxonomy and the third taxonomy. | 0.727086 |
8,570,614 | 12 | 15 | 12. A mail processing system, comprising: a platen having an aperture; and an imager configured to scan a document as the document is transported past the aperture; wherein the mail processing system is configured to scan the document to produce a document image; analyze the document image, wherein analyzing the document image includes one or more of determining if there is a dark obstruction in the document image and determining if there is a bright obstruction in the document image; based on the analysis, determine that there is a condition of the mail processing system that requires maintenance and that produced the dark obstruction or the bright obstruction; and notify at least one user of the condition of the mail processing system that requires maintenance and stop scanning additional documents so that the user can correct the condition of the mail processing system that requires maintenance. | 12. A mail processing system, comprising: a platen having an aperture; and an imager configured to scan a document as the document is transported past the aperture; wherein the mail processing system is configured to scan the document to produce a document image; analyze the document image, wherein analyzing the document image includes one or more of determining if there is a dark obstruction in the document image and determining if there is a bright obstruction in the document image; based on the analysis, determine that there is a condition of the mail processing system that requires maintenance and that produced the dark obstruction or the bright obstruction; and notify at least one user of the condition of the mail processing system that requires maintenance and stop scanning additional documents so that the user can correct the condition of the mail processing system that requires maintenance. 15. The mail processing system of claim 12 , wherein scanning the document includes producing a current image of a background of the view through the aperture before or after the document is transported past the aperture, and wherein the current image of the background is part of the document image. | 0.541284 |
8,615,478 | 6 | 7 | 6. The method of claim 1 including determining a nearest neighbor based supervised classifier. | 6. The method of claim 1 including determining a nearest neighbor based supervised classifier. 7. The method of claim 6 including finding the nearest neighbors to said first point, finding the nearest neighbors to the second point and counting how many of the neighbors have the same class label between the two points. | 0.5 |
8,224,693 | 17 | 18 | 17. A computer-readable storage medium containing software that, when executed by a processor, causes the processor to: obtain a web page; run a plurality of classifiers on said web page to obtain one or more keywords, each classifier being previously determined based on positive and negative training examples; and select advertisements based on said one or more keywords. | 17. A computer-readable storage medium containing software that, when executed by a processor, causes the processor to: obtain a web page; run a plurality of classifiers on said web page to obtain one or more keywords, each classifier being previously determined based on positive and negative training examples; and select advertisements based on said one or more keywords. 18. The computer-readable storage medium of claim 17 wherein the software causes the processor to run the plurality of classifiers on said web page by applying each of a plurality of classifiers to the web page to generate a plurality of scores, one score for each classifier. | 0.5 |
9,753,705 | 14 | 17 | 14. A system, comprising: a memory; and a processor, operatively coupled to the memory, the processor to: identify a defined pattern in a bytecode derived from a high level programming language module; evaluate a conditional expression associated with the defined pattern, wherein the conditional expression comprises a symbolic name of a system property of the high level programming language, an operator, and an identifier of an execution platform; exclude from a scope of compilation, in view of the evaluating, a portion of bytecode associated with the defined pattern, wherein the portion comprises code exploiting execution platform-specific capabilities; and compile, in view of the scope of compilation, the bytecode into a native code. | 14. A system, comprising: a memory; and a processor, operatively coupled to the memory, the processor to: identify a defined pattern in a bytecode derived from a high level programming language module; evaluate a conditional expression associated with the defined pattern, wherein the conditional expression comprises a symbolic name of a system property of the high level programming language, an operator, and an identifier of an execution platform; exclude from a scope of compilation, in view of the evaluating, a portion of bytecode associated with the defined pattern, wherein the portion comprises code exploiting execution platform-specific capabilities; and compile, in view of the scope of compilation, the bytecode into a native code. 17. The system of claim 14 , wherein the defined pattern comprises an opcode corresponding to a high-level programming language construct. | 0.642487 |
9,892,189 | 3 | 4 | 3. The method of claim 1 , wherein each of the categories comprises a category title and a set of keywords, and wherein comparing each of the one or more tokens to each of the categories comprises applying a string matching algorithm to match the tokens to the category title or to one or more keywords of the set of keywords. | 3. The method of claim 1 , wherein each of the categories comprises a category title and a set of keywords, and wherein comparing each of the one or more tokens to each of the categories comprises applying a string matching algorithm to match the tokens to the category title or to one or more keywords of the set of keywords. 4. The method of claim 3 , further comprising collecting, from one or more categorized domain names previously categorized in the category, a plurality of keywords for the set of keywords of each category. | 0.574689 |
9,734,519 | 10 | 12 | 10. A method comprising: generating a single script block for placement at a single location on an HTML document in response to a creation of one or more ad units for the HTML document, the single script block including one or more section codes that correspond to one or more content blocks of the HTML document; generating a syndication script for obtaining logic and metadata for injecting native advertisements in the HTML document based on the one or more section codes; providing the syndication script in response to a request generated by the single script block; and providing one or more native advertisements in response to an ad call generated by the syndication script, the one or more native advertisements for injection in the one or more content blocks of the HTML document based on the logic and metadata, wherein the metadata includes an XPath per section identifying nodes within a Document Object Model of the HTML document as native ad placement containers, wherein the syndication script obtains, from an advertisement server, logic for filtering child nodes within the Document Object Model to include only matching structures of the XPath(s) for subsequent injections of native advertisements, and obtains metadata for auto formatting data based on content of the HTML document. | 10. A method comprising: generating a single script block for placement at a single location on an HTML document in response to a creation of one or more ad units for the HTML document, the single script block including one or more section codes that correspond to one or more content blocks of the HTML document; generating a syndication script for obtaining logic and metadata for injecting native advertisements in the HTML document based on the one or more section codes; providing the syndication script in response to a request generated by the single script block; and providing one or more native advertisements in response to an ad call generated by the syndication script, the one or more native advertisements for injection in the one or more content blocks of the HTML document based on the logic and metadata, wherein the metadata includes an XPath per section identifying nodes within a Document Object Model of the HTML document as native ad placement containers, wherein the syndication script obtains, from an advertisement server, logic for filtering child nodes within the Document Object Model to include only matching structures of the XPath(s) for subsequent injections of native advertisements, and obtains metadata for auto formatting data based on content of the HTML document. 12. The method of claim 10 , wherein the metadata includes a skip parameter for determining locations for subsequent injections of native advertisements. | 0.575 |
7,765,225 | 2 | 4 | 2. The method as claimed in claim 1 wherein the search interface further includes one or more search term clarification buttons which, when selected by a user, assign specific additional search terms to a search term entered by a user into the search term input window. | 2. The method as claimed in claim 1 wherein the search interface further includes one or more search term clarification buttons which, when selected by a user, assign specific additional search terms to a search term entered by a user into the search term input window. 4. The method as claimed in claim 2 wherein the additional search terms assigned to the search clarification buttons correspond to search identifier terms associated with searchable documents. | 0.5 |
9,418,374 | 7 | 8 | 7. A method, comprising: identifying a key phrase that appears in digital content; generating a score for the key phrase based at least in part on social media popularity of the key phrase and frequency of the key phrase on a peer group of digital pages associated with a target digital page of the digital content, the peer group of digital pages of a plurality of network accessible sites; identifying said peer group of digital pages, at least in part, by identifying at least one of an outbound link from or an inbound link to the target digital page; determining, based at least in part on the score, whether to use the key phrase to select contextually relevant content to associate with the digital content; and responsive to determining to use the key phrase to select contextually relevant content to associate with the digital document, storing an indication of the determination in a memory device. | 7. A method, comprising: identifying a key phrase that appears in digital content; generating a score for the key phrase based at least in part on social media popularity of the key phrase and frequency of the key phrase on a peer group of digital pages associated with a target digital page of the digital content, the peer group of digital pages of a plurality of network accessible sites; identifying said peer group of digital pages, at least in part, by identifying at least one of an outbound link from or an inbound link to the target digital page; determining, based at least in part on the score, whether to use the key phrase to select contextually relevant content to associate with the digital content; and responsive to determining to use the key phrase to select contextually relevant content to associate with the digital document, storing an indication of the determination in a memory device. 8. The method of claim 7 , further comprising determining the social media popularity of the key phrase by monitoring interaction, by users of a social media service, with a social media content item that is associated with the key phrase. | 0.721445 |
7,562,289 | 14 | 20 | 14. A system for incorporating in at least one electronic graphics file at least one first mapping system in at least one storage medium, comprising: at least one server coupled to at least one network; at least one user terminal coupled to the at least one network; at least one application coupled to the at least one server and/or the at least one user terminal, wherein the at least one application is configured for: storing, in the at least one storage medium, mapping system information in the at least one electronic graphics file, the mapping system information comprising projection information and datum information, wherein the projection information comprises mathematical information that transforms coordinates of features on the Earth's three-dimensional surface to coordinates on a two-dimensional surface, and wherein the datum information comprises parameters and control points used to accurately define a three-dimensional shape of the Earth; storing, in the at least one storage medium, geo-registration information in the at least one electronic graphics file, the geo-registration information comprising information used to accurately transform the coordinates from the two-dimensional surface to a coordinate system of the electronic graphics file; and storing, in the at least one storage medium, neatline information describing geographic boundary information of a region of the coordinate system of the electronic graphics file to which the geo-registration applies; wherein the mapping system information, the geo-registration information, and the neatline information enables graphics information to be self-contained in the at least one electronic graphics file and to be associated with map information in at least one second mapping system, the at least one second mapping system different from the at least one first mapping system. | 14. A system for incorporating in at least one electronic graphics file at least one first mapping system in at least one storage medium, comprising: at least one server coupled to at least one network; at least one user terminal coupled to the at least one network; at least one application coupled to the at least one server and/or the at least one user terminal, wherein the at least one application is configured for: storing, in the at least one storage medium, mapping system information in the at least one electronic graphics file, the mapping system information comprising projection information and datum information, wherein the projection information comprises mathematical information that transforms coordinates of features on the Earth's three-dimensional surface to coordinates on a two-dimensional surface, and wherein the datum information comprises parameters and control points used to accurately define a three-dimensional shape of the Earth; storing, in the at least one storage medium, geo-registration information in the at least one electronic graphics file, the geo-registration information comprising information used to accurately transform the coordinates from the two-dimensional surface to a coordinate system of the electronic graphics file; and storing, in the at least one storage medium, neatline information describing geographic boundary information of a region of the coordinate system of the electronic graphics file to which the geo-registration applies; wherein the mapping system information, the geo-registration information, and the neatline information enables graphics information to be self-contained in the at least one electronic graphics file and to be associated with map information in at least one second mapping system, the at least one second mapping system different from the at least one first mapping system. 20. The system of claim 14 , wherein the at least one electronic graphics file comprises: at least one Adobe Acrobat.RTM. portable document file, at least one portable document format file, at least one design web format (DWF) file, at least one tagged image file format (TIF) file, at least one scalable vector graphics (SVG) file, at least one Bentley Digital InterPlot (DPR) file, and at least one hypertext markup language (HTML) file, or at least one extensible markup language (XML) file, or any combination thereof. | 0.788493 |
9,940,387 | 8 | 13 | 8. A method in a computer system for generating a legal search query, the method comprising: receiving the legal search query from a single text input field, the legal search query comprising a first query segment and a second query segment, wherein: the first query segment is distinct and independent from the second query segment in the single text input field, and the first query segment and the second query segment are distinct phrases of the legal search query resulting from individual auto-complete sessions; detecting a position of a text cursor within the first query segment or the second query segment; displaying one or more additional first query suggestions based at least in part on the position of the text cursor within the first query segment, and displaying one or more additional second query suggestions based at least in part on the position of the text cursor within the second query segment; receiving an operator in the single text input field, wherein the operator is added to the first query segment or the second query segment; splitting the first query segment or the second query segment into two or more split query segments based on a location of the operator within the single text input field, wherein the splitting results in an additional autocomplete session for each of the two or more split query segments; obtaining one or more query suggestions from a server computing device, the one or more query suggestions based at least in part on the first query segment, the second query segment, or the two or more split query segments; obtaining one or more first semantic suggestions based at least in part on the first query segment from a semantic suggestion server that is separate from the server computing device, wherein the one or more first semantic suggestions are semantically similar to the first query segment; obtaining one or more second semantic suggestions based at least in part on the second query segment from the semantic suggestion server, wherein the one or more second semantic suggestions are semantically similar to the second query segment and distinct from the one or more first semantic suggestions; obtaining one or more third semantic suggestions based at least in part on the two or more split query segments from the semantic suggestion server, wherein the one or more third semantic suggestions are semantically similar to the two or more split query segments and distinct from the one or more first semantic suggestions and the one or more second semantic suggestions; displaying the one or more query suggestions with the one or more first semantic suggestions, the one or more second semantic suggestions, and the one or more third semantic suggestions within a graphical user interface; generating the legal search query from one or more selections from a user via the graphical user interface; and searching a legal document database using the legal search query to return and display a set of retrieved legal documents. | 8. A method in a computer system for generating a legal search query, the method comprising: receiving the legal search query from a single text input field, the legal search query comprising a first query segment and a second query segment, wherein: the first query segment is distinct and independent from the second query segment in the single text input field, and the first query segment and the second query segment are distinct phrases of the legal search query resulting from individual auto-complete sessions; detecting a position of a text cursor within the first query segment or the second query segment; displaying one or more additional first query suggestions based at least in part on the position of the text cursor within the first query segment, and displaying one or more additional second query suggestions based at least in part on the position of the text cursor within the second query segment; receiving an operator in the single text input field, wherein the operator is added to the first query segment or the second query segment; splitting the first query segment or the second query segment into two or more split query segments based on a location of the operator within the single text input field, wherein the splitting results in an additional autocomplete session for each of the two or more split query segments; obtaining one or more query suggestions from a server computing device, the one or more query suggestions based at least in part on the first query segment, the second query segment, or the two or more split query segments; obtaining one or more first semantic suggestions based at least in part on the first query segment from a semantic suggestion server that is separate from the server computing device, wherein the one or more first semantic suggestions are semantically similar to the first query segment; obtaining one or more second semantic suggestions based at least in part on the second query segment from the semantic suggestion server, wherein the one or more second semantic suggestions are semantically similar to the second query segment and distinct from the one or more first semantic suggestions; obtaining one or more third semantic suggestions based at least in part on the two or more split query segments from the semantic suggestion server, wherein the one or more third semantic suggestions are semantically similar to the two or more split query segments and distinct from the one or more first semantic suggestions and the one or more second semantic suggestions; displaying the one or more query suggestions with the one or more first semantic suggestions, the one or more second semantic suggestions, and the one or more third semantic suggestions within a graphical user interface; generating the legal search query from one or more selections from a user via the graphical user interface; and searching a legal document database using the legal search query to return and display a set of retrieved legal documents. 13. The method of claim 8 , wherein the graphical user interface comprises a suggestion region that displays at least some of the one or more first semantic suggestions and the one or more second semantic suggestions. | 0.808642 |
8,155,959 | 1 | 8 | 1. A dialog system comprising: a plurality of dialog modules in a processor of the dialog system that receive and process utterances from a speaker and generate synthetic speech or text outputs as responses to the utterances, wherein the plurality of dialog modules include a first dialog module coupled to provide an output to a second dialog module; a task flow generation module functionally coupled to the plurality of dialog modules and that receives a task flow defining a set of tasks for human agent control over real-time collection of dialog data for the speaker, a starting task, and relationships among the tasks, and that generates a script that comprises a formal description of the task flow, the script of the task flow automatically generating a graphical user interface that includes templates for control of the dialog modules and real-time collection of dialog data for the speaker, the script generating a plurality of tags defining parameters of the tasks and one or more elements of the automatically generated graphical user interface; a controller circuit embodied within the processor, the controller circuit functionally coupled to the first dialog module, wherein the controller circuit detects an abnormal output of the first dialog module when the first dialog module is processing the utterances in an automatic mode and outputs a signal indicating the abnormal output; and an operator interface coupled to the plurality of dialog modules and the controller circuit, wherein the operator interface receives the signal and executes the task flow to automatically generate the graphical user interface, wherein the graphical user interface comprises a plurality of display panels including a first panel configured to allow the human agent to control the synthetic speech or text outputs, and a second panel configured to display at least a portion of the task flow, and wherein the templates for control of the dialog modules include a mode control for the human agent to control the first dialog module through the controller by correcting the abnormal output and transferring a corrected output to the second dialog module, wherein the corrected output is used in further processing the utterances. | 1. A dialog system comprising: a plurality of dialog modules in a processor of the dialog system that receive and process utterances from a speaker and generate synthetic speech or text outputs as responses to the utterances, wherein the plurality of dialog modules include a first dialog module coupled to provide an output to a second dialog module; a task flow generation module functionally coupled to the plurality of dialog modules and that receives a task flow defining a set of tasks for human agent control over real-time collection of dialog data for the speaker, a starting task, and relationships among the tasks, and that generates a script that comprises a formal description of the task flow, the script of the task flow automatically generating a graphical user interface that includes templates for control of the dialog modules and real-time collection of dialog data for the speaker, the script generating a plurality of tags defining parameters of the tasks and one or more elements of the automatically generated graphical user interface; a controller circuit embodied within the processor, the controller circuit functionally coupled to the first dialog module, wherein the controller circuit detects an abnormal output of the first dialog module when the first dialog module is processing the utterances in an automatic mode and outputs a signal indicating the abnormal output; and an operator interface coupled to the plurality of dialog modules and the controller circuit, wherein the operator interface receives the signal and executes the task flow to automatically generate the graphical user interface, wherein the graphical user interface comprises a plurality of display panels including a first panel configured to allow the human agent to control the synthetic speech or text outputs, and a second panel configured to display at least a portion of the task flow, and wherein the templates for control of the dialog modules include a mode control for the human agent to control the first dialog module through the controller by correcting the abnormal output and transferring a corrected output to the second dialog module, wherein the corrected output is used in further processing the utterances. 8. The dialog system of claim 1 , wherein the controller is coupled to the plurality of dialog modules, wherein the controller detects an abnormal output of any of the plurality of dialog modules when the plurality of dialog modules are processing the utterances in an automatic mode and outputs a signal indicating the abnormal output, wherein the operator interface comprises a mode control for a human agent to control any of the plurality of dialog modules by correcting the abnormal output of any of the plurality of dialog modules and transferring a corrected output to a downstream dialog module that follows, in a processing path, the dialog module from which the abnormal output is detected, wherein the corrected output is used in further processing the utterances. | 0.5 |
9,471,567 | 13 | 16 | 13. A system, comprising: a digital display; a microphone integrated within or interfaced to the digital display; and memory having a language translator that processes as executable instructions on one or more processors of the digital display; wherein the language translator is configured to detect voice conversations in proximity to the microphone and resolve a spoken language for the voice conversations and in response thereto translating original written information presented on the digital display in an original language to a target language for the spoken language and presenting the written information and written communication in the target language on the digital display, wherein the voice conversations are obtained from one of: a single person conversing on a phone in proximity to the microphone and multiple people conversing with one another in proximity to the microphone, and wherein the language translator is further configured to modify an original image presented on the digital display with a new image that is appropriate for a cultural of the spoken language. | 13. A system, comprising: a digital display; a microphone integrated within or interfaced to the digital display; and memory having a language translator that processes as executable instructions on one or more processors of the digital display; wherein the language translator is configured to detect voice conversations in proximity to the microphone and resolve a spoken language for the voice conversations and in response thereto translating original written information presented on the digital display in an original language to a target language for the spoken language and presenting the written information and written communication in the target language on the digital display, wherein the voice conversations are obtained from one of: a single person conversing on a phone in proximity to the microphone and multiple people conversing with one another in proximity to the microphone, and wherein the language translator is further configured to modify an original image presented on the digital display with a new image that is appropriate for a cultural of the spoken language. 16. The system of claim 13 , wherein the language translator is configured to filter noise from the voice conversations to improve accuracy associated with resolving the spoken language. | 0.717325 |
8,176,120 | 20 | 38 | 20. A non-transitory computer readable storage medium storing one or more programs, for composing a web page, for execution by one or more processors on a server, the one or more programs comprising: instructions, which, when executed, transmit an authoring web page including an embedded authoring tool to a client computer of a publisher of the web page using a network, the authoring tool for composing the web page; and instructions, which, when executed, receive from the client computer web-page content corresponding to the composed web page, wherein the composed web page includes one or more advertisement regions that are placeholders designated for displaying one or more advertisements having one or more links to one or more content locations; and wherein the composed web page is configured for display at run-time at respective clients devices that download the composed web page from a web page server. | 20. A non-transitory computer readable storage medium storing one or more programs, for composing a web page, for execution by one or more processors on a server, the one or more programs comprising: instructions, which, when executed, transmit an authoring web page including an embedded authoring tool to a client computer of a publisher of the web page using a network, the authoring tool for composing the web page; and instructions, which, when executed, receive from the client computer web-page content corresponding to the composed web page, wherein the composed web page includes one or more advertisement regions that are placeholders designated for displaying one or more advertisements having one or more links to one or more content locations; and wherein the composed web page is configured for display at run-time at respective clients devices that download the composed web page from a web page server. 38. The non-transitory computer readable storage medium of claim 20 , further comprising instructions, which, when executed, receive a latest version of the web-page content a plurality of times, wherein the plurality of times are separated by at least a minimum predefined time interval. | 0.652174 |
7,965,923 | 34 | 36 | 34. The system of claim 19 wherein the extraction module is operative to select one or more captions and subtitles from the one or more segments. | 34. The system of claim 19 wherein the extraction module is operative to select one or more captions and subtitles from the one or more segments. 36. The system of claim 34 wherein the extraction module is operative to select one or more subtitles from a given segment based upon a frequency of the one or more subtitles in the segment. | 0.801255 |
8,370,390 | 4 | 8 | 4. The computer-implemented method of claim 1 , wherein the document fingerprint is created from the first x and last x coordinates of the vector representing evaluated document, and the fingerprint is stored in memory to be compared with vector representing another evaluated document. | 4. The computer-implemented method of claim 1 , wherein the document fingerprint is created from the first x and last x coordinates of the vector representing evaluated document, and the fingerprint is stored in memory to be compared with vector representing another evaluated document. 8. The computer-implemented method of claim 4 , wherein x is equal to 4. | 0.5 |
9,785,636 | 1 | 6 | 1. A non-transitory, computer-readable recording medium having stored therein a program for causing a computer to execute a process, the process comprising: specifying a first relevance between machine parts by processing machine part documents which include design information of the machine parts, the first relevance being specified when there is one or more of a contact, assembly, welding, and kinematics relationship between two or more of the machine parts, and extracting a keyword of each of the machine part documents, each machine part document including design information of a machine part that has the first relevance; specifying a second relevance between electronic parts by processing electronic part documents which include design information of the electronic parts which control the machine parts, the second relevance being specified when there is an electrical connection between two or more of the electronic parts, and extracting a keyword of each of the electronic part documents, each electronic part document including design information of an electronic part that has the second relevance; specifying a third relevance between source codes by processing program documents which include the source codes for causing the electronic parts or the machine parts to perform a processing, the third relevance being specified when a function is included in a source code and the function is called in another source code, and extracting a keyword of each of the program documents, each program document including a source code that has the third relevance; associating documents having a common keyword among the extracted keywords of the program documents, the electronic part documents, and the machine part documents so that the program documents, the electronic part documents, and the machine part documents are associated with each other, respectively; and displaying a screen on which a visualized relationship among the program documents, the electronic part documents, and the machine part documents which are associated is set. | 1. A non-transitory, computer-readable recording medium having stored therein a program for causing a computer to execute a process, the process comprising: specifying a first relevance between machine parts by processing machine part documents which include design information of the machine parts, the first relevance being specified when there is one or more of a contact, assembly, welding, and kinematics relationship between two or more of the machine parts, and extracting a keyword of each of the machine part documents, each machine part document including design information of a machine part that has the first relevance; specifying a second relevance between electronic parts by processing electronic part documents which include design information of the electronic parts which control the machine parts, the second relevance being specified when there is an electrical connection between two or more of the electronic parts, and extracting a keyword of each of the electronic part documents, each electronic part document including design information of an electronic part that has the second relevance; specifying a third relevance between source codes by processing program documents which include the source codes for causing the electronic parts or the machine parts to perform a processing, the third relevance being specified when a function is included in a source code and the function is called in another source code, and extracting a keyword of each of the program documents, each program document including a source code that has the third relevance; associating documents having a common keyword among the extracted keywords of the program documents, the electronic part documents, and the machine part documents so that the program documents, the electronic part documents, and the machine part documents are associated with each other, respectively; and displaying a screen on which a visualized relationship among the program documents, the electronic part documents, and the machine part documents which are associated is set. 6. The non-transitory, computer-readable recording medium according to claim 1 , wherein the program documents are source codes and the process further comprising: specifying the relevance between the program documents when a function included in one source code calls for another source code. | 0.620466 |
9,336,485 | 1 | 2 | 1. A method, in a data processing system comprising a processor and a memory, for generating an answer for an input question when the answer is not directly present in a corpus of information, the method comprising: receiving, in the data processing system, an input question from a computing device; processing, by the data processing system, the input question to generate a first set of candidate answers to the input question and corresponding confidence scores for each candidate answer in the first set of candidate answers; determining, by the data processing system, whether at least one of the candidate answers in the first set of candidate answers has a corresponding confidence score equaling or exceeding a minimum confidence score value, wherein the answer to the input question is determined to not be directly provided in the corpus of information with a predetermined level of confidence if none of the candidate answers in the first set of candidate answers has a corresponding confidence score equaling or exceeding the minimum confidence score value; and in response to the answer to the input question not being directly provided in the corpus of information with the predetermined level of confidence: analyzing, by the data processing system, the input question to determine whether the input question is requesting an answer that is calculable at least by: determining a domain of the input question, wherein the domain indicates a subject matter area context of the input question, and wherein the domain is one of a plurality of domains for which input questions are received by the data processing system; and invoking one or more domain specific annotators, corresponding to the determined domain, to analyze the input question, wherein the one or more domain specific annotators are configured to identify domain specific terms or phrases, specific to the determined domain of the input question, which are indicative of the answer being calculable; and in response to a determination that the input question is requesting an answer that is calculable: retrieving, by the data processing system, from a corpus of information, one or more constituent data values for calculating the requested answer to the input question; calculating a value corresponding to the requested answer based on the one or more retrieved constituent data values; and outputting, by the data processing system, the calculated value as the requested answer to the input question, wherein calculating the value corresponding to the requested answer comprises invoking the one or more domain specific annotators to perform domain specific calculations to generate domain specific calculable values that are specific to the determined domain of the input question, and wherein different domains are associated with different sets of domain specific terms or phrases and domain specific calculable values. | 1. A method, in a data processing system comprising a processor and a memory, for generating an answer for an input question when the answer is not directly present in a corpus of information, the method comprising: receiving, in the data processing system, an input question from a computing device; processing, by the data processing system, the input question to generate a first set of candidate answers to the input question and corresponding confidence scores for each candidate answer in the first set of candidate answers; determining, by the data processing system, whether at least one of the candidate answers in the first set of candidate answers has a corresponding confidence score equaling or exceeding a minimum confidence score value, wherein the answer to the input question is determined to not be directly provided in the corpus of information with a predetermined level of confidence if none of the candidate answers in the first set of candidate answers has a corresponding confidence score equaling or exceeding the minimum confidence score value; and in response to the answer to the input question not being directly provided in the corpus of information with the predetermined level of confidence: analyzing, by the data processing system, the input question to determine whether the input question is requesting an answer that is calculable at least by: determining a domain of the input question, wherein the domain indicates a subject matter area context of the input question, and wherein the domain is one of a plurality of domains for which input questions are received by the data processing system; and invoking one or more domain specific annotators, corresponding to the determined domain, to analyze the input question, wherein the one or more domain specific annotators are configured to identify domain specific terms or phrases, specific to the determined domain of the input question, which are indicative of the answer being calculable; and in response to a determination that the input question is requesting an answer that is calculable: retrieving, by the data processing system, from a corpus of information, one or more constituent data values for calculating the requested answer to the input question; calculating a value corresponding to the requested answer based on the one or more retrieved constituent data values; and outputting, by the data processing system, the calculated value as the requested answer to the input question, wherein calculating the value corresponding to the requested answer comprises invoking the one or more domain specific annotators to perform domain specific calculations to generate domain specific calculable values that are specific to the determined domain of the input question, and wherein different domains are associated with different sets of domain specific terms or phrases and domain specific calculable values. 2. The method of claim 1 , wherein analyzing the input question comprises: performing natural language processing on the input question to extract one or more features from the input question; and analyzing the one or more extracted features to identify the one or more constituent data values. | 0.5 |
9,405,186 | 3 | 4 | 3. The method of claim 2 , further comprising grouping each of the plurality of clips into one of a plurality of similarity groups, wherein each group corresponds to a range of polygon counts and area densities. | 3. The method of claim 2 , further comprising grouping each of the plurality of clips into one of a plurality of similarity groups, wherein each group corresponds to a range of polygon counts and area densities. 4. The method of claim 3 , further comprising: determining a diffraction order coefficient for each clip; and clustering each of the plurality of clips within each similarity group into one of a plurality of diffraction clusters, wherein each diffraction cluster corresponds to a range of diffraction order coefficients. | 0.5 |
8,204,310 | 1 | 7 | 1. A storage device encoded with instructions that, when executed by a processing unit, configure the processing unit to perform acts comprising: acquiring time sequential, ink data for a handwritten East Asian character; producing conditioned ink data that comprises information in form of a writing sequence of the handwritten East Asian character; extracting features from the conditioned ink data, the features comprising at least one of a tangent feature, a curvature feature, a local length feature, a connection point feature, or an imaginary stroke feature; and using a Hidden Markov Model to provide an East Asian character that corresponds to the features being extracted. | 1. A storage device encoded with instructions that, when executed by a processing unit, configure the processing unit to perform acts comprising: acquiring time sequential, ink data for a handwritten East Asian character; producing conditioned ink data that comprises information in form of a writing sequence of the handwritten East Asian character; extracting features from the conditioned ink data, the features comprising at least one of a tangent feature, a curvature feature, a local length feature, a connection point feature, or an imaginary stroke feature; and using a Hidden Markov Model to provide an East Asian character that corresponds to the features being extracted. 7. The storage device of claim 1 , wherein the connection point feature is used for determining one or more connection point features for a neighborhood, the one or more connection point features comprises at least one of a “X” connection point or a “T” connection point. | 0.5 |
8,874,540 | 11 | 12 | 11. A system that semantically classifies numeric data of a data source including numeric data sets and non-numeric data sets, comprising: a processing device; and a non-transitory computer readable medium in communication with the processing device, wherein the non-transitory computer readable medium comprises one or more programming instructions that, when executed, cause the processing device to: load a data source comprising numeric data and non-numeric data; extract one or more open class nouns from at least one non-numeric data set of the data source, the one or more open class nouns being in a proximity to the numeric data set of the data source; determine at least one semantic classification for the non-numeric data set of the data source using a semantic classification technique; extract one or more number values from at least one numeric data set of the data source; query an EKB to determine if the semantic classification for the non-numeric data set and one or more number values of the numeric data set exist in the EKB and, if so, query the EKB based on the at least one semantic classification of the non-numeric data set and one or more number values of the numeric data set to retrieve one or more results corresponding to each of the number values of the numeric data set, the one or more results including a property and a value; compare each value returned by the EKB against a corresponding number value from the numerical data set; apply an acceptable tolerance in which to consider a respective value returned from the EKB to match a respective number value of the numerical data set, derive a confidence score for the numeric data set based on the one or more results; and determine at least one classification for the numerical data set based on the confidence score. | 11. A system that semantically classifies numeric data of a data source including numeric data sets and non-numeric data sets, comprising: a processing device; and a non-transitory computer readable medium in communication with the processing device, wherein the non-transitory computer readable medium comprises one or more programming instructions that, when executed, cause the processing device to: load a data source comprising numeric data and non-numeric data; extract one or more open class nouns from at least one non-numeric data set of the data source, the one or more open class nouns being in a proximity to the numeric data set of the data source; determine at least one semantic classification for the non-numeric data set of the data source using a semantic classification technique; extract one or more number values from at least one numeric data set of the data source; query an EKB to determine if the semantic classification for the non-numeric data set and one or more number values of the numeric data set exist in the EKB and, if so, query the EKB based on the at least one semantic classification of the non-numeric data set and one or more number values of the numeric data set to retrieve one or more results corresponding to each of the number values of the numeric data set, the one or more results including a property and a value; compare each value returned by the EKB against a corresponding number value from the numerical data set; apply an acceptable tolerance in which to consider a respective value returned from the EKB to match a respective number value of the numerical data set, derive a confidence score for the numeric data set based on the one or more results; and determine at least one classification for the numerical data set based on the confidence score. 12. The system of claim 11 , wherein the one or more programming instructions for deriving the confidence score further comprise one or more programming instruction that, when executed, cause the processing device to: analyze the one or more classifications for each numeric value in the data set based upon the one or more results; and determine the confidence score for the numeric data set based upon a combination of the one or more classifications for each numeric value. | 0.5 |
9,836,509 | 4 | 5 | 4. The method of claim 3 , wherein the instructions in the query template orchestration configuration are executed by a query template orchestrator, wherein the query template orchestration configuration includes instructions to perform actions on the placeholders in the generic query template, wherein the actions are (1) described by an orchestration type and (2) performed by an orchestration operator. | 4. The method of claim 3 , wherein the instructions in the query template orchestration configuration are executed by a query template orchestrator, wherein the query template orchestration configuration includes instructions to perform actions on the placeholders in the generic query template, wherein the actions are (1) described by an orchestration type and (2) performed by an orchestration operator. 5. The method of claim 4 , wherein the orchestration operator performs at least one of (1) retrieving the query template segment specified in the step of the instruction (2) replacing the input placeholder in the generic query template with an index of an instant query input stream and (3) creating another input stream placeholder in the generic query template for the instant query input stream. | 0.5 |
7,921,190 | 1 | 12 | 1. A system comprising: a computer for communicatively coupling to a network device over a network, the computer configured to: display a document including text extracted from a first copy of a configuration file for the network device, the text representing a plurality of different objects that each control different functionality of the network device; receive a user input modifying a first selected portion of the text that corresponds to a first one of the plurality of objects; and exchange communications with the network device including the first modified selected portion of the text prior to receiving a subsequent second user input that modifies a second portion of the text that corresponds to a different one of the plurality of different objects, the communications for dynamically modifying a second different copy of the configuration file that is stored on the network device without exchanging an entire copy of the configuration file between the computer and the network device. | 1. A system comprising: a computer for communicatively coupling to a network device over a network, the computer configured to: display a document including text extracted from a first copy of a configuration file for the network device, the text representing a plurality of different objects that each control different functionality of the network device; receive a user input modifying a first selected portion of the text that corresponds to a first one of the plurality of objects; and exchange communications with the network device including the first modified selected portion of the text prior to receiving a subsequent second user input that modifies a second portion of the text that corresponds to a different one of the plurality of different objects, the communications for dynamically modifying a second different copy of the configuration file that is stored on the network device without exchanging an entire copy of the configuration file between the computer and the network device. 12. The system of claim 1 , wherein the communications exchange with the network device includes the first copy of the configuration. | 0.740234 |
9,544,430 | 5 | 6 | 5. The transcription server according to claim 4 , wherein the transcription server further comprises a translation unit which is adapted to translate the transformed continuous text by means of a text translation algorithm from the selected source language to the selected target language of the respective user. | 5. The transcription server according to claim 4 , wherein the transcription server further comprises a translation unit which is adapted to translate the transformed continuous text by means of a text translation algorithm from the selected source language to the selected target language of the respective user. 6. The transcription server according to claim 5 , wherein said transcription server is adapted to forward the translated text in the target language of the hearing impaired user via said network to said mobile device having a display which is adapted to display the translated text in the target language of the hearing impaired user to the user. | 0.5 |
9,063,932 | 10 | 11 | 10. The method of claim 8 wherein storing a first plurality of electronic documents in a common electronic document repository includes replicating at least one change to at least one of the electronic documents from at least one of the networked satellite nodes to the common electronic document repository. | 10. The method of claim 8 wherein storing a first plurality of electronic documents in a common electronic document repository includes replicating at least one change to at least one of the electronic documents from at least one of the networked satellite nodes to the common electronic document repository. 11. The method of claim 10 , further comprising: determining that an author of the at least one change is at least one of an owner of the changed electronic document or an authorized entity that has been authorized by the owner of the changed electronic document before replicating the at least one change. | 0.5 |
7,849,148 | 79 | 83 | 79. The computer program product of claim 78 , and further comprising computer code for displaying, in response to a second user interaction, the second additional information associated with the second message, utilizing the at least one window. | 79. The computer program product of claim 78 , and further comprising computer code for displaying, in response to a second user interaction, the second additional information associated with the second message, utilizing the at least one window. 83. The computer program product of claim 79 , wherein the computer program product is configured such that the first additional information and the second additional information are displayed utilizing a tooltip. | 0.625 |
8,396,885 | 1 | 8 | 1. A computer-implemented method, comprising: identifying one or more unique tokens and bi-grams within a clustered set of search queries, the unique tokens having corresponding lengths that exceed a first threshold value; computing, using at least one processor, edit distances for a subset of the identified tokens and bi-grams, the subset comprising tokens or bi-grams within unit length of each other token or bi-gram in the subset; and determining, using the at least one processor, that a least-frequent token or bi-gram in the subset is misspelled, when the edit distance for the least-frequent token or bi-gram falls below a second threshold value. | 1. A computer-implemented method, comprising: identifying one or more unique tokens and bi-grams within a clustered set of search queries, the unique tokens having corresponding lengths that exceed a first threshold value; computing, using at least one processor, edit distances for a subset of the identified tokens and bi-grams, the subset comprising tokens or bi-grams within unit length of each other token or bi-gram in the subset; and determining, using the at least one processor, that a least-frequent token or bi-gram in the subset is misspelled, when the edit distance for the least-frequent token or bi-gram falls below a second threshold value. 8. The method of claim 1 , further comprising discarding the clustered set of search queries, when the subset of the identified tokens and bi-grams includes the spelling error. | 0.788462 |
8,397,056 | 13 | 16 | 13. A non-transitory computer-readable medium comprising instructions for execution by a computer, the instructions including a computer-implemented method for providing a mashup, the instructions for implementing: providing a mashup that performs an action on a resource included in the mashup; identifying an attribute of a user running the mashup to perform the action on the resource; and providing an access control, the mashup being associated to a permission artifact, the permission artifact specifying a principal and whether one of to permit and to prohibit the principal to take the action on the resource, wherein the access control is triggered only when the mashup attempts to perform the action on the resource, the access control (i) checks whether the attribute of the user running the mashup to perform the action is predefined as belonging to the principal specified in the permission artifact associated to the mashup, and then (ii) performs the one of to permit and to prohibit the action on the resource only when the attribute belongs to the principal, plural users that have a same single attribute belong to the principal when the same single attribute is defined as belonging to the principal, and the permission artifact further specifies: (i) the resource used by the mashup, and (ii) the action on the resource for which permission is needed. | 13. A non-transitory computer-readable medium comprising instructions for execution by a computer, the instructions including a computer-implemented method for providing a mashup, the instructions for implementing: providing a mashup that performs an action on a resource included in the mashup; identifying an attribute of a user running the mashup to perform the action on the resource; and providing an access control, the mashup being associated to a permission artifact, the permission artifact specifying a principal and whether one of to permit and to prohibit the principal to take the action on the resource, wherein the access control is triggered only when the mashup attempts to perform the action on the resource, the access control (i) checks whether the attribute of the user running the mashup to perform the action is predefined as belonging to the principal specified in the permission artifact associated to the mashup, and then (ii) performs the one of to permit and to prohibit the action on the resource only when the attribute belongs to the principal, plural users that have a same single attribute belong to the principal when the same single attribute is defined as belonging to the principal, and the permission artifact further specifies: (i) the resource used by the mashup, and (ii) the action on the resource for which permission is needed. 16. The computer-readable medium of claim 13 , further comprising specifying, via a user interface, in the permission artifact, the principal, the action, the resource, and that the principal is one of permitted and prohibited from taking the action on the resource. | 0.525 |
9,015,803 | 1 | 8 | 1. A server computer implemented method of online document collaboration by authorized users, the method comprising the following steps performed by a server computer system connected to the Internet: establishing an account for each of a plurality of users, wherein each account is associated with storage space to store one or more documents; storing a first document in the server computer system in a first account, the first document capable of being modified by a plurality of authorized users; enabling access to the first document via a browser-controlled window executing on a client computer by one or more authorized users; associating a set of restrictions with the first document, the restrictions including an ability to modify the first document in one or more permitted ways by one of a first group of users, the first group of users being users whose identities are known to the server computer system; receiving a request to access the first document from a first user, wherein the first user is a member of the first group of users, wherein the request to access accompanies the first user's identification information and authorization information; verifying the identity of the first user; if the first user is authorized to access the first document, then permitting the first user to access the first document via a first browser-controlled window executing on a client computer; and if the first user is authorized to modify the first document, then: (a) applying one or more modifications to the first document, the one or more modifications having been received from the first user; (b) electronically notifying one or more of a second group of users that the first user modified the first document, the second group of users being users whose identities are known to the server computer system; and (c) enabling a second user to further modify the first document, wherein the second user is a member of the second group of users who are notified of the one or more modifications made by the first user to the first document, and wherein the second user is not the same as the first user. | 1. A server computer implemented method of online document collaboration by authorized users, the method comprising the following steps performed by a server computer system connected to the Internet: establishing an account for each of a plurality of users, wherein each account is associated with storage space to store one or more documents; storing a first document in the server computer system in a first account, the first document capable of being modified by a plurality of authorized users; enabling access to the first document via a browser-controlled window executing on a client computer by one or more authorized users; associating a set of restrictions with the first document, the restrictions including an ability to modify the first document in one or more permitted ways by one of a first group of users, the first group of users being users whose identities are known to the server computer system; receiving a request to access the first document from a first user, wherein the first user is a member of the first group of users, wherein the request to access accompanies the first user's identification information and authorization information; verifying the identity of the first user; if the first user is authorized to access the first document, then permitting the first user to access the first document via a first browser-controlled window executing on a client computer; and if the first user is authorized to modify the first document, then: (a) applying one or more modifications to the first document, the one or more modifications having been received from the first user; (b) electronically notifying one or more of a second group of users that the first user modified the first document, the second group of users being users whose identities are known to the server computer system; and (c) enabling a second user to further modify the first document, wherein the second user is a member of the second group of users who are notified of the one or more modifications made by the first user to the first document, and wherein the second user is not the same as the first user. 8. The server computer implemented method of claim 1 , wherein the one or more modifications made to the first document includes adding material to the first document, deleting material from the first document, adding a digital signature to the first document, underlining material in the first document, or highlighting material in the first document. | 0.796767 |
8,910,034 | 5 | 9 | 5. The method as claimed in claim 2 , wherein the transformation of the decrypted document fragment of the source document is a changing a visual characteristic of the decrypted document fragment of the source document. | 5. The method as claimed in claim 2 , wherein the transformation of the decrypted document fragment of the source document is a changing a visual characteristic of the decrypted document fragment of the source document. 9. The method as claimed in claim 5 , wherein the changed visual characteristic of the decrypted document fragment is a three-dimensional effect. | 0.5 |
9,313,153 | 35 | 36 | 35. The apparatus of claim 34 , wherein to determine multiple paths further comprises to: monitor bandwidth connections between nodes; calculate an alternate path to send messages from the broker to the subscriber for path using nodes with diminished bandwidth; and send message on the alternate path. | 35. The apparatus of claim 34 , wherein to determine multiple paths further comprises to: monitor bandwidth connections between nodes; calculate an alternate path to send messages from the broker to the subscriber for path using nodes with diminished bandwidth; and send message on the alternate path. 36. The apparatus of claim 35 , wherein to calculate and to send the message on the alternate path are performed only if more bandwidth is needed for a subscriber. | 0.5 |
8,649,572 | 18 | 19 | 18. The system of claim 14 , further comprising enabling, using the set of metadata, the portion of the analyzed image to be used as a search criterion in response to the user selecting the portion of the image. | 18. The system of claim 14 , further comprising enabling, using the set of metadata, the portion of the analyzed image to be used as a search criterion in response to the user selecting the portion of the image. 19. The system of claim 18 , further comprising using an index associated with a social network to identify one or more images that can be correlated to the search criterion. | 0.5 |
7,599,926 | 1 | 3 | 1. A computer-readable storage medium encoded with a reputation information processing program, the program when executed by a computer causes the computer to execute: an evaluation pair extraction step of analyzing a document which is present on a network, extracting an evaluation pair in which an object and an evaluation expression are combined, and registering the evaluation pair in a database; and an evaluation pair analysis step of executing desired analysis by utilizing the evaluation pair of the database, wherein the evaluation pair extraction step further comprises: evaluation pair learning step of giving an evaluation pair extracted from a model document for training to a machine learner so as to cause the machine learner to learn a rule which can serve as the evaluation pair; and an evaluation pair extraction execution step of inputting an unknown document to the machine learner and extracting an evaluation pair based on the learnt rule, the evaluation pair learning step includes: a morpheme analysis step of subjecting the model document to morpheme analysis when a word is in a language in which words are continuous without being punctuated, and skipping the morpheme analysis of said model document when a word is in a language in which words are punctuated by spaces; an object extraction step of extracting a unique expression and a noun phrase from the model document which has undergone morpheme analysis and causing the noun expression and the noun phrase to serve as objects; an evaluation expression extraction step of extracting an evaluation expression from the model document which has undergone morpheme analysis by use of an evaluation expression dictionary; a learning evaluation pair extraction step of extracting an evaluation pair candidate in which the object and the evaluation expression are combined, extracting a feature amount of the evaluation pair candidate, and setting whether the combination of the evaluation pair candidate is correct or not; and a model generating step of inputting a plurality of the feature amounts and the correctness of the learning evaluation pair to the machine learner, and generating weights of the individual feature amounts as an evaluation pair sorting model in which the rule which can serve as the learning evaluation pair is learnt and acquired, and the evaluation pair extraction execution step includes: a morpheme analysis step of subjecting an unknown document to morpheme analysis in a case of a language in which words are continuous without being punctuated by spaces, and skipping a morpheme analysis of said model document in a case of a language in which words are punctuated by spaces; an object extraction step of extracting a unique expression and a noun phrase from the unknown document which has undergone morpheme analysis and causing the noun expression and the noun phrase to serve as objects; an evaluation expression extraction step of extracting an evaluation expression from the unknown document which has undergone morpheme analysis by use of an evaluation expression dictionary; an evaluation pair candidate extraction step of extracting an evaluation pair candidate in which the object and the evaluation expression are combined; and an evaluation pair determination step of inputting the evaluation pair candidate to the machine learner, giving a plurality of feature amounts to the evaluation pair candidate by use of the evaluation pair sorting model, determining the evaluation pair candidate having a total sum of the individual feature amounts multiplied by the weights acquired in the evaluation pair learning step, equal to or more than a predetermined value as an evaluation pair of the unknown document, and registering the evaluation pair in the database. | 1. A computer-readable storage medium encoded with a reputation information processing program, the program when executed by a computer causes the computer to execute: an evaluation pair extraction step of analyzing a document which is present on a network, extracting an evaluation pair in which an object and an evaluation expression are combined, and registering the evaluation pair in a database; and an evaluation pair analysis step of executing desired analysis by utilizing the evaluation pair of the database, wherein the evaluation pair extraction step further comprises: evaluation pair learning step of giving an evaluation pair extracted from a model document for training to a machine learner so as to cause the machine learner to learn a rule which can serve as the evaluation pair; and an evaluation pair extraction execution step of inputting an unknown document to the machine learner and extracting an evaluation pair based on the learnt rule, the evaluation pair learning step includes: a morpheme analysis step of subjecting the model document to morpheme analysis when a word is in a language in which words are continuous without being punctuated, and skipping the morpheme analysis of said model document when a word is in a language in which words are punctuated by spaces; an object extraction step of extracting a unique expression and a noun phrase from the model document which has undergone morpheme analysis and causing the noun expression and the noun phrase to serve as objects; an evaluation expression extraction step of extracting an evaluation expression from the model document which has undergone morpheme analysis by use of an evaluation expression dictionary; a learning evaluation pair extraction step of extracting an evaluation pair candidate in which the object and the evaluation expression are combined, extracting a feature amount of the evaluation pair candidate, and setting whether the combination of the evaluation pair candidate is correct or not; and a model generating step of inputting a plurality of the feature amounts and the correctness of the learning evaluation pair to the machine learner, and generating weights of the individual feature amounts as an evaluation pair sorting model in which the rule which can serve as the learning evaluation pair is learnt and acquired, and the evaluation pair extraction execution step includes: a morpheme analysis step of subjecting an unknown document to morpheme analysis in a case of a language in which words are continuous without being punctuated by spaces, and skipping a morpheme analysis of said model document in a case of a language in which words are punctuated by spaces; an object extraction step of extracting a unique expression and a noun phrase from the unknown document which has undergone morpheme analysis and causing the noun expression and the noun phrase to serve as objects; an evaluation expression extraction step of extracting an evaluation expression from the unknown document which has undergone morpheme analysis by use of an evaluation expression dictionary; an evaluation pair candidate extraction step of extracting an evaluation pair candidate in which the object and the evaluation expression are combined; and an evaluation pair determination step of inputting the evaluation pair candidate to the machine learner, giving a plurality of feature amounts to the evaluation pair candidate by use of the evaluation pair sorting model, determining the evaluation pair candidate having a total sum of the individual feature amounts multiplied by the weights acquired in the evaluation pair learning step, equal to or more than a predetermined value as an evaluation pair of the unknown document, and registering the evaluation pair in the database. 3. The storage medium according to claim 1 , wherein the morpheme analysis step is executed merely for a document of a language such as Japanese, Chinese, or Korean in which words are not divided by spaces. | 0.798828 |
8,296,647 | 14 | 15 | 14. A system comprising: a hardware processor; and a storage device communicatively coupled with the hardware processor, the storage device storing instructions that cause the hardware processor to perform operations comprising: receiving, from a reviewer, multiple comments about a word processing document; presenting the multiple comments to an editor; for each comment of the multiple comments presented to the editor, receiving, from the editor, an instruction to access the comment, accessing the comment in response to the instruction, receiving, from the editor, one or more changes to the word processing document that address the accessed comment, and storing the one or more received changes to the word processing document in a document difference record associated with the accessed comment; receiving, from the reviewer, a request selecting a first comment from among the multiple accessed comments; and presenting, to the reviewer in response to the request, the word processing document and a first document difference record associated with the selected first comment, while hiding document difference records that correspond to unselected comments from among the multiple comments. | 14. A system comprising: a hardware processor; and a storage device communicatively coupled with the hardware processor, the storage device storing instructions that cause the hardware processor to perform operations comprising: receiving, from a reviewer, multiple comments about a word processing document; presenting the multiple comments to an editor; for each comment of the multiple comments presented to the editor, receiving, from the editor, an instruction to access the comment, accessing the comment in response to the instruction, receiving, from the editor, one or more changes to the word processing document that address the accessed comment, and storing the one or more received changes to the word processing document in a document difference record associated with the accessed comment; receiving, from the reviewer, a request selecting a first comment from among the multiple accessed comments; and presenting, to the reviewer in response to the request, the word processing document and a first document difference record associated with the selected first comment, while hiding document difference records that correspond to unselected comments from among the multiple comments. 15. The system of claim 14 , wherein the operations comprise: receiving, from the reviewer, another request selecting a second comment from among the multiple accessed comments and unselecting the first comment; and presenting, to the reviewer in response to the other request, the word processing document and a second document difference record associated with the selected second comment, while hiding the first document difference record associated with the unselected first comment and any document difference records that correspond to any unselected comments different from the first comment from among the multiple comments. | 0.5 |
9,454,582 | 8 | 11 | 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: receiving a search query; obtaining search results that satisfy the search query, wherein the search results identify a plurality of web pages, wherein each web page is a web page on a corresponding website of a plurality of websites; computing a respective global ranking score for each website of the plurality of websites, wherein the global ranking score represents an indication of relevance of the website to the search query relative to other websites of the plurality of websites; computing an onsite ranking score for each of the plurality of web pages, wherein the onsite ranking score is computed from onsite data that is controlled by a webmaster or a developer of the corresponding website for the web page, wherein the onsite ranking score represents an indication of relevance of the web page as responsive to the search query relative to other web pages within the corresponding web site; selecting, as a representative web page for a particular website from among a plurality of web pages for the particular website, a particular web page having a highest onsite ranking score among the plurality of web pages for the particular website; comparing the onsite ranking score for the representative web page to the global ranking score for the particular website; determining that the onsite ranking score for the representative web page is not consistent with the global ranking score for the particular website; in response to determining that the onsite ranking score for the representative web page is not consistent with the global ranking score for the particular website, assigning a new global ranking score for the particular website including modifying the global ranking score for the particular website; computing a combined ranking score for each web page of the plurality of web pages including combining a respective global ranking score for a website associated with the web page and an onsite ranking score for the web page, including using the new global ranking score for the particular website when computing the combined ranking score for web pages on the particular website; and ranking the search results according to the combined ranking scores computed for respective web pages identified by the search results. | 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: receiving a search query; obtaining search results that satisfy the search query, wherein the search results identify a plurality of web pages, wherein each web page is a web page on a corresponding website of a plurality of websites; computing a respective global ranking score for each website of the plurality of websites, wherein the global ranking score represents an indication of relevance of the website to the search query relative to other websites of the plurality of websites; computing an onsite ranking score for each of the plurality of web pages, wherein the onsite ranking score is computed from onsite data that is controlled by a webmaster or a developer of the corresponding website for the web page, wherein the onsite ranking score represents an indication of relevance of the web page as responsive to the search query relative to other web pages within the corresponding web site; selecting, as a representative web page for a particular website from among a plurality of web pages for the particular website, a particular web page having a highest onsite ranking score among the plurality of web pages for the particular website; comparing the onsite ranking score for the representative web page to the global ranking score for the particular website; determining that the onsite ranking score for the representative web page is not consistent with the global ranking score for the particular website; in response to determining that the onsite ranking score for the representative web page is not consistent with the global ranking score for the particular website, assigning a new global ranking score for the particular website including modifying the global ranking score for the particular website; computing a combined ranking score for each web page of the plurality of web pages including combining a respective global ranking score for a website associated with the web page and an onsite ranking score for the web page, including using the new global ranking score for the particular website when computing the combined ranking score for web pages on the particular website; and ranking the search results according to the combined ranking scores computed for respective web pages identified by the search results. 11. The system of claim 8 , wherein the onsite ranking score for the representative web page is based on a placement of the representative web page within a structure of the particular website. | 0.812621 |
9,092,535 | 17 | 18 | 17. The system of claim 15 , wherein executing the first application program in response to detecting selection of the electronic message includes displaying an object on the display. | 17. The system of claim 15 , wherein executing the first application program in response to detecting selection of the electronic message includes displaying an object on the display. 18. The system of claim 17 , wherein the object is an image or video. | 0.775974 |
7,685,252 | 43 | 81 | 43. Apparatus for use in accessing an application in association with one or more computer-based devices, the apparatus comprising: one or more processors operative to: (i) obtain the application from an application server, the application being programmatically represented by interactions that the user is permitted to have with the one or more computer-based devices by interaction-based programming components, wherein the interaction-based programming components are independent of content/application logic and presentation requirements associated with the application; and (ii) transcode the interaction-based programming components on a component by component basis to generate one or more modality-specific renderings of the application renderable in accordance with one or more modaility-specific browsers associated with the one or more computer-based devices, the interaction-based programming components being independent of any modality and any modality-specific browser wherein representation by the interaction-based programming components permits synchronization of the one or more modality-specific renderings of the application on the one or more computer-based devices. | 43. Apparatus for use in accessing an application in association with one or more computer-based devices, the apparatus comprising: one or more processors operative to: (i) obtain the application from an application server, the application being programmatically represented by interactions that the user is permitted to have with the one or more computer-based devices by interaction-based programming components, wherein the interaction-based programming components are independent of content/application logic and presentation requirements associated with the application; and (ii) transcode the interaction-based programming components on a component by component basis to generate one or more modality-specific renderings of the application renderable in accordance with one or more modaility-specific browsers associated with the one or more computer-based devices, the interaction-based programming components being independent of any modality and any modality-specific browser wherein representation by the interaction-based programming components permits synchronization of the one or more modality-specific renderings of the application on the one or more computer-based devices. 81. The apparatus of claim 43 , wherein the components may be active in parallel. | 0.892573 |
7,519,589 | 122 | 123 | 122. The method of claim 121 , further comprising: enabling a user to highlight an item or data within a document as being of high interest relative to the issues of the findings folder; and enabling the addition of notes to the highlight; and creating a separate object from the highlighted data for storage in the folder. | 122. The method of claim 121 , further comprising: enabling a user to highlight an item or data within a document as being of high interest relative to the issues of the findings folder; and enabling the addition of notes to the highlight; and creating a separate object from the highlighted data for storage in the folder. 123. The method of claim 122 , further comprising: utilizing the separate object from the highlighted data for relevance searching. | 0.5 |
8,001,469 | 17 | 20 | 17. A system comprising: a processor-based dialog module that receives and processes utterances from a speaker and outputs data used to generate synthetic speech outputs as responses to the utterances; a display module coupled to the dialog module and configured to automatically generate a graphical user interface (GUI) on a client computer operated by a caller; an interactive system coupled to the dialog module and configured to receive a task flow that describes operations of the dialog system and generate a script that is a formal description of the task flow, the interactive system configured to automatically generate the GUI from the script, the GUI configured for an operator to control in real-time collection and annotating of dialog data during a live dialog between only the dialog system and callers to the dialog system, the dialog data consisting of data of the live dialog; the GUI comprising a first portion for input of caller provided information, a second portion comprising an output control panel for control of the synthesized speech prompts by a human operator, a third portion providing status of a current task within the task flow, and a fourth portion providing an graphical representation of the task flow; and a processor-based detection module within the dialog module configured to detect the presence of an abnormality in speech processing during the task flow and automatically switching control to the human operator to allow direct interaction with the caller to correct the abnormality. | 17. A system comprising: a processor-based dialog module that receives and processes utterances from a speaker and outputs data used to generate synthetic speech outputs as responses to the utterances; a display module coupled to the dialog module and configured to automatically generate a graphical user interface (GUI) on a client computer operated by a caller; an interactive system coupled to the dialog module and configured to receive a task flow that describes operations of the dialog system and generate a script that is a formal description of the task flow, the interactive system configured to automatically generate the GUI from the script, the GUI configured for an operator to control in real-time collection and annotating of dialog data during a live dialog between only the dialog system and callers to the dialog system, the dialog data consisting of data of the live dialog; the GUI comprising a first portion for input of caller provided information, a second portion comprising an output control panel for control of the synthesized speech prompts by a human operator, a third portion providing status of a current task within the task flow, and a fourth portion providing an graphical representation of the task flow; and a processor-based detection module within the dialog module configured to detect the presence of an abnormality in speech processing during the task flow and automatically switching control to the human operator to allow direct interaction with the caller to correct the abnormality. 20. The system of claim 17 , wherein the formal description includes a set of tasks, a starting task, and relationship information of the tasks. | 0.810026 |
9,690,873 | 3 | 4 | 3. The method according to claim 1 , wherein the symbols are selected from an alphabet comprising alphabet symbols, and comprising computing for the alphabet symbols respective bit-maps, such that bit values of the bit-map of the alphabet symbol indicate respective symbol positions of the pattern in which the alphabet symbol occurs, and wherein performing the first and second evaluations comprise making the evaluations using the bit-maps. | 3. The method according to claim 1 , wherein the symbols are selected from an alphabet comprising alphabet symbols, and comprising computing for the alphabet symbols respective bit-maps, such that bit values of the bit-map of the alphabet symbol indicate respective symbol positions of the pattern in which the alphabet symbol occurs, and wherein performing the first and second evaluations comprise making the evaluations using the bit-maps. 4. The method according to claim 3 , wherein performing the first evaluation comprises evaluating all the offsets from the current position in the text using the bit-maps of the symbols found in the text at the respective offsets. | 0.5 |
9,886,424 | 1 | 4 | 1. A computer-implemented method of dynamically extracting context associated with a web request, comprising: at a context analyzer layer, receiving a web request context, wherein the web request context comprises a coded expression; at the context analyzer layer, determining if the coded expression contains a property name of multiple property names; if the context analyzer layer determines the coded expression contains the property name of the multiple property names, updating the web request context at the context analyzer layer by replacing the coded expression with a value of the property name of the multiple property names; if the context analyzer layer determines the coded expression does not contain any property name of the multiple property names, updating the web request context by replacing at least a part of the coded expression by at least one of: at the context analyzer layer, determining that the coded expression starts with a request parameter attribute and replacing the at least the part of the coded expression with a value of a parameter name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request cookie attribute and replacing the at least the part of the coded expression with a value of a cookie name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request attribute and replacing the at least the part of the coded expression with a value of an attribute name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request header attribute and replacing the at least the part of the coded expression with a value of a header name at the context analyzer layer; or at the context analyzer layer, determining that the coded expression starts with a context attribute and attempting to identify a context analyzer name class and replacing the at least the part of the coded expression with a value of a context key of the context analyzer name class at the context analyzer layer; at the context analyzer layer, determining if a value of the at least the part of the coded expression is null after replacing the at least the part of the coded expression; at the context analyzer layer, determining if the value of the at least the part of the coded expression is marked as required; if the value of the at least the part of the coded expression is (1) determined to be null and (2) not marked as required, then ignoring the value of the at least the part of the coded expression; if the value of the at least the part of the coded expression is (1) determined to be null and (2) marked as required, then, at the context analyzer layer, generating a warning in a log based at least in part on the determining that the value of the at least the part of the coded expression is null after replacing the at least the part of the coded expression; at the context analyzer layer, invoking the context key of the context analyzer name class; and at the context analyzer layer, determining that the context analyzer name class is not identified or that the value of the context key is not specified and then throwing an invalid configuration exception. | 1. A computer-implemented method of dynamically extracting context associated with a web request, comprising: at a context analyzer layer, receiving a web request context, wherein the web request context comprises a coded expression; at the context analyzer layer, determining if the coded expression contains a property name of multiple property names; if the context analyzer layer determines the coded expression contains the property name of the multiple property names, updating the web request context at the context analyzer layer by replacing the coded expression with a value of the property name of the multiple property names; if the context analyzer layer determines the coded expression does not contain any property name of the multiple property names, updating the web request context by replacing at least a part of the coded expression by at least one of: at the context analyzer layer, determining that the coded expression starts with a request parameter attribute and replacing the at least the part of the coded expression with a value of a parameter name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request cookie attribute and replacing the at least the part of the coded expression with a value of a cookie name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request attribute and replacing the at least the part of the coded expression with a value of an attribute name at the context analyzer layer; at the context analyzer layer, determining that the coded expression starts with a request header attribute and replacing the at least the part of the coded expression with a value of a header name at the context analyzer layer; or at the context analyzer layer, determining that the coded expression starts with a context attribute and attempting to identify a context analyzer name class and replacing the at least the part of the coded expression with a value of a context key of the context analyzer name class at the context analyzer layer; at the context analyzer layer, determining if a value of the at least the part of the coded expression is null after replacing the at least the part of the coded expression; at the context analyzer layer, determining if the value of the at least the part of the coded expression is marked as required; if the value of the at least the part of the coded expression is (1) determined to be null and (2) not marked as required, then ignoring the value of the at least the part of the coded expression; if the value of the at least the part of the coded expression is (1) determined to be null and (2) marked as required, then, at the context analyzer layer, generating a warning in a log based at least in part on the determining that the value of the at least the part of the coded expression is null after replacing the at least the part of the coded expression; at the context analyzer layer, invoking the context key of the context analyzer name class; and at the context analyzer layer, determining that the context analyzer name class is not identified or that the value of the context key is not specified and then throwing an invalid configuration exception. 4. The method of claim 1 , further comprising: at a configuration collector layer, receiving a web page configuration. | 0.940584 |
9,086,788 | 9 | 10 | 9. A method for collaborating, the method comprising: modifying, by a computer system, a presentation of a document that includes a plurality of portions by making each portion of the document selectable by a user; responsive to receiving, by the computer system, a selection by the user of a portion of the document, identifying, by the computer system, a context of the user-selected portion of the document; identifying, by the computer system, a set of collaboration channels corresponding to the context of the user-selected portion of the document; determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty, creating, by the computer system, a new collaboration channel based on the context of the user-selected portion of the document; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is not empty, selecting, by the computer system, one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document; and establishing, by the computer system, a collaboration that communicates information about the user-selected portion of the document between the user and other users by utilizing the one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document. | 9. A method for collaborating, the method comprising: modifying, by a computer system, a presentation of a document that includes a plurality of portions by making each portion of the document selectable by a user; responsive to receiving, by the computer system, a selection by the user of a portion of the document, identifying, by the computer system, a context of the user-selected portion of the document; identifying, by the computer system, a set of collaboration channels corresponding to the context of the user-selected portion of the document; determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty, creating, by the computer system, a new collaboration channel based on the context of the user-selected portion of the document; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is not empty, selecting, by the computer system, one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document; and establishing, by the computer system, a collaboration that communicates information about the user-selected portion of the document between the user and other users by utilizing the one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document. 10. The method of claim 9 further comprising: determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document includes a first collaboration channel and a second collaboration channel corresponding to the context; establishing, by the computer system, a first collaboration using the first collaboration channel and a second collaboration using the second collaboration channel responsive to the set of collaboration channels corresponding to the context of the user-selected portion of the document including the first collaboration channel and the second collaboration channel; responsive to receiving, by the computer system, a collaboration message from the user about the user-selected portion of the document, sending, by the computer system, the collaboration message about the user-selected portion of the document to the first collaboration and the second collaboration; and presenting, by the computer system, collaboration messages from the other users to the user received, by the computer system, from the first collaboration and the second collaboration. | 0.52426 |
7,738,703 | 2 | 9 | 2. An image processing apparatus, comprising: a first memory that stores a first document file; a linking unit that obtains entered information of the first document file and information on a position of the entered information, and stores the obtained information in association with each other in a database part; a second memory that stores a second document file obtained by revising the first document file; an extraction unit that extracts a revised area of the second document file based on the first document file corresponding to the second document file and the second document file; and a correction unit that obtains information on a position of the revised area, and corrects the entered information of the first document file, which is stored in the database part and is corresponding to the information on the position of the revised area, to entered information on the revised area. | 2. An image processing apparatus, comprising: a first memory that stores a first document file; a linking unit that obtains entered information of the first document file and information on a position of the entered information, and stores the obtained information in association with each other in a database part; a second memory that stores a second document file obtained by revising the first document file; an extraction unit that extracts a revised area of the second document file based on the first document file corresponding to the second document file and the second document file; and a correction unit that obtains information on a position of the revised area, and corrects the entered information of the first document file, which is stored in the database part and is corresponding to the information on the position of the revised area, to entered information on the revised area. 9. The image processing apparatus according to claim 2 , further comprising: a corresponding document file designation unit that designates the first document file in the first memory corresponding to the second document file in the second memory. | 0.5 |
8,156,520 | 15 | 17 | 15. A method for presenting a recorded audio/video stream, the method comprising: recording a first audio/video stream including at least one segment of a show and at least one interstitial of the show; recording closed captioning data associated with the first audio/video stream; receiving location information separately from the first audio/video stream, the location information including a plurality of data segments, each comprising a displayable text string included within the closed captioning data as originally transmitted by a content provider a first of the plurality of data segments associated with a first video location within the first audio/video stream, a second of the plurality of data segments associated with a second video location within the first audio/video stream, beginning and ending offsets, associated with the second of the plurality of data segments that are relative to the second video location, the beginning and ending offsets identifying beginning and ending locations of the at least one segment; sorting the closed captioning data according to a presentation order; processing the sorted closed captioning data recorded to identify the first video location within the first audio/video stream based on first of the plurality of data segments; determining that the first of the plurality of data segments is not located within the closed captioning data recorded; processing the closed captioning data recorded again to locate a second video location corresponding with the presentation of the second of the plurality of data segments in the closed captioning data recorded; identifying the beginning location and the ending location of the at least one segment in the first audio/video stream based on the second video location, the beginning offset and the ending offset; identifying substitute content based on the second video location, the beginning offset and the ending offset; replacing the at least one interstitial of the first audio/video stream with the substitute content to generate a second audio/video stream; and outputting the second audio/video stream for presentation on a display device. | 15. A method for presenting a recorded audio/video stream, the method comprising: recording a first audio/video stream including at least one segment of a show and at least one interstitial of the show; recording closed captioning data associated with the first audio/video stream; receiving location information separately from the first audio/video stream, the location information including a plurality of data segments, each comprising a displayable text string included within the closed captioning data as originally transmitted by a content provider a first of the plurality of data segments associated with a first video location within the first audio/video stream, a second of the plurality of data segments associated with a second video location within the first audio/video stream, beginning and ending offsets, associated with the second of the plurality of data segments that are relative to the second video location, the beginning and ending offsets identifying beginning and ending locations of the at least one segment; sorting the closed captioning data according to a presentation order; processing the sorted closed captioning data recorded to identify the first video location within the first audio/video stream based on first of the plurality of data segments; determining that the first of the plurality of data segments is not located within the closed captioning data recorded; processing the closed captioning data recorded again to locate a second video location corresponding with the presentation of the second of the plurality of data segments in the closed captioning data recorded; identifying the beginning location and the ending location of the at least one segment in the first audio/video stream based on the second video location, the beginning offset and the ending offset; identifying substitute content based on the second video location, the beginning offset and the ending offset; replacing the at least one interstitial of the first audio/video stream with the substitute content to generate a second audio/video stream; and outputting the second audio/video stream for presentation on a display device. 17. The method of claim 15 , wherein identifying the substitute content further comprises identifying the substitute content based on viewing characteristics of the user. | 0.5 |
9,430,667 | 21 | 22 | 21. A method implemented in a device, the method comprising: obtaining, via a managed wireless distribution network system of the device, parameters allowing the device to join wireless networks hosted by multiple additional devices in a managed wireless distribution network; joining a wireless network hosted by one of the multiple additional devices in order to transfer protected content between the device and the one of the multiple additional devices; identifying, via the managed wireless distribution network system and during a broadcast window, one or more of the wireless networks that the device can see; providing, via the managed wireless distribution network system and to a network management service, an indication of the one or more wireless networks that the device can see; and maintaining, at a content store of the device, portions of protected content that can be consumed by a user of the device only if the user of the device has permission to consume the protected content, and that can be transferred to ones of the multiple additional devices in the managed wireless distribution network regardless of whether the user of the device has permission to consume the protected content. | 21. A method implemented in a device, the method comprising: obtaining, via a managed wireless distribution network system of the device, parameters allowing the device to join wireless networks hosted by multiple additional devices in a managed wireless distribution network; joining a wireless network hosted by one of the multiple additional devices in order to transfer protected content between the device and the one of the multiple additional devices; identifying, via the managed wireless distribution network system and during a broadcast window, one or more of the wireless networks that the device can see; providing, via the managed wireless distribution network system and to a network management service, an indication of the one or more wireless networks that the device can see; and maintaining, at a content store of the device, portions of protected content that can be consumed by a user of the device only if the user of the device has permission to consume the protected content, and that can be transferred to ones of the multiple additional devices in the managed wireless distribution network regardless of whether the user of the device has permission to consume the protected content. 22. A method as recited in claim 21 , further comprising obtaining, via the managed wireless distribution network system, parameters of other wireless networks from the network management service, the parameters of a wireless network including a name of the wireless network and a security key of the wireless network. | 0.588083 |
9,756,149 | 12 | 16 | 12. A computing device, comprising: one or more processors; a storage device storing code for a program that is to be executed on the computing device; a plurality of sandboxing components that are each configured to execute the program on the computing device using respective software-based fault isolation techniques that are different from each other; and an application environment selector configured to select, from among the plurality of sandboxing components and based on a set of selection criteria, a first sandboxing component with which to execute the program. | 12. A computing device, comprising: one or more processors; a storage device storing code for a program that is to be executed on the computing device; a plurality of sandboxing components that are each configured to execute the program on the computing device using respective software-based fault isolation techniques that are different from each other; and an application environment selector configured to select, from among the plurality of sandboxing components and based on a set of selection criteria, a first sandboxing component with which to execute the program. 16. The computing device of claim 12 , further comprising a plurality of validator components that are each configured to verify, before the program is executed on the computing device, that the program complies with a set of rules associated with the sandboxing component that is selected to execute the program, wherein the application environment selector is further configured to select, based on the set of selection criteria, a first validator component with which to verify the program. | 0.545203 |
10,089,388 | 2 | 3 | 2. The method of claim 1 , further comprising: obtaining, in the computing device, a user request to adjust an amount of the contextual content for the search term that is included in the rendering of the search results; and generating, by the computing device, an updated rendering of the search results that comprises an adjusted amount of contextual content for the search term. | 2. The method of claim 1 , further comprising: obtaining, in the computing device, a user request to adjust an amount of the contextual content for the search term that is included in the rendering of the search results; and generating, by the computing device, an updated rendering of the search results that comprises an adjusted amount of contextual content for the search term. 3. The method of claim 2 , wherein the user request comprises a request for additional contextual content for the search term to be rendered by the computing device. | 0.626697 |
9,213,682 | 1 | 3 | 1. A business document auditing device comprising: a receiver configured to receive: a set of universal presentation rules comprising one or more parameters, said universal presentation rules configured to override all other presentation rules, wherein said universal presentation rules are enforced, irrespective of a user's wishes, across substantially every business document of the user, wherein the universal presentation rules comprise: page word count rules which limit the total word count on each page of each business document of the user; bullet point word count rules which limit the total word count on each bullet point included on each business document of the user; line count rules which limit the total number of lines on each page of each business document of the user; color rules which limit the palette of colors used on each page of each business document of the user; and density rules which limit the amount of white space on each page of each business document of the user; and a set of customized presentation rules comprising one or more parameters, said customized presentation rules customized by the user, wherein said customized presentation rules allow the user to enforce the customized presentation rules on a single business document, wherein the customized presentation rules are included on a displayable audit panel, wherein the displayable audit panel is viewable adjacent to the business document; a memory configured to store: execution instructions; one or more business documents; the set of universal presentation rules; and the set of customized presentation rules; and a processor coupled with the memory, the processor configured to execute the instructions, the instructions configured to cause the processor to: compare a parameter of an element of a business document of the one or more business documents to a first parameter of the universal presentation rules, wherein, when the parameter of the element of the business document is a non-compliant parameter, the processor is further configured to conform the element of the business document to the first parameter of the universal presentation rules; and compare the universal presentation rules to the customized presentation rules, wherein: when the universal presentation rules are in conflict with the customized presentation rules, the processor is further configured to cause the universal presentation rules to override the customized presentation rules; and when the universal presentation rules are not in conflict with the customized presentation rules, the processor is further configured to: compare the parameter of the element of the business document to a second parameter of the customized presentation rules, and cause the processor to, when the parameter of the element of the business document is a non-compliant parameter, present an option to the user to conform the element of the business document to the second parameter of the customized presentation rules. | 1. A business document auditing device comprising: a receiver configured to receive: a set of universal presentation rules comprising one or more parameters, said universal presentation rules configured to override all other presentation rules, wherein said universal presentation rules are enforced, irrespective of a user's wishes, across substantially every business document of the user, wherein the universal presentation rules comprise: page word count rules which limit the total word count on each page of each business document of the user; bullet point word count rules which limit the total word count on each bullet point included on each business document of the user; line count rules which limit the total number of lines on each page of each business document of the user; color rules which limit the palette of colors used on each page of each business document of the user; and density rules which limit the amount of white space on each page of each business document of the user; and a set of customized presentation rules comprising one or more parameters, said customized presentation rules customized by the user, wherein said customized presentation rules allow the user to enforce the customized presentation rules on a single business document, wherein the customized presentation rules are included on a displayable audit panel, wherein the displayable audit panel is viewable adjacent to the business document; a memory configured to store: execution instructions; one or more business documents; the set of universal presentation rules; and the set of customized presentation rules; and a processor coupled with the memory, the processor configured to execute the instructions, the instructions configured to cause the processor to: compare a parameter of an element of a business document of the one or more business documents to a first parameter of the universal presentation rules, wherein, when the parameter of the element of the business document is a non-compliant parameter, the processor is further configured to conform the element of the business document to the first parameter of the universal presentation rules; and compare the universal presentation rules to the customized presentation rules, wherein: when the universal presentation rules are in conflict with the customized presentation rules, the processor is further configured to cause the universal presentation rules to override the customized presentation rules; and when the universal presentation rules are not in conflict with the customized presentation rules, the processor is further configured to: compare the parameter of the element of the business document to a second parameter of the customized presentation rules, and cause the processor to, when the parameter of the element of the business document is a non-compliant parameter, present an option to the user to conform the element of the business document to the second parameter of the customized presentation rules. 3. The device of claim 1 further comprising: when the universal presentation rules are not in conflict with the customer presentation rules, the receiver further configured to receive, from the user, an instruction not to conform the element of the business document to the second parameter of the customized presentation rules. | 0.566138 |
8,265,933 | 2 | 3 | 2. The method of claim 1 , wherein the at least one first user device includes an instant messaging application, and wherein the first text is an instant message received by the second participant to the conversation via at least one second user device. | 2. The method of claim 1 , wherein the at least one first user device includes an instant messaging application, and wherein the first text is an instant message received by the second participant to the conversation via at least one second user device. 3. The method of claim 2 , wherein the at least one first user device and/or the at least one second user device comprises a mobile telephone. | 0.5 |
9,798,715 | 1 | 3 | 1. A method comprising: accessing first data representing text, wherein the text defines at least two grammatical break positions representing a particular type of grammatical break between two portions of the text; identifying, from among the at least two grammatical break positions, a position that is closest to a target position within the text, wherein the target position is within a range from a first position to a second position, wherein the first position is positioned after 100 words from a beginning of the text, and wherein the second position is positioned before 130 words from the beginning of the text; based on the identified position within the text, generating second data that represents a proper subset of the text, wherein the proper subset extends from an initial position within the text to the identified position within the text; and providing output based on the generated second data. | 1. A method comprising: accessing first data representing text, wherein the text defines at least two grammatical break positions representing a particular type of grammatical break between two portions of the text; identifying, from among the at least two grammatical break positions, a position that is closest to a target position within the text, wherein the target position is within a range from a first position to a second position, wherein the first position is positioned after 100 words from a beginning of the text, and wherein the second position is positioned before 130 words from the beginning of the text; based on the identified position within the text, generating second data that represents a proper subset of the text, wherein the proper subset extends from an initial position within the text to the identified position within the text; and providing output based on the generated second data. 3. The method of claim 1 , wherein the particular type of grammatical break between the two portions of the text comprises a sentence break between two paragraphs of the text. | 0.583333 |
10,110,385 | 4 | 5 | 4. A system, comprising: at least one computing device that implements one or more services, wherein the one or more services: receive, from a signatory, a request to generate a signature for a document, wherein the signatory is associated with multiple sets of credentials, wherein a first set of credentials is associated with a first duress level, and wherein a second set of credentials is associated with a second duress level; obtain a document identifier for the document, the document identifier derived based at least in part from document contents; obtain a token identifier for the at least one computing device, wherein the token identifier is registered with an identity registrar and authorized by the identity registrar to generate signatures, and wherein the token identifier comprises a first private key corresponding to a first public key and a second private key corresponding to a second public key; generate a first signature based at least in part on the document identifier, the first set of credentials, and the identity verification identifier, wherein the first signature is based at least in part on encrypting the document identifier using the first private key; determine that the generated first signature is not a match to the received signature of the signatory; generate a second signature based at least in part on the document identifier, the second set of credentials, and the identity verification identifier, wherein the second signature is based at least in part on encrypting the document identifier using the second private key; determine that the generated second signature is a match to the received signature of the signatory; and perform an action in accordance with a duress level associated with the second set of credentials, wherein the action is one or more of hiding information associated with a first account, displaying information associated with a second account, notifying security personnel of a security incident indicated by the duress level, sending a message indicating an occurrence of the duress level, indicating the occurrence of the duress level in a data store, or repudiating transactions associated with the document. | 4. A system, comprising: at least one computing device that implements one or more services, wherein the one or more services: receive, from a signatory, a request to generate a signature for a document, wherein the signatory is associated with multiple sets of credentials, wherein a first set of credentials is associated with a first duress level, and wherein a second set of credentials is associated with a second duress level; obtain a document identifier for the document, the document identifier derived based at least in part from document contents; obtain a token identifier for the at least one computing device, wherein the token identifier is registered with an identity registrar and authorized by the identity registrar to generate signatures, and wherein the token identifier comprises a first private key corresponding to a first public key and a second private key corresponding to a second public key; generate a first signature based at least in part on the document identifier, the first set of credentials, and the identity verification identifier, wherein the first signature is based at least in part on encrypting the document identifier using the first private key; determine that the generated first signature is not a match to the received signature of the signatory; generate a second signature based at least in part on the document identifier, the second set of credentials, and the identity verification identifier, wherein the second signature is based at least in part on encrypting the document identifier using the second private key; determine that the generated second signature is a match to the received signature of the signatory; and perform an action in accordance with a duress level associated with the second set of credentials, wherein the action is one or more of hiding information associated with a first account, displaying information associated with a second account, notifying security personnel of a security incident indicated by the duress level, sending a message indicating an occurrence of the duress level, indicating the occurrence of the duress level in a data store, or repudiating transactions associated with the document. 5. The system of claim 4 , wherein the one or more services further request, from the signatory, the credentials to use as part of the signature. | 0.852342 |
7,809,695 | 5 | 6 | 5. The system of claim 1 , wherein the signature-generation means for generating a plurality of document signatures comprises: means for determining one or more document length features or values; means for identifying a set of features from each document, based on their corresponding inverse-document-frequency (idf) values; means for determining positions of the features in each document; means for concatenating the set of features and their determined positions to define a string; means for hashing the string to define a hash value for each document; means for forming a document signature based on the document length feature or values and the hash value for each document; and storing a document signature in a memory device. | 5. The system of claim 1 , wherein the signature-generation means for generating a plurality of document signatures comprises: means for determining one or more document length features or values; means for identifying a set of features from each document, based on their corresponding inverse-document-frequency (idf) values; means for determining positions of the features in each document; means for concatenating the set of features and their determined positions to define a string; means for hashing the string to define a hash value for each document; means for forming a document signature based on the document length feature or values and the hash value for each document; and storing a document signature in a memory device. 6. The system of claim 5 , wherein the signature-generation means further comprises means for rounding the determined positions of each feature; and concatenating the set of features and their rounded determined positions to define a string. | 0.5 |
9,918,745 | 1 | 2 | 1. A medical implant assembly for securing an elongate rod to a bone, the medical implant assembly comprising: a shank with a lower body portion for fixation to the bone and an integral upper portion having a top radiused surface above a hemisphere thereof and a capture structure thereon; a receiver having a base and a pair of upright arms extending upward from the base with opposed interior surfaces that define an open channel for receiving the elongate rod, the arm interior surfaces having a closure top mating feature formed thereon, the base defining a chamber in communication with the open channel and having an upper capture region, a lower locking region, and a lower opening in communication with a bottom surface of the receiver, the receiver including an interference engagement surface between the lower opening and the closure top mating feature; an insert positioned within the receiver prior to the shank and configured to engage the elongate rod when the elongate rod is received within the open channel, the insert being positioned in the receiver entirely above the receiver chamber upper capture region and initially being prevented from moving downwardly within the receiver by the interference engagement surface, the insert having a central opening: a retainer positioned in the receiver chamber prior to the shank, the retainer capturing the shank upper portion capture structure within the receiver chamber upper capture region when the shank is uploaded through the receiver lower opening, wherein after the shank upper portion is captured by the retainer, the insert is forced downwardly within the receiver by a tool into engagement with the interference engagement surface so as to prevent the insert from moving back up within the receiver, and wherein the shank has pivotal motion in only one plane with respect to the receiver prior to locking of the medical implant assembly. | 1. A medical implant assembly for securing an elongate rod to a bone, the medical implant assembly comprising: a shank with a lower body portion for fixation to the bone and an integral upper portion having a top radiused surface above a hemisphere thereof and a capture structure thereon; a receiver having a base and a pair of upright arms extending upward from the base with opposed interior surfaces that define an open channel for receiving the elongate rod, the arm interior surfaces having a closure top mating feature formed thereon, the base defining a chamber in communication with the open channel and having an upper capture region, a lower locking region, and a lower opening in communication with a bottom surface of the receiver, the receiver including an interference engagement surface between the lower opening and the closure top mating feature; an insert positioned within the receiver prior to the shank and configured to engage the elongate rod when the elongate rod is received within the open channel, the insert being positioned in the receiver entirely above the receiver chamber upper capture region and initially being prevented from moving downwardly within the receiver by the interference engagement surface, the insert having a central opening: a retainer positioned in the receiver chamber prior to the shank, the retainer capturing the shank upper portion capture structure within the receiver chamber upper capture region when the shank is uploaded through the receiver lower opening, wherein after the shank upper portion is captured by the retainer, the insert is forced downwardly within the receiver by a tool into engagement with the interference engagement surface so as to prevent the insert from moving back up within the receiver, and wherein the shank has pivotal motion in only one plane with respect to the receiver prior to locking of the medical implant assembly. 2. The medical implant assembly of claim 1 , wherein the retainer is is non-pivoting with respect to the receiver after capturing the shank. | 0.856263 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.