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
|
|---|---|---|---|---|---|
10,121,466 | 15 | 16 |
15. A method for re-training a speech recognition system with respect to a word of an application vocabulary, wherein a voice template is assigned to said word in the application vocabulary, the method comprising: acquiring from a user a speech sample of said word using the speech recognition system; comparing, via at least one processor, the speech sample to voice templates in the application vocabulary; and if the speech sample matches more than one of the voice templates in the application vocabulary, then: prompting, via the at least one processor, the user to re-train the speech recognition system using an alternate word in place of said word, wherein the alternate word is a variant of said word; training, via the at least one processor, the speech recognition system on the alternate word to create a voice template for the alternate word; and replacing, via the at least one processor, in the application vocabulary the voice template for said word with the voice template for the alternate word; wherein, during the re-training, the comparison of the speech sample of to the voice templates in the application vocabulary is performed until a voice template corresponding to the alternate word which is different from the voice templates of words in the application vocabulary and having no template similarity with the voice templates of words in the application library is created; wherein the re-training is initiated after an initial enrollment training performed for the speech recognition system before use based on an outcome of a performance evaluation performed periodically by the speech recognition system; and wherein the performance evaluation is associated with recognition performance for the spoken word.
|
15. A method for re-training a speech recognition system with respect to a word of an application vocabulary, wherein a voice template is assigned to said word in the application vocabulary, the method comprising: acquiring from a user a speech sample of said word using the speech recognition system; comparing, via at least one processor, the speech sample to voice templates in the application vocabulary; and if the speech sample matches more than one of the voice templates in the application vocabulary, then: prompting, via the at least one processor, the user to re-train the speech recognition system using an alternate word in place of said word, wherein the alternate word is a variant of said word; training, via the at least one processor, the speech recognition system on the alternate word to create a voice template for the alternate word; and replacing, via the at least one processor, in the application vocabulary the voice template for said word with the voice template for the alternate word; wherein, during the re-training, the comparison of the speech sample of to the voice templates in the application vocabulary is performed until a voice template corresponding to the alternate word which is different from the voice templates of words in the application vocabulary and having no template similarity with the voice templates of words in the application library is created; wherein the re-training is initiated after an initial enrollment training performed for the speech recognition system before use based on an outcome of a performance evaluation performed periodically by the speech recognition system; and wherein the performance evaluation is associated with recognition performance for the spoken word. 16. The method according to claim 15 , comprising, before acquiring the speech sample of said word, determining that the speech recognition system has poor performance.
| 0.5 |
6,026,386 | 1 | 8 |
1. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component that includes data and calculations required for the simulation and communication of information to provide a dynamic, goal based educational learning experience, comprising the steps of: (a) accessing the information in the spreadsheet object component of the rule-based expert system to determine presentation information indicative of a goal; (b) utilizing the information in the spreadsheet object component of the rule-based expert system to integrate goal-based learning information in a structured, dynamic business simulation designed by a profiling component to motivate accomplishment of the goal; (c) querying a student for answers to one or more questions based on one or more learning objectives of the business simulation using a simulated human conversation; (d) monitoring answers to questions posed to evaluate progress toward the goal utilizing the spreadsheet object component of the rule-based expert system and providing dynamic, goal-based, remediation learning information feedback from a remediation object component including a knowledge system and a software tutor comprising an artificial intelligence engine which generates individualized coaching messages that further motivates accomplishment of the goal; (e) analyzing the answers from the student utilizing system tools to compare the answers with a standard for achieving the goal.
|
1. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component that includes data and calculations required for the simulation and communication of information to provide a dynamic, goal based educational learning experience, comprising the steps of: (a) accessing the information in the spreadsheet object component of the rule-based expert system to determine presentation information indicative of a goal; (b) utilizing the information in the spreadsheet object component of the rule-based expert system to integrate goal-based learning information in a structured, dynamic business simulation designed by a profiling component to motivate accomplishment of the goal; (c) querying a student for answers to one or more questions based on one or more learning objectives of the business simulation using a simulated human conversation; (d) monitoring answers to questions posed to evaluate progress toward the goal utilizing the spreadsheet object component of the rule-based expert system and providing dynamic, goal-based, remediation learning information feedback from a remediation object component including a knowledge system and a software tutor comprising an artificial intelligence engine which generates individualized coaching messages that further motivates accomplishment of the goal; (e) analyzing the answers from the student utilizing system tools to compare the answers with a standard for achieving the goal. 8. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component as recited in claim 1, wherein the media information comprises Internet information.
| 0.724324 |
7,555,477 | 22 | 25 |
22. A computer program product for generating conceptual search results including targeted advertisement, comprising: a memory storing computer-executable code; and a processor in communication with the memory and operable to execute the computer-executable code to cause performance of: determining a first concept in response to a query term, determining a second concept in response to the query term, wherein the first concept and the second concept are not related to each other, determining a first advertisement relating to the first concept, determining a second advertisement relating to the second concept, wherein the first advertisement and the second advertisement are not related to each other, determining a first content type in which to represent the first concept, and determining a second content type in which to represent the second concept.
|
22. A computer program product for generating conceptual search results including targeted advertisement, comprising: a memory storing computer-executable code; and a processor in communication with the memory and operable to execute the computer-executable code to cause performance of: determining a first concept in response to a query term, determining a second concept in response to the query term, wherein the first concept and the second concept are not related to each other, determining a first advertisement relating to the first concept, determining a second advertisement relating to the second concept, wherein the first advertisement and the second advertisement are not related to each other, determining a first content type in which to represent the first concept, and determining a second content type in which to represent the second concept. 25. The computer program product of claim 22 , further comprising providing a first image representative of the first concept and a second image representative of the second concept.
| 0.5 |
5,559,969 | 1 | 2 |
1. In a data processing system having a first bus wherein the first bus has a first bus width, the first bus for sequentially transmitting a plurality of first data packets wherein the plurality of first data packets have a first data width, the data processing system further having a second bus wherein the second bus has a second width, the second bus for sequentially transmitting a plurality of second data packets wherein the plurality of second data packets have a second data width, the width of the first bus being less than the width of the second bus, the improvement comprising: a. first programmable formatting means coupled to the first bus and further coupled to the second bus for formatting the plurality of first data packets into a plurality of groups, said first programmable formatting means assembling the plurality of first data packets into the plurality of groups as the plurality of first data packets are sequentially transmitted over the first bus, each of the plurality of groups forming a corresponding one of the plurality of second data packets for sequential transmission over the second bus; and b. first control means coupled to said first programmable formatting means for controlling which of the plurality of first data packets are assembled into each of the plurality of groups.
|
1. In a data processing system having a first bus wherein the first bus has a first bus width, the first bus for sequentially transmitting a plurality of first data packets wherein the plurality of first data packets have a first data width, the data processing system further having a second bus wherein the second bus has a second width, the second bus for sequentially transmitting a plurality of second data packets wherein the plurality of second data packets have a second data width, the width of the first bus being less than the width of the second bus, the improvement comprising: a. first programmable formatting means coupled to the first bus and further coupled to the second bus for formatting the plurality of first data packets into a plurality of groups, said first programmable formatting means assembling the plurality of first data packets into the plurality of groups as the plurality of first data packets are sequentially transmitted over the first bus, each of the plurality of groups forming a corresponding one of the plurality of second data packets for sequential transmission over the second bus; and b. first control means coupled to said first programmable formatting means for controlling which of the plurality of first data packets are assembled into each of the plurality of groups. 2. An improvement according to claim 1 wherein the first bus operates at a higher frequency than the second bus.
| 0.919886 |
8,548,813 | 5 | 6 |
5. A method for electronically displaying a page of an electronic book on a viewer and permitting a user to request a speech-to-text function, comprising: displaying a screen on a viewer; displaying within the screen a page of an electronic book; and displaying a section within the screen for permitting a user to request a speech-to-text conversion for insertion of text into the displayed page of the electronic book.
|
5. A method for electronically displaying a page of an electronic book on a viewer and permitting a user to request a speech-to-text function, comprising: displaying a screen on a viewer; displaying within the screen a page of an electronic book; and displaying a section within the screen for permitting a user to request a speech-to-text conversion for insertion of text into the displayed page of the electronic book. 6. The method of claim 5 , further including displaying a section within the screen for the user to request an end to the speech-to-text conversion.
| 0.5 |
8,775,468 | 1 | 7 |
1. A computer-implemented method for controlling access to structured documents, the method comprising: providing an access control policy for a structured document comprising a plurality of nodes, wherein the access control policy comprises a plurality of access control rules; generating a path for each of the plurality of nodes in the structured document; and generating an executable value expression for each path by normalizing the plurality of access control rules into a format comprising a head, a path, and a condition that indicates who is granted or denied access to each path, generating and populating a condition table to convert the plurality of normalized access control rules into a plurality of modified normalized access control rules, propagating the plurality of modified normalized access control rules for each generated path to identify at least one generated path that is affected by at least one of the plurality of modified normalized access control rules, combining at least two modified normalized access control rules of the plurality of modified normalized access control rules if the at least two modified normalized access control rules affect a particular generated path, optimizing the plurality of modified normalized access control rules by eliminating repeated value expressions, and transforming the plurality of modified normalized access control rules into the executable value expression for each path based on the condition, wherein the executable value expression is utilized during access control evaluation to determine whether a user is allowed to access at least one of the plurality of nodes in the structured document.
|
1. A computer-implemented method for controlling access to structured documents, the method comprising: providing an access control policy for a structured document comprising a plurality of nodes, wherein the access control policy comprises a plurality of access control rules; generating a path for each of the plurality of nodes in the structured document; and generating an executable value expression for each path by normalizing the plurality of access control rules into a format comprising a head, a path, and a condition that indicates who is granted or denied access to each path, generating and populating a condition table to convert the plurality of normalized access control rules into a plurality of modified normalized access control rules, propagating the plurality of modified normalized access control rules for each generated path to identify at least one generated path that is affected by at least one of the plurality of modified normalized access control rules, combining at least two modified normalized access control rules of the plurality of modified normalized access control rules if the at least two modified normalized access control rules affect a particular generated path, optimizing the plurality of modified normalized access control rules by eliminating repeated value expressions, and transforming the plurality of modified normalized access control rules into the executable value expression for each path based on the condition, wherein the executable value expression is utilized during access control evaluation to determine whether a user is allowed to access at least one of the plurality of nodes in the structured document. 7. The method of claim 1 , wherein the generating the value expression for each path further comprises: propagating each of the plurality of normalized access control rules through each path such that access to each path is defined by at least one normalized access control rule; and transforming each of the at least one normalized access control rules affecting each path into a statement indicating who is granted and denied access to the path.
| 0.5 |
8,510,321 | 14 | 25 |
14. A method of accessing and managing a relational database comprising: executing a program of instructions with a machine, the program of instructions being configured to: query a relational database; and access semantically relevant query results from the relational database, wherein to access query results from the relational database further comprises; accessing at least one ontology; extracting domain knowledge from at least one ontology and; employing the domain knowledge in obtaining the semantically relevant query results from the relational database; wherein said semantically relevant query results comprise direct results obtained directly from relational database tables, inferred results inferred utilizing information explicitly listed in the relational database and the at least one ontology, and related results obtained utilizing data in the relational database tables and one or more definitions of similarity of concepts and individuals based on the at least one ontology; and wherein to access semantically relevant query results comprises: applying a query generalization strategy, the query generalization strategy comprising applying strategies to an original query to obtain a generalized level of queries comprising one or more general queries and repeatedly applying the strategies to the generalized level of queries until a prespecified number of results is obtained; and ranking results obtained through the query generalization strategy based on a number generalizations performed.
|
14. A method of accessing and managing a relational database comprising: executing a program of instructions with a machine, the program of instructions being configured to: query a relational database; and access semantically relevant query results from the relational database, wherein to access query results from the relational database further comprises; accessing at least one ontology; extracting domain knowledge from at least one ontology and; employing the domain knowledge in obtaining the semantically relevant query results from the relational database; wherein said semantically relevant query results comprise direct results obtained directly from relational database tables, inferred results inferred utilizing information explicitly listed in the relational database and the at least one ontology, and related results obtained utilizing data in the relational database tables and one or more definitions of similarity of concepts and individuals based on the at least one ontology; and wherein to access semantically relevant query results comprises: applying a query generalization strategy, the query generalization strategy comprising applying strategies to an original query to obtain a generalized level of queries comprising one or more general queries and repeatedly applying the strategies to the generalized level of queries until a prespecified number of results is obtained; and ranking results obtained through the query generalization strategy based on a number generalizations performed. 25. The method according to claim 14 , wherein to access semantically relevant query results comprises employing a description logic reasoner configured to obtain the inferred results based on domain knowledge in the at least one ontology and data listed in the relational database, the description logic reasoner allowing for inferring query results not explicitly stated in the relational database.
| 0.5 |
9,195,456 | 1 | 6 |
1. A method for managing a catalog of scripts, said method comprising: receiving a script; parsing the script; extracting an input from the script; extracting a description of the input that includes the name of a runtime parameter, or the name of a variable that is being set by loading data and any schema associated with the setting of the variable; extracting an output from the script; extracting a description of the output that includes the name of a variable that is being stored and any schema associated with the variable; extracting a body of a query from the script; determining, by a processor, whether the script contains a potentially problematic statement; in response to a determination that the script contains a potentially problematic statement, at least one of fixing the potentially problematic statement and issuing a warning regarding the potentially problematic statement; and storing a description of the script in the catalog of scripts that includes the body of the query and descriptions of the input and the output.
|
1. A method for managing a catalog of scripts, said method comprising: receiving a script; parsing the script; extracting an input from the script; extracting a description of the input that includes the name of a runtime parameter, or the name of a variable that is being set by loading data and any schema associated with the setting of the variable; extracting an output from the script; extracting a description of the output that includes the name of a variable that is being stored and any schema associated with the variable; extracting a body of a query from the script; determining, by a processor, whether the script contains a potentially problematic statement; in response to a determination that the script contains a potentially problematic statement, at least one of fixing the potentially problematic statement and issuing a warning regarding the potentially problematic statement; and storing a description of the script in the catalog of scripts that includes the body of the query and descriptions of the input and the output. 6. The method according to claim 1 , further comprising: providing an interface to the catalog of scripts; receiving a selection of a plurality of scripts from the catalog of scripts, wherein the selected plurality of scripts is to perform a predetermined function; and performing a combined operation by merging the selected plurality of scripts together.
| 0.5 |
7,730,465 | 15 | 16 |
15. The system of claim 1 , wherein the npart comprises a GCHandle (Garbage Collector Handle) to a corresponding mpart.
|
15. The system of claim 1 , wherein the npart comprises a GCHandle (Garbage Collector Handle) to a corresponding mpart. 16. The system of claim 15 , wherein the GCHandle is Normal.
| 0.5 |
7,786,994 | 1 | 16 |
1. A machine-readable storage medium comprising machine-readable instructions that, when executed by the machine, cause the machine to perform a method comprising: receiving an indication of at least one command relating to text that contains at least one first glyph; determining that the at least one first glyph maps to multiple corresponding Unicode representations, the multiple corresponding Unicode representations defining a collision; resolving the collision such that the at least one first glyph maps to only a single Unicode representation of the multiple corresponding Unicode representations; converting the at least one first glyph to the single corresponding Unicode representation in response to the command; performing the command on the single Unicode representation of the at least one first glyph; creating at least one further glyph for the single Unicode representation of the at least one first glyph; and mapping the at least one further glyph element to the at least one first glyph via a glyph substitution table, the glyph substitution table having data structures to enable mapping via: a) single substitution; b) multiple substitution; c) alternative substitution; d) ligature substitution; and e) context substitution.
|
1. A machine-readable storage medium comprising machine-readable instructions that, when executed by the machine, cause the machine to perform a method comprising: receiving an indication of at least one command relating to text that contains at least one first glyph; determining that the at least one first glyph maps to multiple corresponding Unicode representations, the multiple corresponding Unicode representations defining a collision; resolving the collision such that the at least one first glyph maps to only a single Unicode representation of the multiple corresponding Unicode representations; converting the at least one first glyph to the single corresponding Unicode representation in response to the command; performing the command on the single Unicode representation of the at least one first glyph; creating at least one further glyph for the single Unicode representation of the at least one first glyph; and mapping the at least one further glyph element to the at least one first glyph via a glyph substitution table, the glyph substitution table having data structures to enable mapping via: a) single substitution; b) multiple substitution; c) alternative substitution; d) ligature substitution; and e) context substitution. 16. The machine-readable storage medium of claim 1 , wherein the multiple substitution substitutes the at least one first glyph element with a plurality of additional glyph elements.
| 0.653992 |
9,807,442 | 1 | 3 |
1. A media content based exposure measuring apparatus, comprising: a memory; a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to: obtain program listing data including a plurality of marked tags representing a plurality of marked media segments; provide the obtained program listing data including the plurality of marked media tags representing the plurality of marked media segments to a user mobile device communicatively coupled to a wireless communication component; receive a user media program selection message from the user mobile device, wherein the user mobile device transmits a media play selection indication to a media player component, wherein the user media program selection message and the media play selection indication comprise the same user selected media; receive an atmospherics data package from the user mobile device; obtain an atmospherics data artifact from the atmospherics data package; extract user instant activities information based on analysis of the atmospherics data artifact; determine whether the received user media program selection message indicates a user media participation event; generate a user viewing status indication based on the user instant activities information; incorporate the user viewing status indication into viewer measurement data of the user selected channel; and retrieve a media tag associated with the user selected media program from the program listing data, the media tag indicating a timestamp when a media play segment embedded in a user selected media program is to be experienced by the user via the media player component and a media referenced item featured in the media segment; determine the timestamp of the media tag with the user selected media when the received user media program selection message is determined to indicate the user media participation event; generate a deliverable mobile media segment featuring the media referenced item featured in the media play segment; and provide the generated deliverable mobile media segment to the user mobile device in synchronization with the timestamp when the media play segment featuring the media referenced item is experienced on the media play component.
|
1. A media content based exposure measuring apparatus, comprising: a memory; a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to: obtain program listing data including a plurality of marked tags representing a plurality of marked media segments; provide the obtained program listing data including the plurality of marked media tags representing the plurality of marked media segments to a user mobile device communicatively coupled to a wireless communication component; receive a user media program selection message from the user mobile device, wherein the user mobile device transmits a media play selection indication to a media player component, wherein the user media program selection message and the media play selection indication comprise the same user selected media; receive an atmospherics data package from the user mobile device; obtain an atmospherics data artifact from the atmospherics data package; extract user instant activities information based on analysis of the atmospherics data artifact; determine whether the received user media program selection message indicates a user media participation event; generate a user viewing status indication based on the user instant activities information; incorporate the user viewing status indication into viewer measurement data of the user selected channel; and retrieve a media tag associated with the user selected media program from the program listing data, the media tag indicating a timestamp when a media play segment embedded in a user selected media program is to be experienced by the user via the media player component and a media referenced item featured in the media segment; determine the timestamp of the media tag with the user selected media when the received user media program selection message is determined to indicate the user media participation event; generate a deliverable mobile media segment featuring the media referenced item featured in the media play segment; and provide the generated deliverable mobile media segment to the user mobile device in synchronization with the timestamp when the media play segment featuring the media referenced item is experienced on the media play component. 3. The apparatus of claim 1 , wherein the user mobile device comprises any of a smartphone, a personal data assistant, a cellular phone, a laptop, a tablet computer, and a standalone table unit.
| 0.71131 |
10,043,088 | 1 | 9 |
1. A method for image quality scoring of an image from a medical scanner, the method comprising: generating, by the medical scanner, the image representing a patient, the image having a level of artifacts due to the generating by the medical scanner; determining, by a machine, a probability map of artifacts as a function of location for the image with a deep generative machine-learnt model; assigning, by the machine, a quality score for the image with application of the probability map to a discriminative machine-learnt classifier; and transmitting the quality score for the image of the patient.
|
1. A method for image quality scoring of an image from a medical scanner, the method comprising: generating, by the medical scanner, the image representing a patient, the image having a level of artifacts due to the generating by the medical scanner; determining, by a machine, a probability map of artifacts as a function of location for the image with a deep generative machine-learnt model; assigning, by the machine, a quality score for the image with application of the probability map to a discriminative machine-learnt classifier; and transmitting the quality score for the image of the patient. 9. The method of claim 1 wherein assigning comprises assigning the quality score as a function of severity and extent of the artifacts.
| 0.831671 |
9,442,928 | 6 | 9 |
6. The method according to claim 1 , wherein said searching for said lexically scoring comprises at least one of: i) finding a plurality of said at least one term used in the lexicon, appearing in said at least one received content document in a lexical stage, ii) calculating a calculated lexical score for each of said at least one term appearing in said at least one received content document; and iii) identifying said at least one candidate topic based on at least one topic to which a given term refers in the lexicon.
|
6. The method according to claim 1 , wherein said searching for said lexically scoring comprises at least one of: i) finding a plurality of said at least one term used in the lexicon, appearing in said at least one received content document in a lexical stage, ii) calculating a calculated lexical score for each of said at least one term appearing in said at least one received content document; and iii) identifying said at least one candidate topic based on at least one topic to which a given term refers in the lexicon. 9. The method according to claim 6 , wherein said calculating of said (ii) comprises: counting a number of occurrences of said at least one term in said at least one content document; and optionally adjusting the calculated lexical score of a given one of said at least one term based on the number of occurrences of said given one of said at least one term in a given language.
| 0.741096 |
8,938,456 | 14 | 18 |
14. A machine readable storage medium containing machine executable instructions for implementing a method of optimizing data recovery in a resource description framework data system, the instructions comprising: a set of instructions for ranking the occurrence of data values across one or more of the subject data values, predicate data values, and object data values for a plurality of resource description framework data statements; and further wherein said set of instruction for ranking includes a set of instructions for ranking frequency of occurrence of subject data values in a predicate and object of other resource description framework data statements; a set of instructions for assigning a handle to one or more of the ranked data values, the handle replacing each of the ranked data values with a shortcut value that utilizes less storage space than the corresponding data value, each shortcut value representing the rank of the corresponding data value relative to the ranked data values in the resource description framework data system; wherein one or more unranked data values prior to said ranking are assigned one or more handles; wherein the handles assigned to the unranked data values are assigned based upon a predetermined procedure; a set of instructions for storing each handle in a library with an indication of the corresponding data value; and a set of instructions for indexing the plurality of resource description framework data statements in an ordered index, the ranked and unranked data values of each of the plurality of resource description framework data statements being replaced in the ordered index with the corresponding handle.
|
14. A machine readable storage medium containing machine executable instructions for implementing a method of optimizing data recovery in a resource description framework data system, the instructions comprising: a set of instructions for ranking the occurrence of data values across one or more of the subject data values, predicate data values, and object data values for a plurality of resource description framework data statements; and further wherein said set of instruction for ranking includes a set of instructions for ranking frequency of occurrence of subject data values in a predicate and object of other resource description framework data statements; a set of instructions for assigning a handle to one or more of the ranked data values, the handle replacing each of the ranked data values with a shortcut value that utilizes less storage space than the corresponding data value, each shortcut value representing the rank of the corresponding data value relative to the ranked data values in the resource description framework data system; wherein one or more unranked data values prior to said ranking are assigned one or more handles; wherein the handles assigned to the unranked data values are assigned based upon a predetermined procedure; a set of instructions for storing each handle in a library with an indication of the corresponding data value; and a set of instructions for indexing the plurality of resource description framework data statements in an ordered index, the ranked and unranked data values of each of the plurality of resource description framework data statements being replaced in the ordered index with the corresponding handle. 18. The machine readable storage medium according to claim 14 , wherein said set of instructions for assigning a handle includes a set of instructions for assigning a handle to ranked data values and data values that are not ranked.
| 0.894257 |
4,686,649 | 1 | 4 |
1. A word processor comprising: input means including a keyboard with a plurality of keys, each associated with a different graphic or function including at least two cursor control keys, said input means producing a unique key code for each actuated key or group of keys, display means including a cathode ray tube for producing a visible image of multiple line of text in response to a periodically repeating video signal and associated horizontal and vertical sync signals, said visible image including a cursor positioned in response to actuation of said cursor control keys, control means responsive to said input means for manipulating and storing said unique key codes and for controlling said display means, wherein the improvement comprises: dispaly control means in said control means for generating one of a first and second video signal, for driving said display means, in response to selection of one of a first and second display mode respectively, said first video signal producing an unformatted text display having less display text lines than in a typical page, and less text character capacity per text line than in a typical page, said second video signal producing a formatted display of capacity at least equal to the number of lines in a typical page wherein each of a plurality of different text characters is represented by and identical visible image.
|
1. A word processor comprising: input means including a keyboard with a plurality of keys, each associated with a different graphic or function including at least two cursor control keys, said input means producing a unique key code for each actuated key or group of keys, display means including a cathode ray tube for producing a visible image of multiple line of text in response to a periodically repeating video signal and associated horizontal and vertical sync signals, said visible image including a cursor positioned in response to actuation of said cursor control keys, control means responsive to said input means for manipulating and storing said unique key codes and for controlling said display means, wherein the improvement comprises: dispaly control means in said control means for generating one of a first and second video signal, for driving said display means, in response to selection of one of a first and second display mode respectively, said first video signal producing an unformatted text display having less display text lines than in a typical page, and less text character capacity per text line than in a typical page, said second video signal producing a formatted display of capacity at least equal to the number of lines in a typical page wherein each of a plurality of different text characters is represented by and identical visible image. 4. The apparatus of any of claim 1-3 in which said control means includes display selection means responsive to a key code corresponding to a printable character to select said first display mode.
| 0.884434 |
9,386,950 | 1 | 4 |
1. A computer-implemented method comprising a plurality of software operations, each software operation being performed using at least one network-connected computer-based system, the method determining a user's risk of dyslexia and comprising: identifying, based on an input received from an input device of the computer-based system, an age category associated with the user; rendering, on a display screen of the computer-based system, a plurality of query pages, each query page being generated from data received by the computer-based system from a remote server over a data communications channel and stored in a memory device of the computer-based system, and each query page comprising a plurality of non-verbal answers that are determined based on the identified age category and are selectable by the user; rendering, via a speaker of the computer-based system, a plurality of auditory queries, each auditory query being rendered as audible sounds and generated from a sound data file corresponding to a non-verbal query, each auditory query being associated with one or more of the plurality of query pages; identifying, via the input device of the computer-based system, a plurality of electronic input selections from the user, each electronic input selection identifying a non-verbal answer from a query page; identifying, via a timer of the computer-based system, timing data associated with the plurality of electronic input selections, the timing data indicating time intervals between the rendering of each of the plurality of auditory queries and the detection of electronic input selections from the user corresponding to each of the auditory queries; assigning weighted scores to each of the electronic input selections from the user, the weighted scores being determined based on the identified age category and the time intervals, wherein time intervals above a first threshold receive a first weighting factor and time intervals below the first threshold receive a second weighting factor; and rendering, on the display screen of the computer-based system, an assessment in a graphical user interface, the assessment identifying a risk of dyslexia for the user based on whether the weighted scores exceed a predefined threshold associated with the plurality of query pages.
|
1. A computer-implemented method comprising a plurality of software operations, each software operation being performed using at least one network-connected computer-based system, the method determining a user's risk of dyslexia and comprising: identifying, based on an input received from an input device of the computer-based system, an age category associated with the user; rendering, on a display screen of the computer-based system, a plurality of query pages, each query page being generated from data received by the computer-based system from a remote server over a data communications channel and stored in a memory device of the computer-based system, and each query page comprising a plurality of non-verbal answers that are determined based on the identified age category and are selectable by the user; rendering, via a speaker of the computer-based system, a plurality of auditory queries, each auditory query being rendered as audible sounds and generated from a sound data file corresponding to a non-verbal query, each auditory query being associated with one or more of the plurality of query pages; identifying, via the input device of the computer-based system, a plurality of electronic input selections from the user, each electronic input selection identifying a non-verbal answer from a query page; identifying, via a timer of the computer-based system, timing data associated with the plurality of electronic input selections, the timing data indicating time intervals between the rendering of each of the plurality of auditory queries and the detection of electronic input selections from the user corresponding to each of the auditory queries; assigning weighted scores to each of the electronic input selections from the user, the weighted scores being determined based on the identified age category and the time intervals, wherein time intervals above a first threshold receive a first weighting factor and time intervals below the first threshold receive a second weighting factor; and rendering, on the display screen of the computer-based system, an assessment in a graphical user interface, the assessment identifying a risk of dyslexia for the user based on whether the weighted scores exceed a predefined threshold associated with the plurality of query pages. 4. The computer-implemented method of claim 1 , wherein the assessment identifies phonetic errors based on the selections.
| 0.812308 |
9,728,101 | 25 | 34 |
25. A computer program code embodied in a computer-readable device for assessing and improving a user's life skills and self-efficacy for life stage readiness, the computer program code comprising processor executable instructions of a life stage readiness application which includes: a life skills measurement module, and a reverse engineering diagnosis module; and a plurality of databases including: a life skills baseline score database for storing a numeric scoring system for scoring life skill competencies, the scoring system including a baseline score for each of a plurality of preselected life skill competencies and a composite baseline score for the plurality of preselected life skill competencies for each of a plurality of preselected life stage transitions, a life skills measurement database for storing data about the user's symptoms and other evidence of the user's mental and emotional health and life skill competencies of the user, and a reverse engineering diagnoses database for storing data of a plurality of human syndromes and disorders and other evidence of a human's emotional and mental health associated with each of such syndromes and disorders; for: collecting from the user and storing in the life skills measurement database user symptoms and other evidence of the user's life skills and emotional and mental health; assessing the user's readiness for a life stage transition based upon the collected user symptoms and other evidence wherein such assessing includes, in at least one interactive session with the user, measuring a plurality of life skill competencies wherein the measuring of a plurality of life skill competencies includes generating quantitative scores based upon the numeric scoring system of the user's self-image, self-management skills, risk/reward predisposition, interpersonal skills, and existence or non-existence of one or more syndromes and disorders; generating a plurality of potential differential diagnoses by comparing the user's collected symptoms and other evidence of the user's mental and emotional health with the symptoms and other evidence of mental and emotional health associated with each of the plurality of human syndromes and disorders stored in the reverse engineering diagnoses database; ranking the plurality of potential diagnoses from most likely to least likely; wherein the assessing of the user's readiness for a life stage transition includes: determining a composite score of the scores of the measured life skill competencies; and comparing the composite score to the respective baseline composite score stored in the life skills baseline score database for the life stage transition, which baseline composite score is predictive of the user's readiness or unreadiness for success in the life stage transition; upon determining that the user's measured composite score is greater than the baseline composite score, outputting to the user the measured composite score indicative of the user's readiness for the life stage transaction.
|
25. A computer program code embodied in a computer-readable device for assessing and improving a user's life skills and self-efficacy for life stage readiness, the computer program code comprising processor executable instructions of a life stage readiness application which includes: a life skills measurement module, and a reverse engineering diagnosis module; and a plurality of databases including: a life skills baseline score database for storing a numeric scoring system for scoring life skill competencies, the scoring system including a baseline score for each of a plurality of preselected life skill competencies and a composite baseline score for the plurality of preselected life skill competencies for each of a plurality of preselected life stage transitions, a life skills measurement database for storing data about the user's symptoms and other evidence of the user's mental and emotional health and life skill competencies of the user, and a reverse engineering diagnoses database for storing data of a plurality of human syndromes and disorders and other evidence of a human's emotional and mental health associated with each of such syndromes and disorders; for: collecting from the user and storing in the life skills measurement database user symptoms and other evidence of the user's life skills and emotional and mental health; assessing the user's readiness for a life stage transition based upon the collected user symptoms and other evidence wherein such assessing includes, in at least one interactive session with the user, measuring a plurality of life skill competencies wherein the measuring of a plurality of life skill competencies includes generating quantitative scores based upon the numeric scoring system of the user's self-image, self-management skills, risk/reward predisposition, interpersonal skills, and existence or non-existence of one or more syndromes and disorders; generating a plurality of potential differential diagnoses by comparing the user's collected symptoms and other evidence of the user's mental and emotional health with the symptoms and other evidence of mental and emotional health associated with each of the plurality of human syndromes and disorders stored in the reverse engineering diagnoses database; ranking the plurality of potential diagnoses from most likely to least likely; wherein the assessing of the user's readiness for a life stage transition includes: determining a composite score of the scores of the measured life skill competencies; and comparing the composite score to the respective baseline composite score stored in the life skills baseline score database for the life stage transition, which baseline composite score is predictive of the user's readiness or unreadiness for success in the life stage transition; upon determining that the user's measured composite score is greater than the baseline composite score, outputting to the user the measured composite score indicative of the user's readiness for the life stage transaction. 34. The computer program code of claim 25 , wherein the computer program code executes processes executable instructions for: using a personality neutral and nonjudgmental avatar projected on the graphical user interface of the user's access device, making suggestions to the user to improve his life skill competencies for the particular life stage transition.
| 0.936444 |
8,688,602 | 13 | 16 |
13. A method for generating metadata relating to a media object, the method comprising: determining input data relating to the media object, the input data based on the content of the media object and existing metadata associated with the media object; applying a machine learning algorithm to the input data using a processor, the machine learning algorithm generating new metadata; and recording a correspondence between the new metadata and the media object.
|
13. A method for generating metadata relating to a media object, the method comprising: determining input data relating to the media object, the input data based on the content of the media object and existing metadata associated with the media object; applying a machine learning algorithm to the input data using a processor, the machine learning algorithm generating new metadata; and recording a correspondence between the new metadata and the media object. 16. The method of claim 13 , wherein the media object is a book.
| 0.735537 |
5,412,566 | 1 | 8 |
1. A variable replacement apparatus which replaces variable names in a text with corresponding variable values, each variable name formed by at least one character and each character in the variable name having a corresponding format, the apparatus comprising: variable name extracting means for extracting a variable name from the text; variable value acquisition means for obtaining a variable value corresponding to the variable name extracted by said variable name extracting means; variable name analyzing means for analyzing the corresponding format of each character forming the variable name; variable value converting means for converting the variable value obtained by said variable value acquisition means so that the variable value has a format which is determined in accordance with the corresponding format of each character forming the variable name; and variable replacing means for replacing the variable name in the text by the converted variable value.
|
1. A variable replacement apparatus which replaces variable names in a text with corresponding variable values, each variable name formed by at least one character and each character in the variable name having a corresponding format, the apparatus comprising: variable name extracting means for extracting a variable name from the text; variable value acquisition means for obtaining a variable value corresponding to the variable name extracted by said variable name extracting means; variable name analyzing means for analyzing the corresponding format of each character forming the variable name; variable value converting means for converting the variable value obtained by said variable value acquisition means so that the variable value has a format which is determined in accordance with the corresponding format of each character forming the variable name; and variable replacing means for replacing the variable name in the text by the converted variable value. 8. The variable replacement apparatus as claimed in claim 1, wherein said variable name analyzing means analyzes the corresponding formats of respective characters forming the variable name, the corresponding formats including different colors.
| 0.756972 |
9,378,293 | 12 | 15 |
12. The system of claim 11 , further comprising: a second translator to read a set of dynamic content data and insert the dynamic content into an output page according to the second page markup language data.
|
12. The system of claim 11 , further comprising: a second translator to read a set of dynamic content data and insert the dynamic content into an output page according to the second page markup language data. 15. The system of claim 12 , wherein the set of dynamic content data is transformed into a format described by a set of one or more result markup language files.
| 0.5 |
8,111,813 | 1 | 10 |
1. A method comprising: storing a first greeting message in a first media format; receiving a first arrival notification of a first communication event; determining, in response to receiving the first arrival notification, that the first communication event is in a second media format different from the first media format; and in response to the determining step, generating a second greeting message in the second media format, wherein content of the second greeting message is based on content of the first greeting message.
|
1. A method comprising: storing a first greeting message in a first media format; receiving a first arrival notification of a first communication event; determining, in response to receiving the first arrival notification, that the first communication event is in a second media format different from the first media format; and in response to the determining step, generating a second greeting message in the second media format, wherein content of the second greeting message is based on content of the first greeting message. 10. The method of claim 1 wherein one of the first and second media formats comprises video and the other of the first and second media formats is a media format in which video is not included.
| 0.786504 |
8,838,692 | 18 | 19 |
18. A method of distributing XML documents/messages in a network of XML appliances/routers, the network of XML appliances/routers comprising XML appliances/routers implemented as processes in separate physical computer systems interconnected by physical communication links, the XML appliances/routers being configured to make XML routing decisions for XML documents/messages by applying XML subscription information to the XML documents/messages, and the XML appliances/routers being configured to forward the XML documents/messages toward subscribing clients according to the XML subscription information submitted by the subscribing clients, the subscribing clients being network elements other than the XML appliances/routers, the method comprising: establishing two distribution rings in the network of XML appliances/routers for the distribution of XML documents/messages between the XML appliances/routers, each distribution ring comprising a respective plurality of the XML appliances/routers arranged serially in a respective ring and configured to transmit the XML documents/messages from XML appliance/router to XML appliance/router around the ring, at least one XML appliance/router being common to the two distribution rings; coupling subsets of subscribing clients to XML appliances/routers on the distribution ring via respective originating XML appliances/routers; enabling the respective originating XML appliances/routers to transmit/publish XML documents/messages onto the ring; and operating the XML appliances/routers on the distribution ring: to receive XML subscription information from a respective subset of subscribing clients; to locally apply the subscription information to each XML document/message received on the distribution ring; to select XML documents/messages to be forwarded toward its subset of subscribing clients without exchanging XML subscription information between the XML appliances/routers; and to forward the selected XML documents/messages toward subscribing clients according to the XML subscription information submitted by subscribing clients, the at least one XML appliance/router that is common to the two distribution rings being operated to forward an XML document/message received on one of the two distribution rings on both of the two distribution rings.
|
18. A method of distributing XML documents/messages in a network of XML appliances/routers, the network of XML appliances/routers comprising XML appliances/routers implemented as processes in separate physical computer systems interconnected by physical communication links, the XML appliances/routers being configured to make XML routing decisions for XML documents/messages by applying XML subscription information to the XML documents/messages, and the XML appliances/routers being configured to forward the XML documents/messages toward subscribing clients according to the XML subscription information submitted by the subscribing clients, the subscribing clients being network elements other than the XML appliances/routers, the method comprising: establishing two distribution rings in the network of XML appliances/routers for the distribution of XML documents/messages between the XML appliances/routers, each distribution ring comprising a respective plurality of the XML appliances/routers arranged serially in a respective ring and configured to transmit the XML documents/messages from XML appliance/router to XML appliance/router around the ring, at least one XML appliance/router being common to the two distribution rings; coupling subsets of subscribing clients to XML appliances/routers on the distribution ring via respective originating XML appliances/routers; enabling the respective originating XML appliances/routers to transmit/publish XML documents/messages onto the ring; and operating the XML appliances/routers on the distribution ring: to receive XML subscription information from a respective subset of subscribing clients; to locally apply the subscription information to each XML document/message received on the distribution ring; to select XML documents/messages to be forwarded toward its subset of subscribing clients without exchanging XML subscription information between the XML appliances/routers; and to forward the selected XML documents/messages toward subscribing clients according to the XML subscription information submitted by subscribing clients, the at least one XML appliance/router that is common to the two distribution rings being operated to forward an XML document/message received on one of the two distribution rings on both of the two distribution rings. 19. The method of claim 18 , wherein the at least one XML appliance/router that is common to the two distribution rings is configured to operate as an originating router with respect to one of the distribution rings for XML documents/messages that it first transmits to that one of the distribution rings.
| 0.5 |
8,417,513 | 21 | 24 |
21. The method of claim 19 , further comprising instantiating sentences based on data from the domain according to the sentence template.
|
21. The method of claim 19 , further comprising instantiating sentences based on data from the domain according to the sentence template. 24. The method of claim 21 , further comprising encoding the instantiated sentences into RDF format.
| 0.561404 |
9,158,768 | 1 | 8 |
1. A system comprising: one or more processors; a dictionary generator module, implemented using the one or more processors, configured to generate dictionary information that corresponds to a first user, the dictionary information includes a first list of compatible query operators and a description of compatible data types that correspond to each operator in the first list of compatible query operators; a query receiver module, implemented using the one or more processors, configured to receive, from the first user, a search query to search for document information in a database, the database includes an inverted index; a query verification module, implemented using the one or more processors, configured to determine that terms of the search query from the first user are in accordance with the dictionary information that corresponds to the first user; a query processing module, implemented using the one or more processors, configured to apply the search query to the inverted index in the database to identify the document information; and an presentation module, implemented using the one or more processors, configured to send the document information to the first user.
|
1. A system comprising: one or more processors; a dictionary generator module, implemented using the one or more processors, configured to generate dictionary information that corresponds to a first user, the dictionary information includes a first list of compatible query operators and a description of compatible data types that correspond to each operator in the first list of compatible query operators; a query receiver module, implemented using the one or more processors, configured to receive, from the first user, a search query to search for document information in a database, the database includes an inverted index; a query verification module, implemented using the one or more processors, configured to determine that terms of the search query from the first user are in accordance with the dictionary information that corresponds to the first user; a query processing module, implemented using the one or more processors, configured to apply the search query to the inverted index in the database to identify the document information; and an presentation module, implemented using the one or more processors, configured to send the document information to the first user. 8. The system of claim 1 , wherein the query verification module is configured to determine that an input to an operator in the search query is described as a compatible data type that is included in the description of compatible data types.
| 0.782098 |
9,646,611 | 1 | 2 |
1. A computing system, comprising: a processor; and memory storing instructions executable by the at least one processor, wherein the instructions, when executed, configure the computing system to provide: a user interface mechanism configured to receive an utterance, send the utterance to a linguistic processing system, and receive a linguistic processing result indicative of an intent and a set of arguments recognized in the utterance; a context identification system configured to identify a current context of the computing system; an action identifier configured to identify an action based on the current context and based on the intent in the linguistic processing result; and a cross-source search component configured to identify content on which the action is to be performed by searching multiple different information sources based on the current context and based on the set of arguments in the linguistic processing result.
|
1. A computing system, comprising: a processor; and memory storing instructions executable by the at least one processor, wherein the instructions, when executed, configure the computing system to provide: a user interface mechanism configured to receive an utterance, send the utterance to a linguistic processing system, and receive a linguistic processing result indicative of an intent and a set of arguments recognized in the utterance; a context identification system configured to identify a current context of the computing system; an action identifier configured to identify an action based on the current context and based on the intent in the linguistic processing result; and a cross-source search component configured to identify content on which the action is to be performed by searching multiple different information sources based on the current context and based on the set of arguments in the linguistic processing result. 2. The computing system of claim 1 , wherein the instructions, when executed, configure the computing system to provide: an action component configured to control a controlled system to take the action on the identified content.
| 0.5 |
8,806,401 | 22 | 24 |
22. The system of claim 14 , wherein the memory further contains instructions that, when executed by the processing unit, provide for determination of a coverage metric that is a ratio between a number of operations actually performed for function verification and a minimum number of operations necessary for a desired level of coverage.
|
22. The system of claim 14 , wherein the memory further contains instructions that, when executed by the processing unit, provide for determination of a coverage metric that is a ratio between a number of operations actually performed for function verification and a minimum number of operations necessary for a desired level of coverage. 24. The system of claim 22 , wherein the memory further contains instructions that, when executed by the processing unit, provide for a report of reasonable coverage upon determination that the instructions have executed and no failure was detected respective of a TFF property.
| 0.5 |
9,794,405 | 1 | 6 |
1. A method comprising: detecting, by a system including a processor, an input incompatible with an original script for an interactive communication over a communication network, wherein the detecting is performed during the interactive communication; generating, by the system and during the interactive communication, a dynamically updated script different from the original script in accordance with a type of the incompatible input; and providing, by the system and over the communication network, information to a device participating in the interactive communication in accordance with the dynamically updated script, wherein at least a portion of a remainder of the interactive communication is conducted in accordance with the dynamically updated script.
|
1. A method comprising: detecting, by a system including a processor, an input incompatible with an original script for an interactive communication over a communication network, wherein the detecting is performed during the interactive communication; generating, by the system and during the interactive communication, a dynamically updated script different from the original script in accordance with a type of the incompatible input; and providing, by the system and over the communication network, information to a device participating in the interactive communication in accordance with the dynamically updated script, wherein at least a portion of a remainder of the interactive communication is conducted in accordance with the dynamically updated script. 6. The method of claim 1 , wherein the incompatible input comprises unrecognized speech.
| 0.821862 |
9,031,929 | 1 | 7 |
1. A computer-implemented method, the method comprising: determining a first count of unique queries, received by a search engine, that are categorized as referring to a particular site; determining a second count of unique queries, received by the search engine, that are associated with the particular site, wherein a query is associated with the particular site when the query is followed by a user selection of a search result that (a) was presented, by the search engine, in response to the query and (b) identifies a resource in the particular site; and determining a site quality score for the particular site including computing a ratio of a numerator based on the first count and a denominator based on the second count, wherein (i) the numerator is based on the first count reduced by a threshold value which is a predetermined threshold value, (ii) the denominator is based on the second count raised to a power that is greater than zero and less than one, or (iii) both.
|
1. A computer-implemented method, the method comprising: determining a first count of unique queries, received by a search engine, that are categorized as referring to a particular site; determining a second count of unique queries, received by the search engine, that are associated with the particular site, wherein a query is associated with the particular site when the query is followed by a user selection of a search result that (a) was presented, by the search engine, in response to the query and (b) identifies a resource in the particular site; and determining a site quality score for the particular site including computing a ratio of a numerator based on the first count and a denominator based on the second count, wherein (i) the numerator is based on the first count reduced by a threshold value which is a predetermined threshold value, (ii) the denominator is based on the second count raised to a power that is greater than zero and less than one, or (iii) both. 7. The method of claim 1 , wherein the denominator is a sum of a base value plus the second count raised to a power that is greater than zero and less than one.
| 0.620853 |
8,495,143 | 1 | 5 |
1. A computer-implemented method comprising: maintaining a user profile for each of a plurality of users of a social networking system, each user profile comprising a set of attributes; selecting a user from the plurality of users; receiving user profile information for at least one user of a set of users in the social networking system who are connected to the selected user in the social networking system; inferring a value of one or more attributes of the user profile for the selected user based on information describing the set of users who are connected to the selected user in the social networking system; comparing a confidence score value for an inferred user profile attribute to a threshold value; storing, responsive to the confidence score being above the threshold value, the inferred value of the user profile attribute with the user profile for the selected user; determining relevant information for the selected user based on the inferred user profile attribute; and sending the relevant information to the selected user.
|
1. A computer-implemented method comprising: maintaining a user profile for each of a plurality of users of a social networking system, each user profile comprising a set of attributes; selecting a user from the plurality of users; receiving user profile information for at least one user of a set of users in the social networking system who are connected to the selected user in the social networking system; inferring a value of one or more attributes of the user profile for the selected user based on information describing the set of users who are connected to the selected user in the social networking system; comparing a confidence score value for an inferred user profile attribute to a threshold value; storing, responsive to the confidence score being above the threshold value, the inferred value of the user profile attribute with the user profile for the selected user; determining relevant information for the selected user based on the inferred user profile attribute; and sending the relevant information to the selected user. 5. The computer-implemented method of claim 1 , wherein inferring the value of the attribute for the selected user comprises determining the inferred value to be a median value of the attribute of the set of users.
| 0.737101 |
4,519,606 | 1 | 3 |
1. A method of playing a spelling game for a plurality players comprising the steps of (A) Providing a group of words to be spelled, each word having associated therewith its definition and pronunciation, (B) Randomly selecting a word from said group by a first player of said plurality, (C) Giving the pronunciation and definition of said selected word to said first player by a second player, (D) Spelling said word by said first player, (E) Adding to a score for said first player if the spelling is correct, (F) Substracting from a score for said first player if the spelling is incorrect, and (G) Repeating the steps for each player.
|
1. A method of playing a spelling game for a plurality players comprising the steps of (A) Providing a group of words to be spelled, each word having associated therewith its definition and pronunciation, (B) Randomly selecting a word from said group by a first player of said plurality, (C) Giving the pronunciation and definition of said selected word to said first player by a second player, (D) Spelling said word by said first player, (E) Adding to a score for said first player if the spelling is correct, (F) Substracting from a score for said first player if the spelling is incorrect, and (G) Repeating the steps for each player. 3. The method of claim 1 wherein the step of providing a group of words includes the step of categorizing said words into subgroups according to the level of spelling difficulty, (L) Selecting a subgroup by said first player prior to said step of randomly selecting, (M) Said step of randomly selecting a word from said group comprising randomly selecting a word from the selected subgroup, and (N) Prior to adding a score determining the amount of score to be added as a function of the subgroup selected.
| 0.5 |
9,972,034 | 1 | 8 |
1. A system comprising one or more processors and a non-transitory storage medium comprising program logic for execution by the one or more processors, the program logic comprising: a native advertisement placement engine that: performs an analysis comprising: obtaining a Document Object Model of an HTML document; identifying Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers; identifying, in the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model; constructing a suffix tree of a string of tags comprising all tags in the Document Object Model; and performing a traversal of the suffix tree, beginning with a root node, and computes, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; based at least in part on the analysis associated with the Document Object Model, and utilizing at least some of the identified elements, determines, within the Document Object Model, one or more native advertisement placement candidate containers; displaying, on a display, advertisements on the determined one or more native advertisement placement candidate containers.
|
1. A system comprising one or more processors and a non-transitory storage medium comprising program logic for execution by the one or more processors, the program logic comprising: a native advertisement placement engine that: performs an analysis comprising: obtaining a Document Object Model of an HTML document; identifying Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers; identifying, in the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model; constructing a suffix tree of a string of tags comprising all tags in the Document Object Model; and performing a traversal of the suffix tree, beginning with a root node, and computes, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; based at least in part on the analysis associated with the Document Object Model, and utilizing at least some of the identified elements, determines, within the Document Object Model, one or more native advertisement placement candidate containers; displaying, on a display, advertisements on the determined one or more native advertisement placement candidate containers. 8. The system of claim 1 , wherein the identified candidate containers relate to content with which native advertisements may be associated.
| 0.833333 |
9,002,700 | 25 | 28 |
25. The method of claim 17 , further comprising a step of grammar checking the assembled corrected text prior to transmitting to the second computing device of the user.
|
25. The method of claim 17 , further comprising a step of grammar checking the assembled corrected text prior to transmitting to the second computing device of the user. 28. The method of claim 25 , wherein the plurality of grammatical errors is distributed amongst the plurality of human proofreader computer devices through a bidding process.
| 0.5 |
8,712,759 | 12 | 13 |
12. A method of semantically parsing a natural language expression, comprising: constructing, by a processor, a first ambiguous meaning representation for a first natural language expression; fully or partially disambiguating, by a processor, the first meaning representation by specializing it by replacing a first semantic descriptor in it by a second, more specific semantic descriptor; and combining the first meaning representation with a second meaning representation associated with a second natural language expression to form a third meaning representation comprising a relation between the first and second meaning representations, the relation type identified by a fourth meaning representation.
|
12. A method of semantically parsing a natural language expression, comprising: constructing, by a processor, a first ambiguous meaning representation for a first natural language expression; fully or partially disambiguating, by a processor, the first meaning representation by specializing it by replacing a first semantic descriptor in it by a second, more specific semantic descriptor; and combining the first meaning representation with a second meaning representation associated with a second natural language expression to form a third meaning representation comprising a relation between the first and second meaning representations, the relation type identified by a fourth meaning representation. 13. The method of claim 12 , wherein at least one semantic descriptor for the fourth meaning representation is specified in the grammar.
| 0.654822 |
9,947,119 | 1 | 3 |
1. A method comprising: obtaining graph data including information related to a plurality of nodes; the plurality of nodes corresponding to search queries performed on a host site; constructing a sub-graph of additional nodes that represent search results of the search queries, the constructing of the sub-graph including generating links between the additional nodes based on an amount of overlap among the search results produced from the search queries that correspond to the one or more of the plurality of nodes, the additional nodes included in the sub-graph being clusters of the search results; rendering a graph by displaying each node at a respective absolute position within the graph and generating a plurality of tiles that depict images of the sub-graph at each of a plurality of zoom levels; and displaying a sub-graph image corresponding to a selected position and zoom level.
|
1. A method comprising: obtaining graph data including information related to a plurality of nodes; the plurality of nodes corresponding to search queries performed on a host site; constructing a sub-graph of additional nodes that represent search results of the search queries, the constructing of the sub-graph including generating links between the additional nodes based on an amount of overlap among the search results produced from the search queries that correspond to the one or more of the plurality of nodes, the additional nodes included in the sub-graph being clusters of the search results; rendering a graph by displaying each node at a respective absolute position within the graph and generating a plurality of tiles that depict images of the sub-graph at each of a plurality of zoom levels; and displaying a sub-graph image corresponding to a selected position and zoom level. 3. The method of claim 1 ; wherein the constructing the sub-graph includes: generating the additional nodes related to the one or more of the plurality of nodes; and generating links between the additional nodes and the one or more of the plurality of nodes based on determining that the amount of overlap exceeds a threshold value.
| 0.5 |
8,326,818 | 7 | 8 |
7. The method of claim 1 , further comprising: determining, when the adult keyword corresponding to the extracted character string is found in the adult keyword database, whether the website corresponding to the adult keyword is registered as an adult site, wherein controlling the process for the website comprises taking measures against a registrant of the website that has been determined to be an adult site when the website is not registered as an adult site.
|
7. The method of claim 1 , further comprising: determining, when the adult keyword corresponding to the extracted character string is found in the adult keyword database, whether the website corresponding to the adult keyword is registered as an adult site, wherein controlling the process for the website comprises taking measures against a registrant of the website that has been determined to be an adult site when the website is not registered as an adult site. 8. The method of claim 7 , wherein taking measures comprises sending an email to the registrant of the website.
| 0.770661 |
7,640,563 | 1 | 2 |
1. A method for describing media content implemented by a computing device including one or more processors, the method comprising: receiving from a first provider, a first description of a media content, wherein the first description identifies a first genre associated with the media content; receiving from a second provider, a second description of a media content, wherein the second description identifies a second genre associated with the media content; determining a first trust level associated with the first provider and a second trust level associated with the second provider; utilizing the one or more processors for calculating first and second degree values based on the first and second trust levels, wherein the first and second degrees indicate how related the first and second genres are to the media content relative to one another; and providing for a user, a description of the media content, wherein the description of the media content comprises the first and second degrees and the corresponding first and second genres.
|
1. A method for describing media content implemented by a computing device including one or more processors, the method comprising: receiving from a first provider, a first description of a media content, wherein the first description identifies a first genre associated with the media content; receiving from a second provider, a second description of a media content, wherein the second description identifies a second genre associated with the media content; determining a first trust level associated with the first provider and a second trust level associated with the second provider; utilizing the one or more processors for calculating first and second degree values based on the first and second trust levels, wherein the first and second degrees indicate how related the first and second genres are to the media content relative to one another; and providing for a user, a description of the media content, wherein the description of the media content comprises the first and second degrees and the corresponding first and second genres. 2. The method as recited in claim 1 , wherein each genre is selected from a group of genres consisting of action, adventure, horror, comedy, death, mystery, police involvement, thriller, political intrigue, romance, science fiction, period setting, lives drama, sports interest, animal interest, medical interest, legal interest, religious interest, historical interest, war interest, epic production, fantasy folklore, musical, western, monsters, teenage college, ethnic interest, and soap.
| 0.5 |
9,348,851 | 2 | 9 |
2. The computer system of claim 1 , wherein the one or more data quality criterion are configured to identify the potential data quality problems including at least one of: possible duplicate objects, missing properties, multi-valued properties, unparsed properties, disallowed enumerations, numeric range violations, and date range violations.
|
2. The computer system of claim 1 , wherein the one or more data quality criterion are configured to identify the potential data quality problems including at least one of: possible duplicate objects, missing properties, multi-valued properties, unparsed properties, disallowed enumerations, numeric range violations, and date range violations. 9. The computer system of claim 2 , wherein the potential data quality problem is disallowed enumerations, and said one or more data quality criterion identify objects that have one or more property values including disallowed enumerations.
| 0.583333 |
7,603,647 | 13 | 22 |
13. A computer-readable storage medium storing instructions thereon for executing a method, the method for extracting a representation of a state machine from a high-level integrated circuit description language, the method comprising: parsing the high-level integrated circuit description language; identifying processes within the integrated circuit description language; determining whether an identified process is a clock process by performing a processor-based search for a condition that changes a state of the process on a clock transition; building a state machine based in part on the identified clock process; and outputting a state machine description.
|
13. A computer-readable storage medium storing instructions thereon for executing a method, the method for extracting a representation of a state machine from a high-level integrated circuit description language, the method comprising: parsing the high-level integrated circuit description language; identifying processes within the integrated circuit description language; determining whether an identified process is a clock process by performing a processor-based search for a condition that changes a state of the process on a clock transition; building a state machine based in part on the identified clock process; and outputting a state machine description. 22. The computer-readable storage medium of claim 13 , determining one or more transition processes by identifying a process that assigns a value to a next state variable.
| 0.767663 |
9,002,877 | 14 | 15 |
14. The system according to claim 13 , wherein each row in the two-dimensional link matrix indicates the attribute value of one different font instance corresponding to each of the font attributes.
|
14. The system according to claim 13 , wherein each row in the two-dimensional link matrix indicates the attribute value of one different font instance corresponding to each of the font attributes. 15. The system according to claim 14 , wherein each of the one different font instance is indicated by the following vector: Ft=(V p1 , V p2 , . . . , V pm ), wherein Ft indicates the one font instance, and V p1 , V p2 , . . . , V pm indicate the attribute values of the font corresponding to the font attributes indicated by P 1 , P 2 , . . . , P m .
| 0.5 |
9,852,191 | 15 | 16 |
15. The computer implemented method of claim 11 , further comprising: receiving a request from the at least one client computer; wherein obtaining the plurality of results is in response to the request.
|
15. The computer implemented method of claim 11 , further comprising: receiving a request from the at least one client computer; wherein obtaining the plurality of results is in response to the request. 16. The computer implemented method of claim 15 , wherein the request is a search request.
| 0.5 |
8,577,898 | 19 | 20 |
19. A computer program product comprising a non-transitory computer usable storage medium having readable program code embodied in the storage medium, the computer program product includes at least one component operable to: provide a style score based on how a language style of an input document is different from at least one training document; determine whether the style score is greater than a predetermined threshold, and when the style score is greater than the predetermined threshold, rejecting the input document; provide a punctuation score based on a comparison between the use of punctuation marks in the input document and use of punctuation marks in the at least one training document; provide a spelling score based on spelling accuracy of the input document; provide a quotation score based on a comparison between sentences from the input document and sentences from the at least one training document, wherein the providing the quotation score comprises dividing the input document into extracted sentences, comparing each of the extracted sentences to the at least one training document, and calculating a percentage of extracted sentences that match the at least one training document; provide an enrichment score based on new and accurate vocabularies used in the input document, wherein the providing the enrichment score comprises extracting basis words from the input document to obtain a total number of unique words in the input document and dividing the total number of unique words by a total number of words in the input document; provide a syntax analysis score based on grammar mistakes in the input document; provide a focus score based on a topic of the essay and a focus of the input document on that topic; provide an idea and a cohesion score based on whether the input document provides a close or far away cohesive correct answer; and provide a rating of the input document based on the style score, the punctuation score, the spelling score, the quotation score, the enrichment score, the syntax analysis score, the focus score, the idea score and the cohesion score, wherein the rating of the input document is an overall rating or detailed score for the input document that is generated from the style score, the punctuation score, the spelling score, the quotation score, the enrichment score, the syntax analysis score, the focus score, the idea score and the cohesion score.
|
19. A computer program product comprising a non-transitory computer usable storage medium having readable program code embodied in the storage medium, the computer program product includes at least one component operable to: provide a style score based on how a language style of an input document is different from at least one training document; determine whether the style score is greater than a predetermined threshold, and when the style score is greater than the predetermined threshold, rejecting the input document; provide a punctuation score based on a comparison between the use of punctuation marks in the input document and use of punctuation marks in the at least one training document; provide a spelling score based on spelling accuracy of the input document; provide a quotation score based on a comparison between sentences from the input document and sentences from the at least one training document, wherein the providing the quotation score comprises dividing the input document into extracted sentences, comparing each of the extracted sentences to the at least one training document, and calculating a percentage of extracted sentences that match the at least one training document; provide an enrichment score based on new and accurate vocabularies used in the input document, wherein the providing the enrichment score comprises extracting basis words from the input document to obtain a total number of unique words in the input document and dividing the total number of unique words by a total number of words in the input document; provide a syntax analysis score based on grammar mistakes in the input document; provide a focus score based on a topic of the essay and a focus of the input document on that topic; provide an idea and a cohesion score based on whether the input document provides a close or far away cohesive correct answer; and provide a rating of the input document based on the style score, the punctuation score, the spelling score, the quotation score, the enrichment score, the syntax analysis score, the focus score, the idea score and the cohesion score, wherein the rating of the input document is an overall rating or detailed score for the input document that is generated from the style score, the punctuation score, the spelling score, the quotation score, the enrichment score, the syntax analysis score, the focus score, the idea score and the cohesion score. 20. The computer program product of claim 19 , wherein the at least one component is further operable to preprocess the input document to remove all undesired characters and numbers, remove all stop words and reduce words to their stems, base or root in order to minimize processing time and increase accuracy of the rating of the input document.
| 0.5 |
9,916,364 | 7 | 8 |
7. The method of claim 1 , further comprising determining, by the processor, that the user is at a border of two DMAs.
|
7. The method of claim 1 , further comprising determining, by the processor, that the user is at a border of two DMAs. 8. The method of claim 7 , further comprising identifying, by the processor, two user groups from one DMA each as having similar attributes as the requesting user and relevant news items from local news sources associated with both the DMAs is retrieved for presentation to the user.
| 0.5 |
7,711,573 | 57 | 58 |
57. The system of claim 1 , wherein the job description further includes a required level of education or a required field of specialization, and wherein the processor is further configured to: store the job description in the resume database; and send a portion of the result set, wherein the result set includes at least one matching resume from the resume database, each said at least one matching resume satisfying the job description.
|
57. The system of claim 1 , wherein the job description further includes a required level of education or a required field of specialization, and wherein the processor is further configured to: store the job description in the resume database; and send a portion of the result set, wherein the result set includes at least one matching resume from the resume database, each said at least one matching resume satisfying the job description. 58. The system of claim 57 , wherein each said at least one matching resume satisfies the job description when the parsed resume includes the required level of education, the required field of specialization, or a phrase implying the required level of education or the required field of specialization.
| 0.5 |
8,019,750 | 3 | 4 |
3. The method as recited in claim 1 , wherein the plurality of available optimization modes include Cost based and Rule based modes.
|
3. The method as recited in claim 1 , wherein the plurality of available optimization modes include Cost based and Rule based modes. 4. The method as recited in claim 3 , wherein the Cost based modes include First_Rows mode and All_Rows mode.
| 0.5 |
9,135,240 | 3 | 5 |
3. The method as claimed in claim 1 , wherein said corpus of text documents includes a knowledgebase (KB), said representative graph structure being generated from ontologies found in the KB.
|
3. The method as claimed in claim 1 , wherein said corpus of text documents includes a knowledgebase (KB), said representative graph structure being generated from ontologies found in the KB. 5. The method as claimed in claim 3 , wherein said created graph structure is an undirected graph generated from ontologies found in the KB, said created graph showing the relations of concepts weighted by a number of relations, wherein each edge between related concepts is a weight representing the number of relations.
| 0.5 |
8,180,672 | 2 | 5 |
2. A method for placing advertisements on a user interface comprising the steps of: providing a non-transitory computer readable medium including a user interface having a plurality of graphical user interface screens, at least some of said plurality of user interface screens containing user-selectable control objects; and determining which of a plurality of advertisements to display on a user interface screen based on at least the following criteria: topical relevance, said topical relevance being a measure of a relationship between one or more topics associated with each advertisement and one or more topics associated with said user-selectable control objects on said respective user interface screen wherein said topical relevance is calculated as: μ T ( a , p ) = ∑ i = 0 n δ ( a ⋂ t i ) δ ( a ) + δ ( t i ) where δ is the distance of a topic point from the root node.
|
2. A method for placing advertisements on a user interface comprising the steps of: providing a non-transitory computer readable medium including a user interface having a plurality of graphical user interface screens, at least some of said plurality of user interface screens containing user-selectable control objects; and determining which of a plurality of advertisements to display on a user interface screen based on at least the following criteria: topical relevance, said topical relevance being a measure of a relationship between one or more topics associated with each advertisement and one or more topics associated with said user-selectable control objects on said respective user interface screen wherein said topical relevance is calculated as: μ T ( a , p ) = ∑ i = 0 n δ ( a ⋂ t i ) δ ( a ) + δ ( t i ) where δ is the distance of a topic point from the root node. 5. The method of claim 2 , wherein said criteria includes path relevance and wherein said path relevance uses information associated with a user's navigation path through the user interface to determine relevant ones of said plurality of advertisements.
| 0.827186 |
10,019,437 | 9 | 14 |
9. A computer program product for information extraction via semantic abstraction, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by a processor to: receive natural language dependency parse trees as input; process, using the processor, the dependency parse trees by using an action application program interface (API) that creates a mapping from nodes of the dependency parse trees into actions, roles and contextual predicates, eliminates auxiliary verbs, detects negation from adverbs, classifies verbs, and outputs a collection of annotation query language (AQL) views, wherein mappings other than a default mapping use a configuration file that provides for defining new roles through navigation in the dependency parse trees; and using the mapping for extracting information, wherein: the actions are placed in a data format that comprises columns including said verbs along with columns for said verb attributes that comprise action identification, verb base, verb classification, verb tense, verb voice and verb sentiment, wherein verb sentiment is independent of an action; the roles comprise arguments for said verbs; and the contextual predicates include modifiers for said verbs.
|
9. A computer program product for information extraction via semantic abstraction, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by a processor to: receive natural language dependency parse trees as input; process, using the processor, the dependency parse trees by using an action application program interface (API) that creates a mapping from nodes of the dependency parse trees into actions, roles and contextual predicates, eliminates auxiliary verbs, detects negation from adverbs, classifies verbs, and outputs a collection of annotation query language (AQL) views, wherein mappings other than a default mapping use a configuration file that provides for defining new roles through navigation in the dependency parse trees; and using the mapping for extracting information, wherein: the actions are placed in a data format that comprises columns including said verbs along with columns for said verb attributes that comprise action identification, verb base, verb classification, verb tense, verb voice and verb sentiment, wherein verb sentiment is independent of an action; the roles comprise arguments for said verbs; and the contextual predicates include modifiers for said verbs. 14. The computer program product of claim 9 , wherein for said processing, indices for verb categorization is used to determine the role names.
| 0.690476 |
9,684,741 | 1 | 14 |
1. A method of presenting search results in response to a query on behalf of a user of a device having a processor and a display, the method comprising: executing on the processor instructions configured to: execute the query on at least one search engine to generate a plurality of search results; for respective search results generated by the at least one search engine: compute a search result relevance score for the search result; identify at least one topic semantically associated with the search result, identify a topic type of the at least one topic; identify at least one distinctive characteristic of the search result; and associating the search result with the identified topic type according to the at least one identified distinctive characteristic by evaluating the search result with a classifier configured to identify the topic types of a search result having the at least one distinctive characteristic; for respective topic types, compute a topic type relevance score of the topic type based on the relevance scores of the search results associated with the topic type; and present on the display: a plurality of topic type groups respectively representing a topic type and comprising a plurality of search results semantically associated with at least one topic of the topic type, the topic type groups sorted in descending order by the relevance scores of the search results within the topic type group, the groups comprising tabs in a tabbed user interface; and within respective topic type groups, the search results semantically associated with at least one topic of the topic type sorted in descending order by the search result relevance scores.
|
1. A method of presenting search results in response to a query on behalf of a user of a device having a processor and a display, the method comprising: executing on the processor instructions configured to: execute the query on at least one search engine to generate a plurality of search results; for respective search results generated by the at least one search engine: compute a search result relevance score for the search result; identify at least one topic semantically associated with the search result, identify a topic type of the at least one topic; identify at least one distinctive characteristic of the search result; and associating the search result with the identified topic type according to the at least one identified distinctive characteristic by evaluating the search result with a classifier configured to identify the topic types of a search result having the at least one distinctive characteristic; for respective topic types, compute a topic type relevance score of the topic type based on the relevance scores of the search results associated with the topic type; and present on the display: a plurality of topic type groups respectively representing a topic type and comprising a plurality of search results semantically associated with at least one topic of the topic type, the topic type groups sorted in descending order by the relevance scores of the search results within the topic type group, the groups comprising tabs in a tabbed user interface; and within respective topic type groups, the search results semantically associated with at least one topic of the topic type sorted in descending order by the search result relevance scores. 14. The method of claim 1 : the instructions configured to identify at least two search results associated with a topic type that is associated with a topic, and presenting the topic type groups comprising: presenting on the display the at least two search results grouped together within the topic type.
| 0.631068 |
9,361,504 | 7 | 8 |
7. The optical information reading method according to claim 6 wherein the adding includes adding the widths of the elements containing the character bars and the spaces of the characters before and after the target character when obtaining each of the 2- through n-element added widths of the target character.
|
7. The optical information reading method according to claim 6 wherein the adding includes adding the widths of the elements containing the character bars and the spaces of the characters before and after the target character when obtaining each of the 2- through n-element added widths of the target character. 8. The optical information reading method according to claim 7 wherein the extracting includes extracting the n-element width data of said one character and at least one anteroposterior width data of the target character when obtaining each of the 2- through n-element added widths.
| 0.5 |
9,195,647 | 15 | 20 |
15. A computer-implemented method for producing an association dataset for terms in a language, comprising: receiving a first term as a name or description of a concept or topic or attribute; receiving a first group of text units comprising at least two terms each comprising one or more words or phrases or sentences or paragraphs or documents, at least half of the text units contain the first term or are from contents that contain the first term, and at least half of the text units contain one or more second terms each being different from the first term; receiving a third term comprising a word or a phrase; for one or more second terms in the first group, produce a first score value including a weighting value based on the presence or absence of the third term in a text unit that contains the second term; and selecting the one or more second terms based on the first score value as terms associated with the first term or with the concept or topic or attribute represented by the first term.
|
15. A computer-implemented method for producing an association dataset for terms in a language, comprising: receiving a first term as a name or description of a concept or topic or attribute; receiving a first group of text units comprising at least two terms each comprising one or more words or phrases or sentences or paragraphs or documents, at least half of the text units contain the first term or are from contents that contain the first term, and at least half of the text units contain one or more second terms each being different from the first term; receiving a third term comprising a word or a phrase; for one or more second terms in the first group, produce a first score value including a weighting value based on the presence or absence of the third term in a text unit that contains the second term; and selecting the one or more second terms based on the first score value as terms associated with the first term or with the concept or topic or attribute represented by the first term. 20. The method of claim 15 , wherein the first score value is produced further based on the number of text units that contain both the first term and the second term.
| 0.807425 |
9,002,961 | 13 | 19 |
13. A device configured to open a communications channel between two individuals based on criteria about the individuals, comprising: an input and output user interface; memory; a storage device; a network node receiving a date of birth for each individual of said two individuals and sending each individual, of said two individuals questions as well as receiving answers to said questions from each said individual; a processor, configured to carry out instructions to determine a MBTI for each said individual based on said answers, determine each said individual's Chinese zodiac, based on said received date of birth, and determine a western zodiac for each said individual, based on said received date of birth; whereby said network node further receives attributes characteristic of each said individual, and required attributes of another individual; said processor carries out instructions to determine compatibility according to said determined MBTI for each said individual, and compatibility according to said Chinese zodiac and said western zodiac; and said device receives an indication by one said individual of accepting a match, and opens a communication channel between said one individual and said another individual associated with said match.
|
13. A device configured to open a communications channel between two individuals based on criteria about the individuals, comprising: an input and output user interface; memory; a storage device; a network node receiving a date of birth for each individual of said two individuals and sending each individual, of said two individuals questions as well as receiving answers to said questions from each said individual; a processor, configured to carry out instructions to determine a MBTI for each said individual based on said answers, determine each said individual's Chinese zodiac, based on said received date of birth, and determine a western zodiac for each said individual, based on said received date of birth; whereby said network node further receives attributes characteristic of each said individual, and required attributes of another individual; said processor carries out instructions to determine compatibility according to said determined MBTI for each said individual, and compatibility according to said Chinese zodiac and said western zodiac; and said device receives an indication by one said individual of accepting a match, and opens a communication channel between said one individual and said another individual associated with said match. 19. The device of claim 13 , wherein when a weighted average of compatibility between a western zodiac and Chinese zodiac is low compared to a predefined threshold or absent, then a match is suggested based on western zodiac.
| 0.589416 |
9,501,457 | 7 | 8 |
7. The method of claim 1 , wherein the plurality of non-user specific objects includes a cursor object having coordinates relative to the defined origin.
|
7. The method of claim 1 , wherein the plurality of non-user specific objects includes a cursor object having coordinates relative to the defined origin. 8. The method of claim 7 , wherein the step of inserting script within said markup language includes script for further defining each of the plurality of user specific objects and non-user specific objects to include at least one pointer for each object associated therewith whether the associated object is a user or non-user specific object, and wherein the step of inserting script within said markup language includes script for re-establishing coordinates for each object of the plurality of user specific objects and non-user specific objects associated with an object that has been edited as the result of an interpreted user initiated event.
| 0.5 |
9,275,640 | 39 | 40 |
39. The method of claim 38 , wherein the original data representation includes quantities representative of confidence scores associated with the preliminary occurrences of each vocabulary item.
|
39. The method of claim 38 , wherein the original data representation includes quantities representative of confidence scores associated with the preliminary occurrences of each vocabulary item. 40. The method of claim 39 wherein the original data representation includes start times and end times associated with the preliminary occurrences of each vocabulary item.
| 0.5 |
7,509,330 | 22 | 23 |
22. The system of claim 1 , wherein the monitoring application is further operable to communicate observations on the database messages to a computer system at a fourth network location operable to initiate particular processes in response to particular observations.
|
22. The system of claim 1 , wherein the monitoring application is further operable to communicate observations on the database messages to a computer system at a fourth network location operable to initiate particular processes in response to particular observations. 23. The system of claim 22 , wherein the computer system is operable to delete particular records in a web cache in response to observations indicating communication of particular database messages comprising particular write messages.
| 0.5 |
9,715,557 | 1 | 9 |
1. An electronic device comprising: storage configured to maintain a primary web-browser application and a secondary web-browser application; at least one processor connected to said storage and configured to execute said primary web-browser application; an interface connected to said processor, said processor configured to receive a web-page stored at a web-server via said interface, said web-page including context sensitive content related to a plurality of context sensitive items on said web-page, said context sensitive content being able to change without further input from the web-server, said context sensitive content comprising a data portion and a non-data portion, said non-data portion comprising scripts executable by said primary web-browser application and said data portion comprising tags, labels, or text; a display connected to said processor; said processor further configured to render said web-page on said display; an input device connected to said processor, said processor configured to receive focus on one of said plurality of context sensitive items via said input device placing a pointer over the one context sensitive item; said processor further configured to respond to receiving the focus by rendering only the tags, labels, or text constituting the data portion of the context sensitive content related to said one of the plurality of context sensitive items on said display via the secondary web-browser application; and said processor further configured to not execute said scripts associated with said context sensitive content using said secondary web-browser application.
|
1. An electronic device comprising: storage configured to maintain a primary web-browser application and a secondary web-browser application; at least one processor connected to said storage and configured to execute said primary web-browser application; an interface connected to said processor, said processor configured to receive a web-page stored at a web-server via said interface, said web-page including context sensitive content related to a plurality of context sensitive items on said web-page, said context sensitive content being able to change without further input from the web-server, said context sensitive content comprising a data portion and a non-data portion, said non-data portion comprising scripts executable by said primary web-browser application and said data portion comprising tags, labels, or text; a display connected to said processor; said processor further configured to render said web-page on said display; an input device connected to said processor, said processor configured to receive focus on one of said plurality of context sensitive items via said input device placing a pointer over the one context sensitive item; said processor further configured to respond to receiving the focus by rendering only the tags, labels, or text constituting the data portion of the context sensitive content related to said one of the plurality of context sensitive items on said display via the secondary web-browser application; and said processor further configured to not execute said scripts associated with said context sensitive content using said secondary web-browser application. 9. The electronic device of claim 1 wherein said primary web-browser application is configured to emulate a desk-top browser.
| 0.742798 |
9,652,547 | 1 | 5 |
1. A method of suggestion query completions before a user completes a query request, the method comprising: receiving, at a search engine system, a network request from a client device; ascertaining a general location and a specific location of the client device, the specific location being a more specific indication of the location of the client device than the general location; determining that the network request contains a query stem and not a completed query request; obtaining general queries containing the query stem; obtaining local queries containing the query stem and corresponding to the specific location; in response to determining that the network request contains the query stem, selecting, with one or more processors of the search engine system, suggested queries by performing steps comprising: selecting some of the suggested queries from among the general queries based on popularity of the general queries in an area corresponding to the general location, selecting some of the suggested queries from among the local queries based on popularity of the specific queries in an area corresponding to the specific location, and selecting one of the suggested queries from among the local queries in response to determining that the local query is a refinement of one of the general queries; and sending the suggested queries to the client device before the client device receives an input from the user submitting the completed query request.
|
1. A method of suggestion query completions before a user completes a query request, the method comprising: receiving, at a search engine system, a network request from a client device; ascertaining a general location and a specific location of the client device, the specific location being a more specific indication of the location of the client device than the general location; determining that the network request contains a query stem and not a completed query request; obtaining general queries containing the query stem; obtaining local queries containing the query stem and corresponding to the specific location; in response to determining that the network request contains the query stem, selecting, with one or more processors of the search engine system, suggested queries by performing steps comprising: selecting some of the suggested queries from among the general queries based on popularity of the general queries in an area corresponding to the general location, selecting some of the suggested queries from among the local queries based on popularity of the specific queries in an area corresponding to the specific location, and selecting one of the suggested queries from among the local queries in response to determining that the local query is a refinement of one of the general queries; and sending the suggested queries to the client device before the client device receives an input from the user submitting the completed query request. 5. The method of claim 1 , wherein determining that the network request contains the query stem comprises: determining that more than a threshold amount of time has elapsed since a last character was added to the query stem.
| 0.71134 |
10,002,301 | 1 | 7 |
1. A method for Arabic handwriting recognition, the method comprising: acquiring, an input image representative of a handwritten Arabic text from a user; partitioning, using processing circuitry of a server, the input image into a plurality of regions; determining, using the processing circuitry, a bag of features representation for each region of the plurality of regions; modeling, using the processing circuitry, each region independently by multi stream discrete Hidden Markov Model (HMM); and identifying, using processing circuitry, a recognized text based on the HMM models.
|
1. A method for Arabic handwriting recognition, the method comprising: acquiring, an input image representative of a handwritten Arabic text from a user; partitioning, using processing circuitry of a server, the input image into a plurality of regions; determining, using the processing circuitry, a bag of features representation for each region of the plurality of regions; modeling, using the processing circuitry, each region independently by multi stream discrete Hidden Markov Model (HMM); and identifying, using processing circuitry, a recognized text based on the HMM models. 7. The method of claim 1 , wherein the plurality of regions includes a middle region, an upper region, and a lower region.
| 0.747934 |
8,458,195 | 1 | 9 |
1. A computer-implemented method for determining similar users, comprising: receiving information for a source user, at a computer system, the information including at least one topic and a user value for each topic, where: the user value includes a user authority value representing a user expertise related to that topic and a user interest value representing a degree of user association with that topic, and the user value represents how strongly the user is associated with that topic; generating similarity scores based on a user value for each topic for the source user and a user value for the same topic for each user in a set of users, where each user in the set of users is associated with a user value for each topic; selecting one or more similar users based on the generated similarity scores; outputting one or more of the selected users; and outputting the identity of one or more overlapping topics and a value indicating a degree of overlap for each overlapping topic.
|
1. A computer-implemented method for determining similar users, comprising: receiving information for a source user, at a computer system, the information including at least one topic and a user value for each topic, where: the user value includes a user authority value representing a user expertise related to that topic and a user interest value representing a degree of user association with that topic, and the user value represents how strongly the user is associated with that topic; generating similarity scores based on a user value for each topic for the source user and a user value for the same topic for each user in a set of users, where each user in the set of users is associated with a user value for each topic; selecting one or more similar users based on the generated similarity scores; outputting one or more of the selected users; and outputting the identity of one or more overlapping topics and a value indicating a degree of overlap for each overlapping topic. 9. The method of claim 1 , wherein the receiving step comprises: receiving the user information for the source user from a user.
| 0.678392 |
9,805,073 | 16 | 18 |
16. The non-transitory computer-readable medium of claim 15 , the operations further comprising: determining that the second string includes a set of characters or patterns indicating that the second string is the surname.
|
16. The non-transitory computer-readable medium of claim 15 , the operations further comprising: determining that the second string includes a set of characters or patterns indicating that the second string is the surname. 18. The non-transitory computer-readable medium of claim 16 , wherein determining the confidence score is further based on determining that the second string includes the set of characters or patterns indicating that the second string is the surname.
| 0.742798 |
7,975,227 | 1 | 4 |
1. A method implemented by an electronic system adapted to process content data files to form digital data representing a work of communication, the work of communication pertaining to a narrative, and the method comprising: accessing a first set of content data files stored in a memory device accessible to the electronic system, the first set of content data files associated with the work of communication; determining context indicators from at least some of the content data files in the first set based at least upon a set of rules for identifying the context indicators; determining relative significances of at least some of the content data files of the first set to (a) a person associated with the work of communication, (b) a node of the narrative, or (c) both (a) and (b); determining inference queries based at least upon the context indicators and the relative significances; obtaining a second set of content data files greater than the first set from a source of content data files using at least the inference queries; and providing at least some of the content data files in the second set to be included in the digital data representing the work of communication, wherein the provided content data files are different than the content data files in the first set.
|
1. A method implemented by an electronic system adapted to process content data files to form digital data representing a work of communication, the work of communication pertaining to a narrative, and the method comprising: accessing a first set of content data files stored in a memory device accessible to the electronic system, the first set of content data files associated with the work of communication; determining context indicators from at least some of the content data files in the first set based at least upon a set of rules for identifying the context indicators; determining relative significances of at least some of the content data files of the first set to (a) a person associated with the work of communication, (b) a node of the narrative, or (c) both (a) and (b); determining inference queries based at least upon the context indicators and the relative significances; obtaining a second set of content data files greater than the first set from a source of content data files using at least the inference queries; and providing at least some of the content data files in the second set to be included in the digital data representing the work of communication, wherein the provided content data files are different than the content data files in the first set. 4. The method of claim 1 , wherein the relative significances are determined at least with respect to the person associated with the work of communication.
| 0.840206 |
9,767,144 | 1 | 7 |
1. A computer-implemented process for operating a search system, comprising: receiving a database comprising a plurality of items; for each item, automatically mining a plurality of websites to retrieve a plurality of instances of unstructured user entered textual descriptions corresponding to each item; for each item, extracting a plurality of candidate attribute values from the corresponding user entered textual descriptions; ranking the candidate attribute values according to how selection of each candidate attribute value will reduce a size of a search result set; wherein ranking the candidate attribute values further comprises computing a degree of discrimination for each of a plurality of attribute values, the degree of discrimination for each attribute value corresponding to the number of items that would be excluded from the search result set when the search result set is limited to items having the corresponding attribute value; for each item, generating a reduced set of candidate attribute values by applying a classifier to filter out one or more ranked candidate attribute values that are unlikely to reduce the size of the search result set by determining, for each candidate attribute value, whether an answer to a question formulated from each candidate attribute value is likely to reduce the size of the search result set; in response to a search query, returning a query result set comprising a subset of items from the database; applying a top ranked one of the reduced set of candidate attribute values corresponding to the items of the query result set to automatically formulate and present a question relating to the top ranked candidate attribute value such that any response to that question will reduce a size of the query result set returned in response to the search query; and wherein the presented question is a request for a value of an attribute.
|
1. A computer-implemented process for operating a search system, comprising: receiving a database comprising a plurality of items; for each item, automatically mining a plurality of websites to retrieve a plurality of instances of unstructured user entered textual descriptions corresponding to each item; for each item, extracting a plurality of candidate attribute values from the corresponding user entered textual descriptions; ranking the candidate attribute values according to how selection of each candidate attribute value will reduce a size of a search result set; wherein ranking the candidate attribute values further comprises computing a degree of discrimination for each of a plurality of attribute values, the degree of discrimination for each attribute value corresponding to the number of items that would be excluded from the search result set when the search result set is limited to items having the corresponding attribute value; for each item, generating a reduced set of candidate attribute values by applying a classifier to filter out one or more ranked candidate attribute values that are unlikely to reduce the size of the search result set by determining, for each candidate attribute value, whether an answer to a question formulated from each candidate attribute value is likely to reduce the size of the search result set; in response to a search query, returning a query result set comprising a subset of items from the database; applying a top ranked one of the reduced set of candidate attribute values corresponding to the items of the query result set to automatically formulate and present a question relating to the top ranked candidate attribute value such that any response to that question will reduce a size of the query result set returned in response to the search query; and wherein the presented question is a request for a value of an attribute. 7. The computer-implemented process of claim 1 , wherein ranking the candidate attribute values is based on a degree of discrimination among items in the search result set that results from qualifying inclusion in the search result set based on corresponding candidate attribute values and the corresponding unstructured user entered textual descriptions.
| 0.53534 |
9,501,293 | 1 | 2 |
1. An article of manufacture including a non-transitory computer readable storage medium to tangibly store instructions, which when executed by a computer, cause the computer to: receive a user action to navigate to a second management application from a first management application; collect one or more managed entities in the first management application, wherein the one or more managed entities are at least one of an application and a service; define one or more related entities, comprising entities related to the one or more managed entities to populate a managed entity context, wherein the one or more related entities are defined through entity relations registered by one or more dedicated managed beans (MBeans), the one or more dedicated MBeans comprising an attribute showing the entity relations; retrieve one or more context entities from the managed entity context, the one or more context entities recognizable by the second management application; and apply the retrieved one or more context entities in the second management application.
|
1. An article of manufacture including a non-transitory computer readable storage medium to tangibly store instructions, which when executed by a computer, cause the computer to: receive a user action to navigate to a second management application from a first management application; collect one or more managed entities in the first management application, wherein the one or more managed entities are at least one of an application and a service; define one or more related entities, comprising entities related to the one or more managed entities to populate a managed entity context, wherein the one or more related entities are defined through entity relations registered by one or more dedicated managed beans (MBeans), the one or more dedicated MBeans comprising an attribute showing the entity relations; retrieve one or more context entities from the managed entity context, the one or more context entities recognizable by the second management application; and apply the retrieved one or more context entities in the second management application. 2. The article of manufacture of claim 1 , wherein receiving the user action to navigate to a second management application is performed by following a link in the first management application leading to the second management application.
| 0.5 |
7,987,421 | 31 | 33 |
31. One or more computer-readable media containing a program according to claim 30 , wherein the location software includes location software to locate the one of the plurality of layout strings files storing the first layout string in a selected language.
|
31. One or more computer-readable media containing a program according to claim 30 , wherein the location software includes location software to locate the one of the plurality of layout strings files storing the first layout string in a selected language. 33. One or more computer-readable media containing a program according to claim 31 , the program further comprising: reception software to receive a ranked list of languages from the user, the ranked list comprising a plurality of languages in an order based on preferences of the user; accessing software to access a resource file map listing recognized combinations of layout information files and languages in which the layout strings file store the layout string; and identification software to identify the selected language from the resource file map based on the ranked list of languages.
| 0.5 |
8,255,286 | 6 | 7 |
6. The method of claim 4 further comprising: receiving a rescheduled start time for the user submission; and wherein the updating of the user submission is in response to the receiving of the rescheduled start time.
|
6. The method of claim 4 further comprising: receiving a rescheduled start time for the user submission; and wherein the updating of the user submission is in response to the receiving of the rescheduled start time. 7. The method of claim 6 , wherein: the publishing of the plurality of user submissions includes publishing the user submission according to the rescheduled start time for the user submission.
| 0.5 |
9,171,262 | 17 | 19 |
17. A portable processor-based device comprising: geographic location identification hardware; and one or more processors configured to: capture one or more usage behaviors; deliver the one or more usage behaviors to a computer-implemented function that infers a first expertise level of a first person who is a first user of the portable processor-based device from the one or more usage behaviors; receive one or more computer-implemented objects that are selected from a plurality of computer-implemented objects that do not represent users of a computer-implemented system and that have associated computer-implemented directionally distinct relationships between pairs of the plurality of computer-implemented objects, wherein the selecting is performed in accordance with the first expertise level, at least one of the computer-implemented directionally distinct relationships, and a first automatically determined geographic location; and deliver the one or more computer-implemented objects to the first person.
|
17. A portable processor-based device comprising: geographic location identification hardware; and one or more processors configured to: capture one or more usage behaviors; deliver the one or more usage behaviors to a computer-implemented function that infers a first expertise level of a first person who is a first user of the portable processor-based device from the one or more usage behaviors; receive one or more computer-implemented objects that are selected from a plurality of computer-implemented objects that do not represent users of a computer-implemented system and that have associated computer-implemented directionally distinct relationships between pairs of the plurality of computer-implemented objects, wherein the selecting is performed in accordance with the first expertise level, at least one of the computer-implemented directionally distinct relationships, and a first automatically determined geographic location; and deliver the one or more computer-implemented objects to the first person. 19. The device of claim 17 comprising the one or more processors configured to: receive the one or more computer-implemented objects that are selected from the plurality of computer-implemented objects, wherein at least one of the selected one or more computer-implemented objects comprises a reference to a geographic location.
| 0.5 |
7,680,785 | 16 | 19 |
16. A method for determining a rule applicable to uniform resource locators (URLs), comprising: grouping web resources on a web server according to substantially identical content, wherein each group of substantially identical web resources is referred to as an equivalence class; analyzing URLs addressing all substantially identical web resources in an equivalence class; constructing a per equivalence class URL normalization rule applicable to the URLs corresponding to all substantially identical web resources in the equivalence class; analyzing the per equivalence class URL normalization rule compared to at least one other per equivalence class URL normalization rule for at least one different equivalence class to determine a trans-equivalence class URL normalization rule; and applying the trans-equivalence class URL normalization rule to additional web resources to predict that different URLs reference substantially identical web resources, thereby avoiding a plurality of references to or downloads of substantially identical web resources.
|
16. A method for determining a rule applicable to uniform resource locators (URLs), comprising: grouping web resources on a web server according to substantially identical content, wherein each group of substantially identical web resources is referred to as an equivalence class; analyzing URLs addressing all substantially identical web resources in an equivalence class; constructing a per equivalence class URL normalization rule applicable to the URLs corresponding to all substantially identical web resources in the equivalence class; analyzing the per equivalence class URL normalization rule compared to at least one other per equivalence class URL normalization rule for at least one different equivalence class to determine a trans-equivalence class URL normalization rule; and applying the trans-equivalence class URL normalization rule to additional web resources to predict that different URLs reference substantially identical web resources, thereby avoiding a plurality of references to or downloads of substantially identical web resources. 19. The method of claim 16 , wherein grouping web resources on a web server according to substantially identical content comprises at least one of shingling, check-summing, and lexical comparison.
| 0.5 |
8,321,463 | 14 | 23 |
14. One or more devices comprising: a comments database that stores comments associated with documents; a searching component to receive a request for comments associated with a particular document and to identify the comments by searching the comments database, where the request for comments is associated with a particular user; a ranking component to rank the identified comments based on a combination of objective scores and subjective scores, comprising: an objective ranking component to generate the objective scores for comments, where the objective scores are independent of the particular user, and a subjective ranking component to generate the subjective scores for comments, where the subjective scores depend on the particular user; and an interface to provide, to a client device associated with the user, the ranked comments for presentation in connection with the particular document.
|
14. One or more devices comprising: a comments database that stores comments associated with documents; a searching component to receive a request for comments associated with a particular document and to identify the comments by searching the comments database, where the request for comments is associated with a particular user; a ranking component to rank the identified comments based on a combination of objective scores and subjective scores, comprising: an objective ranking component to generate the objective scores for comments, where the objective scores are independent of the particular user, and a subjective ranking component to generate the subjective scores for comments, where the subjective scores depend on the particular user; and an interface to provide, to a client device associated with the user, the ranked comments for presentation in connection with the particular document. 23. The one or more devices of claim 14 , where the objective score has an associated first weight and the subjective score has an associated second weight, and where the ranking component generates a combined score using the objective score, the first weight, the subjective score, and the second weight.
| 0.722727 |
8,700,593 | 26 | 27 |
26. The search system of claim 25 , wherein the NFA engine is activated in response to the trigger signal and is configured to provide a match result onto the result pipeline if the NFA engine detects a match between the second sub-expression and the input string of characters.
|
26. The search system of claim 25 , wherein the NFA engine is activated in response to the trigger signal and is configured to provide a match result onto the result pipeline if the NFA engine detects a match between the second sub-expression and the input string of characters. 27. The search system of claim 26 , wherein the token stitcher does not alter the match results generated by the NFA engine.
| 0.5 |
8,700,383 | 10 | 13 |
10. A system for facilitating a translation and sampling the translation to determine an overall quality thereof, the system comprising: a first computer and a second computer operably connected to a database; the first computer comprising a first processor and first memory device operably connected to one another to operate as a translator workstation; the first computer, wherein the first processor is programmed to execute a translation assisting software module that assists a human translator by retrieving, from the database, a source document and storing, to the database, a target document that is a translation of the source document; the second computer comprising a second processor and second memory device operably connected to one another to operate as a reviewer work station; the second computer, wherein the second processor is programmed to execute a quality quantifying software module that operates to assist a human reviewer by retrieving a sample from the database, the sample comprising substantially less than an entirety of the translation, a subset of the target document, and a corresponding subset of the source document, providing a list of preset error categories, receiving selections from a reviewer as selected from the preset error categories, and generalizing the selections associated with the sample into an overall quality characterization of the entirety of the translation.
|
10. A system for facilitating a translation and sampling the translation to determine an overall quality thereof, the system comprising: a first computer and a second computer operably connected to a database; the first computer comprising a first processor and first memory device operably connected to one another to operate as a translator workstation; the first computer, wherein the first processor is programmed to execute a translation assisting software module that assists a human translator by retrieving, from the database, a source document and storing, to the database, a target document that is a translation of the source document; the second computer comprising a second processor and second memory device operably connected to one another to operate as a reviewer work station; the second computer, wherein the second processor is programmed to execute a quality quantifying software module that operates to assist a human reviewer by retrieving a sample from the database, the sample comprising substantially less than an entirety of the translation, a subset of the target document, and a corresponding subset of the source document, providing a list of preset error categories, receiving selections from a reviewer as selected from the preset error categories, and generalizing the selections associated with the sample into an overall quality characterization of the entirety of the translation. 13. The system of claim 10 , further comprising: a third computer comprising a third processor and a third memory device operably connected together and to the database; and the third computer further programmed to execute a resource managing software module that assists a human to identify patterns in one or more translations facilitated by the translation assisting software module.
| 0.71151 |
7,953,279 | 14 | 15 |
14. The system of claim 11 wherein the combination mechanism comprises an artificial neural network-based combination process.
|
14. The system of claim 11 wherein the combination mechanism comprises an artificial neural network-based combination process. 15. The system of claim 14 wherein the artificial neural network-based combination process comprises a back propagation algorithm.
| 0.5 |
9,058,362 | 1 | 10 |
1. A computer implemented enterprise search apparatus, comprising: one or more repositories comprising electronic storage media available within an enterprise; an electronic database storing therein information related to one or more users; a processor implemented search engine for receiving user queries via a user interface and, responsive thereto, performing searches on said one or more repositories; upon receiving a user query from a user, said search engine identifying the user and fetching information related to the user from said database, the information fetched from said database comprising: prior search words and results for searches performed by the user and other users who may be associated with the user; a trail of the user in an enterprise domain; a trail of the user prior to visiting the enterprise domain; text mined chat transcripts; meta data of chats; text mined voice transcripts; information present in social networks; information related to the user, including attributes from a CRM system about the user such as billing data, past bills, mobile plan; data from enterprise pages; and forms filled by the user; wherein information fetched from said database also depends on said user query; a processor implemented recommendation engine for receiving from said search engine information fetched from said database by said search engine; said recommendation engine probabilistically predicting a user issue type based upon both of the information related to the user fetched from the database and the search query from the user; said probability engine determining probability for a given issue type/resolution need as a function of any of user attributes from CRM and other sources, history of prior contacts through all channels, behavior on a website, behavior on the Web before coming into a website and the search query from the user; said recommendation engine executing an algorithm for predicting a probability that a given issue is an issue of interest for the user and returns results to the user related to said issue of interest; and wherein meta data of chats comprises average handle time, average response time, disposition, standard deviation of response times, number of customer lines, and number of agent lines.
|
1. A computer implemented enterprise search apparatus, comprising: one or more repositories comprising electronic storage media available within an enterprise; an electronic database storing therein information related to one or more users; a processor implemented search engine for receiving user queries via a user interface and, responsive thereto, performing searches on said one or more repositories; upon receiving a user query from a user, said search engine identifying the user and fetching information related to the user from said database, the information fetched from said database comprising: prior search words and results for searches performed by the user and other users who may be associated with the user; a trail of the user in an enterprise domain; a trail of the user prior to visiting the enterprise domain; text mined chat transcripts; meta data of chats; text mined voice transcripts; information present in social networks; information related to the user, including attributes from a CRM system about the user such as billing data, past bills, mobile plan; data from enterprise pages; and forms filled by the user; wherein information fetched from said database also depends on said user query; a processor implemented recommendation engine for receiving from said search engine information fetched from said database by said search engine; said recommendation engine probabilistically predicting a user issue type based upon both of the information related to the user fetched from the database and the search query from the user; said probability engine determining probability for a given issue type/resolution need as a function of any of user attributes from CRM and other sources, history of prior contacts through all channels, behavior on a website, behavior on the Web before coming into a website and the search query from the user; said recommendation engine executing an algorithm for predicting a probability that a given issue is an issue of interest for the user and returns results to the user related to said issue of interest; and wherein meta data of chats comprises average handle time, average response time, disposition, standard deviation of response times, number of customer lines, and number of agent lines. 10. The apparatus of claim 1 , wherein said search engine requests that the user take a survey on the efficacy of the search results; wherein any information provided by the user is used by the search engine to improve searches made by the user and/or other users in the future.
| 0.814913 |
9,177,060 | 1 | 3 |
1. A method for processing and analyzing content from at least one Website on a communication network, the method comprising steps for: receiving instructions, via a graphical user interface (GUI) executed by a server, to conduct a search for at least one keyword on the communication network; launching a Web crawler, by the server, to search a plurality of Websites for at least one Website having content that includes said at least one keyword; identifying Websites comprising at least one comment container, wherein said comment container includes at least one conversation; creating a unique xpath, by the server, to said at least one comment container of each identified Website of said Websites, wherein the unique xpath comprises an extraction string dynamically generated to identify at least one of how to find comments, the date of a post on the Website, IP address, user name, and location; saving, in a database, the unique xpath created for said at least one comment container of said each identified Website; detecting using the unique xpath at least one conversation that includes the at least one keyword from search of a content of said comment container of said each Website accessible only by said unique xpath; saving only a portion of the content of said comment container from said each Website that includes the at least one keyword along with information associated to each conversation of said identified conversation; assigning, via a server, a categorical topic for said each conversation; assigning, via a server, a sentiment for said each conversation; and generating at least one report, by the server, providing selected information related to said each conversation, along with categorical topic and sentiment for said each conversation, wherein the method is computer implemented, and wherein said assigning the sentiment comprises assigning a positive or negative value along a range, based on the words comprised in the content of the Website.
|
1. A method for processing and analyzing content from at least one Website on a communication network, the method comprising steps for: receiving instructions, via a graphical user interface (GUI) executed by a server, to conduct a search for at least one keyword on the communication network; launching a Web crawler, by the server, to search a plurality of Websites for at least one Website having content that includes said at least one keyword; identifying Websites comprising at least one comment container, wherein said comment container includes at least one conversation; creating a unique xpath, by the server, to said at least one comment container of each identified Website of said Websites, wherein the unique xpath comprises an extraction string dynamically generated to identify at least one of how to find comments, the date of a post on the Website, IP address, user name, and location; saving, in a database, the unique xpath created for said at least one comment container of said each identified Website; detecting using the unique xpath at least one conversation that includes the at least one keyword from search of a content of said comment container of said each Website accessible only by said unique xpath; saving only a portion of the content of said comment container from said each Website that includes the at least one keyword along with information associated to each conversation of said identified conversation; assigning, via a server, a categorical topic for said each conversation; assigning, via a server, a sentiment for said each conversation; and generating at least one report, by the server, providing selected information related to said each conversation, along with categorical topic and sentiment for said each conversation, wherein the method is computer implemented, and wherein said assigning the sentiment comprises assigning a positive or negative value along a range, based on the words comprised in the content of the Website. 3. The method of claim 1 , wherein parsing is executed by generating a customized parser for each Website.
| 0.618705 |
10,140,979 | 28 | 29 |
28. The system of claim 25 , wherein the processor is further configured to: for f=1 to F, set all locations in an array U f [E V ][M] equal to 0; and for f=1 to F, set array location U f [r f (x)][b] equal to 1, for each (x, b) pair.
|
28. The system of claim 25 , wherein the processor is further configured to: for f=1 to F, set all locations in an array U f [E V ][M] equal to 0; and for f=1 to F, set array location U f [r f (x)][b] equal to 1, for each (x, b) pair. 29. The system of claim 28 , wherein the scalar representation of Q f for a given f comprises: r f ( x ) = ∑ k = 1 V q k f * E k - 1 where q k f represents the k th feature of Q f .
| 0.5 |
9,881,059 | 9 | 11 |
9. A system for suggesting headline terms, comprising: a processor for executing program code; and non-transitory computer storage memory, storing program code that, when executed on the processor, causes the system to perform a method comprising: implementing a machine learning headline click-based topic model; training the machine learning headline click-based topic model using search logs and historic click through data to account for the potential of a word in a headline to induce a click; receiving an article and a headline associated with the article; determining a topic associated with the article; determining at least one word trending in the topic associated with the article; and determining a word click through rate for the at least one word trending in the topic using the trained machine learning headline click-based topic model.
|
9. A system for suggesting headline terms, comprising: a processor for executing program code; and non-transitory computer storage memory, storing program code that, when executed on the processor, causes the system to perform a method comprising: implementing a machine learning headline click-based topic model; training the machine learning headline click-based topic model using search logs and historic click through data to account for the potential of a word in a headline to induce a click; receiving an article and a headline associated with the article; determining a topic associated with the article; determining at least one word trending in the topic associated with the article; and determining a word click through rate for the at least one word trending in the topic using the trained machine learning headline click-based topic model. 11. The system of claim 9 , wherein the at least one word is a word contained in the headline and wherein the method further comprises: calculating a headline click through rate score based on the word click through rate of the at least one word.
| 0.5 |
8,380,530 | 18 | 21 |
18. A system for processing a personal health record (PHR) including a plurality of events each having a time stamp, the system comprising: a mapper for creating a plurality of event-concept pairs by mapping each event of the plurality of events in the PHR to a corresponding health concept among a plurality of health concepts, for assigning to each of the plurality of event-concept pairs the time stamp of the event of that event-concept pair, and for identifying associations among the plurality of event-concept pairs, wherein the plurality of health concepts are categorized into a plurality of categories, wherein identifying associations involves referencing a database of stored information specifying associations between health concepts among the plurality of health concepts, wherein at least some of the specified associations are between health concepts that are in different categories in the plurality of categories, and wherein the plurality of categories are medical tests, diseases, symptoms, medications, and treatments; and a threader for identifying an associative subset of event-concept pairs among the plurality of event-concept pairs, wherein the associative subset includes those events in the PHR that are either associated with a header concept or are associated with another event within the associative subset and wherein the associated subset includes health concepts that are in different categories of the plurality of categories, and for linking a plurality of members of the associative subset of event-concept pairs to form a thread, wherein the thread presents a relationship among the plurality of members of the associative subset of event-concept pairs, and wherein the mapper and the threader are implemented in hardware.
|
18. A system for processing a personal health record (PHR) including a plurality of events each having a time stamp, the system comprising: a mapper for creating a plurality of event-concept pairs by mapping each event of the plurality of events in the PHR to a corresponding health concept among a plurality of health concepts, for assigning to each of the plurality of event-concept pairs the time stamp of the event of that event-concept pair, and for identifying associations among the plurality of event-concept pairs, wherein the plurality of health concepts are categorized into a plurality of categories, wherein identifying associations involves referencing a database of stored information specifying associations between health concepts among the plurality of health concepts, wherein at least some of the specified associations are between health concepts that are in different categories in the plurality of categories, and wherein the plurality of categories are medical tests, diseases, symptoms, medications, and treatments; and a threader for identifying an associative subset of event-concept pairs among the plurality of event-concept pairs, wherein the associative subset includes those events in the PHR that are either associated with a header concept or are associated with another event within the associative subset and wherein the associated subset includes health concepts that are in different categories of the plurality of categories, and for linking a plurality of members of the associative subset of event-concept pairs to form a thread, wherein the thread presents a relationship among the plurality of members of the associative subset of event-concept pairs, and wherein the mapper and the threader are implemented in hardware. 21. The system of claim 18 , wherein the threader identifies an associative subset by identifying a specific health concept and identifying a subset of the plurality of event-concept pairs wherein each member of the associative subset is at least associated with the specific health concept or associated with another event-concept pair in the associative subset.
| 0.5 |
8,832,052 | 1 | 6 |
1. A method for providing a seed Uniform Resource Locator (URL) of a document within a computer network to a search engine in the computer network, the computer network having a plurality of documents with URLs distributed therein, the search engine having a web-graph in which exists a set of crawled documents, the method comprising: detecting, by a router, from among data packets exchanged in the computer network external to the search engine, a packet containing a request to access a requested document, the router not being aware of which documents are not reachable by the search engine; extracting a requested document URL of the requested document from the packet containing the request; and determining that the requested document URL was not previously requested within a predetermined time interval, and in response, providing the requested document URL as the seed URL to the search engine, so as to cause the search engine to expand the set of crawled documents by adding the requested document to the set of crawled documents.
|
1. A method for providing a seed Uniform Resource Locator (URL) of a document within a computer network to a search engine in the computer network, the computer network having a plurality of documents with URLs distributed therein, the search engine having a web-graph in which exists a set of crawled documents, the method comprising: detecting, by a router, from among data packets exchanged in the computer network external to the search engine, a packet containing a request to access a requested document, the router not being aware of which documents are not reachable by the search engine; extracting a requested document URL of the requested document from the packet containing the request; and determining that the requested document URL was not previously requested within a predetermined time interval, and in response, providing the requested document URL as the seed URL to the search engine, so as to cause the search engine to expand the set of crawled documents by adding the requested document to the set of crawled documents. 6. The method of claim 1 , wherein the requested document URL is provided as the seed URL to the search engine using a logical bus.
| 0.739044 |
9,727,574 | 14 | 15 |
14. The non-transitory computer-readable storage medium of claim 13 , wherein said writing of the first string further comprises: determining a first string based on said comparison, said first string comprising one instance of matching characters in the input string and dictionary string; and writing the first string to the dictionary string, said writing comprising appending the first string to a control output string of the dictionary string comprising said control characters.
|
14. The non-transitory computer-readable storage medium of claim 13 , wherein said writing of the first string further comprises: determining a first string based on said comparison, said first string comprising one instance of matching characters in the input string and dictionary string; and writing the first string to the dictionary string, said writing comprising appending the first string to a control output string of the dictionary string comprising said control characters. 15. The non-transitory computer-readable storage medium of claim 14 , wherein writing the first string further comprises: converting the first string to a first alpha-numeric representation comprising a first number and a second number, said first number representing the number of characters from the end of the dictionary from where the first string was identified, said second number representing the length of the first string; and writing the first string to the control output string based on said first alpha-numeric representation.
| 0.5 |
8,838,557 | 17 | 24 |
17. A computer program product comprising a computer readable storage medium including a computer readable program, where the computer readable program when executed on a computer causes the computer to: display a plurality of edited changes associated with an editable file on a display in response to receipt of a request via a user input device to display the plurality of edited changes; display, proximate to the displayed plurality of edited changes, a separate contextual representation of the editable file that comprises a contiguous series of individually expandable and compressible blank representations of pages of the editable file, where each subsequent blank page representation in the contiguous series shares one common border with a respective previous blank page representation in the contiguous series; display a context indicator within an expanded blank page representation of the separate contextual representation of the editable file that represents a location within the editable file associated with a first of the displayed plurality of edited changes; and iteratively update, in response to detection of user selections of elements of the displayed plurality of edited changes received via the user input device, the context indicator within iteratively expanded blank page representations of the separate contextual representation of the editable file to represent a location within the editable file associated with each selected element of the displayed plurality of edited changes.
|
17. A computer program product comprising a computer readable storage medium including a computer readable program, where the computer readable program when executed on a computer causes the computer to: display a plurality of edited changes associated with an editable file on a display in response to receipt of a request via a user input device to display the plurality of edited changes; display, proximate to the displayed plurality of edited changes, a separate contextual representation of the editable file that comprises a contiguous series of individually expandable and compressible blank representations of pages of the editable file, where each subsequent blank page representation in the contiguous series shares one common border with a respective previous blank page representation in the contiguous series; display a context indicator within an expanded blank page representation of the separate contextual representation of the editable file that represents a location within the editable file associated with a first of the displayed plurality of edited changes; and iteratively update, in response to detection of user selections of elements of the displayed plurality of edited changes received via the user input device, the context indicator within iteratively expanded blank page representations of the separate contextual representation of the editable file to represent a location within the editable file associated with each selected element of the displayed plurality of edited changes. 24. The computer program product of claim 17 , where the computer readable program when executed on the computer further causes the computer to: receive a request to filter the plurality of edited changes based upon a selected one of the plurality of edited changes; filter the plurality of edited changes based upon the selected one of the plurality of edited changes; and where, in causing the computer to display the plurality of edited changes associated with the editable file on the display, the computer readable program when executed on the computer causes the computer to display the filtered plurality of edited changes.
| 0.767184 |
9,465,799 | 5 | 6 |
5. A system comprising: a memory to store a plurality of translations of terms for a plurality of web pages; and a processing device operatively coupled to the memory to: receive a request for a web page from a client web browser, the request comprising a locale identifier that specifies a preferred language and a web page identifier; search mapping data stored in a local data store associating web page identifiers with keys that correspond to the web page identifiers to identify one or more keys mapped to the web page identifier, the one or more keys being identifiers of translatable terms within a plurality of web pages; search, within the local data store, to identify a sub-set of a plurality of translations that corresponds to one or more translatable terms in the requested web page, wherein the sub-set is identified using the locale identifier and the one or more keys; dynamically generate a client-executable script to provide the sub-set of translations that correspond to the one or more terms to the client web browser; and transmit the requested web page together with the client-executable script comprising the sub-set of translations for the requested web page to the client web browser, wherein to transmit the requested web page and the client-executable script the processing device is to: transmit the client-executable script in an external file that is separate from the web page; and embed a reference to the external file in a section of code of the web page, wherein, when the web page is loaded by the client, the client-executable script in the external file is executed to render the web page in a language associated with the locale identifier.
|
5. A system comprising: a memory to store a plurality of translations of terms for a plurality of web pages; and a processing device operatively coupled to the memory to: receive a request for a web page from a client web browser, the request comprising a locale identifier that specifies a preferred language and a web page identifier; search mapping data stored in a local data store associating web page identifiers with keys that correspond to the web page identifiers to identify one or more keys mapped to the web page identifier, the one or more keys being identifiers of translatable terms within a plurality of web pages; search, within the local data store, to identify a sub-set of a plurality of translations that corresponds to one or more translatable terms in the requested web page, wherein the sub-set is identified using the locale identifier and the one or more keys; dynamically generate a client-executable script to provide the sub-set of translations that correspond to the one or more terms to the client web browser; and transmit the requested web page together with the client-executable script comprising the sub-set of translations for the requested web page to the client web browser, wherein to transmit the requested web page and the client-executable script the processing device is to: transmit the client-executable script in an external file that is separate from the web page; and embed a reference to the external file in a section of code of the web page, wherein, when the web page is loaded by the client, the client-executable script in the external file is executed to render the web page in a language associated with the locale identifier. 6. The system of claim 5 , wherein the processing device is further to: search for indicators in source code for the plurality of web pages indicating terms in the plurality of web pages to be translated; generate a dictionary comprising the terms to be translated for the plurality of web pages; translate the dictionary in a plurality of languages to generate the plurality of translations for the plurality of web pages; and store the plurality of translations in the plurality of languages for the plurality of web pages in the local data store.
| 0.5 |
4,624,012 | 2 | 4 |
2. A method of converting voice characteristics of synthesized speech to obtain modified synthesized speech of any one of a plurality of voice sounds simulating child-like, adult, aged and sexual characteristics from a single applied source of synthesized speech, said method comprising: providing a source of synthesized speech in the form of digital speech data subject to speech synthesization using a predetermined sample period comprising a known number of task-accomplishing time increments; adjusting the sampling period of the digital speech data from said source of synthesized speech in a manner altering the digital speech formants contained therein to a preselected degree; producing modified digital speech data including the adjusted sampling period and having modified voice characteristics as compared to the synthesized speech from said source; generating audio signals representative of human speech from the modified digital speech data; and converting said audio signals into audible synthesized human speech having different voice characteristics from the synthesized human speech which would have been obtained from said source of synthesized speech.
|
2. A method of converting voice characteristics of synthesized speech to obtain modified synthesized speech of any one of a plurality of voice sounds simulating child-like, adult, aged and sexual characteristics from a single applied source of synthesized speech, said method comprising: providing a source of synthesized speech in the form of digital speech data subject to speech synthesization using a predetermined sample period comprising a known number of task-accomplishing time increments; adjusting the sampling period of the digital speech data from said source of synthesized speech in a manner altering the digital speech formants contained therein to a preselected degree; producing modified digital speech data including the adjusted sampling period and having modified voice characteristics as compared to the synthesized speech from said source; generating audio signals representative of human speech from the modified digital speech data; and converting said audio signals into audible synthesized human speech having different voice characteristics from the synthesized human speech which would have been obtained from said source of synthesized speech. 4. A method as set forth in claim 2, wherein the sampling period associated with the digital speech data from said source of synthesized speech is adjusted by adding a predetermined number of time increments to the known number of time increments included in said sampling period to provide a new sampling period having a predetermined time duration greater than that of said sampling period associated with the synthesized speech from said source.
| 0.581308 |
8,141,003 | 1 | 3 |
1. A method for improving user navigation of a multi-page article on a small screen user device, the method comprising: presenting one page of the multi-page article to a user on a screen of the small screen user device; caching one or more pages of the multi-page article as the user progresses through the multi-page article; deleting cached data associated with one or more successive pages when the user goes back to an earlier page of the multi-page article; receiving a request from the user to view the multi-page article as a full-page article; comparing text of the cached one or more pages to text of the full-page article to determine a first appearance of non-duplicative text in the full-page article; returning all pages of the full-page article together; and presenting the full-page article to the user with the screen of the small screen user device showing a page containing the first appearance of non-duplicative text in the full-page article.
|
1. A method for improving user navigation of a multi-page article on a small screen user device, the method comprising: presenting one page of the multi-page article to a user on a screen of the small screen user device; caching one or more pages of the multi-page article as the user progresses through the multi-page article; deleting cached data associated with one or more successive pages when the user goes back to an earlier page of the multi-page article; receiving a request from the user to view the multi-page article as a full-page article; comparing text of the cached one or more pages to text of the full-page article to determine a first appearance of non-duplicative text in the full-page article; returning all pages of the full-page article together; and presenting the full-page article to the user with the screen of the small screen user device showing a page containing the first appearance of non-duplicative text in the full-page article. 3. The method of claim 1 , further comprising: storing the cached one or more pages on the small screen user device; generating a request, the request comprising the one or more cached pages; sending the request to a server; generating a response, the response comprising a tag to identify the first appearance of non-duplicative text; and sending the response to the small screen user device.
| 0.5 |
8,364,669 | 9 | 10 |
9. The method of claim 8 wherein generating a perceived popularity for the musical album comprises: identifying songs related to the musical album; determining a perceived popularity for each of the songs; determining a preliminary perceived popularity for the musical album as a whole; and determining the perceived popularity for the musical album based on the perceived popularity for each of the songs and the preliminary perceived popularity for the musical album as a whole.
|
9. The method of claim 8 wherein generating a perceived popularity for the musical album comprises: identifying songs related to the musical album; determining a perceived popularity for each of the songs; determining a preliminary perceived popularity for the musical album as a whole; and determining the perceived popularity for the musical album based on the perceived popularity for each of the songs and the preliminary perceived popularity for the musical album as a whole. 10. The method of claim 9 wherein the preliminary perceived popularity for the musical album as a whole is based on popularity of the musical album without regard to popularity of individual songs included on the musical album.
| 0.5 |
8,379,806 | 11 | 15 |
11. A method for representing call content in a searchable database, comprising the steps of: collecting incoming calls from source channels; transcribing content of the incoming calls; projecting the content to a vector space model which represents the content in vector space; and classifying the content represented by a vector in a content knowledge based target database.
|
11. A method for representing call content in a searchable database, comprising the steps of: collecting incoming calls from source channels; transcribing content of the incoming calls; projecting the content to a vector space model which represents the content in vector space; and classifying the content represented by a vector in a content knowledge based target database. 15. The method as recited in claim 11 , wherein the projecting includes computing a distance measurement between centers of atomic classes and the content to determine a similarity to one of the classes.
| 0.546875 |
4,058,676 | 45 | 46 |
45. A system for synthesizing speech as defined in claim 44 wherein said pitch pulse generator means includes: means responsive to receipt of said pitch period parameter for generating a sequence of control signals; and means responsive to said sequence of control signals for generating a substantially periodic, amplitude increasing pitch pulse excitation signal.
|
45. A system for synthesizing speech as defined in claim 44 wherein said pitch pulse generator means includes: means responsive to receipt of said pitch period parameter for generating a sequence of control signals; and means responsive to said sequence of control signals for generating a substantially periodic, amplitude increasing pitch pulse excitation signal. 46. A speech analysis and synthesis system as defined in claim 45 wherein said means for analyzing the plurality of speech signal channels by Cepstrum technique to generate a pitch period parameter includes a signal conditioning system for conditioning said Cepstrum signal which has, in the direction of an ordinate axis, an amplitude dimension of said Cepstrum signal and, in the direction of the abscissa, a quantity representing time, said signal conditioning system having: means for generating a weighting signal which linearly increases in value with the dimension in the direction of the abscissa corresponding to said quantity representing time to said Cepstrum signal; and means for adding weighting signal to said Cepstrum signal along said dimension in the direction of the abscissa thereof to generate a weighted Cepstrum signal.
| 0.5 |
8,532,991 | 5 | 6 |
5. The method of claim 1 wherein the speech model comprises a speech detection model, and wherein processing a known speech input to generate a process result comprises: performing speech detection on acoustic data indicative of an input signal to generate a detection state output indicative of a decision made by the speech detection model as to whether the input signal represents speech or non-speech.
|
5. The method of claim 1 wherein the speech model comprises a speech detection model, and wherein processing a known speech input to generate a process result comprises: performing speech detection on acoustic data indicative of an input signal to generate a detection state output indicative of a decision made by the speech detection model as to whether the input signal represents speech or non-speech. 6. The method of claim 5 wherein the true result comprises a true detection state output indicative of whether the input signal represents speech or non-speech and wherein calculating a distance comprises: calculating a true detection state measure indicative of a probability that the speech detection model will make a decision that the input signal represents the true detection state output, given the acoustic data and the model parameters; calculating a speech detection state measure indicative of a probability that the speech detection model will make a decision that the input signal represents the detection state output, given the acoustic data and the model parameters; and calculating the difference as a difference between the true detection state measure and the speech detection state measure.
| 0.5 |
9,367,773 | 7 | 12 |
7. An apparatus for enabling a document to print at a hardware printing device, comprising: a network interface that is arranged to communicate information over a network; a memory that is operative to store and provide access to information; a processor that executes instructions that enable actions, including: receiving the document at a mobile hardware device, wherein the document includes text and identifies a target font reference for each character of the text; employing a metric of the target font reference to improve an accuracy of emulation information for the target font reference; and providing the document and the improved emulation information to the hardware printing device, wherein the hardware printing device employs the provided improved emulation information to print each character of text included in the document.
|
7. An apparatus for enabling a document to print at a hardware printing device, comprising: a network interface that is arranged to communicate information over a network; a memory that is operative to store and provide access to information; a processor that executes instructions that enable actions, including: receiving the document at a mobile hardware device, wherein the document includes text and identifies a target font reference for each character of the text; employing a metric of the target font reference to improve an accuracy of emulation information for the target font reference; and providing the document and the improved emulation information to the hardware printing device, wherein the hardware printing device employs the provided improved emulation information to print each character of text included in the document. 12. The apparatus of claim 7 , further comprising when the target font reference is unlisted in a font strategy table, performing further actions: displaying to a user at least one of: a substitute font from the font strategy table that the hardware printing device is capable of printing; and a substitute font from another font strategy table that the hardware printing device is capable of printing; enabling the user to select at least one of the displayed substitute font from at least one of the font strategy table and the other font strategy table, wherein emulation information for the selected substitute font is provided to the hardware printing device; and updating at least one of the font strategy table and the other font strategy table based on the user's selection.
| 0.5 |
9,576,576 | 10 | 12 |
10. The system of claim 9 , comprising: identifying one or more keywords corresponding to the question, associating the one or more keywords with one or more types of media content, and providing the answer based on the question and the one or more types of media content.
|
10. The system of claim 9 , comprising: identifying one or more keywords corresponding to the question, associating the one or more keywords with one or more types of media content, and providing the answer based on the question and the one or more types of media content. 12. The system of claim 10 , wherein providing the answer based on the one or more types of media content further comprises: identifying two or more candidate answers of the question, generating ranked scores for each of the two or more candidate answers, the ranked scores based on the one or more types of media content, and providing the answer based on the question and the ranked scores.
| 0.5 |
9,031,894 | 15 | 16 |
15. A system for generating a data file comprising: a processor to execute processor executable code; a storage device that stores processor executable code, wherein the processor executable code, when executed by the processor, causes the processor to: detect an expression that describes a structure of a structured image using a constructor; use an inference-rule based search strategy to identify a hierarchical arrangement of bounding boxes in the structured image that match the expression; and generate a first tuple of structured data files based on the identified hierarchical arrangement of bounding boxes in the structured image, wherein the first tuple of structured data files comprises a first data file of content values and a second data file of style characteristic related to the content values.
|
15. A system for generating a data file comprising: a processor to execute processor executable code; a storage device that stores processor executable code, wherein the processor executable code, when executed by the processor, causes the processor to: detect an expression that describes a structure of a structured image using a constructor; use an inference-rule based search strategy to identify a hierarchical arrangement of bounding boxes in the structured image that match the expression; and generate a first tuple of structured data files based on the identified hierarchical arrangement of bounding boxes in the structured image, wherein the first tuple of structured data files comprises a first data file of content values and a second data file of style characteristic related to the content values. 16. The system of claim 15 , wherein the inference-rule based search strategy comprises identifying the bounding boxes by detecting a contour within the first structured image using image processing techniques.
| 0.778481 |
8,909,651 | 10 | 11 |
10. A non-transitory computer-readable storage medium whose contents, when executed by a processor, cause the processor to perform operations including: identifying search engine optimization keywords associated with an entity; identifying social media correspondence from social media referencing the search engine optimization keywords; designating one or more of the search engine optimization keywords as selected keywords based on the social media correspondence; requesting search results from a search engine that result from a search of the selected keywords on the search engine; identifying one or more non-social media webpages that are associated with the entity and that are included in the search results; and generating an electronic notification for sending to the entity, the electronic notification recommending material for engagement in the social media, the material including information located on the identified one or more non-social media webpages.
|
10. A non-transitory computer-readable storage medium whose contents, when executed by a processor, cause the processor to perform operations including: identifying search engine optimization keywords associated with an entity; identifying social media correspondence from social media referencing the search engine optimization keywords; designating one or more of the search engine optimization keywords as selected keywords based on the social media correspondence; requesting search results from a search engine that result from a search of the selected keywords on the search engine; identifying one or more non-social media webpages that are associated with the entity and that are included in the search results; and generating an electronic notification for sending to the entity, the electronic notification recommending material for engagement in the social media, the material including information located on the identified one or more non-social media webpages. 11. The non-transitory computer-readable storage medium of claim 10 , wherein the operations further comprise ranking the identified one or more non-social media webpages based on at least one of search engine result location of the identified non-social media webpages, traffic on the identified one or more non-social media webpages, conversions generated by the identified one or more non-social media webpages, conversion rate of the identified one or more non-social media webpages, and revenues generated by the identified one or more non-social media webpages, wherein the material from the electronic notification includes information from the identified non-social media webpages that are highly ranked.
| 0.5 |
9,582,496 | 10 | 11 |
10. A computer system for facilitating a meeting of a group of participants, the system comprising: a memory having computer readable instructions; and a processor configured to execute the computer readable instructions for: receiving, in electronic text form, words uttered by the participants during the meeting; generating a graph of the words from the participants as the words are received from the participants, wherein the graph includes a plurality of nodes and a plurality of edges, each node representing a word or a phrase uttered by a participant, and each edge representing a temporal precedence of utterance of the words; analyzing the graph of the words to determine cognitive states of each of the participants respectively; determining a combined cognitive state for a subgroup of participants, wherein the combined cognitive state for the subgroup of participants represents a composite of the cognitive states of each respective participant of the subgroup, wherein determining the combined cognitive state comprises: retrieving, from an information repository, weights associated with respective participants of the subgroup of participants, wherein a weight assigned to each respective participant is based on a prior social network post of the each respective participant that is automatically retrieved and analyzed from an external information repository; and combining the cognitive states of the participants of the subgroup according to the corresponding weights of the participants of the subgroup; and informing at least one of the participants about the combined cognitive state of the subgroup of participants, wherein the informing comprises transmitting audio-visual message to the at least one of the participants.
|
10. A computer system for facilitating a meeting of a group of participants, the system comprising: a memory having computer readable instructions; and a processor configured to execute the computer readable instructions for: receiving, in electronic text form, words uttered by the participants during the meeting; generating a graph of the words from the participants as the words are received from the participants, wherein the graph includes a plurality of nodes and a plurality of edges, each node representing a word or a phrase uttered by a participant, and each edge representing a temporal precedence of utterance of the words; analyzing the graph of the words to determine cognitive states of each of the participants respectively; determining a combined cognitive state for a subgroup of participants, wherein the combined cognitive state for the subgroup of participants represents a composite of the cognitive states of each respective participant of the subgroup, wherein determining the combined cognitive state comprises: retrieving, from an information repository, weights associated with respective participants of the subgroup of participants, wherein a weight assigned to each respective participant is based on a prior social network post of the each respective participant that is automatically retrieved and analyzed from an external information repository; and combining the cognitive states of the participants of the subgroup according to the corresponding weights of the participants of the subgroup; and informing at least one of the participants about the combined cognitive state of the subgroup of participants, wherein the informing comprises transmitting audio-visual message to the at least one of the participants. 11. The computer system of claim 10 , wherein the instructions further comprise: identifying a transition from a cognitive state to another for a subgroup of participants in order to detect a divergence of the cognitive state of the subgroup during the meeting; automatically generating an advice based on the detected divergence; and providing the advice to a participant outside the subgroup in order to influence a course of the meeting.
| 0.5 |
8,412,637 | 1 | 20 |
1. A method for using a computer to facilitate and control access to a two-level information database created by inputs supplied by posting users, comprising the steps of: (a) receiving and storing in the database, a plurality of two-part descriptions each supplied by a user, each two-part description including a first-level element in the form of a basic description of each user's unmet need or unsolved problem, and a second-level element in the form of a detailed description of each user's unmet need or unsolved problem; (b) by a computer, permitting originators to access and select without restriction only the first-level elements of the stored two-part descriptions; (c) providing selecting originators with an option to access the second-level elements of the stored two-part descriptions that correspond to the selected first-level elements by agreeing to a license agreement specifying the terms of use for at least the second-level element; (d) providing license accepting originators with access to the second-level elements of the stored two-part description corresponding to the selected first-level elements; (e) permitting non-license-accepting originators to search the contents of the first-level and second-level elements of the two-part descriptions but disallowing visual access to the second-level elements; and (f) as a result of a search of the two-part descriptions by a non-license-accepting originator, sending the first-level element of the two-part descriptions.
|
1. A method for using a computer to facilitate and control access to a two-level information database created by inputs supplied by posting users, comprising the steps of: (a) receiving and storing in the database, a plurality of two-part descriptions each supplied by a user, each two-part description including a first-level element in the form of a basic description of each user's unmet need or unsolved problem, and a second-level element in the form of a detailed description of each user's unmet need or unsolved problem; (b) by a computer, permitting originators to access and select without restriction only the first-level elements of the stored two-part descriptions; (c) providing selecting originators with an option to access the second-level elements of the stored two-part descriptions that correspond to the selected first-level elements by agreeing to a license agreement specifying the terms of use for at least the second-level element; (d) providing license accepting originators with access to the second-level elements of the stored two-part description corresponding to the selected first-level elements; (e) permitting non-license-accepting originators to search the contents of the first-level and second-level elements of the two-part descriptions but disallowing visual access to the second-level elements; and (f) as a result of a search of the two-part descriptions by a non-license-accepting originator, sending the first-level element of the two-part descriptions. 20. The method of claim 1 including the further step of, prior to the receipt of a user's two-part description, receiving the posting user's acceptance of a submission agreement specifying the terms for submitting the user's unmet need or unsolved problem.
| 0.709751 |
8,738,608 | 41 | 63 |
41. A method of data storage and/or retrieval implemented on one or more digital data processing systems, comprising: providing storage media comprising a plurality of data tunnels, one or more of said plurality of data tunnels having a plurality of data cells, wherein the plurality of data tunnels include a plurality of entity type data tunnels for each of a plurality of entity types and a plurality of attribute data tunnels for each of a plurality of attributes wherein a number of data tunnels for each attribute is fixed for a given attribute, wherein each of the data cells contain data associated with a respective instance of an attribute for a respective and distinct instance of an entity type, wherein each of the data cells of the plurality of attribute data tunnels has data for which a respective operator evaluates to a boolean result indicating either the likely possibility or the impossibility of the attribute instance corresponding to said data cell being characterised by said operator for a given set of one or more operands, and accessing, with a storage engine that is in communications coupling with the storage media, one or more of the plurality of data tunnels based on one or more of said operators and a given set of one or more operands.
|
41. A method of data storage and/or retrieval implemented on one or more digital data processing systems, comprising: providing storage media comprising a plurality of data tunnels, one or more of said plurality of data tunnels having a plurality of data cells, wherein the plurality of data tunnels include a plurality of entity type data tunnels for each of a plurality of entity types and a plurality of attribute data tunnels for each of a plurality of attributes wherein a number of data tunnels for each attribute is fixed for a given attribute, wherein each of the data cells contain data associated with a respective instance of an attribute for a respective and distinct instance of an entity type, wherein each of the data cells of the plurality of attribute data tunnels has data for which a respective operator evaluates to a boolean result indicating either the likely possibility or the impossibility of the attribute instance corresponding to said data cell being characterised by said operator for a given set of one or more operands, and accessing, with a storage engine that is in communications coupling with the storage media, one or more of the plurality of data tunnels based on one or more of said operators and a given set of one or more operands. 63. The method of claim 41 , wherein the plurality of data tunnels and respective operators relate to —instances of entities of arbitrary structure.
| 0.969205 |
8,819,078 | 1 | 2 |
1. A method of event processing for graph structured data, comprising: storing graph-structured data in a store, the graph-structured data including a plurality of vertex, edge, and/or property graph elements; defining a first graph view of a characteristic of vertex, edge, and/or property graph elements; determining a subgraph as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view; and processing the vertex, edge, and/or property graph elements of the subgraph responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph.
|
1. A method of event processing for graph structured data, comprising: storing graph-structured data in a store, the graph-structured data including a plurality of vertex, edge, and/or property graph elements; defining a first graph view of a characteristic of vertex, edge, and/or property graph elements; determining a subgraph as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view; and processing the vertex, edge, and/or property graph elements of the subgraph responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph. 2. The method of claim 1 , wherein processing the vertex, edge, and/or property graph elements of the subgraph does not include processing those vertex, edge, and/or property graph elements not included in the subgraph responsive to the predefined event.
| 0.831117 |
8,310,179 | 18 | 19 |
18. The method of claim 13 further comprising: extracting an indicator of an authority from the multisensory input; identifying an authority associated with the multisensory input from the indicator of the authority; determining indicators of an emotional state, a competency and a state-of-mind in the multisensory input; the subjective-analyzer operably coupled to the filter; and determining whether or not the indicator of the authority, the indicator of the emotional state, the indicator of the competency and the indicator of the state-of-mind have a sufficient level of authority emotional state, competency and state-of-mind that is required by the patient-lifting-device command.
|
18. The method of claim 13 further comprising: extracting an indicator of an authority from the multisensory input; identifying an authority associated with the multisensory input from the indicator of the authority; determining indicators of an emotional state, a competency and a state-of-mind in the multisensory input; the subjective-analyzer operably coupled to the filter; and determining whether or not the indicator of the authority, the indicator of the emotional state, the indicator of the competency and the indicator of the state-of-mind have a sufficient level of authority emotional state, competency and state-of-mind that is required by the patient-lifting-device command. 19. The method of claim 18 further comprising: generating at least one instruction from the patient-lifting-device command from the command, responsive to a sufficient level of emotional state, a sufficient competency and a sufficient state-of-mind of the patient-lifting-device command.
| 0.5 |
8,584,099 | 1 | 4 |
1. A method for producing a representation of a true runtime object graph from a static computer program module, comprising: creating an abstract graph from the static computer program module and from containment information corresponding to the static computer program module, wherein the abstract graph has nodes including types, domains and objects wherein the abstract graph relates an object to a type, wherein the abstract graph relates a domain to a type containing the domain, wherein the abstract graph relates an object to a domain containing the object, and wherein creating an abstract graph includes creating at least one object that is located in a domain that is declared as a formal parameter of a type; creating a runtime graph from the abstract graph, wherein the runtime graph is an approximation of the true runtime object graph, wherein the runtime graph instantiates the objects from the abstract graph and represents containment information such that each runtime object contains runtime domains and each runtime domain contains runtime objects, and wherein creating the runtime graph includes copying the object declared inside the formal domain in the abstract graph into at least one domain in the runtime graph to which the formal domain of the object is transitively bound.
|
1. A method for producing a representation of a true runtime object graph from a static computer program module, comprising: creating an abstract graph from the static computer program module and from containment information corresponding to the static computer program module, wherein the abstract graph has nodes including types, domains and objects wherein the abstract graph relates an object to a type, wherein the abstract graph relates a domain to a type containing the domain, wherein the abstract graph relates an object to a domain containing the object, and wherein creating an abstract graph includes creating at least one object that is located in a domain that is declared as a formal parameter of a type; creating a runtime graph from the abstract graph, wherein the runtime graph is an approximation of the true runtime object graph, wherein the runtime graph instantiates the objects from the abstract graph and represents containment information such that each runtime object contains runtime domains and each runtime domain contains runtime objects, and wherein creating the runtime graph includes copying the object declared inside the formal domain in the abstract graph into at least one domain in the runtime graph to which the formal domain of the object is transitively bound. 4. The method of claim 1 , further comprising producing at least one containment relationship in the runtime graph between a runtime object A and a runtime object B when a type in the abstract graph corresponding to runtime object A contains an object in the abstract graph corresponding to runtime object B.
| 0.713222 |
9,178,951 | 1 | 4 |
1. A network device, comprising: a memory that stores instructions and data; and a processor that executes the stored instructions to perform actions, including: providing a plurality of content, at least a portion of the plurality of content associated with a first community and a remainder of the plurality of content associated with a second community, said first community and said second community being different online communities; receiving a usage pattern for each of a plurality of client devices for at least one of the plurality of content, at least a portion of the client devices associated with a user that is a member of the first community and a remainder of the client devices associated with a user that is a member of the second community; performing an analysis of the usage patterns for the client devices associated with the first community and the client devices associated with the second community, wherein a first link is determined for the content associated with the first community, a second link is determined for the content associated with the second community, and a third link is determined for content based on a combined analysis of usage patterns from client devices associated with the first community and client devices associated with the second community; employing the usage patterns to infer topics of interest to the plurality of client devices; and selectively providing the first link, the second link, the third link, a link to the first community, a link to the second community, and the inferred topics in a rank ordering for display by at least one client device.
|
1. A network device, comprising: a memory that stores instructions and data; and a processor that executes the stored instructions to perform actions, including: providing a plurality of content, at least a portion of the plurality of content associated with a first community and a remainder of the plurality of content associated with a second community, said first community and said second community being different online communities; receiving a usage pattern for each of a plurality of client devices for at least one of the plurality of content, at least a portion of the client devices associated with a user that is a member of the first community and a remainder of the client devices associated with a user that is a member of the second community; performing an analysis of the usage patterns for the client devices associated with the first community and the client devices associated with the second community, wherein a first link is determined for the content associated with the first community, a second link is determined for the content associated with the second community, and a third link is determined for content based on a combined analysis of usage patterns from client devices associated with the first community and client devices associated with the second community; employing the usage patterns to infer topics of interest to the plurality of client devices; and selectively providing the first link, the second link, the third link, a link to the first community, a link to the second community, and the inferred topics in a rank ordering for display by at least one client device. 4. The network device of claim 1 , wherein selectively providing for display further comprises providing the links sorted based on a geographic location of the client devices that interacted with the links.
| 0.73107 |
7,627,588 | 10 | 11 |
10. The computer-readable storage medium of claim 1 , wherein the set of objects is a first set of objects, and the performing multi-dimensional analysis includes one or more of: determining a number of objects within the first subset of objects; determining a frequency of occurrence of the concept within the first set of objects; determining a frequency of occurrence of the concept within the first subset of objects; determining a frequency of occurrence of the concept within a second set of objects different from the first set of objects; determining a normalized frequency of occurrence of the concept within the first set of objects; determining a normalized frequency of occurrence of the concept within the first subset of objects; determining a normalized frequency of occurrence of the concept within the second set of objects; determining an electronic path to the location of the first subset of objects; determining a characteristic of the first subset of objects; determining a concept type for the concept; determining a definition for the first concept; and if the first subset of objects contains the concept, determining a position of the concept within the first subset.
|
10. The computer-readable storage medium of claim 1 , wherein the set of objects is a first set of objects, and the performing multi-dimensional analysis includes one or more of: determining a number of objects within the first subset of objects; determining a frequency of occurrence of the concept within the first set of objects; determining a frequency of occurrence of the concept within the first subset of objects; determining a frequency of occurrence of the concept within a second set of objects different from the first set of objects; determining a normalized frequency of occurrence of the concept within the first set of objects; determining a normalized frequency of occurrence of the concept within the first subset of objects; determining a normalized frequency of occurrence of the concept within the second set of objects; determining an electronic path to the location of the first subset of objects; determining a characteristic of the first subset of objects; determining a concept type for the concept; determining a definition for the first concept; and if the first subset of objects contains the concept, determining a position of the concept within the first subset. 11. The computer-readable storage medium of claim 10 , wherein the characteristic is one of: a file extension a creation date; and an effective date and a status.
| 0.562162 |
7,849,459 | 9 | 10 |
9. A computer program product for deploying an application in a resource constrained environment, the application comprising a computer program written in the Java® computer programming language, the computer program product disposed on a computer-readable recording medium, the computer program product comprising computer program instructions capable of: identifying a resource constraint of a target system including identifying a target system having limited processing capacity; filtering the application in dependence upon the identified resource constraint including: preprocessing a tag library of the application, including identifying a tag library descriptor of the application and copying a listener from the tag library descriptor to a deployment descriptor for the application; identifying a hierarchy of classes of the application stored in a single file; storing each class of the hierarchy as a separate file accessible to the application; and identifying to a runtime platform the copying of the listener from the tag library descriptor to the deployment descriptor, including setting a flag in the application.
|
9. A computer program product for deploying an application in a resource constrained environment, the application comprising a computer program written in the Java® computer programming language, the computer program product disposed on a computer-readable recording medium, the computer program product comprising computer program instructions capable of: identifying a resource constraint of a target system including identifying a target system having limited processing capacity; filtering the application in dependence upon the identified resource constraint including: preprocessing a tag library of the application, including identifying a tag library descriptor of the application and copying a listener from the tag library descriptor to a deployment descriptor for the application; identifying a hierarchy of classes of the application stored in a single file; storing each class of the hierarchy as a separate file accessible to the application; and identifying to a runtime platform the copying of the listener from the tag library descriptor to the deployment descriptor, including setting a flag in the application. 10. The computer program product of claim 9 wherein: identifying a resource constraint of a target system further comprises identifying that the target system has no Extensible Markup Language (XML) parser; and filtering the application in dependence upon the identified resource constraint, including replacing a static XML deployment descriptor for the application with a deployment descriptor readable without an XML parser.
| 0.5 |
8,442,834 | 10 | 11 |
10. The system of claim 9 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising: generating a website specific language model using the linguistic item and the weighted anchor text.
|
10. The system of claim 9 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising: generating a website specific language model using the linguistic item and the weighted anchor text. 11. The system of claim 10 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising: integrating the website specific language model into the live spoken dialog interface.
| 0.5 |
7,899,657 | 51 | 55 |
51. The system of claim 32 , wherein the program instructions are further executable to: receive a second objective function, wherein the second objective function represents a specified objective of reservoir operations; and use the optimizer and the parameterized model to determine operation of the reservoir that satisfies the second objective function.
|
51. The system of claim 32 , wherein the program instructions are further executable to: receive a second objective function, wherein the second objective function represents a specified objective of reservoir operations; and use the optimizer and the parameterized model to determine operation of the reservoir that satisfies the second objective function. 55. The system of claim 51 , wherein, in using the optimizer and the parameterized model to determine operation of the reservoir that satisfies the second objective function subject to one or more operational constraints, the program instructions are further executable to: determine operation of the reservoir for secondary and/or tertiary recovery.
| 0.645749 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.