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,596,485 | 1 | 6 |
1. A system including computer executable instructions on a computer storage media and the computer executable instructions being executed by a processing unit to implement one or more components comprising: a node generator configured to receive a parsed natural language sentence or phrase and recover phrasal and constituent nodes and grammatical tags for the phrasal and constituent nodes of the parsed natural language sentence or phrase and the node generator uses a head analysis component to analyze the phrasal and constituent nodes and grammatical tags of the parsed natural language sentence or phrase to generate hierarchical and dependent nodes of a language neutral representation of the parsed natural language sentence or phrase; and a node dependency generator configured to receive the hierarchical and dependent nodes and the grammatical tags of the parsed natural language sentence and create an iterative dependency structure including a preliminary dependency structure including one or more unlabeled dependencies to one or more semantic heads and a secondary dependency structure including semantic or grammatical labels replacing the one or more unlabeled dependencies to generate an unordered hierarchical dependency structure for the hierarchical and dependent nodes and the semantic or grammatical labels representing a language neutral relation between the hierarchical and dependent nodes different from the grammatical tags of the parsed natural language sentence or phrase using a semantic relation between the hierarchical and dependent nodes derived from the grammatical tags of the parsed natural language sentence or phrase.
|
1. A system including computer executable instructions on a computer storage media and the computer executable instructions being executed by a processing unit to implement one or more components comprising: a node generator configured to receive a parsed natural language sentence or phrase and recover phrasal and constituent nodes and grammatical tags for the phrasal and constituent nodes of the parsed natural language sentence or phrase and the node generator uses a head analysis component to analyze the phrasal and constituent nodes and grammatical tags of the parsed natural language sentence or phrase to generate hierarchical and dependent nodes of a language neutral representation of the parsed natural language sentence or phrase; and a node dependency generator configured to receive the hierarchical and dependent nodes and the grammatical tags of the parsed natural language sentence and create an iterative dependency structure including a preliminary dependency structure including one or more unlabeled dependencies to one or more semantic heads and a secondary dependency structure including semantic or grammatical labels replacing the one or more unlabeled dependencies to generate an unordered hierarchical dependency structure for the hierarchical and dependent nodes and the semantic or grammatical labels representing a language neutral relation between the hierarchical and dependent nodes different from the grammatical tags of the parsed natural language sentence or phrase using a semantic relation between the hierarchical and dependent nodes derived from the grammatical tags of the parsed natural language sentence or phrase. 6. The system of claim 1 wherein the node generator provides a derivation to represent scope and logical relation of constituents of a compound and coordinating noun phrase in the unordered hierarchical dependency structure.
| 0.751663 |
9,280,973 | 9 | 13 |
9. A method, comprising: receiving, by one or more computing devices, a request designating content, wherein the content has a user-selectable element; determining, by at least one computing device of the one or more computing devices, an audio command corresponding to the user-selectable element, the audio command being determined based at least in part on an acoustic differentiation between the audio command and a different audio command meeting or exceeding a threshold; associating, by at least one computing device of the one or more computing devices, the audio command with the user-selectable element; and causing information associated with audio command to be visually output by a projector associated with the second device.
|
9. A method, comprising: receiving, by one or more computing devices, a request designating content, wherein the content has a user-selectable element; determining, by at least one computing device of the one or more computing devices, an audio command corresponding to the user-selectable element, the audio command being determined based at least in part on an acoustic differentiation between the audio command and a different audio command meeting or exceeding a threshold; associating, by at least one computing device of the one or more computing devices, the audio command with the user-selectable element; and causing information associated with audio command to be visually output by a projector associated with the second device. 13. The method of claim 9 , wherein determining the audio command comprises selecting text from the user-selectable element.
| 0.73617 |
8,280,823 | 283 | 288 |
283. The graphical user interface of claim 274 , wherein the term of experience is rounded down to a unit of time.
|
283. The graphical user interface of claim 274 , wherein the term of experience is rounded down 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.
| 0.5 |
7,991,129 | 44 | 50 |
44. A system for providing a service for delivering information via voice media, comprising: a mechanism for allowing a user to select a plurality of sets of parameters for assigning automated voices to be used to deliver information associated with respective characteristics of the service; storage for storing the plurality of sets of parameters which are identifiable by data representing the user; an interface for receiving a communication from the user, the communication including a request involving delivery of information by said service, the data representing the user being obtained during the communication; a processor programmed to identify the plurality of sets of parameters based at least on the data; and a server responsive to the request for delivering selected information to the user in one of a plurality of automated voices as identified by one of the plurality of user selected sets of parameters which is associated with the delivery of information from said respective portions of said service.
|
44. A system for providing a service for delivering information via voice media, comprising: a mechanism for allowing a user to select a plurality of sets of parameters for assigning automated voices to be used to deliver information associated with respective characteristics of the service; storage for storing the plurality of sets of parameters which are identifiable by data representing the user; an interface for receiving a communication from the user, the communication including a request involving delivery of information by said service, the data representing the user being obtained during the communication; a processor programmed to identify the plurality of sets of parameters based at least on the data; and a server responsive to the request for delivering selected information to the user in one of a plurality of automated voices as identified by one of the plurality of user selected sets of parameters which is associated with the delivery of information from said respective portions of said service. 50. The system of claim 44 , wherein the delivery of information is a function of the service.
| 0.826568 |
6,088,651 | 3 | 6 |
3. A program product, said program product comprising: a name search mechanism, said name search mechanism using a single indexing structure to locate at least one computer system resource, wherein said at least one computer system resource can be located by said name search mechanism via a computer system resource name or via a computer system resource unique identifier (UID); and signal bearing media bearing said name search mechanism.
|
3. A program product, said program product comprising: a name search mechanism, said name search mechanism using a single indexing structure to locate at least one computer system resource, wherein said at least one computer system resource can be located by said name search mechanism via a computer system resource name or via a computer system resource unique identifier (UID); and signal bearing media bearing said name search mechanism. 6. The program product of claim 3 wherein said signal bearing media is recordable media.
| 0.721519 |
8,689,097 | 1 | 2 |
1. A system for automatic generation of a plurality of presentations and a plurality of templates based on a plurality of agendas, a plurality of audiences, and a plurality of annotated slides, said system including a computer having a computer readable medium having stored thereon instructions which, when executed by a processor of the computer, causes the processor to perform the steps of: determining an agenda from said plurality of agendas; determining an agenda description based on said agenda; determining a plurality of agenda terms based on term-frequency analysis of said agenda description; determining a plurality of agenda items based on said agenda; determining a plurality of participants based on said agenda, said plurality of audiences, and a plurality of roles of said plurality of audiences; computing a plurality of audience terms based on said plurality of participants; computing an agenda theme based on resolving said plurality of agenda terms and said plurality of audience terms; computing a plurality of agenda item terms based on term-frequency analysis of an agenda item of said plurality of agenda items; computing a plurality of resolved agenda items based on resolving of said plurality of agenda item terms and said plurality of audience terms; and matching a slide of said plurality of annotated slides based on said plurality of resolved agenda item terms and said agenda theme, wherein said step further comprises the steps of: determining a plurality of slide text terms based on a slide text annotation of said slide; determining a plurality of slide graphic terms based on a slide graphics annotation of said slide; determining a text match score based on a plurality of term match scores by term-set matching of said plurality of slide text terms and said plurality of resolved agenda item terms, wherein said step for determining a text match score further comprises steps of determining a term match score of said plurality of term match scores by term-pair matching of a slide text term of said plurality of slide text terms and a term of said plurality of resolved agenda item terms; and determining a graphics match score by term-set matching of said plurality of slide graphics terms and said plurality of resolved agenda item terms, wherein said slide is made a part of a presentation of said plurality of presentations based on said text match score and said graphics match score.
|
1. A system for automatic generation of a plurality of presentations and a plurality of templates based on a plurality of agendas, a plurality of audiences, and a plurality of annotated slides, said system including a computer having a computer readable medium having stored thereon instructions which, when executed by a processor of the computer, causes the processor to perform the steps of: determining an agenda from said plurality of agendas; determining an agenda description based on said agenda; determining a plurality of agenda terms based on term-frequency analysis of said agenda description; determining a plurality of agenda items based on said agenda; determining a plurality of participants based on said agenda, said plurality of audiences, and a plurality of roles of said plurality of audiences; computing a plurality of audience terms based on said plurality of participants; computing an agenda theme based on resolving said plurality of agenda terms and said plurality of audience terms; computing a plurality of agenda item terms based on term-frequency analysis of an agenda item of said plurality of agenda items; computing a plurality of resolved agenda items based on resolving of said plurality of agenda item terms and said plurality of audience terms; and matching a slide of said plurality of annotated slides based on said plurality of resolved agenda item terms and said agenda theme, wherein said step further comprises the steps of: determining a plurality of slide text terms based on a slide text annotation of said slide; determining a plurality of slide graphic terms based on a slide graphics annotation of said slide; determining a text match score based on a plurality of term match scores by term-set matching of said plurality of slide text terms and said plurality of resolved agenda item terms, wherein said step for determining a text match score further comprises steps of determining a term match score of said plurality of term match scores by term-pair matching of a slide text term of said plurality of slide text terms and a term of said plurality of resolved agenda item terms; and determining a graphics match score by term-set matching of said plurality of slide graphics terms and said plurality of resolved agenda item terms, wherein said slide is made a part of a presentation of said plurality of presentations based on said text match score and said graphics match score. 2. The system of claim 1 , wherein said term-pair matching of a slide text term of said plurality of slide text terms and a term of said plurality of resolved agenda item terms further comprises: determining a first frequency factor (ff 1 ) measure based on term-frequency analysis based on said slide text term; determining a second frequency factor (ff 2 ) measure based on term-frequency analysis based on said term; determining a first detail factor (df 1 ) measure based on said slide text term and a first pre-defined lookup table; determining a second detail factor (df 2 ) measure based on said term and said first pre-defined lookup table; determining a first product/process/people factor (pf 1 ) measure based on said slide text term and said first pre-defined lookup table; determining a second product/process/people factor (pf 2 ) measure based on said term and said first pre-defined lookup table; determining a first knowledge factor (kf 1 ) measure based on said slide text term and said first pre-defined lookup table; determining a second knowledge factor (kf 2 ) measure based on said term and said first pre-defined lookup table; computing a term measure based on said slide term, said term, a plurality of term hierarchical relationships, and a plurality of term network relationships; computing a frequency factor (ff) measure based on an absolute difference between said ffl and said ff 2 ; computing a detail factor (df) measure based on an absolute difference between said dfl and said df 2 ; computing a product/process/people factor (pf) measure based on said pf 1 , said pf 2 , and a second pre-defined lookup table; computing a knowledge factor (kf) measure based on said kfl, said kf 2 , and a third pre-defined lookup table; and computing said term match score based on said term measure, said ff measure, said df measure, said pf measure, said kf measure, and a plurality of pre-defined weights.
| 0.781207 |
8,961,183 | 17 | 19 |
17. A fill-in-the-blank audio-story game console, comprising; a main body defining an enclosure sized to receive a game-play controller, a speaker, a microphone, a power supply, and multiple buttons; wherein the microphone is coupled to the game-play controller; wherein the speaker is coupled to the game-play controller; wherein the power supply is coupled to the game-play controller; wherein the multiple buttons are coupled to the game-play controller and include a question button, a play-story button, a record answer button, and a start button; wherein the game-play controller includes a computing processor and computer storage media having instructions embodied thereon for generating a fill-in-the-blank audio story that when executed performs steps comprising: in response to activation of the question button, audibly outputting a prerecorded question asking for an answer corresponding to a blank within a prerecorded fill-in-the-blank story; in response to activation of the record answer button, recording an audible answer to the prerecorded question; audibly outputting the prerecorded question a second time asking for an additional answer corresponding to the blank within the prerecorded fill-in-the-blank story; in response to an additional activation of the record answer button, recording an additional audible answer to the prerecorded question; randomly selecting a specific user answer from the audible answer and the additional audible answer; inserting the selected specific user answer into the blank within the prerecorded fill-in-the-blank story; and in response to activation of the play-story button, outputting a completed audio fill-in-the-blank story that includes the selected specific user answer inserted into the prerecorded fill-in-the-blank story.
|
17. A fill-in-the-blank audio-story game console, comprising; a main body defining an enclosure sized to receive a game-play controller, a speaker, a microphone, a power supply, and multiple buttons; wherein the microphone is coupled to the game-play controller; wherein the speaker is coupled to the game-play controller; wherein the power supply is coupled to the game-play controller; wherein the multiple buttons are coupled to the game-play controller and include a question button, a play-story button, a record answer button, and a start button; wherein the game-play controller includes a computing processor and computer storage media having instructions embodied thereon for generating a fill-in-the-blank audio story that when executed performs steps comprising: in response to activation of the question button, audibly outputting a prerecorded question asking for an answer corresponding to a blank within a prerecorded fill-in-the-blank story; in response to activation of the record answer button, recording an audible answer to the prerecorded question; audibly outputting the prerecorded question a second time asking for an additional answer corresponding to the blank within the prerecorded fill-in-the-blank story; in response to an additional activation of the record answer button, recording an additional audible answer to the prerecorded question; randomly selecting a specific user answer from the audible answer and the additional audible answer; inserting the selected specific user answer into the blank within the prerecorded fill-in-the-blank story; and in response to activation of the play-story button, outputting a completed audio fill-in-the-blank story that includes the selected specific user answer inserted into the prerecorded fill-in-the-blank story. 19. The game console of claim 17 , wherein the multiple buttons further comprise a try-me button, and wherein the steps further comprise, upon activation of the try-me button, audibly outputting a sample question, recording a sample answer from the user, altering the sample answer to sound like a voice reading the prerecorded fill-in-the-blank story, inserting the sample answer into a blank within a sample prerecorded fill-in-the-blank story, audibly outputting the sample prerecorded fill-in-the-blank story including the sample answer, and then erasing the sample answer.
| 0.5 |
9,152,918 | 1 | 9 |
1. One or more computer-readable devices, not being a signal per se, having computer-executable instructions embodied thereon that when executed provide a method for medical resource forecasting, the method comprising: retrieving records of a first data set comprising historical medical data related to resource usage, wherein the historical medical data related to resource usage comprises usage determination data and context determination data; processing the records to determine a Bayesian network model including Bayesian node elements, wherein processing comprises: applying resource usage determination data to incorporate resource need as a hidden state of said Bayesian network, and applying context determination data to incorporate context data as observable states of said Bayesian network; producing a simplified model, based on analyzing the Bayesian network model; generating a predictive model using said simplified model; and running the predictive model to generating a forecast of resource needs.
|
1. One or more computer-readable devices, not being a signal per se, having computer-executable instructions embodied thereon that when executed provide a method for medical resource forecasting, the method comprising: retrieving records of a first data set comprising historical medical data related to resource usage, wherein the historical medical data related to resource usage comprises usage determination data and context determination data; processing the records to determine a Bayesian network model including Bayesian node elements, wherein processing comprises: applying resource usage determination data to incorporate resource need as a hidden state of said Bayesian network, and applying context determination data to incorporate context data as observable states of said Bayesian network; producing a simplified model, based on analyzing the Bayesian network model; generating a predictive model using said simplified model; and running the predictive model to generating a forecast of resource needs. 9. The computer-readable media of claim 1 , further comprising: receiving a schedule of resources; and comparing the forecast of resource needs to the schedule of resources to determine one or more differences.
| 0.5 |
8,122,432 | 2 | 5 |
2. The computer-implemented method of claim 1 , wherein potential objects and terms for a business vocabulary context are categorized, and wherein a specific business vocabulary context is represented by a category to determine which choice of rules is presented to a particular user.
|
2. The computer-implemented method of claim 1 , wherein potential objects and terms for a business vocabulary context are categorized, and wherein a specific business vocabulary context is represented by a category to determine which choice of rules is presented to a particular user. 5. The computer-implemented method of claim 2 , further comprising: creating a new rule that comports with the business vocabulary context in the existing software application.
| 0.5 |
7,487,174 | 1 | 4 |
1. A method of storing annotations with associated type information in a structured data store, comprising: generating an object type system; said object type system comprising at least two name objects and at least one action object; generating the annotations and associated object graphs; indicating relationships between annotations; each of said relationships responsive to an action, an initiator of said action and a recipient of said action; mapping an input object type system into a queryable structured data format; mapping input data from input objects in the input object type system to the queryable structured data format; retaining an identifier for each input object as a sub-element or an attribute of an element of said queryable structured data format; wherein the queryable structured data format and associated data persist in a structured data repository; wherein identity of said input objects is preserved in said structured data repository; and wherein the queryable structured data format comprises an XML schema; wherein said mapping said input object type system comprises the steps of: selecting a type from said input object type system; determining if said type is a base type; and if said type is a base type, then creating an XML schema with name of said type; and if said type is not a base type, then creating an XML schema with name of said type, said XML schema is a subtype of another XML schema.
|
1. A method of storing annotations with associated type information in a structured data store, comprising: generating an object type system; said object type system comprising at least two name objects and at least one action object; generating the annotations and associated object graphs; indicating relationships between annotations; each of said relationships responsive to an action, an initiator of said action and a recipient of said action; mapping an input object type system into a queryable structured data format; mapping input data from input objects in the input object type system to the queryable structured data format; retaining an identifier for each input object as a sub-element or an attribute of an element of said queryable structured data format; wherein the queryable structured data format and associated data persist in a structured data repository; wherein identity of said input objects is preserved in said structured data repository; and wherein the queryable structured data format comprises an XML schema; wherein said mapping said input object type system comprises the steps of: selecting a type from said input object type system; determining if said type is a base type; and if said type is a base type, then creating an XML schema with name of said type; and if said type is not a base type, then creating an XML schema with name of said type, said XML schema is a subtype of another XML schema. 4. The method of claim 1 , wherein the input data comprises a text document; said names include a person's name and an organization's name and said action is said person contacting said organization.
| 0.5 |
8,639,742 | 17 | 19 |
17. The system of claim 16 further comprising: in response to receiving the request for the document from the client application: determining a caching status of the document with respect to a client cache; and when the caching status of the document is not fresh, submitting a retrieval request to the server for the document.
|
17. The system of claim 16 further comprising: in response to receiving the request for the document from the client application: determining a caching status of the document with respect to a client cache; and when the caching status of the document is not fresh, submitting a retrieval request to the server for the document. 19. The system of claim 17 , wherein the caching status of the document in the client cache determined to be not fresh when the document is in the client cache and is stale.
| 0.5 |
8,024,195 | 1 | 11 |
1. An apparatus including a self service kiosk, the self service kiosk comprising: a speech recognizer including at least one recognition set, wherein the speech recognizer provides first recognition results; an audio user interface, the audio user interface coupled to deliver speech input data to the speech recognizer; and an identifier retrieval system to receive an identifier from a personal electronic device, the identifier providing identification of a user, wherein the identifier is used in retrieving history information, and wherein the speech recognizer uses the history information to modify the first recognition results, and wherein at least a portion of said history information is stored electronically with said identifier on the personal electronic device, and wherein the kiosk writes history information to said personal device after a transaction.
|
1. An apparatus including a self service kiosk, the self service kiosk comprising: a speech recognizer including at least one recognition set, wherein the speech recognizer provides first recognition results; an audio user interface, the audio user interface coupled to deliver speech input data to the speech recognizer; and an identifier retrieval system to receive an identifier from a personal electronic device, the identifier providing identification of a user, wherein the identifier is used in retrieving history information, and wherein the speech recognizer uses the history information to modify the first recognition results, and wherein at least a portion of said history information is stored electronically with said identifier on the personal electronic device, and wherein the kiosk writes history information to said personal device after a transaction. 11. The apparatus of claim 1 wherein identifier retrieval system comprises a manual interface device.
| 0.787815 |
8,635,180 | 16 | 17 |
16. A dual hash method for use with a pattern search engine, comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said search engine comprising two engines: a transition side and a default side; said BFSM being implemented in hardware, or a combination of hardware and software; having an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule to store default rules and dual hash rules that apply to a pattern context search in a said default rule bank; storing transition rules that apply to a pattern context search in a transition rule bank; and determining a winning rule by prioritizing between a dual hash rule read from said default rule bank and a transition rule read from said transition rule bank; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character.
|
16. A dual hash method for use with a pattern search engine, comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said search engine comprising two engines: a transition side and a default side; said BFSM being implemented in hardware, or a combination of hardware and software; having an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule to store default rules and dual hash rules that apply to a pattern context search in a said default rule bank; storing transition rules that apply to a pattern context search in a transition rule bank; and determining a winning rule by prioritizing between a dual hash rule read from said default rule bank and a transition rule read from said transition rule bank; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character. 17. The method according to claim 16 , wherein said dual hash lookup is utilized in the event no default rule lookup is to be performed.
| 0.800587 |
7,599,920 | 23 | 25 |
23. The computer system of claim 14 , wherein the instructions for providing further includes instructions providing, for concurrent display: the current crawl rate associated with the crawling of the respective website; crawl data, including statistical information associated with crawling the respective website; and an interface for enabling the respective owner to select a new crawl rate limit.
|
23. The computer system of claim 14 , wherein the instructions for providing further includes instructions providing, for concurrent display: the current crawl rate associated with the crawling of the respective website; crawl data, including statistical information associated with crawling the respective website; and an interface for enabling the respective owner to select a new crawl rate limit. 25. The computer system of claim 23 , wherein the instructions for providing further includes instructions for providing an information display having recommendations for selecting the new crawl rate limit, wherein the recommendations are based, at least in part, on whether the current crawl rate is a limiting factor in crawling the website.
| 0.5 |
9,630,109 | 13 | 15 |
13. A computer system comprising: one or more processors; a software program, executable on said computer system, the software program configured to: cause a context engine comprising an in-memory database engine to collect data from a first source regarding a first event comprising an action taken in an enterprise by an actor; cause the context engine to collect first context data over an asynchronous message broker from a second source comprising a machine-to-machine stack including a hygroscopic sensor from a wearable of the actor; cause the context engine to collect second context data over the asynchronous message broker from a third source comprising a second gamification platform regarding a second event involving the actor; cause the context engine to perform a first aggregation of the first context data from the second source, and then to perform a second aggregation to process the data and aggregated first context data to create context enriched data by calculating a defined trust metric from the data and the second context data; cause the context engine to store the context enriched data in an in-memory database; cause the context engine to provide the context enriched data in a view within the in-memory database; determine from the context enriched data that the actor has achieved a predetermined goal; based upon achievement of the predetermined goal, trigger the asynchronous message broker to communicate a message to assign an additional role to the actor.
|
13. A computer system comprising: one or more processors; a software program, executable on said computer system, the software program configured to: cause a context engine comprising an in-memory database engine to collect data from a first source regarding a first event comprising an action taken in an enterprise by an actor; cause the context engine to collect first context data over an asynchronous message broker from a second source comprising a machine-to-machine stack including a hygroscopic sensor from a wearable of the actor; cause the context engine to collect second context data over the asynchronous message broker from a third source comprising a second gamification platform regarding a second event involving the actor; cause the context engine to perform a first aggregation of the first context data from the second source, and then to perform a second aggregation to process the data and aggregated first context data to create context enriched data by calculating a defined trust metric from the data and the second context data; cause the context engine to store the context enriched data in an in-memory database; cause the context engine to provide the context enriched data in a view within the in-memory database; determine from the context enriched data that the actor has achieved a predetermined goal; based upon achievement of the predetermined goal, trigger the asynchronous message broker to communicate a message to assign an additional role to the actor. 15. The computer system of claim 13 wherein the second source comprises a social network, business process, tool, or communication system.
| 0.819843 |
8,214,354 | 7 | 8 |
7. The method set forth in claim 6 wherein the transformation function returns more than one term in the different set of terms that replaces the term in the constrained object and the method further includes the step of: selecting one of more than one terms to replace the term in the constrained object.
|
7. The method set forth in claim 6 wherein the transformation function returns more than one term in the different set of terms that replaces the term in the constrained object and the method further includes the step of: selecting one of more than one terms to replace the term in the constrained object. 8. The method set forth in claim 7 wherein: in the step of selecting one of the more than one terms, the selection is made on the basis of input from a user of the relational database management system.
| 0.5 |
5,402,504 | 1 | 7 |
1. In a digital processing system, a method of processing a binary text image containing at least a first region containing at least a first word having a first type style and a second region containing at least a second word having a second type style to identify locations of said first words having said first type style, comprising the steps of: a) eroding said binary text image with a first structuring element to provide a first destination image having a plurality of remaining pixels, said first structuring element more likely to provide a hit in said first region than in said second region; and b) morphologically processing said remaining pixels of said first destination image to create a mask image substantially masking said locations of said first words.
|
1. In a digital processing system, a method of processing a binary text image containing at least a first region containing at least a first word having a first type style and a second region containing at least a second word having a second type style to identify locations of said first words having said first type style, comprising the steps of: a) eroding said binary text image with a first structuring element to provide a first destination image having a plurality of remaining pixels, said first structuring element more likely to provide a hit in said first region than in said second region; and b) morphologically processing said remaining pixels of said first destination image to create a mask image substantially masking said locations of said first words. 7. The method as recited in claim 1 wherein said first type style is a bold type style.
| 0.9375 |
9,805,023 | 7 | 8 |
7. An apparatus, comprising: a first processor; a network adapter; and storage bearing instructions executable by a second processor for: storing a first phrase derived from a sent message for presentation during a subsequent composition of a second message, wherein the first phrase as stored comprises a variable that will be replaced with at least one character for a particular recipient during composition of the second message; during composition of the second message, identifying the first phrase for presentation; and during composition of the second message, presenting, on a display, at least a portion of the first phrase; wherein the first processor transfers the instructions to the second processor over a network via the network adapter.
|
7. An apparatus, comprising: a first processor; a network adapter; and storage bearing instructions executable by a second processor for: storing a first phrase derived from a sent message for presentation during a subsequent composition of a second message, wherein the first phrase as stored comprises a variable that will be replaced with at least one character for a particular recipient during composition of the second message; during composition of the second message, identifying the first phrase for presentation; and during composition of the second message, presenting, on a display, at least a portion of the first phrase; wherein the first processor transfers the instructions to the second processor over a network via the network adapter. 8. The apparatus of claim 7 , wherein the instructions are executable by the second processor for: present, on the display, a settings user interface (UI) comprising at least one option to select one or more recipients for which to present candidate phrases in the future while messages thereto are being composed in the future.
| 0.5 |
10,140,283 | 12 | 15 |
12. A method of populating a predictive text dictionary of a computing device, the method comprising: receiving a selection of one or more word categories, wherein the one or more word categories include a plurality of words, each of the plurality of words is associated with a date when the word was added to the one or more word categories, one of the one or more word categories is a location-specific category, and each word in the location-specific category is associated with a location; in response to receiving the selection, updating a user preference to include the selected one or more word categories, wherein the user preference includes a date when a last previous update occurred for the predictive text dictionary of the computing device; sending a request, from the computing device to a server through a communication network, for a new word, the request including a location of the computing device, wherein the server determines that the location of the computing device is different than a previous location of the computing device, and the new word is selected at least partially based on the location of the computing device matching a location associated with the new word if the new word is in the location-specific category, and the date when the last previous update occurred for the predictive text dictionary of the computing device prior to a date when the new word was added to the one or more word categories; receiving, at the computing device, the new word from the server through the communication network; updating, by the computing device, the predictive text dictionary of the computing device to include an addition of the received new word, wherein updating the predictive text dictionary also includes discarding an existing word from the predictive text dictionary, and the existing word is associated with the previous location of the computing device; receiving text input at the computing device; and in response to receiving the text input, presenting, at the computing device, at least one predicted word that is based on the text input and the updated predictive text dictionary.
|
12. A method of populating a predictive text dictionary of a computing device, the method comprising: receiving a selection of one or more word categories, wherein the one or more word categories include a plurality of words, each of the plurality of words is associated with a date when the word was added to the one or more word categories, one of the one or more word categories is a location-specific category, and each word in the location-specific category is associated with a location; in response to receiving the selection, updating a user preference to include the selected one or more word categories, wherein the user preference includes a date when a last previous update occurred for the predictive text dictionary of the computing device; sending a request, from the computing device to a server through a communication network, for a new word, the request including a location of the computing device, wherein the server determines that the location of the computing device is different than a previous location of the computing device, and the new word is selected at least partially based on the location of the computing device matching a location associated with the new word if the new word is in the location-specific category, and the date when the last previous update occurred for the predictive text dictionary of the computing device prior to a date when the new word was added to the one or more word categories; receiving, at the computing device, the new word from the server through the communication network; updating, by the computing device, the predictive text dictionary of the computing device to include an addition of the received new word, wherein updating the predictive text dictionary also includes discarding an existing word from the predictive text dictionary, and the existing word is associated with the previous location of the computing device; receiving text input at the computing device; and in response to receiving the text input, presenting, at the computing device, at least one predicted word that is based on the text input and the updated predictive text dictionary. 15. The method of claim 12 , wherein the computing device includes a GPS receiver, and is capable of determining a latitude and a longitude of the location of the computing device.
| 0.543147 |
8,103,614 | 29 | 31 |
29. A system comprising: one or more processors; and one or more computer-readable storage media storing computer-executable instructions that, when executed, cause the one or more processors to perform acts comprising: receiving a relational tag , the relational tag relating a base item to at least one other item according to a defined relationship between the base item and the at least one other item, wherein the defined relationship includes a type selected from a plurality of types comprising: a sameness type of relationship representing that the base item is the same as the at least one other item; an includes type of relationship representing that the base item includes the at least one other item; a causal type of relationship representing that the base item causes the at least one other item; a ranking relationship representing how the base item ranks with respect to the at least one other item within an identified context; a quality type of relationship representing that the base item is better quality the at least one other item; a cost type of relationship representing that the base item is less expensive the at least one other item; a trend type of relationship representing that the base item is more current than the at least one other item; a better than type of relationship representing that the base item is better than the at least one other item; a worse than type of relationship representing that the base item is worse than the at least one other item; a greater than (>) type of relationship representing that the base item is greater than the at least one other item; a less than (<) type of relationship representing that the base item is less than the at least one other item; an approximately equal (≈) type of relationship representing that the base item is approximately equal to the at least one other item; or a user created type of relationship representing that the base item has the user created type of relationship to the at least one other item; and annotating the base item with the relational tag.
|
29. A system comprising: one or more processors; and one or more computer-readable storage media storing computer-executable instructions that, when executed, cause the one or more processors to perform acts comprising: receiving a relational tag , the relational tag relating a base item to at least one other item according to a defined relationship between the base item and the at least one other item, wherein the defined relationship includes a type selected from a plurality of types comprising: a sameness type of relationship representing that the base item is the same as the at least one other item; an includes type of relationship representing that the base item includes the at least one other item; a causal type of relationship representing that the base item causes the at least one other item; a ranking relationship representing how the base item ranks with respect to the at least one other item within an identified context; a quality type of relationship representing that the base item is better quality the at least one other item; a cost type of relationship representing that the base item is less expensive the at least one other item; a trend type of relationship representing that the base item is more current than the at least one other item; a better than type of relationship representing that the base item is better than the at least one other item; a worse than type of relationship representing that the base item is worse than the at least one other item; a greater than (>) type of relationship representing that the base item is greater than the at least one other item; a less than (<) type of relationship representing that the base item is less than the at least one other item; an approximately equal (≈) type of relationship representing that the base item is approximately equal to the at least one other item; or a user created type of relationship representing that the base item has the user created type of relationship to the at least one other item; and annotating the base item with the relational tag. 31. The system of claim 29 , the relational tag comprising: a name tag that identifies the type of relationship represented by the relational tag; and a value tag that expresses the at least one other item.
| 0.644828 |
9,697,260 | 15 | 16 |
15. The method of claim 1 , wherein each edge comprises one or more attributes.
|
15. The method of claim 1 , wherein each edge comprises one or more attributes. 16. The method of claim 15 , wherein determining the value for each identified location comprises, for each identified location: identifying the attributes for each edge connected to the node corresponding to the identified location; and determining the value for the identified location based on the attributes of the edges connected to the node corresponding to the identified location.
| 0.5 |
8,782,036 | 1 | 18 |
1. A computer implemented method for searching resources of a computer system comprising: enabling a user to input a keyword, wherein the keyword is used to generate a list of search results corresponding to resources; wherein the resources include files accessed by the user on the computer system; enabling the user to select one or more filters from a plurality of filters, wherein selection of a filter, from the plurality of filters, filters the list of search results of the resources based on the selected filter; wherein the list of filters includes one or more implicit activity-based associations (IAA); wherein the IAAs denote implicit, nondeterministic associations between resources based on interactions between the user and the resources before the search occurred; wherein the search results are clustered by the one or more IAAs; wherein at least one of the filters is a lifetime of a resource filter, wherein the selection of a lifetime of a resource filter includes selection of first resource; wherein the lifetime of a resource filter filters the resources to filter those resources of the plurality of resources not accessed during the lifetime of the first resource; wherein the lifetime of a resource is the time between when the resource of the plurality of resources was opened and closed on the computer system; and displaying the search results corresponding to resources and associations for the filtered list of the search results based on the keyword and selection of filters; wherein each resource corresponds to one or more associations; wherein the associations represent a user's interactions with a group of the resources of the computer system within the lifetime of the resource corresponding to the search result.
|
1. A computer implemented method for searching resources of a computer system comprising: enabling a user to input a keyword, wherein the keyword is used to generate a list of search results corresponding to resources; wherein the resources include files accessed by the user on the computer system; enabling the user to select one or more filters from a plurality of filters, wherein selection of a filter, from the plurality of filters, filters the list of search results of the resources based on the selected filter; wherein the list of filters includes one or more implicit activity-based associations (IAA); wherein the IAAs denote implicit, nondeterministic associations between resources based on interactions between the user and the resources before the search occurred; wherein the search results are clustered by the one or more IAAs; wherein at least one of the filters is a lifetime of a resource filter, wherein the selection of a lifetime of a resource filter includes selection of first resource; wherein the lifetime of a resource filter filters the resources to filter those resources of the plurality of resources not accessed during the lifetime of the first resource; wherein the lifetime of a resource is the time between when the resource of the plurality of resources was opened and closed on the computer system; and displaying the search results corresponding to resources and associations for the filtered list of the search results based on the keyword and selection of filters; wherein each resource corresponds to one or more associations; wherein the associations represent a user's interactions with a group of the resources of the computer system within the lifetime of the resource corresponding to the search result. 18. The method of claim 1 further comprising: defining one or more tasks, wherein each task is associated with a set of resources; wherein the resources can belong to several tasks; defining a lifecycle for at least one of the resources of the sets of resources; and defining a key for each of the one or more tasks, wherein the key is based on the lifecycles for resources in the set of one or more resources for the each task of the one or more tasks.
| 0.5 |
8,812,518 | 17 | 18 |
17. 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: obtaining first search results that were generated for a search query; determining, by operation of a system, a first search results score associated with the first search results, wherein the first search results score is based on (i) a respective rank of each first search result, and (ii) a respective first popularity score associated with each first search result; revising the search query using a query revision rule; obtaining second search results that were generated for the revised search query; determining a second search results score associated with the second search results, wherein the second search results score is based on (i) a respective rank of each second search result, and (ii) a respective second popularity score associated with each second search result; determining that a difference between the first search results score and the second search results score satisfies a specified threshold; and in response to determining that a difference between the first search results score and the second search results score satisfies the specified threshold, identifying the query revision rule as a good revision rule for the search query.
|
17. 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: obtaining first search results that were generated for a search query; determining, by operation of a system, a first search results score associated with the first search results, wherein the first search results score is based on (i) a respective rank of each first search result, and (ii) a respective first popularity score associated with each first search result; revising the search query using a query revision rule; obtaining second search results that were generated for the revised search query; determining a second search results score associated with the second search results, wherein the second search results score is based on (i) a respective rank of each second search result, and (ii) a respective second popularity score associated with each second search result; determining that a difference between the first search results score and the second search results score satisfies a specified threshold; and in response to determining that a difference between the first search results score and the second search results score satisfies the specified threshold, identifying the query revision rule as a good revision rule for the search query. 18. The system of claim 17 , wherein obtaining the first search results that were generated for the search query comprises: obtaining ranking information associated with the first search results; and obtaining first popularity scores associated with the first search results, wherein a first popularity score reflects the popularity of a search result in connection with the search query.
| 0.72791 |
8,239,375 | 8 | 11 |
8. The method of claim 1 further comprising after initiating the conducting a search of the components and before concluding the search, displaying at least one of the at least one search result.
|
8. The method of claim 1 further comprising after initiating the conducting a search of the components and before concluding the search, displaying at least one of the at least one search result. 11. The method of claim 8 further comprising after the concluding the search, displaying all of the plurality of search results.
| 0.671795 |
8,375,312 | 12 | 21 |
12. A medium bearing instructions to enable one or more machines to perform operations, the operations comprising: displaying one or more poster frames in a user interface, wherein a poster frame corresponds to an item of digital content; in response to receiving an input, displaying a plurality of first level classification panes adjacent to a poster frame corresponding to an item of digital content, wherein each of the first level classification panes is associated with a corresponding keyword; detecting a selection and positioning of the poster frame at an at least partially common location with a classification pane of the plurality of first level classification panes; and in response to the detecting, associating the item of digital content to which the selected poster frame corresponds with a keyword associated with the first level classification pane on which the selected poster frame that corresponds to the item of digital content is positioned.
|
12. A medium bearing instructions to enable one or more machines to perform operations, the operations comprising: displaying one or more poster frames in a user interface, wherein a poster frame corresponds to an item of digital content; in response to receiving an input, displaying a plurality of first level classification panes adjacent to a poster frame corresponding to an item of digital content, wherein each of the first level classification panes is associated with a corresponding keyword; detecting a selection and positioning of the poster frame at an at least partially common location with a classification pane of the plurality of first level classification panes; and in response to the detecting, associating the item of digital content to which the selected poster frame corresponds with a keyword associated with the first level classification pane on which the selected poster frame that corresponds to the item of digital content is positioned. 21. The medium of claim 12 , the operations further comprising: in response to receiving another input, displaying a plurality of second level classification panes adjacent to the first level classification pane on which the selected poster frame that corresponds to the item of digital content is positioned, wherein each second level classification pane is a further classification of the first level classification pane and each second level classification pane is associated with a second keyword; detecting a positioning of the poster frame that was previously positioned at the first level classification pane, at an at least partially common location with a second level classification pane; and associating the item of digital content to which the selected poster frame corresponds with a second keyword associated with the second level classification pane on which the poster frame that corresponds to the item of digital content is positioned.
| 0.5 |
7,856,472 | 1 | 52 |
1. In a computer system including a plurality of n-tuples, each of the plurality of n-tuples including n>1 text strings, a computer-implemented method comprising: displaying at least one window in connection with a website; displaying, utilizing the at least one window, a stock-related field; receiving a plurality of characters of text from a user as the user is typing the text utilizing the stock-related field; after the user types each character in the received text, dynamically determining whether the characters typed so far match one or more text strings in a first one of a plurality of n-tuples including n>1 text strings, each of the plurality of n-tuples including first text representing a stock ticker symbol and second text representing a company name corresponding to the stock ticker symbol; if it is determined that the characters typed so far match the one or more text strings in the one of the plurality of n-tuples, indicating to the user that a match has been found, utilizing the at least one window; displaying, utilizing the at least one window, a plurality of message summaries; wherein the plurality of message summaries comprise first information derived from a first message of a plurality of first messages and second information derived from a second message of a plurality of second messages associated with at least one online forum; displaying, utilizing the at least one window, a first set of representations; receiving first input from the user indicating a selection of one of the first set of representations; displaying a second set of representations representing a set of hyperlinks, utilizing the at least one window, in response to receiving the first input; receiving second input from the user indicating a selection of one of the second set of representations; and navigating to a destination specified by the selected one of the second set of representations, in response to receiving the second input.
|
1. In a computer system including a plurality of n-tuples, each of the plurality of n-tuples including n>1 text strings, a computer-implemented method comprising: displaying at least one window in connection with a website; displaying, utilizing the at least one window, a stock-related field; receiving a plurality of characters of text from a user as the user is typing the text utilizing the stock-related field; after the user types each character in the received text, dynamically determining whether the characters typed so far match one or more text strings in a first one of a plurality of n-tuples including n>1 text strings, each of the plurality of n-tuples including first text representing a stock ticker symbol and second text representing a company name corresponding to the stock ticker symbol; if it is determined that the characters typed so far match the one or more text strings in the one of the plurality of n-tuples, indicating to the user that a match has been found, utilizing the at least one window; displaying, utilizing the at least one window, a plurality of message summaries; wherein the plurality of message summaries comprise first information derived from a first message of a plurality of first messages and second information derived from a second message of a plurality of second messages associated with at least one online forum; displaying, utilizing the at least one window, a first set of representations; receiving first input from the user indicating a selection of one of the first set of representations; displaying a second set of representations representing a set of hyperlinks, utilizing the at least one window, in response to receiving the first input; receiving second input from the user indicating a selection of one of the second set of representations; and navigating to a destination specified by the selected one of the second set of representations, in response to receiving the second input. 52. The method of claim 1 , wherein the receiving the second input from the user comprises receiving first input from the user indicating a mouse cursor hovering over the selected one of the second set of representations.
| 0.728501 |
7,716,212 | 1 | 11 |
1. A query framework system comprising: a processor executing instructions; a memory storing instructions coupled to the processor, when executed by the processor the instructions providing: a query framework service consuming a query and returning a result set having a provider application programming interface defining a consistent application programming interface for providers; one or more providers incorporating query processing logic of one or more query processing operations, the one or more providers implementing the provider application programming interface, each of the one or more query processing operations consuming a different portion of the query and returning a resultant query portion, wherein each of the one or more providers supports a unique subset of the one or more query processing operations, wherein the one or more providers includes one or more of: query transformation providers for performing query transformation during a query planning phase of query execution; and query planning providers for providing access to external data sources by translating the query portion to a query language of the underlying data source; a configuration repository for storing a list of the one or more providers in the query framework system and their properties; an operation support table describing the one or more query processing operations supported by each of the one or more providers; and a coordination planner organizing the processing of the query by the one or more providers based on the supported query processing operations stored in the operation support table, wherein the coordination planner decomposes the query into the different portions such that at least two of the different portions of the query are mutually exclusive.
|
1. A query framework system comprising: a processor executing instructions; a memory storing instructions coupled to the processor, when executed by the processor the instructions providing: a query framework service consuming a query and returning a result set having a provider application programming interface defining a consistent application programming interface for providers; one or more providers incorporating query processing logic of one or more query processing operations, the one or more providers implementing the provider application programming interface, each of the one or more query processing operations consuming a different portion of the query and returning a resultant query portion, wherein each of the one or more providers supports a unique subset of the one or more query processing operations, wherein the one or more providers includes one or more of: query transformation providers for performing query transformation during a query planning phase of query execution; and query planning providers for providing access to external data sources by translating the query portion to a query language of the underlying data source; a configuration repository for storing a list of the one or more providers in the query framework system and their properties; an operation support table describing the one or more query processing operations supported by each of the one or more providers; and a coordination planner organizing the processing of the query by the one or more providers based on the supported query processing operations stored in the operation support table, wherein the coordination planner decomposes the query into the different portions such that at least two of the different portions of the query are mutually exclusive. 11. The query framework system of claim 1 , wherein the coordination planner receives the query, identifies the query processing operations of the operation support table required to process the query, determines the two or more providers that support the query processing operations from the configuration repository, separates the query into the different portions based on the processing operations of the determined providers, and sends the different portions of the query to the respective providers.
| 0.834318 |
8,655,899 | 4 | 5 |
4. A program storage device readable by a machine and containing a set of instructions which, when read by the machine, causes execution of a computer based method for pangenetic social networking, comprising: a) receiving a request to identify a subset of one or more users of the social network having a common attribute set to a first user, wherein the common attribute set comprises at least one pangenetic and at least one non-pangenetic attribute, and wherein the pangenetic attribute(s) consist of genetic or epigenetic attribute(s); b) accessing an attribute profile associated with the first user including the common attribute set; c) accessing a database of attributes of a set of users of the social network, wherein the database of attributes includes pangenetic and non-pangenetic attributes of the set of users of the social network; d) determining, based on a correlation of the common attribute set and the attributes of the set of users of the social network, the subset of one or more users of the social network having the common attribute set, wherein the correlation is based on determining if the number of pangenetic and non-pangenetic attributes of the attributes of each of the users of the set of users of the social network that overlap with the common attribute set exceeds a predetermined threshold; and e) recommending an association between the first user and at least some of the set of one or more users of the social network having the common attribute set, wherein the association allows the creation of a social network group based on common interests and pangenetic similarity.
|
4. A program storage device readable by a machine and containing a set of instructions which, when read by the machine, causes execution of a computer based method for pangenetic social networking, comprising: a) receiving a request to identify a subset of one or more users of the social network having a common attribute set to a first user, wherein the common attribute set comprises at least one pangenetic and at least one non-pangenetic attribute, and wherein the pangenetic attribute(s) consist of genetic or epigenetic attribute(s); b) accessing an attribute profile associated with the first user including the common attribute set; c) accessing a database of attributes of a set of users of the social network, wherein the database of attributes includes pangenetic and non-pangenetic attributes of the set of users of the social network; d) determining, based on a correlation of the common attribute set and the attributes of the set of users of the social network, the subset of one or more users of the social network having the common attribute set, wherein the correlation is based on determining if the number of pangenetic and non-pangenetic attributes of the attributes of each of the users of the set of users of the social network that overlap with the common attribute set exceeds a predetermined threshold; and e) recommending an association between the first user and at least some of the set of one or more users of the social network having the common attribute set, wherein the association allows the creation of a social network group based on common interests and pangenetic similarity. 5. The device of claim 4 , wherein the recommending comprises transmitting an electronic notification of the social network group to at least some of the set of one or more of the users of the social network having the common attribute set.
| 0.5 |
8,346,792 | 19 | 20 |
19. The system of claim 17 , wherein identifying the embedded coding fragments from the structured document comprises identifying an HTML tag pair.
|
19. The system of claim 17 , wherein identifying the embedded coding fragments from the structured document comprises identifying an HTML tag pair. 20. The system of claim 19 , where identifying the one or more embedded coding fragments from the structured document comprises: identifying at least a portion of content enclosed by the HTML tag pair; identifying a query term in the seed queries; and identifying the embedded coding fragments when the portion of content matches the query term.
| 0.5 |
8,941,589 | 130 | 131 |
130. The system of claim 128 , wherein the processor translates the gesture to a gesture signal, and controls a component coupled to the processor in response to the gesture signal.
|
130. The system of claim 128 , wherein the processor translates the gesture to a gesture signal, and controls a component coupled to the processor in response to the gesture signal. 131. The system of claim 130 , wherein the detecting comprises identifying the gesture, wherein the identifying includes identifying a pose and an orientation of a portion of the body.
| 0.651515 |
10,198,363 | 21 | 22 |
21. The one or more non-transitory computer-readable media of claim 13 , wherein the particular in-memory data structure is a dense bloom filter data structure; and the sequences of instructions further include instructions which, when executed by the one or more hardware processors, cause: generating a hash value for the filtering value by applying a hash algorithm of cryptographic strength to the filtering value; identifying at least two sub-hash values of the hash value of the filtering value, wherein each sub-hash value of the at least two sub-hash values is statistically independent from other sub-hash value of the at least two sub-hash values; using said each sub-hash value, determining for said each sub-hash value, one or more bit addresses of a bit vector of the dense bloom data structure; if the one or more bit addresses of the bit vector for said each sub-hash value are set, then determining the particular data block set can possibly contain the filtering value in the particular column of the target data set; and if the one or more bit addresses of the bit vector for said each sub-hash value are not set, then determining the particular data block set cannot possibly contain the filtering value in the particular column of the target data set.
|
21. The one or more non-transitory computer-readable media of claim 13 , wherein the particular in-memory data structure is a dense bloom filter data structure; and the sequences of instructions further include instructions which, when executed by the one or more hardware processors, cause: generating a hash value for the filtering value by applying a hash algorithm of cryptographic strength to the filtering value; identifying at least two sub-hash values of the hash value of the filtering value, wherein each sub-hash value of the at least two sub-hash values is statistically independent from other sub-hash value of the at least two sub-hash values; using said each sub-hash value, determining for said each sub-hash value, one or more bit addresses of a bit vector of the dense bloom data structure; if the one or more bit addresses of the bit vector for said each sub-hash value are set, then determining the particular data block set can possibly contain the filtering value in the particular column of the target data set; and if the one or more bit addresses of the bit vector for said each sub-hash value are not set, then determining the particular data block set cannot possibly contain the filtering value in the particular column of the target data set. 22. The one or more non-transitory computer-readable media of claim 21 , wherein a particular type of the hash algorithm and length of output hash values of the hash algorithm depends on metadata associated with said each in-memory summary.
| 0.5 |
9,092,535 | 1 | 2 |
1. A method, comprising: at a computer with a processor and a display: receiving an electronic message that is sent over a network, the electronic message including a body of text including one or more words to be displayed to a receiving user, and a first portion of a first application program, the first application program including functionality for displaying advertisements on the display; after receiving the electronic message, detecting selection of the electronic message; and, in response to detecting selection of the electronic message: opening the electronic message, displaying the body of text on the display, and executing the first portion of the first application program, which calls a second portion of the first application program using as a parameter at least a portion of the one or more words displayed to the receiving user, the second portion of the first application program being located at a site on the network that is remote from the computer, thereby retrieving an advertisement and displaying the advertisement on the display.
|
1. A method, comprising: at a computer with a processor and a display: receiving an electronic message that is sent over a network, the electronic message including a body of text including one or more words to be displayed to a receiving user, and a first portion of a first application program, the first application program including functionality for displaying advertisements on the display; after receiving the electronic message, detecting selection of the electronic message; and, in response to detecting selection of the electronic message: opening the electronic message, displaying the body of text on the display, and executing the first portion of the first application program, which calls a second portion of the first application program using as a parameter at least a portion of the one or more words displayed to the receiving user, the second portion of the first application program being located at a site on the network that is remote from the computer, thereby retrieving an advertisement and displaying the advertisement on the display. 2. The method of claim 1 , wherein the first portion of the first application program is included in the electronic message and is not an attachment to the electronic message.
| 0.516575 |
5,526,407 | 1 | 6 |
1. A method for recording, categorizing, organizing, managing and retrieving speech information, said method comprising, a. obtaining a speech stream, b. storing the speech stream in at least a temporary storage, c. extracting multiple, selected features from the speech stream, wherein the multiple features include the speaker's identity or location, duration of speech phrases, and pauses in speaking, d. constructing a visual representation of the selected features of the speech stream, e. providing the visual representation to a user, f. categorizing portions of the speech stream, with or without the aid of the representation, by at least one of the following categorization techniques: user command and, automatic recognition of speech qualities, including tempo, fundamental pitch, and phonemes, and g. storing, in at least a temporary storage, data structure which represents the categorized portions of the speech stream.
|
1. A method for recording, categorizing, organizing, managing and retrieving speech information, said method comprising, a. obtaining a speech stream, b. storing the speech stream in at least a temporary storage, c. extracting multiple, selected features from the speech stream, wherein the multiple features include the speaker's identity or location, duration of speech phrases, and pauses in speaking, d. constructing a visual representation of the selected features of the speech stream, e. providing the visual representation to a user, f. categorizing portions of the speech stream, with or without the aid of the representation, by at least one of the following categorization techniques: user command and, automatic recognition of speech qualities, including tempo, fundamental pitch, and phonemes, and g. storing, in at least a temporary storage, data structure which represents the categorized portions of the speech stream. 6. The invention defined in claim 1 wherein the categorization is done by reference only to the visual representation without the need to actually listen to the speech itself.
| 0.778481 |
8,055,597 | 1 | 24 |
1. A computerized method for organizing media content, comprising: receiving a plurality of records corresponding to media content at a computer, the records each containing categorical data; obtaining a categorical dataset by mapping each of the plurality of records onto predefined fields of a system ontology, wherein the ontology fields correspond to an attribute space comprising a plurality of attributes each characterized by a plurality of terms, the dataset characterized by the attribute space, the dataset being unsorted; modifying the dataset, wherein the modifying the dataset comprises modifying one or more of the plurality of terms characterizing one or more of the plurality of attributes of the attribute space; decomposing the attribute space into a plurality of attribute subspaces each comprising one or more of the plurality of attributes; generating a parent taxonomy of the modified dataset with respect to one of the plurality of attribute subspaces, the parent taxonomy organizing the modified dataset into a plurality of data subsets; generating a child taxonomy with respect to another one of the plurality of attribute subspaces, the child taxonomy organizing each of the plurality of data subsets within the parent taxonomy into at least one data subset; iteratively repeating generating the child taxonomy until a predetermined termination condition is satisfied, wherein the child taxonomy of a preceding iteration is the parent taxonomy of the current iteration; and assigning category labels to the data subsets.
|
1. A computerized method for organizing media content, comprising: receiving a plurality of records corresponding to media content at a computer, the records each containing categorical data; obtaining a categorical dataset by mapping each of the plurality of records onto predefined fields of a system ontology, wherein the ontology fields correspond to an attribute space comprising a plurality of attributes each characterized by a plurality of terms, the dataset characterized by the attribute space, the dataset being unsorted; modifying the dataset, wherein the modifying the dataset comprises modifying one or more of the plurality of terms characterizing one or more of the plurality of attributes of the attribute space; decomposing the attribute space into a plurality of attribute subspaces each comprising one or more of the plurality of attributes; generating a parent taxonomy of the modified dataset with respect to one of the plurality of attribute subspaces, the parent taxonomy organizing the modified dataset into a plurality of data subsets; generating a child taxonomy with respect to another one of the plurality of attribute subspaces, the child taxonomy organizing each of the plurality of data subsets within the parent taxonomy into at least one data subset; iteratively repeating generating the child taxonomy until a predetermined termination condition is satisfied, wherein the child taxonomy of a preceding iteration is the parent taxonomy of the current iteration; and assigning category labels to the data subsets. 24. The method of claim 1 , wherein modifying the dataset comprises replacing one or more of the terms characterizing one or more of the attributes.
| 0.674009 |
9,832,646 | 27 | 28 |
27. The system of claim 1 , wherein the dynamic adjustments to the required threshold level are made for a dynamic time period.
|
27. The system of claim 1 , wherein the dynamic adjustments to the required threshold level are made for a dynamic time period. 28. The system of claim 27 , wherein the dynamic time period can be until predetermined criteria are met, the predetermined criteria including at least one of a certain number of users passing the required threshold level, a specified time period, or until the second processing node adjusts the required threshold levels for a predetermined number of users or a specific user.
| 0.5 |
8,359,323 | 13 | 18 |
13. A bridge component comprising: a hardware processor; a database driver that is compatible with a software application, the database driver receiving a database language request from the software application intended for a system, wherein the database language request is in a database language format, and wherein the database driver processes standard database calls; a database language mapper that receives the database language request from the database driver, parses the database language request, and converts the database language request into an intermediary data format, wherein the intermediary data format comprises a data object identifying an operation and data, wherein the data includes at least one field with an associated value; and a common client interface builder that receives the database language request in the intermediary data format from the database language mapper, reformats the database language request into a format that is compatible with a system resource adapter, invokes the system resource adapter, by utilizing the hardware processor, with the reformatted request, receives the data object that has been modified from the system resource adapter, and maps the received data object to a result set.
|
13. A bridge component comprising: a hardware processor; a database driver that is compatible with a software application, the database driver receiving a database language request from the software application intended for a system, wherein the database language request is in a database language format, and wherein the database driver processes standard database calls; a database language mapper that receives the database language request from the database driver, parses the database language request, and converts the database language request into an intermediary data format, wherein the intermediary data format comprises a data object identifying an operation and data, wherein the data includes at least one field with an associated value; and a common client interface builder that receives the database language request in the intermediary data format from the database language mapper, reformats the database language request into a format that is compatible with a system resource adapter, invokes the system resource adapter, by utilizing the hardware processor, with the reformatted request, receives the data object that has been modified from the system resource adapter, and maps the received data object to a result set. 18. The bridge component of claim 13 , wherein the database driver and the database language mapper communicate directly in a local server mode.
| 0.563636 |
9,710,701 | 11 | 16 |
11. An information handling device, comprising: a processor; an input and display device; a memory device that stores instructions executable by the processor to: accept handwriting ink strokes forming a word to be searched; analyze the handwriting ink strokes to produce a list of candidate words corresponding to the word to be searched; search, using a plurality of words from the list of candidate words, existing computer readable text associated with prior handwriting data; said search comprising identifying prior handwriting data having one or more of the list of candidate words associated therewith; and display at least one result based on the searching.
|
11. An information handling device, comprising: a processor; an input and display device; a memory device that stores instructions executable by the processor to: accept handwriting ink strokes forming a word to be searched; analyze the handwriting ink strokes to produce a list of candidate words corresponding to the word to be searched; search, using a plurality of words from the list of candidate words, existing computer readable text associated with prior handwriting data; said search comprising identifying prior handwriting data having one or more of the list of candidate words associated therewith; and display at least one result based on the searching. 16. The information handling device of claim 11 , wherein the analyzing comprises: determining at least one characteristic of the handwriting ink strokes, wherein the characteristic comprises at least one of: horizontal travel distance, vertical travel distance, input pressure, and input time; and wherein the searching comprises comparing the at least one characteristic of the handwriting ink strokes to at least one characteristic of the existing handwriting data.
| 0.5 |
7,506,040 | 1 | 6 |
1. A system, comprising: one or more processors; and one or more memory mediums coupled to the one or more processors, wherein the one or more memory mediums store program instructions executable to implement: a storage area network (SAN) management server comprising: a SAN access layer configured to discover a plurality of SAN components coupled to a SAN fabric; wherein the SAN management server is configured to monitor the discovered SAN components coupled to the SAN fabric; and a SAN manager client coupled to said SAN management server, wherein the SAN manager client is configured to provide a centralized user interface for centralized management of the SAN through interaction with the SAN management server, wherein the SAN management server is configured to perform one or more SAN management tasks in response to interactions of said centralized user interface, and wherein said centralized management of the SAN provides management of the discovered plurality of SAN components.
|
1. A system, comprising: one or more processors; and one or more memory mediums coupled to the one or more processors, wherein the one or more memory mediums store program instructions executable to implement: a storage area network (SAN) management server comprising: a SAN access layer configured to discover a plurality of SAN components coupled to a SAN fabric; wherein the SAN management server is configured to monitor the discovered SAN components coupled to the SAN fabric; and a SAN manager client coupled to said SAN management server, wherein the SAN manager client is configured to provide a centralized user interface for centralized management of the SAN through interaction with the SAN management server, wherein the SAN management server is configured to perform one or more SAN management tasks in response to interactions of said centralized user interface, and wherein said centralized management of the SAN provides management of the discovered plurality of SAN components. 6. The system as recited in claim 1 , wherein the SAN manager client is configured to provide a LUN query tool for finding and selecting Logical Unit Numbers (LUNs) on SAN storage devices.
| 0.840678 |
7,778,982 | 1 | 8 |
1. A system for processing a document, the system comprising: a data storage unit configured to store data corresponding to at least one of the document, a plurality of documents processed at a previous time, and a set of rules wherein at least one rule in the set of rules is configured to include a rule identifier, the set of rules is further configured to include one or more of a rule for parsing, a rule for validating, a rule for identifying, a rule for relating, a rule for selecting, a rule for extracting, a rule for transforming, a rule for generating, a rule for analyzing, a rule for error correcting, the rule for error correcting in the set of rules being configured (i) to identify an error in one of a data component and a relationship between two or more data components and (ii) to correct the error, and a rule for reporting, the rule for transforming being configured to include an identification associated with the document, an identification associated with a transformed document, and a logic being configured to determine a number of transformed documents present in a set of transformed documents, and one or more attributes of each transformed document in the set of transformed documents, a directive to proceed to a second rule based on a condition, a specification of a data component, the specification configured to include a data component identifier, a data component attribute, and a directive to proceed to a second specification of a second data component based on a second condition; a rules-based engine configured to communicate with the data storage unit and to execute a rule in the set of rules; a processing engine configured to include a parsing component, a validating component, a relating component, and an extracting component, the processing engine further configured to communicate with the data storage unit to process the document in a non sequential manner and to select and execute the at least one rule using the rules-based engine; an error correction component configured to communicate with at least one of the rules-based engine and the processing engine; and a data communication component configured to communicate with at least one of the data storage unit, the rules-based engine, the processing engine, the analysis engine, the reporting engine, and the error correction component, wherein the system is configured to process the document using the data storage unit, the rules based engine, the processing engine, and the error correction component to transform the document into a set of second documents and generate a third document, and wherein the system is configured to use the data communication component to deliver the second documents in the set of second documents to their respective destinations.
|
1. A system for processing a document, the system comprising: a data storage unit configured to store data corresponding to at least one of the document, a plurality of documents processed at a previous time, and a set of rules wherein at least one rule in the set of rules is configured to include a rule identifier, the set of rules is further configured to include one or more of a rule for parsing, a rule for validating, a rule for identifying, a rule for relating, a rule for selecting, a rule for extracting, a rule for transforming, a rule for generating, a rule for analyzing, a rule for error correcting, the rule for error correcting in the set of rules being configured (i) to identify an error in one of a data component and a relationship between two or more data components and (ii) to correct the error, and a rule for reporting, the rule for transforming being configured to include an identification associated with the document, an identification associated with a transformed document, and a logic being configured to determine a number of transformed documents present in a set of transformed documents, and one or more attributes of each transformed document in the set of transformed documents, a directive to proceed to a second rule based on a condition, a specification of a data component, the specification configured to include a data component identifier, a data component attribute, and a directive to proceed to a second specification of a second data component based on a second condition; a rules-based engine configured to communicate with the data storage unit and to execute a rule in the set of rules; a processing engine configured to include a parsing component, a validating component, a relating component, and an extracting component, the processing engine further configured to communicate with the data storage unit to process the document in a non sequential manner and to select and execute the at least one rule using the rules-based engine; an error correction component configured to communicate with at least one of the rules-based engine and the processing engine; and a data communication component configured to communicate with at least one of the data storage unit, the rules-based engine, the processing engine, the analysis engine, the reporting engine, and the error correction component, wherein the system is configured to process the document using the data storage unit, the rules based engine, the processing engine, and the error correction component to transform the document into a set of second documents and generate a third document, and wherein the system is configured to use the data communication component to deliver the second documents in the set of second documents to their respective destinations. 8. The system of claim 1 , wherein the rule for extracting in the set of rules 15 configured to extract data components from the set of transformed documents and to create a report from the extracted data components.
| 0.719481 |
8,260,583 | 10 | 15 |
10. A CAD system comprising a processor and accessible memory, the CAD system particularly configured to perform the steps of: loading an object model; receiving a selection of a first face of the object model; finding candidate wall faces and storing the candidate wall faces in a candidate list; designating at least one candidate wall face in the candidate list as a counterpart face to the first face based on at least one of geometric conditions, spatial proximity, or topological proximity; and storing the first face and the counterpart faces as a wall of the object model.
|
10. A CAD system comprising a processor and accessible memory, the CAD system particularly configured to perform the steps of: loading an object model; receiving a selection of a first face of the object model; finding candidate wall faces and storing the candidate wall faces in a candidate list; designating at least one candidate wall face in the candidate list as a counterpart face to the first face based on at least one of geometric conditions, spatial proximity, or topological proximity; and storing the first face and the counterpart faces as a wall of the object model. 15. The CAD system of claim 10 , the CAD system further configured to perform the step of removing at least one second face from the candidate list based on an exclusion rule.
| 0.5 |
8,942,981 | 5 | 6 |
5. The call router of claim 2 , wherein the processor is configured to perform additional functions, including functions to detect the classes based on class definitions including words defined for each class.
|
5. The call router of claim 2 , wherein the processor is configured to perform additional functions, including functions to detect the classes based on class definitions including words defined for each class. 6. The call router of claim 5 , wherein the processor is configured to perform additional functions, including functions to recognize the words using a class-based statistical language model (SLM) trained based on the class definitions.
| 0.5 |
7,966,626 | 14 | 15 |
14. The non-transitory computer readable storage medium of claim 13 , wherein: the application code comprises a web application that includes at least one functionality, and the web page comprises a file of hypertext markup language (HTML) code and at least one embedded code block written in a scripting language.
|
14. The non-transitory computer readable storage medium of claim 13 , wherein: the application code comprises a web application that includes at least one functionality, and the web page comprises a file of hypertext markup language (HTML) code and at least one embedded code block written in a scripting language. 15. The non-transitory computer readable storage medium of claim 14 , wherein the scripting language comprises any of JAVASCRIPT and VBSCRIPT.
| 0.668224 |
8,045,054 | 7 | 8 |
7. A method comprising: receiving a video signal for a video program with closed captioning from a video source; extracting original closed captioning text from the video signal; translating the original closed captioning text of a first language to translated closed captioning text of a second language; encoding the translated closed captioning text as closed captioning into the video signal to create a modified video signal; and sending the modified video signal toward the customer equipment.
|
7. A method comprising: receiving a video signal for a video program with closed captioning from a video source; extracting original closed captioning text from the video signal; translating the original closed captioning text of a first language to translated closed captioning text of a second language; encoding the translated closed captioning text as closed captioning into the video signal to create a modified video signal; and sending the modified video signal toward the customer equipment. 8. The method of claim 7 wherein the customer equipment receives the modified video signal, extracts the translated closed captioning text, and displays the translated closed captioning text during presentation of the video program.
| 0.5 |
9,489,940 | 17 | 19 |
17. An apparatus for dynamically updating a plurality of user profiles for similarly situated users comprising: an administrator workstation coupled to a network and configured to receive at least one modification to at least a first user profile associated with a group of user profiles; the administrator workstation comprising a processor configured to evaluate the efficiency of the at least one modification; the administrator workstation configured to determine that the at least one modification is applicable to at least one second user profile that has at least one common attribute as the first user profile based at least in part on the evaluated efficiency; and the administrator workstation configured to modify the at least one second user profile with the at least one modification from the first user profile, wherein a language model of the second user profile is dynamically trained and updated by the at least one modification, wherein the updated language model is utilized, by a speech recognition engine, to transcribe speech into text, and wherein the transcribed text is displayed on a user device.
|
17. An apparatus for dynamically updating a plurality of user profiles for similarly situated users comprising: an administrator workstation coupled to a network and configured to receive at least one modification to at least a first user profile associated with a group of user profiles; the administrator workstation comprising a processor configured to evaluate the efficiency of the at least one modification; the administrator workstation configured to determine that the at least one modification is applicable to at least one second user profile that has at least one common attribute as the first user profile based at least in part on the evaluated efficiency; and the administrator workstation configured to modify the at least one second user profile with the at least one modification from the first user profile, wherein a language model of the second user profile is dynamically trained and updated by the at least one modification, wherein the updated language model is utilized, by a speech recognition engine, to transcribe speech into text, and wherein the transcribed text is displayed on a user device. 19. The apparatus according to claim 17 wherein the administrator workstation dynamically updates the at least one second user profile without action by a user of the second user profile.
| 0.677586 |
7,577,935 | 6 | 7 |
6. A method of generative programming utilizing focused grammars said method comprising: receiving a stochastic grammar defining variable parameters; generating candidate programs using said grammar; evaluating said candidate programs in accordance with predetermined criteria; responsive to said evaluating, designating a particular candidate program; modifying, using said particular candidate program, a structure and a production probability of said grammar to focus results during subsequent iterations of said generating, wherein said modifying is based upon a decomposition of terminal and non-terminal nodes of said particular candidate program, wherein said modifying comprises adding a production and altering a production probability; and selectively repeating said generating, said evaluating, and said modifying.
|
6. A method of generative programming utilizing focused grammars said method comprising: receiving a stochastic grammar defining variable parameters; generating candidate programs using said grammar; evaluating said candidate programs in accordance with predetermined criteria; responsive to said evaluating, designating a particular candidate program; modifying, using said particular candidate program, a structure and a production probability of said grammar to focus results during subsequent iterations of said generating, wherein said modifying is based upon a decomposition of terminal and non-terminal nodes of said particular candidate program, wherein said modifying comprises adding a production and altering a production probability; and selectively repeating said generating, said evaluating, and said modifying. 7. The method of claim 6 further comprising continuing said selectively repeating until an optimal candidate program is identified in accordance with said evaluating.
| 0.5 |
8,971,587 | 1 | 14 |
1. A method, comprising: capturing one or more of image data depicting a digital representation of a document and audio data relating to the digital representation of the document; defining a plurality of candidate edge points within the image data; removing one or more outlier candidate edge points from the plurality of candidate edge points; defining a second plurality of candidate edge points excluding the one or more outlier candidate edge points; and defining four sides of a tetragon based on one or more of the plurality of candidate edge points and the second plurality of candidate edge points, wherein each side of the tetragon corresponds to a different side of the document, and wherein the tetragon bounds the digital representation of the document.
|
1. A method, comprising: capturing one or more of image data depicting a digital representation of a document and audio data relating to the digital representation of the document; defining a plurality of candidate edge points within the image data; removing one or more outlier candidate edge points from the plurality of candidate edge points; defining a second plurality of candidate edge points excluding the one or more outlier candidate edge points; and defining four sides of a tetragon based on one or more of the plurality of candidate edge points and the second plurality of candidate edge points, wherein each side of the tetragon corresponds to a different side of the document, and wherein the tetragon bounds the digital representation of the document. 14. The method as recited in claim 1 , wherein an area of the tetragon comprises at least a threshold percentage of a total area of the digital image.
| 0.890029 |
7,707,497 | 9 | 11 |
9. A system, comprising: an interface configured to obtain (1) a first font name which includes a prefix portion and a remainder portion and (2) a second font name that includes a remainder portion but does not include a prefix portion; a processor configured to sort the first font name and the second font name into a sorted order based at least in part on the remainder portion of the first font name and the remainder portion of the second font name without considering the prefix portion of the first font name; and a display configured to display the first font name and the second font name in the sorted order, wherein the prefix portion of the first font name is displayed using a first display property and the remainder portion of the first font name and the remainder portion of the second font name are displayed using a second display property.
|
9. A system, comprising: an interface configured to obtain (1) a first font name which includes a prefix portion and a remainder portion and (2) a second font name that includes a remainder portion but does not include a prefix portion; a processor configured to sort the first font name and the second font name into a sorted order based at least in part on the remainder portion of the first font name and the remainder portion of the second font name without considering the prefix portion of the first font name; and a display configured to display the first font name and the second font name in the sorted order, wherein the prefix portion of the first font name is displayed using a first display property and the remainder portion of the first font name and the remainder portion of the second font name are displayed using a second display property. 11. A system as recited in claim 9 , wherein: the first display property is associated with a first font color and the second display property is associated with a second font color; and the display is configured to display by: displaying the prefix portion of the first font name in the first font color; and displaying the remainder portion of the first font name and the remainder portion of the second font name in the second font color.
| 0.5 |
8,212,821 | 1 | 6 |
1. A computer-implemented method for rendering an animation presentation on a computing device in communication with a server, the method comprising: receiving, at the server, a request to view the animation presentation on the computing device; obtaining, at the server, information identifying a browser application running on the computing device; determining, at the server, requirements of a presentation technology supported by the identified browser application; decomposing, by the server, the animation presentation into animation primitives compatible with the presentation technology supported by the browser application; and generating, storing in memory, and transmitting to the computing device a data stream containing the animation primitives, wherein the transmitting step includes delegating the animation primitives to different portions of the data stream dependent on parameters of the identified browser application.
|
1. A computer-implemented method for rendering an animation presentation on a computing device in communication with a server, the method comprising: receiving, at the server, a request to view the animation presentation on the computing device; obtaining, at the server, information identifying a browser application running on the computing device; determining, at the server, requirements of a presentation technology supported by the identified browser application; decomposing, by the server, the animation presentation into animation primitives compatible with the presentation technology supported by the browser application; and generating, storing in memory, and transmitting to the computing device a data stream containing the animation primitives, wherein the transmitting step includes delegating the animation primitives to different portions of the data stream dependent on parameters of the identified browser application. 6. The method of claim 1 , wherein the decomposing step applies the supported presentation technology features to resolve inconsistencies among a plurality of browser applications.
| 0.5 |
7,996,375 | 1 | 6 |
1. A computer readable medium having stored thereon one or more sequences of instructions for causing one or more microprocessors to perform the steps for delivery of content from a corpus of data, the steps comprising: specifying a rule having a trigger that identifies at least one characteristic corresponding to a plurality of items in a corpus of data; defining a content presentation action to be performed responsively to the trigger; receiving a search query for searching the corpus; generating a result set in response to the search query, the search query result set including one or more items from the corpus; determining a percentage of items in the search query result set that correspond to said at least one characteristic; identifying a threshold percentage, wherein the threshold percentage is a predetermined percentage of the total number of items in the search query result set; comparing the determined percentage of items to the threshold percentage; and presenting content in accordance with the content specification action when the determined percentage of items exceeds the threshold percentage.
|
1. A computer readable medium having stored thereon one or more sequences of instructions for causing one or more microprocessors to perform the steps for delivery of content from a corpus of data, the steps comprising: specifying a rule having a trigger that identifies at least one characteristic corresponding to a plurality of items in a corpus of data; defining a content presentation action to be performed responsively to the trigger; receiving a search query for searching the corpus; generating a result set in response to the search query, the search query result set including one or more items from the corpus; determining a percentage of items in the search query result set that correspond to said at least one characteristic; identifying a threshold percentage, wherein the threshold percentage is a predetermined percentage of the total number of items in the search query result set; comparing the determined percentage of items to the threshold percentage; and presenting content in accordance with the content specification action when the determined percentage of items exceeds the threshold percentage. 6. The medium according to claim 1 , wherein the threshold percentage is at least 40%.
| 0.868098 |
9,773,336 | 13 | 16 |
13. A non-transitory computer-readable storage media having program instructions stored thereon that are executable by a computer system to cause the computer system to perform operations including: displaying a document including an animation that is renderable from an initial point of the animation to an end point of the animation by executing programmatic elements of the document to manipulate a structure of the document; identifying a natural state of the document that corresponds to the initial point of the animation and represents a version of the document that a search engine configured to analyze only static structural elements of a document encounters during a search; rendering the animation starting from the initial point by executing programmatic elements of the document; receiving a selection of a point of the animation that occurs in between the initial point of the animation and the end point of the animation; responsive to receiving the selection, designating the selected point of the animation as a new base state and modifying the version of the document that the search engine encounters during a search to correspond to the new base state; and maintaining the natural state of the document and the new base state so that any subsequent rendering of the animation starts from the natural state and the version of the document that the search engine encounters during a search corresponds to the selected point of the animation that occurs in between the initial point of the animation and the end point of the animation.
|
13. A non-transitory computer-readable storage media having program instructions stored thereon that are executable by a computer system to cause the computer system to perform operations including: displaying a document including an animation that is renderable from an initial point of the animation to an end point of the animation by executing programmatic elements of the document to manipulate a structure of the document; identifying a natural state of the document that corresponds to the initial point of the animation and represents a version of the document that a search engine configured to analyze only static structural elements of a document encounters during a search; rendering the animation starting from the initial point by executing programmatic elements of the document; receiving a selection of a point of the animation that occurs in between the initial point of the animation and the end point of the animation; responsive to receiving the selection, designating the selected point of the animation as a new base state and modifying the version of the document that the search engine encounters during a search to correspond to the new base state; and maintaining the natural state of the document and the new base state so that any subsequent rendering of the animation starts from the natural state and the version of the document that the search engine encounters during a search corresponds to the selected point of the animation that occurs in between the initial point of the animation and the end point of the animation. 16. The non-transitory computer-readable storage media of claim 13 , wherein the new base state corresponds to a point in time during the animation when an animation effect is complete.
| 0.765228 |
10,089,387 | 12 | 15 |
12. The system of claim 11 , wherein the at least one computing device is configured to: select one of the plurality of organic search keywords by, for each of the plurality of organic search keywords: comparing the assist-to-last ratio for the organic search keyword to a particular threshold assist-to-last ratio; and determining whether to select the organic search keyword based on the comparison; and generate the recommendation, the recommendation comprising an indication to add the selected organic search keyword to the content provider's paid keywords.
|
12. The system of claim 11 , wherein the at least one computing device is configured to: select one of the plurality of organic search keywords by, for each of the plurality of organic search keywords: comparing the assist-to-last ratio for the organic search keyword to a particular threshold assist-to-last ratio; and determining whether to select the organic search keyword based on the comparison; and generate the recommendation, the recommendation comprising an indication to add the selected organic search keyword to the content provider's paid keywords. 15. The system of claim 12 , wherein the at least one computing device is configured to analyze the plurality of organic search keywords within the conversion path data to generate an analysis metric other than the assist-to-last ratio, and selecting one of the plurality of organic search keywords based on both the analysis metric and the assist-to-last ratio.
| 0.5 |
8,667,412 | 22 | 23 |
22. A method performed by one or more processes executing on a computer system, the method comprising: presenting a plurality of data entry fields based on a received file, the received file being based on a markup language, the data entry fields being associated with respective data type identifiers included in the received file, the data type identifiers including respective tags that are based on the markup language and identifying a type of data associated with its corresponding data entry field; receiving user input selecting a data entry field from among the presented plurality of data entry fields; determining a configuration mapping corresponding to the type of data identified by the selected data entry field's data type identifier; reconfiguring a dynamically configurable input device in accordance with the determined configuration mapping, wherein the dynamically configurable input device includes one or more configurable controls, and wherein the key mapping specifies a character corresponding to at least one of the one or more configurable controls; presenting the reconfigured dynamically configurable input device to a user; and receiving input in the selected data entry field from the user via the reconfigured dynamically configurable input device.
|
22. A method performed by one or more processes executing on a computer system, the method comprising: presenting a plurality of data entry fields based on a received file, the received file being based on a markup language, the data entry fields being associated with respective data type identifiers included in the received file, the data type identifiers including respective tags that are based on the markup language and identifying a type of data associated with its corresponding data entry field; receiving user input selecting a data entry field from among the presented plurality of data entry fields; determining a configuration mapping corresponding to the type of data identified by the selected data entry field's data type identifier; reconfiguring a dynamically configurable input device in accordance with the determined configuration mapping, wherein the dynamically configurable input device includes one or more configurable controls, and wherein the key mapping specifies a character corresponding to at least one of the one or more configurable controls; presenting the reconfigured dynamically configurable input device to a user; and receiving input in the selected data entry field from the user via the reconfigured dynamically configurable input device. 23. The method of claim 22 in which the dynamically configurable input device comprises a virtual keyboard.
| 0.809609 |
7,889,794 | 9 | 14 |
9. A method of analyzing a digital video clip to determine key frames, comprising: a. performing a global motion estimate on the video clip that indicates translation of a scene or camera, or scaling of the scene; b. forming a plurality of video segments based on the global motion estimate and labeling each segment in accordance with a predetermined series of classes; c. extracting key frame candidates from the labeled segments and computing a confidence score for each candidate by using rules associated with each label; d. wherein, the rules for labels corresponding to camera motion include extracting a candidate frame for a pan segment with a confidence score related to a translation amount during the pan, and not extracting candidate frames for object motion based frames for fast pan and zoom segments, and the rule for labels corresponding to object motion includes extracting a candidate frame for a fixed segment with a confidence score related to the segment length; and e. selecting key frames from the candidate frames based on the confidence score of each candidate.
|
9. A method of analyzing a digital video clip to determine key frames, comprising: a. performing a global motion estimate on the video clip that indicates translation of a scene or camera, or scaling of the scene; b. forming a plurality of video segments based on the global motion estimate and labeling each segment in accordance with a predetermined series of classes; c. extracting key frame candidates from the labeled segments and computing a confidence score for each candidate by using rules associated with each label; d. wherein, the rules for labels corresponding to camera motion include extracting a candidate frame for a pan segment with a confidence score related to a translation amount during the pan, and not extracting candidate frames for object motion based frames for fast pan and zoom segments, and the rule for labels corresponding to object motion includes extracting a candidate frame for a fixed segment with a confidence score related to the segment length; and e. selecting key frames from the candidate frames based on the confidence score of each candidate. 14. The method of claim 9 wherein the predetermined series of classes include pan (left or right, and tilt up or down), zoom (in or out), fast pan or fixed.
| 0.5 |
8,972,379 | 14 | 15 |
14. The method of claim 9 , further comprising determining a social media sentiment score for the website based on collected comments that include the keywords.
|
14. The method of claim 9 , further comprising determining a social media sentiment score for the website based on collected comments that include the keywords. 15. The method of claim 14 , wherein determining the social media sentiment score comprises: assigning a first value to positive comments, a second value neutral comments and a third value to negative comments; summing all instances of the assigned first, second and third values; and dividing by a total number of all the positive, neutral and negative comments.
| 0.5 |
7,779,015 | 29 | 32 |
29. A computer-readable storage medium whose contents cause a computing device to specify context data items for logging, by performing a method comprising: displaying a set of available data items; caching values for the available data items obtained from respective data sources; receiving user input identifying a subset of the available data items to be logged; receiving user input defining a logging frequency for each data item in the subset of available data items; receiving user input defining a maximum age value for each data item in the subset of available data items; periodically logging a cached value for each data item in accordance with the respectively defined logging frequencies, wherein logging the cached value comprises: determining an age of the cached value for the data item to be logged; determining whether the age of the cached value exceeds the maximum value age defined for the data item; logging the cached value for the data item when it is determined that the age of the cached value does not exceed the maximum value age defined for the data item; and obtaining a new value for the data item from a data source when it is determined that the age of the cached value exceeds the maximum value age defined for the data item; and determining whether to retain or discard a logged value of a distinguished one of the data items in the subset of available data items based on a determined importance level reflecting the importance of retaining the logged value of the distinguished one of the data items in the subset of available data items, wherein the determined importance level is specified by user input.
|
29. A computer-readable storage medium whose contents cause a computing device to specify context data items for logging, by performing a method comprising: displaying a set of available data items; caching values for the available data items obtained from respective data sources; receiving user input identifying a subset of the available data items to be logged; receiving user input defining a logging frequency for each data item in the subset of available data items; receiving user input defining a maximum age value for each data item in the subset of available data items; periodically logging a cached value for each data item in accordance with the respectively defined logging frequencies, wherein logging the cached value comprises: determining an age of the cached value for the data item to be logged; determining whether the age of the cached value exceeds the maximum value age defined for the data item; logging the cached value for the data item when it is determined that the age of the cached value does not exceed the maximum value age defined for the data item; and obtaining a new value for the data item from a data source when it is determined that the age of the cached value exceeds the maximum value age defined for the data item; and determining whether to retain or discard a logged value of a distinguished one of the data items in the subset of available data items based on a determined importance level reflecting the importance of retaining the logged value of the distinguished one of the data items in the subset of available data items, wherein the determined importance level is specified by user input. 32. The method of claim 29 wherein the computing device in which the method is performed is a body-supported general-purpose computer system.
| 0.5 |
5,559,940 | 1 | 2 |
1. A system for at least enhancing selected information contained in a data containing media, comprising: input means for inputting to the system data representing a textual document having a number of human-readable words; first processing means that receives the data input from the input means, the first processing means for converting the input data from a first form to a second form; second processing means for receiving an output of the first processing means, the second processing means for compressing the converted input data into compressed data structures, with the compressed data structures having information regarding a location and relative importance of elements of the input data according to a predetermined translation means, and with at least a subset of the compressed data structures being enhanced with respect to a remainder of the compressed data structures by modifying at least the subset of the compressed data structures; third processing means for receiving an output of the second processing means, the third processing means for expanding the compressed data structures, with the subset of the compressed data structures enhanced, to a full form of data structures, the full form of data structures being representative of the converted input data with enhanced data structures being distinguishable from a remainder of data structures; and readable form means for receiving an output of the third processing means, the readable form means for providing in readable form the full form of data structures representative of the converted input data, with the enhanced data structures being represented differently than the remainder of data structures by the readable form means.
|
1. A system for at least enhancing selected information contained in a data containing media, comprising: input means for inputting to the system data representing a textual document having a number of human-readable words; first processing means that receives the data input from the input means, the first processing means for converting the input data from a first form to a second form; second processing means for receiving an output of the first processing means, the second processing means for compressing the converted input data into compressed data structures, with the compressed data structures having information regarding a location and relative importance of elements of the input data according to a predetermined translation means, and with at least a subset of the compressed data structures being enhanced with respect to a remainder of the compressed data structures by modifying at least the subset of the compressed data structures; third processing means for receiving an output of the second processing means, the third processing means for expanding the compressed data structures, with the subset of the compressed data structures enhanced, to a full form of data structures, the full form of data structures being representative of the converted input data with enhanced data structures being distinguishable from a remainder of data structures; and readable form means for receiving an output of the third processing means, the readable form means for providing in readable form the full form of data structures representative of the converted input data, with the enhanced data structures being represented differently than the remainder of data structures by the readable form means. 2. The system as recited in claim 1, wherein the first processing means includes means for converting the input data into at least a two-dimensional matrix.
| 0.788618 |
8,107,605 | 1 | 23 |
1. An apparatus to aid the memory of persons experiencing memory loss, the apparatus comprising a simplified computer device having a first housing, a display screen carried by the first housing, an audio player carried by the first housing, and control circuitry carried by the first housing, the control circuitry being operable to control images displayed on the display screen and to control audio messages played by the audio player, the control circuitry being configured to establish a communication link with at least one other predetermined communication site on a network during operation of the apparatus, the control circuitry being operable to initiate retrieval of remote image files, remote text files, and remote audio files from the predetermined communication site, the simplified computer device further having a telephone handset coupled to the control circuitry, the telephone handset being movable relative to the first housing and operable to place and receive telephone calls, and a local input module coupleable to the control circuitry of the simplified computer device, the local input module having a second housing, a scanner carried by the second housing and operable to scan images of photos fed through the scanner to create local image files, a microphone carried by the second housing and operable to receive verbal statements to create local audio files to be associated with the local image files, and a keyboard carried by the second housing and usable to type text messages to be associated with the local image files.
|
1. An apparatus to aid the memory of persons experiencing memory loss, the apparatus comprising a simplified computer device having a first housing, a display screen carried by the first housing, an audio player carried by the first housing, and control circuitry carried by the first housing, the control circuitry being operable to control images displayed on the display screen and to control audio messages played by the audio player, the control circuitry being configured to establish a communication link with at least one other predetermined communication site on a network during operation of the apparatus, the control circuitry being operable to initiate retrieval of remote image files, remote text files, and remote audio files from the predetermined communication site, the simplified computer device further having a telephone handset coupled to the control circuitry, the telephone handset being movable relative to the first housing and operable to place and receive telephone calls, and a local input module coupleable to the control circuitry of the simplified computer device, the local input module having a second housing, a scanner carried by the second housing and operable to scan images of photos fed through the scanner to create local image files, a microphone carried by the second housing and operable to receive verbal statements to create local audio files to be associated with the local image files, and a keyboard carried by the second housing and usable to type text messages to be associated with the local image files. 23. The apparatus of claim 1 , wherein the telephone handset is coupled to the control circuitry of the simplified computer device via a wireless communication link.
| 0.852415 |
6,141,641 | 1 | 10 |
1. A method of recognizing speech based on an input data stream, the method comprising: providing a recognition system including an acoustic model having a model size; adjusting the model size to a desired size based on characteristics of a computer system on which the recognition system is run based only on criteria other than a training data corpus used to train the acoustic model; receiving the input data stream; and performing speech recognition based on the acoustic model having the desired size.
|
1. A method of recognizing speech based on an input data stream, the method comprising: providing a recognition system including an acoustic model having a model size; adjusting the model size to a desired size based on characteristics of a computer system on which the recognition system is run based only on criteria other than a training data corpus used to train the acoustic model; receiving the input data stream; and performing speech recognition based on the acoustic model having the desired size. 10. The method of claim 1 wherein adjusting the model size comprises: adjusting the model size based on preselected computational resources on the computer system.
| 0.836345 |
9,514,503 | 9 | 10 |
9. The apparatus as defined in claim 8 , wherein the server is provided the keyword prior to a broadcast of the first media composition.
|
9. The apparatus as defined in claim 8 , wherein the server is provided the keyword prior to a broadcast of the first media composition. 10. The apparatus as defined in claim 9 , wherein the keyword is selected based on a target audience of the second media composition.
| 0.5 |
4,724,285 | 1 | 15 |
1. A steno translator system for translating lexical stroke symbols into language format in accordance with a predefined stenographic methodology, each lexical stroke symbol defined by at least one character from a character set comprising consonants and vowels, the system comprising: stroke symbol means for providing a sequence of lexical stroke symbols, each lexical stroke symbol defined by at least one of a left consonant part comprising at least one consonant character, a vowel part comprising at least one vowel character, and a right consonant part comprising at least one consonant character; processor means coupled for receiving the lexical stroke symbols from the stroke symbol means, comprising: a scan chart memory for storing a selected list of chart entries, the list comprising a left consonant sublist, a vowel sublist and a vowel/right consonant sublist, each chart entry having stored in association therewith a language part defining a translation of the chart entry; and translator means comprising comparing means for comparing the left consonant part of selected lexical stroke symbols having a left consonant part against the left consonant sublist to find a match, the language part associated with the matched member of the left consonant sublist defining a a left consonant translation, comparing the vowel part of selected lexical stroke symbols having a vowel part but no right consonant part against the vowel sublist to find a match, the language part associated with the matched member of the vowel sublist defining a vowel translation, and comparing the combined vowel part and right consonant part of selected lexical stroke symbols having a right consonant part against the vowel/right consonant list to find a match, the language part associated with the matched member of the vowel/right consonant sublist defining a vowel/right consonant translation; and means for combining the left consonant, vowel and vowel/right consonant translations to define a stroke symbol translation from the scan chart memory; and means for combining the stroke symbol translations of the lexical stroke symbols according to a predefined identifier rule set to define complete words in the language format.
|
1. A steno translator system for translating lexical stroke symbols into language format in accordance with a predefined stenographic methodology, each lexical stroke symbol defined by at least one character from a character set comprising consonants and vowels, the system comprising: stroke symbol means for providing a sequence of lexical stroke symbols, each lexical stroke symbol defined by at least one of a left consonant part comprising at least one consonant character, a vowel part comprising at least one vowel character, and a right consonant part comprising at least one consonant character; processor means coupled for receiving the lexical stroke symbols from the stroke symbol means, comprising: a scan chart memory for storing a selected list of chart entries, the list comprising a left consonant sublist, a vowel sublist and a vowel/right consonant sublist, each chart entry having stored in association therewith a language part defining a translation of the chart entry; and translator means comprising comparing means for comparing the left consonant part of selected lexical stroke symbols having a left consonant part against the left consonant sublist to find a match, the language part associated with the matched member of the left consonant sublist defining a a left consonant translation, comparing the vowel part of selected lexical stroke symbols having a vowel part but no right consonant part against the vowel sublist to find a match, the language part associated with the matched member of the vowel sublist defining a vowel translation, and comparing the combined vowel part and right consonant part of selected lexical stroke symbols having a right consonant part against the vowel/right consonant list to find a match, the language part associated with the matched member of the vowel/right consonant sublist defining a vowel/right consonant translation; and means for combining the left consonant, vowel and vowel/right consonant translations to define a stroke symbol translation from the scan chart memory; and means for combining the stroke symbol translations of the lexical stroke symbols according to a predefined identifier rule set to define complete words in the language format. 15. The steno translator system of claim 1 wherein the character set further comprises a flag symbol and wherein the vowel sublist includes a sublist of short vowels and wherein the means for combining the stroke symbol translation comprises: means for associating a first flag with the stroke symbol translation of each lexical stroke symbol which includes a flag symbol character, means for associating a second flag with the stroke symbol translation of each lexical stroke symbol having a left consonant part; means for associating a third flag with the stroke symbol translation of each lexical stroke symbol having a vowel part which is a short vowel; means for associating a fourth flag with the stroke symbol translation of each lexical stroke symbol having both a vowel part and a right consonant part; and means for defining the stroke symbol translation as a suffix, prefix or word root in response to the associated settings of the first flag, second flag, third flag and fourth flag.
| 0.5 |
9,934,778 | 15 | 16 |
15. An apparatus, comprising: a memory; and a processor coupled to the memory and configured: to receive input speech to be decoded; to convert a non-back-off language model that assigns a probability to each fixed order n-gram generated with a given vocabulary to a back-off language model that assigns a probability to one or more fixed order n-grams assigned a zero probability by the non-back-off language model by backing off to a given lower order n-gram corresponding to the given fixed order n-gram; and to prune the converted back-off language model; and to utilize the converted back-off language model in a speech decoding process to generate a decoded speech output from the input speech; wherein converting the non-back-off language model comprises, starting with an initial non-back-off language model associated with a lowest order n-gram and hierarchically progressing with one or more higher order non-back-off language models until the fixed order n-gram is reached, converting the initial non-back-off language model and the one or more higher order non-back-off language models into respective back-off language models; wherein the given fixed order n-gram comprises a given word and an associated history; wherein the given lower order n-gram corresponding to the given fixed order n-gram comprises the given word and a truncated version of the associated history.
|
15. An apparatus, comprising: a memory; and a processor coupled to the memory and configured: to receive input speech to be decoded; to convert a non-back-off language model that assigns a probability to each fixed order n-gram generated with a given vocabulary to a back-off language model that assigns a probability to one or more fixed order n-grams assigned a zero probability by the non-back-off language model by backing off to a given lower order n-gram corresponding to the given fixed order n-gram; and to prune the converted back-off language model; and to utilize the converted back-off language model in a speech decoding process to generate a decoded speech output from the input speech; wherein converting the non-back-off language model comprises, starting with an initial non-back-off language model associated with a lowest order n-gram and hierarchically progressing with one or more higher order non-back-off language models until the fixed order n-gram is reached, converting the initial non-back-off language model and the one or more higher order non-back-off language models into respective back-off language models; wherein the given fixed order n-gram comprises a given word and an associated history; wherein the given lower order n-gram corresponding to the given fixed order n-gram comprises the given word and a truncated version of the associated history. 16. The apparatus of claim 15 , wherein converting the non-back-off language model to the back-off language model utilizes a background language model.
| 0.5 |
8,554,542 | 6 | 7 |
6. The method of claim 1 , wherein the outputting of the input document includes outputting the input document to a display.
|
6. The method of claim 1 , wherein the outputting of the input document includes outputting the input document to a display. 7. The method of claim 6 , wherein when a user actuates a link in the displayed abstract, a portion of the text of the main body comprising the corresponding linked sentence is displayed.
| 0.5 |
8,468,166 | 1 | 4 |
1. A method for processing queries comprising: executing a query to generate a relation defined by a model clause specified in said query, said model clause specifying: one or more dimension columns of said relation, and a rule, wherein said rule comprises: a left-side expression, wherein said left-side expression includes one or more existential predicates, wherein each of said one or more existential predicates evaluates to a Boolean value and refers to at least one of said one or more dimension columns of said relation; and a right-side expression; wherein executing said query comprises evaluating said rule, wherein evaluating said rule includes performing an UPSERT operation to insert a row into said relation; and wherein the method is performed by one or more computer systems.
|
1. A method for processing queries comprising: executing a query to generate a relation defined by a model clause specified in said query, said model clause specifying: one or more dimension columns of said relation, and a rule, wherein said rule comprises: a left-side expression, wherein said left-side expression includes one or more existential predicates, wherein each of said one or more existential predicates evaluates to a Boolean value and refers to at least one of said one or more dimension columns of said relation; and a right-side expression; wherein executing said query comprises evaluating said rule, wherein evaluating said rule includes performing an UPSERT operation to insert a row into said relation; and wherein the method is performed by one or more computer systems. 4. The method of claim 1 , wherein: said left-side expression further includes one or more qualified predicates, wherein each of said one or more qualified predicates generates a single value; wherein each of said one or more qualified predicates corresponds to one dimension column of said one or more dimension columns; said left-side expression defines a set of rows in said relation, wherein each row of said set of rows includes: each of said one or more dimension columns that corresponds to each of said one or more existential predicates; and each of said one or more dimension columns that corresponds to each of said one or more qualified predicates; and after evaluating said rule, said set of rows includes rows for all combinations of: each of said one or more dimension values for which each of said one or more existential predicates evaluates to a Boolean TRUE value; and each single value generated by each of said one or more qualified predicates.
| 0.5 |
7,840,033 | 1 | 4 |
1. A computer program product residing on a non-transitory computer readable storage medium for causing a computing device to examine multiple images, the computer program product comprising instructions for causing the computing device to: detect common text between a pair of individual images; combine the text from the pair of images into a file or data structure when common text is detected; determine if incomplete text phrases are present in the combined text from the pair of images at edge portions of either of the images, and when incomplete text phrases are present in the combined text from the pair of images, signal a user with an indication of instructions to guide a user to move an image input device that captures the pair of individual images in a direction to capture more of the text, with the instructions to guide based at least in part on the incomplete text phrases that were determined to be present.
|
1. A computer program product residing on a non-transitory computer readable storage medium for causing a computing device to examine multiple images, the computer program product comprising instructions for causing the computing device to: detect common text between a pair of individual images; combine the text from the pair of images into a file or data structure when common text is detected; determine if incomplete text phrases are present in the combined text from the pair of images at edge portions of either of the images, and when incomplete text phrases are present in the combined text from the pair of images, signal a user with an indication of instructions to guide a user to move an image input device that captures the pair of individual images in a direction to capture more of the text, with the instructions to guide based at least in part on the incomplete text phrases that were determined to be present. 4. The computer program product of claim 1 wherein stitching the text from the pair of images comprises: stitching the text together from the two images in accordance with a measure of match between strings in the two images.
| 0.794333 |
8,027,867 | 32 | 33 |
32. The method of claim 18 further comprising the step of creating a membership for the author prior to literary work submission that includes a contract in which the member/submitter agrees to pay a percentage of royalties earned from the literary work when it is published.
|
32. The method of claim 18 further comprising the step of creating a membership for the author prior to literary work submission that includes a contract in which the member/submitter agrees to pay a percentage of royalties earned from the literary work when it is published. 33. The method of claim 32 further comprising the step of collecting a fee for each submission of a literary work for review from the member.
| 0.5 |
8,396,713 | 4 | 6 |
4. An apparatus comprising: at least one processor programmed to perform a method of handling an utterance, the method comprising: carrying out recognition of the utterance with a finite state grammar; carrying out recognition of the utterance with a statistical language model built for a dialog state using data that is collected from user interactions with the dialog state; using a statistical action classifier to find at least one semantic interpretation of the utterance; and comparing a first result of the recognition of the utterance with the finite state grammar and a second result of the recognition of the utterance with the statistical language model to select, for output, a final recognition result, wherein the first result is selected, for output, as the final recognition result if a confidence score of the first result of the recognition of the utterance with the finite state grammar is greater than a confidence score of the second result of the recognition of the utterance with the statistical language model, and wherein the second result is selected, for output, as the final recognition result if the confidence score of the second result of the recognition of the utterance with the statistical language model is greater than the confidence score of the first result of the recognition of the utterance with the finite state grammar.
|
4. An apparatus comprising: at least one processor programmed to perform a method of handling an utterance, the method comprising: carrying out recognition of the utterance with a finite state grammar; carrying out recognition of the utterance with a statistical language model built for a dialog state using data that is collected from user interactions with the dialog state; using a statistical action classifier to find at least one semantic interpretation of the utterance; and comparing a first result of the recognition of the utterance with the finite state grammar and a second result of the recognition of the utterance with the statistical language model to select, for output, a final recognition result, wherein the first result is selected, for output, as the final recognition result if a confidence score of the first result of the recognition of the utterance with the finite state grammar is greater than a confidence score of the second result of the recognition of the utterance with the statistical language model, and wherein the second result is selected, for output, as the final recognition result if the confidence score of the second result of the recognition of the utterance with the statistical language model is greater than the confidence score of the first result of the recognition of the utterance with the finite state grammar. 6. The apparatus of claim 4 , wherein the statistical action classifier is built using data containing sentences and associated semantic interpretations generated using the finite state grammar.
| 0.636704 |
8,019,769 | 9 | 10 |
9. The method according to claim 1 , further comprising: inserting an annotation into the electronic document corresponding to text determined to be a valid citation pattern.
|
9. The method according to claim 1 , further comprising: inserting an annotation into the electronic document corresponding to text determined to be a valid citation pattern. 10. The method according to claim 9 , wherein the annotation is a computer readable indicator or a visual indicator, an informational icon associated with an action menu, or a combination thereof.
| 0.5 |
6,119,078 | 17 | 18 |
17. A computer program product for automatically translating a requested Web page from a first language to a second language, wherein the requested web page is stored within a server remotely located from a client requesting the Web page and wherein the Web page is configured to be displayed in a first language by the requesting client, comprising: a computer usable medium having computer readable program code means embodied in said medium for transmitting a request for the Web page from the client to the server via a communications network, wherein the Web page request comprises a universal resource locator that identifies a path to the Web page on the server, and wherein at least a portion of the universal resource locator is associated with a translating environment; computer readable program code means embodied in said medium for identifying a translating environment associated with the transmitted universal resource locator; computer readable program code means embodied in said medium for selecting the identified translating environment from a plurality of translating environments; and computer readable program code means embodied in said medium for translating the requested Web page from the first language to the second language using the selected translating environment prior to serving the requested Web page to the requesting client.
|
17. A computer program product for automatically translating a requested Web page from a first language to a second language, wherein the requested web page is stored within a server remotely located from a client requesting the Web page and wherein the Web page is configured to be displayed in a first language by the requesting client, comprising: a computer usable medium having computer readable program code means embodied in said medium for transmitting a request for the Web page from the client to the server via a communications network, wherein the Web page request comprises a universal resource locator that identifies a path to the Web page on the server, and wherein at least a portion of the universal resource locator is associated with a translating environment; computer readable program code means embodied in said medium for identifying a translating environment associated with the transmitted universal resource locator; computer readable program code means embodied in said medium for selecting the identified translating environment from a plurality of translating environments; and computer readable program code means embodied in said medium for translating the requested Web page from the first language to the second language using the selected translating environment prior to serving the requested Web page to the requesting client. 18. A computer program product according to claim 17 wherein the at least one portion of the universal resource locator associated with the translating environment comprises at least one character string.
| 0.725067 |
8,315,597 | 6 | 8 |
6. The method of claim 3 wherein step E comprises: E1) determining if the comparison calculated in step D indicates the user of the cell phone to which said text message is directed is likely to be driving or doing something other than sitting, standing, walking or running; E2) if step E1 determines the user is likely to be driving or doing something other than sitting, standing, walking or running, using a computer in said MSC or said MTSO to send an automated text message to the user of said cell phone to which the text message received in step A is directed indicating a text message has been received and inquiring whether the user wants the cellular system to automatically generate and send a reply text message indicating the user cannot reply immediately; E3) determining if the user of said cell phone to which said text message was directed wants the automated reply text message to be generated and sent; E4) if step E3 determines the user wants an automated reply text message to be generated and sent, proceeding to step F and not performing step G, and E5) if step E3 determines the user does not want the automated reply text message to be generated and sent, proceeding to step G and not performing step F.
|
6. The method of claim 3 wherein step E comprises: E1) determining if the comparison calculated in step D indicates the user of the cell phone to which said text message is directed is likely to be driving or doing something other than sitting, standing, walking or running; E2) if step E1 determines the user is likely to be driving or doing something other than sitting, standing, walking or running, using a computer in said MSC or said MTSO to send an automated text message to the user of said cell phone to which the text message received in step A is directed indicating a text message has been received and inquiring whether the user wants the cellular system to automatically generate and send a reply text message indicating the user cannot reply immediately; E3) determining if the user of said cell phone to which said text message was directed wants the automated reply text message to be generated and sent; E4) if step E3 determines the user wants an automated reply text message to be generated and sent, proceeding to step F and not performing step G, and E5) if step E3 determines the user does not want the automated reply text message to be generated and sent, proceeding to step G and not performing step F. 8. The method of claim 6 wherein step E3 comprises making the determination that an automated text message reply is to be generated and sent if the user of said cell phone to which said text message received in step A is directed ignores the automated text message sent by said MSC or MTSO for an interval established in advance as the interval during which some command or text message must be received from said user if said user does not want said automated text message reply to be generated and sent.
| 0.605469 |
8,700,403 | 16 | 17 |
16. The spoken language understanding module arrangement of claim 14 , wherein the conditional maximum entropy model includes a conditional maximum entropy model trained with Gaussian priors during feature selection and during parameter optimization.
|
16. The spoken language understanding module arrangement of claim 14 , wherein the conditional maximum entropy model includes a conditional maximum entropy model trained with Gaussian priors during feature selection and during parameter optimization. 17. The spoken language understanding module arrangement of claim 16 , wherein the feature selection includes a selective gain (SCG) computation method.
| 0.5 |
9,229,973 | 1 | 2 |
1. A method for associating documents and queries, comprising: receiving a first query submitted by a user; retrieving by said first query at least one reference to a document; displaying said at least one reference to a document; tracing at least one action of said user in relation to said at least one reference to a document; storing each of a) said first query as submitted by said user, and b) a relation between said first query and said retrieved at least one reference to a document based on said traced action; using at least in part a second query from any user to identify at least one stored query; and displaying to said any user said at least one reference to a document based on said relation to said at least one identified query; wherein a stored query comprises at least two query terms, and at least one query term comprises an expression containing more than one word.
|
1. A method for associating documents and queries, comprising: receiving a first query submitted by a user; retrieving by said first query at least one reference to a document; displaying said at least one reference to a document; tracing at least one action of said user in relation to said at least one reference to a document; storing each of a) said first query as submitted by said user, and b) a relation between said first query and said retrieved at least one reference to a document based on said traced action; using at least in part a second query from any user to identify at least one stored query; and displaying to said any user said at least one reference to a document based on said relation to said at least one identified query; wherein a stored query comprises at least two query terms, and at least one query term comprises an expression containing more than one word. 2. The method of claim 1 , comprising registering said relation to said user.
| 0.934856 |
8,185,830 | 1 | 3 |
1. A computer-implemented method comprising: receiving an identification of user group configuration settings for a user group comprising a plurality of users, the user group configuration settings identifying a first plurality of content items to be retrieved from a first plurality of remote content provider servers and to be provided in a user group container document; generating the user group container document based on the user group configuration settings, the user group container document comprising a first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; sending the user group container document over a public network to each of a plurality of client devices; receiving from the client devices data identifying personal configuration settings for each of the plurality of users in the user group, each of the personal configuration settings specifying a second plurality of content items to be retrieved from a second plurality of remote content provider servers and to be included in personal container documents; generating a first personal container document based on the user group configuration settings and the personal configuration settings for a first user, the container document comprising: one or more of the first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; and a second plurality of content modules that provide the second plurality of content items from a second plurality of remote content provider servers.
|
1. A computer-implemented method comprising: receiving an identification of user group configuration settings for a user group comprising a plurality of users, the user group configuration settings identifying a first plurality of content items to be retrieved from a first plurality of remote content provider servers and to be provided in a user group container document; generating the user group container document based on the user group configuration settings, the user group container document comprising a first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; sending the user group container document over a public network to each of a plurality of client devices; receiving from the client devices data identifying personal configuration settings for each of the plurality of users in the user group, each of the personal configuration settings specifying a second plurality of content items to be retrieved from a second plurality of remote content provider servers and to be included in personal container documents; generating a first personal container document based on the user group configuration settings and the personal configuration settings for a first user, the container document comprising: one or more of the first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; and a second plurality of content modules that provide the second plurality of content items from a second plurality of remote content provider servers. 3. The method of claim 1 , wherein the user group configuration settings include a freeze setting that prevents the users from selecting personal configuration settings that modify the user group configuration settings.
| 0.845339 |
9,805,118 | 13 | 14 |
13. A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein, the computer-executable program code instructions comprising: program code instructions configured to receive an audio file and a transcripted text report that includes a plurality of ordered words corresponding to the audio file; for each of a plurality of positions within the transcripted text report, program code instructions configured to correlate the respective position within the transcripted text report with a corresponding position within the audio file; and program code instructions configured to augment the transcripted text report to include a plurality of selectable elements by inserting the plurality of selectable elements within the transcripted text report with each selectable element associated with and displayed at a respective position within the transcripted text report, wherein one or more selectable elements are inserted within the transcripted text report so as to be displayed at a position between the ordered words of the transcripted text report, wherein the selectable elements are responsive to user actuation during review of the transcripted text report in order to cause the audio file to move to the corresponding position and to cause the audio file to be played beginning at the corresponding position with the word following the respective position at which the selectable element is displayed within the transcripted text report, wherein, following user actuation of a selectable element and playing of the audio file beginning at the corresponding position, the plurality of selectable elements, including one or more selectable elements that were not subject to user actuation, are changed and each of the plurality of selectable elements that are changed, including the one or more selectable elements that were not subject to user actuation, is then responsive to user actuation in order to cause playing of the audio file to be paused.
|
13. A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein, the computer-executable program code instructions comprising: program code instructions configured to receive an audio file and a transcripted text report that includes a plurality of ordered words corresponding to the audio file; for each of a plurality of positions within the transcripted text report, program code instructions configured to correlate the respective position within the transcripted text report with a corresponding position within the audio file; and program code instructions configured to augment the transcripted text report to include a plurality of selectable elements by inserting the plurality of selectable elements within the transcripted text report with each selectable element associated with and displayed at a respective position within the transcripted text report, wherein one or more selectable elements are inserted within the transcripted text report so as to be displayed at a position between the ordered words of the transcripted text report, wherein the selectable elements are responsive to user actuation during review of the transcripted text report in order to cause the audio file to move to the corresponding position and to cause the audio file to be played beginning at the corresponding position with the word following the respective position at which the selectable element is displayed within the transcripted text report, wherein, following user actuation of a selectable element and playing of the audio file beginning at the corresponding position, the plurality of selectable elements, including one or more selectable elements that were not subject to user actuation, are changed and each of the plurality of selectable elements that are changed, including the one or more selectable elements that were not subject to user actuation, is then responsive to user actuation in order to cause playing of the audio file to be paused. 14. A computer program product according to claim 13 wherein the plurality of selectable elements comprise a plurality of icons, wherein the program code instructions configured to augment the transcripted text report to include a plurality of selectable elements comprise program code instructions configured to insert an icon within the transcripted text report at each of the plurality of positions of the transcripted text report, and wherein the icons are responsive to user actuation in order to cause the audio file to move to the corresponding position.
| 0.5 |
7,512,633 | 1 | 2 |
1. A method for storing communication messages in a relational database, comprising: accepting an object model comprising data elements having respective data type definitions and further comprising associations between the data elements, wherein the data elements, the data type definitions and the associations are derived from a hierarchically-structured HL7 specification and comprise at least one data element whose data type definition corresponds to multiple possible data types; defining a relational database that represents the object model based on the data elements and the associations; receiving a communication message that conforms to the HL7 specification and comprises data items corresponding to one or more of the data elements, including at least one data item having the data type definition that corresponds to the multiple possible data types; processing the received communication message so as to identify an actual data type, selected from among the possible data types, to which the at least one data item belongs; and storing the data items, including the at least one data item, in the relational database so as to preserve the data type definitions of the data items, including the identified actual data type, and the associations between the data items, as defined in the object model, wherein the data elements comprise classes, each having one or more class attributes, wherein defining the relational database comprises creating for each class a respective class table comprising at least one unique identifier in the relational database, and mapping at least one of the class attributes to columns of the class table, and wherein the object model comprises at least one of an association of cardinality 1:n representing a relationship between a parent class and a child class, an association of cardinality n:m representing a relationship between one or more parent classes and one or more child classes, a recursive association representing a relationship between a parent class and a child class wherein the parent class is equal to the child class, and a group association representing a relationship between a group comprising two or more classes and a child class.
|
1. A method for storing communication messages in a relational database, comprising: accepting an object model comprising data elements having respective data type definitions and further comprising associations between the data elements, wherein the data elements, the data type definitions and the associations are derived from a hierarchically-structured HL7 specification and comprise at least one data element whose data type definition corresponds to multiple possible data types; defining a relational database that represents the object model based on the data elements and the associations; receiving a communication message that conforms to the HL7 specification and comprises data items corresponding to one or more of the data elements, including at least one data item having the data type definition that corresponds to the multiple possible data types; processing the received communication message so as to identify an actual data type, selected from among the possible data types, to which the at least one data item belongs; and storing the data items, including the at least one data item, in the relational database so as to preserve the data type definitions of the data items, including the identified actual data type, and the associations between the data items, as defined in the object model, wherein the data elements comprise classes, each having one or more class attributes, wherein defining the relational database comprises creating for each class a respective class table comprising at least one unique identifier in the relational database, and mapping at least one of the class attributes to columns of the class table, and wherein the object model comprises at least one of an association of cardinality 1:n representing a relationship between a parent class and a child class, an association of cardinality n:m representing a relationship between one or more parent classes and one or more child classes, a recursive association representing a relationship between a parent class and a child class wherein the parent class is equal to the child class, and a group association representing a relationship between a group comprising two or more classes and a child class. 2. The method according to claim 1 , wherein the hierarchically-structured HL7 specification comprises an HL7 version 3 (HL7 V3) specification, wherein the object model comprises an HL7 Refined Message Information Model (RMIM), and wherein defining the relational database comprises producing a relational schema.
| 0.696705 |
7,613,687 | 16 | 17 |
16. An information gathering system for optimizing searching as in claim 15 wherein the data extraction tool extracts content from the websites that have not been categorized in the SIC predefined taxonomy of SIC business activities.
|
16. An information gathering system for optimizing searching as in claim 15 wherein the data extraction tool extracts content from the websites that have not been categorized in the SIC predefined taxonomy of SIC business activities. 17. An information gathering system for optimizing searching as in claim 16 wherein the extracted content from the websites that have not been categorized in the SIC predefined taxonomy of SIC business activities is used to update the classification system.
| 0.5 |
7,478,048 | 1 | 2 |
1. A method for a computer network user for creating a voice XML file automatically, comprising: providing a graphic user interface (GUI) for defining a plurality of first and second icons, each of said first icons corresponding to one or more attributes of voice XML, and wherein at least one second icon corresponds to a hyperlink to a linkable voice XML file; receiving user selection input of said icons to edit a content stream displayed in said GUI to customize audio output of said content stream and to add one or more hyperlinks to one or more linkable voice XML files; recording an action stream of a user invoking said icons in the graphic user interface; interpreting said action stream based on a library of voice XML tags and generating voice XML tags for said content; and generating a voice XML file by combining the generated voice XML tags and the content stream including at least one hyperlink to a linkable voice XML file, wherein, upon listener hyperlink input to the generated voice XML file, audio accessed through said hyperlink is automatically delivered to said listener.
|
1. A method for a computer network user for creating a voice XML file automatically, comprising: providing a graphic user interface (GUI) for defining a plurality of first and second icons, each of said first icons corresponding to one or more attributes of voice XML, and wherein at least one second icon corresponds to a hyperlink to a linkable voice XML file; receiving user selection input of said icons to edit a content stream displayed in said GUI to customize audio output of said content stream and to add one or more hyperlinks to one or more linkable voice XML files; recording an action stream of a user invoking said icons in the graphic user interface; interpreting said action stream based on a library of voice XML tags and generating voice XML tags for said content; and generating a voice XML file by combining the generated voice XML tags and the content stream including at least one hyperlink to a linkable voice XML file, wherein, upon listener hyperlink input to the generated voice XML file, audio accessed through said hyperlink is automatically delivered to said listener. 2. The method according to claim 1 , wherein said receiving user selection input to add one or more hyperlinks comprises adding the hyperlinks to a content stream comprising a TTS voice XML file by the steps of the user editing the TTS voice XML file in the edit area of said graphic user interface, marking or entering the parts to be added with the hyperlinks, invoking the corresponding icons and entering the corresponding hyperlink addresses.
| 0.678417 |
9,152,396 | 10 | 12 |
10. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions for managing user interface (UI) building blocks (UIBB) that when executed by one or more computers cause the one or more computers to perform operations comprising: presenting, by a form repeater UIBB, initial UI representations of two or more structured entities through a graphical user interface (GUI), each initial UI representation of the two or more structured entities comprising one or more fields; receiving a trigger from a user through the form repeater UIBB, the trigger associated with a particular initial UI representation of a particular structured entity of the two or more structured entities; in response to receiving the trigger, identifying an event condition ID associated with the trigger; matching the event condition ID to a stored ID value; based on the matching, identifying i) a substitute UI representation of the particular structured entity, ii) an event condition, and iii) a type of the event condition, wherein the substitute UI representation of the particular structured entity includes one or more fields that differ from the one or more fields of the particular initial UI representation of the particular structured entity; determining that the event condition identifies that an origination of the trigger is associated with the particular initial UI representation, and that the type of the event condition includes a swapping-in event condition; based on the determination that the event condition identifies that the origination of the trigger is associated with the particular initial UI representation, and that the type of the event condition includes the swapping-in event condition, replacing, by a substitute UIBB, the particular initial UI representation of the particular structured entity of the two or more structured entities with the identified substitute UI representation of the particular structured entity; removing the particular initial UI representation of the particular structured entity from the form repeater UIBB; and maintaining the initial UI representation of the remaining structured entities of the two or more structured entities concurrently with replacing the particular initial UI representation of the particular structured entity with the identified substitute UI representation of the particular structured entity.
|
10. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions for managing user interface (UI) building blocks (UIBB) that when executed by one or more computers cause the one or more computers to perform operations comprising: presenting, by a form repeater UIBB, initial UI representations of two or more structured entities through a graphical user interface (GUI), each initial UI representation of the two or more structured entities comprising one or more fields; receiving a trigger from a user through the form repeater UIBB, the trigger associated with a particular initial UI representation of a particular structured entity of the two or more structured entities; in response to receiving the trigger, identifying an event condition ID associated with the trigger; matching the event condition ID to a stored ID value; based on the matching, identifying i) a substitute UI representation of the particular structured entity, ii) an event condition, and iii) a type of the event condition, wherein the substitute UI representation of the particular structured entity includes one or more fields that differ from the one or more fields of the particular initial UI representation of the particular structured entity; determining that the event condition identifies that an origination of the trigger is associated with the particular initial UI representation, and that the type of the event condition includes a swapping-in event condition; based on the determination that the event condition identifies that the origination of the trigger is associated with the particular initial UI representation, and that the type of the event condition includes the swapping-in event condition, replacing, by a substitute UIBB, the particular initial UI representation of the particular structured entity of the two or more structured entities with the identified substitute UI representation of the particular structured entity; removing the particular initial UI representation of the particular structured entity from the form repeater UIBB; and maintaining the initial UI representation of the remaining structured entities of the two or more structured entities concurrently with replacing the particular initial UI representation of the particular structured entity with the identified substitute UI representation of the particular structured entity. 12. The non-transitory computer storage medium of claim 10 , wherein the operations further comprise: receiving an additional trigger through the form repeater UIBB, the additional trigger associated with the identified substitute UI representation of the particular structured entity of the two or more structured entities; in response to receiving the additional trigger, identifying an additional event condition ID associated with the additional trigger; matching the additional event condition ID to an additional stored ID value; based on the matching, identifying i) the particular initial UI representation of the particular structured entity, ii) an additional event condition, and iii) a type of the event condition; determining that the additional event condition identifies that an origination of the additional trigger is associated with the identified substitute UI representation, and that the type of the additional event condition includes a swapping-out event condition; and based on the determination that the additional event condition identifies that the origination of the trigger is associated with the identified substitute UI representation, and that the type of the additional event condition includes the swapping-out event condition, replacing, by the form repeater UIBB, the identified substitute UI representation of the particular structured entity with the particular initial UI representation of the particular structured entity.
| 0.5 |
8,938,393 | 12 | 13 |
12. The method of claim 1 wherein the target audio content feature is human dialogue and the aspect includes a word and corresponding time-stamp.
|
12. The method of claim 1 wherein the target audio content feature is human dialogue and the aspect includes a word and corresponding time-stamp. 13. The method of claim 12 further comprising recognizing the aspect by: selectively converting speech to text if the word is not in text form; selecting the most meaningful content words; and outputting the selected words and their corresponding time-stamps.
| 0.5 |
6,084,985 | 11 | 12 |
11. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting segment, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU4## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive segments, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized.
|
11. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting segment, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU4## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive segments, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized. 12. The method as claimed in claim 11, wherein the aggregated feature vector elements comprise differential angles derived from the centers of gravities associated to successive handwriting intervals.
| 0.547511 |
9,697,178 | 31 | 32 |
31. The computer program product as recited in claim 30 , wherein the specified derived feature model is generalized such that it is applicable to a plurality of entities or content verticals.
|
31. The computer program product as recited in claim 30 , wherein the specified derived feature model is generalized such that it is applicable to a plurality of entities or content verticals. 32. The computer program product as recited in claim 31 , wherein the specified derived feature computational component is configured to specify how the derived feature is determined automatically from another derived feature.
| 0.5 |
8,571,917 | 5 | 7 |
5. The method of claim 1 , wherein the step of developing a second scan of the underlying trend using the Internet to identify trend papers associated with the underlying trend, wherein the trend papers allow for identification of at least a change driver that drives the trend comprises: developing a set of search queries to use for searching the Internet for trend papers associated with treasury products that relate to the published scenario; and developing a second set of search queries to use for searching the Internet for trend papers related to external industries that affect the underlying trend in the already published scenario; and creating an algorithm that routinely executes Internet searches using the two sets of search queries.
|
5. The method of claim 1 , wherein the step of developing a second scan of the underlying trend using the Internet to identify trend papers associated with the underlying trend, wherein the trend papers allow for identification of at least a change driver that drives the trend comprises: developing a set of search queries to use for searching the Internet for trend papers associated with treasury products that relate to the published scenario; and developing a second set of search queries to use for searching the Internet for trend papers related to external industries that affect the underlying trend in the already published scenario; and creating an algorithm that routinely executes Internet searches using the two sets of search queries. 7. The method of claim 5 , wherein allowing for the identification of at least the change driver that drives the trend comprises: Presenting the information about the underlying trend to the community of stakeholders so that the community of stakeholders can review the information and identify the change driver.
| 0.5 |
8,112,478 | 7 | 8 |
7. The system of claim 1 , the data store being a database.
|
7. The system of claim 1 , the data store being a database. 8. The system of claim 7 , the database being configured to store the discussion forum message, a discussion forum message definition, a user setting, a forum definition, an access control definition, and a policy definition.
| 0.5 |
7,676,517 | 1 | 10 |
1. A system embodied in a computer readable storage medium that, when executed by one or more processors, facilitates query processing, the system comprising the following computer executable components: a query component that facilitates input of a portion of query data into a client application during a query generation process, wherein the query generation process comprises automatic injection of additional query data into the client application; a search component that executes a query against an indexed network based service in real time to suggest the additional query data in response to receiving the portion of the query data and communicates the additional query data to the query component for presentation to a user; a trigger component that facilitates the inclusion of one or more additional data elements to affect the query generation process and facilitates one or more of impacting, refining, and filtering the additional query data; an adaptive component that adapts the query generation process to a skill level of the user, wherein the query generation process is more automated when the user is determined to be more skillful and the query generation process is less automated when the user is determined to be more novice; and a machine learning and reasoning component that employs a probabilistic or statistical-based analysis, or a combination thereof, to prognose or infer an action that a user desires to be automatically performed.
|
1. A system embodied in a computer readable storage medium that, when executed by one or more processors, facilitates query processing, the system comprising the following computer executable components: a query component that facilitates input of a portion of query data into a client application during a query generation process, wherein the query generation process comprises automatic injection of additional query data into the client application; a search component that executes a query against an indexed network based service in real time to suggest the additional query data in response to receiving the portion of the query data and communicates the additional query data to the query component for presentation to a user; a trigger component that facilitates the inclusion of one or more additional data elements to affect the query generation process and facilitates one or more of impacting, refining, and filtering the additional query data; an adaptive component that adapts the query generation process to a skill level of the user, wherein the query generation process is more automated when the user is determined to be more skillful and the query generation process is less automated when the user is determined to be more novice; and a machine learning and reasoning component that employs a probabilistic or statistical-based analysis, or a combination thereof, to prognose or infer an action that a user desires to be automatically performed. 10. The system of claim 1 , the additional query data is based on personalized search information.
| 0.776256 |
9,286,356 | 1 | 2 |
1. A method performed by one or more processing devices, comprising: determining, based on usage of a social network by a user, a maturity score for the user, where the maturity score represents a measure of user development of the user within the social network; for a particular type of content associated with a resource, retrieving, from a set of utility score instructions, a utility score instruction for the particular type of content; wherein the utility score instruction defines, for the particular type of content in the social network, a relationship between a utility score and the maturity score; wherein the utility score represents a measure of utility of the particular type of content to the user as defined by the measure of user development in the social network; and wherein the utility score is determined independent of user input; wherein defined relationships across the set of utility score instructions promote a first pre-defined type of content among less mature users of the social network relative to other maturities of other users of the social network and promote a second pre-defined type of content among more mature users of the social network relative to the other maturities of the other users of the social network; and determining, based on the set of utility score instructions and the maturity score, utility scores for resources that are accessible to the user.
|
1. A method performed by one or more processing devices, comprising: determining, based on usage of a social network by a user, a maturity score for the user, where the maturity score represents a measure of user development of the user within the social network; for a particular type of content associated with a resource, retrieving, from a set of utility score instructions, a utility score instruction for the particular type of content; wherein the utility score instruction defines, for the particular type of content in the social network, a relationship between a utility score and the maturity score; wherein the utility score represents a measure of utility of the particular type of content to the user as defined by the measure of user development in the social network; and wherein the utility score is determined independent of user input; wherein defined relationships across the set of utility score instructions promote a first pre-defined type of content among less mature users of the social network relative to other maturities of other users of the social network and promote a second pre-defined type of content among more mature users of the social network relative to the other maturities of the other users of the social network; and determining, based on the set of utility score instructions and the maturity score, utility scores for resources that are accessible to the user. 2. The method of claim 1 , further comprising: receiving information identifying the user; wherein determining the maturity score comprises: determining, at least partly based on the information identifying the user, user attributes of the user; and determining, based on the user attributes, the maturity score for the user.
| 0.711368 |
9,785,638 | 2 | 7 |
2. The method of claim 1 , wherein the search query further comprises the second search criteria, and the method further comprising: analyzing, by the construction document storage system, the construction project specification documents to determine a second number of documents that satisfy the second search criteria, wherein the plurality of charts includes a comparison chart that compare the first number of documents to the second number of documents.
|
2. The method of claim 1 , wherein the search query further comprises the second search criteria, and the method further comprising: analyzing, by the construction document storage system, the construction project specification documents to determine a second number of documents that satisfy the second search criteria, wherein the plurality of charts includes a comparison chart that compare the first number of documents to the second number of documents. 7. The method of claim 2 , wherein the plurality of charts includes a market share diagram comparing a first market share of the first search criteria to a second market share of the second market share criteria.
| 0.5 |
7,992,085 | 1 | 2 |
1. A method of providing information associated with a focused-on item in an electronic document, comprising: receiving a first user-initiated selection comprising a focus on an item contained in an electronic document; evaluating a current mode of the electronic document selected from a first mode in which a plurality of editing functions of the electronic document are disabled, and a second mode in which the plurality of editing functions of the electronic document are enabled; automatically initiating a search for information on the focused-on item when the current mode is evaluated as the first mode; receiving a second user-initiated selection for initiating the search for information on the focused-on item when the current mode is evaluated as the second mode, wherein the second user selection is selected from a group comprising: a simultaneous keyboard and mouse selection; and a control selection accessed in one of a control toolbar and a drop-down menu; passing data representing the focused-on item to an information source following initiating the search for information on the focused-on item; receiving the information associated with the focused-on item from the information source; automatically displaying the returned information associated with the focused-on item in a user interface in the electronic document in proximity to the focused-on item; and when the information associated with the focused-on item will not fit in an available display space provided in the user interface: truncating a portion of the information such that only a portion of the information that will fit in the available display space provided in the user interface is displayed; and disposing a selectable control tab on a first side the user interface which, when selected, causes a display of the truncated portion of the information, the selectable control tab including: a first selectable tab which, when selected, causes to be displayed a first portion of the truncated portion of the information; and a second selectable tab which, when selected, causes to be displayed a second portion of the truncated portion of the information; the first and second selectable tabs extending from the user interface, with the first selectable tab being positioned above the second selectable tab.
|
1. A method of providing information associated with a focused-on item in an electronic document, comprising: receiving a first user-initiated selection comprising a focus on an item contained in an electronic document; evaluating a current mode of the electronic document selected from a first mode in which a plurality of editing functions of the electronic document are disabled, and a second mode in which the plurality of editing functions of the electronic document are enabled; automatically initiating a search for information on the focused-on item when the current mode is evaluated as the first mode; receiving a second user-initiated selection for initiating the search for information on the focused-on item when the current mode is evaluated as the second mode, wherein the second user selection is selected from a group comprising: a simultaneous keyboard and mouse selection; and a control selection accessed in one of a control toolbar and a drop-down menu; passing data representing the focused-on item to an information source following initiating the search for information on the focused-on item; receiving the information associated with the focused-on item from the information source; automatically displaying the returned information associated with the focused-on item in a user interface in the electronic document in proximity to the focused-on item; and when the information associated with the focused-on item will not fit in an available display space provided in the user interface: truncating a portion of the information such that only a portion of the information that will fit in the available display space provided in the user interface is displayed; and disposing a selectable control tab on a first side the user interface which, when selected, causes a display of the truncated portion of the information, the selectable control tab including: a first selectable tab which, when selected, causes to be displayed a first portion of the truncated portion of the information; and a second selectable tab which, when selected, causes to be displayed a second portion of the truncated portion of the information; the first and second selectable tabs extending from the user interface, with the first selectable tab being positioned above the second selectable tab. 2. The method of claim 1 , wherein receiving the information associated with the focused-on item includes receiving the information associated with the focused-on item in a format associated with each of a plurality of media types, and further comprising providing access to the information associated with the focused-on item in the format associated with each of the plurality of media types via the displayed user interface.
| 0.726633 |
8,583,638 | 13 | 15 |
13. A computer-program product, tangibly embodied in a non-transitory machine readable storage medium, including instructions configured to cause a data processing apparatus to: display, at a computing device, an interface including a search mode view of a map, a time zone display and a search box; receive input corresponding to textual or numerical input into the search box, wherein the input causes a display of a scroll menu; display a list of geographic locations in the scroll menu, wherein the geographic locations are displayed according to the received input; display visual indicators on the search mode view of the map, wherein the visual indicators are displayed according to the list of geographic locations, and wherein a visual indicator contrasts selected geographic locations; receive scroll input corresponding a selection of a geographic location from the list of geographic locations in the scroll menu, wherein scrolling includes highlighting geographic locations on the list of geographic locations, wherein the selected geographic location is associated with a time zone; and update the interface, wherein updating includes replacing the search mode view with a confirmed mode view, and updating the time zone display, wherein the confirmed mode view includes a time zone region corresponding to the time zone associated with the selected geographic region, and wherein the updated time zone display includes time zone data corresponding to the time zone associated with the selected geographic region and the visual indicator associated with the selected geographic location.
|
13. A computer-program product, tangibly embodied in a non-transitory machine readable storage medium, including instructions configured to cause a data processing apparatus to: display, at a computing device, an interface including a search mode view of a map, a time zone display and a search box; receive input corresponding to textual or numerical input into the search box, wherein the input causes a display of a scroll menu; display a list of geographic locations in the scroll menu, wherein the geographic locations are displayed according to the received input; display visual indicators on the search mode view of the map, wherein the visual indicators are displayed according to the list of geographic locations, and wherein a visual indicator contrasts selected geographic locations; receive scroll input corresponding a selection of a geographic location from the list of geographic locations in the scroll menu, wherein scrolling includes highlighting geographic locations on the list of geographic locations, wherein the selected geographic location is associated with a time zone; and update the interface, wherein updating includes replacing the search mode view with a confirmed mode view, and updating the time zone display, wherein the confirmed mode view includes a time zone region corresponding to the time zone associated with the selected geographic region, and wherein the updated time zone display includes time zone data corresponding to the time zone associated with the selected geographic region and the visual indicator associated with the selected geographic location. 15. The computer-program product of claim 13 , wherein the interface includes a search result number, and wherein the search result number corresponds to the list of geographic locations.
| 0.822581 |
8,127,220 | 22 | 26 |
22. A computer-implemented method, comprising: identifying a document that is stored on a server in a network and that includes links to linked documents; determining scores for a plurality of the links in the identified document; comparing the determined scores to a threshold; deleting one of the plurality of links from the identified document when the determined score for the one of the links falls below the threshold; and providing, to a user, the identified document without the deleted link.
|
22. A computer-implemented method, comprising: identifying a document that is stored on a server in a network and that includes links to linked documents; determining scores for a plurality of the links in the identified document; comparing the determined scores to a threshold; deleting one of the plurality of links from the identified document when the determined score for the one of the links falls below the threshold; and providing, to a user, the identified document without the deleted link. 26. The method of claim 22 , wherein determining the scores includes: receiving input from the user, determining a score for each of the linked documents based on the received input, and associating the determined scores for the linked documents with the corresponding links in the identified document.
| 0.880821 |
8,097,024 | 11 | 13 |
11. A dynamic bone screw adapted for use in spinal stabilization for a spine comprising: an elongated bone anchor having, a longitudinal axis, a threaded distal end and a proximal end; a post having a longitudinal post axis, a distal end and a proximal end; a joint which secures the distal end of the post to the proximal end of the bone anchor such that the post can pivot relative to the bone anchor; a tubular extension of the bone anchor which extends over a distal portion of the post; the tubular extension having an external surface with a plurality of surface features adapted to engage a device mounted on the external surface to prevent rotation of the device relative to the bone anchor; and a compliant member disposed between a proximal portion of the post and the tubular extension of the bone anchor whereby the compliant member biases the longitudinal post axis of the post into alignment with the longitudinal axis of the elongated bone anchor, said compliant member is adapted to align the longitudinal post axis of the post with the longitudinal axis of the bone screw as the spine applies a load on the dynamic bone screw for spinal stabilization.
|
11. A dynamic bone screw adapted for use in spinal stabilization for a spine comprising: an elongated bone anchor having, a longitudinal axis, a threaded distal end and a proximal end; a post having a longitudinal post axis, a distal end and a proximal end; a joint which secures the distal end of the post to the proximal end of the bone anchor such that the post can pivot relative to the bone anchor; a tubular extension of the bone anchor which extends over a distal portion of the post; the tubular extension having an external surface with a plurality of surface features adapted to engage a device mounted on the external surface to prevent rotation of the device relative to the bone anchor; and a compliant member disposed between a proximal portion of the post and the tubular extension of the bone anchor whereby the compliant member biases the longitudinal post axis of the post into alignment with the longitudinal axis of the elongated bone anchor, said compliant member is adapted to align the longitudinal post axis of the post with the longitudinal axis of the bone screw as the spine applies a load on the dynamic bone screw for spinal stabilization. 13. The spinal implant of claim 11 , wherein the plurality of surface features comprise a plurality of splines.
| 0.76383 |
7,870,161 | 1 | 9 |
1. A method for string signature scanning, comprising: processing one or more signatures into one or more formats including selecting one or more fingerprints for each fixed-size signature or each of one or more fixed-size signature substrings of each a variable-size signature and constructing one or more search data structures for the one or more fingerprints associated with the one or more signatures and one or more follow-on search data structures, each successive fingerprint of a particular fixed-size signature or signature substring having a first basic unit in a scanning direction that is shifted one or more units from the previous fingerprint of the particular fixed-size signature or signature substrings such that the number of fingerprints for the particular fixed-size signature or signature substrings is equal to a step size for a signature scanning operation and the particular fixed-size signature or signature substring is identifiable at any location within any string fields to be scanned, where each fingerprint includes one or more fragments of a particular fixed-size signature or signature substring, the one or more fragments having particular locations anywhere within the particular fixed-size signature or signature substring; receiving a particular string field comprising a string of data values; identifying any signatures included in the particular string field including scanning the particular string field for the one or more fingerprints associated with the one or more signatures with either a zero or non-zero false positive rate using the one or more search data structures for the one or more fingerprints for each scan step size and searching the particular string field for the one or more signatures associated with one or more identified fingerprints using the one or more follow-on search data structures at the locations where the one or more identified fingerprints are found; and outputting any identified signatures in the particular string field.
|
1. A method for string signature scanning, comprising: processing one or more signatures into one or more formats including selecting one or more fingerprints for each fixed-size signature or each of one or more fixed-size signature substrings of each a variable-size signature and constructing one or more search data structures for the one or more fingerprints associated with the one or more signatures and one or more follow-on search data structures, each successive fingerprint of a particular fixed-size signature or signature substring having a first basic unit in a scanning direction that is shifted one or more units from the previous fingerprint of the particular fixed-size signature or signature substrings such that the number of fingerprints for the particular fixed-size signature or signature substrings is equal to a step size for a signature scanning operation and the particular fixed-size signature or signature substring is identifiable at any location within any string fields to be scanned, where each fingerprint includes one or more fragments of a particular fixed-size signature or signature substring, the one or more fragments having particular locations anywhere within the particular fixed-size signature or signature substring; receiving a particular string field comprising a string of data values; identifying any signatures included in the particular string field including scanning the particular string field for the one or more fingerprints associated with the one or more signatures with either a zero or non-zero false positive rate using the one or more search data structures for the one or more fingerprints for each scan step size and searching the particular string field for the one or more signatures associated with one or more identified fingerprints using the one or more follow-on search data structures at the locations where the one or more identified fingerprints are found; and outputting any identified signatures in the particular string field. 9. The method of claim 1 , further comprising: encoding each of one or more fixed-size signatures or signature substrings with one or more mask bits including one or more mask bits for specifying one or more of a don't care, a case-sensitivity, a negation, a pre-defined range, a logic operation, and an arbitrary range; and comparing the mask encoded fixed-size signatures or signature substrings with the particular string field.
| 0.674471 |
8,312,025 | 2 | 3 |
2. The information processing apparatus according to claim 1 , further comprising an initial information creation device configured to create initial information from each of said meta information items included in said sorted meta information based on said predetermined conditions, before adding the created initial information to each of said meta information items included in said sorted meta information, thereby creating automatically said sorted meta information furnished with said initial information.
|
2. The information processing apparatus according to claim 1 , further comprising an initial information creation device configured to create initial information from each of said meta information items included in said sorted meta information based on said predetermined conditions, before adding the created initial information to each of said meta information items included in said sorted meta information, thereby creating automatically said sorted meta information furnished with said initial information. 3. The information processing apparatus according to claim 2 , wherein, based on the condition of creating initial information beginning with a first character of given information, said initial information creation device creates said initial information beginning with a first character of each of said meta information items included in said sorted meta information.
| 0.515748 |
9,519,714 | 13 | 15 |
13. One or more computer storage hardware devices having instructions embodied thereon that, when executed by on a computer, cause the computer to provide a graphical user interface, the graphical user interface comprising: a first display area configured for displaying a first search result of a plurality of search results presented on a search results page in response to a search query, the first search result being associated with a first webpage including a first list of a plurality of lists within content of the first webpage, wherein the first list is at least a portion of the first webpage provided in a form of a list, a collection of items, a set of items, or a table, and wherein the first list is determined to exceed a predetermined level of relevance; a second display area positioned near the first display area on the search results page, the second display area configured for displaying a list preview that includes at least a portion of a set of items of the first list within the first webpage of the first search result; and a third display area configured for displaying one or more list attributes that provide a characteristic of the first list of the first webpage, wherein the one or more list attributes comprise at least one of a number of items within the first list, a relevancy score associated with the first list, or a quality score associated with the first list.
|
13. One or more computer storage hardware devices having instructions embodied thereon that, when executed by on a computer, cause the computer to provide a graphical user interface, the graphical user interface comprising: a first display area configured for displaying a first search result of a plurality of search results presented on a search results page in response to a search query, the first search result being associated with a first webpage including a first list of a plurality of lists within content of the first webpage, wherein the first list is at least a portion of the first webpage provided in a form of a list, a collection of items, a set of items, or a table, and wherein the first list is determined to exceed a predetermined level of relevance; a second display area positioned near the first display area on the search results page, the second display area configured for displaying a list preview that includes at least a portion of a set of items of the first list within the first webpage of the first search result; and a third display area configured for displaying one or more list attributes that provide a characteristic of the first list of the first webpage, wherein the one or more list attributes comprise at least one of a number of items within the first list, a relevancy score associated with the first list, or a quality score associated with the first list. 15. The computer storage hardware devices of claim 13 , further comprising a fourth display area configured for displaying a more indicator that, if selected, results in presentation of additional items from the set of items not included within the list preview.
| 0.5 |
9,990,355 | 10 | 16 |
10. A system, comprising: a memory unit for storing a computer program for checking documents using colloquialisms; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising: tracking colloquialisms used in messages by users in a social network, wherein said colloquialisms are words or phrases used in informal online communications, wherein said colloquialisms comprise words or phrases that vary from region to region; identifying relationships between senders and recipients of said messages using said colloquialisms; generating a social graph to depict relations between said users in said social network based on said identified relationships; formulating usage patterns of said colloquialisms among said users of said social graph; generating a rule set based on said social graph; and reviewing a document for spelling and/or grammatical errors and/or for making contextual relevant recommendations using said generated rule set.
|
10. A system, comprising: a memory unit for storing a computer program for checking documents using colloquialisms; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising: tracking colloquialisms used in messages by users in a social network, wherein said colloquialisms are words or phrases used in informal online communications, wherein said colloquialisms comprise words or phrases that vary from region to region; identifying relationships between senders and recipients of said messages using said colloquialisms; generating a social graph to depict relations between said users in said social network based on said identified relationships; formulating usage patterns of said colloquialisms among said users of said social graph; generating a rule set based on said social graph; and reviewing a document for spelling and/or grammatical errors and/or for making contextual relevant recommendations using said generated rule set. 16. The system as recited in claim 10 , wherein said usage patterns of said colloquialisms are based on occurrences of said colloquialisms among other users in said social network.
| 0.642857 |
8,627,272 | 15 | 24 |
15. A system comprising: a processor to: identify a mapping of a first object to a second object, the first object including code that contains a first code portion and a second code portion, the second object including a graphical model containing a first graphical element and a second graphical element that corresponds to the first graphical element, and the mapping including the first code portion being mapped to the first graphical element, and the second code portion being mapped to the second graphical element; regenerate the first graphical element, the second graphical element, and the second code portion based on the mapping and an edit to the first code portion; and cause a display to present a representation of the regenerated first graphical element and the regenerated second graphical element.
|
15. A system comprising: a processor to: identify a mapping of a first object to a second object, the first object including code that contains a first code portion and a second code portion, the second object including a graphical model containing a first graphical element and a second graphical element that corresponds to the first graphical element, and the mapping including the first code portion being mapped to the first graphical element, and the second code portion being mapped to the second graphical element; regenerate the first graphical element, the second graphical element, and the second code portion based on the mapping and an edit to the first code portion; and cause a display to present a representation of the regenerated first graphical element and the regenerated second graphical element. 24. The system of claim 15 , where the first graphical element is one of a plurality of recurring first graphical elements included in the graphical model, and where the processor, when regenerating the first graphical element, is further to: regenerate each of the plurality of recurring first graphical elements based on the information associated with edit to the first code portion.
| 0.825969 |
7,530,020 | 31 | 32 |
31. The system according to claim 23 , wherein an object or additional object is selected, and the hierarchy is then transformed to place the selected object or additional object at a root node of the hierarchy.
|
31. The system according to claim 23 , wherein an object or additional object is selected, and the hierarchy is then transformed to place the selected object or additional object at a root node of the hierarchy. 32. The system according to claim 31 , the hierarchy is represented as a set of hierarchal nodes and selective interconnections therebetween, wherein hierarchal nodes above a node containing the selected object are hidden.
| 0.5 |
7,496,599 | 1 | 2 |
1. A computer-implemented method for mapping hierarchical data from a relational table comprising: providing a schema for a hierarchical data structure wherein the schema defines a hierarchical relationship of data elements; identifying from the schema a node within the hierarchical data structure corresponding to a column in the relational table; determining that an element of the data elements in the schema is associated with an indicator that specifies the element as a hidden element; copying data from the relational table to the hierarchical data structure, wherein the copied data excludes the hidden element; and storing the hierarchical data structure that includes the copied data in a computer-readable storage medium.
|
1. A computer-implemented method for mapping hierarchical data from a relational table comprising: providing a schema for a hierarchical data structure wherein the schema defines a hierarchical relationship of data elements; identifying from the schema a node within the hierarchical data structure corresponding to a column in the relational table; determining that an element of the data elements in the schema is associated with an indicator that specifies the element as a hidden element; copying data from the relational table to the hierarchical data structure, wherein the copied data excludes the hidden element; and storing the hierarchical data structure that includes the copied data in a computer-readable storage medium. 2. The method as recited in claim 1 wherein the hierarchical data structure comprises an extensible markup language (XML) document.
| 0.5 |
4,437,837 | 1 | 4 |
1. A method of using an educational aid for facilitating the instruction of learners in the ability to read comprising, in combination: an ordered set of instructional elements for use seriatim according to a teaching plan, each element including: background means having indicia thereon; said indicia including an ordered series of sentence indicia; a first one of said sentence indicia including a first alphabetic indicia representing a first single high-frequency word to be learned and at least a first rebus indicia representing a word equivalent cooperating with the high frequency word to help form a first sentence to facilitate the decoding said first alphabetic indicia in accordance with a teaching plan; a second one of said sentence indicia including a second alphabetic indicia representing said single high-frequency word to be learned for repetition purposes and at least a second rebus indicia representing a word equivalent cooperating with the high frequency word to help form a second sentence to facilitate the decoding said second alphabetic indicia in accordance with the teaching plan; a third one of said sentence indicia including a third alphabetic indicia representing a second single high-frequency word to be learned and at least a third rebus indicia representing a word equivalent cooperating with the second high-frequency word to help form a third sentence to facilitate the decoding said third alphabetic indicia in accordance with the teaching plan, wherein said third one of said sentence indicia includes a fourth alphabetic indicia representing said single high-frequency word to be learned for reinforcement purposes; a fourth one of said sentence indicia including a fifth alphabetic indicia representing said second single high-frequency word to be learned for repetition purposes and at least a fourth rebus indicia representing a word equivalent cooperating with said second high-frequency word to help form a fourth sentence to facilitate the decoding said fifth alphabetic indicia in accordance with the teaching plan; displaying the first one of said sentence indicia to the learner according to the teaching plan; directing the attention of the learner to said first alphabetic indicia representing said single high-frequency word to be learned for explaining said word to the learner; displaying the second one of said sentence indicia to the learner; requesting the learner to read said second sentence to facilitate the decoding of said second indicia; displaying the third one of said sentence indicia to the learner; requesting the learner to read said third sentence to facilitate the decoding said third alphabetic indicia; and repeating the displaying and requesting steps for the fourth and any additional ones of said sentence indicia; whereby each subsequent sentence indicia includes at the most only one new alphabetic indicia representing a single new high-frequency word to be learned and possibly some alphabetic indicia representing one or more previously learned high-frequency words.
|
1. A method of using an educational aid for facilitating the instruction of learners in the ability to read comprising, in combination: an ordered set of instructional elements for use seriatim according to a teaching plan, each element including: background means having indicia thereon; said indicia including an ordered series of sentence indicia; a first one of said sentence indicia including a first alphabetic indicia representing a first single high-frequency word to be learned and at least a first rebus indicia representing a word equivalent cooperating with the high frequency word to help form a first sentence to facilitate the decoding said first alphabetic indicia in accordance with a teaching plan; a second one of said sentence indicia including a second alphabetic indicia representing said single high-frequency word to be learned for repetition purposes and at least a second rebus indicia representing a word equivalent cooperating with the high frequency word to help form a second sentence to facilitate the decoding said second alphabetic indicia in accordance with the teaching plan; a third one of said sentence indicia including a third alphabetic indicia representing a second single high-frequency word to be learned and at least a third rebus indicia representing a word equivalent cooperating with the second high-frequency word to help form a third sentence to facilitate the decoding said third alphabetic indicia in accordance with the teaching plan, wherein said third one of said sentence indicia includes a fourth alphabetic indicia representing said single high-frequency word to be learned for reinforcement purposes; a fourth one of said sentence indicia including a fifth alphabetic indicia representing said second single high-frequency word to be learned for repetition purposes and at least a fourth rebus indicia representing a word equivalent cooperating with said second high-frequency word to help form a fourth sentence to facilitate the decoding said fifth alphabetic indicia in accordance with the teaching plan; displaying the first one of said sentence indicia to the learner according to the teaching plan; directing the attention of the learner to said first alphabetic indicia representing said single high-frequency word to be learned for explaining said word to the learner; displaying the second one of said sentence indicia to the learner; requesting the learner to read said second sentence to facilitate the decoding of said second indicia; displaying the third one of said sentence indicia to the learner; requesting the learner to read said third sentence to facilitate the decoding said third alphabetic indicia; and repeating the displaying and requesting steps for the fourth and any additional ones of said sentence indicia; whereby each subsequent sentence indicia includes at the most only one new alphabetic indicia representing a single new high-frequency word to be learned and possibly some alphabetic indicia representing one or more previously learned high-frequency words. 4. A method according to claim 1, further including an auxiliary learning reinforcement aid including a set of game elements for use seriatim according to a teaching plan, said elements including individual background means, each one of said means having a front face bearing a different alphabetic indicia representing one of said high-frequency words to be learned represented by the corresponding alphabetic indicia of said instructional elements and having a rear face bearing a different sentence indicia representing a sentence including the high-frequency word represented by the indicia on its front face.
| 0.508026 |
9,672,475 | 13 | 14 |
13. The computer-implemented method of claim 12 , wherein evaluating the corpus comprises: identifying topics, concepts, or subjects referenced by documents in the first collection of documents; and determining indications of opinions expressed about the topics, concepts, or subjects referenced by documents in the first collection.
|
13. The computer-implemented method of claim 12 , wherein evaluating the corpus comprises: identifying topics, concepts, or subjects referenced by documents in the first collection of documents; and determining indications of opinions expressed about the topics, concepts, or subjects referenced by documents in the first collection. 14. The computer-implemented method of claim 13 , wherein the first person represents a group of individuals, wherein the predicted opinion is returned along with the documents which reference the topic, wherein the predicted opinion is output, wherein evaluating the corpus further includes: parsing each document accessed from each secondary source to identify topics, concepts, or subjects referenced by the respective document from the respective secondary source; and determining indications of opinions on the topics, concepts, or subjects referenced by documents in the second collection.
| 0.5 |
7,825,933 | 1 | 8 |
1. A method of providing vertex attributes for a primitive program, comprising: specifying an unsized attribute array within the primitive program for an attribute of an input vertex, wherein specification of the unsized attribute array is independent of an input primitive type that will be processed by the primitive program; and specifying the input primitive type that will be processed by the primitive program, wherein a size of the unsized attribute array is determined based on the primitive input type when the primitive program is compiled using a host processor.
|
1. A method of providing vertex attributes for a primitive program, comprising: specifying an unsized attribute array within the primitive program for an attribute of an input vertex, wherein specification of the unsized attribute array is independent of an input primitive type that will be processed by the primitive program; and specifying the input primitive type that will be processed by the primitive program, wherein a size of the unsized attribute array is determined based on the primitive input type when the primitive program is compiled using a host processor. 8. The method of claim 1 , wherein the primitive program receives a stream of vertices and input attribute arrays that specify input primitives of the input primitive type and produces a stream of zero or more output primitives and output attribute arrays.
| 0.5 |
7,814,427 | 1 | 2 |
1. A computer implemented system, having a processor communicatively coupled to a memory, that facilitates design of an object model, comprising: a layout component that receives as input one or more graphs of objects having one or more different kinds of directed relationships, and converts the one or more graphs into an editable treelike structure comprising one or more nodes corresponding to the received graph of objects, wherein at least one of the nodes includes a plurality of changeable graphical symbols displayed on the node that are configured to change graphics upon activation, and wherein, upon activation of a first changeable graphical symbol, the first changeable graphical symbol dynamically expands to display one or more previously unseen inheritance hierarchy graph objects or collapses to hide one or more previously displayed inheritance hierarchy graph objects, and wherein, upon activation of a second changeable graphical symbol, the second changeable graphical symbol dynamically expands to display one or more previously unseen relationship hierarchy graph objects or collapses to hide one or more previously displayed relationship hierarchy graph objects; a presentation component that presents the editable treelike structure and facilitates user interaction therewith, the user interaction comprising: receiving inputs from a user that actuate at least one of the displayed changeable graphical symbols to expand or collapse inheritance hierarchy or relationship hierarchy graph objects and further indicate that at least one of the nodes displayed in the editable treelike structure is to be repositioned within the treelike structure; automatically and dynamically expanding at least a portion of the graph of objects to display one or more previously unseen inheritance hierarchy or relationship hierarchy graph objects or collapsing at least a portion of the graph of objects to hide one or more previously displayed inheritance hierarchy or relationship hierarchy graph objects; and automatically repositioning the node according to the received input, wherein connecting lines attached to the at least one node are automatically adjusted to an optimal position determined based on the structure's real estate; and wherein highlighting or other graphical indications automatically indicate the propagation of future user actions from a selected node of the treelike structure through other nodes having directed relationships to said selected node.
|
1. A computer implemented system, having a processor communicatively coupled to a memory, that facilitates design of an object model, comprising: a layout component that receives as input one or more graphs of objects having one or more different kinds of directed relationships, and converts the one or more graphs into an editable treelike structure comprising one or more nodes corresponding to the received graph of objects, wherein at least one of the nodes includes a plurality of changeable graphical symbols displayed on the node that are configured to change graphics upon activation, and wherein, upon activation of a first changeable graphical symbol, the first changeable graphical symbol dynamically expands to display one or more previously unseen inheritance hierarchy graph objects or collapses to hide one or more previously displayed inheritance hierarchy graph objects, and wherein, upon activation of a second changeable graphical symbol, the second changeable graphical symbol dynamically expands to display one or more previously unseen relationship hierarchy graph objects or collapses to hide one or more previously displayed relationship hierarchy graph objects; a presentation component that presents the editable treelike structure and facilitates user interaction therewith, the user interaction comprising: receiving inputs from a user that actuate at least one of the displayed changeable graphical symbols to expand or collapse inheritance hierarchy or relationship hierarchy graph objects and further indicate that at least one of the nodes displayed in the editable treelike structure is to be repositioned within the treelike structure; automatically and dynamically expanding at least a portion of the graph of objects to display one or more previously unseen inheritance hierarchy or relationship hierarchy graph objects or collapsing at least a portion of the graph of objects to hide one or more previously displayed inheritance hierarchy or relationship hierarchy graph objects; and automatically repositioning the node according to the received input, wherein connecting lines attached to the at least one node are automatically adjusted to an optimal position determined based on the structure's real estate; and wherein highlighting or other graphical indications automatically indicate the propagation of future user actions from a selected node of the treelike structure through other nodes having directed relationships to said selected node. 2. The system of claim 1 , wherein the layout component automatically adjusts characteristics associated with graphical symbols of the treelike structure, which characteristics include at least one of spacing, position, size, and shape.
| 0.613115 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.