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
9,586,091
16
17
16. The method of claim 3 , wherein said trainer comprises a virtual trainer.
16. The method of claim 3 , wherein said trainer comprises a virtual trainer. 17. The method of claim 16 , said virtual trainer configured to provide at least one of: a training tip; a pep talk; and a personalized training routine.
0.5
7,613,666
18
20
18. The article of manufacture of claim 11 wherein the data causing the machine to perform the operation (c) comprise data that, when accessed by the machine, cause the machine to perform operations comprising: for each placeholder of each sentential form in the vocabulary, creating an attribute for the placeholder within the class created for the corresponding sentential form.
18. The article of manufacture of claim 11 wherein the data causing the machine to perform the operation (c) comprise data that, when accessed by the machine, cause the machine to perform operations comprising: for each placeholder of each sentential form in the vocabulary, creating an attribute for the placeholder within the class created for the corresponding sentential form. 20. The article of manufacture of claim 18 wherein the data causing the machine to perform the operation of creating an attribute for the placeholder further comprise data that, when accessed by the machine, cause the machine to perform operations comprising: setting the type of the attribute to be a general type representing a thing, the thing being the subject of facts expressed by the vocabulary.
0.5
9,020,804
1
19
1. An alignment method comprising: with a computing device, for a source sentence in a source language, prior to word level alignment of the source sentence with a target sentence in a target language, identifying whether the sentence includes at least one candidate term comprising a contiguous subsequence of words of the source sentence; aligning the target sentence in the target language with the source sentence, comprising: developing a probabilistic model which models conditional probability distributions for alignments between words of the source sentence and words of the target sentence; and generating an optimal alignment based on the probabilistic model, including, where the source sentence includes the at least one candidate term, enforcing a contiguity constraint which requires that all the words of the target sentence which are aligned with an identified candidate term form a contiguous subsequence of the target sentence.
1. An alignment method comprising: with a computing device, for a source sentence in a source language, prior to word level alignment of the source sentence with a target sentence in a target language, identifying whether the sentence includes at least one candidate term comprising a contiguous subsequence of words of the source sentence; aligning the target sentence in the target language with the source sentence, comprising: developing a probabilistic model which models conditional probability distributions for alignments between words of the source sentence and words of the target sentence; and generating an optimal alignment based on the probabilistic model, including, where the source sentence includes the at least one candidate term, enforcing a contiguity constraint which requires that all the words of the target sentence which are aligned with an identified candidate term form a contiguous subsequence of the target sentence. 19. The method of claim 1 , wherein the method operates without identification of terms in the target sentence.
0.787356
6,151,608
1
27
1. An automated computer-implemented method for migrating source data from at least one source to at least one destination table of a database having a schema without a user having to write computer code, the method comprising the steps of: defining patterns which describe format and content of the source data; applying the patterns to the source data to create transformed data; associating migration rules based on the schema with the patterns to generate a set of instructions that define migration paths; and loading the transformed data in a sequence into the at least one destination table based on the set of instructions, the at least one destination table having a defined format and destination fields, wherein the step of loading is automatically sequenced based on the migration rules so that referential integrity is maintained.
1. An automated computer-implemented method for migrating source data from at least one source to at least one destination table of a database having a schema without a user having to write computer code, the method comprising the steps of: defining patterns which describe format and content of the source data; applying the patterns to the source data to create transformed data; associating migration rules based on the schema with the patterns to generate a set of instructions that define migration paths; and loading the transformed data in a sequence into the at least one destination table based on the set of instructions, the at least one destination table having a defined format and destination fields, wherein the step of loading is automatically sequenced based on the migration rules so that referential integrity is maintained. 27. The method as claimed in claim 1 wherein the transformed data loaded into the at least one destination table updates or adds to records already in the at least one destination table.
0.626506
8,998,959
19
20
19. A medical implant comprising: a) a receiver having a base with an inner cavity and a pair of upstanding opposed arms partially defining a longitudinal connecting member receiving channel, the inner cavity defined in part by a cylindrical lower seating portion and an upper expansion chamber, the upper expansion chamber comprising an aperture defined by a first inner surface, the lower seating portion communicating with a bottom opening of the receiver base and the upper expansion chamber communicating with the rod receiving channel; b) a bone screw shank having an upper portion sized for up-loading through the receiver bottom opening; c) an open, resilient retaining member having a base and an upper structure, the base sized and shaped for expanding about the shank upper portion when the retaining member base is located in the receiver upper expansion chamber, the retainer upper structure having a top surface that is located on the top of the retainer and being disposed in the aperture in the chamber of the receiver and the retaining member base engaging the cylindrical receiver lower seating portion when the shank is in a locked position with respect to the receiver; and d) an insert located partially in the chamber, the insert having a surface frictionally engaging the shank upper portion when the retainer base is in the expanded state.
19. A medical implant comprising: a) a receiver having a base with an inner cavity and a pair of upstanding opposed arms partially defining a longitudinal connecting member receiving channel, the inner cavity defined in part by a cylindrical lower seating portion and an upper expansion chamber, the upper expansion chamber comprising an aperture defined by a first inner surface, the lower seating portion communicating with a bottom opening of the receiver base and the upper expansion chamber communicating with the rod receiving channel; b) a bone screw shank having an upper portion sized for up-loading through the receiver bottom opening; c) an open, resilient retaining member having a base and an upper structure, the base sized and shaped for expanding about the shank upper portion when the retaining member base is located in the receiver upper expansion chamber, the retainer upper structure having a top surface that is located on the top of the retainer and being disposed in the aperture in the chamber of the receiver and the retaining member base engaging the cylindrical receiver lower seating portion when the shank is in a locked position with respect to the receiver; and d) an insert located partially in the chamber, the insert having a surface frictionally engaging the shank upper portion when the retainer base is in the expanded state. 20. The implant of claim 19 wherein the insert has a lock and release feature in engagement with the receiver.
0.5
8,019,710
1
25
1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both.
1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both. 25. The system of claim 1 further comprising that a specification, suggestion, workspace, display, or output, or a combination thereof, comprises at least one of text, drawing, video, audio, graphics, interactive graphics, or a combination thereof.
0.865071
6,021,202
5
7
5. The computer-based system of claim 4, wherein compliance with at least one of a legal requirement and a business practice comprises: a content block for a type of significant communication; and a protocol for manipulation of the content of such block.
5. The computer-based system of claim 4, wherein compliance with at least one of a legal requirement and a business practice comprises: a content block for a type of significant communication; and a protocol for manipulation of the content of such block. 7. The computer-based system of claim 5, wherein the significant communication is a statement to pay funds to the order of a party.
0.5
8,825,692
21
28
21. The server of claim 20 , wherein the custom translation library is provided to the user.
21. The server of claim 20 , wherein the custom translation library is provided to the user. 28. The server of claim 21 , wherein the base translation library is newly generated by the customized translations received from one or more users when there is no previously existing base translation library.
0.612546
7,478,192
71
72
71. An associative memory computer program product, the computer program product comprising a computer usable medium having computer-readable program code embodied in the medium, the computer-readable program code comprising: computer-readable program code that is configured to provide a network of at least two networks of associative memory networks, the at least two networks of associative memory networks comprising: a first network of first associative memory networks, wherein the first associative memory networks comprise associative memory networks of first associations; and a second network of second associative memory networks, wherein the second associative memory networks comprise associative memory networks of second associations different from the first associations; and computer-readable program code that is configured to display information corresponding to the first and/or second associations on a result display.
71. An associative memory computer program product, the computer program product comprising a computer usable medium having computer-readable program code embodied in the medium, the computer-readable program code comprising: computer-readable program code that is configured to provide a network of at least two networks of associative memory networks, the at least two networks of associative memory networks comprising: a first network of first associative memory networks, wherein the first associative memory networks comprise associative memory networks of first associations; and a second network of second associative memory networks, wherein the second associative memory networks comprise associative memory networks of second associations different from the first associations; and computer-readable program code that is configured to display information corresponding to the first and/or second associations on a result display. 72. An associative memory computer program product according to claim 71 further comprising: computer-readable program code that is configured to observe associations into, and imagine associations from, the network of at least two networks of associative memory networks.
0.5
9,111,173
9
15
9. A computer system for learning part-based object models from a set of digital representations of images, the system comprising: a non-transitory computer-readable storage medium storing executable computer program instructions; and a computer processor executing the computer program instructions to perform steps comprising: receiving a set of digital representations of images, each image having at least one object; and for each image: extracting one or more shape features from the image; extracting one or more appearance features from the image; generating one or more shape models of the object based on the shape features, a shape model corresponding to a part of the object, generating a shape model comprising: generating one or more histogram of oriented gradient (HOG) cells for a number of pixel of the image; and grouping two or more HOG cells into a HOG bundle based on similarity of orientations of the HOG cells with respect to the maximum magnitude of orientations of the HOG cells; computing an appearance model for each shape model of the object based on the appearance features; and selecting one or more shape models as reference shape models of the object; selecting one or more appearance models as reference appearance models of the object; and storing the reference shape models of the images; and storing the reference appearance models of the images.
9. A computer system for learning part-based object models from a set of digital representations of images, the system comprising: a non-transitory computer-readable storage medium storing executable computer program instructions; and a computer processor executing the computer program instructions to perform steps comprising: receiving a set of digital representations of images, each image having at least one object; and for each image: extracting one or more shape features from the image; extracting one or more appearance features from the image; generating one or more shape models of the object based on the shape features, a shape model corresponding to a part of the object, generating a shape model comprising: generating one or more histogram of oriented gradient (HOG) cells for a number of pixel of the image; and grouping two or more HOG cells into a HOG bundle based on similarity of orientations of the HOG cells with respect to the maximum magnitude of orientations of the HOG cells; computing an appearance model for each shape model of the object based on the appearance features; and selecting one or more shape models as reference shape models of the object; selecting one or more appearance models as reference appearance models of the object; and storing the reference shape models of the images; and storing the reference appearance models of the images. 15. The system of claim 9 , wherein generating a shape model further comprises: grouping two or more HOG cells into a HOG bundle based on distance between the HOG cells measured by a chi square distance function and similarity of orientations of the HOG cells with respect to the maximum magnitude of orientations of the HOG cells.
0.723706
8,140,534
1
2
1. A system comprising: an email agent within an integrated information management application; an email repository coupled to the email agent, the email repository to store a plurality of email files and a plurality of existing email attachments, wherein the existing email attachments have prior associations with at least some of the email files; and an attachment engine coupled to the email agent, the attachment engine to generate a list of existing attachments from at least two workspaces of a plurality of workspaces within the integrated information management application, wherein the plurality of workspaces comprises an email workspace, a calendar workspace, and a task workspace, wherein the existing attachments comprise the existing email attachments within the email repository for visual communication on a display device.
1. A system comprising: an email agent within an integrated information management application; an email repository coupled to the email agent, the email repository to store a plurality of email files and a plurality of existing email attachments, wherein the existing email attachments have prior associations with at least some of the email files; and an attachment engine coupled to the email agent, the attachment engine to generate a list of existing attachments from at least two workspaces of a plurality of workspaces within the integrated information management application, wherein the plurality of workspaces comprises an email workspace, a calendar workspace, and a task workspace, wherein the existing attachments comprise the existing email attachments within the email repository for visual communication on a display device. 2. The system of claim 1 , wherein the attachment engine is further configured to sort the email attachments within the list according to a sorting qualifier, wherein the sorting qualifier comprises a document name qualifier, a date qualifier, a size qualifier, a type qualifier, an author qualifier, a recipient qualifier, or a category qualifier.
0.85
7,657,546
1
11
1. A method of automatically discovering ontology file categories, said method comprising the steps of: a) searching for available semantic data files; b) storing links and content to identified semantic data files; c) generating an ontology file from stored said content for each linked said semantic data file; d) identifying a domain for each said ontology file, said domain being identified from generated ontology files; e) extracting a plurality of ontology file categories from domains identified for said generated ontology files, said ontology file categories being statistically identified automatically from said domains, extracting comprising: determining and normalizing contextual significance for all domains, each normalized contextual significance providing a significance value for a respective domain, and combining discovered domains and features for generated ontology files responsive to domain significance values; f) providing a training set from generated ontology files, said training set including an instance set, a domain set and a feature set; and g) classifying ontology file instances responsive to said training sets, results of classification indicating automatic category discovery effectiveness.
1. A method of automatically discovering ontology file categories, said method comprising the steps of: a) searching for available semantic data files; b) storing links and content to identified semantic data files; c) generating an ontology file from stored said content for each linked said semantic data file; d) identifying a domain for each said ontology file, said domain being identified from generated ontology files; e) extracting a plurality of ontology file categories from domains identified for said generated ontology files, said ontology file categories being statistically identified automatically from said domains, extracting comprising: determining and normalizing contextual significance for all domains, each normalized contextual significance providing a significance value for a respective domain, and combining discovered domains and features for generated ontology files responsive to domain significance values; f) providing a training set from generated ontology files, said training set including an instance set, a domain set and a feature set; and g) classifying ontology file instances responsive to said training sets, results of classification indicating automatic category discovery effectiveness. 11. A method as in claim 1 , the step (g) classifying ontology file instances comprising the steps of: i) providing classification parameters from said training sets to a classification unit; and ii) classifying ontology instances responsive to said classification parameters, said classification unit receiving updated classification parameters with each change in ontology files and reclassifying said ontology instances with said each change.
0.5
8,219,386
3
5
3. The poetry meter identification system according to claim 2 , wherein the spoken language of the poetry is Arabic.
3. The poetry meter identification system according to claim 2 , wherein the spoken language of the poetry is Arabic. 5. The poetry meter identification system according to claim 3 , wherein the software further comprises means for computing feature vector sequences identifying syllabic and sub-syllabic patterns having unvoweled Arabic consonants, Arabic consonants followed by short vowels, Arabic consonants followed by long vowels, and consonant-short vowel-consonant clusters.
0.5
8,239,366
78
79
78. The system of claim 67 , wherein the at least one hardware processor generates the first of the at least two search queries by performing speech recognition on the voice input using a language model different from the first language model.
78. The system of claim 67 , wherein the at least one hardware processor generates the first of the at least two search queries by performing speech recognition on the voice input using a language model different from the first language model. 79. The system of claim 78 , wherein the language model different from the first language model is a general language model.
0.5
9,230,017
12
13
12. The system of claim 11 , wherein the information engine selects information from data sources based on the utterance preferences and the options.
12. The system of claim 11 , wherein the information engine selects information from data sources based on the utterance preferences and the options. 13. The system of claim 12 , wherein the information history comprises data that indicate when prior utterances referenced each entity.
0.5
9,671,936
1
7
1. A non-transitory, computer-readable media having stored thereon instructions which, when executed by a smart device, cause the smart device to perform steps comprising: causing a content access interface to be displayed in a touch sensitive display of the smart device, the content access interface having a plurality of media interface elements wherein each of the plurality of media interface elements is representative of a media content that is accessible via use of a first controllable appliance and each of the plurality of media interface elements is selectable by a user to cause the smart device to transmit a command to cause the first controllable appliance to access the media content corresponding to the selected one of the plurality of media interface elements; and in response to the user interacting with an interactivity element displayed in the touch sensitive display, causing a first plurality of control interface elements to be temporarily added to the content access interface together with one or more of the plurality of media interface elements, wherein each of the first plurality of control interface elements is representative of volume operational function of a second controllable appliance and each of the first plurality of control interface elements is selectable by the user to cause the smart device to transmit a command to cause the second controllable appliance to perform a volume control function corresponding to the selected one of the first plurality of control interface elements.
1. A non-transitory, computer-readable media having stored thereon instructions which, when executed by a smart device, cause the smart device to perform steps comprising: causing a content access interface to be displayed in a touch sensitive display of the smart device, the content access interface having a plurality of media interface elements wherein each of the plurality of media interface elements is representative of a media content that is accessible via use of a first controllable appliance and each of the plurality of media interface elements is selectable by a user to cause the smart device to transmit a command to cause the first controllable appliance to access the media content corresponding to the selected one of the plurality of media interface elements; and in response to the user interacting with an interactivity element displayed in the touch sensitive display, causing a first plurality of control interface elements to be temporarily added to the content access interface together with one or more of the plurality of media interface elements, wherein each of the first plurality of control interface elements is representative of volume operational function of a second controllable appliance and each of the first plurality of control interface elements is selectable by the user to cause the smart device to transmit a command to cause the second controllable appliance to perform a volume control function corresponding to the selected one of the first plurality of control interface elements. 7. The non-transitory, computer readable media as recited in claim 1 , wherein the first plurality of control interface elements are caused to be displayed in a discrete interface relative to the one or more of the plurality of media interface elements.
0.861597
8,005,681
1
4
1. A speech dialog control module, comprising: an input device that receives an input signal in a first language; a controller that receives the input signal and generates a control instruction that correlates to the input signal and that has a language that is different from the input signal; a speech-synthesis unit that converts the control instruction into an output speech signal; and an output device that outputs the output speech signal, the output device comprising a mechanical actuating unit that is configured to actuate a push button of a speech dialog system.
1. A speech dialog control module, comprising: an input device that receives an input signal in a first language; a controller that receives the input signal and generates a control instruction that correlates to the input signal and that has a language that is different from the input signal; a speech-synthesis unit that converts the control instruction into an output speech signal; and an output device that outputs the output speech signal, the output device comprising a mechanical actuating unit that is configured to actuate a push button of a speech dialog system. 4. The speech dialog control module of claim 1 , where the speech synthesis unit comprises a text-to-speech unit.
0.686111
9,286,668
19
20
19. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform operations comprising: receiving, by the processing device, digital data representing a page of a publication; identifying, by the processing device, a plurality of potential panels in the page of the publication; determining, by the processing device, a first confidence level a first potential panel of the plurality of potential panels; adding, by the processing device, the first potential panel to a panel view for the publication, wherein the panel view is a digital representation of the publication that allows panel by panel navigation of a set of actual panels, and wherein the first potential panel is automatically added to the set of actual panels in the panel view in view of the first confidence level; determining a second confidence level for a second potential panel of the plurality of potential panels; receiving user input to manually identify the second potential panel as one of the set of actual panels; adding the second potential panel to the panel view for the publication; storing the user input pertaining to at least one of size, shape, location, position or layout of a previously-identified panel to identify additional comic panels as actual comic panels of the publication; determining a third confidence level for a third potential panel using the stored user input; adding the third potential panel to the panel view for the publication, and wherein the third potential panel is automatically added to the set of actual panels in the panel view in view of the third confidence level; receiving, by the processing device, a request for the panel view of the publication; sending, by the processing device, first data enabling a graphical user interface (GUI) to display at least some panel previews of the set of actual panels in a display region, wherein the panel previews are reduced version of the set of actual panels; and sending, by the processing device, second data enabling the GUI to display an enlarged version of a selected one of the panel previews in the same display region.
19. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform operations comprising: receiving, by the processing device, digital data representing a page of a publication; identifying, by the processing device, a plurality of potential panels in the page of the publication; determining, by the processing device, a first confidence level a first potential panel of the plurality of potential panels; adding, by the processing device, the first potential panel to a panel view for the publication, wherein the panel view is a digital representation of the publication that allows panel by panel navigation of a set of actual panels, and wherein the first potential panel is automatically added to the set of actual panels in the panel view in view of the first confidence level; determining a second confidence level for a second potential panel of the plurality of potential panels; receiving user input to manually identify the second potential panel as one of the set of actual panels; adding the second potential panel to the panel view for the publication; storing the user input pertaining to at least one of size, shape, location, position or layout of a previously-identified panel to identify additional comic panels as actual comic panels of the publication; determining a third confidence level for a third potential panel using the stored user input; adding the third potential panel to the panel view for the publication, and wherein the third potential panel is automatically added to the set of actual panels in the panel view in view of the third confidence level; receiving, by the processing device, a request for the panel view of the publication; sending, by the processing device, first data enabling a graphical user interface (GUI) to display at least some panel previews of the set of actual panels in a display region, wherein the panel previews are reduced version of the set of actual panels; and sending, by the processing device, second data enabling the GUI to display an enlarged version of a selected one of the panel previews in the same display region. 20. The non-transitory computer-readable storage medium of claim 19 , wherein the identifying the plurality of potential panels comprises: determining a background color of the page; identifying values in the digital data as part of a background region of the page using the background color; and identifying the plurality of potential panels using values in the digital data that are different from the values in the digital data that are part of the background region.
0.555766
7,522,046
1
20
1. A document management system, the system comprising: a physical-document monitoring device comprising: a document coupling device, a sensor coupled to the document coupling device, the sensor operable to sense a state of a document and to generate a signal representative thereof, and a computer coupled to the sensor and the document coupling device, the computer operable to determine a document state based on the signal.
1. A document management system, the system comprising: a physical-document monitoring device comprising: a document coupling device, a sensor coupled to the document coupling device, the sensor operable to sense a state of a document and to generate a signal representative thereof, and a computer coupled to the sensor and the document coupling device, the computer operable to determine a document state based on the signal. 20. The system of claim 1 , wherein the physical document comprises a paper-based document.
0.770202
8,214,390
13
16
13. A non-transitory computer-readable medium that stores instructions which, when executed by one or more processors, cause: detecting first activity, of a user associated with a particular entity, said first activity related to a first topic of a set of topics; in response to detecting the first activity, modifying a first subset of bits, of a first set of bits associated with the particular entity, to reflect the first activity related to the first topic; detecting second activity of the user, said second activity related to a second topic of the set of topics; in response to detecting the second activity, modifying a second subset of bits, of the first set of bits, to reflect the second activity related to the second topic; wherein the first subset of bits is distinct from the second subset of bits; wherein the position of each bit of the first subset of bits indicates which topic of the set of topics that the first subset of bits reflects; wherein the position of each bit of the second subset of bits indicates which topic of the set of topics that the second subset of bits reflects; wherein a quantity of the first subset of bits is different than a quantity of the second subset of bits; determining a value for the first topic based, at least in part, on the first subset of bits: dividing the value for the first topic by a range of values that can be represented by the first subset of bits, to produce a normalized value for the first topic; selecting a particular content item from a plurality of available content items based at least in part on the first set of bits; and wherein selecting the particular content item from the plurality of available content items further comprises selecting the particular content item based, at least in part, on the normalized value for the first topic; and displaying the particular content item.
13. A non-transitory computer-readable medium that stores instructions which, when executed by one or more processors, cause: detecting first activity, of a user associated with a particular entity, said first activity related to a first topic of a set of topics; in response to detecting the first activity, modifying a first subset of bits, of a first set of bits associated with the particular entity, to reflect the first activity related to the first topic; detecting second activity of the user, said second activity related to a second topic of the set of topics; in response to detecting the second activity, modifying a second subset of bits, of the first set of bits, to reflect the second activity related to the second topic; wherein the first subset of bits is distinct from the second subset of bits; wherein the position of each bit of the first subset of bits indicates which topic of the set of topics that the first subset of bits reflects; wherein the position of each bit of the second subset of bits indicates which topic of the set of topics that the second subset of bits reflects; wherein a quantity of the first subset of bits is different than a quantity of the second subset of bits; determining a value for the first topic based, at least in part, on the first subset of bits: dividing the value for the first topic by a range of values that can be represented by the first subset of bits, to produce a normalized value for the first topic; selecting a particular content item from a plurality of available content items based at least in part on the first set of bits; and wherein selecting the particular content item from the plurality of available content items further comprises selecting the particular content item based, at least in part, on the normalized value for the first topic; and displaying the particular content item. 16. The non-transitory computer-readable medium of claim 13 , wherein: the first activity indicates interest of the user in the first topic; the first activity is one of: (a) viewing, by the user, a document related to the first topic, (b) submitting, by the user, a query related to the first topic, (c) receiving, by the user, a set of search results including a document related to the first topic, and (d) submitting, by the user, information evidencing interest in the first topic; and the particular entity is one of: (a) a user profile, (b) an Internet Protocol (IP) address, and (c) a Media Access Control (MAC) address.
0.580214
8,489,530
1
7
1. A method for root cause analysis of failure of a manufactured product, the method comprising the steps of: a. developing a knowledge model comprising a network of entities related to field of failure and manufacturing attributes of the manufactured product and interconnected in a cause-effect relationship, each entity comprising an instance of a parameter that is related to one of the field of failure and manufacturing attributes; b. converting the knowledge model into a Bayesian network, the Bayesian network comprising one or more nodes, each node representing an entity of the knowledge model along with a corresponding conditional probability of occurrence of the entity; c. selecting one or more parameters and corresponding instances from a set of failure reports d. mapping the one or more parameters and corresponding instances as a set of evidence to the Bayesian network; and e. determining a root cause of failure along with a corresponding conditional probability based on the set of evidence; wherein converting the knowledge model into the Bayesian network comprises associating each entity of the knowledge model with a plurality of states and each of the plurality of states with an objective value attribute; each objective values attribute being associated with one or more values based on historical data and expert constraints using constraint optimization technique.
1. A method for root cause analysis of failure of a manufactured product, the method comprising the steps of: a. developing a knowledge model comprising a network of entities related to field of failure and manufacturing attributes of the manufactured product and interconnected in a cause-effect relationship, each entity comprising an instance of a parameter that is related to one of the field of failure and manufacturing attributes; b. converting the knowledge model into a Bayesian network, the Bayesian network comprising one or more nodes, each node representing an entity of the knowledge model along with a corresponding conditional probability of occurrence of the entity; c. selecting one or more parameters and corresponding instances from a set of failure reports d. mapping the one or more parameters and corresponding instances as a set of evidence to the Bayesian network; and e. determining a root cause of failure along with a corresponding conditional probability based on the set of evidence; wherein converting the knowledge model into the Bayesian network comprises associating each entity of the knowledge model with a plurality of states and each of the plurality of states with an objective value attribute; each objective values attribute being associated with one or more values based on historical data and expert constraints using constraint optimization technique. 7. The method according to claim 1 , wherein the Bayesian network is updated based on a predefined criterion.
0.813356
8,856,007
10
11
10. The computing device of claim 9 , wherein the salient portion utilizes at least the second voice and a third voice, and wherein the second voice differs from the third voice.
10. The computing device of claim 9 , wherein the salient portion utilizes at least the second voice and a third voice, and wherein the second voice differs from the third voice. 11. The computing device of claim 10 , wherein the textual response comprises a primary output and secondary output, wherein the salient portion utilizes the second voice for the primary output, and wherein the salient portion utilizes the third voice for the secondary output.
0.5
7,809,665
1
5
1. A computer implemented method of transitioning from a case-based classifier system to a rule-based classifier system, comprising: determining whether a predetermined condition is satisfied with respect to a case-based dataset stored within memory accessible by at least one processor, the case-based dataset characterized by record data identifying a plurality of records, distance data identifying a distance between pairs of each of the plurality of records, and case-wise classification data identifying class boundaries between the plurality of records based on the distance data, wherein the determining whether the predetermined condition is satisfied comprises determining whether the case-based dataset occupies an amount of memory in excess of a predetermined memory threshold; generating, for each of a plurality of rule-based classifiers, rule-based classification data identifying class boundaries between the plurality of records upon determining that the predetermined condition has been satisfied; wherein the plurality of rule-based classifiers comprise at least one of a Naïve Bayes classifier, an AdaBoost classifier, and a Rocchio classifier; computing a structural risk of the rule-based classification data for each of the plurality of rule-based classifiers with respect to the plurality of records identified within the record data; selecting rule-based classifiers having generated rule-based classification data identifying class boundaries between the plurality of records with a structural risk below a predetermined threshold; identifying selected rule-based classifiers having rule-based classification data that is within a predetermined degree of similarity with the case-wise classification data; and replacing the case-based dataset stored within the memory with rule-based classification data of at least one of the identified rule-based classifiers.
1. A computer implemented method of transitioning from a case-based classifier system to a rule-based classifier system, comprising: determining whether a predetermined condition is satisfied with respect to a case-based dataset stored within memory accessible by at least one processor, the case-based dataset characterized by record data identifying a plurality of records, distance data identifying a distance between pairs of each of the plurality of records, and case-wise classification data identifying class boundaries between the plurality of records based on the distance data, wherein the determining whether the predetermined condition is satisfied comprises determining whether the case-based dataset occupies an amount of memory in excess of a predetermined memory threshold; generating, for each of a plurality of rule-based classifiers, rule-based classification data identifying class boundaries between the plurality of records upon determining that the predetermined condition has been satisfied; wherein the plurality of rule-based classifiers comprise at least one of a Naïve Bayes classifier, an AdaBoost classifier, and a Rocchio classifier; computing a structural risk of the rule-based classification data for each of the plurality of rule-based classifiers with respect to the plurality of records identified within the record data; selecting rule-based classifiers having generated rule-based classification data identifying class boundaries between the plurality of records with a structural risk below a predetermined threshold; identifying selected rule-based classifiers having rule-based classification data that is within a predetermined degree of similarity with the case-wise classification data; and replacing the case-based dataset stored within the memory with rule-based classification data of at least one of the identified rule-based classifiers. 5. The computer implemented method of claim 1 , wherein generating rule-based classification data comprises calculating class boundaries for each of the plurality of rule-based classifiers with respect to the record data.
0.590741
9,367,642
11
12
11. The one or more non-transitory computer-readable storage media of claim 8 , wherein: said particular declaration of said plurality of XML schema declarations includes a mapping annotation mapping said respective collection element to a form of VARRAY storage; and the one or more factors are based on said mapping annotation.
11. The one or more non-transitory computer-readable storage media of claim 8 , wherein: said particular declaration of said plurality of XML schema declarations includes a mapping annotation mapping said respective collection element to a form of VARRAY storage; and the one or more factors are based on said mapping annotation. 12. The one or more non-transitory computer-readable storage media of claim 11 , wherein: said XML schema specifies a default form of VARRAY storage; and said one or more factors are based on said form of VARRAY storage.
0.5
9,081,626
3
7
3. The method of claim 1 wherein the converting the source code written in the pseudo assembly language further comprises: applying contextual recognition and reconstruction to the source code written in the pseudo assembly language to generate the source code written in the second assembly language, wherein the contextual recognition and reconstruction further comprises determining an objective of a segment of the source code written in the pseudo language; generating a segment of source code written in the second assembly language that achieves the objective of the segment of the source code written in the pseudo assembly language.
3. The method of claim 1 wherein the converting the source code written in the pseudo assembly language further comprises: applying contextual recognition and reconstruction to the source code written in the pseudo assembly language to generate the source code written in the second assembly language, wherein the contextual recognition and reconstruction further comprises determining an objective of a segment of the source code written in the pseudo language; generating a segment of source code written in the second assembly language that achieves the objective of the segment of the source code written in the pseudo assembly language. 7. The method of claim 3 , wherein the contextual recognition and reconstruction further comprises: identifying bit manipulation in the source code written in the pseudo assembly language, determining whether the bit manipulation is valid in the second assembly language, and altering the bit manipulation, when the bit manipulation is not valid in the second assembly language, and generating source code written in the second assembly language which includes the altered bit manipulation.
0.633782
8,554,604
1
5
1. A method of determining an economic impact of business policies, comprising: a) providing player definitions defining a plurality of players and an associated set of rules defining a decision space, a decision-making process tree, an information set, an outcome function, and a payoff function for each player; b) translating, in a computer system, the player definitions into at least one codified script; and c) executing, in the computer system, the at least one codified script, wherein a result of the outcome and payoff functions at the end of execution of a script stage determines the economic impact of the business policies defined by the rules.
1. A method of determining an economic impact of business policies, comprising: a) providing player definitions defining a plurality of players and an associated set of rules defining a decision space, a decision-making process tree, an information set, an outcome function, and a payoff function for each player; b) translating, in a computer system, the player definitions into at least one codified script; and c) executing, in the computer system, the at least one codified script, wherein a result of the outcome and payoff functions at the end of execution of a script stage determines the economic impact of the business policies defined by the rules. 5. The method of claim 1 further comprising: d) providing calibration data for the defined players based on empirical sales information, wherein the at least one script is generated in accordance with the player definitions and the calibration data.
0.526616
8,019,794
8
14
8. A computer system for managing device firmware, comprising: a firmware repository and wherein the firmware repository includes at least one Extensible Markup Language (XML) description file which contains the following information for a firmware contained in a firmware file distinct from the XML description file: a firmware version; a device model and family of devices supported by the firmware; a release date of the firmware; a description or release notes for said version; a location of the firmware; and a version matrix comprising a matrix of version designations of all the firmware for different components of said device and a set of interdependencies among the different components of said device; and a utility program installed on a computer to access the firmware repository, read the XML description file, and in dependence on the information in the XML description file, manage or download firmware files for a given device.
8. A computer system for managing device firmware, comprising: a firmware repository and wherein the firmware repository includes at least one Extensible Markup Language (XML) description file which contains the following information for a firmware contained in a firmware file distinct from the XML description file: a firmware version; a device model and family of devices supported by the firmware; a release date of the firmware; a description or release notes for said version; a location of the firmware; and a version matrix comprising a matrix of version designations of all the firmware for different components of said device and a set of interdependencies among the different components of said device; and a utility program installed on a computer to access the firmware repository, read the XML description file, and in dependence on the information in the XML description file, manage or download firmware files for a given device. 14. The computer system of claim 8 , wherein said firmware location is a remote computer readable medium distinct from said computer readable medium on which said description file is stored.
0.5
10,002,116
37
39
37. The system of claim 19 , wherein the citation editing code set is adapted to interface the document rendering application with the citation library, the citation editing code set comprising a set of graphical controls selectable via the document rendering application and adapted to execute user-selected citation commands.
37. The system of claim 19 , wherein the citation editing code set is adapted to interface the document rendering application with the citation library, the citation editing code set comprising a set of graphical controls selectable via the document rendering application and adapted to execute user-selected citation commands. 39. The system of claim 37 , wherein the set of graphical controls includes a tool for presenting for user-selection a set of citation formats.
0.665888
8,849,830
1
3
1. A method of delivering a search result comprising: assigning destination scores to a document with respect to a plurality of categories based on a plurality random walks of a linked corpus including the document with random teleportation hops biased toward a plurality of seed sets corresponding to the plurality of categories; assigning source scores to the document with respect to the plurality of categories, the source scores for the document indicating a contribution of the document to one or more destination scores of other nodes in the linked corpus; assigning combined scores to the document based on a combinations of the destination and source scores; associating a category of the plurality of categories with the document based at least in part on the combined scores; obtaining a search query; and delivering a plurality of search results to a user in a manner that includes an indication to the user of at least one category associated with each search result of the plurality of search results, wherein each search result of the plurality of search results is accompanied by one or more controls configured to: allow the user to selectively refine whether additional results from the at least one associated category should be displayed or excluded, and allow the user to selectively display or exclude all results from a particular associated category.
1. A method of delivering a search result comprising: assigning destination scores to a document with respect to a plurality of categories based on a plurality random walks of a linked corpus including the document with random teleportation hops biased toward a plurality of seed sets corresponding to the plurality of categories; assigning source scores to the document with respect to the plurality of categories, the source scores for the document indicating a contribution of the document to one or more destination scores of other nodes in the linked corpus; assigning combined scores to the document based on a combinations of the destination and source scores; associating a category of the plurality of categories with the document based at least in part on the combined scores; obtaining a search query; and delivering a plurality of search results to a user in a manner that includes an indication to the user of at least one category associated with each search result of the plurality of search results, wherein each search result of the plurality of search results is accompanied by one or more controls configured to: allow the user to selectively refine whether additional results from the at least one associated category should be displayed or excluded, and allow the user to selectively display or exclude all results from a particular associated category. 3. The method of claim 1 wherein the indication of at least one category is based at least in part on applying a threshold.
0.834232
8,046,226
43
44
43. The system of claim 28 , wherein the response is an alert.
43. The system of claim 28 , wherein the response is an alert. 44. The system of claim 43 , wherein the alert is transmitted by one of the following: telephone, voice mail, message bank, physician notification system, or Web page.
0.5
8,271,864
39
41
39. A method for representing a position-coded product in a digital pen system, the method comprising: creating an electronic document file of a predetermined format, the electronic document file comprising a set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages having a given ordering, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, wherein each of the pattern pages is a unique part of a position-coding pattern, and the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; activating the electronic document file for a number of product copies, wherein each product copy contains the set of document pages, and wherein the document pages are implicitly associated, in copy for copy order, with the pattern pages identified by the at least one pattern license file; printing a second number of the activated product copies by deriving the document pages and the associated pattern pages based on the electronic document file; and indicating the activated product copies thus-printed in the electronic document file.
39. A method for representing a position-coded product in a digital pen system, the method comprising: creating an electronic document file of a predetermined format, the electronic document file comprising a set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages having a given ordering, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, wherein each of the pattern pages is a unique part of a position-coding pattern, and the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; activating the electronic document file for a number of product copies, wherein each product copy contains the set of document pages, and wherein the document pages are implicitly associated, in copy for copy order, with the pattern pages identified by the at least one pattern license file; printing a second number of the activated product copies by deriving the document pages and the associated pattern pages based on the electronic document file; and indicating the activated product copies thus-printed in the electronic document file. 41. The method of claim 39 , wherein one or more of the document pages comprises a layout specification that defines at least human-understandable graphics on the document page.
0.635802
8,055,608
30
34
30. A method, performed by computing hardware and programmable memory, for determining whether a concept is referenced by a first unit of natural language discourse, comprising: parsing the first unit of natural language discourse into a first parse structure that represents each sub-unit, of the first unit of natural language discourse, by a node; adding at least one concept-value pair, each of which indicates a reference to a same first concept, to at least one node of the first parse structure, wherein each reference is determined by identifying an occurrence of a first linguistic feature from a first set of linguistic features and the first set of linguistic features contains many linguistic features; adding at least one concept-value pair, each of which indicates a reference to a same modifier concept that can modify a reference level assigned to the first concept, to at least one node of the first parse structure, wherein each reference to the modifier concept is determined by identifying an occurrence of a second linguistic feature from a second set of linguistic features and the second set of linguistic features contains many linguistic features; propagating the at least one concept-value pair for the modifier concept; identifying a first node of the first parse structure that has at least one concept-value pair for the first concept and at least one concept-value pair for the modifier concept; determining a first value to be scaled from the least one concept-value pair for the first concept; determining a first scaling value from the least one concept-value pair for the modifier concept; scaling the first value to be scaled with the first scaling value to produce a first scaled value; and propagating the at least one concept-value pair for the first concept.
30. A method, performed by computing hardware and programmable memory, for determining whether a concept is referenced by a first unit of natural language discourse, comprising: parsing the first unit of natural language discourse into a first parse structure that represents each sub-unit, of the first unit of natural language discourse, by a node; adding at least one concept-value pair, each of which indicates a reference to a same first concept, to at least one node of the first parse structure, wherein each reference is determined by identifying an occurrence of a first linguistic feature from a first set of linguistic features and the first set of linguistic features contains many linguistic features; adding at least one concept-value pair, each of which indicates a reference to a same modifier concept that can modify a reference level assigned to the first concept, to at least one node of the first parse structure, wherein each reference to the modifier concept is determined by identifying an occurrence of a second linguistic feature from a second set of linguistic features and the second set of linguistic features contains many linguistic features; propagating the at least one concept-value pair for the modifier concept; identifying a first node of the first parse structure that has at least one concept-value pair for the first concept and at least one concept-value pair for the modifier concept; determining a first value to be scaled from the least one concept-value pair for the first concept; determining a first scaling value from the least one concept-value pair for the modifier concept; scaling the first value to be scaled with the first scaling value to produce a first scaled value; and propagating the at least one concept-value pair for the first concept. 34. The method of claim 30 , wherein the first concept is a non-Quantifier concept and the modifier concept is a Quantifier concept.
0.723849
8,799,864
1
3
1. A processor-executed method of testing comprising: mapping Testing and Test Control Notation Version 3 (TTCN-3) test language to a SystemVerilog test bench; storing the mapped TTCN-3 test language with a SystemVerilog syntax compiler; and running the SystemVerilog test bench, with the mapped TTCN-3 test language.
1. A processor-executed method of testing comprising: mapping Testing and Test Control Notation Version 3 (TTCN-3) test language to a SystemVerilog test bench; storing the mapped TTCN-3 test language with a SystemVerilog syntax compiler; and running the SystemVerilog test bench, with the mapped TTCN-3 test language. 3. The method of claim 1 , further comprising: adapting the SystemVerilog test bench to a system under test (SUT), by including a codec associated with the system type.
0.609302
7,831,437
1
8
1. In a computer network having a terminal device and an outline library, a method of generating an outline for managing a legal proceeding, the method comprising: storing, in at least one database, an outline library comprising a plurality of categorization entries; displaying, via a display device associated with a terminal device that is operatively coupled to the at least one database via a communication link, one or more queries relating to a legal proceeding; generating, based in part on information received in response to the one or more queries, an outline that includes one or more of the plurality of categorization entries from the outline library relevant to the legal proceeding; and displaying the outline via the display device associated with the terminal device.
1. In a computer network having a terminal device and an outline library, a method of generating an outline for managing a legal proceeding, the method comprising: storing, in at least one database, an outline library comprising a plurality of categorization entries; displaying, via a display device associated with a terminal device that is operatively coupled to the at least one database via a communication link, one or more queries relating to a legal proceeding; generating, based in part on information received in response to the one or more queries, an outline that includes one or more of the plurality of categorization entries from the outline library relevant to the legal proceeding; and displaying the outline via the display device associated with the terminal device. 8. The method of claim 1 , wherein each categorization entry in the plurality of categorization entries in the outline library further includes a hierarchical framework of information groupings.
0.726761
8,060,841
9
15
9. A portable media device comprising a controller element that emits ultrasonic waveforms from ultrasonic transducers to reflect off a finger in a three-dimensional touchless sensing space; digitally samples the reflected ultrasonic waveforms off the finger to produce a sampled reflected ultrasonic waveform; tracks a relative location and movement of the finger in the three-dimensional ultrasonic sensing space from differential time of flight waveform analysis of the sampled reflected ultrasonic waveforms; suppressing a ringing portion of the emitted ultrasonic waveforms that overlaps with the sampled reflected ultrasonic waveform during the tracking; minimizing a distortion associated with ultrasonic transducer ring-down during generation of a high-resolution touchless finger signing from the suppressing; receives a search string from the touchless finger signing and presents at least one media that corresponds to at least a portion of the search string, wherein the search string includes at least one finger gesture generated in a touchless sensory field of the touchless sensing device.
9. A portable media device comprising a controller element that emits ultrasonic waveforms from ultrasonic transducers to reflect off a finger in a three-dimensional touchless sensing space; digitally samples the reflected ultrasonic waveforms off the finger to produce a sampled reflected ultrasonic waveform; tracks a relative location and movement of the finger in the three-dimensional ultrasonic sensing space from differential time of flight waveform analysis of the sampled reflected ultrasonic waveforms; suppressing a ringing portion of the emitted ultrasonic waveforms that overlaps with the sampled reflected ultrasonic waveform during the tracking; minimizing a distortion associated with ultrasonic transducer ring-down during generation of a high-resolution touchless finger signing from the suppressing; receives a search string from the touchless finger signing and presents at least one media that corresponds to at least a portion of the search string, wherein the search string includes at least one finger gesture generated in a touchless sensory field of the touchless sensing device. 15. The portable media device of claim 9 , wherein the controller element performs touchless scrolling and touchless selection of the at least one media.
0.851167
9,152,730
1
2
1. A method of extracting principal content from Web pages, comprising: identifying and classifying items on the Web page; building a list of candidates; calculating candidate scores that vary according to a plurality of weights assigned to paragraphs and images of the Web page, wherein a particular paragraph is provided with a first weight based on a number of lines in the particular paragraph and is provided with a second weight based on a number of words in the particular paragraph, the first weight being independent of the second weight and a particular image is provided with a weight based on a size of the particular image; selecting a top score candidate; performing clean up processing for the top score candidate; and performing final page processing for the top score candidate.
1. A method of extracting principal content from Web pages, comprising: identifying and classifying items on the Web page; building a list of candidates; calculating candidate scores that vary according to a plurality of weights assigned to paragraphs and images of the Web page, wherein a particular paragraph is provided with a first weight based on a number of lines in the particular paragraph and is provided with a second weight based on a number of words in the particular paragraph, the first weight being independent of the second weight and a particular image is provided with a weight based on a size of the particular image; selecting a top score candidate; performing clean up processing for the top score candidate; and performing final page processing for the top score candidate. 2. A method, according to claim 1 , where a word length of CJK (Chinese-Japanese-Korean) text is determined according to punctuation therein.
0.927544
8,306,807
17
18
17. The computer-implemented method of claim 12 , further comprising: performing a hybrid category-driven isolated noun phrase transfer when a result for translating an isolated noun phrase from the source language to the target language is not found using the category-driven isolated noun phrase translation based on finding the isolated noun phrase in one or more translation memories or one or more dictionaries.
17. The computer-implemented method of claim 12 , further comprising: performing a hybrid category-driven isolated noun phrase transfer when a result for translating an isolated noun phrase from the source language to the target language is not found using the category-driven isolated noun phrase translation based on finding the isolated noun phrase in one or more translation memories or one or more dictionaries. 18. The computer-implemented method of claim 17 , wherein the translating further comprises employing one or more of a transliteration only strategy, a key word replacement plus transliteration strategy, a category-driven lexical transfer strategy, a category-driven shallow syntactic transfer strategy and a statistical model translation strategy.
0.5
7,698,635
1
3
1. A method of generating a customized document about a product, the product comprising a plurality of components, the method comprising: a) providing a user with a document manager input interface on a computer, the input interface including a template manager module, a data pools manager module, an automatic text generator module, a document editor module, an effectivity interface module, and a document builder module; b) on the computer, defining a template based on a plurality of predefined data elements arranged in a tree-like data structure using the template manager module, the predefined data elements being retrieved from a parts library contained in the document builder module and defining parts and sections to be listed in the template; c) on the computer, creating the customized document from the defined template using the document builder module; d) on the computer, editing the customized document using the document editor module by using content-specific pull-down menus on the computer to edit one or more of the predefined data elements and thereby generating revised data elements and storing the revised data elements in a relational database storing the customized document; e) on the computer, deconstructing the syntax of textual data elements that are syntactically joined with linguistic rules, specifying a category in which to place a business rule, generating one or more tasks associated with a business rule and applying the business rule to the textual data elements of the document using the automatic text generator module; f) on the computer, modifying data that is standard in particular data structures and customizing the data for particular applications using a data pools manager module; g) on the computer, establishing effectivity associations, using the effectivity interface module, for a given component of the product, defining the manner in which a change to a given component is propagated throughout the customized document; h) in response to a user making the change to the given component via the effectivity interface module, propagating the change throughout the customized document according to the effectivity associations established by the user; i) synthesizing text from the revised data elements according to the (i) the structure defined be the template manager module, (ii) the edits made using the document editor module; (iii) the business rule applied by the user using the automatic text generator module, (iv) the customization data provided by the data pools manager module, and (v) the effectivity associations established by the user; and j) generating and publishing the customized document.
1. A method of generating a customized document about a product, the product comprising a plurality of components, the method comprising: a) providing a user with a document manager input interface on a computer, the input interface including a template manager module, a data pools manager module, an automatic text generator module, a document editor module, an effectivity interface module, and a document builder module; b) on the computer, defining a template based on a plurality of predefined data elements arranged in a tree-like data structure using the template manager module, the predefined data elements being retrieved from a parts library contained in the document builder module and defining parts and sections to be listed in the template; c) on the computer, creating the customized document from the defined template using the document builder module; d) on the computer, editing the customized document using the document editor module by using content-specific pull-down menus on the computer to edit one or more of the predefined data elements and thereby generating revised data elements and storing the revised data elements in a relational database storing the customized document; e) on the computer, deconstructing the syntax of textual data elements that are syntactically joined with linguistic rules, specifying a category in which to place a business rule, generating one or more tasks associated with a business rule and applying the business rule to the textual data elements of the document using the automatic text generator module; f) on the computer, modifying data that is standard in particular data structures and customizing the data for particular applications using a data pools manager module; g) on the computer, establishing effectivity associations, using the effectivity interface module, for a given component of the product, defining the manner in which a change to a given component is propagated throughout the customized document; h) in response to a user making the change to the given component via the effectivity interface module, propagating the change throughout the customized document according to the effectivity associations established by the user; i) synthesizing text from the revised data elements according to the (i) the structure defined be the template manager module, (ii) the edits made using the document editor module; (iii) the business rule applied by the user using the automatic text generator module, (iv) the customization data provided by the data pools manager module, and (v) the effectivity associations established by the user; and j) generating and publishing the customized document. 3. The method of claim 1 , where the plurality of predefined data elements are selected from the group consisting of text, quantity, descriptions, procedures and graphical metadata.
0.756065
8,065,360
10
16
10. The computationally-implemented system of claim 1 , wherein said means for acquiring source identity data providing one or more identities of one or more sources that provide a basis, at least in part, for the inference data indicative of the inferred mental state of the authoring user comprises: means for acquiring source identity data providing one or more identities of one or more sensors used to sense one or more physical characteristics of the authoring user, the inference data indicative of the inferred mental state of the authoring user being based, at least in part, on the one or more physical characteristics of the authoring user sensed by the one or more sensors.
10. The computationally-implemented system of claim 1 , wherein said means for acquiring source identity data providing one or more identities of one or more sources that provide a basis, at least in part, for the inference data indicative of the inferred mental state of the authoring user comprises: means for acquiring source identity data providing one or more identities of one or more sensors used to sense one or more physical characteristics of the authoring user, the inference data indicative of the inferred mental state of the authoring user being based, at least in part, on the one or more physical characteristics of the authoring user sensed by the one or more sensors. 16. The computationally-implemented system of claim 10 , wherein said means for acquiring source identity data providing one or more identities of one or more sensors used to sense one or more physical characteristics of the authoring user, the inference data indicative of the inferred mental state of the authoring user being based, at least in part, on the one or more physical characteristics of the authoring user sensed by the one or more sensors comprises: means for acquiring an identity for at least one of a facial expression sensor device, a skin characteristic sensor device, a voice response device, a gaze tracking device, or an iris response device used to sense the one or more physical characteristics of the authoring user.
0.5
8,473,299
1
16
1. A method comprising: selecting a top level flow controller that is a recursive transition network flow controller and a finite state model, to yield a selected top level flow controller; selecting available reusable subdialogs for each application part below the top level flow controller, to yield selected reusable subdialogs; developing a subdialog for each application part not having an available subdialog, to yield developed subdialogs; and testing and deploying a spoken dialog service using the selected top level flow controller, the selected reusable subdialogs and the developed subdialogs.
1. A method comprising: selecting a top level flow controller that is a recursive transition network flow controller and a finite state model, to yield a selected top level flow controller; selecting available reusable subdialogs for each application part below the top level flow controller, to yield selected reusable subdialogs; developing a subdialog for each application part not having an available subdialog, to yield developed subdialogs; and testing and deploying a spoken dialog service using the selected top level flow controller, the selected reusable subdialogs and the developed subdialogs. 16. The method of claim 1 , wherein a state in the recursive transition network flow controller has a subdialog attribute that is associated with a name of a flow controller invoked as a subdialog, to yield an invoked subdialog.
0.538462
10,069,784
15
17
15. A computer-implemented method, comprising: identifying, by one or more processors, a plurality of recipients of a transmitted electronic message; identifying, by one or more of the processors, a textual segment of the electronic message, and an additional task included in an additional textual segment of the electronic message; determining, by one or more of the processors, that at least one recipient of the recipients is associated with the segment, wherein determining that the at least one recipient is associated with the segment comprises: identifying a textual given noun phrase associated with the segment, determining a coreference resolution for the given noun phrase, and determining that the at least one recipient is associated with the segment based on the coreference resolution of the given noun phrase; determining, by one or more of the processors, that at least one additional recipient of one or more of the recipients is associated with the additional task, wherein determining that the additional recipient is associated with the additional task comprises: identifying a textual additional noun phrase associated with the additional segment that includes the additional task, determining an additional coreference resolution for the additional noun phrase, and determining that the additional recipient is associated with the additional task based on the additional coreference resolution of the additional noun phrase; providing, by one or more of the processors for presentation to the at least one recipient determined to be associated with the segment, an indication that is based on the segment, wherein the indication is provided to the at least one recipient based on determining that the at least one recipient is associated with the segment, wherein the indication is provided to the at least one recipient without being provided to one or more other of the recipients not determined to be associated with the segment; and providing, by one or more of the processors for presentation to the additional recipient determined to be associated with the additional segment, an additional indication that is based on the additional segment, wherein the additional indication is provided to the additional recipient based on determining that the additional recipient is associated with the additional segment, and wherein the additional indication is provided to the additional recipient without being provided to one or more other of the recipients not determined to be associated with the additional segment.
15. A computer-implemented method, comprising: identifying, by one or more processors, a plurality of recipients of a transmitted electronic message; identifying, by one or more of the processors, a textual segment of the electronic message, and an additional task included in an additional textual segment of the electronic message; determining, by one or more of the processors, that at least one recipient of the recipients is associated with the segment, wherein determining that the at least one recipient is associated with the segment comprises: identifying a textual given noun phrase associated with the segment, determining a coreference resolution for the given noun phrase, and determining that the at least one recipient is associated with the segment based on the coreference resolution of the given noun phrase; determining, by one or more of the processors, that at least one additional recipient of one or more of the recipients is associated with the additional task, wherein determining that the additional recipient is associated with the additional task comprises: identifying a textual additional noun phrase associated with the additional segment that includes the additional task, determining an additional coreference resolution for the additional noun phrase, and determining that the additional recipient is associated with the additional task based on the additional coreference resolution of the additional noun phrase; providing, by one or more of the processors for presentation to the at least one recipient determined to be associated with the segment, an indication that is based on the segment, wherein the indication is provided to the at least one recipient based on determining that the at least one recipient is associated with the segment, wherein the indication is provided to the at least one recipient without being provided to one or more other of the recipients not determined to be associated with the segment; and providing, by one or more of the processors for presentation to the additional recipient determined to be associated with the additional segment, an additional indication that is based on the additional segment, wherein the additional indication is provided to the additional recipient based on determining that the additional recipient is associated with the additional segment, and wherein the additional indication is provided to the additional recipient without being provided to one or more other of the recipients not determined to be associated with the additional segment. 17. The method of claim 15 , wherein providing the indication comprises providing a reminder notification, pertaining to a task associated with the segment, to the at least one recipient determined to be associated with the segment.
0.5
8,301,436
34
35
34. The hardware computer readable storage media of claim 33 wherein the module provides a semantic object that includes the data in a textual form.
34. The hardware computer readable storage media of claim 33 wherein the module provides a semantic object that includes the data in a textual form. 35. The hardware computer readable storage media of claim 34 wherein the module captures audible input from the user.
0.5
7,792,750
1
4
1. A computer-implemented method for generating a bid invitation document and evaluating bids received, comprising: presenting a query on a display device of a bidding system to a prospective purchaser; receiving a first selection by the prospective purchaser from the query, the first selection identifying a desired item and a first linguistic term describing a degree of importance assigned to the desired item; receiving a second selection identifying an attribute of said desired item from the query, the second selection also identifying a second linguistic term describing a degree of importance assigned to the attribute; receiving a third selection identifying a first value for said attribute, the third selection also identifying a third linguistic term describing a degree of satisfaction assigned to the first value for the attribute; generating, by a processing server of the bidding system, said bid invitation document using responses to the queries and the selections; electronically submitting said bid invitation document to prospective suppliers to notify said suppliers of the opportunity to submit a bid responsive to said bid invitation document; and upon receipt of a bid, retrieving each attribute from the bid, determining whether the retrieved attribute is a discrete attribute or a continuous attribute, the discrete attribute being associated with a discrete quantitative value and the continuous attribute being associated with two closest discrete values, for a discrete attribute, retrieving the discrete quantitative value associated with the discrete attribute, for a continuous attribute, calculating a quantitative value by calculating contribution of the closest discrete quantitative values associated with the continuous attribute; generating a quantitative degree of satisfaction value for the bid, the quantitative degree of satisfaction value of the bid being computed using a weighted method that takes account of a defuzzified weight for importance of the desired item, a defuzzified weight for the attribute of the desired item, and the discrete quantitative value for a discrete attribute or the calculated quantitative for a continuous attribute; and generating a linguistic result to be presented to the prospective purchaser, the linguistic result being based on the quantitative degree of satisfaction value.
1. A computer-implemented method for generating a bid invitation document and evaluating bids received, comprising: presenting a query on a display device of a bidding system to a prospective purchaser; receiving a first selection by the prospective purchaser from the query, the first selection identifying a desired item and a first linguistic term describing a degree of importance assigned to the desired item; receiving a second selection identifying an attribute of said desired item from the query, the second selection also identifying a second linguistic term describing a degree of importance assigned to the attribute; receiving a third selection identifying a first value for said attribute, the third selection also identifying a third linguistic term describing a degree of satisfaction assigned to the first value for the attribute; generating, by a processing server of the bidding system, said bid invitation document using responses to the queries and the selections; electronically submitting said bid invitation document to prospective suppliers to notify said suppliers of the opportunity to submit a bid responsive to said bid invitation document; and upon receipt of a bid, retrieving each attribute from the bid, determining whether the retrieved attribute is a discrete attribute or a continuous attribute, the discrete attribute being associated with a discrete quantitative value and the continuous attribute being associated with two closest discrete values, for a discrete attribute, retrieving the discrete quantitative value associated with the discrete attribute, for a continuous attribute, calculating a quantitative value by calculating contribution of the closest discrete quantitative values associated with the continuous attribute; generating a quantitative degree of satisfaction value for the bid, the quantitative degree of satisfaction value of the bid being computed using a weighted method that takes account of a defuzzified weight for importance of the desired item, a defuzzified weight for the attribute of the desired item, and the discrete quantitative value for a discrete attribute or the calculated quantitative for a continuous attribute; and generating a linguistic result to be presented to the prospective purchaser, the linguistic result being based on the quantitative degree of satisfaction value. 4. The method of claim 1 , wherein said degree of satisfaction fuzzy variables comprise very bad, bad, medium, good, and very good.
0.87182
9,111,531
1
2
1. A method comprising: receiving a portion of an audio signal at a first classifier in a digital audio device; classifying, by the digital audio device, the portion of the audio signal at the first classifier as speech or as music; and processing the portion of the audio signal, wherein processing the portion of the audio signal comprises: if the portion is classified by the first classifier as speech, then encoding, by the digital audio device, the speech using a first coding mode; or if the portion is classified by the first classifier as music, then: providing the portion to a second classifier in the digital audio device; classifying, by the digital audio device, the portion at the second classifier as speech or as music; and encoding the portion of the audio signal, wherein encoding the portion of the audio signal comprises: if the portion is classified at the second classifier as speech, then encoding, by the digital audio device, the portion using a second coding mode; or if the portion is classified at the second classifier as music, then encoding, by the digital audio device, the portion using a third coding mode.
1. A method comprising: receiving a portion of an audio signal at a first classifier in a digital audio device; classifying, by the digital audio device, the portion of the audio signal at the first classifier as speech or as music; and processing the portion of the audio signal, wherein processing the portion of the audio signal comprises: if the portion is classified by the first classifier as speech, then encoding, by the digital audio device, the speech using a first coding mode; or if the portion is classified by the first classifier as music, then: providing the portion to a second classifier in the digital audio device; classifying, by the digital audio device, the portion at the second classifier as speech or as music; and encoding the portion of the audio signal, wherein encoding the portion of the audio signal comprises: if the portion is classified at the second classifier as speech, then encoding, by the digital audio device, the portion using a second coding mode; or if the portion is classified at the second classifier as music, then encoding, by the digital audio device, the portion using a third coding mode. 2. The method of claim 1 , wherein the portion of the audio signal is a frame.
0.872964
10,147,051
1
8
1. A method, in a data processing system comprising a processor and a memory having instructions which, when executed by the processor, cause the processor to generate candidate answers to an explanatory question, the method comprising: responsive to identifying an input question as the explanatory question, decomposing, by the data processing system, the explanatory question into one or more explanatory queries; identifying, by the data processing system, one or more passages within a corpus of information that comprise an explanatory clause that provides an explanatory answer to the explanatory question based on pre-determined explanatory clause terms, wherein a passage within the one or more passages within the corpus of information that comprises the explanatory clause is identified by the method comprising: comparing, by the data processing system, each identified clause within a passage to a set of previously identified explanatory clauses; and responsive to the identified clause within a passage corresponding to one of the set of previously identified explanatory clauses, tagging, by the data processing system, the clause within the passage with an ‘EXPLANATORY’ tag; receiving, by the data processing system, hypothesis evidence with one or more passages comprising explanatory clauses from the corpus of information; generating, by the data processing system, one or more candidate explanatory answers based on hypothesis evidence; ranking and merging, by the data processing system, the one or more candidate explanatory answers; and outputting, by the data processing system, the one or more candidate explanatory answers.
1. A method, in a data processing system comprising a processor and a memory having instructions which, when executed by the processor, cause the processor to generate candidate answers to an explanatory question, the method comprising: responsive to identifying an input question as the explanatory question, decomposing, by the data processing system, the explanatory question into one or more explanatory queries; identifying, by the data processing system, one or more passages within a corpus of information that comprise an explanatory clause that provides an explanatory answer to the explanatory question based on pre-determined explanatory clause terms, wherein a passage within the one or more passages within the corpus of information that comprises the explanatory clause is identified by the method comprising: comparing, by the data processing system, each identified clause within a passage to a set of previously identified explanatory clauses; and responsive to the identified clause within a passage corresponding to one of the set of previously identified explanatory clauses, tagging, by the data processing system, the clause within the passage with an ‘EXPLANATORY’ tag; receiving, by the data processing system, hypothesis evidence with one or more passages comprising explanatory clauses from the corpus of information; generating, by the data processing system, one or more candidate explanatory answers based on hypothesis evidence; ranking and merging, by the data processing system, the one or more candidate explanatory answers; and outputting, by the data processing system, the one or more candidate explanatory answers. 8. The method of claim 1 , wherein identifying the passage within the one or more passages within the corpus of information that comprises the explanatory clause is further identified by the method comprising: appending, by the data processing system, the identified clause to a set of previously identified explanatory clauses.
0.714286
9,965,567
20
21
20. The at least one non-transitory computer-readable medium of claim 19 , wherein the first publication template is configured to display only one of the two or more content components in the single section of the first layout.
20. The at least one non-transitory computer-readable medium of claim 19 , wherein the first publication template is configured to display only one of the two or more content components in the single section of the first layout. 21. The at least one non-transitory computer-readable medium of claim 20 , wherein the first publication template is configured to alternate which content component is displayed in the single section of the first layout in response to receiving the user interaction in the single section of the first layout.
0.5
9,513,901
9
10
9. The computer system of claim 8 , wherein the first script, the second script and the third script are scripts that utilize the SQL programming language.
9. The computer system of claim 8 , wherein the first script, the second script and the third script are scripts that utilize the SQL programming language. 10. The computer system of claim 9 , wherein the metadata tags corresponding to the function of the element comprise tags corresponding to table changes, constraint changes or column changes.
0.5
6,088,707
57
58
57. The method of claim 52, wherein analyzing the retrieved data includes searching the retrieved data for a username for the author.
57. The method of claim 52, wherein analyzing the retrieved data includes searching the retrieved data for a username for the author. 58. The method of claim 57, wherein searching the retrieved data for the username includes searching for a tag in the document.
0.5
9,020,911
1
8
1. A computer program product for matching names, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therein, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform operations of: creating a first bitmap distribution of character n-grams distributed into bitmap positions in descending order of frequency of occurrence of the character n-grams in a set of names based on bitmap positions with a lowest cumulative frequency, wherein at least two distinct character n-grams are assigned to a same bitmap position of the bitmap positions; creating a second bitmap distribution of the character n-grams distributed into the bitmap positions so that the at least two distinct character n-grams are assigned to different bitmap positions and so that any overlapping character n-grams in the first bitmap distribution do not overlap in the second bitmap distribution; using the first bitmap distribution, determining whether a first bitmap signature of a query name and a second bitmap signature of a target name in a set of names have a number of character n-grams overlapping that meet or exceed a first configurable threshold to generate a first preliminary value; using the second bitmap distribution, determining whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a second configurable threshold to generate a second preliminary value; and in response to determining that a logical operation applied to the first preliminary value and the second preliminary value results in a value of true, determining that the query name and the target name are to be processed for further comparisons.
1. A computer program product for matching names, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therein, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform operations of: creating a first bitmap distribution of character n-grams distributed into bitmap positions in descending order of frequency of occurrence of the character n-grams in a set of names based on bitmap positions with a lowest cumulative frequency, wherein at least two distinct character n-grams are assigned to a same bitmap position of the bitmap positions; creating a second bitmap distribution of the character n-grams distributed into the bitmap positions so that the at least two distinct character n-grams are assigned to different bitmap positions and so that any overlapping character n-grams in the first bitmap distribution do not overlap in the second bitmap distribution; using the first bitmap distribution, determining whether a first bitmap signature of a query name and a second bitmap signature of a target name in a set of names have a number of character n-grams overlapping that meet or exceed a first configurable threshold to generate a first preliminary value; using the second bitmap distribution, determining whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a second configurable threshold to generate a second preliminary value; and in response to determining that a logical operation applied to the first preliminary value and the second preliminary value results in a value of true, determining that the query name and the target name are to be processed for further comparisons. 8. The computer program product of claim 1 , wherein a minimum number of matching preliminary values is equal to a total number of distinct character n-gram distributions.
0.896112
8,831,349
8
14
8. A client device comprising: a display; one or more processors; memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: displaying an image on the display, the image including a plurality of segments; receiving a selection gesture to select one or more segments from the plurality of segments; receiving contextual information of the image; and instantiating a search query based on the one or more selected segments and the contextual information of the image.
8. A client device comprising: a display; one or more processors; memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: displaying an image on the display, the image including a plurality of segments; receiving a selection gesture to select one or more segments from the plurality of segments; receiving contextual information of the image; and instantiating a search query based on the one or more selected segments and the contextual information of the image. 14. The client device as recited in claim 8 , the acts further comprising, prior to displaying the image: obtaining the image by: capturing the image through a camera of the client device; receiving a selection of the image from a photo application of the client device; or receiving a selection of the image from media stored on or accessible to the client device.
0.5
9,727,933
8
14
8. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to perform a method, the method comprising: (a) providing a interactive three-dimensional reserve study to a user system via a network, wherein the interactive three-dimensional reserve study is renderable on a display of the user system such that a three-dimensional line art diagram of a Common Interest Development (CID) and at least two graphical elements are rendered on the display, wherein a first graphical element of the at least two graphical elements corresponds to a first reserve component of the CID, wherein a second graphical element of the at least two graphical elements corresponds to a second reserve component of the CID, wherein the first reserve component is different from the second reserve component, wherein the first graphical element includes a first amount of color or shading that is overlaid above a first portion of the three-dimensional line art diagram of the CID, wherein the first graphical element is configured to respond to user input, wherein the second graphical element includes a second amount of color or shading that is overlaid above a second portion of the three-dimensional line art diagram of the CID, wherein the second graphical element is configured to respond to user input, and wherein the first portion is different from the second portion; (b) in response to detecting a first input event on the first graphical element, presenting a first amount of reserve component information of the first reserve component on the display of the user system; and (c) in response to detecting a second input event on the second graphical element, presenting a second amount of reserve component information of the second reserve component on the display of the user system, wherein the interactive three-dimensional reserve study is provided on a single web page.
8. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to perform a method, the method comprising: (a) providing a interactive three-dimensional reserve study to a user system via a network, wherein the interactive three-dimensional reserve study is renderable on a display of the user system such that a three-dimensional line art diagram of a Common Interest Development (CID) and at least two graphical elements are rendered on the display, wherein a first graphical element of the at least two graphical elements corresponds to a first reserve component of the CID, wherein a second graphical element of the at least two graphical elements corresponds to a second reserve component of the CID, wherein the first reserve component is different from the second reserve component, wherein the first graphical element includes a first amount of color or shading that is overlaid above a first portion of the three-dimensional line art diagram of the CID, wherein the first graphical element is configured to respond to user input, wherein the second graphical element includes a second amount of color or shading that is overlaid above a second portion of the three-dimensional line art diagram of the CID, wherein the second graphical element is configured to respond to user input, and wherein the first portion is different from the second portion; (b) in response to detecting a first input event on the first graphical element, presenting a first amount of reserve component information of the first reserve component on the display of the user system; and (c) in response to detecting a second input event on the second graphical element, presenting a second amount of reserve component information of the second reserve component on the display of the user system, wherein the interactive three-dimensional reserve study is provided on a single web page. 14. The non-transitory computer-readable medium of claim 8 , the method further comprising: (d) serving a login markup language document to the user system via the network and receiving login credentials via the network, wherein step (d) occurs before step (a), and wherein step (a) occurs only if the login credentials are authenticated.
0.685874
9,965,509
11
15
11. A computer system for generating a score for a candidate answer to an input query, the system comprising: a computer device comprising at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory for holding data; and at least one processor unit operatively coupled to the memory and operative for: receiving an input query; identifying a candidate answer to the input query; determining a set of documents using theorem proving for scoring the candidate answer, including: identifying a plurality of logical proof of the candidate answer, the logical proof including a conclusion and a sequence of premises that logically prove the conclusion, including using the candidate answer as the conclusion of the logical proof, and identifying a set of documents that establish all the premises of the logical proof, including searching through a group of documents to identify a sub-group of documents of the group of documents that include one or more of the premises of the logical proof, and wherein each of the premises of the logical proof is included in at least one of the documents of the sub-group of document, and selecting for said set of documents a plurality of the documents of the sub-group of documents, including selecting for said set of documents the plurality of the documents of the sub-group of documents in order of a number of the premises in each of the documents of said sub-group of documents until all the premises are included in at least one of the documents selected for said set of documents; and using the set of documents to generate a score for the candidate answer.
11. A computer system for generating a score for a candidate answer to an input query, the system comprising: a computer device comprising at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory for holding data; and at least one processor unit operatively coupled to the memory and operative for: receiving an input query; identifying a candidate answer to the input query; determining a set of documents using theorem proving for scoring the candidate answer, including: identifying a plurality of logical proof of the candidate answer, the logical proof including a conclusion and a sequence of premises that logically prove the conclusion, including using the candidate answer as the conclusion of the logical proof, and identifying a set of documents that establish all the premises of the logical proof, including searching through a group of documents to identify a sub-group of documents of the group of documents that include one or more of the premises of the logical proof, and wherein each of the premises of the logical proof is included in at least one of the documents of the sub-group of document, and selecting for said set of documents a plurality of the documents of the sub-group of documents, including selecting for said set of documents the plurality of the documents of the sub-group of documents in order of a number of the premises in each of the documents of said sub-group of documents until all the premises are included in at least one of the documents selected for said set of documents; and using the set of documents to generate a score for the candidate answer. 15. The system according to claim 11 , wherein the searching through a group of documents to identify a sub-group of documents of the group of documents of the group of documents that include one or more of the premises includes identifying a number of the premises in said each document of said sub-group of documents.
0.506192
8,594,994
11
13
11. The system of claim 8 wherein the operations further comprise: receiving a query in a first language; translating the query into the target language to form a first translated query; identifying one or more documents that are responsive to the first translated query using the anchor text indexes and document indexes; and providing a response to the first translated query based on the identified documents.
11. The system of claim 8 wherein the operations further comprise: receiving a query in a first language; translating the query into the target language to form a first translated query; identifying one or more documents that are responsive to the first translated query using the anchor text indexes and document indexes; and providing a response to the first translated query based on the identified documents. 13. The system of claim 11 wherein providing a response to the first translated query comprises: determining that an identified document containing information responsive to the first translated query is not written in the first language; and in response to the determination, translating the given document to the first language.
0.710018
8,521,897
12
13
12. The apparatus of claim 11 wherein the instructions to transmit the request package comprise instructions to: transmit the request package to a local service object running on the processor; transmit the request package through one or more communication objects in a communication route between the local service object and a remote service object running on an additional processor; deliver the request package from the last communication object in the communication path to the remote service object; and deliver the request package from the remote service object to the one or more target objects.
12. The apparatus of claim 11 wherein the instructions to transmit the request package comprise instructions to: transmit the request package to a local service object running on the processor; transmit the request package through one or more communication objects in a communication route between the local service object and a remote service object running on an additional processor; deliver the request package from the last communication object in the communication path to the remote service object; and deliver the request package from the remote service object to the one or more target objects. 13. The apparatus of claim 12 , wherein the remote service object includes instructions to cause the additional processor to: assemble a response package including responses from each of the one or more target objects to which commands were directed in the request package, the response package including a header and a payload; and transmit the response package to the origin object.
0.5
8,478,045
9
11
9. The apparatus according to claim 8 , wherein the initial selection device is further configured to search in the set of characters one or more characters having highest similarities of shape to the first character by: searching in the set of characters one or more characters having highest similarities of shape to each image sample of a plurality of image samples of the first character, as a candidate character set of the each image sample, so as to form a plurality of candidate character sets each of which corresponds to one of the image samples; calculating a frequency of each character occurring in the plurality of candidate character sets; and selecting in the plurality of candidate character sets one or more characters corresponding to highest frequencies, to form the similar character list of the first character.
9. The apparatus according to claim 8 , wherein the initial selection device is further configured to search in the set of characters one or more characters having highest similarities of shape to the first character by: searching in the set of characters one or more characters having highest similarities of shape to each image sample of a plurality of image samples of the first character, as a candidate character set of the each image sample, so as to form a plurality of candidate character sets each of which corresponds to one of the image samples; calculating a frequency of each character occurring in the plurality of candidate character sets; and selecting in the plurality of candidate character sets one or more characters corresponding to highest frequencies, to form the similar character list of the first character. 11. The apparatus according to claim 9 , wherein the initial selection device is further configured to select in the candidate character sets one or more characters corresponding to highest frequencies by: selecting in the plurality of candidate character sets one or more characters corresponding to frequencies larger than a first threshold, to form the similar character list of the first character.
0.689335
8,069,185
1
8
1. A method of generating a concept dictionary for use in querying an information system comprising: (i) receiving an information search criterion; (ii) deriving from said received search criterion, using a lexical reference source, at least one different search criterion having related meaning to said received search criterion; (iii) identifying a set of information in said information system relevant to said received search criterion and a different set of information in said information system relevant to said at least one derived search criterion; (iv) analyzing the identified sets of information and deriving from similarities and differences therebetween relationships between said received search criterion and said at least one derived search criterion in the context of said information system; and (v) storing, in a concept dictionary, information relating to said received and said at least one derived search criterion and to respective said derived relationships therebetween, for use in querying said information system.
1. A method of generating a concept dictionary for use in querying an information system comprising: (i) receiving an information search criterion; (ii) deriving from said received search criterion, using a lexical reference source, at least one different search criterion having related meaning to said received search criterion; (iii) identifying a set of information in said information system relevant to said received search criterion and a different set of information in said information system relevant to said at least one derived search criterion; (iv) analyzing the identified sets of information and deriving from similarities and differences therebetween relationships between said received search criterion and said at least one derived search criterion in the context of said information system; and (v) storing, in a concept dictionary, information relating to said received and said at least one derived search criterion and to respective said derived relationships therebetween, for use in querying said information system. 8. A method as in claim 1 , wherein, at step (ii), a plurality of search criteria are derived, each having related meaning to said received search criterion, and wherein at step (iv), the respective identified sets of information are analyzed to derive relationships between search criteria comprised in said plurality of derived search criteria.
0.777062
9,471,282
11
19
11. A non-transitory computer-readable medium containing computer-executable instructions to automatically generate a custom JavaServer Faces (JSF) component, the instructions operable when executed by one or more computers to effectuate operations comprising: receiving annotated source code that defines a component class for the custom JSF component of a JSF application, the annotated source code being Java code of a Java class that defines behavior of a user interface element in a web page, the custom JSF component being callable by a custom tag in a markup language document at least in part defining the web page, the annotated source code including a Java annotation designated by an @ symbol prefix corresponding to a renderer; and creating the custom JSF component, at least in part, by: identifying the annotation in the received source code; and in response to identifying the annotation, automatically generating a default decode method of the renderer that interprets inputs related to the custom JSF component and associating the renderer with the custom JSF component in a faces-config.xml file of the JSF application without manually adding a reference to the custom JSF component to the faces-config.xml file of the JSF application.
11. A non-transitory computer-readable medium containing computer-executable instructions to automatically generate a custom JavaServer Faces (JSF) component, the instructions operable when executed by one or more computers to effectuate operations comprising: receiving annotated source code that defines a component class for the custom JSF component of a JSF application, the annotated source code being Java code of a Java class that defines behavior of a user interface element in a web page, the custom JSF component being callable by a custom tag in a markup language document at least in part defining the web page, the annotated source code including a Java annotation designated by an @ symbol prefix corresponding to a renderer; and creating the custom JSF component, at least in part, by: identifying the annotation in the received source code; and in response to identifying the annotation, automatically generating a default decode method of the renderer that interprets inputs related to the custom JSF component and associating the renderer with the custom JSF component in a faces-config.xml file of the JSF application without manually adding a reference to the custom JSF component to the faces-config.xml file of the JSF application. 19. The computer-readable medium of claim 11 , comprising: providing a web application to a client device, at least part of the web application including markup generated by a renderer of the custom JSF component based on an output of the custom JSF component.
0.803922
9,692,771
14
15
14. The tangible, non-transitory computer-readable medium of claim 9 , further comprising computer program code that, when executed by the processor, causes the processor to, in response to determining that the Internet domain name is typical, provide an indication to a user that the Internet domain name is typical, wherein the Internet domain name is obtained from the user.
14. The tangible, non-transitory computer-readable medium of claim 9 , further comprising computer program code that, when executed by the processor, causes the processor to, in response to determining that the Internet domain name is typical, provide an indication to a user that the Internet domain name is typical, wherein the Internet domain name is obtained from the user. 15. The tangible, non-transitory computer-readable medium of claim 14 , further comprising computer program code that, when executed by the processor, causes the processor to, in response to determining that the Internet domain name is not typical provide an indication to the user that the Internet domain name is not typical.
0.5
7,702,509
38
39
38. The computer-readable storage medium of claim 36 , wherein the instruction to select phoneme sub-strings comprises: an instruction to form an orthographic neighborhood from in-vocabulary words correspond to orthographic anchors that satisfy the closeness measure; and an instruction to create a pronunciation data neighborhood from phoneme strings for the in-vocabulary words in the orthographic neighborhood, the phoneme strings have at least one phoneme sub-string in the dictionary.
38. The computer-readable storage medium of claim 36 , wherein the instruction to select phoneme sub-strings comprises: an instruction to form an orthographic neighborhood from in-vocabulary words correspond to orthographic anchors that satisfy the closeness measure; and an instruction to create a pronunciation data neighborhood from phoneme strings for the in-vocabulary words in the orthographic neighborhood, the phoneme strings have at least one phoneme sub-string in the dictionary. 39. The computer-readable storage medium of claim 38 , wherein the instruction to select phoneme sub-strings further comprises: an instruction to select phoneme strings in the pronunciation data neighborhood for each context within the out-of vocabulary word; an instruction to align the selected phoneme strings on common phoneme sub-strings; and an instruction to select a phoneme sub-string for each context from the common phoneme sub-strings.
0.5
8,294,919
14
16
14. A subassembly of a compact, desktop document processor that receives a financial document and captures data from the financial document, comprising: a programmable endorser, wherein the programmable endorser includes: a rotatable shaft rotatably-connected to the base unit, a self-inking printing device axially mounted upon the rotatable shaft, and a programmable rotary actuator connected to the rotatable shaft, wherein the programmable endorser is utilized for printing an endorsement on the financial document as the financial document is processed, wherein the self-inking printing device includes a plurality of character segments in the form of various shapes such that the endorsement is printed by building characters from the character segments; and a document pressing device arranged communicatively arranged with the programmable endorser in a spaced-apart relationship, wherein the document pressing device includes: a print hammer arranged to press the financial document against the self-inking print roller to produce a character segment upon the financial document, and an electromagnetic solenoid connected to the print hammer for actuating the print hammer for pressing the financial document against the self-inking print roller.
14. A subassembly of a compact, desktop document processor that receives a financial document and captures data from the financial document, comprising: a programmable endorser, wherein the programmable endorser includes: a rotatable shaft rotatably-connected to the base unit, a self-inking printing device axially mounted upon the rotatable shaft, and a programmable rotary actuator connected to the rotatable shaft, wherein the programmable endorser is utilized for printing an endorsement on the financial document as the financial document is processed, wherein the self-inking printing device includes a plurality of character segments in the form of various shapes such that the endorsement is printed by building characters from the character segments; and a document pressing device arranged communicatively arranged with the programmable endorser in a spaced-apart relationship, wherein the document pressing device includes: a print hammer arranged to press the financial document against the self-inking print roller to produce a character segment upon the financial document, and an electromagnetic solenoid connected to the print hammer for actuating the print hammer for pressing the financial document against the self-inking print roller. 16. The subassembly of claim 14 wherein the self-inking printing device includes an elastomeric foam substrate material impregnated with a printing ink and faced with a selectively-permeable outer membrane so as to form a character segment when pressed against the document.
0.5
7,895,275
21
24
21. The central server of claim 16 wherein to effect review of the digital content, the control system is further configured to: a) select a group of reviewers from the others of the plurality of authors for a review at a first quality level that is less than the target quality level based on the reviewer credentials; b) effect transfer of the digital content to user devices associated with the group of reviewers; c) receive feedback from the group of reviewers; d) determine whether the digital content is to be reviewed at a next quality level based on the feedback and the target quality level; and e) if the digital content is to be reviewed at the next quality level, repeat a)-e) for the next quality level.
21. The central server of claim 16 wherein to effect review of the digital content, the control system is further configured to: a) select a group of reviewers from the others of the plurality of authors for a review at a first quality level that is less than the target quality level based on the reviewer credentials; b) effect transfer of the digital content to user devices associated with the group of reviewers; c) receive feedback from the group of reviewers; d) determine whether the digital content is to be reviewed at a next quality level based on the feedback and the target quality level; and e) if the digital content is to be reviewed at the next quality level, repeat a)-e) for the next quality level. 24. The central server of claim 21 wherein in order to determine whether the digital content is to be reviewed at the next quality level, the control system is further configured to: provide feedback to the one of the plurality of authors based on the feedback from the group of reviewers; and receive information indicating whether the digital content is to be reviewed at the next quality level from the one of the plurality of authors, wherein the one of the plurality of authors decides whether the digital content is to be reviewed at the next quality level based on the feedback.
0.5
8,442,973
1
12
1. A method for dynamically modifying search results comprising: receiving one or more keywords for use as search terms from a user; providing a set of search result objects on a first page of results displayed to said user; providing title and display text with each of said search result objects in said set of search result objects; monitoring which of said objects is selected by said user; compiling information to infer user intent based on the content of said document the user clicks; and by the time said user returns from said document to said set of search result objects including said document, immediately automatically re-ranking said set of search result objects based on user intent inferred from said analyzing of the content of said document said user clicks on, so that a user clicking on a single document from said set of search result objects results in a re-ranking of said set of search result objects, so that upon said user returning from said document to said set of search result objects including said document, without the user resubmitting the search, the re-ranked results will be visible; using terms from the title and display text corresponding to a selected object in an algorithm for generating said re-ranking of said set of search result objects on at least said first page; wherein said re-ranking includes moving at least one object from a subsequent page, not originally visible to said user on said first page, onto said first page; wherein said at least one object moved onto said first page is displayed in a manner to indicate to the user that it has been inserted between other objects on said first page, with said display providing an indication that the object is from a subsequent page and was not originally displayed on said first page.
1. A method for dynamically modifying search results comprising: receiving one or more keywords for use as search terms from a user; providing a set of search result objects on a first page of results displayed to said user; providing title and display text with each of said search result objects in said set of search result objects; monitoring which of said objects is selected by said user; compiling information to infer user intent based on the content of said document the user clicks; and by the time said user returns from said document to said set of search result objects including said document, immediately automatically re-ranking said set of search result objects based on user intent inferred from said analyzing of the content of said document said user clicks on, so that a user clicking on a single document from said set of search result objects results in a re-ranking of said set of search result objects, so that upon said user returning from said document to said set of search result objects including said document, without the user resubmitting the search, the re-ranked results will be visible; using terms from the title and display text corresponding to a selected object in an algorithm for generating said re-ranking of said set of search result objects on at least said first page; wherein said re-ranking includes moving at least one object from a subsequent page, not originally visible to said user on said first page, onto said first page; wherein said at least one object moved onto said first page is displayed in a manner to indicate to the user that it has been inserted between other objects on said first page, with said display providing an indication that the object is from a subsequent page and was not originally displayed on said first page. 12. The method of claim 1 wherein said one or more keywords are a first query, and further comprising: receiving a second query of one or more keywords from said user: generating a second set of search result objects; comparing said second set of search result objects to one of said set of search result objects and said re-ranked set of search result objects to determine a correlation; and providing a modified second set of search result objects to said user based on said correlation.
0.5
8,875,019
13
14
13. A computer program product, comprising: a computer-readable, tangible storage device; and a computer-readable program code stored on the computer-readable, tangible storage device, said computer-readable program code containing instructions that, when executed by a processor of a computer system, implement a method of presenting choices of different translations of a message and corresponding interpretations of said different translations, said method comprising the steps of: said computer system receiving said message input by a first user (sender) to be sent to a second user (recipient); said computer system receiving an indication of a culture of said recipient; said computer system retrieving different translations of said message and respective levels of formality of said different translations, said levels of formality being levels of politeness that said culture of said recipient associates with said different translations of said message; said computer system presenting to said sender choices of said different translations of said message and said levels of formality, wherein said different translations are in a language understood by said recipient; said computer system receiving a selection by said sender of a translation included in said different translations, wherein said selection of said translation is based on a review by said sender of said presented choices of said different translations of said message and said levels of formality; subsequent to said receiving said selection of said translation, said computer system searching a data repository for and subsequently finding in said data repository a gesture which is part of said culture of said recipient and which communicates at least a part of said translation, adds a meaning to said translation, removes an ambiguity in said translation, and adds a granular qualification to said translation; in response to said finding said gesture, said computer system presenting to said sender an indicator of said gesture and said translation, said indicator being in proximity to a portion of said presented translation; said computer system receiving a selection by said sender of said indicator of said gesture, and in response, presenting said gesture and notes about said gesture to said sender, said notes indicating to said sender how said gesture provides or facilitates an interpretation of said translation, said interpretation being specific to said culture of said recipient, and said notes further indicating to said sender that said gesture is required to prevent said ambiguity in said translation, wherein a result of said presenting said gesture and said notes about said gesture is an increase in knowledge of said sender about said culture of said recipient; and presenting said selected translation to and said gesture said recipient.
13. A computer program product, comprising: a computer-readable, tangible storage device; and a computer-readable program code stored on the computer-readable, tangible storage device, said computer-readable program code containing instructions that, when executed by a processor of a computer system, implement a method of presenting choices of different translations of a message and corresponding interpretations of said different translations, said method comprising the steps of: said computer system receiving said message input by a first user (sender) to be sent to a second user (recipient); said computer system receiving an indication of a culture of said recipient; said computer system retrieving different translations of said message and respective levels of formality of said different translations, said levels of formality being levels of politeness that said culture of said recipient associates with said different translations of said message; said computer system presenting to said sender choices of said different translations of said message and said levels of formality, wherein said different translations are in a language understood by said recipient; said computer system receiving a selection by said sender of a translation included in said different translations, wherein said selection of said translation is based on a review by said sender of said presented choices of said different translations of said message and said levels of formality; subsequent to said receiving said selection of said translation, said computer system searching a data repository for and subsequently finding in said data repository a gesture which is part of said culture of said recipient and which communicates at least a part of said translation, adds a meaning to said translation, removes an ambiguity in said translation, and adds a granular qualification to said translation; in response to said finding said gesture, said computer system presenting to said sender an indicator of said gesture and said translation, said indicator being in proximity to a portion of said presented translation; said computer system receiving a selection by said sender of said indicator of said gesture, and in response, presenting said gesture and notes about said gesture to said sender, said notes indicating to said sender how said gesture provides or facilitates an interpretation of said translation, said interpretation being specific to said culture of said recipient, and said notes further indicating to said sender that said gesture is required to prevent said ambiguity in said translation, wherein a result of said presenting said gesture and said notes about said gesture is an increase in knowledge of said sender about said culture of said recipient; and presenting said selected translation to and said gesture said recipient. 14. The program product of claim 13 , wherein said method further comprises said computer system receiving updates of said levels of formality from a plurality of users utilizing a plurality of computer units that access said computer system via a computer network.
0.830563
7,533,372
1
3
1. A process for changing a computer system or application from a first language to at least a second language comprising the steps of: determining a structure of a system about to be migrated; storing migration information based on the determination of the structure; performing said migration based on said stored migration information, wherein performing said migration modifies at least some core code of the computer system from a language dependent form into a language independent form; performing said migration based on a module-type migration and based on said stored information to a stored link to provide a path backwards to reestablish the stored link using pre-migration information including: a user-related setting string; at least one system-wide setting string, with each user-related or system wide setting string allowing a registry value association between said stored migration information and a stored registry in an automatically generated string table; wherein said migration information can compare a file name with said stored registry, to said automatically generated string table; and performing said migration based on said stored migration information to a stored registry to synchronize the post-migration system structure.
1. A process for changing a computer system or application from a first language to at least a second language comprising the steps of: determining a structure of a system about to be migrated; storing migration information based on the determination of the structure; performing said migration based on said stored migration information, wherein performing said migration modifies at least some core code of the computer system from a language dependent form into a language independent form; performing said migration based on a module-type migration and based on said stored information to a stored link to provide a path backwards to reestablish the stored link using pre-migration information including: a user-related setting string; at least one system-wide setting string, with each user-related or system wide setting string allowing a registry value association between said stored migration information and a stored registry in an automatically generated string table; wherein said migration information can compare a file name with said stored registry, to said automatically generated string table; and performing said migration based on said stored migration information to a stored registry to synchronize the post-migration system structure. 3. The process according to claim 1 , wherein said migration information is drawn from local dynamic libraries and information files.
0.684834
7,747,633
1
2
1. A computer-implemented method for maintaining a hierarchical tree representation of an extensible markup language (XML) data string, comprising using at least one processor coupled to a memory to perform the following operations: detecting a modification to an XML data string; determining a location of the modification in the XML data string; correlating the location of the modification to at least one node in a hierarchical tree formed as a tokenized representation of the XML data string; deleting a portion of the hierarchical tree based at least in part on the modification corresponding to deleting a portion of the XML data string; determining a last node in the deleted portion of the hierarchical tree, and populating at least one sub-tree with nodes associated with the last node in the deleted portion of the hierarchical tree; and inserting the at least one sub-tree into the hierarchical tree following the deleting the portion of the hierarchical tree.
1. A computer-implemented method for maintaining a hierarchical tree representation of an extensible markup language (XML) data string, comprising using at least one processor coupled to a memory to perform the following operations: detecting a modification to an XML data string; determining a location of the modification in the XML data string; correlating the location of the modification to at least one node in a hierarchical tree formed as a tokenized representation of the XML data string; deleting a portion of the hierarchical tree based at least in part on the modification corresponding to deleting a portion of the XML data string; determining a last node in the deleted portion of the hierarchical tree, and populating at least one sub-tree with nodes associated with the last node in the deleted portion of the hierarchical tree; and inserting the at least one sub-tree into the hierarchical tree following the deleting the portion of the hierarchical tree. 2. The computer-implemented method of claim 1 , further comprising determining a smallest number of nodes of the hierarchical tree to be updated as a result of the modification to the XML data string.
0.73262
9,189,954
13
14
13. A method for controlling a radio device, comprising: receiving a gesture input through a gesture pad that distinguishes between a plurality of fingers used for a gesture, that recognizes the orientation of the distinguished finger, and that performs a function that is dependent on the distinguished finger and its orientation; and modifying an operation of the radio device based on the received gesture input.
13. A method for controlling a radio device, comprising: receiving a gesture input through a gesture pad that distinguishes between a plurality of fingers used for a gesture, that recognizes the orientation of the distinguished finger, and that performs a function that is dependent on the distinguished finger and its orientation; and modifying an operation of the radio device based on the received gesture input. 14. The method of claim 13 , further comprising: recognizing a fingerprint with the gesture pad; authenticating a user based on the recognized fingerprint; and personalizing the operation based on the fingerprint.
0.544872
8,301,594
16
19
16. A non-transitory computer-readable medium having computer-readable instructions stored thereon that, upon execution by a processor, cause the processor to: record, in a context holding unit, a plurality of context information, wherein each context information includes a context entity identifier for distinguishing a context entity from other context entities, various information representing a state of the context entity, and association information; receive a request for information representing the state of a first context entity; instruct a context generation unit to, in response to the received request, from said context holding unit, extract the context information of the first context entity, extract the context information of a second context entity which is registered as the association information in the context information of the first context entity, and execute, at least once, a process of extracting the context information of a third context entity which is registered as the association information in the extracted context information excluding the context information of the first context entity, but not registered as the association information in the context information of the first context entity, to determine, as the information representing the state of the first context entity, the information contained in any of the extracted context information; and send back the information determined by said generation context unit to respond to the request.
16. A non-transitory computer-readable medium having computer-readable instructions stored thereon that, upon execution by a processor, cause the processor to: record, in a context holding unit, a plurality of context information, wherein each context information includes a context entity identifier for distinguishing a context entity from other context entities, various information representing a state of the context entity, and association information; receive a request for information representing the state of a first context entity; instruct a context generation unit to, in response to the received request, from said context holding unit, extract the context information of the first context entity, extract the context information of a second context entity which is registered as the association information in the context information of the first context entity, and execute, at least once, a process of extracting the context information of a third context entity which is registered as the association information in the extracted context information excluding the context information of the first context entity, but not registered as the association information in the context information of the first context entity, to determine, as the information representing the state of the first context entity, the information contained in any of the extracted context information; and send back the information determined by said generation context unit to respond to the request. 19. The non-transitory computer-readable medium according to claim 16 , further comprising instructions to collect context information via a network, and, when information containing a first context entity identifier and a second context entity identifier has been collected, add one of the context entity identifiers, as the association information, to the context information containing the other context entity identifier.
0.556367
8,910,117
1
2
1. A method of setting customized policy for version control, comprising the steps of: generating, in response to detecting a user selection of a version control option, at least one executable version control customized policy entity that provides source code file processing capabilities according to the detected selection of the version control option; associating the generated at least one executable version control customized policy entity with a project or user to create one of a project-customized and a user-customized version control policy association, respectively, where the at least one executable version control customized policy entity is executed as source code files are processed in association with the respective project or user; and saving the generated at least one executable version control customized policy entity and information of the associated project or user.
1. A method of setting customized policy for version control, comprising the steps of: generating, in response to detecting a user selection of a version control option, at least one executable version control customized policy entity that provides source code file processing capabilities according to the detected selection of the version control option; associating the generated at least one executable version control customized policy entity with a project or user to create one of a project-customized and a user-customized version control policy association, respectively, where the at least one executable version control customized policy entity is executed as source code files are processed in association with the respective project or user; and saving the generated at least one executable version control customized policy entity and information of the associated project or user. 2. The method of claim 1 , where the generated at least one executable version control customized policy entity comprises at least one item selected from a group consisting of a generated project-customized and user-customized: Code Formatting policy, Document Summary Generating policy, Copyright information validation policy, Metadata Replacement policy, Public API Protection policy, Adding Header to New Added Source File policy, Smart Merging policy, Information Update Tagging policy, Exporting for Different Platform policy, Setting Version for Specific User policy, Confliction Notifying policy, and a combination thereof.
0.5
5,402,504
18
36
18. In a digital processing system, a method of processing a binary text image to identify and distinguish a location of a first type style, said image containing at least a first region of said first type style and a second region of a second type style, comprising the step of eroding said binary text image with a first structuring element to provide a first destination image, using said first destination image to form a second destination image containing substantially only said first type style from said text image wherein the step of forming a second destination image further comprises the steps of, i) forming a seed image from said first destination image; said seed image comprising ON pixels only within regions of said first type style, ii) growing said seed image into a mask image to provide a third destination image, wherein said step of growing said seed image into a mask image further comprises the steps of: a) saving said seed image as a saved image; b) dilating said seed image; c) ANDing an image from step b) with said mask image to produce a partially filled seed image; d) comparing said partially filled seed image with said saved image; e) if said seed image has not changed from a previous iteration, outputting said partially filled seed image as said third destination image; and f) if said seed image differs from a previous iteration, saving said partially filled seed as a saved image and returning to step b); and iii) ANDing said third destination image with said binary text image to provide said second destination image said first structuring element more likely to provide a hit in said first region than in said second region; remaining pixels used to identify said location of said first type style, and distinguish said location of said first type style from said second region of said second type style.
18. In a digital processing system, a method of processing a binary text image to identify and distinguish a location of a first type style, said image containing at least a first region of said first type style and a second region of a second type style, comprising the step of eroding said binary text image with a first structuring element to provide a first destination image, using said first destination image to form a second destination image containing substantially only said first type style from said text image wherein the step of forming a second destination image further comprises the steps of, i) forming a seed image from said first destination image; said seed image comprising ON pixels only within regions of said first type style, ii) growing said seed image into a mask image to provide a third destination image, wherein said step of growing said seed image into a mask image further comprises the steps of: a) saving said seed image as a saved image; b) dilating said seed image; c) ANDing an image from step b) with said mask image to produce a partially filled seed image; d) comparing said partially filled seed image with said saved image; e) if said seed image has not changed from a previous iteration, outputting said partially filled seed image as said third destination image; and f) if said seed image differs from a previous iteration, saving said partially filled seed as a saved image and returning to step b); and iii) ANDing said third destination image with said binary text image to provide said second destination image said first structuring element more likely to provide a hit in said first region than in said second region; remaining pixels used to identify said location of said first type style, and distinguish said location of said first type style from said second region of said second type style. 36. The method as recited in claim 18 wherein said first type style is a bold type style.
0.516304
8,015,506
2
3
2. The method of claim 1 wherein the placeholder included in the internal menu markup data of the media application specifies static references identifying the application package and the resource for the customized application page.
2. The method of claim 1 wherein the placeholder included in the internal menu markup data of the media application specifies static references identifying the application package and the resource for the customized application page. 3. The method of claim 2 wherein the customized menu item within the set of menu items for the menu display of the media application may be altered by replacing the application package and the resource identified by the static references with a different application package and a different resource that are identified by the static references.
0.5
7,885,847
1
12
1. In a workflow server that implements a structured workflow system, a computer-implemented method of controlling the workflow server, comprising: storing structured work items in a first data storage, wherein each work item is a data object representing a task to be performed by an actor, wherein an actor is one or more of a person, a group of persons and a machine, the structured work items being defined for a business process by a business process generator; storing local work items in a second data storage, wherein a local work item is a data object input in response to the operation of the business process and in response to a variance from the business process defined by the business process generator; processing work items and local work items by a workflow engine, including processing links between at least one work item and one local work item such that constraints on the business process set by the business process generator are followed in processing local work items, wherein the actor is assigned a first set of permissions representing security constraints on modifying and/or accessing elements of the first data storage, wherein an operator of the business process generator is assigned a second set of permissions, and wherein the second set of permissions includes at least one permission not included in the first set of permissions, wherein the business process includes a first phase and a second phase, wherein the second phase follows the first phase, wherein each of the work items and the structured work items is in one of the first phase and the second phase, and wherein the constraints on the business process are defineable by the actor to move a designated work item from the first phase to the second phase.
1. In a workflow server that implements a structured workflow system, a computer-implemented method of controlling the workflow server, comprising: storing structured work items in a first data storage, wherein each work item is a data object representing a task to be performed by an actor, wherein an actor is one or more of a person, a group of persons and a machine, the structured work items being defined for a business process by a business process generator; storing local work items in a second data storage, wherein a local work item is a data object input in response to the operation of the business process and in response to a variance from the business process defined by the business process generator; processing work items and local work items by a workflow engine, including processing links between at least one work item and one local work item such that constraints on the business process set by the business process generator are followed in processing local work items, wherein the actor is assigned a first set of permissions representing security constraints on modifying and/or accessing elements of the first data storage, wherein an operator of the business process generator is assigned a second set of permissions, and wherein the second set of permissions includes at least one permission not included in the first set of permissions, wherein the business process includes a first phase and a second phase, wherein the second phase follows the first phase, wherein each of the work items and the structured work items is in one of the first phase and the second phase, and wherein the constraints on the business process are defineable by the actor to move a designated work item from the first phase to the second phase. 12. The method of claim 1 , wherein a second designated work item in the first phase is defineable by the actor to become an obsolete work item.
0.825666
7,801,644
1
5
1. A method for providing a generic robot architecture for robot control software, comprising: providing a hardware abstraction level configured for developing a plurality of hardware abstractions for defining, monitoring, and controlling a plurality of hardware modules available on a robot platform; providing a robot abstraction level configured for defining a plurality of robot attributes comprising at least one of the plurality of hardware abstractions; and providing a robot behavior level configured for defining a plurality of robot behaviors comprising at least one of the plurality of robot attributes; wherein: each robot attribute of the plurality is configured for substantially isolating the robot behaviors from the plurality of hardware abstractions; each hardware abstraction of the plurality is configured for substantially isolating the plurality of robot attributes from a corresponding hardware module of the plurality; at least two hardware abstractions are configured to provide substantially similar hardware information to at least one of the plurality of robot attributes; and the at least one of the plurality of robot attributes is configured to combine the hardware information from each of the at least two hardware abstractions to form attribute information for the at least one of the plurality of robot attributes and can disregard the hardware information from one of the at least two hardware abstractions in forming the attribute information.
1. A method for providing a generic robot architecture for robot control software, comprising: providing a hardware abstraction level configured for developing a plurality of hardware abstractions for defining, monitoring, and controlling a plurality of hardware modules available on a robot platform; providing a robot abstraction level configured for defining a plurality of robot attributes comprising at least one of the plurality of hardware abstractions; and providing a robot behavior level configured for defining a plurality of robot behaviors comprising at least one of the plurality of robot attributes; wherein: each robot attribute of the plurality is configured for substantially isolating the robot behaviors from the plurality of hardware abstractions; each hardware abstraction of the plurality is configured for substantially isolating the plurality of robot attributes from a corresponding hardware module of the plurality; at least two hardware abstractions are configured to provide substantially similar hardware information to at least one of the plurality of robot attributes; and the at least one of the plurality of robot attributes is configured to combine the hardware information from each of the at least two hardware abstractions to form attribute information for the at least one of the plurality of robot attributes and can disregard the hardware information from one of the at least two hardware abstractions in forming the attribute information. 5. The method of claim 1 , wherein the plurality of robot attributes are selected from the group consisting of robot health, camera view, resistance to motion, robot position, robot motion, robot attitude, robot bounding shape, and range.
0.772467
9,182,831
12
13
12. The method according to claim 11 , characterized in that, said sliding trajectory features include trajectory lengths of words and an word key point sequence, wherein said word key point sequence is an ordered combination of key points on the sliding trajectory of the word.
12. The method according to claim 11 , characterized in that, said sliding trajectory features include trajectory lengths of words and an word key point sequence, wherein said word key point sequence is an ordered combination of key points on the sliding trajectory of the word. 13. The method according to claim 12 , characterized in that, said key points include starting and ending key points as well as ordinary key points of the trajectory, wherein said ordinary key points are inflection points on the trajectory.
0.5
8,660,834
11
12
11. A system for classifying a user input, comprising: a user interface to receive a user input of Roman characters from one or more users and to provide possible Chinese queries that correspond to the user input; and one or more computers including a pinyin classifier configured to: identify a first ambiguous word in the user input, the first ambiguous word being identified as a string of the Roman characters that is both a non-pinyin word written in the Roman characters and a valid pinyin input of one or more pinyin syllables that correspond to an entry in a Chinese dictionary; determine that each of one or more words adjacent to the first ambiguous word, are classified as belonging to one of a pinyin context or belonging to a non-pinyin context; classify the first ambiguous word as one of a pinyin input or a non-pinyin word, the classification of the first ambiguous word being based on the classification of the one or more adjacent words, the ambiguous word being classified as a pinyin input in response to the one or more words adjacent to the first ambiguous word being classified as belonging to the pinyin context, and the first ambiguous word being classified as a non-pinyin word in response to the one or more words adjacent to the first ambiguous word being classified as belonging to the non-pinyin context; identify a second ambiguous word in the user input; determine that the second ambiguous word is located between a first word that is classified as belonging to the pinyin context and a second word that is classified as belonging to the non-pinyin context; determine a probability that the second ambiguous word corresponds to an entry in a Chinese dictionary; and classify the second ambiguous word based on the probability, the second ambiguous word being classified as a pinyin input when the probability meets a threshold probability.
11. A system for classifying a user input, comprising: a user interface to receive a user input of Roman characters from one or more users and to provide possible Chinese queries that correspond to the user input; and one or more computers including a pinyin classifier configured to: identify a first ambiguous word in the user input, the first ambiguous word being identified as a string of the Roman characters that is both a non-pinyin word written in the Roman characters and a valid pinyin input of one or more pinyin syllables that correspond to an entry in a Chinese dictionary; determine that each of one or more words adjacent to the first ambiguous word, are classified as belonging to one of a pinyin context or belonging to a non-pinyin context; classify the first ambiguous word as one of a pinyin input or a non-pinyin word, the classification of the first ambiguous word being based on the classification of the one or more adjacent words, the ambiguous word being classified as a pinyin input in response to the one or more words adjacent to the first ambiguous word being classified as belonging to the pinyin context, and the first ambiguous word being classified as a non-pinyin word in response to the one or more words adjacent to the first ambiguous word being classified as belonging to the non-pinyin context; identify a second ambiguous word in the user input; determine that the second ambiguous word is located between a first word that is classified as belonging to the pinyin context and a second word that is classified as belonging to the non-pinyin context; determine a probability that the second ambiguous word corresponds to an entry in a Chinese dictionary; and classify the second ambiguous word based on the probability, the second ambiguous word being classified as a pinyin input when the probability meets a threshold probability. 12. The system of claim 11 , wherein the pinyin classifier is further configured to classify the one or more words adjacent to the first ambiguous word as belonging to the pinyin context when the one or more words adjacent to the first ambiguous word are valid pinyin words and not valid non-pinyin words.
0.5
8,341,155
12
16
12. A computer system for providing intelligent recommendations of reusable software assets, the computer system comprising: one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices, wherein the one or more computer-readable, tangible storage devices comprise a plurality of semantic topic maps that define relationships between topics, wherein a topic represents one of a requirement and a reusable software asset, and, wherein the semantic topic map is written in accordance with a semantic framework using a Web ontology language; program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to provide guidance for selection of reusable software assets in designing a software solution; and program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to synthesize a semantic results graph from semantic topic maps determined as applicable to at least one user-provided search criteria, wherein the semantic results graph is a pictorial representation of semantic relationships between topics of the applicable semantic topic maps.
12. A computer system for providing intelligent recommendations of reusable software assets, the computer system comprising: one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices, wherein the one or more computer-readable, tangible storage devices comprise a plurality of semantic topic maps that define relationships between topics, wherein a topic represents one of a requirement and a reusable software asset, and, wherein the semantic topic map is written in accordance with a semantic framework using a Web ontology language; program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to provide guidance for selection of reusable software assets in designing a software solution; and program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to synthesize a semantic results graph from semantic topic maps determined as applicable to at least one user-provided search criteria, wherein the semantic results graph is a pictorial representation of semantic relationships between topics of the applicable semantic topic maps. 16. The computer system of claim 12 , further comprising: program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to allow creation and modification of the plurality of semantic topic maps.
0.701869
7,962,340
1
2
1. A method for processing acoustic data in accordance with a speech recognition system, the method comprising acts of: recording acoustic data in at least one recording medium; detecting, at a first time, an indication to start speech recognition processing, the first time corresponding to a first location of the recorded acoustic data recorded in the at least one recording medium; determining whether the acoustic data recorded at the first time at which the indication to start speech recognition processing was detected is likely to be in a silence region or a speech region; if it is determined that the acoustic data recorded at the first time is likely to be in a speech region, analyzing at least some of the recorded acoustic data before the first location to determine a starting location for speech recognition processing; and if it is determined that the acoustic data recorded at the first time is likely to be in a silence region, analyzing the recorded acoustic data only after the first location to determine a starting location for speech recognition processing.
1. A method for processing acoustic data in accordance with a speech recognition system, the method comprising acts of: recording acoustic data in at least one recording medium; detecting, at a first time, an indication to start speech recognition processing, the first time corresponding to a first location of the recorded acoustic data recorded in the at least one recording medium; determining whether the acoustic data recorded at the first time at which the indication to start speech recognition processing was detected is likely to be in a silence region or a speech region; if it is determined that the acoustic data recorded at the first time is likely to be in a speech region, analyzing at least some of the recorded acoustic data before the first location to determine a starting location for speech recognition processing; and if it is determined that the acoustic data recorded at the first time is likely to be in a silence region, analyzing the recorded acoustic data only after the first location to determine a starting location for speech recognition processing. 2. The method of claim 1 , further comprising: starting speech recognition processing of the recorded acoustic data at the first location without accessing the recorded acoustic data before the first location to determine a starting location for speech recognition processing, when it is determined that the acoustic data recorded at the first time is likely to be in a silence region.
0.629808
8,156,117
51
54
51. The method for removing information about objects of an arbitrary application domain from the system for storage and retrieval of a plurality of information objects according to claim 1 , comprising the steps of: a) for AUS to be removed, considering all neighboring active units of storage according to logical connections and selecting one candidate AUS, which is the closest by the metric to the AUS to be removed, b) excluding the AUS to be removed from the logical storage network, c) substituting a candidate AUS for the removed AUS and assigning all logical connections of the removed AUS to the candidate AUS by modifying records in the link lists of the candidate AUS and all neighboring AUSs accordingly, and d) recalculating metrics for all logical links of the candidate AUS.
51. The method for removing information about objects of an arbitrary application domain from the system for storage and retrieval of a plurality of information objects according to claim 1 , comprising the steps of: a) for AUS to be removed, considering all neighboring active units of storage according to logical connections and selecting one candidate AUS, which is the closest by the metric to the AUS to be removed, b) excluding the AUS to be removed from the logical storage network, c) substituting a candidate AUS for the removed AUS and assigning all logical connections of the removed AUS to the candidate AUS by modifying records in the link lists of the candidate AUS and all neighboring AUSs accordingly, and d) recalculating metrics for all logical links of the candidate AUS. 54. The method according to claim 51 , wherein the metric is a metric distance between two IOs defined as a matrix of size n 1 ×n 2 : {ρ(T 1 ,r 1 ,T 2 ,r 2 )} n 1× n 2 , where T 1 , T 2 are rooted trees, representing the intrinsic structure of compared IOs, r 1 , r 2 are two nodes (from T 1 and T 2 respectively), designated as temporary roots, n 1 , n 2 denote the number of nodes in the structures of the first and second IO respectively; therewith ρ(T 1 ,r 1 ,T 2 ,r 2 )=(c(T 1 ,r 1 ,T 2 ,r 2 )) α , where c(T 1 ,r 1 ,T 2 ,r 2 ) is the similarity measure equal to the power (number of nodes) of the largest subtree common for two compared IO trees, isomorphically transformed relative to the designated temporary roots r 1 and r 2 respectively, and α is a numeric parameter assuming values α<−1.
0.5
8,832,066
12
14
12. The system of claim 1 wherein said output consists of a Boolean value.
12. The system of claim 1 wherein said output consists of a Boolean value. 14. The system of claim 12 wherein said updated data set consists of entities coupled with said entity attributes for which such output is false.
0.5
8,112,478
1
10
1. A system, comprising: a data store, embodied on a non-transitory computer readable medium, configured to store at least one discussion forum message and at least one email message in a data structure that is accessible to both an email logic and a discussion forum logic, where a discussion forum message is a post to a discussion forum; and a coordination logic operably connected to the data store, the coordination logic a being configured to provide shared access to the discussion forum message for both the email logic and the discussion forum logic, where the shared access provided by the coordination logic for the email logic includes providing the ability to perform one or more of, reading a discussion forum message, replying to a discussion forum message, deleting a discussion forum message, restoring a discussion forum message, blocking a discussion forum message, and tracing a thread associated with a discussion forum message using the email logic, to maintain read status consistency for the discussion forum message in both the email logic and the discussion forum logic, where the read status consistency is maintained by one of updating a field in a data structure, manipulating a value in a database, and manipulating a value in the email logic or the discussion forum logic, and to honor threading information associated with the discussion forum message, where the threading information is used to maintain discussion forum messages in a tree structure in the email logic as organized in the discussion forum logic.
1. A system, comprising: a data store, embodied on a non-transitory computer readable medium, configured to store at least one discussion forum message and at least one email message in a data structure that is accessible to both an email logic and a discussion forum logic, where a discussion forum message is a post to a discussion forum; and a coordination logic operably connected to the data store, the coordination logic a being configured to provide shared access to the discussion forum message for both the email logic and the discussion forum logic, where the shared access provided by the coordination logic for the email logic includes providing the ability to perform one or more of, reading a discussion forum message, replying to a discussion forum message, deleting a discussion forum message, restoring a discussion forum message, blocking a discussion forum message, and tracing a thread associated with a discussion forum message using the email logic, to maintain read status consistency for the discussion forum message in both the email logic and the discussion forum logic, where the read status consistency is maintained by one of updating a field in a data structure, manipulating a value in a database, and manipulating a value in the email logic or the discussion forum logic, and to honor threading information associated with the discussion forum message, where the threading information is used to maintain discussion forum messages in a tree structure in the email logic as organized in the discussion forum logic. 10. The system of claim 1 , the coordination logic being configured to perform one or more of, enforcing a policy, enforcing a privilege, controlling visibility of a message, and controlling membership in a discussion forum.
0.586716
8,266,158
24
27
24. The computer readable media of claim 23 further comprising displaying a plurality of modification options based on said rule analysis.
24. The computer readable media of claim 23 further comprising displaying a plurality of modification options based on said rule analysis. 27. The computer readable media of claim 24 , wherein the modification options comprise a plurality of links allowing correction of the user generated content item upon selection of the link.
0.551643
10,146,774
6
7
6. The system of claim 5 , wherein the target content group is selected from a plurality of predetermined sub-content groups.
6. The system of claim 5 , wherein the target content group is selected from a plurality of predetermined sub-content groups. 7. The system of claim 6 , wherein the plurality of predetermined sub-content groups are automatically generated based on clustering of documents of a content group into subgroups that are similar to each other.
0.5
7,949,957
1
4
1. An edit selection control article of manufacture comprising: a combo box coupled to a list of entries of full textual length; an edit box coupled to said combo box within the edit selection control and configured to display a selected one of said entries; and, list management logic executing in memory of a computer coupled to said edit box and programmed to accept through said edit box as an alternative selection to said list of entries, a manually specified entry; the edit selection control having a structure defined by a dynamic markup language for use in a markup language document; and, selection transformation logic coupled to said edit box and programmed to transform said selected one of said entries into a hidden value and to return the computed value to a calling application based upon the selected one of the entries.
1. An edit selection control article of manufacture comprising: a combo box coupled to a list of entries of full textual length; an edit box coupled to said combo box within the edit selection control and configured to display a selected one of said entries; and, list management logic executing in memory of a computer coupled to said edit box and programmed to accept through said edit box as an alternative selection to said list of entries, a manually specified entry; the edit selection control having a structure defined by a dynamic markup language for use in a markup language document; and, selection transformation logic coupled to said edit box and programmed to transform said selected one of said entries into a hidden value and to return the computed value to a calling application based upon the selected one of the entries. 4. The edit selection control of claim 1 , further comprising keyboard navigation logic for navigating the edit selection control.
0.577922
8,280,740
14
15
14. The system of claim 13 , wherein the biometric voice analyzer: calculates a logarithmic distance; and evaluates a threshold for determining when the first plurality of bins of the personal histogram is filled.
14. The system of claim 13 , wherein the biometric voice analyzer: calculates a logarithmic distance; and evaluates a threshold for determining when the first plurality of bins of the personal histogram is filled. 15. The system of claim 14 , wherein the threshold is adapted based on a user's voice.
0.909664
9,558,189
7
13
7. A system of user-directed production and distribution of content in archived media files comprising: a computing environment including at least one non-transitory computer-readable storage medium having program instructions stored therein and at least one computer processor operable to execute the program instructions to execute a plurality of data processing modules, the plurality of data processing modules including: a media import module embodied in a processor specifically configured to ingest a plurality of user media files from one or more of the user's computer-based files, the user's mobile device-based files, and the user's account with an online file storage service, and from one or more third party sources; a media archive module embodied in a processor specifically configured to archive the plurality of user media files provided by or at the direction of the user in a disparate user media library; a profile generation module embodied in a processor specifically configured to create a user profile from user-specified characteristics identified from one or more of user interaction via a graphical user interface to collect user-provided preferences and inferred user preferences collected from information in the plurality of user media files; one or more modules embodied in at least one processor specifically configured to associate content in the plurality of user media files with one or more media tags based on data extracted from each user media file and on the user profile developed from the user-provided preferences and the inferred user preferences, compile a plurality of inferences from the one or more media tags by associating specific data points to each user media file and associating inference groupings based on the specific data points and the user profile to adaptively relate the content in the plurality of user media files for a user-controlled production and distribution of the content over one or more devices designated by the user, learn additional associations of inference groupings from at least one of continued user interaction and continued ingest of user media files to continuously modify a set of sequences from the associations of inference groupings from additional user preferences and additional data extracted from the continued ingest of user media files, and define one or more dynamic sequence streams comprised of the adaptively-related content from the modified inferences developed from the additional associations of the inference groupings and associate the one or more dynamic sequence streams with the adaptively-related content to distribute a private, varying production of the adaptively-related content to the one or more devices under direction of the user, so that the adaptively-related content is assigned to at least one specific device in the one or more devices designated by the user or to a specific location of a device in the one or more devices designated by the user; and a stream delivery module embodied in a processor specifically configured to initiate delivery of the private, varying production of the adaptively-related content for distribution to one or more user-designated devices.
7. A system of user-directed production and distribution of content in archived media files comprising: a computing environment including at least one non-transitory computer-readable storage medium having program instructions stored therein and at least one computer processor operable to execute the program instructions to execute a plurality of data processing modules, the plurality of data processing modules including: a media import module embodied in a processor specifically configured to ingest a plurality of user media files from one or more of the user's computer-based files, the user's mobile device-based files, and the user's account with an online file storage service, and from one or more third party sources; a media archive module embodied in a processor specifically configured to archive the plurality of user media files provided by or at the direction of the user in a disparate user media library; a profile generation module embodied in a processor specifically configured to create a user profile from user-specified characteristics identified from one or more of user interaction via a graphical user interface to collect user-provided preferences and inferred user preferences collected from information in the plurality of user media files; one or more modules embodied in at least one processor specifically configured to associate content in the plurality of user media files with one or more media tags based on data extracted from each user media file and on the user profile developed from the user-provided preferences and the inferred user preferences, compile a plurality of inferences from the one or more media tags by associating specific data points to each user media file and associating inference groupings based on the specific data points and the user profile to adaptively relate the content in the plurality of user media files for a user-controlled production and distribution of the content over one or more devices designated by the user, learn additional associations of inference groupings from at least one of continued user interaction and continued ingest of user media files to continuously modify a set of sequences from the associations of inference groupings from additional user preferences and additional data extracted from the continued ingest of user media files, and define one or more dynamic sequence streams comprised of the adaptively-related content from the modified inferences developed from the additional associations of the inference groupings and associate the one or more dynamic sequence streams with the adaptively-related content to distribute a private, varying production of the adaptively-related content to the one or more devices under direction of the user, so that the adaptively-related content is assigned to at least one specific device in the one or more devices designated by the user or to a specific location of a device in the one or more devices designated by the user; and a stream delivery module embodied in a processor specifically configured to initiate delivery of the private, varying production of the adaptively-related content for distribution to one or more user-designated devices. 13. The system of claim 7 , wherein the one or more modules embodied in at least one processor is specifically configured to construct a set of sequences from the plurality of inferences by associating inference sequences based on the user profile.
0.578231
7,769,234
16
17
16. The apparatus according to claim 15 , wherein the extraction section is adapted to select a graphic that makes the element parameter to be found within the corresponding parameter range from the document image and consolidate a plurality of ruled line elements that make the consolidation parameter to be found within the corresponding parameter range to generate the ruled line candidate.
16. The apparatus according to claim 15 , wherein the extraction section is adapted to select a graphic that makes the element parameter to be found within the corresponding parameter range from the document image and consolidate a plurality of ruled line elements that make the consolidation parameter to be found within the corresponding parameter range to generate the ruled line candidate. 17. The apparatus according to claim 16 , wherein the ruled line is a broken ruled line; the parameter range of the element parameter is defined by a threshold value for sizes of circumscribed rectangles of black pixel link components; and the extraction section being is adapted to extract the black pixel link components from a document image expressed by a binary system and select the black pixel link components that make the element parameter to be found within the corresponding parameter range as ruled line elements.
0.565397
8,527,543
2
3
2. The system of claim 1 , wherein the statement classifier is further configured to detect patterns in the database statements and to group the database statements together based on the detected patterns.
2. The system of claim 1 , wherein the statement classifier is further configured to detect patterns in the database statements and to group the database statements together based on the detected patterns. 3. The system of claim 2 , wherein the statement classifier is further configured to detect the patterns by at least determining whether a sequence of selected ones of the database statements reoccurs.
0.5
8,145,579
1
5
1. A method for estimating a labor cost to reconcile semantic conflicts between data schema terms used in different data sources, the method comprising the steps of: a computer estimating a labor cost for mapping, to shared ontology terms, respective pairs of the data schema terms having semantic conflicts with each other, the computer system estimating the labor cost based on at least five of the following: (a) a number of the data sources that contain the data schema terms having the semantic conflicts, (b) an approximate number of the data schema terms in each of the data sources, (c) an approximate labor cost for implementing the shared ontology terms for each of the data sources, (d) an approximate labor cost to manually map to the shared ontology terms a percent of the data schema terms in each of the data sources, (e) an approximate labor cost to validate a percent of the mappings from the data schema terms to the shared ontology terms, (f) an approximate labor cost to perform functional computation for a percent of the mappings from the data schema terms to the shared ontology terms, and (g) an approximate labor cost to perform structural heterogeneity semantic mapping between a percent of the data schema terms and the shared ontology terms; and the computer displaying on a monitor the estimated labor cost for the mapping, to the shared ontology terms, the data schema terms having semantic conflicts with each other.
1. A method for estimating a labor cost to reconcile semantic conflicts between data schema terms used in different data sources, the method comprising the steps of: a computer estimating a labor cost for mapping, to shared ontology terms, respective pairs of the data schema terms having semantic conflicts with each other, the computer system estimating the labor cost based on at least five of the following: (a) a number of the data sources that contain the data schema terms having the semantic conflicts, (b) an approximate number of the data schema terms in each of the data sources, (c) an approximate labor cost for implementing the shared ontology terms for each of the data sources, (d) an approximate labor cost to manually map to the shared ontology terms a percent of the data schema terms in each of the data sources, (e) an approximate labor cost to validate a percent of the mappings from the data schema terms to the shared ontology terms, (f) an approximate labor cost to perform functional computation for a percent of the mappings from the data schema terms to the shared ontology terms, and (g) an approximate labor cost to perform structural heterogeneity semantic mapping between a percent of the data schema terms and the shared ontology terms; and the computer displaying on a monitor the estimated labor cost for the mapping, to the shared ontology terms, the data schema terms having semantic conflicts with each other. 5. The method of claim 1 further comprising the step of: the computer estimating a labor cost to create an information wrapper to map terms in unstructured text to structured terms in a table-structured database.
0.902574
9,866,645
19
29
19. A non-transitory computer-readable medium encoded with instructions for causing a processing system to execute steps for generating actionable push notifications, comprising: receiving, by a notification server, a trigger message from a third party server; determining, by the notification server, user information associated with a user in response to the trigger message from the third party server; evaluating, by the notification server, the user information to determine one or more notification rules defined by the user, wherein the one or more notification rules indicate one or more circumstances under which the user should receive actionable notification messages; based on the trigger message and the one or more notification rules defined by the user, determining, by the notification server, that an actionable notification message should be sent to the user; based on the user information, determining, by the notification server, a user device associated with the user; in response to the determination that the actionable notification message should be sent to the user, generating, by the notification server, the actionable notification message having one or more actionable options operatively related to the actionable notification message; and transmitting, by the notification server, the actionable notification message and the one or more associated actionable options to the user device associated with the user, wherein the actionable notification message causes the user device to display a graphical user interface including a notification message corresponding to the actionable notification message and one or more user interface components corresponding to the one or more actionable options.
19. A non-transitory computer-readable medium encoded with instructions for causing a processing system to execute steps for generating actionable push notifications, comprising: receiving, by a notification server, a trigger message from a third party server; determining, by the notification server, user information associated with a user in response to the trigger message from the third party server; evaluating, by the notification server, the user information to determine one or more notification rules defined by the user, wherein the one or more notification rules indicate one or more circumstances under which the user should receive actionable notification messages; based on the trigger message and the one or more notification rules defined by the user, determining, by the notification server, that an actionable notification message should be sent to the user; based on the user information, determining, by the notification server, a user device associated with the user; in response to the determination that the actionable notification message should be sent to the user, generating, by the notification server, the actionable notification message having one or more actionable options operatively related to the actionable notification message; and transmitting, by the notification server, the actionable notification message and the one or more associated actionable options to the user device associated with the user, wherein the actionable notification message causes the user device to display a graphical user interface including a notification message corresponding to the actionable notification message and one or more user interface components corresponding to the one or more actionable options. 29. The non-transitory computer-readable medium of claim 19 , further comprising instructions for causing the processing system to execute steps, including: determining, by the notification server, whether to generate the actionable notification message based on one or more notification rules defined by the user.
0.63908
8,005,806
11
18
11. A computer-readable medium tangibly embodying a computer program, the computer program comprising: storing, in at least one data store, context identified from a previous experience with an information item, the stored context comprising information and events associated with the information item, event relationships among the events and an event type of each event, the stored context relates the information item and at least one of the events that occurred during the previous experience with the information item; receiving a request to search the stored context to identify the information item, the request comprising at least a portion of the stored context including the at least one event that occurred during the previous experience with the information item, the event type of the at least one event, and at least one of the event relationships; searching the stored context using the at least a portion of the stored context included in the search request to identify the information item.
11. A computer-readable medium tangibly embodying a computer program, the computer program comprising: storing, in at least one data store, context identified from a previous experience with an information item, the stored context comprising information and events associated with the information item, event relationships among the events and an event type of each event, the stored context relates the information item and at least one of the events that occurred during the previous experience with the information item; receiving a request to search the stored context to identify the information item, the request comprising at least a portion of the stored context including the at least one event that occurred during the previous experience with the information item, the event type of the at least one event, and at least one of the event relationships; searching the stored context using the at least a portion of the stored context included in the search request to identify the information item. 18. The computer-readable medium of claim 11 , wherein the information item is an instant message.
0.727778
7,624,277
20
23
20. A method of generating a human interactive proof for use in distinguishing a human from a machine, wherein a server has a memory storing computer-executable instructions, for performing the method, said computer-executable instructions comprising: defining a configurable difficulty factor, said difficulty factor representing a level of difficulty in computerized character recognition; selecting a plurality of characters from a predefined set of available characters; altering each of the selected characters individually to inhibit computerized character recognition; concatenating the altered characters into a character string, wherein each of the characters of said character string have a particular coloring; performing an operation to the original image, said operation altering the original image according to the defined difficulty factor to further alter the character string and to further inhibit computerized character recognition, said operation adding random arcs to the original image, at least one of said random arcs altering the particular coloring of a segment of at least one of the characters of the character string at least one of said random arcs linking a plurality of the characters; and generating a resulting image from the altered original image, said resulting image to be rendered to a user as a test.
20. A method of generating a human interactive proof for use in distinguishing a human from a machine, wherein a server has a memory storing computer-executable instructions, for performing the method, said computer-executable instructions comprising: defining a configurable difficulty factor, said difficulty factor representing a level of difficulty in computerized character recognition; selecting a plurality of characters from a predefined set of available characters; altering each of the selected characters individually to inhibit computerized character recognition; concatenating the altered characters into a character string, wherein each of the characters of said character string have a particular coloring; performing an operation to the original image, said operation altering the original image according to the defined difficulty factor to further alter the character string and to further inhibit computerized character recognition, said operation adding random arcs to the original image, at least one of said random arcs altering the particular coloring of a segment of at least one of the characters of the character string at least one of said random arcs linking a plurality of the characters; and generating a resulting image from the altered original image, said resulting image to be rendered to a user as a test. 23. The method of claim 20 further comprising delivering the resulting image to a client for rendering to the user in response to a user request for access to a server via the client, said client and said server being coupled to a data communication network.
0.628242
10,134,131
1
4
1. A method, comprising: receiving, by a computing device, a target image of a target biological cell having a target phenotype; obtaining, by the computing device, a semantic embedding associated with the target image, wherein the semantic embedding associated with the target image is generated using a machine-learned, deep metric network model; obtaining, by the computing device for each of a plurality of candidate images of candidate biological cells each having a respective candidate phenotype, a semantic embedding associated with the respective candidate image, wherein the semantic embedding associated with the respective candidate image is generated using the machine-learned, deep metric network model; determining, by the computing device, a similarity score for each candidate image, wherein determining the similarity score for a respective candidate image comprises computing, by the computing device, a vector distance in a multi-dimensional space described by the semantic embeddings between the respective candidate image and the target image, and wherein the similarity score for each candidate image represents a degree of similarity between the target phenotype and the respective candidate phenotype; determining, by the computing device, a threshold similarity score; and determining, by the computing device, those candidate images having similarity scores that satisfy the threshold similarity score, wherein the target phenotype is a healthy phenotype, wherein the candidate images having similarity scores that satisfy the threshold similarity score have respective candidate phenotypes corresponding to the healthy phenotype, and wherein those candidate images having similarity scores that do not satisfy the threshold similarity score have respective candidate phenotypes corresponding to an unhealthy phenotype.
1. A method, comprising: receiving, by a computing device, a target image of a target biological cell having a target phenotype; obtaining, by the computing device, a semantic embedding associated with the target image, wherein the semantic embedding associated with the target image is generated using a machine-learned, deep metric network model; obtaining, by the computing device for each of a plurality of candidate images of candidate biological cells each having a respective candidate phenotype, a semantic embedding associated with the respective candidate image, wherein the semantic embedding associated with the respective candidate image is generated using the machine-learned, deep metric network model; determining, by the computing device, a similarity score for each candidate image, wherein determining the similarity score for a respective candidate image comprises computing, by the computing device, a vector distance in a multi-dimensional space described by the semantic embeddings between the respective candidate image and the target image, and wherein the similarity score for each candidate image represents a degree of similarity between the target phenotype and the respective candidate phenotype; determining, by the computing device, a threshold similarity score; and determining, by the computing device, those candidate images having similarity scores that satisfy the threshold similarity score, wherein the target phenotype is a healthy phenotype, wherein the candidate images having similarity scores that satisfy the threshold similarity score have respective candidate phenotypes corresponding to the healthy phenotype, and wherein those candidate images having similarity scores that do not satisfy the threshold similarity score have respective candidate phenotypes corresponding to an unhealthy phenotype. 4. The method of claim 1 , further comprising training the machine-learned, deep metric network model using unsupervised learning.
0.960984
9,338,188
6
12
6. A method, comprising: an identity manager to manage a plurality of user identities and to determine whether any user identity satisfies security policy requirements; a user agent providing at least one privacy preference relative to at least one user identity; the user agent receiving user selections indicating at least one privacy preference-related input pertaining to the user identity wherein the user identity is represented by at least one information card used in completing an online transaction with a relying party; the user agent generating at least one privacy preference, using the user selections; the user agent furnishing the at least one generated privacy preference; the user agent evaluating at least one privacy preference against a privacy policy associated with an online transaction and obtained from the relying party, the evaluating using the at least one privacy preference of any category referencing at least one required attribute; wherein upon the identity manager determining the user identity satisfies the security policy; a host computer providing the at least one information card representing the user identity to the relying party.
6. A method, comprising: an identity manager to manage a plurality of user identities and to determine whether any user identity satisfies security policy requirements; a user agent providing at least one privacy preference relative to at least one user identity; the user agent receiving user selections indicating at least one privacy preference-related input pertaining to the user identity wherein the user identity is represented by at least one information card used in completing an online transaction with a relying party; the user agent generating at least one privacy preference, using the user selections; the user agent furnishing the at least one generated privacy preference; the user agent evaluating at least one privacy preference against a privacy policy associated with an online transaction and obtained from the relying party, the evaluating using the at least one privacy preference of any category referencing at least one required attribute; wherein upon the identity manager determining the user identity satisfies the security policy; a host computer providing the at least one information card representing the user identity to the relying party. 12. The method of claim 6 , further comprises the user agent determining an acceptability of the privacy policy, using the evaluation.
0.817439
8,234,193
7
8
7. The method of claim 6 wherein survey responses include electing to join one or more groups associated with the one or more social network-based platforms and the organization or the third party organization.
7. The method of claim 6 wherein survey responses include electing to join one or more groups associated with the one or more social network-based platforms and the organization or the third party organization. 8. The method of claim 7 wherein the election to join one or more groups takes effect automatically.
0.5
4,460,973
5
6
5. An electronic translator of the type having an input device for inputting words and directing output of words and a memory means from which a first word or words represented in a first language are retrieved in response to a second word or words represented in a second language equivalent to the first word or words, the first and second words being stored in the memory means, wherein the improvement comprises: marking means responsive to the input device for marking at least one selected data item of a plurality of data items as stored in the memory means each representing the second word or words to differentiate each selected data item from other data items in the second language stored in the memory means; additional memory means for storing additional word data added to the at least one selected data item of the plurality of data items, so that an original part of the at least one selected data item is replaced by the additional word data; and output means responsive to a command from the input device for selectively outputting only the at least one data item which is marked by the marking means and which includes the additional word data.
5. An electronic translator of the type having an input device for inputting words and directing output of words and a memory means from which a first word or words represented in a first language are retrieved in response to a second word or words represented in a second language equivalent to the first word or words, the first and second words being stored in the memory means, wherein the improvement comprises: marking means responsive to the input device for marking at least one selected data item of a plurality of data items as stored in the memory means each representing the second word or words to differentiate each selected data item from other data items in the second language stored in the memory means; additional memory means for storing additional word data added to the at least one selected data item of the plurality of data items, so that an original part of the at least one selected data item is replaced by the additional word data; and output means responsive to a command from the input device for selectively outputting only the at least one data item which is marked by the marking means and which includes the additional word data. 6. The translator of claim 5, wherein when the additional word data is stored in the memory means for storing the plurality of data items each representing the second word or words, the additional memory means being adapted to store the serial number of the additional word data in the memory means.
0.5
9,230,130
1
7
1. A method executed by an electronic signature service (ESS) computing device, the method comprising: receiving an electronic signature document and associating a custody transfer rule with the electronic signature document from a client device associated with a first user, the custody transfer rule comprising a data structure used by the ESS computing device and further comprising: data identifying users in a custody chain for the electronic signature document; and data identifying an event to transition custody of the electronic signature document from a first user of the custody chain to a second user of the custody chain, the custody of the electronic signature document comprising an access right with respect to the electronic signature document, and the event comprising a response to an electronic signature request; transmitting the electronic signature request to a client device associated with a third user not included in the custody chain; in response to detecting the event, transferring custody of the electronic signature document from the first user to the second user according to the custody transfer rule; and storing data indicating the transfer of custody of the electronic signature document to prevent the client device associated with the first user from accessing the electronic signature document according to the access right with respect to the electronic signature document, and to allow access to the electronic signature document according to the access right with respect to the electronic signature document to a client device associated with the second user.
1. A method executed by an electronic signature service (ESS) computing device, the method comprising: receiving an electronic signature document and associating a custody transfer rule with the electronic signature document from a client device associated with a first user, the custody transfer rule comprising a data structure used by the ESS computing device and further comprising: data identifying users in a custody chain for the electronic signature document; and data identifying an event to transition custody of the electronic signature document from a first user of the custody chain to a second user of the custody chain, the custody of the electronic signature document comprising an access right with respect to the electronic signature document, and the event comprising a response to an electronic signature request; transmitting the electronic signature request to a client device associated with a third user not included in the custody chain; in response to detecting the event, transferring custody of the electronic signature document from the first user to the second user according to the custody transfer rule; and storing data indicating the transfer of custody of the electronic signature document to prevent the client device associated with the first user from accessing the electronic signature document according to the access right with respect to the electronic signature document, and to allow access to the electronic signature document according to the access right with respect to the electronic signature document to a client device associated with the second user. 7. The method of claim 1 , wherein the access right comprises a right to delete the electronic signature document from the ESS computing device.
0.725191
8,620,793
1
11
1. A method for providing a workflow management system, said method comprising: maintaining a database configured to store translation segments, said translation segments identifying target language phrases in a target language that corresponds to source language phrases in a source language; identifying translators connected to a network using a translator identity for each of a plurality of different translators; storing translation segments submitted by a plurality of different translators; storing information by the database, the information identifying a translator that has submitted a translation segment of the submitted translation segments, by storing the translation segment in association with the translator identity of the translator that has submitted the translation segment; identifying translation segments for inclusion in at least partially translated content; delivering as part of a translation task said at least partially translated content electronically, said at least partially translated content including segments translated into said target language; and tracking the translator identity associated with a translation segment when the translation segment is selected for use in said at least partially translated content.
1. A method for providing a workflow management system, said method comprising: maintaining a database configured to store translation segments, said translation segments identifying target language phrases in a target language that corresponds to source language phrases in a source language; identifying translators connected to a network using a translator identity for each of a plurality of different translators; storing translation segments submitted by a plurality of different translators; storing information by the database, the information identifying a translator that has submitted a translation segment of the submitted translation segments, by storing the translation segment in association with the translator identity of the translator that has submitted the translation segment; identifying translation segments for inclusion in at least partially translated content; delivering as part of a translation task said at least partially translated content electronically, said at least partially translated content including segments translated into said target language; and tracking the translator identity associated with a translation segment when the translation segment is selected for use in said at least partially translated content. 11. The method for providing a workflow management system according to claim 1 , further comprising identifying one of said translation segments from said database by an approximate match between content to be translated and a source language phrase of a stored translation segment.
0.783077
7,970,783
13
18
13. A business intelligence system comprising: a computer; one or more data sources configured to store business intelligence data; a metadata model configured to store model objects, wherein the model objects represent the data sources, and wherein the model objects include macrotized database language expressions, the macrotized database language expressions having a set of macro functions, wherein the at least one macro function is defined to prompt for user inputs and accept the user inputs during execution of the one or more macro functions; and a query engine executable on the computer, wherein the query engine is configured to translate the macrotized database language expressions into a set of valid database language expressions based on a return value of at least a first macro function of the set of macro functions, wherein the return value of the at least one of the macro functions includes at least one of the user inputs accepted during execution of the one or more macro functions.
13. A business intelligence system comprising: a computer; one or more data sources configured to store business intelligence data; a metadata model configured to store model objects, wherein the model objects represent the data sources, and wherein the model objects include macrotized database language expressions, the macrotized database language expressions having a set of macro functions, wherein the at least one macro function is defined to prompt for user inputs and accept the user inputs during execution of the one or more macro functions; and a query engine executable on the computer, wherein the query engine is configured to translate the macrotized database language expressions into a set of valid database language expressions based on a return value of at least a first macro function of the set of macro functions, wherein the return value of the at least one of the macro functions includes at least one of the user inputs accepted during execution of the one or more macro functions. 18. The business intelligence system of claim 13 , wherein the user inputs include at least one of a set of user-selected prompt responses, an indication of a language in which to produce a business report, and database connection information.
0.80082
9,971,772
11
17
11. A system comprising: control circuitry configured to: send voice input data received by a media device to a speech-to-text service; receive, by the media device from the speech-to-text service, a textual representation of at least a portion of the voice input data; generate a signature based on at least a portion of the textual representation, wherein the signature is a hash value; locate a particular data entry among a set of data entries by performing a search of the set of data entries for a data entry matching the signature generated based on the at least a portion of the textual representation, each data entry of the set of data entries specifying a mapping between a given signature and one or more media device actions; update the set of data entries by storing the mapping between the signature and the at least a portion of the textual representation; in response to locating the particular data entry among the set of data entries based on the generated signature, perform one or more particular media device actions associated with the particular data entry, the one or more particular media device actions including sending a media content query to a media search service; receive, by the media device, one or more content item listings based on the media content query; and generate for display at least a portion of the one or more content item listings.
11. A system comprising: control circuitry configured to: send voice input data received by a media device to a speech-to-text service; receive, by the media device from the speech-to-text service, a textual representation of at least a portion of the voice input data; generate a signature based on at least a portion of the textual representation, wherein the signature is a hash value; locate a particular data entry among a set of data entries by performing a search of the set of data entries for a data entry matching the signature generated based on the at least a portion of the textual representation, each data entry of the set of data entries specifying a mapping between a given signature and one or more media device actions; update the set of data entries by storing the mapping between the signature and the at least a portion of the textual representation; in response to locating the particular data entry among the set of data entries based on the generated signature, perform one or more particular media device actions associated with the particular data entry, the one or more particular media device actions including sending a media content query to a media search service; receive, by the media device, one or more content item listings based on the media content query; and generate for display at least a portion of the one or more content item listings. 17. The system of claim 11 , wherein the control circuitry is further configured, when receiving the one or more content item listings based on the media content query, to: determine a relevancy to the media content query of one or more content item listings based on a weighting of the one or more content item listings; and receive the one or more content item listings based upon the determined relevancy.
0.666121
9,501,744
3
6
3. The method of claim 1 , wherein the a priori classification engine, the a posteriori classification engine, and the heuristics engine are each operable to classify a communication.
3. The method of claim 1 , wherein the a priori classification engine, the a posteriori classification engine, and the heuristics engine are each operable to classify a communication. 6. The method of claim 3 , wherein the a posteriori classification engine is operable to determine a probability that the communication is a personal message.
0.512346
8,384,917
15
23
15. A system for font reproduction in electronic documents, comprising: a processor; an extraction mechanism for extracting pairs of consecutive characters from an image of a printed document; a pairs repository for storing the extracted pairs as images of the characters; and an electronic document creator for reproducing the printed document as an electronic document with text of overlapping extracted character pair images.
15. A system for font reproduction in electronic documents, comprising: a processor; an extraction mechanism for extracting pairs of consecutive characters from an image of a printed document; a pairs repository for storing the extracted pairs as images of the characters; and an electronic document creator for reproducing the printed document as an electronic document with text of overlapping extracted character pair images. 23. The system as claimed in claim 15 , wherein the electronic document creator includes an extrapolator for extrapolating character pairs to create missing character pairs.
0.691071