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
|
|---|---|---|---|---|---|
8,495,051 | 1 | 10 | 1. A method for automatically displaying inference terms by a computing device, comprising: receiving streaming audio or video data; playing received audio or video data in substantially real time as the audio or video data is received; displaying streaming text corresponding to voice within the received audio or video data, as the received audio or video data is played; identifying inference terms within the streaming text; visually indicating identified inference terms within the streaming text, wherein visually indicating identified inference terms within the streaming text comprises highlighting or bracketing the identified inference terms within a text window comprising the streaming text; and displaying, with the identified inference terms, web search information associated with the identified inference terms. | 1. A method for automatically displaying inference terms by a computing device, comprising: receiving streaming audio or video data; playing received audio or video data in substantially real time as the audio or video data is received; displaying streaming text corresponding to voice within the received audio or video data, as the received audio or video data is played; identifying inference terms within the streaming text; visually indicating identified inference terms within the streaming text, wherein visually indicating identified inference terms within the streaming text comprises highlighting or bracketing the identified inference terms within a text window comprising the streaming text; and displaying, with the identified inference terms, web search information associated with the identified inference terms. 10. The method of claim 1 , further comprising displaying an inference identified using the identified inference terms. | 0.736726 |
8,850,310 | 1 | 2 | 1. A computer-implemented method, comprising: presenting a document having multiple data entry areas; receiving a user input action directed at and selecting a designated data entry area of the multiple data entry areas; generating a list of one or more suggestions for the designated data entry area, generating the list of one or more suggestions comprising identifying a suggestion of one or more suggestions in the list, the identified suggestion not having been included in the data entry areas of the document prior to the receipt of the user input directed at the designated data entry area, and the identifying of the suggestion comprising the following: analyzing a first set of data previously entered into one or more data entry areas of the document other than the designated data entry area; and analyzing a second set of data comprising data outside of data entry areas of the document; presenting the list of one or more suggestions automatically in response to the receiving of the user input action directed at and selecting the designated data entry area, the presentation of the list being performed at a time when manual entry of data has not been received in the designated data entry area; receiving user input selecting one of the one or more suggestions; and entering data represented by the selected suggestion in the designated data entry area in response to receiving the user input selecting the selected suggestion, wherein the method is performed by at least one computer processor. | 1. A computer-implemented method, comprising: presenting a document having multiple data entry areas; receiving a user input action directed at and selecting a designated data entry area of the multiple data entry areas; generating a list of one or more suggestions for the designated data entry area, generating the list of one or more suggestions comprising identifying a suggestion of one or more suggestions in the list, the identified suggestion not having been included in the data entry areas of the document prior to the receipt of the user input directed at the designated data entry area, and the identifying of the suggestion comprising the following: analyzing a first set of data previously entered into one or more data entry areas of the document other than the designated data entry area; and analyzing a second set of data comprising data outside of data entry areas of the document; presenting the list of one or more suggestions automatically in response to the receiving of the user input action directed at and selecting the designated data entry area, the presentation of the list being performed at a time when manual entry of data has not been received in the designated data entry area; receiving user input selecting one of the one or more suggestions; and entering data represented by the selected suggestion in the designated data entry area in response to receiving the user input selecting the selected suggestion, wherein the method is performed by at least one computer processor. 2. The method of claim 1 , wherein analyzing data previously entered into one or more data entry areas of the document comprises analyzing a structure of the document. | 0.661943 |
9,898,464 | 1 | 2 | 1. An information extraction supporting apparatus, comprising: a computer system implemented in computer hardware and configured to implement computer instructions, the computer system comprising: a first acquirer which acquires a document from which at least one attribute indicating a type of desired information is extracted as an analysis target; a determiner which determines whether or not the at least one attribute is valid, and obtains at least one of the valid attributes as one or more attribute candidates; a selector which selects an attribute to be used for an analysis from the one or more attribute candidates as a selected attribute; an extractor which extracts an expression belonging to the selected attribute from the document as an attribute expression, and when a second attribute for which an attribute expression is not extracted among third attributes required for the purpose of the analysis is present and when an attribute expression belonging to other third attributes commonly belongs to the second attribute, uses the attribute expression belonging to the other third attributes as an attribute expression of the second attribute; a second acquirer which acquires a correct or incorrect determination for the one or more attribute candidates; and a learning unit which executes learning based on the correct or incorrect determination. | 1. An information extraction supporting apparatus, comprising: a computer system implemented in computer hardware and configured to implement computer instructions, the computer system comprising: a first acquirer which acquires a document from which at least one attribute indicating a type of desired information is extracted as an analysis target; a determiner which determines whether or not the at least one attribute is valid, and obtains at least one of the valid attributes as one or more attribute candidates; a selector which selects an attribute to be used for an analysis from the one or more attribute candidates as a selected attribute; an extractor which extracts an expression belonging to the selected attribute from the document as an attribute expression, and when a second attribute for which an attribute expression is not extracted among third attributes required for the purpose of the analysis is present and when an attribute expression belonging to other third attributes commonly belongs to the second attribute, uses the attribute expression belonging to the other third attributes as an attribute expression of the second attribute; a second acquirer which acquires a correct or incorrect determination for the one or more attribute candidates; and a learning unit which executes learning based on the correct or incorrect determination. 2. The apparatus according to claim 1 , wherein the first acquirer acquires a purpose of the analysis. | 0.865435 |
9,230,040 | 1 | 2 | 1. A method of applying, on a device having a processor, queries to a document set comprising at least one document, respective documents comprising at least one node located at a node path from a root node of the document and having a node identifier and a node value, the method comprising: executing on the processor instructions configured to, upon receiving a query specifying a query node path comprising at least one pair of a query node identifier and a query node value for the node having the query node identifier: identify at least one matching document having at least one matching node comprising, for respective pairs of query node identifiers and query node values, at least one path node in the node path of the matching node that matches the query node identifier and a node value of the path node that matches the query node value; and present at least a portion of the at least one matching document in response to the query. | 1. A method of applying, on a device having a processor, queries to a document set comprising at least one document, respective documents comprising at least one node located at a node path from a root node of the document and having a node identifier and a node value, the method comprising: executing on the processor instructions configured to, upon receiving a query specifying a query node path comprising at least one pair of a query node identifier and a query node value for the node having the query node identifier: identify at least one matching document having at least one matching node comprising, for respective pairs of query node identifiers and query node values, at least one path node in the node path of the matching node that matches the query node identifier and a node value of the path node that matches the query node value; and present at least a portion of the at least one matching document in response to the query. 2. The method of claim 1 , respective nodes specified in a JavaScript Object Notation format. | 0.926772 |
8,650,317 | 4 | 5 | 4. The system of claim 2 , the operations further comprising searching, by the processor and based on the channel search request and at least one of a plurality of channel ratings and a plurality of channel relevancies to determine search results. | 4. The system of claim 2 , the operations further comprising searching, by the processor and based on the channel search request and at least one of a plurality of channel ratings and a plurality of channel relevancies to determine search results. 5. The system of claim 4 , the operations further comprising presenting, by the processor, the search results to the user in a search results interface. | 0.5 |
9,690,824 | 1 | 6 | 1. A method for searching a database of Objects, in which each Object is associated with a plurality of Attributes, each Attribute is associated with a Kind, and each Kind is associated with a plurality of Attributes, comprising: performing processing associated with receiving, utilizing a computer, search criteria from a user, the search criteria comprising an Attribute; performing processing associated with creating, utilizing the computer, a Nonceattribute using the search criteria; performing processing associated with inputting, utilizing the computer, a search utilizing the Nonceattribute; performing processing associated with identifying, utilizing the computer, all Objects having the Nonceattribute; performing processing associated with identifying, utilizing the computer, all Attributes associated with the Objects; performing processing associated with identifying, utilizing the computer, all Kinds associated with the Attributes; performing processing associated with applying to the Kinds and Attributes so identified a ranking criterion, wherein the ranking criterion is used by a user interface to determine the position of Kinds associated with items responsive to the search in a hierarchical display; and performing processing associated with displaying, utilizing the computer, the highest-ranked portion of the Kinds and the highest-ranked portion of the Attributes that can readably be shown in a search result display, the search result display presented in a mutable hierarchical format independent of a location of an object in a default hierarchical structure. | 1. A method for searching a database of Objects, in which each Object is associated with a plurality of Attributes, each Attribute is associated with a Kind, and each Kind is associated with a plurality of Attributes, comprising: performing processing associated with receiving, utilizing a computer, search criteria from a user, the search criteria comprising an Attribute; performing processing associated with creating, utilizing the computer, a Nonceattribute using the search criteria; performing processing associated with inputting, utilizing the computer, a search utilizing the Nonceattribute; performing processing associated with identifying, utilizing the computer, all Objects having the Nonceattribute; performing processing associated with identifying, utilizing the computer, all Attributes associated with the Objects; performing processing associated with identifying, utilizing the computer, all Kinds associated with the Attributes; performing processing associated with applying to the Kinds and Attributes so identified a ranking criterion, wherein the ranking criterion is used by a user interface to determine the position of Kinds associated with items responsive to the search in a hierarchical display; and performing processing associated with displaying, utilizing the computer, the highest-ranked portion of the Kinds and the highest-ranked portion of the Attributes that can readably be shown in a search result display, the search result display presented in a mutable hierarchical format independent of a location of an object in a default hierarchical structure. 6. The method of claim 1 , wherein the ranking criterion is created by combining stored rank values according to other ranking criteria. | 0.700441 |
8,296,144 | 2 | 3 | 2. The method of claim 1 wherein the weights and defined combinatorial equation based on a specific dialog application. | 2. The method of claim 1 wherein the weights and defined combinatorial equation based on a specific dialog application. 3. The method of claim 2 further comprising: receiving the user input as spoken utterances in a spoken language unit of the dialog system; and generating semantic representations of the user input in a dialog manager coupled to the spoken language unit. | 0.5 |
6,161,093 | 1 | 45 | 1. An information access system comprising: a central system having a database in which information is stored, the central system including searching means for searching the database; and a terminal coupled to the central system which can access information on the database; wherein the database stores at least phonetic signal information including phoneme information and rhythm information, the central system transmits phonetic signal information stored in the database to the terminal, and the terminal receives the phonetic signal information transmitted from the central system; and further wherein said phonetic signal information are items related to publications, and the searching means is configured to search the database for phonetic signal information relating to the publications corresponding to a keyword sent from the terminal. | 1. An information access system comprising: a central system having a database in which information is stored, the central system including searching means for searching the database; and a terminal coupled to the central system which can access information on the database; wherein the database stores at least phonetic signal information including phoneme information and rhythm information, the central system transmits phonetic signal information stored in the database to the terminal, and the terminal receives the phonetic signal information transmitted from the central system; and further wherein said phonetic signal information are items related to publications, and the searching means is configured to search the database for phonetic signal information relating to the publications corresponding to a keyword sent from the terminal. 45. An information access system according to claim 1 wherein said terminal further includes broadcast receiving means for receiving urgent broadcasts relating to urgent precautions and reporting means for bringing news of the urgent precautions. | 0.735484 |
9,594,814 | 1 | 9 | 1. A computer-implemented method comprising: accessing in memory a set of events, each event identified by an associated time stamp; wherein each event in the set of events includes a portion of raw data; receiving data indicating selection of a first event from among a first plurality of events and data indicating a selection of one or more portions of text within the raw data of the first event to be extracted as one or more fields; automatically determining an initial extraction rule that extracts the selected portions of text within the first event; causing display of a first interface providing tools that implement user modification of the extraction rule, including selecting a field from the one or more fields and: selecting one or more non-adjoining strings to concatenate with the selected field; selecting a portion of the selected field to be trimmed from the beginning or end of the selected field; or selecting sub-portions of text to extract from within the selected field. | 1. A computer-implemented method comprising: accessing in memory a set of events, each event identified by an associated time stamp; wherein each event in the set of events includes a portion of raw data; receiving data indicating selection of a first event from among a first plurality of events and data indicating a selection of one or more portions of text within the raw data of the first event to be extracted as one or more fields; automatically determining an initial extraction rule that extracts the selected portions of text within the first event; causing display of a first interface providing tools that implement user modification of the extraction rule, including selecting a field from the one or more fields and: selecting one or more non-adjoining strings to concatenate with the selected field; selecting a portion of the selected field to be trimmed from the beginning or end of the selected field; or selecting sub-portions of text to extract from within the selected field. 9. The method of claim 1 , further including: receiving further data indicating a selection to save the extraction rule and field names for later use in processing events; and incorporating the saved extraction rule and field names in a data model that includes a late binding schema of extraction rules applied at search time. | 0.77965 |
8,959,427 | 15 | 16 | 15. A computer program product, comprising: a non-transitory computer-readable medium having computer-readable program instructions embodied therein that when executed by a computer cause the computer to generate JavaScript based HTML website layouts, the computer-readable program instructions comprising: computer-readable program instructions to receive a request to generate a website; computer-readable program instructions to generate a Hypertext Markup Language (HTML) website, wherein the HTML website comprises at least: a first HTML content block, wherein the first HTML content block comprises static HTML content and a first HTML identification code (ID), and at least one second HTML content block, wherein the second HTML content block comprises a second HTML ID; computer-readable program instructions to receive a request to move the static HTML content from the first HTML content block to the second HTML content block; computer-readable program instructions to input the first HTML ID of the first HTML content block as an origin of the static HTML content and the second HTML ID of the second HTML content block as a destination for the static HTML content; computer-readable program instructions to re-write the static HTML content from the origin HTML content block to the destination HTML content block, based on the HTML ID input; and computer-readable program instructions to remove the first HTML content block. | 15. A computer program product, comprising: a non-transitory computer-readable medium having computer-readable program instructions embodied therein that when executed by a computer cause the computer to generate JavaScript based HTML website layouts, the computer-readable program instructions comprising: computer-readable program instructions to receive a request to generate a website; computer-readable program instructions to generate a Hypertext Markup Language (HTML) website, wherein the HTML website comprises at least: a first HTML content block, wherein the first HTML content block comprises static HTML content and a first HTML identification code (ID), and at least one second HTML content block, wherein the second HTML content block comprises a second HTML ID; computer-readable program instructions to receive a request to move the static HTML content from the first HTML content block to the second HTML content block; computer-readable program instructions to input the first HTML ID of the first HTML content block as an origin of the static HTML content and the second HTML ID of the second HTML content block as a destination for the static HTML content; computer-readable program instructions to re-write the static HTML content from the origin HTML content block to the destination HTML content block, based on the HTML ID input; and computer-readable program instructions to remove the first HTML content block. 16. The computer program product of claim 15 , wherein the HTML website further comprises scripting language, wherein the scripting language comprises JavaScript functions in JavaScript computer code. | 0.719101 |
9,251,089 | 1 | 10 | 1. A method of facilitating memory access, said method comprising: providing a first partition within a system configuration, the first partition configured to support an operating system (OS) designed for a first address translation architecture, wherein configuration of the first partition to support the OS designed for the first address translation architecture is indicated in a configuration data structure, and wherein the first partition is not configured, as indicated in the configuration data structure, to support an OS designed for a second address translation architecture; and providing a second partition within the system configuration, the second partition configured to support the OS designed for the second address translation architecture, the second partition not configured to support the OS designed for the first address translation architecture, wherein the first address translation architecture is structurally different from the second address translation architecture, and wherein the first partition is a paravirtualized partition in which a guest of the first partition assists in handling address translation faults corresponding to host translations, and the second partition is a virtualized partition in which handling of address translation faults corresponding to host translations is independent of assistance from a guest of the second partition. | 1. A method of facilitating memory access, said method comprising: providing a first partition within a system configuration, the first partition configured to support an operating system (OS) designed for a first address translation architecture, wherein configuration of the first partition to support the OS designed for the first address translation architecture is indicated in a configuration data structure, and wherein the first partition is not configured, as indicated in the configuration data structure, to support an OS designed for a second address translation architecture; and providing a second partition within the system configuration, the second partition configured to support the OS designed for the second address translation architecture, the second partition not configured to support the OS designed for the first address translation architecture, wherein the first address translation architecture is structurally different from the second address translation architecture, and wherein the first partition is a paravirtualized partition in which a guest of the first partition assists in handling address translation faults corresponding to host translations, and the second partition is a virtualized partition in which handling of address translation faults corresponding to host translations is independent of assistance from a guest of the second partition. 10. The method of claim 1 , further comprising: identifying a page of memory that is the same in the first partition and the second partition; and removing the page from one of the first partition and the second partition, wherein the page that remains is shared by the first partition and the second partition. | 0.506349 |
9,256,639 | 1 | 4 | 1. A computer implemented method for efficiently planning and executing a SPARQL query, in any of the variants of the SPARQL query language, against a data source compliant with Resource Description Framework (RDF) standard, the method comprising: receiving a SPARQL query graph pattern; converting the SPARQL query to a semQA2 query and creating a semQA2 parse tree by replacing syntax expression in the SPARQL query with algebraic operators, wherein LeftJoin operators in the SPARQL query are not eliminated; performing filter pushdown on the semQA2 parse tree, including filters with LeftJoin operators, so as to produce filters as close to leaf nodes of the semQA2 parse tree as possible; executing a query planning mechanism that uses semQA2 algebraic equivalences and filter pushdown to find multiple graph patterns equivalent to the semQA2 query; executing a cost function that provides a cost of execution of each of the multiple graph patterns equivalent to the semQA2 query; determining an efficient query plan for execution of the semQA2 query, by selecting, from the multiple graph patterns equivalent to the semQA2 query, a particular graph pattern with lowest cost of execution, according to the cost function; and executing the particular graph pattern against a RDF data source and retrieving results compliant with the SPARQL specification. | 1. A computer implemented method for efficiently planning and executing a SPARQL query, in any of the variants of the SPARQL query language, against a data source compliant with Resource Description Framework (RDF) standard, the method comprising: receiving a SPARQL query graph pattern; converting the SPARQL query to a semQA2 query and creating a semQA2 parse tree by replacing syntax expression in the SPARQL query with algebraic operators, wherein LeftJoin operators in the SPARQL query are not eliminated; performing filter pushdown on the semQA2 parse tree, including filters with LeftJoin operators, so as to produce filters as close to leaf nodes of the semQA2 parse tree as possible; executing a query planning mechanism that uses semQA2 algebraic equivalences and filter pushdown to find multiple graph patterns equivalent to the semQA2 query; executing a cost function that provides a cost of execution of each of the multiple graph patterns equivalent to the semQA2 query; determining an efficient query plan for execution of the semQA2 query, by selecting, from the multiple graph patterns equivalent to the semQA2 query, a particular graph pattern with lowest cost of execution, according to the cost function; and executing the particular graph pattern against a RDF data source and retrieving results compliant with the SPARQL specification. 4. The method of claim 1 , wherein queries are performed against data sources modeled using Web Ontology Language (OWL). | 0.562044 |
7,594,172 | 1 | 19 | 1. A method of storing descriptive metatag-value pairs for parametized information regarding first and second items having differing classifications, comprising: providing a first electronic interface through which a first human user identifies the first item in a first document to a computer system; prompting the first user to select a first classification for the first item, wherein the first user selects the first classification for the first item; providing the first user with a first set of metatag choices determined at least in part by the first user's selection of the first classification; presenting the first user with: (a) the first set of metatag choices for possible association with the first item, and (b) candidate values for at least one of the metatag choices that allows the first user to define a first metatag-value pair; providing a second electronic interface through which the first user creates a new metatag for the first set of metatag choices which based on an analysis of a second document that includes the second item, is subsequently displayed in the first set of metatag choices to a second human user for the second user to utilize in entering a second metatag-value pair for possible association with the second item in the second document; and storing an association of the first item and the new metatag in a data structure. | 1. A method of storing descriptive metatag-value pairs for parametized information regarding first and second items having differing classifications, comprising: providing a first electronic interface through which a first human user identifies the first item in a first document to a computer system; prompting the first user to select a first classification for the first item, wherein the first user selects the first classification for the first item; providing the first user with a first set of metatag choices determined at least in part by the first user's selection of the first classification; presenting the first user with: (a) the first set of metatag choices for possible association with the first item, and (b) candidate values for at least one of the metatag choices that allows the first user to define a first metatag-value pair; providing a second electronic interface through which the first user creates a new metatag for the first set of metatag choices which based on an analysis of a second document that includes the second item, is subsequently displayed in the first set of metatag choices to a second human user for the second user to utilize in entering a second metatag-value pair for possible association with the second item in the second document; and storing an association of the first item and the new metatag in a data structure. 19. The method of claim 1 , further comprising activating an activation code to trigger display of the candidate values to the user. | 0.60479 |
9,396,263 | 1 | 5 | 1. A computer-implemented method comprising: receiving, at a server, an online question by an asking user from a user device of the asking user over a communications network; identifying, with the server, one or more topics of the received online question; matching, with the server, at least one canonical content item from a plurality of canonical content items to the received online question based on the identified one or more topics, wherein each canonical content item of the plurality of canonical content items includes a model explanation of a topic stored at the server, wherein each model explanation comprises an asked question portion and a corresponding answer portion, and wherein each canonical content item is based on a set of similar content items from a plurality of content items; providing, to the user device over the communications network, the asked question portion and the corresponding answer portion of the matched at least one canonical content item to the asking user; executing one or more clustering techniques over the plurality of content items to determine each set of similar content items, wherein the plurality of content items relates to user-submitted online questions and corresponding user-submitted online answers; compiling the plurality of canonical content items based on a curating process associated with one or more clusters of content items from each set of similar content items from the plurality of content items; and receiving a rating, by the asking user, for the matched at least one canonical content item, wherein the rating identifies the asking user's approval of the model explanation of the topic associated with the matched at least one canonical content item and is used as a factor in the curating process associated with one or more clusters of content items. | 1. A computer-implemented method comprising: receiving, at a server, an online question by an asking user from a user device of the asking user over a communications network; identifying, with the server, one or more topics of the received online question; matching, with the server, at least one canonical content item from a plurality of canonical content items to the received online question based on the identified one or more topics, wherein each canonical content item of the plurality of canonical content items includes a model explanation of a topic stored at the server, wherein each model explanation comprises an asked question portion and a corresponding answer portion, and wherein each canonical content item is based on a set of similar content items from a plurality of content items; providing, to the user device over the communications network, the asked question portion and the corresponding answer portion of the matched at least one canonical content item to the asking user; executing one or more clustering techniques over the plurality of content items to determine each set of similar content items, wherein the plurality of content items relates to user-submitted online questions and corresponding user-submitted online answers; compiling the plurality of canonical content items based on a curating process associated with one or more clusters of content items from each set of similar content items from the plurality of content items; and receiving a rating, by the asking user, for the matched at least one canonical content item, wherein the rating identifies the asking user's approval of the model explanation of the topic associated with the matched at least one canonical content item and is used as a factor in the curating process associated with one or more clusters of content items. 5. The method of claim 1 , wherein the at least one canonical content item comprises a video clip that presents the asked question portion and the corresponding answer portion. | 0.863777 |
9,265,931 | 1 | 4 | 1. An implantable responsive neurostimulator for treating a language disorder in a patient, comprising: at least one first electrode configured to be implanted in a first region of the patient's brain, the first region being related to the language disorder; at least one second electrode configured to be implanted in a second region of the patient's brain, the second region of the patient's brain for treating the language disorder; at least one third electrode configured to be implanted in a third region of the patient's brain for treating the language disorder, wherein the third region is different from both the first region and the second region; a detection subsystem coupled to the at least one first electrode, and configured to: continuously monitor one or more electrical signals sensed from the first region of the patient's brain during a selected period when the patient is experiencing a stage of sleep; detect in the one or more electrical signals an occurrence of a neurological event that causes a language disorder; and a therapy subsystem coupled to the at least one second electrode, and the at least one third electrode, and configured to, in response to a detection of an occurrence of a neurological event: apply neurostimulation through the at least one second electrode to the second region of the patient's brain; and apply neurostimulation through the at least one third electrode to the third region of the patient's brain. | 1. An implantable responsive neurostimulator for treating a language disorder in a patient, comprising: at least one first electrode configured to be implanted in a first region of the patient's brain, the first region being related to the language disorder; at least one second electrode configured to be implanted in a second region of the patient's brain, the second region of the patient's brain for treating the language disorder; at least one third electrode configured to be implanted in a third region of the patient's brain for treating the language disorder, wherein the third region is different from both the first region and the second region; a detection subsystem coupled to the at least one first electrode, and configured to: continuously monitor one or more electrical signals sensed from the first region of the patient's brain during a selected period when the patient is experiencing a stage of sleep; detect in the one or more electrical signals an occurrence of a neurological event that causes a language disorder; and a therapy subsystem coupled to the at least one second electrode, and the at least one third electrode, and configured to, in response to a detection of an occurrence of a neurological event: apply neurostimulation through the at least one second electrode to the second region of the patient's brain; and apply neurostimulation through the at least one third electrode to the third region of the patient's brain. 4. The neurostimulator of claim 1 , wherein the first region and the second region are substantially the same region. | 0.882056 |
9,984,065 | 13 | 17 | 13. A computer system for optimizing generation of a regular expression utilized for entity extraction, the computer system comprising: one or more processors, one or more computer readable memories, one or more computer readable storage media, and program instructions stored on the one or more storage media for execution by the one or more processors via the one or more memories, the program instructions comprising: a computer readable tangible storage device and program instructions stored on the computer readable tangible storage device, the program instructions include: program instructions to receive at a server, an input from a user of the server, the input enabling at least a first performance optimization parameter; program instructions to receive, from a user of a client computer, a query comprising a plain text word; program instructions to receive, at the server, data extracted from an electronic repository that is communicatively connected to the server, the data describing probabilities of spelling errors based, at least in part, on a number of syllables in the plain text word; program instructions to initialize, at the server, the first performance optimization parameter based, at least in part, on the received data and the input enabling at least the first performance optimization parameter; program instructions to optimize performance of generating the regular expression, at the server, by, at least in part, executing program instructions to identify, using the first performance optimization parameter, a syllable within the plain text word that has a high probability of at least one of an incorrectly substituted and transposed character within a spelling of a word having a same number of syllables as the plain text word; program instructions to select, at the server, a character in the syllable identified; program instructions to identify, at the server, a group of characters from a confusion matrix that are commonly confused with the character selected; program instructions to generate, at the server, a set of characters for the character selected, wherein the set of characters begins with the character selected followed by and ending with the group of characters from the confusion matrix; program instructions to determine, at the server, that a probability of omitting the character selected exceeds a threshold, and in response, associating, at the server, a tag with the set of characters; program instructions to generate, at the server, a regular expression by concatenating the set of characters with one or more additional sets of characters; program instructions to, based, at least in part, on the tag and the regular expression, search, at the server, the electronic repository for text data describing a spelling of the plain text word in which at least one of (i) the character selected and (ii) one or more characters of the group of characters from the confusion matrix is omitted; and program instructions to provide, to the user of the client computer, search results based on the regular expression. | 13. A computer system for optimizing generation of a regular expression utilized for entity extraction, the computer system comprising: one or more processors, one or more computer readable memories, one or more computer readable storage media, and program instructions stored on the one or more storage media for execution by the one or more processors via the one or more memories, the program instructions comprising: a computer readable tangible storage device and program instructions stored on the computer readable tangible storage device, the program instructions include: program instructions to receive at a server, an input from a user of the server, the input enabling at least a first performance optimization parameter; program instructions to receive, from a user of a client computer, a query comprising a plain text word; program instructions to receive, at the server, data extracted from an electronic repository that is communicatively connected to the server, the data describing probabilities of spelling errors based, at least in part, on a number of syllables in the plain text word; program instructions to initialize, at the server, the first performance optimization parameter based, at least in part, on the received data and the input enabling at least the first performance optimization parameter; program instructions to optimize performance of generating the regular expression, at the server, by, at least in part, executing program instructions to identify, using the first performance optimization parameter, a syllable within the plain text word that has a high probability of at least one of an incorrectly substituted and transposed character within a spelling of a word having a same number of syllables as the plain text word; program instructions to select, at the server, a character in the syllable identified; program instructions to identify, at the server, a group of characters from a confusion matrix that are commonly confused with the character selected; program instructions to generate, at the server, a set of characters for the character selected, wherein the set of characters begins with the character selected followed by and ending with the group of characters from the confusion matrix; program instructions to determine, at the server, that a probability of omitting the character selected exceeds a threshold, and in response, associating, at the server, a tag with the set of characters; program instructions to generate, at the server, a regular expression by concatenating the set of characters with one or more additional sets of characters; program instructions to, based, at least in part, on the tag and the regular expression, search, at the server, the electronic repository for text data describing a spelling of the plain text word in which at least one of (i) the character selected and (ii) one or more characters of the group of characters from the confusion matrix is omitted; and program instructions to provide, to the user of the client computer, search results based on the regular expression. 17. The computer system of claim 13 , wherein the program instructions to identify the group of characters comprise program instructions to search the confusion matrix for three characters most commonly confused with the character selected and program instructions to search the confusion matrix for a percentage of characters commonly confused with the character selected. | 0.623232 |
7,640,232 | 29 | 40 | 29. A search enhancement system implemented across a network, comprising: a search engine having access to a content source; an application module; at least one ratings service that is external to the application module, to the search engine, and to the content source, wherein the ratings service is accessible to the application module across the network, the ratings service comprising any of a secondary source and a supplementary source comprising rating information; a receipt at the application module from a user at a user terminal of a specification by the user of at least one of the ratings services; a receipt at the application module of a search query entered by the user at the user terminal, the search query comprising at least one search parameter specified by the user; a data query sent by the application module over the network, upon receipt of the specification by the user of the ratings services, to the user-specified ratings services; a receipt of rating information at the application module from at least one of the user-specified ratings services over the network in response to the sent data query, wherein the rating information is independently maintained by the at least one ratings service; a refined search provided through the application module, wherein the refinement comprises any of at the application module, using the received rating information from at least one of the user-specified ratings services in conjunction with the search parameters received from the user to perform the search at the search engine through retrieval of content from the content source, wherein search results received from the search engine at the application module comply with both the search parameters received from the user and the received rating information from the user-specified ratings services; performing the search at the search engine through retrieval of content from the content source with the search parameters received from the user and subsequently filtering search results received from the search engine at the application module with the received rating information from at least one of the user-specified ratings services, and performing the search at the search engine through retrieval of content from the content source with the search parameters received from the user and subsequently providing any of organizing and sorting of the search results received from the search engine at the application module with the received rating information from at least one of the user-specified ratings services; and a return of the results of the refined search from the application module to any of the user at the user terminal and a recipient at a recipient terminal, the recipient other than the user. | 29. A search enhancement system implemented across a network, comprising: a search engine having access to a content source; an application module; at least one ratings service that is external to the application module, to the search engine, and to the content source, wherein the ratings service is accessible to the application module across the network, the ratings service comprising any of a secondary source and a supplementary source comprising rating information; a receipt at the application module from a user at a user terminal of a specification by the user of at least one of the ratings services; a receipt at the application module of a search query entered by the user at the user terminal, the search query comprising at least one search parameter specified by the user; a data query sent by the application module over the network, upon receipt of the specification by the user of the ratings services, to the user-specified ratings services; a receipt of rating information at the application module from at least one of the user-specified ratings services over the network in response to the sent data query, wherein the rating information is independently maintained by the at least one ratings service; a refined search provided through the application module, wherein the refinement comprises any of at the application module, using the received rating information from at least one of the user-specified ratings services in conjunction with the search parameters received from the user to perform the search at the search engine through retrieval of content from the content source, wherein search results received from the search engine at the application module comply with both the search parameters received from the user and the received rating information from the user-specified ratings services; performing the search at the search engine through retrieval of content from the content source with the search parameters received from the user and subsequently filtering search results received from the search engine at the application module with the received rating information from at least one of the user-specified ratings services, and performing the search at the search engine through retrieval of content from the content source with the search parameters received from the user and subsequently providing any of organizing and sorting of the search results received from the search engine at the application module with the received rating information from at least one of the user-specified ratings services; and a return of the results of the refined search from the application module to any of the user at the user terminal and a recipient at a recipient terminal, the recipient other than the user. 40. The system of claim 29 , wherein at least one of the identified ratings services specified by the user comprises one of the received search parameters. | 0.812349 |
9,626,162 | 9 | 10 | 9. A non-transitory computer-readable medium storing computer-executable instructions, the medium comprising: instructions for displaying a graphical user interface (GUI) for editing components of a virtual instrument panel, the GUI including a panel layout area, a program dialog area, and an Input/Output (I/O) device library area, the panel layout area including one or more icons representing the components of the virtual instrument panel, the components of the virtual instrument panel associated with respective sections of code in a textual language program for executing the components of the virtual instrument panel, and including a first component represented by a first icon in the panel layout area that corresponds with a first section of code, the program dialog area displaying at least a portion of the textual language program, and the I/O device library area including I/O device icons representing interfaces to data sources; instructions for receiving through the GUI a user selection of an editing operation for the first section of code; instructions for performing the editing operation for the first section of code during an execution of the components of the virtual instrument panel; instructions for programmatically performing a synchronized operation on the first icon in the panel layout area that corresponds to the editing operation for the first section of code in response to performing the editing operation, the synchronized operation performed on the first icon during the execution of the components of the virtual instrument panel; instruction for programmatically adding a second section of code associated with a first I/O device icon to the program dialog area, in response to moving the first I/O device icon from the I/O device library area to the panel layout area; and instructions for programmatically adding a third second of code associated with a second I/O device icon to the program dialog area, in response to moving the second I/O device icon from the I/O device library area to the panel layout area, wherein the first and second I/O device icons are different, and the data sources include one or more of a physical data acquisition board, a physical instrument, or a memory location external to the data processing device. | 9. A non-transitory computer-readable medium storing computer-executable instructions, the medium comprising: instructions for displaying a graphical user interface (GUI) for editing components of a virtual instrument panel, the GUI including a panel layout area, a program dialog area, and an Input/Output (I/O) device library area, the panel layout area including one or more icons representing the components of the virtual instrument panel, the components of the virtual instrument panel associated with respective sections of code in a textual language program for executing the components of the virtual instrument panel, and including a first component represented by a first icon in the panel layout area that corresponds with a first section of code, the program dialog area displaying at least a portion of the textual language program, and the I/O device library area including I/O device icons representing interfaces to data sources; instructions for receiving through the GUI a user selection of an editing operation for the first section of code; instructions for performing the editing operation for the first section of code during an execution of the components of the virtual instrument panel; instructions for programmatically performing a synchronized operation on the first icon in the panel layout area that corresponds to the editing operation for the first section of code in response to performing the editing operation, the synchronized operation performed on the first icon during the execution of the components of the virtual instrument panel; instruction for programmatically adding a second section of code associated with a first I/O device icon to the program dialog area, in response to moving the first I/O device icon from the I/O device library area to the panel layout area; and instructions for programmatically adding a third second of code associated with a second I/O device icon to the program dialog area, in response to moving the second I/O device icon from the I/O device library area to the panel layout area, wherein the first and second I/O device icons are different, and the data sources include one or more of a physical data acquisition board, a physical instrument, or a memory location external to the data processing device. 10. The computer-readable medium of claim 9 , wherein the instructions for receiving through the GUI a user selection of an editing operation for the first section of code comprise: instructions for receiving a user selection of a deletion operation for the first section of code, further wherein the instructions for programmatically performing a synchronized operation on the first icon in the panel layout area comprise: instructions for deleting the first icon in the panel layout area. | 0.536862 |
8,214,421 | 17 | 28 | 17. A conformance testing system, comprising: a sequence verifier stored in a non-transitory computer-readable medium; and a processor configured to execute instructions stored in the medium that cause the sequence verifier to: receive a plurality of messages exchanged between two or more participants; and test conformance of each of the plurality of messages to a specific markup language standard without using a reference implementation of the markup language standard; wherein the sequence verifier is a single module that is distinct from the two or more participants; wherein the plurality of messages comprise a first message sent from a first participant of the two or more participants to a second participant of the two or more participants and a second message sent from the second participant of the two or more participants to the first participant of the two or more participants, forming a sequence; wherein testing conformance comprises: comparing the first message in the sequence of messages exchanged between the first participant and the second participant to a valid sequence in a protocol verification graph to test conformance of the first message; and comparing the second message in the sequence of messages exchanged between the first participant and the second participant to a valid sequence in the protocol verification graph to test conformance of the second message, the sequence verifier verifying that the first message and second message conform to an appropriate message type based on a standard schema and were exchanged in a correct order based on the protocol verification graph; wherein the protocol verification graph describes constraints on a message including message sequence constraints and message type constraints, the protocol verification graph being created by analyzing an Extensible Markup Language (XML) standards specification. | 17. A conformance testing system, comprising: a sequence verifier stored in a non-transitory computer-readable medium; and a processor configured to execute instructions stored in the medium that cause the sequence verifier to: receive a plurality of messages exchanged between two or more participants; and test conformance of each of the plurality of messages to a specific markup language standard without using a reference implementation of the markup language standard; wherein the sequence verifier is a single module that is distinct from the two or more participants; wherein the plurality of messages comprise a first message sent from a first participant of the two or more participants to a second participant of the two or more participants and a second message sent from the second participant of the two or more participants to the first participant of the two or more participants, forming a sequence; wherein testing conformance comprises: comparing the first message in the sequence of messages exchanged between the first participant and the second participant to a valid sequence in a protocol verification graph to test conformance of the first message; and comparing the second message in the sequence of messages exchanged between the first participant and the second participant to a valid sequence in the protocol verification graph to test conformance of the second message, the sequence verifier verifying that the first message and second message conform to an appropriate message type based on a standard schema and were exchanged in a correct order based on the protocol verification graph; wherein the protocol verification graph describes constraints on a message including message sequence constraints and message type constraints, the protocol verification graph being created by analyzing an Extensible Markup Language (XML) standards specification. 28. The conformance testing system of claim 17 , wherein the sequence verifier is to passively monitor the plurality of messages exchanged between the two or more participants. | 0.771429 |
9,369,581 | 6 | 7 | 6. A system belonging to a recipient of a voicemail message, the system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: transcribing a voicemail message, to yield a transcription; indexing the transcription to yield an indexed transcription; adding the indexed transcription to a transcription index associated with transcripts of a plurality of voicemail messages; receiving, via a graphical user interface on the system, a query from a recipient of the voicemail message; displaying, using the transcription index and the graphical user interface, portions of the plurality of voicemail messages related to the query, to yield identified portions; generating a speech file stored on a computer system, the speech file comprising the identified portions, wherein the speech file comprises the identified portions in both a textual format and an audible format; and communicating the speech file as an attachment to a device via email, the device being used by a second user different from the recipient. | 6. A system belonging to a recipient of a voicemail message, the system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: transcribing a voicemail message, to yield a transcription; indexing the transcription to yield an indexed transcription; adding the indexed transcription to a transcription index associated with transcripts of a plurality of voicemail messages; receiving, via a graphical user interface on the system, a query from a recipient of the voicemail message; displaying, using the transcription index and the graphical user interface, portions of the plurality of voicemail messages related to the query, to yield identified portions; generating a speech file stored on a computer system, the speech file comprising the identified portions, wherein the speech file comprises the identified portions in both a textual format and an audible format; and communicating the speech file as an attachment to a device via email, the device being used by a second user different from the recipient. 7. The system of claim 6 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising instructing a sound speaker to audibly present the speech file to the device. | 0.5 |
8,180,788 | 5 | 6 | 5. The Internet infrastructure of claim 4 , wherein the processor is configured to respond to the clicking of the ‘next’ button by delivering a next search result page. | 5. The Internet infrastructure of claim 4 , wherein the processor is configured to respond to the clicking of the ‘next’ button by delivering a next search result page. 6. The Internet infrastructure of claim 5 , wherein the next search result page comprising subsequent few of the selected images based upon the search string and subsequent few of the selected images based upon the search image. | 0.5 |
8,868,648 | 10 | 11 | 10. A non-transitory computer readable medium having stored thereon instructions which when executed by a processor cause the processor to perform the method of: receiving at a server a relational database query from an application running on a client computer coupled to an electronic communication network; parsing by a parsing engine the relational database query; creating an execution plan based on the results of the parsing step; transmitting an opendata query to an opendata provider coupled to the electronic communication network, the opendata query including at least a portion of the execution plan; retrieving, at the server, document metadata from the opendata provider; building an internal model of the document metadata; mapping content of at least one opendata entity data model located at the opendata provider and the document metadata to at least one relational model catalog; transforming at the server a response from the opendata provider into a relational format; and providing the transformed response to the client computer application. | 10. A non-transitory computer readable medium having stored thereon instructions which when executed by a processor cause the processor to perform the method of: receiving at a server a relational database query from an application running on a client computer coupled to an electronic communication network; parsing by a parsing engine the relational database query; creating an execution plan based on the results of the parsing step; transmitting an opendata query to an opendata provider coupled to the electronic communication network, the opendata query including at least a portion of the execution plan; retrieving, at the server, document metadata from the opendata provider; building an internal model of the document metadata; mapping content of at least one opendata entity data model located at the opendata provider and the document metadata to at least one relational model catalog; transforming at the server a response from the opendata provider into a relational format; and providing the transformed response to the client computer application. 11. The non-transitory computer readable medium of claim 10 , further including executable instructions to cause a processor to perform the step of mapping content of at least one opendata entity data model located at the opendata provider to at least one relational model catalog. | 0.592754 |
7,584,421 | 20 | 25 | 20. A method implemented by a client in a broadcasting system for managing metadata for multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving in the client from a provider in the broadcasting system a first version of an electronic document containing metadata related to the scheduled multimedia program content, wherein the electronic document has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment located above a first version of a lower fragment, and wherein the first version of the lower fragment is identified by a version identifier; storing the first version of the lower fragment in a local data structure of the client, wherein the local data structure is based on the prescribed syntax and corresponds to the electronic document; requesting an update for the previously received lower fragment in the client; and in response to the request, receiving in the client an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies the version identifier of the earlier version of the lower fragment. | 20. A method implemented by a client in a broadcasting system for managing metadata for multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving in the client from a provider in the broadcasting system a first version of an electronic document containing metadata related to the scheduled multimedia program content, wherein the electronic document has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment located above a first version of a lower fragment, and wherein the first version of the lower fragment is identified by a version identifier; storing the first version of the lower fragment in a local data structure of the client, wherein the local data structure is based on the prescribed syntax and corresponds to the electronic document; requesting an update for the previously received lower fragment in the client; and in response to the request, receiving in the client an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies the version identifier of the earlier version of the lower fragment. 25. The method of claim 20 , wherein the lower fragment is in XML format. | 0.804813 |
8,595,022 | 10 | 13 | 10. A method, comprising: selecting a potential reviewer to target with a review request based at least in part on a determination that a reputation of a business will be improved in the event that the potential reviewer creates a review for the business on a review site; facilitating a transmission of the review request to the potential reviewer; determining, using a processor, that the potential reviewer has not, subsequent to the transmission, created a review for the business on the review site, wherein the determining includes accessing the review site and identifying a lack of a review of the business by the potential reviewer; and determining a follow-up action to take regarding the review request to the potential reviewer. | 10. A method, comprising: selecting a potential reviewer to target with a review request based at least in part on a determination that a reputation of a business will be improved in the event that the potential reviewer creates a review for the business on a review site; facilitating a transmission of the review request to the potential reviewer; determining, using a processor, that the potential reviewer has not, subsequent to the transmission, created a review for the business on the review site, wherein the determining includes accessing the review site and identifying a lack of a review of the business by the potential reviewer; and determining a follow-up action to take regarding the review request to the potential reviewer. 13. The method of claim 10 wherein determining the follow-up action includes determining a timing of the follow-up action. | 0.616352 |
9,805,006 | 11 | 18 | 11. A system for loading a web page, comprising: one or more processors and memory configured to: provide, via a computer network and to a computing device having one or more processors, a script configured for loading with a web page, the web page configured for display on the computing device, the script having a plurality of function definitions and configured for asynchronous loading such that the web page is operable while the script is loaded; receive an indication of a user interaction with the web page prior to complete loading of the plurality of function definitions on the web page; determine that the user interaction corresponds to a function definition of the plurality of function definitions that has not been loaded; subsequent to determining that the user interaction corresponds to the function definition that has not been loaded: instruct, using a variable, the computing device to queue a command string corresponding to the function definition; determine that the function has been loaded and instruct the computing device to retrieve the command string from the variable; and instruct the computing device to execute the function definition corresponding to the command string. | 11. A system for loading a web page, comprising: one or more processors and memory configured to: provide, via a computer network and to a computing device having one or more processors, a script configured for loading with a web page, the web page configured for display on the computing device, the script having a plurality of function definitions and configured for asynchronous loading such that the web page is operable while the script is loaded; receive an indication of a user interaction with the web page prior to complete loading of the plurality of function definitions on the web page; determine that the user interaction corresponds to a function definition of the plurality of function definitions that has not been loaded; subsequent to determining that the user interaction corresponds to the function definition that has not been loaded: instruct, using a variable, the computing device to queue a command string corresponding to the function definition; determine that the function has been loaded and instruct the computing device to retrieve the command string from the variable; and instruct the computing device to execute the function definition corresponding to the command string. 18. The system of claim 11 , wherein the one or more processors are further configured to: determine values of the one or more parameters; and insert the values and a corresponding command string in the variable. | 0.5 |
9,211,891 | 1 | 15 | 1. A method of facilitating a user driving a vehicle, the method involving a device having a processor and comprising: executing on the processor instructions configured to: at a first time point associated with a first instance of a driving context, monitor a vehicle control input of the vehicle by the user to identify a user driving behavior of the user in the driving context; identify at least one alternative driving behavior providing an advantage over the user driving behavior of the user for operating the vehicle in the driving context; identify a suggestion location that is associated with at least one alternate driving behavior; and at a second time point that is associated with a second instance of the driving context and at the suggestion location, present to the user a driving suggestion of the alternative driving behavior in the driving context. | 1. A method of facilitating a user driving a vehicle, the method involving a device having a processor and comprising: executing on the processor instructions configured to: at a first time point associated with a first instance of a driving context, monitor a vehicle control input of the vehicle by the user to identify a user driving behavior of the user in the driving context; identify at least one alternative driving behavior providing an advantage over the user driving behavior of the user for operating the vehicle in the driving context; identify a suggestion location that is associated with at least one alternate driving behavior; and at a second time point that is associated with a second instance of the driving context and at the suggestion location, present to the user a driving suggestion of the alternative driving behavior in the driving context. 15. The method of claim 1 , the instructions further configured to, upon detecting a declinement by the user of the driving suggestion in the driving context, refrain from subsequently presenting the driving suggestion to the user in the driving context. | 0.730932 |
8,082,246 | 13 | 17 | 13. A system for ranking search results, the system comprising a computing device operating a search engine thereon, the search engine including computer-executable instructions, which when executed by the computing device cause the computing device to: record document and link information for documents on a network; generate a representation of the network from the document and link information, wherein the representation of the network includes nodes that represent the documents, the nodes including at least two high authority nodes and other nodes; assign to each high authority node a click distance value set by an administrator; set initial click distance values of the other nodes to a predetermined value; compute click distance values for the other nodes, the click distance values for each of the other nodes being a number of the links traversed on a shortest path to a closest of the high authority nodes; and rank search results using the click distance values of the high authority nodes and the other nodes as a query-independent relevance measure. | 13. A system for ranking search results, the system comprising a computing device operating a search engine thereon, the search engine including computer-executable instructions, which when executed by the computing device cause the computing device to: record document and link information for documents on a network; generate a representation of the network from the document and link information, wherein the representation of the network includes nodes that represent the documents, the nodes including at least two high authority nodes and other nodes; assign to each high authority node a click distance value set by an administrator; set initial click distance values of the other nodes to a predetermined value; compute click distance values for the other nodes, the click distance values for each of the other nodes being a number of the links traversed on a shortest path to a closest of the high authority nodes; and rank search results using the click distance values of the high authority nodes and the other nodes as a query-independent relevance measure. 17. The system of claim 13 , wherein ranking search results using the click distance values of the high authority nodes and the other nodes as a query-independent relevance measure further comprises using a component corresponding to the click distance in a scoring function for determining a relevance score for each of the documents. | 0.5 |
9,542,443 | 13 | 19 | 13. A method comprising: receiving a query that involves a database operation and one or more other operations; in response to receiving the query: processing, by a microprocessor, the one or more other operations; sending, to a coprocessor that is different than the microprocessor, a database operation command that corresponds to the database operation and that is associated with one or more values; processing, by the coprocessor, the database operation command by: performing a comparison between input data that is referenced by the query and the one or more values that are associated with the database operation command; generating result data based on the comparison; causing the result data to be stored. | 13. A method comprising: receiving a query that involves a database operation and one or more other operations; in response to receiving the query: processing, by a microprocessor, the one or more other operations; sending, to a coprocessor that is different than the microprocessor, a database operation command that corresponds to the database operation and that is associated with one or more values; processing, by the coprocessor, the database operation command by: performing a comparison between input data that is referenced by the query and the one or more values that are associated with the database operation command; generating result data based on the comparison; causing the result data to be stored. 19. The method of claim 13 , wherein causing the result data to be stored further comprises causing, to be stored, a completion status that indicates that the database operation command has been performed. | 0.811581 |
8,887,047 | 29 | 32 | 29. Non-transitory machine readable media that stores executable instructions, which, when executed by the one or more processing devices, are configured to cause the one or more processing devices to perform operations comprising: providing for display on a terminal a learning content input user interface configured to receive learning content; receiving learning content via the learning content input user interface and storing the received learning content in machine readable memory; providing for display on the terminal a framework user interface configured to receive a framework definition, wherein the framework definition defines an order of presentation to a learner with respect to learning content; receiving, independently of the received learning content, a framework definition via the framework user interface and storing the received framework definition in machine readable memory, wherein the framework definition specifies a presentation flow; providing for display on the terminal a style set user interface configured to receive a style definition, wherein the style definition defines an appearance of learning content, wherein the style set user interface enables the user to select from a plurality of protocols, including at least a version of HTML and a non-HTML protocol, which protocol is to be used in packaging rendered merged learning content and framework definition; receiving the style set definition via the style set user interface and storing the received style set definition in machine readable memory; providing for display on the terminal a protocol user interface configured to receive a protocol selection; receiving, independently of the received learning content, the protocol selection via the protocol user interface; receiving from the user a publishing instruction via a publishing user interface; at least partly in response to the received publishing instruction, accessing from machine readable memory the received learning content, the received framework definition, the received style set definition, and the received protocol selection: merging the received learning content and the received framework definition; rendering the merged the received learning content and the received framework definition in accordance with the received style set definition; and packaging the rendered merged learning content and framework definition in accordance with the selected protocol to provide a published learning document. | 29. Non-transitory machine readable media that stores executable instructions, which, when executed by the one or more processing devices, are configured to cause the one or more processing devices to perform operations comprising: providing for display on a terminal a learning content input user interface configured to receive learning content; receiving learning content via the learning content input user interface and storing the received learning content in machine readable memory; providing for display on the terminal a framework user interface configured to receive a framework definition, wherein the framework definition defines an order of presentation to a learner with respect to learning content; receiving, independently of the received learning content, a framework definition via the framework user interface and storing the received framework definition in machine readable memory, wherein the framework definition specifies a presentation flow; providing for display on the terminal a style set user interface configured to receive a style definition, wherein the style definition defines an appearance of learning content, wherein the style set user interface enables the user to select from a plurality of protocols, including at least a version of HTML and a non-HTML protocol, which protocol is to be used in packaging rendered merged learning content and framework definition; receiving the style set definition via the style set user interface and storing the received style set definition in machine readable memory; providing for display on the terminal a protocol user interface configured to receive a protocol selection; receiving, independently of the received learning content, the protocol selection via the protocol user interface; receiving from the user a publishing instruction via a publishing user interface; at least partly in response to the received publishing instruction, accessing from machine readable memory the received learning content, the received framework definition, the received style set definition, and the received protocol selection: merging the received learning content and the received framework definition; rendering the merged the received learning content and the received framework definition in accordance with the received style set definition; and packaging the rendered merged learning content and framework definition in accordance with the selected protocol to provide a published learning document. 32. The media as defined in claim 29 , wherein the framework user interface includes editable fields configured to receive a sequence specification, a framework name, a repeat specification, and a layer specification. | 0.807965 |
8,631,116 | 5 | 6 | 5. The website performance monitoring system of claim 1 wherein the performance module includes a business module configured to generate pixels and facilitate management of websites, wherein the generation of pixels comprises generating pixel code to be placed on website pages. | 5. The website performance monitoring system of claim 1 wherein the performance module includes a business module configured to generate pixels and facilitate management of websites, wherein the generation of pixels comprises generating pixel code to be placed on website pages. 6. The website performance monitoring system of claim 5 wherein assigning site metric attributes to a single pixel on a page within the website comprises performing at least one of the following, creating a pixel, adding a pixel, and modifying a pixel. | 0.5 |
10,101,977 | 1 | 3 | 1. A system to interface between two computer processing units to execute a program, the system comprising: a first processing unit device executing commands in a first programming language; a second processing unit device executing commands in a second programming language that is distinct from the first programming language; a command processor accessible to the first processing unit device and the second processing unit device, the command processor managing jobs from the program for processing by the first processing unit device or the second processing unit device, the command processor creating commands from the jobs in a state free command format, the command processor generating a first sequence of commands for execution by the first processing unit device and a second sequence of commands for execution by the second processing unit device in the command format; a data compiler running a meta language to convert program data for the commands into a first data format usable by a first compiler for the first programming language and readable by the first programming language and a second data format usable by a second compiler for the second programming language and readable by the second programming language; and a transfer memory accessible by the first processing unit device and the second processing unit device, the transfer memory storing resources for the commands including the program data generated by one of the first processing unit device or the second processing unit device and consumed by the other of the first processing unit device or the second processing unit device, the commands created by the command processor requiring asynchronous communication between the first processing unit device and the second processing unit device. | 1. A system to interface between two computer processing units to execute a program, the system comprising: a first processing unit device executing commands in a first programming language; a second processing unit device executing commands in a second programming language that is distinct from the first programming language; a command processor accessible to the first processing unit device and the second processing unit device, the command processor managing jobs from the program for processing by the first processing unit device or the second processing unit device, the command processor creating commands from the jobs in a state free command format, the command processor generating a first sequence of commands for execution by the first processing unit device and a second sequence of commands for execution by the second processing unit device in the command format; a data compiler running a meta language to convert program data for the commands into a first data format usable by a first compiler for the first programming language and readable by the first programming language and a second data format usable by a second compiler for the second programming language and readable by the second programming language; and a transfer memory accessible by the first processing unit device and the second processing unit device, the transfer memory storing resources for the commands including the program data generated by one of the first processing unit device or the second processing unit device and consumed by the other of the first processing unit device or the second processing unit device, the commands created by the command processor requiring asynchronous communication between the first processing unit device and the second processing unit device. 3. The system of claim 1 , wherein the first processing unit device is a central processing unit (CPU) device and the second processing unit device is a graphics processing unit (GPU) device. | 0.801455 |
9,632,985 | 4 | 5 | 4. The system of claim 3 , wherein: subsequent to the interactive analysis module generating the report, sending the report to the execution environment of the electronic reading device that sent the assessment data. | 4. The system of claim 3 , wherein: subsequent to the interactive analysis module generating the report, sending the report to the execution environment of the electronic reading device that sent the assessment data. 5. The system of claim 4 , wherein the report includes information relating to a test performance of a user of the electronic reading device that sent the assessment data as well as information relating to a test performance of a further user of a further electronic reading device. | 0.5 |
6,073,095 | 1 | 9 | 1. A fast vocabulary independent method for spotting words in speech comprising the steps of: converting a speech waveform into a representation comprising phone-ngrams and a corresponding time interval of occurrence of each of the phone-ngrams; receiving phone-ngrams of at least one input word; performing a coarse match by selecting time intervals of the speech waveform having phone-ngrams that correspond to the phone-ngrams of the at least one input word; and performing a detailed acoustic match at the selected time intervals. | 1. A fast vocabulary independent method for spotting words in speech comprising the steps of: converting a speech waveform into a representation comprising phone-ngrams and a corresponding time interval of occurrence of each of the phone-ngrams; receiving phone-ngrams of at least one input word; performing a coarse match by selecting time intervals of the speech waveform having phone-ngrams that correspond to the phone-ngrams of the at least one input word; and performing a detailed acoustic match at the selected time intervals. 9. The method according to claim 1, wherein said step of receiving phone-ngrams of at least one input word comprises the steps of: determining a phonetic baseform of the at least one input word; and identifying all phone-ngrams of the phonetic baseform. | 0.764432 |
9,710,435 | 49 | 50 | 49. The apparatus of claim 1 and wherein the user interface comprises a display device, and the library of object types comprises a space object which is defined by a space object width, to allow a user to vertically align objects in the mathematical expression when the mathematical expression is displayed on the display device. | 49. The apparatus of claim 1 and wherein the user interface comprises a display device, and the library of object types comprises a space object which is defined by a space object width, to allow a user to vertically align objects in the mathematical expression when the mathematical expression is displayed on the display device. 50. The apparatus of claim 49 and wherein the series of computer-executable instructions include a series of steps to provide a visual cue on the display device to indicate an extent of the space object. | 0.5 |
9,711,056 | 8 | 18 | 8. The personal emotion-based cognitive assistant system of claim 3 , wherein the system is a headset worn by a user providing sensory cognitive memory when the user observes the synchronized visual and audio information and providing the instinct emotional signals for the system when the user observes a display of the output mechanism. | 8. The personal emotion-based cognitive assistant system of claim 3 , wherein the system is a headset worn by a user providing sensory cognitive memory when the user observes the synchronized visual and audio information and providing the instinct emotional signals for the system when the user observes a display of the output mechanism. 18. The personal emotion-based cognitive assistant of claim 8 , further comprising: a display which displays visual and audio data, wherein the processor is further configured to identify personal meaning of said displayed visual and audio data and in response to the identified personal meaning, to retrieve correlated cognitive information from the memory, wherein the display is further configured to further display the retrieved correlated cognitive information, and wherein the processor is further configured to gather, verify, and process the displayed output cognitive information, and in response to the cognitive information being verified, controlling the memory to store the results in one of the plurality of distinct memory areas. | 0.5 |
9,002,854 | 1 | 8 | 1. A computer-implemented method for searching data, the method comprising: gathering, using a computing device, a stream of data from an information processing environment; separating the stream of data into a plurality of events, each event including a respective portion of the stream of data; for each event of the plurality of events, determining an associated time stamp representing a time for the event; wherein determining the associated time stamp for an event of the plurality of events comprises time information to use in the time stamp from known times corresponding to portions of the stream of data surrounding the portion of the stream of data included in the event; assigning each event of the plurality of events to a bucket having an associated time range that includes the time represented by the time stamp for the event; receiving a search query that includes a time criterion and a second criterion for selection of events, the second criterion relating to a segment within the events, the segment identified by an extraction rule for extracting a subportion of data from the portion of the stream of data included in an event, the extraction rule using a pattern to identify boundaries of the subportion of data being extracted; identifying one or more buckets that each have an associated time range, at least one time in each associated time range satisfying the time criterion; based on examining events only in the identified one or more buckets, identifying a set of events that match the time criterion and have a segment that matches the second criterion; determining a result based on the set of events; and causing the result to be displayed. | 1. A computer-implemented method for searching data, the method comprising: gathering, using a computing device, a stream of data from an information processing environment; separating the stream of data into a plurality of events, each event including a respective portion of the stream of data; for each event of the plurality of events, determining an associated time stamp representing a time for the event; wherein determining the associated time stamp for an event of the plurality of events comprises time information to use in the time stamp from known times corresponding to portions of the stream of data surrounding the portion of the stream of data included in the event; assigning each event of the plurality of events to a bucket having an associated time range that includes the time represented by the time stamp for the event; receiving a search query that includes a time criterion and a second criterion for selection of events, the second criterion relating to a segment within the events, the segment identified by an extraction rule for extracting a subportion of data from the portion of the stream of data included in an event, the extraction rule using a pattern to identify boundaries of the subportion of data being extracted; identifying one or more buckets that each have an associated time range, at least one time in each associated time range satisfying the time criterion; based on examining events only in the identified one or more buckets, identifying a set of events that match the time criterion and have a segment that matches the second criterion; determining a result based on the set of events; and causing the result to be displayed. 8. The method of claim 1 , further comprising determining a rule used for separating the stream of data into the plurality of events, wherein the determination of the rule is based on one or more of: a source of the stream of data, a domain of the stream of data, a type of the stream of data, a signature of the stream of data, a punctuation analysis of the stream of data, or an analysis of repeating patterns within the stream of data. | 0.534043 |
7,574,664 | 1 | 3 | 1. In an electronic device having a processor and a display depicting a plurality of onscreen objects, a method for repositioning text portions, including the steps of: floating a mouse cursor over a text object before any mouse click is placed in the text object, and changing the floating mouse cursor into a predetermined cursor shape that indicates a text repositioning function is being carried out; determining the position of the mouse cursor such that: if the floating cursor is over a paragraph, the paragraph is moved the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the paragraph; if the floating cursor is over the top of a line, the line is moved the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the line; if the floating cursor is over the left side of a line, the individual left indent of said line is adjusted the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the left side of the line. | 1. In an electronic device having a processor and a display depicting a plurality of onscreen objects, a method for repositioning text portions, including the steps of: floating a mouse cursor over a text object before any mouse click is placed in the text object, and changing the floating mouse cursor into a predetermined cursor shape that indicates a text repositioning function is being carried out; determining the position of the mouse cursor such that: if the floating cursor is over a paragraph, the paragraph is moved the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the paragraph; if the floating cursor is over the top of a line, the line is moved the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the line; if the floating cursor is over the left side of a line, the individual left indent of said line is adjusted the same amount as the cursor when a click-and-drag movement of the cursor is delivered to the left side of the line. 3. In the method for repositioning text portions by click-and drag inputs of claim 1 , further including the step that if the floating cursor is over the top of a line, first change the floating cursor into a vertical arrow shape and store which line it is over. | 0.514815 |
5,384,702 | 1 | 23 | 1. A method performed by a computer means for changing a grammatically incorrect sentence that has been pre-translated from a source language into a grammatically correct sentence in a target language, comprising the steps of: storing a plurality of unique grammar markers in a first database and associating each unique grammar marker with a unique grammar rule; storing a plurality of unique grammar marker patterns in a second database and associating each unique grammar marker pattern with a unique self-correction rule; inputting a pre-translated sentence that may have grammatical errors therein into a raw translation buffer; pre-identifying grammar markers in said pre-translated sentence, each grammar marker being associated with a word which may have grammatical variations in said target language but not in said source language; scanning said pre-translated sentence to identify a grammar marker or a plurality of grammar markers, if any, and a grammar marker pattern or a plurality of grammar maker patterns, if any, in said pre-translated sentence; providing a key match buffer for temporary storage of data; inputting any identified grammar marker into said key match buffer; providing a pattern match buffer for temporary storage of data; inputting any identified grammar marker pattern into said pattern match buffer, providing a correction scheme means in said computer means for retrieving appropriate grammar rules and self-correction rules from said first and second databases, respectively, and for making appropriate corrections to generate a substantially grammatically correct sentence; interconnecting a first plurality of logic gates between said correction scheme means and said first database and between said correction scheme means and said key match buffer; comparing the grammar markers in the key match buffer with the grammar markers in the first database and opening said first plurality of logic gates when a match of grammar rules is made; inputting grammar rules fetched from said first database into said correction scheme means when said first plurality of logic gates is enabled; interconnecting a second plurality of logic gates between said correction scheme means and said second database and between said correction scheme means and said pattern match buffer; comparing the grammar marker patterns in the pattern match buffer with the grammar marker patterns in the second database and opening said second plurality of logic gates when a match of self-correction rules is made; inputting self-correction rules fetched from said second database into said correction scheme means when said second plurality of logic gates is enabled; and correcting said pre-translated sentence having grammatical errors therein by applying in said correction scheme means said fetched grammar rules and said fetched self-correction rules to said pre-translated sentence to produce a sentence substantially free of grammatical errors; said fetched grammar rules and said fetched self-correction rules being appropriate rules to correct the pre-translated sentence because each grammar rule in said first database is associated with a unique grammar marker stored with it in said first database and because each self-correction rule in said second database is associated with a unique grammar marker pattern stored with it in said second database so that any grammar marker in said key match buffer will match only a counterpart grammar marker in said first database and therefore cause delivery of the grammar rule associated with said counterpart grammar marker in said first database to the correction scheme means, and so that any grammar marker in said pattern match buffer will match only a counterpart grammar marker pattern in said second database and therefore cause delivery of the self-correction rule associated with said counterpart grammar marker pattern in said second database to the correction scheme means; whereby ungrammatical expressions in the pre-translated sentence are corrected in the absence of human intervention. | 1. A method performed by a computer means for changing a grammatically incorrect sentence that has been pre-translated from a source language into a grammatically correct sentence in a target language, comprising the steps of: storing a plurality of unique grammar markers in a first database and associating each unique grammar marker with a unique grammar rule; storing a plurality of unique grammar marker patterns in a second database and associating each unique grammar marker pattern with a unique self-correction rule; inputting a pre-translated sentence that may have grammatical errors therein into a raw translation buffer; pre-identifying grammar markers in said pre-translated sentence, each grammar marker being associated with a word which may have grammatical variations in said target language but not in said source language; scanning said pre-translated sentence to identify a grammar marker or a plurality of grammar markers, if any, and a grammar marker pattern or a plurality of grammar maker patterns, if any, in said pre-translated sentence; providing a key match buffer for temporary storage of data; inputting any identified grammar marker into said key match buffer; providing a pattern match buffer for temporary storage of data; inputting any identified grammar marker pattern into said pattern match buffer, providing a correction scheme means in said computer means for retrieving appropriate grammar rules and self-correction rules from said first and second databases, respectively, and for making appropriate corrections to generate a substantially grammatically correct sentence; interconnecting a first plurality of logic gates between said correction scheme means and said first database and between said correction scheme means and said key match buffer; comparing the grammar markers in the key match buffer with the grammar markers in the first database and opening said first plurality of logic gates when a match of grammar rules is made; inputting grammar rules fetched from said first database into said correction scheme means when said first plurality of logic gates is enabled; interconnecting a second plurality of logic gates between said correction scheme means and said second database and between said correction scheme means and said pattern match buffer; comparing the grammar marker patterns in the pattern match buffer with the grammar marker patterns in the second database and opening said second plurality of logic gates when a match of self-correction rules is made; inputting self-correction rules fetched from said second database into said correction scheme means when said second plurality of logic gates is enabled; and correcting said pre-translated sentence having grammatical errors therein by applying in said correction scheme means said fetched grammar rules and said fetched self-correction rules to said pre-translated sentence to produce a sentence substantially free of grammatical errors; said fetched grammar rules and said fetched self-correction rules being appropriate rules to correct the pre-translated sentence because each grammar rule in said first database is associated with a unique grammar marker stored with it in said first database and because each self-correction rule in said second database is associated with a unique grammar marker pattern stored with it in said second database so that any grammar marker in said key match buffer will match only a counterpart grammar marker in said first database and therefore cause delivery of the grammar rule associated with said counterpart grammar marker in said first database to the correction scheme means, and so that any grammar marker in said pattern match buffer will match only a counterpart grammar marker pattern in said second database and therefore cause delivery of the self-correction rule associated with said counterpart grammar marker pattern in said second database to the correction scheme means; whereby ungrammatical expressions in the pre-translated sentence are corrected in the absence of human intervention. 23. The method of claim 1, further comprising the step of retrieving an appropriate verb-to-be to replace a "be" in said grammatically incorrect sentence by selecting a pronoun person rule from said rule base if the grammar markers and the grammar marker pattern in said grammatically incorrect sentence is a pronoun plus "be". | 0.746904 |
8,601,030 | 9 | 10 | 9. A method for providing decision support comprising: receiving suggested actions from a decision support system into a particular computerized machine; automatically determining parameters of said suggested actions using said particular computerized machine to serve as input to a question-answering system operating on said particular computerized machine; automatically generating questions based on said parameters using said question-answering system; automatically searching a corpus of unstructured data to retrieve answers to said questions using said question-answering system; automatically providing impact confidence values for each answer indicating degree of impact said answers have on said suggested actions using said question-answering system; automatically providing relevance confidence values for each answer indicating degree of relevance said answers have to said suggested actions using said question-answering system; if said answers have an impact confidence value and a relevance confidence value that are above predetermined confidence thresholds, causing said decision support system to reproduce an action plan with modified suggested actions that are different than said suggested actions using said questions, said answers, and said impact confidence values instead of performing outputting of said questions, said answers, said relevance confidence values, and said impact confidence values; and if said answers have an impact confidence value and a relevance confidence value that are below said predetermined confidence thresholds, performing said outputting of said questions, said answers, said relevance confidence values, and said impact confidence values on a graphic user interface without causing said decision support system to reproduce said action plan. | 9. A method for providing decision support comprising: receiving suggested actions from a decision support system into a particular computerized machine; automatically determining parameters of said suggested actions using said particular computerized machine to serve as input to a question-answering system operating on said particular computerized machine; automatically generating questions based on said parameters using said question-answering system; automatically searching a corpus of unstructured data to retrieve answers to said questions using said question-answering system; automatically providing impact confidence values for each answer indicating degree of impact said answers have on said suggested actions using said question-answering system; automatically providing relevance confidence values for each answer indicating degree of relevance said answers have to said suggested actions using said question-answering system; if said answers have an impact confidence value and a relevance confidence value that are above predetermined confidence thresholds, causing said decision support system to reproduce an action plan with modified suggested actions that are different than said suggested actions using said questions, said answers, and said impact confidence values instead of performing outputting of said questions, said answers, said relevance confidence values, and said impact confidence values; and if said answers have an impact confidence value and a relevance confidence value that are below said predetermined confidence thresholds, performing said outputting of said questions, said answers, said relevance confidence values, and said impact confidence values on a graphic user interface without causing said decision support system to reproduce said action plan. 10. The method according to claim 9 , further comprising ranking said answers according to said impact confidence values and said relevance confidence values using said question-answering system and outputting rankings using said graphic user interface. | 0.593248 |
8,135,125 | 14 | 15 | 14. A storage memory having computer executable components for collecting contextual information relating to several clients and generating an analyzed response to the contextual information, comprising: initializing a communication channel between a service provider and at least one client; wherein the communication channel is used to transmit contextual data packets and conversational data packets; establishing between the service provider and the at least one client a predefined structured hierarchy to use to transmit contextual information; wherein the predefined structured hierarchy is used to transmit the contextual information; an interface component for receiving multiple sets of contextual information from the at least one client and other clients; a filtering component for identifying relevant contextual information based on predefined factors including determining an increase in a rate of calls; an aggregator component for aggregating the identified contextual information, monitoring the level of aggregation, determining when the aggregated contextual information meets a threshold and based on the determination determining when to receive and aggregate more contextual information and when to generate an event; and upon detecting the level of aggregation meets the threshold, generating a event in accordance with predefined logic; during the aggregating, identifying levels of relevancy of the received contextual information; and wherein the interface component pushes the identified contextual information to the aggregator component and clears the aggregated contextual information for a new analysis. | 14. A storage memory having computer executable components for collecting contextual information relating to several clients and generating an analyzed response to the contextual information, comprising: initializing a communication channel between a service provider and at least one client; wherein the communication channel is used to transmit contextual data packets and conversational data packets; establishing between the service provider and the at least one client a predefined structured hierarchy to use to transmit contextual information; wherein the predefined structured hierarchy is used to transmit the contextual information; an interface component for receiving multiple sets of contextual information from the at least one client and other clients; a filtering component for identifying relevant contextual information based on predefined factors including determining an increase in a rate of calls; an aggregator component for aggregating the identified contextual information, monitoring the level of aggregation, determining when the aggregated contextual information meets a threshold and based on the determination determining when to receive and aggregate more contextual information and when to generate an event; and upon detecting the level of aggregation meets the threshold, generating a event in accordance with predefined logic; during the aggregating, identifying levels of relevancy of the received contextual information; and wherein the interface component pushes the identified contextual information to the aggregator component and clears the aggregated contextual information for a new analysis. 15. The storage memory of claim 14 further comprising: a storage component for storing information relating to the predefined factors, the aggregation, the received contextual information, the event, the value of the threshold and time/date stamps. | 0.5 |
9,424,861 | 1 | 14 | 1. A digital conversation generating processor-implemented apparatus, comprising: a memory; a component collection in the memory, including: a processor disposed in communication with the memory, and configured to issue a plurality of processing instructions from the component collection stored in the memory, wherein the processor issues instructions from the component collection, stored in the memory, to: instantiate a processor-implemented dialogue agent; identify an individual target for conversation; initiate a conversational dialogue between the individual target and the dialogue agent; record a first dialogue segment from the individual target as part of the conversational dialogue, wherein the first dialogue segment is a subportion of the conversational dialogue; respond to the first dialogue segment from the individual target with an at least one subsequent response dialogue segment, wherein the at least one subsequent response dialogue segment is a subportion of the conversational dialogue; record a subsequent dialogue segment from the individual target, wherein the subsequent dialogue segment is a subportion of the conversational dialogue; retrieve the recorded interactive dialogue between the individual target and the dialogue agent; allocate a value point to each interactive dialogue segment of the interactive dialogue; create a digital conversation asset comprising at least the retrieved interactive dialogue associated with the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; determine a value for the digital conversation asset at least based on the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; and provide the created digital conversation asset associated with the determined value for exchange. | 1. A digital conversation generating processor-implemented apparatus, comprising: a memory; a component collection in the memory, including: a processor disposed in communication with the memory, and configured to issue a plurality of processing instructions from the component collection stored in the memory, wherein the processor issues instructions from the component collection, stored in the memory, to: instantiate a processor-implemented dialogue agent; identify an individual target for conversation; initiate a conversational dialogue between the individual target and the dialogue agent; record a first dialogue segment from the individual target as part of the conversational dialogue, wherein the first dialogue segment is a subportion of the conversational dialogue; respond to the first dialogue segment from the individual target with an at least one subsequent response dialogue segment, wherein the at least one subsequent response dialogue segment is a subportion of the conversational dialogue; record a subsequent dialogue segment from the individual target, wherein the subsequent dialogue segment is a subportion of the conversational dialogue; retrieve the recorded interactive dialogue between the individual target and the dialogue agent; allocate a value point to each interactive dialogue segment of the interactive dialogue; create a digital conversation asset comprising at least the retrieved interactive dialogue associated with the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; determine a value for the digital conversation asset at least based on the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; and provide the created digital conversation asset associated with the determined value for exchange. 14. The apparatus of claim 1 , further comprising: initiate dialogue analytics to drive individual-agent interactions; determine a dialogue pathway of a dialogue; and determine dialogue parameters based on the dialogue pathway. | 0.613946 |
7,890,762 | 15 | 19 | 15. A data processing system that is configured to provide input to a workflow application, comprising: a digitizer that is configured to receive a source document having an original signature but no digital signature, and that is configured to generate a digital representation of the source document, wherein the source document comprises a paper document, and wherein the digital representation of the source document includes the original signature represented digitally but no digital signature; a user interface that is configured to receive, from a user, a correspondence of the digital representation to the source document; and a digital signature generator that is configured to sign, in response to receiving the correspondence, the digital representation with a differentiated proxy digital signature, wherein the differentiated proxy digital signature stands for the correspondence of the digital representation to the source document and to a presence of the original signature on the source document, wherein the differentiated proxy digital signature does not stand for an authenticity and an integrity of the source document, wherein the differentiated proxy digital signature is annotated with metadata indicating the quality of the original signature, and wherein the differentiated proxy digital signature indicates the digital representation corresponds to the source document, and further indicates the original signature is actually present on the source document. | 15. A data processing system that is configured to provide input to a workflow application, comprising: a digitizer that is configured to receive a source document having an original signature but no digital signature, and that is configured to generate a digital representation of the source document, wherein the source document comprises a paper document, and wherein the digital representation of the source document includes the original signature represented digitally but no digital signature; a user interface that is configured to receive, from a user, a correspondence of the digital representation to the source document; and a digital signature generator that is configured to sign, in response to receiving the correspondence, the digital representation with a differentiated proxy digital signature, wherein the differentiated proxy digital signature stands for the correspondence of the digital representation to the source document and to a presence of the original signature on the source document, wherein the differentiated proxy digital signature does not stand for an authenticity and an integrity of the source document, wherein the differentiated proxy digital signature is annotated with metadata indicating the quality of the original signature, and wherein the differentiated proxy digital signature indicates the digital representation corresponds to the source document, and further indicates the original signature is actually present on the source document. 19. The data processing system of claim 15 , wherein: the metadata for the digital representation indicates whether or not the source document was a paper document having an original signature that was not verified by a person applying the differentiated proxy digital signature to the source document. | 0.5 |
6,081,261 | 8 | 13 | 8. A method comprising: tracking a location of a pen instrument when the pen instrument is used to modify a physical document, wherein sensors within the pen instrument track the location of the pen instrument; generating signals describing movement of the pen instrument based on the location of the pen instrument; transmitting the signals to a receiving device, wherein the signals are used to modify an electronic document corresponding to the physical document, and further wherein strokes made with the pen instrument are displayed when the electronic document is displayed. | 8. A method comprising: tracking a location of a pen instrument when the pen instrument is used to modify a physical document, wherein sensors within the pen instrument track the location of the pen instrument; generating signals describing movement of the pen instrument based on the location of the pen instrument; transmitting the signals to a receiving device, wherein the signals are used to modify an electronic document corresponding to the physical document, and further wherein strokes made with the pen instrument are displayed when the electronic document is displayed. 13. The method of claim 8 wherein tracking a location of a pen instrument comprises generating an infrared signal with the pen instrument that is received by at least two infrared receiving scanning stations located at prescribed positions external to the pen instrument, the scanning stations to scan the area in which the pen instrument is used. | 0.546997 |
7,548,912 | 16 | 17 | 16. The method of claim 15 , wherein the request packet further comprises an enable stemming element for specifying whether a stemmer should be utilized when performing the query. | 16. The method of claim 15 , wherein the request packet further comprises an enable stemming element for specifying whether a stemmer should be utilized when performing the query. 17. The method of claim 16 , wherein the request packet further comprises an ignore noise element for specifying whether noise words should be ignored when performing the query. | 0.5 |
8,849,870 | 1 | 4 | 1. A method comprising: receiving current context information related to a first device; accessing a context profile and a security profile associated with the first device; developing a composite context tree based on at least a portion of the current context information related to the first device and context information related to at least one other device based at least in part on the context profile defining, for a current context of the first device, aspects of the current context information to be utilized for the developing of the composite context tree, wherein developing the composite context tree comprises generating a schema based on the security profile and the context profile in which the schema defines the portion of the current context information and applying the schema to a context tree including the current context information such that only a portion of the context tree defined by the schema is visible to an entity developing the composite context tree; determining a context change has occurred with respect to the first device; determining whether the context change to the composite context tree is allowed based on the security profile and the context profile; wherein in an instance in which the context change is determined to be allowed, the context tree is updated for the context change; and wherein in an instance in which the context change is determined to not be allowed, the context tree is not updated for the context change. | 1. A method comprising: receiving current context information related to a first device; accessing a context profile and a security profile associated with the first device; developing a composite context tree based on at least a portion of the current context information related to the first device and context information related to at least one other device based at least in part on the context profile defining, for a current context of the first device, aspects of the current context information to be utilized for the developing of the composite context tree, wherein developing the composite context tree comprises generating a schema based on the security profile and the context profile in which the schema defines the portion of the current context information and applying the schema to a context tree including the current context information such that only a portion of the context tree defined by the schema is visible to an entity developing the composite context tree; determining a context change has occurred with respect to the first device; determining whether the context change to the composite context tree is allowed based on the security profile and the context profile; wherein in an instance in which the context change is determined to be allowed, the context tree is updated for the context change; and wherein in an instance in which the context change is determined to not be allowed, the context tree is not updated for the context change. 4. The method of claim 1 , wherein accessing the context profile comprises determining whether the context profile is a dynamic profile and, if the context profile is a dynamic profile, building an updated context profile based on the current context information. | 0.596626 |
8,228,215 | 11 | 19 | 11. A non-transitory computer-readable medium storing computer software instructions executable by a computer system including one or more computers to perform operations comprising: obtaining a first set of test values, a second set of test values, and a third set of test values; receiving text comprising characters represented as code point values, the characters identified as being in a first encoding format, each code point value representing one character in the text; and making a determination that the text likely includes characters incorrectly converted from a second encoding format to the first encoding format, wherein making the determination includes (i) determining for a sequence of code point values consisting of a first code point value followed by a second code point value that the first code point value is in the first set of test values and that the second code point value is in the second set of test values, or (ii) determining for a sequence of code point values consisting of a first code point value followed by a second code point value followed by a third code point value that the first code point value is in the third set of test values, that the second code point value is in the second set of test values, and that the third code point value is in the second set of test values. | 11. A non-transitory computer-readable medium storing computer software instructions executable by a computer system including one or more computers to perform operations comprising: obtaining a first set of test values, a second set of test values, and a third set of test values; receiving text comprising characters represented as code point values, the characters identified as being in a first encoding format, each code point value representing one character in the text; and making a determination that the text likely includes characters incorrectly converted from a second encoding format to the first encoding format, wherein making the determination includes (i) determining for a sequence of code point values consisting of a first code point value followed by a second code point value that the first code point value is in the first set of test values and that the second code point value is in the second set of test values, or (ii) determining for a sequence of code point values consisting of a first code point value followed by a second code point value followed by a third code point value that the first code point value is in the third set of test values, that the second code point value is in the second set of test values, and that the third code point value is in the second set of test values. 19. The non-transitory computer-readable medium of claim 11 , the operations further comprising dividing the text comprising characters into one or more two-character or three-character sub-sequences, each sub-sequence including consecutive characters in the received text. | 0.628065 |
9,311,422 | 1 | 2 | 1. A computer-implemented method for simulating a structured document as it would appear on different types of media devices, the method comprising: receiving, via a user interface, a user request to render, in a web browser executing on a first type of media device, a structured document in a layout specific to a second type of media device having a different display requirement than the first type of media device, the second type of media device being selected from a plurality of predefined types of media devices; determining a visual layout of a browser presentation of the structured document in accordance with a style property encoded in a set of presentation semantics associated with and specific to the second type of media device; and sending the laid out structured document including the style property specific to the second type of media device to the web browser for rendering on the first type of media device. | 1. A computer-implemented method for simulating a structured document as it would appear on different types of media devices, the method comprising: receiving, via a user interface, a user request to render, in a web browser executing on a first type of media device, a structured document in a layout specific to a second type of media device having a different display requirement than the first type of media device, the second type of media device being selected from a plurality of predefined types of media devices; determining a visual layout of a browser presentation of the structured document in accordance with a style property encoded in a set of presentation semantics associated with and specific to the second type of media device; and sending the laid out structured document including the style property specific to the second type of media device to the web browser for rendering on the first type of media device. 2. The method of claim 1 , further comprising: identifying a media-dependent style rule encoded in the set of presentation semantics associated with the structured document; determining that the display requirement of the second type of media device satisfies the media-dependent style rule; and in response to the determination, deleting the media-dependent style rule from the set of presentation semantics and preserving the corresponding style property; wherein the style property corresponds to the satisfied media-dependent style rule. | 0.5 |
7,574,433 | 7 | 9 | 7. A system for the indexing and retrieval of classified documents, the system comprising, at least one server computer, at least one document collection, said document collection comprising at least one document(s), said document(s) having been classified according to a predefined classification scheme, said predefined classification scheme comprising classification codes, said classification codes comprising title(s) and definition(s), said document(s) further comprising at least one retrieval key, wherein said retrieval key corresponds with at least one term of at least one of said classification code title(s) or classification code definition(s); at least one server web application; and at least one search engine system, wherein said server computer is connected to said search engine, and wherein said server web application communicates document(s) from said document collection to said search engine; and a means for dynamically inserting said term into said document(s) to create a tagged document, wherein said insertion is in response to a request from said search engine, and wherein said tagged document is communicated to said search engine. | 7. A system for the indexing and retrieval of classified documents, the system comprising, at least one server computer, at least one document collection, said document collection comprising at least one document(s), said document(s) having been classified according to a predefined classification scheme, said predefined classification scheme comprising classification codes, said classification codes comprising title(s) and definition(s), said document(s) further comprising at least one retrieval key, wherein said retrieval key corresponds with at least one term of at least one of said classification code title(s) or classification code definition(s); at least one server web application; and at least one search engine system, wherein said server computer is connected to said search engine, and wherein said server web application communicates document(s) from said document collection to said search engine; and a means for dynamically inserting said term into said document(s) to create a tagged document, wherein said insertion is in response to a request from said search engine, and wherein said tagged document is communicated to said search engine. 9. The system for the indexing and retrieval of classified documents of claim 7 , wherein the document(s) is in a first language, and wherein the term is in a second language. | 0.596774 |
9,516,134 | 10 | 13 | 10. One or more non-transitory computer readable storage media storing computer executable instructions that, when executed, cause a device to: determine potential members associated with a user based on an electronic mailbox associated with the user; determine a plurality of conversion rates respectively for a plurality of invitations based on a respective number of persons that joined a contact information sharing network after being sent a respective one of the plurality of invitations to join the contact information sharing network; determine, based on the plurality of conversion rates, a highest conversion rate invitation of the plurality of invitations; and send, to at least a subset of the potential members, the highest conversion rate invitation. | 10. One or more non-transitory computer readable storage media storing computer executable instructions that, when executed, cause a device to: determine potential members associated with a user based on an electronic mailbox associated with the user; determine a plurality of conversion rates respectively for a plurality of invitations based on a respective number of persons that joined a contact information sharing network after being sent a respective one of the plurality of invitations to join the contact information sharing network; determine, based on the plurality of conversion rates, a highest conversion rate invitation of the plurality of invitations; and send, to at least a subset of the potential members, the highest conversion rate invitation. 13. The one of more non-transitory computer readable storage media of claim 10 , wherein the computer executable instructions that, when executed, cause the device to perform analysis of electronic mail messages within electronic mail folders of the user to determine potential members who are not members of the contact information sharing network or who are likely to respond to the highest conversion rate invitation. | 0.589844 |
8,429,604 | 1 | 11 | 1. A computer-implemented method comprising: accessing a software code file that comprises structural code and behavioral code; extracting from the software code file, at least a portion of the behavioral code into a separate file; generating binding code for referencing the extracted behavioral code to maintain run-time behavior of the software code file consistent with its run-time behavior before said extracting, wherein behavioral code extractor logic inserts into the software code file said binding code for referencing the extracted behavioral code; and wherein said extracting comprises enabling, by a user interface, selection of one or more of identified behavioral code that is to be extracted from the software code file into the separate file; and extracting the selected one or more of the identified behavioral code from the software code file into the separate file. | 1. A computer-implemented method comprising: accessing a software code file that comprises structural code and behavioral code; extracting from the software code file, at least a portion of the behavioral code into a separate file; generating binding code for referencing the extracted behavioral code to maintain run-time behavior of the software code file consistent with its run-time behavior before said extracting, wherein behavioral code extractor logic inserts into the software code file said binding code for referencing the extracted behavioral code; and wherein said extracting comprises enabling, by a user interface, selection of one or more of identified behavioral code that is to be extracted from the software code file into the separate file; and extracting the selected one or more of the identified behavioral code from the software code file into the separate file. 11. The method of claim 1 further comprising: presenting the user interface that includes a list identifying one or more behavioral code to be extracted from the software code file into the separate file contained in the software code file; and presenting in the user interface a corresponding binding identifier for each of the one or more behavioral code to be extracted from the software code file, wherein the binding identifier is utilized within binding code for referencing the corresponding extracted behavioral code. | 0.5 |
8,812,493 | 1 | 6 | 1. A computer-implemented relevance system, comprising: one or more processors; and a memory coupled to the one or more processors, the memory storing instructions which, when executed by the one or more processors, cause the one or more processors to: extract document information from a document received as search results based on a query string, the document information including a universal resource locator wherein the universal resource locator includes a compound term; split the compound term into multiple, separate terms; find at least one of the multiple, separate terms in a dictionary of terms; generate a target data string based on the extracted document information, the target data string including one of the multiple, separate terms found in the dictionary; and compute edit distance between the target data string and the query string, the edit distance employed in determining relevance of a document as part of result ranking. | 1. A computer-implemented relevance system, comprising: one or more processors; and a memory coupled to the one or more processors, the memory storing instructions which, when executed by the one or more processors, cause the one or more processors to: extract document information from a document received as search results based on a query string, the document information including a universal resource locator wherein the universal resource locator includes a compound term; split the compound term into multiple, separate terms; find at least one of the multiple, separate terms in a dictionary of terms; generate a target data string based on the extracted document information, the target data string including one of the multiple, separate terms found in the dictionary; and compute edit distance between the target data string and the query string, the edit distance employed in determining relevance of a document as part of result ranking. 6. The system of claim 1 , wherein the edit distance is computed based on insertion and deletion of terms to increase proximity between the target data string and the query string. | 0.784173 |
8,818,930 | 5 | 14 | 5. The knowledge base system according to claim 1 , wherein said operation unit is configured to, when one entity is designated as an operation target, perform the logic operation on an attribute of the designated entity. | 5. The knowledge base system according to claim 1 , wherein said operation unit is configured to, when one entity is designated as an operation target, perform the logic operation on an attribute of the designated entity. 14. The knowledge base system according to claim 5 , wherein said operation unit is further configured to, when two attribute sets each of which includes one or more attributes are designated: count, in a case where each attribute is associated with a true-false value indicating whether the attribute is true or false, a number of attributes that have a same primary identifier and are associated with different true-false values between the two attribute sets, as a degree of non-similarity; and count, in a case where each attribute is not associated with the true-false value, number of attributes that are included in only either of the two attribute sets, as the degree of non-similarity. | 0.603429 |
7,904,429 | 14 | 19 | 14. A method of detecting the inclusion of at least one record comprising string of words from a list of pre-defined records in an input string of words, comprising: A. pre-processing the list of records in the manner that each record is represented by a string comprising a plurality of sections wherein each of the said sections (chunks) comprises a pre-defined number of elementary words, creating a list of chunks, comprising all chunks of said pre-defined records, wherein if a chunk appears in more than one record this chunk is included only once in the said list of chunks; B. associating to each chunk a “Begin of Record” attribute whenever the said chunk is the first chunk in the chunk representation of a record; C. associating to each chunk a “End of Record” attribute whenever the said chunk is the last chunk in the chunk representation of a record; D. calculating for each record an Incremental Hash Function (IHF); said calculating compromising: i. starting with an arbitrary initial value; ii. processing sequentially each chunk of the record; and, iii. calculating the IHF for each of said processed chunks as an arbitrarily first predefined function of the said chunk has not been associated with a “Begin of Record” attribute, and as a reversible operation of a second predefined function of the said chunk and the previously calculated IHF value where the said chunk has been associated with a “Begin of Record” attribute; E. calculating ΔI function for each record as the inverse of the said reversible operation of the IHF value at the last chunk of the record, and the said initial value of the IHF for that record; F. associating to each chunk having an “End of Record” attribute, the values of all ΔI function for all records for which that chunk is the last chunk; G. representing the input string as a string of chunks (input string of chunks); H. processing sequentially each chunk of the said input string of chunks, and for each said chunk setting a Partial Match Flag if the said chunk appears in the said list of chunks and if either the said Chunk has a “Begin of Record” attribute, or the Partial Match Flag was previously set; I. if said chunk has an “End of Record” attribute, calculating a set of ΔJ function values, each one being the result of the inverse of the said reversible operation of the IHF value at the said chunk of the input string of chunks, and the IHF value obtained immediately before calculating the IHF for a chunk having a “Begin of Record” attribute; and, J. asserting a “Probable Match” in case the said chunk has an “End of Record” attribute and at least one of the &J functions from the said set of ΔJ functions equals one of the ΔI functions associated to the said chunk wherein a “Probable Match” indicates a high probability that at least one record is included in the input string. | 14. A method of detecting the inclusion of at least one record comprising string of words from a list of pre-defined records in an input string of words, comprising: A. pre-processing the list of records in the manner that each record is represented by a string comprising a plurality of sections wherein each of the said sections (chunks) comprises a pre-defined number of elementary words, creating a list of chunks, comprising all chunks of said pre-defined records, wherein if a chunk appears in more than one record this chunk is included only once in the said list of chunks; B. associating to each chunk a “Begin of Record” attribute whenever the said chunk is the first chunk in the chunk representation of a record; C. associating to each chunk a “End of Record” attribute whenever the said chunk is the last chunk in the chunk representation of a record; D. calculating for each record an Incremental Hash Function (IHF); said calculating compromising: i. starting with an arbitrary initial value; ii. processing sequentially each chunk of the record; and, iii. calculating the IHF for each of said processed chunks as an arbitrarily first predefined function of the said chunk has not been associated with a “Begin of Record” attribute, and as a reversible operation of a second predefined function of the said chunk and the previously calculated IHF value where the said chunk has been associated with a “Begin of Record” attribute; E. calculating ΔI function for each record as the inverse of the said reversible operation of the IHF value at the last chunk of the record, and the said initial value of the IHF for that record; F. associating to each chunk having an “End of Record” attribute, the values of all ΔI function for all records for which that chunk is the last chunk; G. representing the input string as a string of chunks (input string of chunks); H. processing sequentially each chunk of the said input string of chunks, and for each said chunk setting a Partial Match Flag if the said chunk appears in the said list of chunks and if either the said Chunk has a “Begin of Record” attribute, or the Partial Match Flag was previously set; I. if said chunk has an “End of Record” attribute, calculating a set of ΔJ function values, each one being the result of the inverse of the said reversible operation of the IHF value at the said chunk of the input string of chunks, and the IHF value obtained immediately before calculating the IHF for a chunk having a “Begin of Record” attribute; and, J. asserting a “Probable Match” in case the said chunk has an “End of Record” attribute and at least one of the &J functions from the said set of ΔJ functions equals one of the ΔI functions associated to the said chunk wherein a “Probable Match” indicates a high probability that at least one record is included in the input string. 19. The method according to claim 14 wherein a conventional Hash function and a Hash table is used with additional attributes associated to each row of the hash table, the said additional attributes being the previous and next chunk in the record. | 0.851918 |
8,543,405 | 15 | 16 | 15. The method according to claim 5 , wherein the user selection includes a keyword. | 15. The method according to claim 5 , wherein the user selection includes a keyword. 16. The method according to claim 15 , further including: storing a plurality of markers and corresponding keywords; receiving an input keyword; retrieving one or more markers which are stored with the received keyword. | 0.5 |
9,916,386 | 1 | 5 | 1. A method for presenting a search result in response to a current search term, comprising: determining a pre-established first model corresponding to preselected user information and including historical user search data; identifying a selected historical search term in the historical user search data that corresponds with the current search term; identifying a selected historical selection result in the historical user search data that corresponds with the identified historical search term; determining the search result based upon the identified historical selection result, said determining the search result comprising determining an online recommendation result based upon the identified historical selection result; processing the online recommendation result to generate a generated recommendation result; and presenting the generated recommendation result, wherein said processing comprises: calculating a literal association degree between the online recommendation result and the current search term according to a logistic regression process such that the online recommendation result has the literal association degree that is greater than a preselected third threshold value; calculating a semantic association degree between the online recommendation result and the current search term according to a gradient boost decision tree such that the online recommendation result has the semantic association degree that is greater than a preselected fourth threshold value; or a combination thereof. | 1. A method for presenting a search result in response to a current search term, comprising: determining a pre-established first model corresponding to preselected user information and including historical user search data; identifying a selected historical search term in the historical user search data that corresponds with the current search term; identifying a selected historical selection result in the historical user search data that corresponds with the identified historical search term; determining the search result based upon the identified historical selection result, said determining the search result comprising determining an online recommendation result based upon the identified historical selection result; processing the online recommendation result to generate a generated recommendation result; and presenting the generated recommendation result, wherein said processing comprises: calculating a literal association degree between the online recommendation result and the current search term according to a logistic regression process such that the online recommendation result has the literal association degree that is greater than a preselected third threshold value; calculating a semantic association degree between the online recommendation result and the current search term according to a gradient boost decision tree such that the online recommendation result has the semantic association degree that is greater than a preselected fourth threshold value; or a combination thereof. 5. The method of claim 1 , further comprising presenting the online recommendation result. | 0.928797 |
9,680,830 | 9 | 10 | 9. A method for evaluating data access statements with respect to database security, comprising: evaluating criticality of multiple Structured Query Language (SQL) statements contained in multiple sessions accessing, from a first computing system, a database implemented on a data server; generating, on the data server, a critical item set from the multiple sessions, each element in the critical item set indicating one or more SQL statements contained in a session of the multiple sessions; extracting at least one association rule from the critical item set, each of the at least association rule indicating, a sequence of SQL statements; calculating criticality of each of the at least one association rule; evaluating a session based upon a criticality of at least one association rule; terminating, by the data server, the session based upon a result of the evaluating; ranking, by the data server, at least two association rules by the criticality of each of the at least two association rules; and specifying, by the data server, a security policy corresponding to each of the at least two association rules according to the ranking. | 9. A method for evaluating data access statements with respect to database security, comprising: evaluating criticality of multiple Structured Query Language (SQL) statements contained in multiple sessions accessing, from a first computing system, a database implemented on a data server; generating, on the data server, a critical item set from the multiple sessions, each element in the critical item set indicating one or more SQL statements contained in a session of the multiple sessions; extracting at least one association rule from the critical item set, each of the at least association rule indicating, a sequence of SQL statements; calculating criticality of each of the at least one association rule; evaluating a session based upon a criticality of at least one association rule; terminating, by the data server, the session based upon a result of the evaluating; ranking, by the data server, at least two association rules by the criticality of each of the at least two association rules; and specifying, by the data server, a security policy corresponding to each of the at least two association rules according to the ranking. 10. The method according to claim 9 , wherein the generating a critical item set from the multiple sessions comprises: filtering at least a portion of sessions out of the multiple sessions based on the criticality of the multiple SQL statements; and generating a critical item set from the at least a portion of sessions. | 0.717926 |
9,235,803 | 1 | 5 | 1. A method executed on a computing device for linking a web extension and content contextually, the method comprising: receiving a manifest formatted using extensible markup language (XML) from a cache, wherein the manifest includes the web extension and specifies a time period to activate the web extension; in response to a detection of the activation of the web extension, retrieving a regular expression rule of the web extension from the manifest and loading the regular expression rule into a memory of the computing device, wherein the web extension specifies entities in the regular expression rule and wherein the regular expression rule is a description of a pattern that matches an entity within the content; extracting the entities on a server associated with an application of the computing device, wherein the application hosts the web extension; evaluating the regular expression rule at run-time on the application; in response to a detection of a user action to display the content, detecting the content; processing the content with the web extension to match the regular expression rule of the web extension to the entities in the content; storing the entities in the memory of the computing device and linking the entities to the web extension contextually; displaying the content and the web extension that includes the entities that are contextually linked to the web extension; and emphasizing the entities within the content and the web extension by utilizing a highlighting scheme to highlight the entities, wherein the highlighting scheme emphasizes a contextual link between the entities and the web extension. | 1. A method executed on a computing device for linking a web extension and content contextually, the method comprising: receiving a manifest formatted using extensible markup language (XML) from a cache, wherein the manifest includes the web extension and specifies a time period to activate the web extension; in response to a detection of the activation of the web extension, retrieving a regular expression rule of the web extension from the manifest and loading the regular expression rule into a memory of the computing device, wherein the web extension specifies entities in the regular expression rule and wherein the regular expression rule is a description of a pattern that matches an entity within the content; extracting the entities on a server associated with an application of the computing device, wherein the application hosts the web extension; evaluating the regular expression rule at run-time on the application; in response to a detection of a user action to display the content, detecting the content; processing the content with the web extension to match the regular expression rule of the web extension to the entities in the content; storing the entities in the memory of the computing device and linking the entities to the web extension contextually; displaying the content and the web extension that includes the entities that are contextually linked to the web extension; and emphasizing the entities within the content and the web extension by utilizing a highlighting scheme to highlight the entities, wherein the highlighting scheme emphasizes a contextual link between the entities and the web extension. 5. The method of claim 1 , further comprising: in response to a detection that the entities match the regular expression rule, displaying a web extension control to emphasize the entities and the regular expression rule, wherein the web extension control is configured to interact with a user to emphasis the entities that match the regular expression rule; and detecting an activation of the web extension control. | 0.5 |
9,746,929 | 10 | 15 | 10. An apparatus for recognizing gesture, comprising: one or more gesture capturing sensors; a raw data capture block configured to generate raw data of a gesture from the gesture capturing sensors; a gesture elements categorizing block configured to categorize the raw data into a plurality of gesture elements and to recategorize the raw data into different gesture elements based on a contextual dependency between the plurality of gesture elements, wherein each gesture element corresponds to a predetermined movement identified from the raw data; a contextual dependency determining block configured to determine a contextual dependency between the plurality of gesture elements, wherein the contextual dependency comprises probabilities of the plurality of gesture elements appearing next to each other in a temporal order or sequence; and a gesture recognition block configured to recognize the gesture based on the determined gesture elements. | 10. An apparatus for recognizing gesture, comprising: one or more gesture capturing sensors; a raw data capture block configured to generate raw data of a gesture from the gesture capturing sensors; a gesture elements categorizing block configured to categorize the raw data into a plurality of gesture elements and to recategorize the raw data into different gesture elements based on a contextual dependency between the plurality of gesture elements, wherein each gesture element corresponds to a predetermined movement identified from the raw data; a contextual dependency determining block configured to determine a contextual dependency between the plurality of gesture elements, wherein the contextual dependency comprises probabilities of the plurality of gesture elements appearing next to each other in a temporal order or sequence; and a gesture recognition block configured to recognize the gesture based on the determined gesture elements. 15. The apparatus of claim 10 , wherein the probabilities of the plurality of gesture elements appearing next to each other in a temporal order or sequence is determined by utilizing a deep neural network. | 0.756532 |
9,607,277 | 1 | 5 | 1. A method for crowd sourcing tasks, comprising: identifying, by a computer system, a group of potential candidates for crowd sourcing, wherein each candidate of the group of potential candidates is identified based on the candidate being expected to accept an offer for performance of a certain type of task, the certain type of task being at least performable within a predetermined range of time; receiving, by the computer system, a request to perform a particular task from a requester; determining, by the computer system, if the particular task corresponds to the certain type of task; and transmitting, by the computer system, an offer for performance of the particular task to a subgroup of the group of potential candidates in response to the particular task corresponding to the certain type of task for a target candidate, wherein transmitting the offer for performance of the particular task to the subgroup of the group of potential candidates comprises: determining when any candidates are currently performing the same task or similar task to the particular task, and transmitting the offer for performance of the particular task to the candidates that are currently performing the same task or the similar task; determining when any candidates have a history of completing the same task or the similar task to the particular task faster than other candidates, and transmitting the offer for performance of the particular task to the candidates that have the history of completing the same task or the similar task faster than the other candidates; determining when a particular candidate has completed a specific task, and transmitting the offer for performance of the particular task to the particular candidate in response to the particular candidate having completed the specific task, wherein the specific task is related to the particular task being offered; and determining when any candidates have reached a predefined quota of one of a total time in performing a group of tasks during a set time period or a number of tasks performed during the set time period, and not transmitting an offer for performance of another task to any candidates that have reached the predefined quota until a next set time period, wherein the next set time period is configurable by a user based on a policy. | 1. A method for crowd sourcing tasks, comprising: identifying, by a computer system, a group of potential candidates for crowd sourcing, wherein each candidate of the group of potential candidates is identified based on the candidate being expected to accept an offer for performance of a certain type of task, the certain type of task being at least performable within a predetermined range of time; receiving, by the computer system, a request to perform a particular task from a requester; determining, by the computer system, if the particular task corresponds to the certain type of task; and transmitting, by the computer system, an offer for performance of the particular task to a subgroup of the group of potential candidates in response to the particular task corresponding to the certain type of task for a target candidate, wherein transmitting the offer for performance of the particular task to the subgroup of the group of potential candidates comprises: determining when any candidates are currently performing the same task or similar task to the particular task, and transmitting the offer for performance of the particular task to the candidates that are currently performing the same task or the similar task; determining when any candidates have a history of completing the same task or the similar task to the particular task faster than other candidates, and transmitting the offer for performance of the particular task to the candidates that have the history of completing the same task or the similar task faster than the other candidates; determining when a particular candidate has completed a specific task, and transmitting the offer for performance of the particular task to the particular candidate in response to the particular candidate having completed the specific task, wherein the specific task is related to the particular task being offered; and determining when any candidates have reached a predefined quota of one of a total time in performing a group of tasks during a set time period or a number of tasks performed during the set time period, and not transmitting an offer for performance of another task to any candidates that have reached the predefined quota until a next set time period, wherein the next set time period is configurable by a user based on a policy. 5. The method of claim 1 , further comprising withdrawing the offer for performance of the particular task in response to the offer not being accepted within a preset time period. | 0.84569 |
10,140,321 | 9 | 16 | 9. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: sanitizing sensitive information found in a transcription from a first speaker, to yield a clean transcription comprising sanitized text and non-sanitized text, wherein a first feature vector associated with the non-sanitized text in the transcription identifies the first speaker; generating a mean feature vector by taking a mean of the first feature vector for the transcription of the first speaker and a second feature vector associated with a second document and which identifies a second speaker, wherein the first speaker and the second speaker are different speakers; and replacing, via a processor of a computing device, the first feature vector associated with the non-sanitized text with the mean feature vector to anonymize the non-sanitized text. | 9. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: sanitizing sensitive information found in a transcription from a first speaker, to yield a clean transcription comprising sanitized text and non-sanitized text, wherein a first feature vector associated with the non-sanitized text in the transcription identifies the first speaker; generating a mean feature vector by taking a mean of the first feature vector for the transcription of the first speaker and a second feature vector associated with a second document and which identifies a second speaker, wherein the first speaker and the second speaker are different speakers; and replacing, via a processor of a computing device, the first feature vector associated with the non-sanitized text with the mean feature vector to anonymize the non-sanitized text. 16. The system of claim 9 , wherein sanitizing the sensitive information further comprises changing a distribution of utterances and semantically labeled data in the non-sanitized text. | 0.697712 |
8,712,956 | 33 | 37 | 33. A method comprising: receiving a user selection of a report; displaying the user selected report in a view in a graphical user interface; receiving, by a computer, a user selection of a part of the report displayed in the view in the graphical user interface, the user selected report part associated with queries of a semantic layer, the report including a report part other than the user selected report part; displaying, in a single view in a graphical user interface, (a) the user selected report part and (b) a control to initiate creation of a description of a Web Service call to return contents of the user selected report part; receiving, by the computer, a user selection of the control to initiate creation of a description of a Web Service call to return contents of the user selected report part; in response to the user selection of the control to initiate creation of the description of the Web Service call to return contents of the user selected report part, issuing, by the computer, an instruction to create the description of the Web Service call to return contents of the user selected report part; in response to the instruction to create the description of the Web Service call to return contents of the user selected report part, creating, by a computer, the description of the Web Service call to return contents of the user selected report part without creating a description of a Web Service call to return contents of the report part other than the user selected report part; and storing the description of the Web Service call in a repository. | 33. A method comprising: receiving a user selection of a report; displaying the user selected report in a view in a graphical user interface; receiving, by a computer, a user selection of a part of the report displayed in the view in the graphical user interface, the user selected report part associated with queries of a semantic layer, the report including a report part other than the user selected report part; displaying, in a single view in a graphical user interface, (a) the user selected report part and (b) a control to initiate creation of a description of a Web Service call to return contents of the user selected report part; receiving, by the computer, a user selection of the control to initiate creation of a description of a Web Service call to return contents of the user selected report part; in response to the user selection of the control to initiate creation of the description of the Web Service call to return contents of the user selected report part, issuing, by the computer, an instruction to create the description of the Web Service call to return contents of the user selected report part; in response to the instruction to create the description of the Web Service call to return contents of the user selected report part, creating, by a computer, the description of the Web Service call to return contents of the user selected report part without creating a description of a Web Service call to return contents of the report part other than the user selected report part; and storing the description of the Web Service call in a repository. 37. A method according to claim 33 , the method further comprising: creating a description of a second Web Service call corresponding to the selected report part, the second Web Service call providing drilling parameters to specify a drilling direction, drilling steps and a drilling target, wherein the second Web Service call is to return drilled-down contents of the selected report part based on the drilling parameters. | 0.716956 |
9,092,523 | 36 | 40 | 36. A method comprising: a) managing a database including user input, wherein the database comprises supplemental information, wherein the supplemental information includes at least one of a user-entered description of a first concept related to the search query or hyperlinks to documents related to the search query, and wherein managing the database comprises any one of adding, editing, and deleting the description of the first concept or the hyperlinks; and b) presenting web page search results from the database in response to a search query initiated by a user, wherein the web page search results includes a results list and the supplemental information related to the search query, wherein the results list comprises a list of web pages related to the search query, and wherein multiple users are able to modify the same portions of the supplemental information regardless of the original source of the supplemental information. | 36. A method comprising: a) managing a database including user input, wherein the database comprises supplemental information, wherein the supplemental information includes at least one of a user-entered description of a first concept related to the search query or hyperlinks to documents related to the search query, and wherein managing the database comprises any one of adding, editing, and deleting the description of the first concept or the hyperlinks; and b) presenting web page search results from the database in response to a search query initiated by a user, wherein the web page search results includes a results list and the supplemental information related to the search query, wherein the results list comprises a list of web pages related to the search query, and wherein multiple users are able to modify the same portions of the supplemental information regardless of the original source of the supplemental information. 40. The method of claim 36 , wherein the supplemental information includes a list of different concepts related to the search query. | 0.557047 |
8,645,928 | 6 | 7 | 6. The method of claim 1 further comprising: defining an event handler for a particular GUI component, wherein said event handler is triggered by a user; in response to the triggering of the event handler, prompting said user to input a translation of particular GUI component text associated with said GUI component; and displaying said translation of said particular GUI component text. | 6. The method of claim 1 further comprising: defining an event handler for a particular GUI component, wherein said event handler is triggered by a user; in response to the triggering of the event handler, prompting said user to input a translation of particular GUI component text associated with said GUI component; and displaying said translation of said particular GUI component text. 7. The method of claim 6 further comprising: storing said translation of said particular GUI component text. | 0.5 |
8,069,044 | 21 | 24 | 21. The medium of claim 20 , wherein the program instructions, when executed by the computer, cause the computer to further perform associating the two or more of the plurality of files, based on establishing that the determined similarity exceeds a quantitative threshold. | 21. The medium of claim 20 , wherein the program instructions, when executed by the computer, cause the computer to further perform associating the two or more of the plurality of files, based on establishing that the determined similarity exceeds a quantitative threshold. 24. The medium of claim 21 , wherein said associating comprises tagging the two or more of the plurality of files. | 0.721951 |
8,719,733 | 1 | 4 | 1. A website navigation implementing method, comprising: deriving a confidence level for at least one leaf node of a website navigation category diagram using historical user operation data, wherein the confidence level for the at least one lead node is determined based at least in part on historical search behavior data; generating a plurality of navigation hierarchical structure diagrams based on the website navigation category diagram, wherein for at least one of the plurality of navigation hierarchical structure diagrams, leaf nodes with a corresponding confidence level greater than a preset threshold value are included in a predetermined level of the navigation hierarchical structure diagram; determining a searching cost associated with each of the plurality of navigation hierarchical structure diagrams; determining the navigation hierarchical structure diagram associated with the lowest searching cost; and implementing, using a processor, at least in part a website navigation process using the navigation hierarchical structure diagram associated with the lowest searching cost. | 1. A website navigation implementing method, comprising: deriving a confidence level for at least one leaf node of a website navigation category diagram using historical user operation data, wherein the confidence level for the at least one lead node is determined based at least in part on historical search behavior data; generating a plurality of navigation hierarchical structure diagrams based on the website navigation category diagram, wherein for at least one of the plurality of navigation hierarchical structure diagrams, leaf nodes with a corresponding confidence level greater than a preset threshold value are included in a predetermined level of the navigation hierarchical structure diagram; determining a searching cost associated with each of the plurality of navigation hierarchical structure diagrams; determining the navigation hierarchical structure diagram associated with the lowest searching cost; and implementing, using a processor, at least in part a website navigation process using the navigation hierarchical structure diagram associated with the lowest searching cost. 4. The method of claim 1 , further comprising displaying leaf nodes associated with a navigation hierarchical structure diagram in an order based on corresponding confidence levels of the leaf nodes. | 0.867156 |
9,460,209 | 1 | 5 | 1. A computer-implemented method comprising: receiving, through a first service, a query, wherein the query comprises a reserved term associated with a particular second service; in response to receiving the query, interpreting the query as being directed to an action for the particular second service; identifying the particular second service; and providing a portion of the query to the particular second service to obtain a message for an application associated with the particular second service, the message comprising the portion of the query. | 1. A computer-implemented method comprising: receiving, through a first service, a query, wherein the query comprises a reserved term associated with a particular second service; in response to receiving the query, interpreting the query as being directed to an action for the particular second service; identifying the particular second service; and providing a portion of the query to the particular second service to obtain a message for an application associated with the particular second service, the message comprising the portion of the query. 5. The computer-implemented method of claim 1 , further comprising sending the message to one or more users, wherein contact information for the one or more users is stored in a contact list on the computing device. | 0.670245 |
9,459,793 | 10 | 11 | 10. The method of claim 8 , further comprising: concurrently displaying both the first sub key button assigned with the second alphabet character and a third key button assigned with the same second alphabet character. | 10. The method of claim 8 , further comprising: concurrently displaying both the first sub key button assigned with the second alphabet character and a third key button assigned with the same second alphabet character. 11. The method of claim 10 , further comprising: replacing the first sub key button with the second sub key button at the location. | 0.5 |
8,607,213 | 10 | 16 | 10. A computer-usable memory embodying computer program code, the computer program code comprising computer executable instructions configured for: transmitting a Shareable Content Object Reference Model (SCORM) package to a SCORM Learning Management System (LMS), wherein the SCORM package includes a manifest listing of resources needed to deploy the SCORM package from the LMS; parsing out the manifest listing from the SCORM package; iterating through the manifest listing to create an inventory of the resources in the SCORM package, wherein the inventory of the resources includes an attribute file; comparing names of all resources in the manifest listing with named resources in the attribute file in the inventory of resources available to the LMS; in response to a name in the manifest listing not completely matching any named resources in the attribute file in the inventory of resources available to the LMS, updating a character casing of the name to match a character casing of a corresponding name of a named resource in the attribute file in the inventory of resources available to the LMS, wherein the character casing of the corresponding name of the named resource includes one or more upper case letters and on or more lower case letters; and deploying the SCORM package by launching the SCORM package with a corrected list of resources matching the attribute file in the inventory of resource available to the LMS. | 10. A computer-usable memory embodying computer program code, the computer program code comprising computer executable instructions configured for: transmitting a Shareable Content Object Reference Model (SCORM) package to a SCORM Learning Management System (LMS), wherein the SCORM package includes a manifest listing of resources needed to deploy the SCORM package from the LMS; parsing out the manifest listing from the SCORM package; iterating through the manifest listing to create an inventory of the resources in the SCORM package, wherein the inventory of the resources includes an attribute file; comparing names of all resources in the manifest listing with named resources in the attribute file in the inventory of resources available to the LMS; in response to a name in the manifest listing not completely matching any named resources in the attribute file in the inventory of resources available to the LMS, updating a character casing of the name to match a character casing of a corresponding name of a named resource in the attribute file in the inventory of resources available to the LMS, wherein the character casing of the corresponding name of the named resource includes one or more upper case letters and on or more lower case letters; and deploying the SCORM package by launching the SCORM package with a corrected list of resources matching the attribute file in the inventory of resource available to the LMS. 16. The computer-useable memory of claim 10 , wherein the computer program code is provided by a service provider to a customer on an on-demand basis. | 0.628713 |
8,813,060 | 1 | 10 | 1. A computer-implemented method to search for applications considering contextual input information, the method comprising: receiving contextual information that is related to a computing device and an activity that a user is engaged in; accessing application manifest information for applications available from an application catalog; accessing policy information that determines how to match accessed application manifest information to the received contextual information related to the device and user; identifying one or more applications with manifest data that matches a currently detected context based on the accessed policy information; ranking identified applications higher than other applications in the application catalog; and displaying applications to the user based on the modified ranking produced by considering contextual information, wherein the preceding steps are performed by at least one processor. | 1. A computer-implemented method to search for applications considering contextual input information, the method comprising: receiving contextual information that is related to a computing device and an activity that a user is engaged in; accessing application manifest information for applications available from an application catalog; accessing policy information that determines how to match accessed application manifest information to the received contextual information related to the device and user; identifying one or more applications with manifest data that matches a currently detected context based on the accessed policy information; ranking identified applications higher than other applications in the application catalog; and displaying applications to the user based on the modified ranking produced by considering contextual information, wherein the preceding steps are performed by at least one processor. 10. The method of claim 1 wherein ranking applications higher comprises applying a weighting to applications and weighting applications with a contextual relationship to the current context higher than other applications. | 0.678779 |
9,946,706 | 7 | 12 | 7. A non-transitory machine-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device, cause the device to: obtain a document including text; receive, from an automatic language identifier service, a first language identification for the document; in response to receiving the first language identification, automatically invoking a modifying operation; perform the modifying operation on the document in accordance with the first language identification; determine based at least in part on results from the modifying operation, whether the first language identification for the document is correct, wherein the results from the modifying operation include at least one of the amount of errors or the nature of the errors associated with the modifying operation; in accordance with a determination that the first language identification is correct, provide the first language identification to a user application; in accordance with a determination that the first language identification is incorrect, determine a second language identification of the document, and perform a modifying function on the document in accordance with one or more alternate languages different from the first language, wherein the second language identification of the document is determined based at least in part on the results from performing the modifying function on the document in accordance with the one or more alternate languages. | 7. A non-transitory machine-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device, cause the device to: obtain a document including text; receive, from an automatic language identifier service, a first language identification for the document; in response to receiving the first language identification, automatically invoking a modifying operation; perform the modifying operation on the document in accordance with the first language identification; determine based at least in part on results from the modifying operation, whether the first language identification for the document is correct, wherein the results from the modifying operation include at least one of the amount of errors or the nature of the errors associated with the modifying operation; in accordance with a determination that the first language identification is correct, provide the first language identification to a user application; in accordance with a determination that the first language identification is incorrect, determine a second language identification of the document, and perform a modifying function on the document in accordance with one or more alternate languages different from the first language, wherein the second language identification of the document is determined based at least in part on the results from performing the modifying function on the document in accordance with the one or more alternate languages. 12. The non-transitory machine-readable storage medium of claim 7 , wherein determining whether the first language identification for the document is correct is further based on length of the text included in the document. | 0.717557 |
9,064,174 | 1 | 3 | 1. A system, comprising: a text recognition component configured for recognition of text on a sequence of video frames, the text recognition component configured to receive a selected frame of the sequence of video frames and perform text recognition processing of the selected frame to output a selected frame result; a tracker component configured to select a keyframe from the sequence of video frames based on stability criteria applied to incoming frames and to establish a reference coordinate system relative to the selected keyframe, the selected frame result mapped back to the reference coordinate system of the keyframe, the tracker component configured to apply keyframe coordinates to subsequent video frames to enable accumulation of best results for text recognition rendering and viewing; and a microprocessor configured to execute computer-executable instructions associated with at least one of the text recognition component or the tracker component. | 1. A system, comprising: a text recognition component configured for recognition of text on a sequence of video frames, the text recognition component configured to receive a selected frame of the sequence of video frames and perform text recognition processing of the selected frame to output a selected frame result; a tracker component configured to select a keyframe from the sequence of video frames based on stability criteria applied to incoming frames and to establish a reference coordinate system relative to the selected keyframe, the selected frame result mapped back to the reference coordinate system of the keyframe, the tracker component configured to apply keyframe coordinates to subsequent video frames to enable accumulation of best results for text recognition rendering and viewing; and a microprocessor configured to execute computer-executable instructions associated with at least one of the text recognition component or the tracker component. 3. The system of claim 1 , wherein the reference coordinate system relates recognized text coordinates of the text of the selected frame back to the keyframe based on an estimated transformation established between the keyframe and the selected frame. | 0.5 |
7,721,270 | 1 | 2 | 1. A method for converting information, the method comprises the following stages executed by a processor: converting a non-structured information transformation specification to a structured information transformation specification; generating information transformation code responsive to the structured information transformation specification; altering the information transformation code; and associating a code alteration indication to the non-structured information transformation specification in response to the alteration of the information transformation code, the associating further comprising: performing a conversion of the information transformation code to a format compatible with the structured information transformation specification to generate an intermediate code alteration; and performing a conversion of the intermediate code alteration to a format compatible with the non-structured information transformation specification to generate the code alteration indication. | 1. A method for converting information, the method comprises the following stages executed by a processor: converting a non-structured information transformation specification to a structured information transformation specification; generating information transformation code responsive to the structured information transformation specification; altering the information transformation code; and associating a code alteration indication to the non-structured information transformation specification in response to the alteration of the information transformation code, the associating further comprising: performing a conversion of the information transformation code to a format compatible with the structured information transformation specification to generate an intermediate code alteration; and performing a conversion of the intermediate code alteration to a format compatible with the non-structured information transformation specification to generate the code alteration indication. 2. The method according to claim 1 wherein the code alteration indication affects the non-structured information transformation specification. | 0.754325 |
7,865,955 | 1 | 14 | 1. An apparatus for extracting attacking packet signature candidates comprising: a processor and a memory; a packet separator for separating a network packet into a header and a payload; a header information parser for parsing the header information; a traffic information generator for generating traffic information based on the parsed value; a substring extractor, having a processor and a memory, for measuring a frequency of appearing of a substring with a predetermined length in the separated payload for a constant observation period, and extracting a substring having a frequency higher than a predetermined setup value by updating the measured frequency information to a substring frequency table, wherein the updating includes increasing said frequency information of the substring that is less frequently shown previously by a larger increment amount; and a signature candidate extractor for generating a signature by collecting the extracted substring information of the substring frequency table and the generated traffic information, updating a signature frequency table, and extracting a signature candidate with reference to the signature frequency table. | 1. An apparatus for extracting attacking packet signature candidates comprising: a processor and a memory; a packet separator for separating a network packet into a header and a payload; a header information parser for parsing the header information; a traffic information generator for generating traffic information based on the parsed value; a substring extractor, having a processor and a memory, for measuring a frequency of appearing of a substring with a predetermined length in the separated payload for a constant observation period, and extracting a substring having a frequency higher than a predetermined setup value by updating the measured frequency information to a substring frequency table, wherein the updating includes increasing said frequency information of the substring that is less frequently shown previously by a larger increment amount; and a signature candidate extractor for generating a signature by collecting the extracted substring information of the substring frequency table and the generated traffic information, updating a signature frequency table, and extracting a signature candidate with reference to the signature frequency table. 14. The apparatus according to claim 1 , wherein the signature frequency table includes a field denoting an observation period of each entry. | 0.878448 |
7,962,438 | 10 | 14 | 10. The system of claim 9 wherein the one or more relationships are established using a cluster analysis. | 10. The system of claim 9 wherein the one or more relationships are established using a cluster analysis. 14. The system of claim 10 wherein the cluster analysis further comprises conceptual clustering. | 0.533981 |
8,533,211 | 1 | 7 | 1. A computer-implemented method for bridging terminology differences between at least two subject areas, comprising executing the following steps on a computer: computing a first affinity measure between a first term in a first corpus, corresponding to a first subject area, and a bridge term; computing a second affinity measure between a second term in a second corpus, corresponding to a second subject area, and the bridge term; computing a third affinity measure between the first term and the second term based on the first affinity measure and the second affinity measure; wherein the bridge term is a term that appears in both the first corpus and the second corpus, wherein computing at least one of the first affinity measure and the second affinity measure comprises computing a transitive closure of an affinity matrix of at least one of the first corpus and the second corpus; assigning a score for a pair of terms in the transitive closure of the affinity matrix using a composite path probability, wherein the composite path probability is a computation of a sum of path probabilities for n paths between the pair of terms, wherein n is an integer greater than 0. | 1. A computer-implemented method for bridging terminology differences between at least two subject areas, comprising executing the following steps on a computer: computing a first affinity measure between a first term in a first corpus, corresponding to a first subject area, and a bridge term; computing a second affinity measure between a second term in a second corpus, corresponding to a second subject area, and the bridge term; computing a third affinity measure between the first term and the second term based on the first affinity measure and the second affinity measure; wherein the bridge term is a term that appears in both the first corpus and the second corpus, wherein computing at least one of the first affinity measure and the second affinity measure comprises computing a transitive closure of an affinity matrix of at least one of the first corpus and the second corpus; assigning a score for a pair of terms in the transitive closure of the affinity matrix using a composite path probability, wherein the composite path probability is a computation of a sum of path probabilities for n paths between the pair of terms, wherein n is an integer greater than 0. 7. The method of claim 1 , further comprising augmenting a query comprising the first term of the first corpus by adding to the query: (i) the bridge term; and (ii) the second term of the second corpus. | 0.5 |
8,024,733 | 47 | 50 | 47. The apparatus of claim 26 , wherein the processor executes the computer executable instructions to: partition a batch job by the batch container; divide an input stream into a plurality of partitions of the input stream by the batch container; and execute a plurality of instances of the batch component, wherein each instance of the batch component within the plurality of instances of the batch component operates on a respective partition of the input stream. | 47. The apparatus of claim 26 , wherein the processor executes the computer executable instructions to: partition a batch job by the batch container; divide an input stream into a plurality of partitions of the input stream by the batch container; and execute a plurality of instances of the batch component, wherein each instance of the batch component within the plurality of instances of the batch component operates on a respective partition of the input stream. 50. The apparatus of claim 47 , wherein initiation of the plurality of instances of the batch component by the batch container is staggered. | 0.583333 |
8,458,602 | 1 | 11 | 1. A method for providing characters for efficient display in a common room of an online entertainment system including at least one server, said method comprising the steps of: providing a common area for participation by a plurality of characters engaging in the online entertainment system, said plurality of characters including a specific character of a particular user; receiving input which enables selecting a portion of said common area for display to said particular user using said server; determining a set of local characters from said plurality of characters that are stored in said server and are linked to users, wherein said set of local characters are characters that are present in said portion of said common area; analyzing information in said server that is linked to said set of local characters or linked to a corresponding user of said set of local characters for matching a selected criteria linked to said specific character or linked to said particular user; determining a subset of said set of local characters for display to said particular user as being present in said portion of said common area, wherein said subset is generated using said selected criteria to determine said subset from said set and where said subset includes fewer characters than said set; and said server outputting data for displaying said subset of said set of local characters to a user computer associated with said particular user, wherein said data has said subset of said set of local characters for display on the user computer with fewer characters than said set of local characters, thereby resulting in displaying less than all of those of said plurality of characters that are present in said portion of said common area, wherein said selected criteria includes whether each one of said characters or their corresponding user is on a friend's list of said specific character or said particular user. | 1. A method for providing characters for efficient display in a common room of an online entertainment system including at least one server, said method comprising the steps of: providing a common area for participation by a plurality of characters engaging in the online entertainment system, said plurality of characters including a specific character of a particular user; receiving input which enables selecting a portion of said common area for display to said particular user using said server; determining a set of local characters from said plurality of characters that are stored in said server and are linked to users, wherein said set of local characters are characters that are present in said portion of said common area; analyzing information in said server that is linked to said set of local characters or linked to a corresponding user of said set of local characters for matching a selected criteria linked to said specific character or linked to said particular user; determining a subset of said set of local characters for display to said particular user as being present in said portion of said common area, wherein said subset is generated using said selected criteria to determine said subset from said set and where said subset includes fewer characters than said set; and said server outputting data for displaying said subset of said set of local characters to a user computer associated with said particular user, wherein said data has said subset of said set of local characters for display on the user computer with fewer characters than said set of local characters, thereby resulting in displaying less than all of those of said plurality of characters that are present in said portion of said common area, wherein said selected criteria includes whether each one of said characters or their corresponding user is on a friend's list of said specific character or said particular user. 11. The method of claim 1 , wherein said server updates said subset to accommodate changes in the set of local characters due to said specific character moving out of a previous portion of said common area to a new portion of said common area and/or due to other characters of said set of local characters moving into or out of said portion of said common area, wherein said subset is determined based on those of said set of local characters found in the portion of said common area where said specific character is currently present. | 0.5 |
10,067,920 | 1 | 3 | 1. A method, comprising: identifying, using a processing device, a reference point associated with a prior document version, the reference point referencing a prior version of a document stored in a parallel cache that stores multiple versions of the document; comparing, using the processing device, at least one prior document element included in the prior document version with at least one current document element included in a current document version; generating, using the processing device, an updated current document version by updating the current document version with at least one of a visual representation or an auditory representation based at least in part on differences between the at least one prior document element and the at least one current document element; and presenting, using the processing device the updated current document version for display; wherein the at least one prior document element included in the prior document version is stored as a first document object model (DOM) element tree; and wherein at least one current document element included in a current document version is stored as a second DOM element tree. | 1. A method, comprising: identifying, using a processing device, a reference point associated with a prior document version, the reference point referencing a prior version of a document stored in a parallel cache that stores multiple versions of the document; comparing, using the processing device, at least one prior document element included in the prior document version with at least one current document element included in a current document version; generating, using the processing device, an updated current document version by updating the current document version with at least one of a visual representation or an auditory representation based at least in part on differences between the at least one prior document element and the at least one current document element; and presenting, using the processing device the updated current document version for display; wherein the at least one prior document element included in the prior document version is stored as a first document object model (DOM) element tree; and wherein at least one current document element included in a current document version is stored as a second DOM element tree. 3. The method of claim 1 , further comprising identifying a set of differences between the at least one prior document element and the at least one current document element. | 0.677239 |
9,519,718 | 1 | 2 | 1. A computer implemented method for detecting web information comprising: pre-extracting keywords from a web page; storing a corresponding relationship between the extracted keywords and a URL of the web page in a database; obtaining source file information of a web page to be detected; searching the database for the keywords that have the same URL as that of the web page to be detected; comparing the searched keywords to the obtained source file information of the web page; and determining that said web page exists according to a matching degree P; wherein the step of pre-extracting comprises: (1) obtaining source file information of the web page, (2) extracting a main body text from the source file information, and (3) extracting the keywords from the main body text; and wherein step (1) comprises: emulating a HTTP request for returning an information status code, wherein if the code is not 200 or if something unusual occurs, the information of the web page will be deleted, otherwise, step (1) further comprises: obtaining a bit array and a coding format of the source file, and utilizing the obtained coding format to convert the obtained bit array of the source file into a character formatted source file. | 1. A computer implemented method for detecting web information comprising: pre-extracting keywords from a web page; storing a corresponding relationship between the extracted keywords and a URL of the web page in a database; obtaining source file information of a web page to be detected; searching the database for the keywords that have the same URL as that of the web page to be detected; comparing the searched keywords to the obtained source file information of the web page; and determining that said web page exists according to a matching degree P; wherein the step of pre-extracting comprises: (1) obtaining source file information of the web page, (2) extracting a main body text from the source file information, and (3) extracting the keywords from the main body text; and wherein step (1) comprises: emulating a HTTP request for returning an information status code, wherein if the code is not 200 or if something unusual occurs, the information of the web page will be deleted, otherwise, step (1) further comprises: obtaining a bit array and a coding format of the source file, and utilizing the obtained coding format to convert the obtained bit array of the source file into a character formatted source file. 2. The method according to claim 1 , wherein the step (1) further comprises: extracting a title from the information of the source file, and segmenting the title; wherein if there is no title or the title cannot be segmented, then the title will be set as empty. | 0.574675 |
9,813,366 | 1 | 12 | 1. A computer program product embodied on a non-transitory computer readable medium, comprising code executable by a computer having a processor and a graphical user interface and arranged to communicate with at least one music messaging software-as-a-service platform, to cause the computer to carry out the following steps: accessing the at least one music messaging software-as-a-service platform; communicating to the at least one music messaging software-as-a-service platform a set of first information, the set of first information including a message personalized for an intended recipient; selecting, via the graphical user interface, at least one category of pre-existing recording to be retrieved; retrieving, from the at least one music messaging software-as-a-service platform, at least one pre-existing recording, said pre-existing recording associated with the at least one selected category; selecting, via the graphical user interface, a desired lyric phrase from within a preexisting recording; communicating the selection of the desired lyric phrase to the at least one music messaging software-as-a-service platform in the form of non-audio data identifying a lyric phrase from an audio recording, the at least one music messaging software-as-a-service platform comprising an audio extraction engine that (i) receives the non-audio data identifying the lyric phrase together with an instance of the audio recording, (ii) identifies a portion of the audio recording where the lyric phrase is likely to be found at least in part by mapping each word in the lyric phrase to one and only vocal interval determined to exist in the audio recording, (iii) extracts the portion of the audio recording into a short snippet; and (iv) writes the short snippet into a database; and directing, the at least one music messaging software-as-a-service platform, via the graphical user interface, to generate, output, and deliver a music message note for the intended recipient, wherein the music message note is based on the short snippet. | 1. A computer program product embodied on a non-transitory computer readable medium, comprising code executable by a computer having a processor and a graphical user interface and arranged to communicate with at least one music messaging software-as-a-service platform, to cause the computer to carry out the following steps: accessing the at least one music messaging software-as-a-service platform; communicating to the at least one music messaging software-as-a-service platform a set of first information, the set of first information including a message personalized for an intended recipient; selecting, via the graphical user interface, at least one category of pre-existing recording to be retrieved; retrieving, from the at least one music messaging software-as-a-service platform, at least one pre-existing recording, said pre-existing recording associated with the at least one selected category; selecting, via the graphical user interface, a desired lyric phrase from within a preexisting recording; communicating the selection of the desired lyric phrase to the at least one music messaging software-as-a-service platform in the form of non-audio data identifying a lyric phrase from an audio recording, the at least one music messaging software-as-a-service platform comprising an audio extraction engine that (i) receives the non-audio data identifying the lyric phrase together with an instance of the audio recording, (ii) identifies a portion of the audio recording where the lyric phrase is likely to be found at least in part by mapping each word in the lyric phrase to one and only vocal interval determined to exist in the audio recording, (iii) extracts the portion of the audio recording into a short snippet; and (iv) writes the short snippet into a database; and directing, the at least one music messaging software-as-a-service platform, via the graphical user interface, to generate, output, and deliver a music message note for the intended recipient, wherein the music message note is based on the short snippet. 12. The computer program product of claim 1 , sending messages requires a sender user account, and wherein the sender user account has a user credit balance comprising at least one of earned credits and paid-for credits. | 0.731051 |
7,761,175 | 1 | 16 | 1. An apparatus for the input of symbols, comprising: a plurality of keys for inputting symbols, said plurality of keys having both: a) a digit, and b) at least one punctuation symbol assigned to the keys, said keys characterized in that, for each key having a digit and a punctuation symbol assigned to it: the punctuation symbols and digits are overlapped in fonts and the at least one punctuation symbol associated with the key is morphically similar to the digit assigned to the key, wherein the at least one punctuation symbol is assigned to the key based upon at least the punctuation symbol being morphically similar to the digit assigned to the key, such that: the punctuation symbol and digit occupy substantially the same keypad surface real estate when the punctuation symbols and digits are overlapped in fonts, wherein said at least one punctuation symbol and said digit being presented at a same time. | 1. An apparatus for the input of symbols, comprising: a plurality of keys for inputting symbols, said plurality of keys having both: a) a digit, and b) at least one punctuation symbol assigned to the keys, said keys characterized in that, for each key having a digit and a punctuation symbol assigned to it: the punctuation symbols and digits are overlapped in fonts and the at least one punctuation symbol associated with the key is morphically similar to the digit assigned to the key, wherein the at least one punctuation symbol is assigned to the key based upon at least the punctuation symbol being morphically similar to the digit assigned to the key, such that: the punctuation symbol and digit occupy substantially the same keypad surface real estate when the punctuation symbols and digits are overlapped in fonts, wherein said at least one punctuation symbol and said digit being presented at a same time. 16. The Apparatus of claim 1 , wherein said at least one punctuation symbol being assigned to the key based upon at least the punctuation symbol being morphically similar to the digit assigned to the key, is a visually morphically similar type of morphic similarity, wherein said visually similar type of morphic similarity is a non-functional type of morphic similarity. | 0.818848 |
9,852,348 | 1 | 6 | 1. A computer implemented method, the method comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document. | 1. A computer implemented method, the method comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document. 6. The method of claim 1 , wherein a number of matching shape descriptors between the first set of vectors associated with the first text image and the second set of vectors associated with the second text image satisfies a threshold number of matching shape descriptors. | 0.780744 |
7,849,070 | 1 | 16 | 1. A method for dynamically ranking links to items of audio content returned to a user in response to the execution of a query by a search engine, the method comprising: receiving a query to identify links to one or more items of audio content; parsing the query into one or more logical units; determining an annotation for each of the one or more logical units, wherein the annotation is related to audio content; identifying a context of search according to the annotation for each of the one or more logical units and the query to identify links; selecting a ranking heuristic according to the annotation for each of the one or more logical units, wherein Selecting the ranking heuristic comprises selecting an algorithm for ranking items of audio content available from structured sources higher than audio content available from unstructured sources; ranking a result set according to the context of search and selected ranking heuristic; and providing a set of links for navigating to a preferred provider of an item in the result set, wherein the preferred provider provides audio content and is designated by a user in a user profile. | 1. A method for dynamically ranking links to items of audio content returned to a user in response to the execution of a query by a search engine, the method comprising: receiving a query to identify links to one or more items of audio content; parsing the query into one or more logical units; determining an annotation for each of the one or more logical units, wherein the annotation is related to audio content; identifying a context of search according to the annotation for each of the one or more logical units and the query to identify links; selecting a ranking heuristic according to the annotation for each of the one or more logical units, wherein Selecting the ranking heuristic comprises selecting an algorithm for ranking items of audio content available from structured sources higher than audio content available from unstructured sources; ranking a result set according to the context of search and selected ranking heuristic; and providing a set of links for navigating to a preferred provider of an item in the result set, wherein the preferred provider provides audio content and is designated by a user in a user profile. 16. The method of claim 1 wherein selecting the ranking heuristic comprises selecting an algorithm for ranking items of audio content according to the completeness of metadata associated with an item of audio content. | 0.549793 |
8,903,894 | 7 | 8 | 7. A first apparatus according to claim 1 , wherein said causing means comprises modifying means for obtaining, from the first data, modified first data which is included in the second HTTP response, wherein said modifying means modifies markup language code in the first data such that the web browser of the second apparatus, by processing the modified markup language code, generates the second HTTP request. | 7. A first apparatus according to claim 1 , wherein said causing means comprises modifying means for obtaining, from the first data, modified first data which is included in the second HTTP response, wherein said modifying means modifies markup language code in the first data such that the web browser of the second apparatus, by processing the modified markup language code, generates the second HTTP request. 8. A first apparatus according to claim 7 , wherein the markup language code is HTML code, and wherein said causing means comprises means for sending data relating to the modified markup language code for receipt by the second apparatus so that the web browser processes the modified markup language code. | 0.5 |
9,678,948 | 17 | 23 | 17. A computer program product for determining a sentiment of an electronic message, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform: providing sentiment dictionaries and false-positive dictionaries with associated sentiment indicators, wherein a sentiment dictionary and a false-positive dictionary are provided for each type of sentiment, wherein the sentiment dictionary includes sub-constructs that are correctly classified as the associated sentiment indicator, and wherein the false-positive dictionary includes sub-constructs that are incorrectly classified as the associated sentiment indicator; parsing the electronic message to identify one or more sub-constructs; finding a first sub-construct of the one or more sub-constructs in a false-positive dictionary from the false-positive dictionaries that indicates that the first sub-construct is incorrectly classified as the associated sentiment indicator of the false-positive dictionary; for each of the one or more sub-constructs, other than the first sub-construct, that are not found in the false-positive dictionaries, finding that sub-construct in a sentiment dictionary from the sentiment dictionaries; assigning a score for the associated sentiment indicator; and applying a rule that includes the sub-construct and another sub-construct from the one or more sub-constructs to adjust the score; obtaining a final score for each type of sentiment indicator in the electronic message by summing scores for sub-constructs having been assigned the score for that type of sentiment indicator without counting the first sub-construct that has been found in the false-positive dictionary; and based on the final score for each type of sentiment indicator, identifying the sentiment of the electronic message. | 17. A computer program product for determining a sentiment of an electronic message, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform: providing sentiment dictionaries and false-positive dictionaries with associated sentiment indicators, wherein a sentiment dictionary and a false-positive dictionary are provided for each type of sentiment, wherein the sentiment dictionary includes sub-constructs that are correctly classified as the associated sentiment indicator, and wherein the false-positive dictionary includes sub-constructs that are incorrectly classified as the associated sentiment indicator; parsing the electronic message to identify one or more sub-constructs; finding a first sub-construct of the one or more sub-constructs in a false-positive dictionary from the false-positive dictionaries that indicates that the first sub-construct is incorrectly classified as the associated sentiment indicator of the false-positive dictionary; for each of the one or more sub-constructs, other than the first sub-construct, that are not found in the false-positive dictionaries, finding that sub-construct in a sentiment dictionary from the sentiment dictionaries; assigning a score for the associated sentiment indicator; and applying a rule that includes the sub-construct and another sub-construct from the one or more sub-constructs to adjust the score; obtaining a final score for each type of sentiment indicator in the electronic message by summing scores for sub-constructs having been assigned the score for that type of sentiment indicator without counting the first sub-construct that has been found in the false-positive dictionary; and based on the final score for each type of sentiment indicator, identifying the sentiment of the electronic message. 23. The computer program product of claim 17 , wherein the computer readable program code, when executed by the processor of the computer, is configured to perform: storing one or more parsing rules that are created using the sentiment dictionaries and the false-positive dictionaries. | 0.5 |
5,418,718 | 3 | 4 | 3. In a data processing system having a computer processor, a memory and a text input and output means, a computer implemented method for providing linguistic functions of text in a structured document which presents single-byte character set (SBCS) and double-byte character set (DBCS) text in the same document, comprising the steps of: inputting in said memory of said system a first alphanumeric character; determining in said computer processor of said system whether said input character is SBCS or DBCS; determining in said memory of said system a current document position; inserting in said memory of said system the input character into a DBCS text node if the input character is determined to be DBCS; inserting in said memory of said system a character into an SBCS text node if the input character is determined to be SBCS; creating in said memory of said system a DBCS text node and inserting the character therein if the input character is determined to be a DBCS character and a document position is determined to be SBCS; setting in said memory of said system a linguistic flag to an initial value which assumes that the DBCS text string is correctly spelled; performing in said computer processor of said system a spell verification operation on said DBCS text string; changing in said memory of said system said linguistic flag to represent a misspelling of said DBCS text strings as determined by said step of performing said spell verification; displaying in said output means of said system said misspelled DBCS text string in a highlighted mode to emphasize a location of a misspelled DBCS text string, | 3. In a data processing system having a computer processor, a memory and a text input and output means, a computer implemented method for providing linguistic functions of text in a structured document which presents single-byte character set (SBCS) and double-byte character set (DBCS) text in the same document, comprising the steps of: inputting in said memory of said system a first alphanumeric character; determining in said computer processor of said system whether said input character is SBCS or DBCS; determining in said memory of said system a current document position; inserting in said memory of said system the input character into a DBCS text node if the input character is determined to be DBCS; inserting in said memory of said system a character into an SBCS text node if the input character is determined to be SBCS; creating in said memory of said system a DBCS text node and inserting the character therein if the input character is determined to be a DBCS character and a document position is determined to be SBCS; setting in said memory of said system a linguistic flag to an initial value which assumes that the DBCS text string is correctly spelled; performing in said computer processor of said system a spell verification operation on said DBCS text string; changing in said memory of said system said linguistic flag to represent a misspelling of said DBCS text strings as determined by said step of performing said spell verification; displaying in said output means of said system said misspelled DBCS text string in a highlighted mode to emphasize a location of a misspelled DBCS text string, 4. The method of claim 3 which further comprises the steps of: invoking a spelling correction program execution in said computer processor of said system in response to the presence of said highlighted display for said misspelled DBCS text string; correcting the spelling of misspelled DBCS text string; changing said linguistic flag in said DBCS text node in said memory of said system to represent a correctly spelled DBCS text string therein; removing said highlighted emphasis from said displayed text string. | 0.5 |
4,847,784 | 1 | 6 | 1. A knowledge system comprising a computer having a memory, said memory storing a knowledge base encoding knowledge about a particular subject domain, said computer having a knowledge base interpreter for interpreting said knowledge base to solve specified problems pertaining to said subject domain and to indicate the methods of solution to a subject system, said memory further storing information about the status of the solution of said problems by said knowledge base interpreter, said knowledge base interpreter including means for changing said information about the status of the solution of said problems during said interpreting of said knowledge base, and an evaluation system communicating with said subject system and accessing the knowledge in said knowledge base, said evaluation system including means for probing said subject system about selected portions of said knowledge about said subject domain to obtain responses from said subject system, and means for comparing said responses from said subject system to said selected portions of said knowledge about said subject domain to evaluate the subject system's knowledge and performance with respect to said subject domain, said means for probing and said means for comparing being operative during the operation of said knowledge base interpreter, wherein said knowledge base further encodes knowledge defining a set of interrupt conditions of said status of said solution of said problems, and wherein said computer further includes means for determining whether any of said interrupt conditions occur in said status of the solution of said problems and thereupon interrupting the interpreting of said knowledge base to solve said problems and activating said evaluating system to probe said subject system about the interrupt condition having occurred so that the subject system's knowledge and performance are evaluated while the methods of solution to said specified problems are indicated to said subject system. | 1. A knowledge system comprising a computer having a memory, said memory storing a knowledge base encoding knowledge about a particular subject domain, said computer having a knowledge base interpreter for interpreting said knowledge base to solve specified problems pertaining to said subject domain and to indicate the methods of solution to a subject system, said memory further storing information about the status of the solution of said problems by said knowledge base interpreter, said knowledge base interpreter including means for changing said information about the status of the solution of said problems during said interpreting of said knowledge base, and an evaluation system communicating with said subject system and accessing the knowledge in said knowledge base, said evaluation system including means for probing said subject system about selected portions of said knowledge about said subject domain to obtain responses from said subject system, and means for comparing said responses from said subject system to said selected portions of said knowledge about said subject domain to evaluate the subject system's knowledge and performance with respect to said subject domain, said means for probing and said means for comparing being operative during the operation of said knowledge base interpreter, wherein said knowledge base further encodes knowledge defining a set of interrupt conditions of said status of said solution of said problems, and wherein said computer further includes means for determining whether any of said interrupt conditions occur in said status of the solution of said problems and thereupon interrupting the interpreting of said knowledge base to solve said problems and activating said evaluating system to probe said subject system about the interrupt condition having occurred so that the subject system's knowledge and performance are evaluated while the methods of solution to said specified problems are indicated to said subject system. 6. The knowledge system as claimed in claim 1, wherein said means for probing includes means for probing said subject system for conclusions, means for probing said subject system for factors that support said conclusions, and means for probing said subject system for values of factors that are consistent with said conclusions. | 0.714905 |
8,276,063 | 9 | 10 | 9. A modeling system comprising: a processor having a memory; a program module stored in said memory, wherein said program module includes instructions for: receiving by a software module at least one web-based language import/export file containing information specifying parameters of the product to be manufactured; determining if the import/export file is valid in response to tags in the import/export file being correctly configured; determining if the import/export file includes a configuration element identifying an import configuration file; loading a configuration file, the configuration file being one of the identified import configuration file or a default configuration file, and setting variables and tags in the configuration file; comparing each element in the import/export file to part configuration elements in the configuration file to determine whether the elements in the import/export file are valid for inputting into a model, and when elements in the import/export file are valid for inputting into a model, then using the import/export file to create a template that is imported into a solid modeling program for modeling the product. | 9. A modeling system comprising: a processor having a memory; a program module stored in said memory, wherein said program module includes instructions for: receiving by a software module at least one web-based language import/export file containing information specifying parameters of the product to be manufactured; determining if the import/export file is valid in response to tags in the import/export file being correctly configured; determining if the import/export file includes a configuration element identifying an import configuration file; loading a configuration file, the configuration file being one of the identified import configuration file or a default configuration file, and setting variables and tags in the configuration file; comparing each element in the import/export file to part configuration elements in the configuration file to determine whether the elements in the import/export file are valid for inputting into a model, and when elements in the import/export file are valid for inputting into a model, then using the import/export file to create a template that is imported into a solid modeling program for modeling the product. 10. The system of claim 9 , further comprising an input module for receiving said information, and storing said information in said at least one web-based language file. | 0.603286 |
9,904,732 | 7 | 12 | 7. A non-transitory computer readable medium comprising computer software stored thereon improving the way a computer performs an internet search, said software comprising: index server code maintaining dynamic indices to internet web pages and employing a preexisting plurality of topic categories whose contents, including topics and links not provided by a particular end user, are maintained and updated by said index server code without end user intervention being required, wherein a master index is maintained as well as an end user's index for each user as customized by each user; link code updating the end user's index to include any subset of the plurality of topic categories specified by the end user; link code adding to an electronic medium controlled by the end user link information permitting execution of searches via said index server code in any category of said subset but only of categories in said subset; and link code permitting the end user to propose addition of an internet web page to said master index code in conjunction with one or more categories of said subset and automatically adding said proposed page to those indexed by said end user's index code wherein the end user can search said proposed page via said link information and wherein initially other users will not search said proposed page even if searching said proposed one or more categories; and wherein the index server updates web pages in the topic categories of the master index and the end user's index without any end user intervention and permits the end user to create and organize search indexes specific to the end user's needs. | 7. A non-transitory computer readable medium comprising computer software stored thereon improving the way a computer performs an internet search, said software comprising: index server code maintaining dynamic indices to internet web pages and employing a preexisting plurality of topic categories whose contents, including topics and links not provided by a particular end user, are maintained and updated by said index server code without end user intervention being required, wherein a master index is maintained as well as an end user's index for each user as customized by each user; link code updating the end user's index to include any subset of the plurality of topic categories specified by the end user; link code adding to an electronic medium controlled by the end user link information permitting execution of searches via said index server code in any category of said subset but only of categories in said subset; and link code permitting the end user to propose addition of an internet web page to said master index code in conjunction with one or more categories of said subset and automatically adding said proposed page to those indexed by said end user's index code wherein the end user can search said proposed page via said link information and wherein initially other users will not search said proposed page even if searching said proposed one or more categories; and wherein the index server updates web pages in the topic categories of the master index and the end user's index without any end user intervention and permits the end user to create and organize search indexes specific to the end user's needs. 12. The computer readable medium of claim 7 wherein said permitting code is reexecutable by the end user at any time, whereby said link information is dynamically updated to correspond to a new subset. | 0.648601 |
8,160,986 | 1 | 6 | 1. A method for identifying information placed on a good to be processed, and a way of processing depends on the information, which comprises the steps of: determining the information by an information determining device; converting the information into processed information; passing the processed information to an information retrieval system; delivering the processed information to a plurality of artificial intelligence packages; analyzing the processed information in each of the plurality of artificial intelligence packages and for each of the artificial intelligence packages identifying preliminary results; evaluating the preliminary results to identify a most probable result among the preliminary results best matching the information; and assigning the most probable result to the good; the steps of determining the information by the information determining device, converting the information into the processed information, and passing the processed information to the information retrieval system, further including the steps of: reading the information with an identifier and speaking the information as a voice message into the information retrieval system; providing the artificial intelligence packages as voice recognition systems; and carrying out the evaluation of the preliminary results by means of conditional probabilities of correct recognition, with a determination of the conditional probabilities involving a plurality of identification parameters, and an identification parameter of said plurality being a number of voice recognition systems yielding a same preliminary result in a result list. | 1. A method for identifying information placed on a good to be processed, and a way of processing depends on the information, which comprises the steps of: determining the information by an information determining device; converting the information into processed information; passing the processed information to an information retrieval system; delivering the processed information to a plurality of artificial intelligence packages; analyzing the processed information in each of the plurality of artificial intelligence packages and for each of the artificial intelligence packages identifying preliminary results; evaluating the preliminary results to identify a most probable result among the preliminary results best matching the information; and assigning the most probable result to the good; the steps of determining the information by the information determining device, converting the information into the processed information, and passing the processed information to the information retrieval system, further including the steps of: reading the information with an identifier and speaking the information as a voice message into the information retrieval system; providing the artificial intelligence packages as voice recognition systems; and carrying out the evaluation of the preliminary results by means of conditional probabilities of correct recognition, with a determination of the conditional probabilities involving a plurality of identification parameters, and an identification parameter of said plurality being a number of voice recognition systems yielding a same preliminary result in a result list. 6. The method according to claim 1 , wherein the conditional probabilities contain a human factor. | 0.825623 |
7,610,290 | 16 | 19 | 16. A computer readable medium comprising computer-executable instructions for performing a process comprising: receiving a registration request from each search provider, wherein the registration request invokes at least one registration function via an API (“Application Programming Interface”), wherein a respective registration request includes a plurality of query properties of an associated search provider, the plurality of query properties including a list of at least one data property name, query comparison operators, a number of operands for each of the query comparison operators, syntactic data value types for each operand and localization information about display strings; receiving an initial request to perform a search from a user; configuring a user interface based on the query properties of each respective search provider; displaying the user interface for the search providers to the user based upon the query properties of each respective search provider; receiving a query from the user; forming a parse tree representation of the query; marshaling the parse tree representation to a selected number of search providers using a call by value protocol, wherein each search provider is associated with a specific type of content and respective search functionality for that content, the associated content for each of the search providers being mutually exclusive. | 16. A computer readable medium comprising computer-executable instructions for performing a process comprising: receiving a registration request from each search provider, wherein the registration request invokes at least one registration function via an API (“Application Programming Interface”), wherein a respective registration request includes a plurality of query properties of an associated search provider, the plurality of query properties including a list of at least one data property name, query comparison operators, a number of operands for each of the query comparison operators, syntactic data value types for each operand and localization information about display strings; receiving an initial request to perform a search from a user; configuring a user interface based on the query properties of each respective search provider; displaying the user interface for the search providers to the user based upon the query properties of each respective search provider; receiving a query from the user; forming a parse tree representation of the query; marshaling the parse tree representation to a selected number of search providers using a call by value protocol, wherein each search provider is associated with a specific type of content and respective search functionality for that content, the associated content for each of the search providers being mutually exclusive. 19. The computer readable medium of claim 16 , wherein one or more of the search providers is implemented in an object-oriented programming language. | 0.697154 |
8,375,014 | 1 | 10 | 1. A system comprising: one or more processors; a database schema including a plurality of data sources, each data source including one or more fields for storing data, and metadata defining relationships amongst the fields within or between data sources; a schema parser executed by at least one of the processors and configured to determine one or more datasets of data stored within or referenced from the database schema, wherein a dataset includes one or more fields from the database schema and represents the data stored in the one or more fields; an input handler executed by at least one of the processors and configured to receive a user's selection of one or more of the datasets via a graphical user interface, wherein the input handler is configured to determine that a first graphical icon representing a first dataset is graphically associated within the graphical user interface with a second graphical icon representing a second dataset; a translation engine executed by at least one of the processors and configured to provide, responsive to the graphical association of the first and second icons, operations for refining the data of the selected datasets into a result set via a query, wherein the translation engine is configured to determine which operations to provide based on the relationships of the selected datasets as stored or derived from the metadata, wherein the translation engine is configured to provide the operations to a user via the interface, wherein the operations are provided in a natural language expression corresponding to the relationships as determined from the metadata, wherein the input handler is configured to receive a selection of one of the operations provided by the translation engine; a query engine executed by at least one of the processors and configured to provide a graphical depiction of the query via the interface, the graphical query including operational flow indicators indicating a directional flow of the query from the selected datasets with the selected operation resulting in the result set; and a logic engine executed by at least one of the processors and configured to assemble a machine readable structured query language (SQL) query based on the graphical depiction of the query, wherein the logic engine comprises a plurality of different subroutines, each different subroutine being configured to process a different type of operation represented by a particular type of element in the graphical query to generate a SQL substatement of the elements's operation wherein the logic engine is further configured to incorporate the SQL substatements into a complete machine readable SQL query. | 1. A system comprising: one or more processors; a database schema including a plurality of data sources, each data source including one or more fields for storing data, and metadata defining relationships amongst the fields within or between data sources; a schema parser executed by at least one of the processors and configured to determine one or more datasets of data stored within or referenced from the database schema, wherein a dataset includes one or more fields from the database schema and represents the data stored in the one or more fields; an input handler executed by at least one of the processors and configured to receive a user's selection of one or more of the datasets via a graphical user interface, wherein the input handler is configured to determine that a first graphical icon representing a first dataset is graphically associated within the graphical user interface with a second graphical icon representing a second dataset; a translation engine executed by at least one of the processors and configured to provide, responsive to the graphical association of the first and second icons, operations for refining the data of the selected datasets into a result set via a query, wherein the translation engine is configured to determine which operations to provide based on the relationships of the selected datasets as stored or derived from the metadata, wherein the translation engine is configured to provide the operations to a user via the interface, wherein the operations are provided in a natural language expression corresponding to the relationships as determined from the metadata, wherein the input handler is configured to receive a selection of one of the operations provided by the translation engine; a query engine executed by at least one of the processors and configured to provide a graphical depiction of the query via the interface, the graphical query including operational flow indicators indicating a directional flow of the query from the selected datasets with the selected operation resulting in the result set; and a logic engine executed by at least one of the processors and configured to assemble a machine readable structured query language (SQL) query based on the graphical depiction of the query, wherein the logic engine comprises a plurality of different subroutines, each different subroutine being configured to process a different type of operation represented by a particular type of element in the graphical query to generate a SQL substatement of the elements's operation wherein the logic engine is further configured to incorporate the SQL substatements into a complete machine readable SQL query. 10. The system of claim 1 wherein the logic engine is configured to: determine a local identifier corresponding to a selected dataset from the graphical query; determine one or more fields of the selected dataset associated with the operation for refining the data of the selected dataset; determine the operation corresponding to the one or more fields of the selected dataset; and provide the local identifier, the one or more fields of the selected dataset and operation in a structured query language (SQL) query. | 0.523941 |
5,546,304 | 7 | 8 | 7. A method for administering a telecommunications system comprising an administrable communications entity, an administration database for storing administration data expressed in a native language, the administration database being coupled to the entity and constructed from administration patterns expressed in the native language that are selectively filled in with said administration data, the administration patterns having corresponding indexes for identifying the administration patterns, the administration data expressed in the native language serving to administer the entity, the method comprising the steps of: obtaining an administration pattern including any filled-in administration data expressed in the native language and the index of said administration pattern from the administration database; in response to the obtaining, effecting translation of the obtained pattern including any filled-in administration data through a translation database constructed from equivalents of the administration patterns expressed in a foreign language that are not filled in with the administration data, the translation database being devoid of the administration data but including information that is receivable from an administrator as administration data and expressed in both the native and the foreign languages, by using the index of the obtained administration pattern to find in the translation database the equivalent of the obtained administration pattern, finding among the administrator-enterable information in the translation database information in the foreign language that corresponds to any translatable said administration data in the obtained administration pattern, and filling in the found equivalent of the obtained administration pattern with the found information and any non-translatable said administration data from the obtained administration pattern; in response to the effected pattern translation, presenting the translated pattern including the filled-in information and data to an administrator; receiving from the administrator administration data indicated by the presented pattern and expressed in the foreign language; in response to the receipt, effecting translation of the received data through the translation database into translated data expressed in the native language by finding among the information in the translation database information in the native language that corresponds to any translatable said received data; and in response to the effected data translation, storing the translated data and any non-translatable said data as administration data in the administration database. | 7. A method for administering a telecommunications system comprising an administrable communications entity, an administration database for storing administration data expressed in a native language, the administration database being coupled to the entity and constructed from administration patterns expressed in the native language that are selectively filled in with said administration data, the administration patterns having corresponding indexes for identifying the administration patterns, the administration data expressed in the native language serving to administer the entity, the method comprising the steps of: obtaining an administration pattern including any filled-in administration data expressed in the native language and the index of said administration pattern from the administration database; in response to the obtaining, effecting translation of the obtained pattern including any filled-in administration data through a translation database constructed from equivalents of the administration patterns expressed in a foreign language that are not filled in with the administration data, the translation database being devoid of the administration data but including information that is receivable from an administrator as administration data and expressed in both the native and the foreign languages, by using the index of the obtained administration pattern to find in the translation database the equivalent of the obtained administration pattern, finding among the administrator-enterable information in the translation database information in the foreign language that corresponds to any translatable said administration data in the obtained administration pattern, and filling in the found equivalent of the obtained administration pattern with the found information and any non-translatable said administration data from the obtained administration pattern; in response to the effected pattern translation, presenting the translated pattern including the filled-in information and data to an administrator; receiving from the administrator administration data indicated by the presented pattern and expressed in the foreign language; in response to the receipt, effecting translation of the received data through the translation database into translated data expressed in the native language by finding among the information in the translation database information in the native language that corresponds to any translatable said received data; and in response to the effected data translation, storing the translated data and any non-translatable said data as administration data in the administration database. 8. The method of claim 7 wherein: the step of obtaining comprises the steps of receiving a request from the administrator for an administration pattern, the request expressed in the foreign language; in response to the received request, effecting translation of the received request through the translation database into a translated request expressed in the native language; in response to the effected request translation, communicating the translated request to the administration database; and receiving from the administration database the requested administration pattern expressed in the native language. | 0.5 |
8,756,227 | 1 | 5 | 1. A method comprising: tailoring user specific data of a user to generate tailored user specific data, the user specific data associated with an application and tailored based on one or more aesthetic preferences of the user as indicated by a template for the application; and extending a user profile of the user to comprise the tailored user specific data to generate an extended user profile, at least one of the tailoring or the extending implemented at least in part via a processing unit. | 1. A method comprising: tailoring user specific data of a user to generate tailored user specific data, the user specific data associated with an application and tailored based on one or more aesthetic preferences of the user as indicated by a template for the application; and extending a user profile of the user to comprise the tailored user specific data to generate an extended user profile, at least one of the tailoring or the extending implemented at least in part via a processing unit. 5. The method of claim 1 , the template comprising at least one of extensible markup language (XML), hypertext markup language (HTML), or extensible HTML (XHTML). | 0.5 |
10,002,344 | 1 | 7 | 1. A retail store promotional price tag (PPT) detection and classification system comprising: a store shelf image acquisition module configured to acquire images of a plurality of product display units located in a retail store, the plurality of product display units including a plurality of products arranged on one or more of the product display fixtures, and a plurality of PPTs attached to the product display fixtures, each PPT including one or more printed colors and product-related data including a barcode associated with a respective product proximately located on the product display fixture near the PPT; a device characterization module configured to generate one or more color profiles associated with transforming a plurality of colors associated with the acquired image of the printed PPTs from an image acquisition color space to an original color space associated with a digital representation of the PPTs; a PPT detection and classifier module configured to extract one or more heuristic attributes including color from the acquired images using the one or more color profiles and apply one or more predefined heuristic rules to the heuristic attributes to detect and classify each PPT detected in the acquired images as one of a plurality of PPT types; a mobile base including an operatively associated navigation component configured to determine a location of the mobile base within the retail store; an image capture assembly mounted on the mobile base, the assembly including a plurality of image capture devices for acquiring the images of the plurality of product display units; and a master control unit configured to execute control unit instructions for processing the images of the plurality of product display units at a sequence of locations during a movement of the mobile base in the retail store and thereafter generating a store profile indicating locations of the products and/or PPTs throughout the retail store. | 1. A retail store promotional price tag (PPT) detection and classification system comprising: a store shelf image acquisition module configured to acquire images of a plurality of product display units located in a retail store, the plurality of product display units including a plurality of products arranged on one or more of the product display fixtures, and a plurality of PPTs attached to the product display fixtures, each PPT including one or more printed colors and product-related data including a barcode associated with a respective product proximately located on the product display fixture near the PPT; a device characterization module configured to generate one or more color profiles associated with transforming a plurality of colors associated with the acquired image of the printed PPTs from an image acquisition color space to an original color space associated with a digital representation of the PPTs; a PPT detection and classifier module configured to extract one or more heuristic attributes including color from the acquired images using the one or more color profiles and apply one or more predefined heuristic rules to the heuristic attributes to detect and classify each PPT detected in the acquired images as one of a plurality of PPT types; a mobile base including an operatively associated navigation component configured to determine a location of the mobile base within the retail store; an image capture assembly mounted on the mobile base, the assembly including a plurality of image capture devices for acquiring the images of the plurality of product display units; and a master control unit configured to execute control unit instructions for processing the images of the plurality of product display units at a sequence of locations during a movement of the mobile base in the retail store and thereafter generating a store profile indicating locations of the products and/or PPTs throughout the retail store. 7. The retail store PPT detection and classification system according to claim 1 , wherein the master control unit generates a packaging order and/or printing order for a set of replacement PPTs based on the generated store profile. | 0.631746 |
9,342,233 | 4 | 9 | 4. A method comprising: under control of one or more processors configured with executable instructions, receiving a selection of a term of one or more words in a first digital work; selecting a dictionary based at least in part on metadata providing information related to content of the digital work; identifying two or more occurrences of the term in a second digital work that is different from the first digital work; determining, based in part on the two other occurrences, two or more groups of occurrences of the term, a group of the two or more groups including one or more similar occurrences of the term; and presenting a definition for the term obtained from the dictionary and two or more excerpts of text, each excerpt of text of the two or more excerpts of text including an occurrence of the term from a different group of the two or more groups. | 4. A method comprising: under control of one or more processors configured with executable instructions, receiving a selection of a term of one or more words in a first digital work; selecting a dictionary based at least in part on metadata providing information related to content of the digital work; identifying two or more occurrences of the term in a second digital work that is different from the first digital work; determining, based in part on the two other occurrences, two or more groups of occurrences of the term, a group of the two or more groups including one or more similar occurrences of the term; and presenting a definition for the term obtained from the dictionary and two or more excerpts of text, each excerpt of text of the two or more excerpts of text including an occurrence of the term from a different group of the two or more groups. 9. The method as recited in claim 4 , further comprising, prior to selecting a dictionary, determining that the term is in a different language from a primary language of the first digital work, wherein selecting the dictionary to access further comprises selecting, from a hierarchy of dictionaries, a language dictionary for the different language. | 0.703892 |
8,312,010 | 2 | 7 | 2. The method of claim 1 , wherein the user actions comprise one or more interactions associated with a first business listing of the business listings in a mapping service. | 2. The method of claim 1 , wherein the user actions comprise one or more interactions associated with a first business listing of the business listings in a mapping service. 7. The method of claim 2 , wherein the interactions comprise a user selection of a map location marker corresponding to the first business listing in the mapping service. | 0.5 |
9,146,957 | 5 | 7 | 5. The method of claim 1 , further comprising joining a table that is a subject of the query with an access control list table, creating an IN node in the abstract syntax tree. | 5. The method of claim 1 , further comprising joining a table that is a subject of the query with an access control list table, creating an IN node in the abstract syntax tree. 7. The method of claim 5 , wherein the joining is performed prior to the traversing an abstract syntax tree representing the query. | 0.5 |
8,407,666 | 1 | 10 | 1. A method for generating a client application configured to communicate over a network between an electronic device and a data source, the method comprising: providing a data model representing a state of the client application, the client application including application components comprising one or more of a data component, a message component and a screen component, each of the data component, the message component and the screen component having corresponding component definitions; obtaining the application components from the data model and generating a first application element including code representing the component definitions, expressed in a structured definition language, and a series of instructions; obtaining data source mapping information from the data model and generating a second application element including mapping file descriptors corresponding to the data source mapping information, the mapping file descriptors for use by a server to mediate communication of messages between the electronic device and the data source; and collecting application resources of the client application and for generating a third application element, wherein the first application element, the second application element and third application element are subsequently packaged as the deployable form of the client application. | 1. A method for generating a client application configured to communicate over a network between an electronic device and a data source, the method comprising: providing a data model representing a state of the client application, the client application including application components comprising one or more of a data component, a message component and a screen component, each of the data component, the message component and the screen component having corresponding component definitions; obtaining the application components from the data model and generating a first application element including code representing the component definitions, expressed in a structured definition language, and a series of instructions; obtaining data source mapping information from the data model and generating a second application element including mapping file descriptors corresponding to the data source mapping information, the mapping file descriptors for use by a server to mediate communication of messages between the electronic device and the data source; and collecting application resources of the client application and for generating a third application element, wherein the first application element, the second application element and third application element are subsequently packaged as the deployable form of the client application. 10. The method of claim 1 , wherein the component definitions include script for inclusion with the generated code. | 0.66954 |
9,431,081 | 4 | 5 | 4. The memory device of claim 1 , wherein the word line control unit copies data of memory cells coupled to the frequently activated word line into memory cells coupled to the redundant word line. | 4. The memory device of claim 1 , wherein the word line control unit copies data of memory cells coupled to the frequently activated word line into memory cells coupled to the redundant word line. 5. The memory device of claim 4 , wherein when the data of the memory cells coupled to the frequently activated word line are copied into the memory cells coupled to the redundant word line, the word line control unit activates the redundant word line when the frequently activated word line is activated. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.