sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
8. A recording medium comprising: a plurality of text sub data units included in text data to be presented with main data and recorded separately from the main data, the plurality of text sub data units being preloaded into a memory before presented and the preloaded text sub data units being processed based on attribute information which includes language information regarding a font of the text sub data units; and a navigation information file including navigation information for accessing the main data and including linking information that links the main data and the text sub data units, the navigation information file being separated from the text sub data units, wherein the navigation information file further includes language information specifying a language code of the text sub data units, and an index number of said text sub data units and, wherein the navigation information file further includes coding information for the main data and affecting the text data, and wherein the text data is processed based on the coding information.
|
8. A recording medium comprising: a plurality of text sub data units included in text data to be presented with main data and recorded separately from the main data, the plurality of text sub data units being preloaded into a memory before presented and the preloaded text sub data units being processed based on attribute information which includes language information regarding a font of the text sub data units; and a navigation information file including navigation information for accessing the main data and including linking information that links the main data and the text sub data units, the navigation information file being separated from the text sub data units, wherein the navigation information file further includes language information specifying a language code of the text sub data units, and an index number of said text sub data units and, wherein the navigation information file further includes coding information for the main data and affecting the text data, and wherein the text data is processed based on the coding information. 9. The recording medium of claim 8 , wherein the recording medium is an optical disc.
| 0.734816 |
9. A non-transitory computer-readable storage medium storing one or more sequences of instructions, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of: receiving, at a search engine, a phonetically-spelled string; wherein the phonetically-spelled string is the result of transforming an audio input into the phonetically-spelled string that has not been converted into any predetermined set of correctly-spelled words; identifying one or more previously-submitted phonetically-spelled query strings from a plurality of other users based on the phonetically-spelled string; and generating a set of query results based, at least in part, on the phonetically-spelled string and on the one ore more previously-submitted phonetically-spelled query strings; wherein the steps of the method are performed by one or more computing devices.
|
9. A non-transitory computer-readable storage medium storing one or more sequences of instructions, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of: receiving, at a search engine, a phonetically-spelled string; wherein the phonetically-spelled string is the result of transforming an audio input into the phonetically-spelled string that has not been converted into any predetermined set of correctly-spelled words; identifying one or more previously-submitted phonetically-spelled query strings from a plurality of other users based on the phonetically-spelled string; and generating a set of query results based, at least in part, on the phonetically-spelled string and on the one ore more previously-submitted phonetically-spelled query strings; wherein the steps of the method are performed by one or more computing devices. 16. The non-transitory computer-readable storage medium of claim 9 , wherein the set of query results is ordered based, at least in part, on past strings recorded by the search engine.
| 0.581365 |
15. A method for transcribing a segment of data that includes speech in one or more environments and non-speech data, comprising: inputting the data to a segmenter and producing a series of segments, each segment being given a type identifier tag selected from a predetermined set of classes, wherein it is assumed that the input data is produced by a parallel combination of models, each model corresponding to one of the predetermined classes, the identifier tag assigned to a segment being the class identifier tag of the model that gives the segment the highest probability, subject to certain constraints, wherein a number of classes that the acoustic input can be classified into are identified that represent the most acoustically dissimilar classes possible and, wherein the process of creating the models comprises identifying a feature space for the individual predetermined classes; and transcribing each type identifier tagged segment using a specific system created for that type.
|
15. A method for transcribing a segment of data that includes speech in one or more environments and non-speech data, comprising: inputting the data to a segmenter and producing a series of segments, each segment being given a type identifier tag selected from a predetermined set of classes, wherein it is assumed that the input data is produced by a parallel combination of models, each model corresponding to one of the predetermined classes, the identifier tag assigned to a segment being the class identifier tag of the model that gives the segment the highest probability, subject to certain constraints, wherein a number of classes that the acoustic input can be classified into are identified that represent the most acoustically dissimilar classes possible and, wherein the process of creating the models comprises identifying a feature space for the individual predetermined classes; and transcribing each type identifier tagged segment using a specific system created for that type. 18. The method of claim 15, wherein the feature space for the model for non-speech is created by: taking a window of input speech every 10 milliseconds and computing the log of the energy in logarithmically spaced frequency bands; computing a linear discriminant to separate out non-speech and speech.
| 0.561049 |
1. A computer-implemented method, comprising: defining one or more personalized categories, wherein each personalized category comprises one or more terms; identifying at least one of said one or more personalized categories that is associated with a user query; identifying one or more terms that are associated with said user query and with said at least one identified personalized category; adding said identified one or more terms to said user query, thereby creating an expanded query; and presenting the expanded query to the user for at least one of acceptance of the expanded query, rejection of the expanded query, and modification of the expanded query.
|
1. A computer-implemented method, comprising: defining one or more personalized categories, wherein each personalized category comprises one or more terms; identifying at least one of said one or more personalized categories that is associated with a user query; identifying one or more terms that are associated with said user query and with said at least one identified personalized category; adding said identified one or more terms to said user query, thereby creating an expanded query; and presenting the expanded query to the user for at least one of acceptance of the expanded query, rejection of the expanded query, and modification of the expanded query. 2. The method of claim 1 , wherein a user enters the user query.
| 0.644935 |
1. A computer-implemented method executed by one or more processors, the method comprising: receiving, by one or more processors, a query; obtaining, by one or more processors, a plurality of search results that are responsive to the query; obtaining, by one or more processors, content from a social networking service that is responsive to the query and related to a particular search result of the plurality of search results, the content comprising a post published to the social networking service; modifying, by one or more processors, the particular search result to provide a revised search result comprising a summary of the post from the social networking service, the summary comprising a portions of the content; providing, by one or more processors, for display the revised search result and an interface component, the interface component being provided with the revised search result; and receiving, by one or more processors, a request for interacting with the content, the request being provided through the interface component, and in response: modifying the revised search result to include all of the content of the post from the social networking service to display the complete post with the particular search result.
|
1. A computer-implemented method executed by one or more processors, the method comprising: receiving, by one or more processors, a query; obtaining, by one or more processors, a plurality of search results that are responsive to the query; obtaining, by one or more processors, content from a social networking service that is responsive to the query and related to a particular search result of the plurality of search results, the content comprising a post published to the social networking service; modifying, by one or more processors, the particular search result to provide a revised search result comprising a summary of the post from the social networking service, the summary comprising a portions of the content; providing, by one or more processors, for display the revised search result and an interface component, the interface component being provided with the revised search result; and receiving, by one or more processors, a request for interacting with the content, the request being provided through the interface component, and in response: modifying the revised search result to include all of the content of the post from the social networking service to display the complete post with the particular search result. 5. The method of claim 1 , wherein the request for interacting with the content comprises commenting on the content from the social networking service.
| 0.665689 |
14. The system of claim 13, wherein the selectively extracting means extracts each section of the second language document which contains a corresponding word of each first language character string according the first and second language correspondence dictionary, and selectively extracts each corresponding second language character string according to a level of correspondence between a section of the first language document from which each first language character string is extracted and each section of the corresponding second language document to which each corresponding second language character string belongs.
|
14. The system of claim 13, wherein the selectively extracting means extracts each section of the second language document which contains a corresponding word of each first language character string according the first and second language correspondence dictionary, and selectively extracts each corresponding second language character string according to a level of correspondence between a section of the first language document from which each first language character string is extracted and each section of the corresponding second language document to which each corresponding second language character string belongs. 15. The system of claim 14, wherein the selectively extracting means extracts each corresponding second language character string from each section of the corresponding second language document which has a corresponding word for a context word in a section of the first language document from which each first language character string is extracted.
| 0.783971 |
1. A computer system for simulating a reconfigurable Lab-on-a-chip (“LoC”) device, the system comprising: a memory that stores binary data and software; and a processor in communication with the memory that: creates a specification file using a specification system stored in the memory, the specification file used to create a numerical model for a planned LoC configuration comprised of a plurality of microfluidic components within the reconfigurable LoC device, wherein the specification file comprises a list of microfluidic components, an attribute for at least one of the microfluidic components, and an interconnection among the microfluidic components, and wherein an authoring/editing tool creates and edits the specification file; executes a control design tool stored in the memory for creating and editing an operating language script, the operating language script for controlling the operation of the modeled LoC device; numerically simulates the operation of the model in real-time using a numerical simulation system stored in the memory, wherein the numerical simulation is derived from the specification file and the operating language script; and displays results of the numerical simulation of the simulated model using a data visualization system stored in the memory; wherein the specification system, control design tool, numerical simulation system, and data visualization system are integrated into a common software development system for system development, software development, control programming, real-time numerical simulation, and visualization the modeled LoC device.
|
1. A computer system for simulating a reconfigurable Lab-on-a-chip (“LoC”) device, the system comprising: a memory that stores binary data and software; and a processor in communication with the memory that: creates a specification file using a specification system stored in the memory, the specification file used to create a numerical model for a planned LoC configuration comprised of a plurality of microfluidic components within the reconfigurable LoC device, wherein the specification file comprises a list of microfluidic components, an attribute for at least one of the microfluidic components, and an interconnection among the microfluidic components, and wherein an authoring/editing tool creates and edits the specification file; executes a control design tool stored in the memory for creating and editing an operating language script, the operating language script for controlling the operation of the modeled LoC device; numerically simulates the operation of the model in real-time using a numerical simulation system stored in the memory, wherein the numerical simulation is derived from the specification file and the operating language script; and displays results of the numerical simulation of the simulated model using a data visualization system stored in the memory; wherein the specification system, control design tool, numerical simulation system, and data visualization system are integrated into a common software development system for system development, software development, control programming, real-time numerical simulation, and visualization the modeled LoC device. 8. The system of claim 1 , wherein the specification file comprises a list of interconnection among signal ports of the microfluidic components.
| 0.521687 |
1. A music messaging software-as-a-service platform, comprising: a computer hardware infrastructure accessible at a network domain and comprising: first program code that receives, from a sender, a set of first information, the set of first information including a message personalized for an intended recipient, together with non-audio data identifying a lyric phrase from an audio recording; an audio extraction engine that (i) receives the non-audio data identifying the lyric phrase together with an instance of the audio recording, (ii) identifies a portion of the audio recording where the lyric phrase is likely to be found at least in part by mapping each word in the lyric phrase to one and only vocal interval determined to exist in the audio recording, (iii) extracts the portion of the audio recording into a short snippet; and (iv) writes the short snippet into a database; and a message generator that combines a reference to the short snippet with the message to generate and output a music message note for the intended recipient; and second program code operative to cause delivery of the short snippet in response to receipt of data indicating that the reference is selected by the intended recipient.
|
1. A music messaging software-as-a-service platform, comprising: a computer hardware infrastructure accessible at a network domain and comprising: first program code that receives, from a sender, a set of first information, the set of first information including a message personalized for an intended recipient, together with non-audio data identifying a lyric phrase from an audio recording; an audio extraction engine that (i) receives the non-audio data identifying the lyric phrase together with an instance of the audio recording, (ii) identifies a portion of the audio recording where the lyric phrase is likely to be found at least in part by mapping each word in the lyric phrase to one and only vocal interval determined to exist in the audio recording, (iii) extracts the portion of the audio recording into a short snippet; and (iv) writes the short snippet into a database; and a message generator that combines a reference to the short snippet with the message to generate and output a music message note for the intended recipient; and second program code operative to cause delivery of the short snippet in response to receipt of data indicating that the reference is selected by the intended recipient. 14. The messaging software-as-a-service platform as described in claim 1 wherein the music message note also includes a link to facilitate purchase of the audio recording.
| 0.657371 |
19. The speech encoding/decoding system according to claim 18, wherein said recognition section includes an analysis frame generation section configured to divide said input speech signal into analysis frames, a feature extraction section configured to acquire a feature vector for each of the analysis frames, and a phonetic segment determination section configured to compute a similarity between said feature vector for each of the analysis frames and a feature template vector previously prepared for each phonetic segment to determine a phonetic segment of each of the analysis frames which is used to recognize the character information.
|
19. The speech encoding/decoding system according to claim 18, wherein said recognition section includes an analysis frame generation section configured to divide said input speech signal into analysis frames, a feature extraction section configured to acquire a feature vector for each of the analysis frames, and a phonetic segment determination section configured to compute a similarity between said feature vector for each of the analysis frames and a feature template vector previously prepared for each phonetic segment to determine a phonetic segment of each of the analysis frames which is used to recognize the character information. 20. The speech encoding/decoding system according to claim 19, wherein said phonetic segment determination section computes a Euclidean distance based on said feature vector and said feature template vector and determines a phonetic segment which minimizes said Euclidean distance as a phonetic segment of said analysis frames.
| 0.772248 |
1. A method comprising: receiving, at a computing device, a request to display information related to a first physical entity; transforming, via the computing device, the request into search data; dynamically applying, via the computing device, the search data to descriptive information related to a set of other physical entities known to a network, said application of the search data comprising deriving a subset of other physical entities matching the search data from the descriptive information related to the set of other known physical entities, the descriptive information corresponding to the other physical entities is analyzed as part of said deriving the subset of other physical entities that match the search data; ranking, via the computing device, the physical entities in the subset of other physical entities to form a ranked subset of physical entities, the ranked subset based upon the applied search data, the ranked subset comprising the descriptive information corresponding to the other physical entities of the subset; and presenting, via the computing device over the network, information related to the ranked subset of physical entities to a first user associated with a user computing device, the presenting of the ranked physical entities information being dependent upon user information stored in the network, the user information comprising data generated by the user, data associated with the user, and data associated with the request.
|
1. A method comprising: receiving, at a computing device, a request to display information related to a first physical entity; transforming, via the computing device, the request into search data; dynamically applying, via the computing device, the search data to descriptive information related to a set of other physical entities known to a network, said application of the search data comprising deriving a subset of other physical entities matching the search data from the descriptive information related to the set of other known physical entities, the descriptive information corresponding to the other physical entities is analyzed as part of said deriving the subset of other physical entities that match the search data; ranking, via the computing device, the physical entities in the subset of other physical entities to form a ranked subset of physical entities, the ranked subset based upon the applied search data, the ranked subset comprising the descriptive information corresponding to the other physical entities of the subset; and presenting, via the computing device over the network, information related to the ranked subset of physical entities to a first user associated with a user computing device, the presenting of the ranked physical entities information being dependent upon user information stored in the network, the user information comprising data generated by the user, data associated with the user, and data associated with the request. 21. The method of claim 1 , wherein the ranked subset of physical entities includes the first physical entity.
| 0.664554 |
10. A system comprising: a machine having a memory and at least one processor; and a memory storing instructions that, when executed by the at least one processor, causes the machine to perform operations comprising: accessing a plurality of social activity signals associated with a user and indicative of actions that are performed by the user and viewable by other users; receiving, from the user, user-entered text in a search field for a search engine; determining predicted queries based on the user-entered text and the plurality of social activity signal, each one of the predicted queries comprising predicted text and at least a portion of the user-entered text, the predicted text being absent from the user-entered text, the determining comprising: determining potential predicted queries based on the user-entered text; and assigning a corresponding predicted query value to each one of the potential predicted queries based on a determination for each potential predicted query of whether the potential predicted query corresponds to one of the social activity signals indicative of an action performed by the user that is viewable by other users, the assigning including: for each potential predicted query determined to correspond to one of the plurality of social activity signals indicative of an action performed by the user that is viewable by other users, determining a corresponding social activity type of the one of the plurality of social activity signals indicative of an action performed by the user that is viewable by other users; and for each potential predicted query determined to correspond to the one of the plurality of social activity signals, calculating the corresponding predicted query value based on a corresponding weight of the corresponding social activity type; and causing the predicted queries to be displayed, to the user, in an autocomplete user interface element of the search field.
|
10. A system comprising: a machine having a memory and at least one processor; and a memory storing instructions that, when executed by the at least one processor, causes the machine to perform operations comprising: accessing a plurality of social activity signals associated with a user and indicative of actions that are performed by the user and viewable by other users; receiving, from the user, user-entered text in a search field for a search engine; determining predicted queries based on the user-entered text and the plurality of social activity signal, each one of the predicted queries comprising predicted text and at least a portion of the user-entered text, the predicted text being absent from the user-entered text, the determining comprising: determining potential predicted queries based on the user-entered text; and assigning a corresponding predicted query value to each one of the potential predicted queries based on a determination for each potential predicted query of whether the potential predicted query corresponds to one of the social activity signals indicative of an action performed by the user that is viewable by other users, the assigning including: for each potential predicted query determined to correspond to one of the plurality of social activity signals indicative of an action performed by the user that is viewable by other users, determining a corresponding social activity type of the one of the plurality of social activity signals indicative of an action performed by the user that is viewable by other users; and for each potential predicted query determined to correspond to the one of the plurality of social activity signals, calculating the corresponding predicted query value based on a corresponding weight of the corresponding social activity type; and causing the predicted queries to be displayed, to the user, in an autocomplete user interface element of the search field. 13. The system of claim 10 , wherein the operations further comprise storing a mapping of social activity types to weights, each social activity type having a corresponding weight.
| 0.520555 |
40. A system for notating musical information comprising: a computer comprising an input, an output and memory containing computer readable code pertaining to musical information, wherein the musical information comprises: a plurality of sets, wherein each set comprises twelve notes each note corresponding to a musical pitch level; an alphanumeric symbol that is assigned to each of the twelve notes, wherein the alphanumeric symbol represents the musical pitch level; a vertical music staff on a sheet medium, the staff providing columnar marking spaces or blocks, the columns of making spaces or blocks delineated by vertical and horizontal lines, to create marking areas provided in the vertical staff for marking musical notes; a plurality of columnar musical staffs per sheet medium, where notation proceeds from the top of the left most staff from the top to the bottom and continues at the bottom of second left most staff from the bottom to the top, proceeding to the right most column in an up then down pattern; and marked sequences of the assigned musical values in the columnar marking space per finger, according to which finger is to play which musical structure, key, or position according to a musical timing and sequence.
|
40. A system for notating musical information comprising: a computer comprising an input, an output and memory containing computer readable code pertaining to musical information, wherein the musical information comprises: a plurality of sets, wherein each set comprises twelve notes each note corresponding to a musical pitch level; an alphanumeric symbol that is assigned to each of the twelve notes, wherein the alphanumeric symbol represents the musical pitch level; a vertical music staff on a sheet medium, the staff providing columnar marking spaces or blocks, the columns of making spaces or blocks delineated by vertical and horizontal lines, to create marking areas provided in the vertical staff for marking musical notes; a plurality of columnar musical staffs per sheet medium, where notation proceeds from the top of the left most staff from the top to the bottom and continues at the bottom of second left most staff from the bottom to the top, proceeding to the right most column in an up then down pattern; and marked sequences of the assigned musical values in the columnar marking space per finger, according to which finger is to play which musical structure, key, or position according to a musical timing and sequence. 44. The system of claim 40 , wherein the musical information is input into the computer readable storage using a sensor that monitors, scans for and accepts information from an external source.
| 0.894017 |
1. A method, comprising: providing a service oriented architecture comprising a first database and a second database of a Universal Description, Discovery, and Integration (UDDI) registry, wherein the first database is linked to the second database, and the second database of the UDDI registry comprises data entries that include information about web services; storing a user comment concerning at least one web service of the web services in the first database; determining an influence rating associated with an author of the user comment, wherein the influence rating is determined by a user score manager (USM) that interacts with the first database and an interface, and the USM is stored and executed on the UDDI registry; storing in the first database the influence rating associated with the author of the user comment; receiving a search query from a user for information about the at least one web service of the web services; retrieving the information, the user comment, and the influence rating associated with the at least one web service of the web services; receiving feedback from the user regarding the user comment; and determining an updated influence rating based upon the feedback and the influence rating.
|
1. A method, comprising: providing a service oriented architecture comprising a first database and a second database of a Universal Description, Discovery, and Integration (UDDI) registry, wherein the first database is linked to the second database, and the second database of the UDDI registry comprises data entries that include information about web services; storing a user comment concerning at least one web service of the web services in the first database; determining an influence rating associated with an author of the user comment, wherein the influence rating is determined by a user score manager (USM) that interacts with the first database and an interface, and the USM is stored and executed on the UDDI registry; storing in the first database the influence rating associated with the author of the user comment; receiving a search query from a user for information about the at least one web service of the web services; retrieving the information, the user comment, and the influence rating associated with the at least one web service of the web services; receiving feedback from the user regarding the user comment; and determining an updated influence rating based upon the feedback and the influence rating. 2. The method of claim 1 , wherein the data entries of the UDDI registry are from at least one of white pages, yellow pages, and green pages of the UDDI registry, and wherein the influence rating is stored in blue pages of the first database.
| 0.631651 |
4. The system according to claim 1 , wherein the type of the at least one relational form comprises a set of relational views.
|
4. The system according to claim 1 , wherein the type of the at least one relational form comprises a set of relational views. 5. The system according to claim 4 , wherein the transformational artifacts comprise at least one SQL/XML view definition statement.
| 0.959252 |
1. A computer-implemented method for mapping fields of an input document according to a first format, the method comprising: identifying, by execution of one or more processors, a plurality of first fields in the input document, wherein each first field includes an input descriptor and text content associated with the input descriptor; identifying, by execution of the one or more processors, a plurality of mapping rules wherein each mapping rule specifies characteristics associated with a target field in a target format, wherein the characteristics comprise a target descriptor and a lexical answer type identifying lexical traits to locate in the plurality of first fields of the input document; for each first field: evaluating, via one or more natural language processing techniques, semantic properties of the input descriptor against the plurality of mapping rules to determine whether the input descriptor is consistent with one of the target fields; evaluating, via one or more natural language processing techniques, semantic properties of the text content against the plurality of mapping rules to determine whether the text content is consistent with one of the target fields, based on the lexical answer type associated with the target field, and wherein evaluating further comprises: determining, for each mapping rule, a descriptor score associated with the input descriptor and a content score associated with the text content, the descriptor score and the content score indicating a likelihood that the respective input descriptor and text content match the characteristics specified in the mapping rule; and converging the descriptor score and the content score into a consolidated score based on a weighting between the descriptor score and the content score specified by the associated mapping rule; determining, based on evaluating the semantic properties of the input descriptor and the text content against the plurality of mapping rules, that the first field corresponds to a target field; and upon determining that the first field corresponds to the target field, defining a mapping from the first field to the corresponding target field; generating a normalized document by mapping the text content of each first field to the respective corresponding target field; and sending the generated normalized document to an extract-transform-load (ETL) system.
|
1. A computer-implemented method for mapping fields of an input document according to a first format, the method comprising: identifying, by execution of one or more processors, a plurality of first fields in the input document, wherein each first field includes an input descriptor and text content associated with the input descriptor; identifying, by execution of the one or more processors, a plurality of mapping rules wherein each mapping rule specifies characteristics associated with a target field in a target format, wherein the characteristics comprise a target descriptor and a lexical answer type identifying lexical traits to locate in the plurality of first fields of the input document; for each first field: evaluating, via one or more natural language processing techniques, semantic properties of the input descriptor against the plurality of mapping rules to determine whether the input descriptor is consistent with one of the target fields; evaluating, via one or more natural language processing techniques, semantic properties of the text content against the plurality of mapping rules to determine whether the text content is consistent with one of the target fields, based on the lexical answer type associated with the target field, and wherein evaluating further comprises: determining, for each mapping rule, a descriptor score associated with the input descriptor and a content score associated with the text content, the descriptor score and the content score indicating a likelihood that the respective input descriptor and text content match the characteristics specified in the mapping rule; and converging the descriptor score and the content score into a consolidated score based on a weighting between the descriptor score and the content score specified by the associated mapping rule; determining, based on evaluating the semantic properties of the input descriptor and the text content against the plurality of mapping rules, that the first field corresponds to a target field; and upon determining that the first field corresponds to the target field, defining a mapping from the first field to the corresponding target field; generating a normalized document by mapping the text content of each first field to the respective corresponding target field; and sending the generated normalized document to an extract-transform-load (ETL) system. 3. The method of claim 1 , wherein the target format is an Atom syndication format.
| 0.828571 |
9. The system of claim 8 , wherein: the content rating information indicates a presence of content identified as acceptable or objectionable; and the instructions cause the data processing apparatus to deny distribution of the graphical document under evaluation if the content rating information associated with the matching graphical document indicates the presence of content identified as objectionable.
|
9. The system of claim 8 , wherein: the content rating information indicates a presence of content identified as acceptable or objectionable; and the instructions cause the data processing apparatus to deny distribution of the graphical document under evaluation if the content rating information associated with the matching graphical document indicates the presence of content identified as objectionable. 10. The system of claim 9 , wherein the instructions cause the data processing apparatus to grant the distribution approval to the graphical document under evaluation if the content rating information associated with the matching graphical document indicates the presence of content identified as acceptable.
| 0.805628 |
9. The method of claim 8 , further comprising generating a second tile corresponding to the second piece of content.
|
9. The method of claim 8 , further comprising generating a second tile corresponding to the second piece of content. 10. The method of claim 9 , further comprising selecting third piece of content using the user characteristics information.
| 0.933121 |
1. A method for hierarchical sparse dictionary learning (“HiSDL”) to construct a learned dictionary regularized by an a priori over-complete dictionary, comprising: providing at least one a priori over-complete dictionary for regularization; performing sparse coding of the at least one a priori over-complete dictionary to provide a sparse coded dictionary; using a processor, updating the sparse coded dictionary with regularization using auxiliary variables to provide a learned dictionary; determining whether the learned dictionary converges to an input data set; and outputting the learned dictionary regularized by the at least one a priori over-complete dictionary when the learned dictionary converges to the input data set.
|
1. A method for hierarchical sparse dictionary learning (“HiSDL”) to construct a learned dictionary regularized by an a priori over-complete dictionary, comprising: providing at least one a priori over-complete dictionary for regularization; performing sparse coding of the at least one a priori over-complete dictionary to provide a sparse coded dictionary; using a processor, updating the sparse coded dictionary with regularization using auxiliary variables to provide a learned dictionary; determining whether the learned dictionary converges to an input data set; and outputting the learned dictionary regularized by the at least one a priori over-complete dictionary when the learned dictionary converges to the input data set. 8. The method of claim 1 , wherein updating the sparse coded dictionary further comprises eliminating obsolete atoms in the learned dictionary if any one atom in the input data set degenerates to zero.
| 0.644464 |
6. The system of claim 1 wherein the database of keyword models includes an ensemble of filters associated with each keyword in the database and the processor is configured to convolve the sparse set of phonetic impulses with the ensemble of filters and calculate a score vector based on the convolving of the sparse set of phonetic impulses with ensemble of filters.
|
6. The system of claim 1 wherein the database of keyword models includes an ensemble of filters associated with each keyword in the database and the processor is configured to convolve the sparse set of phonetic impulses with the ensemble of filters and calculate a score vector based on the convolving of the sparse set of phonetic impulses with ensemble of filters. 7. The system of claim 6 wherein the processor is further configured to identify keywords within the signal including speech based on the score vectors.
| 0.803106 |
10. The method of claim 1 , further comprising: detecting a first physical object; identifying the first detected physical object as a first character of the plurality of characters; detecting a second physical object; and identifying the second physical object as a second character of the plurality of characters, wherein: determining that the digital content of the virtual scene comprises a representation of at least one of the characters comprises determining that the digital content of the virtual scene comprises a representation of the first character and the second character, and accessing an indication of one or more context-based stimuli comprises determining a distance between the first physical character and the second physical character from the representation of the first physical object and the representation of the second physical object, and comparing the determined distance to a threshold.
|
10. The method of claim 1 , further comprising: detecting a first physical object; identifying the first detected physical object as a first character of the plurality of characters; detecting a second physical object; and identifying the second physical object as a second character of the plurality of characters, wherein: determining that the digital content of the virtual scene comprises a representation of at least one of the characters comprises determining that the digital content of the virtual scene comprises a representation of the first character and the second character, and accessing an indication of one or more context-based stimuli comprises determining a distance between the first physical character and the second physical character from the representation of the first physical object and the representation of the second physical object, and comparing the determined distance to a threshold. 13. The method of claim 10 , wherein the threshold is a value that is associated with one or more of the first character and the second character.
| 0.804157 |
1. A method comprising: identifying content of a document; identifying an advertisement to be displayed in the document; identifying one or more characteristics associated with the content; and modifying one or more characteristics of the advertisement based on the characteristics associated with the content of the document.
|
1. A method comprising: identifying content of a document; identifying an advertisement to be displayed in the document; identifying one or more characteristics associated with the content; and modifying one or more characteristics of the advertisement based on the characteristics associated with the content of the document. 7. The method of claim 1 , wherein identifying one or more characteristics associated with the content includes identifying a color scheme associated with the content, and wherein modifying one or more characteristics of the advertisement includes modifying a color scheme of the advertisement based on the color scheme associated with the content.
| 0.691696 |
1. A system for analyzing of a plurality of texts, the system comprising: A) a plurality of keywords stored in a non-transitory computer readable structure, each keyword of said plurality of keywords stored as a respective site of a plurality of sites, said structure including a plurality of branches, each branch having plurality of sub branches, a unique ordered combination of a branch and one or more sub branches leading to each said respective site; each branch of said plurality of branches and each sub branch of said plurality of sub branches being associated with one respective character string, each said keyword being the ordered combination of respective character strings associated with the unique ordered combination of branch and sub branches leading to said respective site and each branch of said plurality of branches being included in more than one said unique combination of a branch and one or more sub branches leading to more than one respective site; B) a plurality of databases including a respective database corresponding to each text of the plurality of texts; each said respective database including a plurality of counters including a respective incidence corresponding to each of said plurality of keywords; C) a computer configured for said analyzing text of said plurality of texts including a) reading a current character string from said one text starting at a start character and selecting from said plurality of branches a current branch associated with said character string, b) recursively navigating said structure according to said one text subsequent to said first character string; said recursively navigating including, i) further reading from said one text a sequential character string sequential to said current character string, ii) selecting from a plurality of sub branches of said current branch, a next branch associated with said sequential character string and iii) replacing said current character string with said sequential character string and replacing said current branch with said next branch and repeating said further reading and said selecting and said replacing until a current branch leads to an encountered site of said plurality of sites, c) incrementing in said respective database of said one text said respective incidence counter of a keyword when said keyword is found in said text starting at said start character by incrementing in said respective database of said one text said respective incidence counter of a keyword stored as said encountered site, e) designating a new start character in the one text and repeating said reading, said navigating, said incrementing and f) repeating said designating until for each of said plurality of keywords, said respective incidence counter indicates the number of times that said keyword appears in the one text; D) a plurality of score buffers including at least one respective score buffer for each said text; each said score buffer storing a computer modifiable value; and wherein said computer is further configured for updating said value stored in a respective score buffer for said one text dependent on a limitation on a value of said respective incidence counter of at least two of said plurality of keywords E) a rule counter and wherein said computer is further configured to set a value said rule counter dependent on at least two of said incidence counters, and wherein said updating is dependent on a value of said of rule counter.
|
1. A system for analyzing of a plurality of texts, the system comprising: A) a plurality of keywords stored in a non-transitory computer readable structure, each keyword of said plurality of keywords stored as a respective site of a plurality of sites, said structure including a plurality of branches, each branch having plurality of sub branches, a unique ordered combination of a branch and one or more sub branches leading to each said respective site; each branch of said plurality of branches and each sub branch of said plurality of sub branches being associated with one respective character string, each said keyword being the ordered combination of respective character strings associated with the unique ordered combination of branch and sub branches leading to said respective site and each branch of said plurality of branches being included in more than one said unique combination of a branch and one or more sub branches leading to more than one respective site; B) a plurality of databases including a respective database corresponding to each text of the plurality of texts; each said respective database including a plurality of counters including a respective incidence corresponding to each of said plurality of keywords; C) a computer configured for said analyzing text of said plurality of texts including a) reading a current character string from said one text starting at a start character and selecting from said plurality of branches a current branch associated with said character string, b) recursively navigating said structure according to said one text subsequent to said first character string; said recursively navigating including, i) further reading from said one text a sequential character string sequential to said current character string, ii) selecting from a plurality of sub branches of said current branch, a next branch associated with said sequential character string and iii) replacing said current character string with said sequential character string and replacing said current branch with said next branch and repeating said further reading and said selecting and said replacing until a current branch leads to an encountered site of said plurality of sites, c) incrementing in said respective database of said one text said respective incidence counter of a keyword when said keyword is found in said text starting at said start character by incrementing in said respective database of said one text said respective incidence counter of a keyword stored as said encountered site, e) designating a new start character in the one text and repeating said reading, said navigating, said incrementing and f) repeating said designating until for each of said plurality of keywords, said respective incidence counter indicates the number of times that said keyword appears in the one text; D) a plurality of score buffers including at least one respective score buffer for each said text; each said score buffer storing a computer modifiable value; and wherein said computer is further configured for updating said value stored in a respective score buffer for said one text dependent on a limitation on a value of said respective incidence counter of at least two of said plurality of keywords E) a rule counter and wherein said computer is further configured to set a value said rule counter dependent on at least two of said incidence counters, and wherein said updating is dependent on a value of said of rule counter. 7. The system of claim 1 , further comprising a further sub-branch of said current branch leading to said encountered site and wherein said recursively navigating, continues with said further sub branch as said current branch.
| 0.501809 |
8. A method for removing boilerplate text in one or more electronic documents, the method comprising: receiving, by a processor via an input device coupled to the processor, a first text block from a user, wherein the first text block corresponds to at least one of a largest-maximal repeat (LMR) or a super-maximal repeat (SMR); receiving, by the processor, an array of repeats, wherein the array of repeats comprises a list of repeats of one or more text blocks occurring at one or more positions in the one or more electronic documents; detecting, by the processor, one or more occurrences of the first text block in the one or more electronic documents based on the array of repeats; identifying, in the one or more electronic documents by the processor, a second text block in vicinity of an occurrence of the first text block based on a maximum length of a gap between the first text block and the second text block, such that the second text block and the first text block are repeated together, at least two times in the one or more electronic documents; determining, by the processor, one or more text motifs in the one or more electronic documents, wherein each of the one or more text motifs is a combination of the first text block and the second text block; checking, by the processor, for extension of the one or more text motifs if a number of text blocks in the one or more text motifs is less than a maximum number of text blocks in the one or more text motifs, wherein the checking for extension further comprises using the one or more text motifs as a new text block and repeating the identifying, and determining steps for the new text block until the maximum number of text blocks is reached; removing, by the processor, the one or more text motifs from each of the one or more electronic documents; and creating, by the processor, a template by collating the one or more extracted text motifs.
|
8. A method for removing boilerplate text in one or more electronic documents, the method comprising: receiving, by a processor via an input device coupled to the processor, a first text block from a user, wherein the first text block corresponds to at least one of a largest-maximal repeat (LMR) or a super-maximal repeat (SMR); receiving, by the processor, an array of repeats, wherein the array of repeats comprises a list of repeats of one or more text blocks occurring at one or more positions in the one or more electronic documents; detecting, by the processor, one or more occurrences of the first text block in the one or more electronic documents based on the array of repeats; identifying, in the one or more electronic documents by the processor, a second text block in vicinity of an occurrence of the first text block based on a maximum length of a gap between the first text block and the second text block, such that the second text block and the first text block are repeated together, at least two times in the one or more electronic documents; determining, by the processor, one or more text motifs in the one or more electronic documents, wherein each of the one or more text motifs is a combination of the first text block and the second text block; checking, by the processor, for extension of the one or more text motifs if a number of text blocks in the one or more text motifs is less than a maximum number of text blocks in the one or more text motifs, wherein the checking for extension further comprises using the one or more text motifs as a new text block and repeating the identifying, and determining steps for the new text block until the maximum number of text blocks is reached; removing, by the processor, the one or more text motifs from each of the one or more electronic documents; and creating, by the processor, a template by collating the one or more extracted text motifs. 9. The method of claim 8 further comprising checking, by the processor, whether the number of occurrences of a text motif is greater than a minimum number of occurrences of the text motif defined by the user, wherein the one or more text motifs is removed if the number of occurrences of the text motif is greater than the minimum number of occurrences of the text motif.
| 0.505 |
7. The view matching system of claim 6 , the constraint difference component generates the minimal difference query from the naïve representation and eliminates identified redundant or contradictory queries.
|
7. The view matching system of claim 6 , the constraint difference component generates the minimal difference query from the naïve representation and eliminates identified redundant or contradictory queries. 8. The view matching system of claim 7 , further comprising an inclusion dependency component that eliminates one or more queries from the minimal difference query based on inclusion dependencies.
| 0.907599 |
214. The method of claim 180 , further comprising: displaying the matching resume on a display screen.
|
214. The method of claim 180 , further comprising: displaying the matching resume on a display screen. 217. The method of claim 214 , wherein the display includes a first portion, and a second portion, the first portion showing a list of said at least one resume, the second portion showing the matching resume.
| 0.959501 |
8. A computer-implemented system comprising: one or more computers; one or more data storage devices coupled to the one or more computers and storing instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: while receiving a text input entered into a search engine query input field by a user, the query input field displayed in a map user interface having a viewport displaying a portion of a map at a particular zoom level, and before the user has submitted the text input as a search query to a search engine: determining the particular zoom level and a geographical location associated with the portion of the map displayed in the viewport at the particular zoom level; obtaining a plurality of query suggestions based at least in part on the received text input; grouping at least some of the query suggestions based on a common primary query term shared by the query suggestions, wherein the grouped query suggestions include one or more refinement terms that refine the common primary query term, wherein the one or more refinement terms that refine the common primary query term are selected based, at least in part, on the particular zoom level of the map as presented in the viewport while the text input is being received, and the geographical location displayed in the viewport while the text input is being received; and transmitting a set of the plurality of query suggestions to a client device for presentation to the user, wherein the set includes the grouped query suggestions that are presented as a group with the common primary query term presented in a prominent position and the one or more refinement terms presented in subordinate positions relative to the common primary query term and wherein the common primary query term and the one or more refinement terms are each user-selectable.
|
8. A computer-implemented system comprising: one or more computers; one or more data storage devices coupled to the one or more computers and storing instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: while receiving a text input entered into a search engine query input field by a user, the query input field displayed in a map user interface having a viewport displaying a portion of a map at a particular zoom level, and before the user has submitted the text input as a search query to a search engine: determining the particular zoom level and a geographical location associated with the portion of the map displayed in the viewport at the particular zoom level; obtaining a plurality of query suggestions based at least in part on the received text input; grouping at least some of the query suggestions based on a common primary query term shared by the query suggestions, wherein the grouped query suggestions include one or more refinement terms that refine the common primary query term, wherein the one or more refinement terms that refine the common primary query term are selected based, at least in part, on the particular zoom level of the map as presented in the viewport while the text input is being received, and the geographical location displayed in the viewport while the text input is being received; and transmitting a set of the plurality of query suggestions to a client device for presentation to the user, wherein the set includes the grouped query suggestions that are presented as a group with the common primary query term presented in a prominent position and the one or more refinement terms presented in subordinate positions relative to the common primary query term and wherein the common primary query term and the one or more refinement terms are each user-selectable. 9. The computer-implemented system of claim 8 , wherein the received text input does not comprise a complete word and the common primary query term comprises a suggested word completion of the received text input.
| 0.809524 |
27. The system of claim 25 , wherein the system further comprises: a data communication network coupled to the server device; and a data processing device programmed to transmit the search query over the data communication network to the server device.
|
27. The system of claim 25 , wherein the system further comprises: a data communication network coupled to the server device; and a data processing device programmed to transmit the search query over the data communication network to the server device. 36. The system of claim 27 , wherein identifying user interaction with the first document comprises determining a click-through ratio for the first document.
| 0.856213 |
1. A method, comprising: receiving, from an imaging device of an electronic device, a first image of a target object, wherein the receiving comprises: receiving a series of images of the target object, and selecting, from the series of images, the first image; analyzing, by one or more processors using an image recognition application, the first image to identify a first feature of the target object, wherein the analyzing comprises: comparing information from the first image with information from a model database to identify a subset of objects containing similar features, obtaining information from the database regarding one or more locations of one or more specific features, and analyzing the first image to seek the one or more locations and determine whether the target object as shown in the first image matches any of the objects in the subset; accessing, by one or more of the processors, the database to identify one or more models of objects that include the first feature; and in response to identifying more than one model: identifying, by one or more of the processors, that one of the identified models includes a distinguishing point, determining, by one or more of the processors by analyzing a second image of the target object, that the target object comprises the distinguishing point, and in response to determining that the target object comprises the distinguishing point, retrieving one or more document files that correspond to the identified model that contains the distinguishing point.
|
1. A method, comprising: receiving, from an imaging device of an electronic device, a first image of a target object, wherein the receiving comprises: receiving a series of images of the target object, and selecting, from the series of images, the first image; analyzing, by one or more processors using an image recognition application, the first image to identify a first feature of the target object, wherein the analyzing comprises: comparing information from the first image with information from a model database to identify a subset of objects containing similar features, obtaining information from the database regarding one or more locations of one or more specific features, and analyzing the first image to seek the one or more locations and determine whether the target object as shown in the first image matches any of the objects in the subset; accessing, by one or more of the processors, the database to identify one or more models of objects that include the first feature; and in response to identifying more than one model: identifying, by one or more of the processors, that one of the identified models includes a distinguishing point, determining, by one or more of the processors by analyzing a second image of the target object, that the target object comprises the distinguishing point, and in response to determining that the target object comprises the distinguishing point, retrieving one or more document files that correspond to the identified model that contains the distinguishing point. 2. The method of claim 1 , wherein determining that the target object comprises the distinguishing point comprises: generating an instruction to make one or more adjustments to the imaging device; receiving the second image after the one or more adjustments have been made; and analyzing the second image to determine whether the second image includes the distinguishing point.
| 0.601428 |
11. A data verification system for automatically verifying the integrity of a database of program schedule information for an electronic television program guide comprising: storage means for storing a database of television program schedule listings, said database comprising a plurality of data fields for a plurality of television stations; means for selecting a station list file for comparison against said plurality of television stations in said database; data processing means for automatically comparing said station list file against said data fields for said plurality of stations in said database to determine if each station in said file is included in said database; and editing means for editing said database.
|
11. A data verification system for automatically verifying the integrity of a database of program schedule information for an electronic television program guide comprising: storage means for storing a database of television program schedule listings, said database comprising a plurality of data fields for a plurality of television stations; means for selecting a station list file for comparison against said plurality of television stations in said database; data processing means for automatically comparing said station list file against said data fields for said plurality of stations in said database to determine if each station in said file is included in said database; and editing means for editing said database. 14. The system of claim 11 wherein said data processing means further automatically analyzes said data fields for said selected station in said station list file for editorial errors.
| 0.702408 |
3. A digital circuit design assist system comprising a plurality of digital circuit design assist systems according to claim 2, wherein said hardware description language simulation means in each of said digital circuit design assist systems independently verifies each of said hardware units and each of said software units of said digital circuit from said functional model, said structural model, said language model and said software.
|
3. A digital circuit design assist system comprising a plurality of digital circuit design assist systems according to claim 2, wherein said hardware description language simulation means in each of said digital circuit design assist systems independently verifies each of said hardware units and each of said software units of said digital circuit from said functional model, said structural model, said language model and said software. 8. A digital circuit design assist system according to claim 3, which further comprises at least one: a coding generation means for generating said structural model through a text editor by coding input; and a graphic generation means for generating said structural model through a block editor for expressing each of a plurality of components constituting each said hardware unit by an inherent symbol, drawing and arranging said symbols on a screen, drawing wiring between said arranged components, and processing therefor.
| 0.816787 |
1. A computer-readable medium storing instructions for controlling a computing device to customize a voice in a multi-media message created by a sender for a recipient, the multi-media message comprising a text message from the sender to be delivered by an animated entity, the instructions comprising: receiving from the sender inserted voice emoticons, which may be repeated, into the text message associated with parameters of a voice used by an animated entity to deliver the text message; and transmitting the text message such that a recipient device can deliver the multi-media message at a variable level associated with a number of times a respective voice emoticon is repeated.
|
1. A computer-readable medium storing instructions for controlling a computing device to customize a voice in a multi-media message created by a sender for a recipient, the multi-media message comprising a text message from the sender to be delivered by an animated entity, the instructions comprising: receiving from the sender inserted voice emoticons, which may be repeated, into the text message associated with parameters of a voice used by an animated entity to deliver the text message; and transmitting the text message such that a recipient device can deliver the multi-media message at a variable level associated with a number of times a respective voice emoticon is repeated. 2. The computer-readable medium of claim 1 , wherein the voice emoticons comprise emoticons associated with at least one of voice stress, volume, pause, and emotion.
| 0.56851 |
18. A system comprising: a memory having a pre-defined logical schema stored thereon; and a processor configured with logic to: provide the pre-defined logical schema to a user of a database system, wherein the pre-defined logical schema is mapped to at least two relational database entities of different databases; receive a logical query for stored data of the databases from the user, wherein the logical query is written in an object-oriented query language utilizing the pre-defined logical schema, and comprises two or more predicates and an operator specifying an action to take with one or more of the predicates; in response to receiving the logical query, interpret the logical query using the pre-defined logical schema to determine which of the relational database entities is a subject of the logical query, and which of the relational database entities is associated with each predicate; request the database of each determined relational database entity of the logical query to: translate each of the associated predicates of that database in the logical query into a query language specific to that database, wherein at least two different databases translate an associated predicate; and apply an authorization rule with each of the associated predicates of that database in the logical query, wherein the authorization rule identifies unauthorized data; receive a translated predicate query for each determined predicate of the logical query from its associated database of the relational database entity, wherein each translated predicate query is written in a relational query language specific to the associated database and is a translation of one of the object-oriented predicates in the logical query; combine each translated predicate query received from the databases of the determined relational database entities into a master query using the operator; execute the master query against the databases of the relational database entities that are subjects of the logical query; in response to executing the master query, receive a query result set from the databases of the at least two relational database entities; and provide the query result set to the user, wherein the query result set lacks the unauthorized data.
|
18. A system comprising: a memory having a pre-defined logical schema stored thereon; and a processor configured with logic to: provide the pre-defined logical schema to a user of a database system, wherein the pre-defined logical schema is mapped to at least two relational database entities of different databases; receive a logical query for stored data of the databases from the user, wherein the logical query is written in an object-oriented query language utilizing the pre-defined logical schema, and comprises two or more predicates and an operator specifying an action to take with one or more of the predicates; in response to receiving the logical query, interpret the logical query using the pre-defined logical schema to determine which of the relational database entities is a subject of the logical query, and which of the relational database entities is associated with each predicate; request the database of each determined relational database entity of the logical query to: translate each of the associated predicates of that database in the logical query into a query language specific to that database, wherein at least two different databases translate an associated predicate; and apply an authorization rule with each of the associated predicates of that database in the logical query, wherein the authorization rule identifies unauthorized data; receive a translated predicate query for each determined predicate of the logical query from its associated database of the relational database entity, wherein each translated predicate query is written in a relational query language specific to the associated database and is a translation of one of the object-oriented predicates in the logical query; combine each translated predicate query received from the databases of the determined relational database entities into a master query using the operator; execute the master query against the databases of the relational database entities that are subjects of the logical query; in response to executing the master query, receive a query result set from the databases of the at least two relational database entities; and provide the query result set to the user, wherein the query result set lacks the unauthorized data. 22. The system of claim 18 , the processor being further configured with the logic to: save the query result set in the database system.
| 0.909574 |
1. A computer-implemented method for moderating proposed edits to a map comprising: storing a plurality of proposed edits, each proposed edit comprising an addition, deletion or change of a map feature, each map feature located in a geographic area and associated with an at least one attribute; receiving from a reviewer a selection of one of a first geographic area or a first attribute; selecting a plurality of proposed edits responsive to the geographic area matching the first geographic area or the at least one attribute matching the first attribute; placing the plurality of proposed edits in a queue associated with the reviewer; receiving from the reviewer a request to share the queue with a second reviewer; and associating the queue with the second reviewer.
|
1. A computer-implemented method for moderating proposed edits to a map comprising: storing a plurality of proposed edits, each proposed edit comprising an addition, deletion or change of a map feature, each map feature located in a geographic area and associated with an at least one attribute; receiving from a reviewer a selection of one of a first geographic area or a first attribute; selecting a plurality of proposed edits responsive to the geographic area matching the first geographic area or the at least one attribute matching the first attribute; placing the plurality of proposed edits in a queue associated with the reviewer; receiving from the reviewer a request to share the queue with a second reviewer; and associating the queue with the second reviewer. 4. The method of claim 1 wherein the queue comprises proposed edits proposed by a user who is a reviewer of proposed edits and further comprising: determining a rank for the proposed edits proposed by a user who is a reviewer of proposed edits based on the number of edits reviewed by the user proposing the proposed edit.
| 0.728623 |
35. A computer-implemented data processing system for auditing data access events in a context management framework, comprising: a plurality of software applications executing in the data processing system; a context manager coupled to the software applications that manages context data exchanges between the software applications; a centralized storage location, coupled to the context manager, that stores a central record of the context data exchanges; and an auditor, coupled to the centralized storage location, that retrieves information from the centralized storage location indicative of data access events occurring in the data processing system, wherein the software applications comply with the CCOW standard set; and wherein the data processing system further comprises a data formatter, arranged to convert data passing between the context manager and the centralized storage location between a first format, supported by the CCOW standard set, and a second format.
|
35. A computer-implemented data processing system for auditing data access events in a context management framework, comprising: a plurality of software applications executing in the data processing system; a context manager coupled to the software applications that manages context data exchanges between the software applications; a centralized storage location, coupled to the context manager, that stores a central record of the context data exchanges; and an auditor, coupled to the centralized storage location, that retrieves information from the centralized storage location indicative of data access events occurring in the data processing system, wherein the software applications comply with the CCOW standard set; and wherein the data processing system further comprises a data formatter, arranged to convert data passing between the context manager and the centralized storage location between a first format, supported by the CCOW standard set, and a second format. 42. The system of claim 35 , further comprising an intermediate collection platform disposed between the context manager and the centralized storage location.
| 0.514313 |
24. A computer program product comprising: a computer usable data carrier having computer readable instructions embodied therein for causing a computer to perform a method, said method comprising: receiving a first search result from a first open-site network search responsive to a first query generated responsive to a search type selection and a category term; developing an initial page set responsive to said first search result; selecting a range pattern responsive to said search type selection; extracting a plurality of candidate phrases from said initial page set responsive to said range pattern and said category term; filtering said plurality of candidate phrases, said filtering comprising: combining said plurality of candidate phrases into a single list; identifying duplicate candidate phrases in said single list; and removing said duplicate candidate phrases from said plurality of candidate phrases; constructing a first mode query for one of said plurality of candidate phrases; receiving a second search result responsive to a second open-site network search using said first mode query; determining an external score for said one of said plurality of candidate phrases using said second search result; determining an internal score for said at least one of said plurality of candidate phrases, said determining an internal score comprising: constructing a site query responsive to one of said plurality of candidate phrases and receiving at least one site query result responsive to the site query; discarding each site query result for which the one of said plurality of candidate phrases is not contained in at least one of a site address and a site name of the site query result; extracting at least one probable web host name from the remaining of the at least one site query result; constructing a second mode query responsive to said category term and said at least one probable web host and submitting at least one targeted-site network search using said second mode query; receiving at least one third search result responsive to said at least one targeted-site network search using said second mode query; repeating said constructing a site query, said discarding, said extracting at least one probable web host name, said constructing a second mode query, and said receiving at least one third search result for each remaining of said plurality of candidate phrases; and determining said internal score responsive to said at least one third search result; determining a final score for said at least one of said plurality of candidate phrases responsive to said internal score and said external score; and presenting said one of said plurality of candidate phrases.
|
24. A computer program product comprising: a computer usable data carrier having computer readable instructions embodied therein for causing a computer to perform a method, said method comprising: receiving a first search result from a first open-site network search responsive to a first query generated responsive to a search type selection and a category term; developing an initial page set responsive to said first search result; selecting a range pattern responsive to said search type selection; extracting a plurality of candidate phrases from said initial page set responsive to said range pattern and said category term; filtering said plurality of candidate phrases, said filtering comprising: combining said plurality of candidate phrases into a single list; identifying duplicate candidate phrases in said single list; and removing said duplicate candidate phrases from said plurality of candidate phrases; constructing a first mode query for one of said plurality of candidate phrases; receiving a second search result responsive to a second open-site network search using said first mode query; determining an external score for said one of said plurality of candidate phrases using said second search result; determining an internal score for said at least one of said plurality of candidate phrases, said determining an internal score comprising: constructing a site query responsive to one of said plurality of candidate phrases and receiving at least one site query result responsive to the site query; discarding each site query result for which the one of said plurality of candidate phrases is not contained in at least one of a site address and a site name of the site query result; extracting at least one probable web host name from the remaining of the at least one site query result; constructing a second mode query responsive to said category term and said at least one probable web host and submitting at least one targeted-site network search using said second mode query; receiving at least one third search result responsive to said at least one targeted-site network search using said second mode query; repeating said constructing a site query, said discarding, said extracting at least one probable web host name, said constructing a second mode query, and said receiving at least one third search result for each remaining of said plurality of candidate phrases; and determining said internal score responsive to said at least one third search result; determining a final score for said at least one of said plurality of candidate phrases responsive to said internal score and said external score; and presenting said one of said plurality of candidate phrases. 25. The computer program product of claim 24 , wherein the step of presenting is responsive to said external score.
| 0.764038 |
1. A computer-implemented method for speaker recognition comprising: determining a speaker recognition score based on a received audio input; generating a speech to noise ratio based on the received audio input; generating a noise type label corresponding to the received audio input; determining a selected adaptive speaker recognition threshold from a plurality of adaptive speaker recognition thresholds based on the speech to noise ratio, the noise type label, and a target false accept rate corresponding to the received audio input, wherein each of the plurality of adaptive speaker recognition thresholds is associated with a particular noise type label, a particular speech to noise ratio, and a particular target false accept rate, and wherein each of the plurality of adaptive speaker recognition thresholds provides a threshold corresponding to a lowest target false reject rate for the particular noise type label, the particular speech to noise ratio, and the particular target false accept rate; and performing speaker recognition for the received audio input based on a comparison of the speaker recognition score to the selected adaptive speaker recognition threshold.
|
1. A computer-implemented method for speaker recognition comprising: determining a speaker recognition score based on a received audio input; generating a speech to noise ratio based on the received audio input; generating a noise type label corresponding to the received audio input; determining a selected adaptive speaker recognition threshold from a plurality of adaptive speaker recognition thresholds based on the speech to noise ratio, the noise type label, and a target false accept rate corresponding to the received audio input, wherein each of the plurality of adaptive speaker recognition thresholds is associated with a particular noise type label, a particular speech to noise ratio, and a particular target false accept rate, and wherein each of the plurality of adaptive speaker recognition thresholds provides a threshold corresponding to a lowest target false reject rate for the particular noise type label, the particular speech to noise ratio, and the particular target false accept rate; and performing speaker recognition for the received audio input based on a comparison of the speaker recognition score to the selected adaptive speaker recognition threshold. 4. The method of claim 1 , wherein determining the selected adaptive speaker recognition threshold comprises accessing a look up table based on the speech to noise ratio, the noise type label, and the target false accept rate.
| 0.67794 |
23. The non-transitory computer readable storage media of claim 22 wherein at least some of the plurality of data objects are of an object type selected from the list: image, video, flash, text node, anchor, area.
|
23. The non-transitory computer readable storage media of claim 22 wherein at least some of the plurality of data objects are of an object type selected from the list: image, video, flash, text node, anchor, area. 24. The non-transitory computer readable storage media of claim 23 wherein the metadata collected from the HTML code includes data from at least one HTML tag.
| 0.958557 |
1. A system comprising: a data processing apparatus; and a computer storage medium encoded with a computer program, the program comprising data processing apparatus instructions that when executed by the data processing apparatus cause the data processing apparatus to perform operations comprising: accessing queries stored in query logs, each query being one or more characters in a first sequence constituting one or more words in a second sequence; for each query: selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each selected query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.
|
1. A system comprising: a data processing apparatus; and a computer storage medium encoded with a computer program, the program comprising data processing apparatus instructions that when executed by the data processing apparatus cause the data processing apparatus to perform operations comprising: accessing queries stored in query logs, each query being one or more characters in a first sequence constituting one or more words in a second sequence; for each query: selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each selected query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key. 2. The system of claim 1 , wherein selecting a query sequence from the query comprises: selecting a next character in the first sequence of characters, the next character being either a first character of the first sequence of characters or a character that is next in sequence to a most recently selected next character in the first sequence of characters; determining whether the query sequence constitutes more than a subsequence of up to n words from the second sequence of words of the query; and in response to determining that the query sequence constitutes more than the subsequence of up to n words, deselecting a word that is first in the subsequence of words in the query sequence.
| 0.683439 |
1. A computer implemented method for managing objects using predetermined master commands, the computer system comprising the steps of: (a) providing a first object of a first object type; (b) providing a first source application; (c) associating said first source application with a first source operation; (d) associating said first source operation with a first source command; (e) providing a second file of a second object type; (f) providing a second source application; (g) associating said second source application with a second source operation; (h) associating said second source operation with a second source command; (i) associating a master application with said first application and said second application; (j) associating a first master command with said first source operation; (k) associating a second master command with said second source operation; (l) requesting a first source operations list from said first source application; (m) providing said first source operations list from said first source application to said master application; (n) wherein said first source operations list comprises first information relating to said first source operation; (o) requesting a second source operations list from said source application; (p) providing said second source operations list from said second source application to said master application; (q) wherein said second source operations list comprises second information relating to said second source operation; (r) associating a first predetermined command with said master application; (s) associating a second predetermined command with said master application; (t) associating said first predetermined command with said first source operation using said first information from said first source operations list; (u) associating said second predetermined command with said second source operation using said second information from said second source operations list; (v) associating a input device with said master application; (w) using said input device to select said first predetermined command and said first object; (x) executing said first source operation on said first object in said first source application in response to said using said input device to select said first predetermined command and said input device; (y) using said input device to select said second predetermined command and said second object; and (z) executing said second source application on said second object in said second source application in response to said selecting of said second predetermined command with said input device.
|
1. A computer implemented method for managing objects using predetermined master commands, the computer system comprising the steps of: (a) providing a first object of a first object type; (b) providing a first source application; (c) associating said first source application with a first source operation; (d) associating said first source operation with a first source command; (e) providing a second file of a second object type; (f) providing a second source application; (g) associating said second source application with a second source operation; (h) associating said second source operation with a second source command; (i) associating a master application with said first application and said second application; (j) associating a first master command with said first source operation; (k) associating a second master command with said second source operation; (l) requesting a first source operations list from said first source application; (m) providing said first source operations list from said first source application to said master application; (n) wherein said first source operations list comprises first information relating to said first source operation; (o) requesting a second source operations list from said source application; (p) providing said second source operations list from said second source application to said master application; (q) wherein said second source operations list comprises second information relating to said second source operation; (r) associating a first predetermined command with said master application; (s) associating a second predetermined command with said master application; (t) associating said first predetermined command with said first source operation using said first information from said first source operations list; (u) associating said second predetermined command with said second source operation using said second information from said second source operations list; (v) associating a input device with said master application; (w) using said input device to select said first predetermined command and said first object; (x) executing said first source operation on said first object in said first source application in response to said using said input device to select said first predetermined command and said input device; (y) using said input device to select said second predetermined command and said second object; and (z) executing said second source application on said second object in said second source application in response to said selecting of said second predetermined command with said input device. 4. The computer implemented method of claim 1 , wherein said first source operations list comprises an association between said first source operation and said first source command.
| 0.616667 |
13. The method of claim 12 wherein predicting the average precision comprises using a learning algorithm.
|
13. The method of claim 12 wherein predicting the average precision comprises using a learning algorithm. 14. The method of claim 13 wherein predicting the average precision comprises using at least one of: (a) a decision tree; (b) a neural network; or (c) a support vector machine.
| 0.93966 |
21. A computer implemented method of providing search results, comprising: identifying a plurality of documents that are indexed according to a first scheme and associated with a first set of information; generating a second scheme that associates, based on predefined mapping information, the first set of information with a second set of information; indexing the plurality of documents according to the second scheme and storing the documents in a repository according to the second scheme; in response to receiving a specification that comprises an input-output pair including a first data entity and a second data entity, identifying one or more modules of program code, within the plurality of documents, that have code constraints specified by the second scheme that are satisfiable by a constraint solver with one or more input-output constraints based on the input-output pair; and generating search results referencing the one or more modules of program code that are satisfiable by the constraint solver with the input-output constraints and providing the search results to a user.
|
21. A computer implemented method of providing search results, comprising: identifying a plurality of documents that are indexed according to a first scheme and associated with a first set of information; generating a second scheme that associates, based on predefined mapping information, the first set of information with a second set of information; indexing the plurality of documents according to the second scheme and storing the documents in a repository according to the second scheme; in response to receiving a specification that comprises an input-output pair including a first data entity and a second data entity, identifying one or more modules of program code, within the plurality of documents, that have code constraints specified by the second scheme that are satisfiable by a constraint solver with one or more input-output constraints based on the input-output pair; and generating search results referencing the one or more modules of program code that are satisfiable by the constraint solver with the input-output constraints and providing the search results to a user. 26. The method of claim 21 , wherein the first scheme is adapted to index documents according to a plurality of keywords associated with the one or more documents and the second scheme is adapted to index documents using an information hierarchy with a plurality of specifications, document indices, and lexicons for classifying details associated with an intended function of source code in the one or more documents.
| 0.51259 |
41. A computer-implemented system comprising: one or more devices to: identify a document that is relevant to a search term; identify a tree representation of the document, where pages of the document correspond to leaf nodes, parts of the document correspond to higher level nodes, and the document corresponds to a root node; assign scores to the leaf nodes based on whether the leaf nodes contain occurrences of the search term; determine scores for the higher level nodes based on the scores of associated ones of the leaf nodes; determine a score for the root node based on the scores of the higher level nodes; provide a threshold, where the threshold is threshold is based on at least one of: a number of pages associated with one of the leaf nodes, a number of pages associated with one of the higher level nodes, or a number of pages associated with the root node; select one of the leaf nodes, one of the higher level nodes, or the root node, as a selected node, based on the scores and the threshold; and provide information relating to the selected node.
|
41. A computer-implemented system comprising: one or more devices to: identify a document that is relevant to a search term; identify a tree representation of the document, where pages of the document correspond to leaf nodes, parts of the document correspond to higher level nodes, and the document corresponds to a root node; assign scores to the leaf nodes based on whether the leaf nodes contain occurrences of the search term; determine scores for the higher level nodes based on the scores of associated ones of the leaf nodes; determine a score for the root node based on the scores of the higher level nodes; provide a threshold, where the threshold is threshold is based on at least one of: a number of pages associated with one of the leaf nodes, a number of pages associated with one of the higher level nodes, or a number of pages associated with the root node; select one of the leaf nodes, one of the higher level nodes, or the root node, as a selected node, based on the scores and the threshold; and provide information relating to the selected node. 43. The computer-implemented system of claim 41 , where the one or more devices are further to: assign a score of 0 to a leaf node that contains no occurrence of the search term; and assign, to a leaf node that contains an occurrence of the search term, a score that is a function of an importance of the occurrence of the search term.
| 0.695289 |
28. A system for automatically identifying entity-value pairs from text, the system comprising: a storage device that stores a set of instructions; and at least one processor that executes the set of instructions to: receive an electronic text file including a text corpus comprising a plurality of words; generating, with a processor, by parsing the text corpus, a corresponding parse tree structure in memory, including nodes of each of the plurality of words having edges based on the parts of speech of the plurality of words; determine whether the parse tree structure includes a predetermined parse tree path corresponding to an attribute, the predetermined parse tree path traversing the parse tree structure from a node corresponding an entity to a node corresponding to a value of an entity-value pairs; identify a portion of the text corpus corresponding to the predetermined parse tree path when the parse tree structure includes the predetermined parse tree path; extract an entity-value pair from the portion of the text corpus, wherein the entity-value pair comprises an entity and a value corresponding to the entity, and wherein the entity-value pair corresponds to an entity-attribute-value relationship; and validating the entity-value pair.
|
28. A system for automatically identifying entity-value pairs from text, the system comprising: a storage device that stores a set of instructions; and at least one processor that executes the set of instructions to: receive an electronic text file including a text corpus comprising a plurality of words; generating, with a processor, by parsing the text corpus, a corresponding parse tree structure in memory, including nodes of each of the plurality of words having edges based on the parts of speech of the plurality of words; determine whether the parse tree structure includes a predetermined parse tree path corresponding to an attribute, the predetermined parse tree path traversing the parse tree structure from a node corresponding an entity to a node corresponding to a value of an entity-value pairs; identify a portion of the text corpus corresponding to the predetermined parse tree path when the parse tree structure includes the predetermined parse tree path; extract an entity-value pair from the portion of the text corpus, wherein the entity-value pair comprises an entity and a value corresponding to the entity, and wherein the entity-value pair corresponds to an entity-attribute-value relationship; and validating the entity-value pair. 35. The system of claim 28 , further comprising memory configured to store a plurality of parse tree paths, wherein the plurality of parse tree paths comprise the predetermined parse tree path.
| 0.61053 |
1. A method of searching an electronic database having a plurality of database records that each include at least one alphanumeric search field, comprising, one or more processors that implement the steps of: inputting a search query that includes a virtual search parameter which is an attribute but not part of a requested database record, and the attribute being a characteristic of the requested database record but not unrequested database records; executing the search query; and selecting at least one database record that matches the search query but the attribute is not part of the at least one alphanumeric search field.
|
1. A method of searching an electronic database having a plurality of database records that each include at least one alphanumeric search field, comprising, one or more processors that implement the steps of: inputting a search query that includes a virtual search parameter which is an attribute but not part of a requested database record, and the attribute being a characteristic of the requested database record but not unrequested database records; executing the search query; and selecting at least one database record that matches the search query but the attribute is not part of the at least one alphanumeric search field. 8. The method of claim 1 wherein the search query includes an indicator of relative pronunciation complexity.
| 0.812822 |
7. A method comprising: providing content data to a portable device such that the content data is accumulated in a memory of the portable device, the content data including video; and providing at least one time prompt to the portable device to trigger the portable device to retrieve a portion of the content data from the memory and play the portion of the content data via the portable device in synchronization with a corresponding portion of a presentation at the at least one time prompt, the presentation being distinct from the content data, the portion of the content data being accumulated in the memory prior to the presentation of the corresponding portion of the presentation, the presentation including audio.
|
7. A method comprising: providing content data to a portable device such that the content data is accumulated in a memory of the portable device, the content data including video; and providing at least one time prompt to the portable device to trigger the portable device to retrieve a portion of the content data from the memory and play the portion of the content data via the portable device in synchronization with a corresponding portion of a presentation at the at least one time prompt, the presentation being distinct from the content data, the portion of the content data being accumulated in the memory prior to the presentation of the corresponding portion of the presentation, the presentation including audio. 9. The method of claim 7 , wherein the portable device is a toy with talking capabilities.
| 0.793165 |
7. A system for testing a computer application, the system comprising: a test script repository including computer readable storage medium having stored thereon computer executable test scripts; and a test server coupled to the test script repository, the test server including a processor executing instructions for testing the computer application, the instructions including: identifying components of a version of the application, said components including one or more components that are one of new and modified, wherein each of the one or more components corresponds to a keyword; generating a keyword matrix of the identified application components, the keyword matrix having a set of all identified application components as a first dimension and a set of the one or more components that are one of new and modified as a second dimension, wherein the keyword matrix comprises the keywords; performing a search in the test script repository with respect to components listed as at least one of the first and second dimensions, said test script repository including test scripts referencing at least some of the identified components, and determining a result of the search; populating the keyword matrix with test case identification numbers in the search result, the test case identification numbers corresponding to test scripts that refer to the at least some of the identified components of the application; and based on the populated keyword matrix, identifying one or more of (a) gaps in test case coverage for the version of the application, and (b) one or more test cases covering the version of the application.
|
7. A system for testing a computer application, the system comprising: a test script repository including computer readable storage medium having stored thereon computer executable test scripts; and a test server coupled to the test script repository, the test server including a processor executing instructions for testing the computer application, the instructions including: identifying components of a version of the application, said components including one or more components that are one of new and modified, wherein each of the one or more components corresponds to a keyword; generating a keyword matrix of the identified application components, the keyword matrix having a set of all identified application components as a first dimension and a set of the one or more components that are one of new and modified as a second dimension, wherein the keyword matrix comprises the keywords; performing a search in the test script repository with respect to components listed as at least one of the first and second dimensions, said test script repository including test scripts referencing at least some of the identified components, and determining a result of the search; populating the keyword matrix with test case identification numbers in the search result, the test case identification numbers corresponding to test scripts that refer to the at least some of the identified components of the application; and based on the populated keyword matrix, identifying one or more of (a) gaps in test case coverage for the version of the application, and (b) one or more test cases covering the version of the application. 8. The system of claim 7 wherein the instructions further comprise executing the one or more test cases covering the version of the application.
| 0.510334 |
1. An information processing apparatus providing an inference means for outputting a diagnosis inferred for a medical case and reason information used to infer the diagnosis, the apparatus comprising: at least one processor; and at least one memory, said processor and memory being operatively coupled to function as: a first obtainment unit configured to obtain values indicating an inference accuracy or likelihood for each of a plurality of inference means based on an inference result output by each of the plural inference means and a group of first correct data including a correct diagnosis for the medical case; a second obtainment unit configured to obtain values indicating a validity of the reason information used in the inference output by each of the plurality of inference means, based on the reason information and a group of second correct data that includes correct reason information in a case for which the correct diagnosis has been provided; and a third obtainment unit configured to obtain at least one inference means from the plurality of inference means based on the (1) values indicating the inference accuracy or likelihood and (2) the values indicating the validity.
|
1. An information processing apparatus providing an inference means for outputting a diagnosis inferred for a medical case and reason information used to infer the diagnosis, the apparatus comprising: at least one processor; and at least one memory, said processor and memory being operatively coupled to function as: a first obtainment unit configured to obtain values indicating an inference accuracy or likelihood for each of a plurality of inference means based on an inference result output by each of the plural inference means and a group of first correct data including a correct diagnosis for the medical case; a second obtainment unit configured to obtain values indicating a validity of the reason information used in the inference output by each of the plurality of inference means, based on the reason information and a group of second correct data that includes correct reason information in a case for which the correct diagnosis has been provided; and a third obtainment unit configured to obtain at least one inference means from the plurality of inference means based on the (1) values indicating the inference accuracy or likelihood and (2) the values indicating the validity. 3. The information processing apparatus according to claim 1 , wherein said processor and memory further are operatively coupled to function as a display control unit configured to display, based on a plurality of pieces of information identified for a given case, a diagnosis for the case obtained through an inference made by the inference means obtained by the third obtainment unit and the information among the plurality of pieces of identified information that has the most influence on the inference of that diagnosis, in a display unit.
| 0.5 |
23. The system of claim 14 , further operable to perform operations comprising: receiving input from a second user indicating that one or more of the first documents are preferred documents; calculating a respective document weight for each of the preferred documents; and wherein calculating the aggregate strength of relationship score for each candidate document includes weighting the strength of relationship scores for the candidate document and each of the preferred documents by the respective document weight for the preferred document.
|
23. The system of claim 14 , further operable to perform operations comprising: receiving input from a second user indicating that one or more of the first documents are preferred documents; calculating a respective document weight for each of the preferred documents; and wherein calculating the aggregate strength of relationship score for each candidate document includes weighting the strength of relationship scores for the candidate document and each of the preferred documents by the respective document weight for the preferred document. 25. The system of claim 23 , further operable to perform operations comprising presenting one or more of the second documents as suggested documents.
| 0.852887 |
12. A computer implemented method for facilitating review of electronic documents related to one or more contexts, the method comprising the steps of: (a) displaying on a user interface information relating to an electronic document that is related to a particular context, the electronic document comprising a patent record or specification, a trade mark record or specification, or a design record or specification, wherein the particular context is selectable from a plurality of contexts, the plurality of contexts comprising one or more of a business context for performing a review of the electronic document by the user, a role within the business context that the user is performing the review, and an event that triggers a review of the electronic document by the user, the information on the user interface comprises a visual map of different groups associated with the particular context, the different groups represented by the visual map comprise different business competitors associated with the particular context, each group is represented by an icon that is proportionately sized to represent a number of items within the group in relation to items within other groups represented by the visual map, and the visual map is configured to present additional information about the items represented by an icon as an overlay on the visual map in response to a user selecting the icon, the additional information comprising at least one of a brief description of a commercial operation of the business competitor associated with the icon, a country of origin of the business competitor associated with the icon, and a number of patent properties of the business competitor associated with the icon that have previously been reviewed and indicated as relevant to the electronic document; (b) enabling a user to enter into the user interface an indication of their review of the electronic document; and (c) enabling the user to enter into the interface a request for the user to receive a notification when a specific event occurs that is associated with the electronic document or any of the electronic documents of the particular context.
|
12. A computer implemented method for facilitating review of electronic documents related to one or more contexts, the method comprising the steps of: (a) displaying on a user interface information relating to an electronic document that is related to a particular context, the electronic document comprising a patent record or specification, a trade mark record or specification, or a design record or specification, wherein the particular context is selectable from a plurality of contexts, the plurality of contexts comprising one or more of a business context for performing a review of the electronic document by the user, a role within the business context that the user is performing the review, and an event that triggers a review of the electronic document by the user, the information on the user interface comprises a visual map of different groups associated with the particular context, the different groups represented by the visual map comprise different business competitors associated with the particular context, each group is represented by an icon that is proportionately sized to represent a number of items within the group in relation to items within other groups represented by the visual map, and the visual map is configured to present additional information about the items represented by an icon as an overlay on the visual map in response to a user selecting the icon, the additional information comprising at least one of a brief description of a commercial operation of the business competitor associated with the icon, a country of origin of the business competitor associated with the icon, and a number of patent properties of the business competitor associated with the icon that have previously been reviewed and indicated as relevant to the electronic document; (b) enabling a user to enter into the user interface an indication of their review of the electronic document; and (c) enabling the user to enter into the interface a request for the user to receive a notification when a specific event occurs that is associated with the electronic document or any of the electronic documents of the particular context. 16. A computer implemented method according to claim 12 , further comprising the step of: (e) displaying on the user interface a summary of the events that have already occurred.
| 0.563982 |
7. The method of claim 1 , wherein: the transmitting of the configuration information includes transmitting a software module upgrade of the seller application from a network-based facility to the seller application.
|
7. The method of claim 1 , wherein: the transmitting of the configuration information includes transmitting a software module upgrade of the seller application from a network-based facility to the seller application. 8. The method of claim 7 further comprising: determining that the software module upgrade exists, the transmitting of the software module upgrade being in response to the determining that the software module upgrade exists.
| 0.896078 |
1. A method for application-specific and customizable text similarity measurement, the method comprising the steps of: determining, by a computer, a string similarity score of at least two texts based upon a string similarity database stored on said computer, said at least two texts comprising at least one input text and at least one target text; determining, by said computer, a semantic similarity score of the at least two texts based upon a semantic similarity database stored on said computer, the semantic similarity score being determined as the sum of a distance between at least one term of each said at least two texts; mapping, by said computer, said at least one target text and its respective canonical representations in a mappings database stored on said computer; combining, by said computer, the string similarity score and the semantic similarity score of the at least two texts where the combined score is a weighted sum of the string similarity score and the semantic similarity score and where said at least two texts are ranked for similarity by sorting by their respective combined string and semantic similarity scores and where said texts that are included in the mappings database are also scored by similarity of their canonical forms; and producing, by the computer, an output signal defining a list of best-scoring semantic mappings with associated scores, said computer adapted to transform said output signal into a display signal viewable on a monitor.
|
1. A method for application-specific and customizable text similarity measurement, the method comprising the steps of: determining, by a computer, a string similarity score of at least two texts based upon a string similarity database stored on said computer, said at least two texts comprising at least one input text and at least one target text; determining, by said computer, a semantic similarity score of the at least two texts based upon a semantic similarity database stored on said computer, the semantic similarity score being determined as the sum of a distance between at least one term of each said at least two texts; mapping, by said computer, said at least one target text and its respective canonical representations in a mappings database stored on said computer; combining, by said computer, the string similarity score and the semantic similarity score of the at least two texts where the combined score is a weighted sum of the string similarity score and the semantic similarity score and where said at least two texts are ranked for similarity by sorting by their respective combined string and semantic similarity scores and where said texts that are included in the mappings database are also scored by similarity of their canonical forms; and producing, by the computer, an output signal defining a list of best-scoring semantic mappings with associated scores, said computer adapted to transform said output signal into a display signal viewable on a monitor. 2. The method according to claim 1 , further comprising the step of determining string similarity as the weighted substring similarity of the at least two texts.
| 0.535103 |
1. A computer-implemented method for performing an analysis of model metadata in a modeling environment, said method including: reading, by a computer-based system for performing said analysis of said model metadata in said modeling environment, a request from a client, wherein said request includes a model identifier and a presentation parameter; reading, by said computer-based system, a variable identifier, wherein said variable identifier is associated with said model identifier; reading, by said computer-based system, variable metadata, wherein said variable metadata is associated with said variable identifier; and, formatting, by said computer-based system, said variable identifier and said variable metadata in accordance with said presentation parameter to create model metadata.
|
1. A computer-implemented method for performing an analysis of model metadata in a modeling environment, said method including: reading, by a computer-based system for performing said analysis of said model metadata in said modeling environment, a request from a client, wherein said request includes a model identifier and a presentation parameter; reading, by said computer-based system, a variable identifier, wherein said variable identifier is associated with said model identifier; reading, by said computer-based system, variable metadata, wherein said variable metadata is associated with said variable identifier; and, formatting, by said computer-based system, said variable identifier and said variable metadata in accordance with said presentation parameter to create model metadata. 4. The method of claim 1 , further including causing said variable metadata to be displayed when a cursor is placed over said variable identifier, wherein said variable metadata corresponds to said variable identifier.
| 0.682616 |
9. The method of claim 2 , further comprising: identifying a second associated task of the tasks of the task group, wherein the second associated task is associated with a second task completion step, wherein the second associated task is unique from the associated task; and determining a task completion step similarity measurement, wherein the task completion step similarity measurement is indicative of similarity between the associated task completion step and the second associated task completion step, and wherein the similarity of the second associated task with the tasks of the task group is based on the task completion step similarity measurement.
|
9. The method of claim 2 , further comprising: identifying a second associated task of the tasks of the task group, wherein the second associated task is associated with a second task completion step, wherein the second associated task is unique from the associated task; and determining a task completion step similarity measurement, wherein the task completion step similarity measurement is indicative of similarity between the associated task completion step and the second associated task completion step, and wherein the similarity of the second associated task with the tasks of the task group is based on the task completion step similarity measurement. 10. The method of claim 9 , wherein the task completion step includes a first completion action and a first completion object, wherein the second task completion step includes a second completion action and a second completion object.
| 0.601463 |
8. A computer readable storage device with an executable program stored thereon, wherein the program instructs a processor to perform: segmenting, by performing at least one of classifying and clustering, pieces of document data based at least in part on frequencies of occurrence of keywords in the pieces of document data, wherein the pieces of document data include a description in a natural language, the segmenting resulting in creating at least one document cluster and at least one keyword cluster; and obtaining a frequency distribution showing variation of the frequencies of occurrence of the pieces of document data by performing at least one of: a time-series analysis of frequencies of occurrence of pieces of document data containing individual keywords in at least one document cluster, and a time-series analysis of frequencies of occurrence of pieces of document data containing at least one keyword cluster.
|
8. A computer readable storage device with an executable program stored thereon, wherein the program instructs a processor to perform: segmenting, by performing at least one of classifying and clustering, pieces of document data based at least in part on frequencies of occurrence of keywords in the pieces of document data, wherein the pieces of document data include a description in a natural language, the segmenting resulting in creating at least one document cluster and at least one keyword cluster; and obtaining a frequency distribution showing variation of the frequencies of occurrence of the pieces of document data by performing at least one of: a time-series analysis of frequencies of occurrence of pieces of document data containing individual keywords in at least one document cluster, and a time-series analysis of frequencies of occurrence of pieces of document data containing at least one keyword cluster. 11. The computer readable storage device according to claim 8 , wherein the program further instructs the processor to perform: receiving a search query; narrowing down a set of pieces of document data by the search query; acquiring, from a time series of a keyword in the narrowed set of pieces of document data, a time series of each keyword cluster in the narrowed set of pieces of document data; and performing a frequency analysis of the time series of the keyword cluster.
| 0.546033 |
1. A method for viewing a graphical block diagram model outside of a graphical modeling environment, the method comprising: obtaining a graphical block diagram model generated in a graphical modeling environment, the graphical block diagram model representing a dynamic system, the graphical block diagram model including at least one block that represents a portion of the system and at least one line representing a signal provided as an input or an output of the block; converting the graphical block diagram model to an interactive graphics language format; displaying a view of the graphical block diagram model in the interactive graphics language format outside of the graphical modeling environment; and allowing modifying the displayed view without modifying the graphical block diagram model.
|
1. A method for viewing a graphical block diagram model outside of a graphical modeling environment, the method comprising: obtaining a graphical block diagram model generated in a graphical modeling environment, the graphical block diagram model representing a dynamic system, the graphical block diagram model including at least one block that represents a portion of the system and at least one line representing a signal provided as an input or an output of the block; converting the graphical block diagram model to an interactive graphics language format; displaying a view of the graphical block diagram model in the interactive graphics language format outside of the graphical modeling environment; and allowing modifying the displayed view without modifying the graphical block diagram model. 17. The method of claim 1 further comprising: re-animating, in the interactive graphics language, a simulation of the graphical block diagram model from the graphical modeling environment.
| 0.556056 |
16. A system comprising: one or more processors; system memory; and one or more computer storage media having stored thereon computer-executable instructions that, when executed by the one or more processors, perform a method for maintaining a multi-dimensional structure, the method comprising: receiving statements related to modifying data and for execution against the multi-dimensional structure, the statements in a declarative language relating to a recursive calculation assigned as a value of a cell in the multi-dimensional structure, the recursive calculation including a recursive reference back to the cell, the execution of the received statements modifying a portion of the data stored within the multi-dimensional structure; receiving statements in the declarative language relating to semantically caching the recursive calculation within the cell of the multi-dimensional structure; semantically storing the recursive calculation; receiving an alteration to a value utilized by the cached recursive calculation; automatically updating a resultant value of the recursive calculation by way of implementing the semantically stored calculation; and generating a pass upon execution of the calculation, the generated pass including a portion of the data stored within the multi-dimensional structure as the portion of the data existed prior to execution of the recursive calculation, the generated pass generated in response to receiving the statements related to modifying data and prior to execution of the statements related to modifying data.
|
16. A system comprising: one or more processors; system memory; and one or more computer storage media having stored thereon computer-executable instructions that, when executed by the one or more processors, perform a method for maintaining a multi-dimensional structure, the method comprising: receiving statements related to modifying data and for execution against the multi-dimensional structure, the statements in a declarative language relating to a recursive calculation assigned as a value of a cell in the multi-dimensional structure, the recursive calculation including a recursive reference back to the cell, the execution of the received statements modifying a portion of the data stored within the multi-dimensional structure; receiving statements in the declarative language relating to semantically caching the recursive calculation within the cell of the multi-dimensional structure; semantically storing the recursive calculation; receiving an alteration to a value utilized by the cached recursive calculation; automatically updating a resultant value of the recursive calculation by way of implementing the semantically stored calculation; and generating a pass upon execution of the calculation, the generated pass including a portion of the data stored within the multi-dimensional structure as the portion of the data existed prior to execution of the recursive calculation, the generated pass generated in response to receiving the statements related to modifying data and prior to execution of the statements related to modifying data. 17. The system of claim 16 , wherein the declarative language is MDX.
| 0.577784 |
1. A method of generating information from a plurality of data items, the method comprising the steps of: (a) populating an aggregate data item with at least one of the plurality of data items; wherein each individual data item comprises original information including an attribute and a value, wherein the attribute of the individual data item is an identifier for the individual data item, wherein the aggregate data item is a form of derived attribute, wherein the derived attribute represents a transformation of a collection of individual data items into a single data item with a value, wherein said value of the derived attribute is an aggregate value comprising a map of attribute to value for each said individual data item within said collection of individual data items such that a derived attribute forms a single data item suitable for inferencing by a knowledge base, said single data item retaining the original information relating to each of the plurality of individual data items yet queried by the knowledge base as a whole to extract information regarding said individual data items; and (b) generating the information using the aggregate data item, wherein the method of generating information is performed by a decision support system, and wherein the information so generated falls into one or more of the following groups: i. textual information; ii. a machine instruction.
|
1. A method of generating information from a plurality of data items, the method comprising the steps of: (a) populating an aggregate data item with at least one of the plurality of data items; wherein each individual data item comprises original information including an attribute and a value, wherein the attribute of the individual data item is an identifier for the individual data item, wherein the aggregate data item is a form of derived attribute, wherein the derived attribute represents a transformation of a collection of individual data items into a single data item with a value, wherein said value of the derived attribute is an aggregate value comprising a map of attribute to value for each said individual data item within said collection of individual data items such that a derived attribute forms a single data item suitable for inferencing by a knowledge base, said single data item retaining the original information relating to each of the plurality of individual data items yet queried by the knowledge base as a whole to extract information regarding said individual data items; and (b) generating the information using the aggregate data item, wherein the method of generating information is performed by a decision support system, and wherein the information so generated falls into one or more of the following groups: i. textual information; ii. a machine instruction. 2. The method defined by claim 1 including a prestep of preprocessing the plurality of data items to extract one or more derived attributes from the plurality of data items thereby reducing data complexity.
| 0.636673 |
1. A system for searching previously accessed network resources, the system comprising: a network computing provider in communication with a client computing device, the network computing provider comprising a network computing component executing on one or more physical network computing devices, wherein each physical network computing device comprises hardware configurable to execute specific computing instructions, the network computing component configured to: retrieve a previously accessed network resource satisfying a search request received from the client computing device, the search request comprising one or more search terms, wherein the client computing device accessed the previously accessed network resource during a previous browsing session in which the client computing device also accessed one or more contextual network resources from different content servers than the previously accessed network resource; retrieve a first contextual network resource of the one or more contextual network resources, wherein the first contextual network resource is retrieved based at least on the first contextual network resource being accessed during the same previous browsing session as the first previously accessed network resource; and cause display of a representation of the previously accessed network resource satisfying the search request and a representation of the first contextual network resource.
|
1. A system for searching previously accessed network resources, the system comprising: a network computing provider in communication with a client computing device, the network computing provider comprising a network computing component executing on one or more physical network computing devices, wherein each physical network computing device comprises hardware configurable to execute specific computing instructions, the network computing component configured to: retrieve a previously accessed network resource satisfying a search request received from the client computing device, the search request comprising one or more search terms, wherein the client computing device accessed the previously accessed network resource during a previous browsing session in which the client computing device also accessed one or more contextual network resources from different content servers than the previously accessed network resource; retrieve a first contextual network resource of the one or more contextual network resources, wherein the first contextual network resource is retrieved based at least on the first contextual network resource being accessed during the same previous browsing session as the first previously accessed network resource; and cause display of a representation of the previously accessed network resource satisfying the search request and a representation of the first contextual network resource. 2. The system of claim 1 , wherein the previously accessed network resource comprises one of a web page, image, video, animation, applet, or document.
| 0.590746 |
1. A method for a website building system, said method being performed by a hardware processor, said method comprising: storing content elements having types, layout-related elements having types, and website building system components of websites of users, said components having types, wherein said components are visually editable; and said layout-related elements are based on said website building system component types and a repository of content element types; providing direct creation and editing of sites based on said website building system component types; gathering related information based on at least one of: answers to at least one questionnaire for a user and available business identifying information, wherein said gathering gathers information from at least external and internal sources of said website building system; generating content elements from content element types based on said related information; matching said content elements to a relevant one of pre-defined layout related elements, a business family related site structure, a business industry related media and a design kit; generating multiple layout solutions for elements of a website of said user based on at least one of: said predefined layout related elements, said business family related site structure, said business industry related media and said design kit; generating a website from a user selected said layout solution consisting of a hierarchy of said layout related elements; wherein said generating a website comprises: running said at least one questionnaire and at least receiving information from said user about said user and the business of said user; and determining said business family and said business industry based on said information; wherein said providing direct creation and editing of sites enables said user to edit said generated website using a component editing interface; analyzing content, aesthetics and layout related elements from other users of said website building system at least within said business industry and said business family based on said information and said related information to generate at least one of: at least one industry-preferred layout element having industry-preferred aesthetics, an element-based website of said user and improved question element types for questionnaires; and using artificial intelligence to provide an evolving and continuously improving interaction with said user based on the output of said analyzing content, aesthetics and layout related elements.
|
1. A method for a website building system, said method being performed by a hardware processor, said method comprising: storing content elements having types, layout-related elements having types, and website building system components of websites of users, said components having types, wherein said components are visually editable; and said layout-related elements are based on said website building system component types and a repository of content element types; providing direct creation and editing of sites based on said website building system component types; gathering related information based on at least one of: answers to at least one questionnaire for a user and available business identifying information, wherein said gathering gathers information from at least external and internal sources of said website building system; generating content elements from content element types based on said related information; matching said content elements to a relevant one of pre-defined layout related elements, a business family related site structure, a business industry related media and a design kit; generating multiple layout solutions for elements of a website of said user based on at least one of: said predefined layout related elements, said business family related site structure, said business industry related media and said design kit; generating a website from a user selected said layout solution consisting of a hierarchy of said layout related elements; wherein said generating a website comprises: running said at least one questionnaire and at least receiving information from said user about said user and the business of said user; and determining said business family and said business industry based on said information; wherein said providing direct creation and editing of sites enables said user to edit said generated website using a component editing interface; analyzing content, aesthetics and layout related elements from other users of said website building system at least within said business industry and said business family based on said information and said related information to generate at least one of: at least one industry-preferred layout element having industry-preferred aesthetics, an element-based website of said user and improved question element types for questionnaires; and using artificial intelligence to provide an evolving and continuously improving interaction with said user based on the output of said analyzing content, aesthetics and layout related elements. 20. The method according to claim 1 wherein said providing direct creation and editing of sites comprises: invoking said component editing interface when said user edits the layout of said components; invoking list editing operations for list-oriented changes; and reapplying said user edits to said generated site or site area.
| 0.559961 |
15. Non-transitory physical computer storage comprising computer-executable instructions stored thereon that, when executed by a hardware processor, are configured to perform operations comprising: accessing, from an electronic data store, contextual information associated with a browse session for a user, wherein the contextual information includes one or more attributes indicative of a user browsing context for the browse session; determining the user browsing context with respect to items available from the electronic catalog based at least in part on the contextual information; generating a candidate list of candidate video content recommendation items for the user such that the candidate list includes (i) one or more items from a watch list associated with the user and (ii) one or more additional items not in the watch list, the watch list indicative of one or more items added to the watch list and when the one or more items were added to the watch list; determining, based at least in part on an amount of time elapsed between (i) when a given item is added to the watch list and (ii) when the given item is watched, a time interval by which to reorder the list of candidate video content recommendation items; reordering the candidate list based at least in part on the determined time interval and the one or more time periods at which the one or more items in the watch list were added to the watch list; and providing one or more video content item recommendations from the reordered candidate list to the consumer computing device.
|
15. Non-transitory physical computer storage comprising computer-executable instructions stored thereon that, when executed by a hardware processor, are configured to perform operations comprising: accessing, from an electronic data store, contextual information associated with a browse session for a user, wherein the contextual information includes one or more attributes indicative of a user browsing context for the browse session; determining the user browsing context with respect to items available from the electronic catalog based at least in part on the contextual information; generating a candidate list of candidate video content recommendation items for the user such that the candidate list includes (i) one or more items from a watch list associated with the user and (ii) one or more additional items not in the watch list, the watch list indicative of one or more items added to the watch list and when the one or more items were added to the watch list; determining, based at least in part on an amount of time elapsed between (i) when a given item is added to the watch list and (ii) when the given item is watched, a time interval by which to reorder the list of candidate video content recommendation items; reordering the candidate list based at least in part on the determined time interval and the one or more time periods at which the one or more items in the watch list were added to the watch list; and providing one or more video content item recommendations from the reordered candidate list to the consumer computing device. 19. The non-transitory physical computer storage of claim 15 , wherein the time interval is determined based on an average elapsed time between (1) the user adding an item to the user's watch list and (2) the user actually watching the item.
| 0.553979 |
1. Apparatus for improving the skills of mathematical computation and alphabet usage, comprising a computation selector in combination with an answer verifier, i. said computation selector consisting essentially of a problem board member and a selector member, said problem board member having a central point, means uniting said computation selector members together for relative rotary movement of one with respect to the other about said central point of said problem board member, said problem board member carrying on it visible indicia arranged in circumscribing fashion about said central point, said indicia including an inner array of primary numbers and an outer array of secondary numbers, said inner array comprising at least two said primary numbers, each said primary number being separated from adjacent ones thereof by a primary radial line separator, whereby each said primary number lies within a radial primary segment about said central point, said outer array of secondary numbers being radially outward from said primary numbers and being arranged with at least three said secondary numbers within the arc ambit of each said radial primary segment, each said secondary number lying within a radial secondary segment defined by secondary radial line separators between said secondary numbers, substantially all of said secondary numbers having associated therewith a visible letter code, each said letter code being representative of the numerical value of the correct answer for a predetermined mathematical computation between the said secondary number with which said letter code is associated and the primary number within the arc ambit of whose radial primary segment the said secondary number is located, different said correct answer numerical values being represented by a different said letter code, ii. said answer verifier comprising an answer board member and a visibly distinct identifier member, means uniting said answer verifier members together for relative indexing movement of one with respect to the other, said answer board member carrying on it indicia comprising each said letter code appearing on said computation selector, each said letter code on said answer board member having in uniform association with it the numerical value of said correct answer for the aforesaid predetermined mathematical computation, the said correct answer numerical value associated with each letter code on said answer board being visually apparent and identified by said identifier member when said identifier member is indexed to visually mark said letter code with which said correct answer numerical value is associated.
|
1. Apparatus for improving the skills of mathematical computation and alphabet usage, comprising a computation selector in combination with an answer verifier, i. said computation selector consisting essentially of a problem board member and a selector member, said problem board member having a central point, means uniting said computation selector members together for relative rotary movement of one with respect to the other about said central point of said problem board member, said problem board member carrying on it visible indicia arranged in circumscribing fashion about said central point, said indicia including an inner array of primary numbers and an outer array of secondary numbers, said inner array comprising at least two said primary numbers, each said primary number being separated from adjacent ones thereof by a primary radial line separator, whereby each said primary number lies within a radial primary segment about said central point, said outer array of secondary numbers being radially outward from said primary numbers and being arranged with at least three said secondary numbers within the arc ambit of each said radial primary segment, each said secondary number lying within a radial secondary segment defined by secondary radial line separators between said secondary numbers, substantially all of said secondary numbers having associated therewith a visible letter code, each said letter code being representative of the numerical value of the correct answer for a predetermined mathematical computation between the said secondary number with which said letter code is associated and the primary number within the arc ambit of whose radial primary segment the said secondary number is located, different said correct answer numerical values being represented by a different said letter code, ii. said answer verifier comprising an answer board member and a visibly distinct identifier member, means uniting said answer verifier members together for relative indexing movement of one with respect to the other, said answer board member carrying on it indicia comprising each said letter code appearing on said computation selector, each said letter code on said answer board member having in uniform association with it the numerical value of said correct answer for the aforesaid predetermined mathematical computation, the said correct answer numerical value associated with each letter code on said answer board being visually apparent and identified by said identifier member when said identifier member is indexed to visually mark said letter code with which said correct answer numerical value is associated. 13. The apparatus of claim 1 additionally comprising a numerical notation for each said letter code.
| 0.544755 |
10. The computer storage medium of claim 8 , wherein the collected information comprises metadata describing the current activities.
|
10. The computer storage medium of claim 8 , wherein the collected information comprises metadata describing the current activities. 13. The computer storage medium of claim 10 , wherein identifying the stored media associated with the at least portion of the current activities includes comparing the metadata in the collected information with metadata associated with the stored media.
| 0.851399 |
1. A method for searching an electronic document for passages relating to a concept being searched for, where the concept is expressed as a word or plurality of words, the method comprising: deconstructing by a computer processor training electronic texts stored on a computer readable into a stream of features; storing the stream of features in a data store; wherein the features include the text of complete sentences, tokens used by the text in each sentence, the sequence of sentences, layout of text and typography of text; executing by a computer processor a conditional random field algorithm to label sentences in the electronic document as either being relevant to the concept being searched for (“State A”) or as background information (“State B”) based on the stream of features; executing by the computer processor a search algorithm which returns those sentences labelled as State A; wherein the conditional random field algorithm generates a probability of a sentence being relevant to State A; wherein the probability includes a tolerance for words or portions of words which cannot be resolved into computer-readable text; wherein, given a document containing multiple sentences S:={s 1 , s 2 , . . . , s m } and the corresponding concept label for each sentence Concept:={concept 1 , concept 2 , . . . , concept m }, the conditional random field function defining the probability of the Concept applied to S, Pr(Concept|S), is expressed as: Pr ( Concept ❘ S ) = 1 Z s exp ( ∑ j = 1 K × L F j ( Concept , S ) ) = 1 Z s exp ( ∑ i = 1 , k = 1 m , K λ k f k ( y i - 1 , y i , S ) + ∑ i = 1 , l = 1 m , L μ l g l ( y i , S ) ) where Z s is a normalization constant, ƒ k (y i-1 ,y i ,S) is an arbitrary feature function over the group of sentences in a document and positions i and i−1, g l (y i ,S) is a feature function of the state at position i and the document S.
|
1. A method for searching an electronic document for passages relating to a concept being searched for, where the concept is expressed as a word or plurality of words, the method comprising: deconstructing by a computer processor training electronic texts stored on a computer readable into a stream of features; storing the stream of features in a data store; wherein the features include the text of complete sentences, tokens used by the text in each sentence, the sequence of sentences, layout of text and typography of text; executing by a computer processor a conditional random field algorithm to label sentences in the electronic document as either being relevant to the concept being searched for (“State A”) or as background information (“State B”) based on the stream of features; executing by the computer processor a search algorithm which returns those sentences labelled as State A; wherein the conditional random field algorithm generates a probability of a sentence being relevant to State A; wherein the probability includes a tolerance for words or portions of words which cannot be resolved into computer-readable text; wherein, given a document containing multiple sentences S:={s 1 , s 2 , . . . , s m } and the corresponding concept label for each sentence Concept:={concept 1 , concept 2 , . . . , concept m }, the conditional random field function defining the probability of the Concept applied to S, Pr(Concept|S), is expressed as: Pr ( Concept ❘ S ) = 1 Z s exp ( ∑ j = 1 K × L F j ( Concept , S ) ) = 1 Z s exp ( ∑ i = 1 , k = 1 m , K λ k f k ( y i - 1 , y i , S ) + ∑ i = 1 , l = 1 m , L μ l g l ( y i , S ) ) where Z s is a normalization constant, ƒ k (y i-1 ,y i ,S) is an arbitrary feature function over the group of sentences in a document and positions i and i−1, g l (y i ,S) is a feature function of the state at position i and the document S. 6. The method according to claim 1 , wherein the stream of features includes grid-based layout information.
| 0.545762 |
1. One or more non-transitory computer storage media storing computer executable instructions which when executed perform a method in a computer system for graphically defining a channel for processing messages, the method comprising: displaying, on a display device, a visual channel editor in which graphical representations of channel nodes can be arranged and interconnected to define a channel; receiving user input to the visual channel editor that creates a plurality of graphical representations of channel nodes in the visual channel editor, the plurality of graphical representations including a graphical representation of a source node and at least one graphical representation of a destination node; receiving user input that selects one of the graphical representations, the selected graphical representation corresponding to a first channel node; in response to the selection of the graphical representation, displaying, on the display device, a node configuration panel that displays one or more user interface controls that the user can manipulate to define configurable parameters for the first channel node, wherein the one or more user interface controls displayed in the node configuration panel include one or more fields that each list a number of predefined types for the first channel node that a user can select, and wherein the first channel node is a source node, and wherein the one or more fields include a source field and a format field, the source field for defining a source of messages to be processed in the channel, and the format field for defining a format for the messages; receiving user input to the one or more user interface controls, the user input defining configurable parameters for the first channel node; and using the user input to the one or more user interface controls to automatically generate one or more scripts to implement functionality specified in the defined configurable parameters on messages that are processed by the first channel node.
|
1. One or more non-transitory computer storage media storing computer executable instructions which when executed perform a method in a computer system for graphically defining a channel for processing messages, the method comprising: displaying, on a display device, a visual channel editor in which graphical representations of channel nodes can be arranged and interconnected to define a channel; receiving user input to the visual channel editor that creates a plurality of graphical representations of channel nodes in the visual channel editor, the plurality of graphical representations including a graphical representation of a source node and at least one graphical representation of a destination node; receiving user input that selects one of the graphical representations, the selected graphical representation corresponding to a first channel node; in response to the selection of the graphical representation, displaying, on the display device, a node configuration panel that displays one or more user interface controls that the user can manipulate to define configurable parameters for the first channel node, wherein the one or more user interface controls displayed in the node configuration panel include one or more fields that each list a number of predefined types for the first channel node that a user can select, and wherein the first channel node is a source node, and wherein the one or more fields include a source field and a format field, the source field for defining a source of messages to be processed in the channel, and the format field for defining a format for the messages; receiving user input to the one or more user interface controls, the user input defining configurable parameters for the first channel node; and using the user input to the one or more user interface controls to automatically generate one or more scripts to implement functionality specified in the defined configurable parameters on messages that are processed by the first channel node. 3. The one or more computer storage media of claim 1 , wherein the user input that creates the plurality of graphical representations includes user input that defines connections between the plurality of graphical representations.
| 0.544184 |
14. A mobile device, comprising: a plurality of sensors and a plurality of sensor groups, wherein each of the sensor groups is assigned at least one of the sensors, and wherein the sensor groups are arranged according to a hierarchy; and a plurality of classifiers, wherein each classifier is assigned to a sensor group, and wherein each classifier is configured to evaluate one or more contexts of the mobile device based on signals from one or more sensors assigned to the same sensor group as the classifier; wherein the mobile device is configured to: evaluate a first context of the mobile device by activating classification using at least two of the classifiers in sequence according to the hierarchy; and adapt a configuration of a classifier assigned to a lower level sensor group in the hierarchy based, at least in part, on a result of a classification by a classifier assigned to a higher level sensor group in the hierarchy.
|
14. A mobile device, comprising: a plurality of sensors and a plurality of sensor groups, wherein each of the sensor groups is assigned at least one of the sensors, and wherein the sensor groups are arranged according to a hierarchy; and a plurality of classifiers, wherein each classifier is assigned to a sensor group, and wherein each classifier is configured to evaluate one or more contexts of the mobile device based on signals from one or more sensors assigned to the same sensor group as the classifier; wherein the mobile device is configured to: evaluate a first context of the mobile device by activating classification using at least two of the classifiers in sequence according to the hierarchy; and adapt a configuration of a classifier assigned to a lower level sensor group in the hierarchy based, at least in part, on a result of a classification by a classifier assigned to a higher level sensor group in the hierarchy. 16. The mobile device of claim 14 , wherein activating classification using at least two of the classifiers in sequence comprises activating a classification by the classifier assigned to the higher level sensor group after a negative classification by the classifier assigned to the lower level sensor group.
| 0.580981 |
3. The method of claim 1 , further comprising, generating a set of search results from the set of type-determined web pages.
|
3. The method of claim 1 , further comprising, generating a set of search results from the set of type-determined web pages. 5. The method of claim 3 , further comprising, extracting additional semantic data from HTML or XHTML content of each of the set of type-determined web pages; and generating a refined set of search results from the set of search results using the additional semantic data.
| 0.937889 |
1. A computer system configured to store and utilize data to train a machine learning-based affective response model, comprising: a first memory storing data comprising: token instances representing stimuli that influence affective state of a user; the token instances are spread over a period of time that spans at least a day, during which the user is in a first situation and a second situation; wherein the first situation is characterized by there being no other person present with the user, and the second situation is characterized by there being at least one other person present with the user; first data representing levels of user attention in a non-empty subset of the token instances while the user was in the first situation; second data representing levels of user attention in the non-empty subset of the token instances while the user was in the second situation; first set of annotations representing emotional states of the user while the user was in the first situation; second set of annotations representing emotional states of the user while the user was in the second situation; wherein the first set of annotations is not identical to the second set of annotations; first linkage information between the non-empty subset of the token instances, the first data, and the first set of annotations; and second linkage information between the non-empty subset of the token instances, the second data, and the second set of annotations; a second memory storing computer readable instructions, which when executed by a processor, cause the processor to retrieve data stored in the first memory and to utilize the retrieved data to train the machine learning-based affective response model; and a processor configured to execute the instructions stored in the second memory.
|
1. A computer system configured to store and utilize data to train a machine learning-based affective response model, comprising: a first memory storing data comprising: token instances representing stimuli that influence affective state of a user; the token instances are spread over a period of time that spans at least a day, during which the user is in a first situation and a second situation; wherein the first situation is characterized by there being no other person present with the user, and the second situation is characterized by there being at least one other person present with the user; first data representing levels of user attention in a non-empty subset of the token instances while the user was in the first situation; second data representing levels of user attention in the non-empty subset of the token instances while the user was in the second situation; first set of annotations representing emotional states of the user while the user was in the first situation; second set of annotations representing emotional states of the user while the user was in the second situation; wherein the first set of annotations is not identical to the second set of annotations; first linkage information between the non-empty subset of the token instances, the first data, and the first set of annotations; and second linkage information between the non-empty subset of the token instances, the second data, and the second set of annotations; a second memory storing computer readable instructions, which when executed by a processor, cause the processor to retrieve data stored in the first memory and to utilize the retrieved data to train the machine learning-based affective response model; and a processor configured to execute the instructions stored in the second memory. 2. The computer system of claim 1 , wherein the first and second data representing levels of user attention in the non-empty subset of the token instances are used to reduce number of token instances participating in training of the machine learning based affective response model.
| 0.531097 |
12. A computer storage medium having computer-executable instructions, which when executed perform actions, comprising: receiving trending data that includes a set of phrases to be used for text suggestions and for correction of misspelled text; filtering the trending data to remove offensive phrases that are indicated by an offensive terms database, each offensive phrase including at least one word and/or at least one name; determining a set of target machines to which to send a trending data structure derived from the trending data based upon a determination that the set of target machines are within a certain geographical area; sending the trending data structure to the set of target machines; installing the trending data in a new dataset of the client, the client including a local dataset that includes terms that have been inputted on the client; and assigning the new dataset a weight that is less than a weight assigned to the local dataset such that suggestions from the new dataset are suggested after higher weighted suggestions available from the local dataset when the suggestions from the local dataset and the suggestions from the new dataset are equally probable.
|
12. A computer storage medium having computer-executable instructions, which when executed perform actions, comprising: receiving trending data that includes a set of phrases to be used for text suggestions and for correction of misspelled text; filtering the trending data to remove offensive phrases that are indicated by an offensive terms database, each offensive phrase including at least one word and/or at least one name; determining a set of target machines to which to send a trending data structure derived from the trending data based upon a determination that the set of target machines are within a certain geographical area; sending the trending data structure to the set of target machines; installing the trending data in a new dataset of the client, the client including a local dataset that includes terms that have been inputted on the client; and assigning the new dataset a weight that is less than a weight assigned to the local dataset such that suggestions from the new dataset are suggested after higher weighted suggestions available from the local dataset when the suggestions from the local dataset and the suggestions from the new dataset are equally probable. 14. The computer storage medium of claim 12 , further comprising formatting the trending data.
| 0.598299 |
9. A computer-implemented content navigation method, comprising: receiving an indication of activation of a search switch having associated therewith a subset of alphanumeric characters; identifying a set of names associated with a corresponding set of content objects stored in a storage device responsive to the indication of activation, the set of names including at least one name having in a first character position at least one character in the subset of alphanumeric characters; responsive to the set of names including only one name having in the first character position the at least one character, displaying the one name; responsive to the set of names including more than the one name having in the first character position the at least one character, displaying in a first display position at least one place holder character associated with the at least one character in the subset of alphanumeric characters included in the set of names; and displaying in each subsequent display position subsequent instances of the at least one place holder character for subsequent indications of activations of any of a plurality of search switches until the displaying the only one name; wherein the at least one place holder character represents a count of unresolved characters in the set of names.
|
9. A computer-implemented content navigation method, comprising: receiving an indication of activation of a search switch having associated therewith a subset of alphanumeric characters; identifying a set of names associated with a corresponding set of content objects stored in a storage device responsive to the indication of activation, the set of names including at least one name having in a first character position at least one character in the subset of alphanumeric characters; responsive to the set of names including only one name having in the first character position the at least one character, displaying the one name; responsive to the set of names including more than the one name having in the first character position the at least one character, displaying in a first display position at least one place holder character associated with the at least one character in the subset of alphanumeric characters included in the set of names; and displaying in each subsequent display position subsequent instances of the at least one place holder character for subsequent indications of activations of any of a plurality of search switches until the displaying the only one name; wherein the at least one place holder character represents a count of unresolved characters in the set of names. 14. The computer-implemented content navigation method of claim 9 further comprising non-uniformly assigning different sets of characters to each of the plurality of search switches.
| 0.697138 |
1. A processor-implemented method for generating and utilizing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, the processor-implemented method comprising: associating, by a processor, a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; associating, by the processor, the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; and constructing, by the processor, a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same context object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different non-contextual data objects.
|
1. A processor-implemented method for generating and utilizing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, the processor-implemented method comprising: associating, by a processor, a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; associating, by the processor, the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; and constructing, by the processor, a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same context object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different non-contextual data objects. 7. The processor-implemented method of claim 1 , wherein the data store is a web page, and wherein the processor-implemented method further comprises: searching, by the processor, the web page for text data that is part of the synthetic context-based object; and associating the web page that contains said text data with the synthetic context-based object.
| 0.633947 |
3. The method of claim 2 , wherein said object model feature comprises one of: a simple attribute on an object type; and an association to another related “child” object in said object model.
|
3. The method of claim 2 , wherein said object model feature comprises one of: a simple attribute on an object type; and an association to another related “child” object in said object model. 4. The method of claim 3 , wherein said translator classes contain references to child translators, thereby forming a tree structure corresponding to said object model.
| 0.88151 |
1. A method of determining and discerning items with multiple meanings in a sequence of items, the method comprising: producing a distributed representation for each item of the sequence of items including a word vector and a context vector; partitioning the sequence of items into classes; for an item using a representative word vector of each class, calculating a cosine distance between the word vector of said item and the class representative vector; and producing a new sequence of items by modifying the distributed representation in the producing by replacing each occurrence of an item in the distributed representation having a largest cosine distance between the word vector and the class representative vector calculated by the calculating; and wherein the producing the new sequence produces the new sequence by replacing each word occurrence in the input sequence of items by w_i, where i comprises the class index among closest classes that the cosine distance of the representative context vector of the class is closest to an average word vector for the items in a window around the item.
|
1. A method of determining and discerning items with multiple meanings in a sequence of items, the method comprising: producing a distributed representation for each item of the sequence of items including a word vector and a context vector; partitioning the sequence of items into classes; for an item using a representative word vector of each class, calculating a cosine distance between the word vector of said item and the class representative vector; and producing a new sequence of items by modifying the distributed representation in the producing by replacing each occurrence of an item in the distributed representation having a largest cosine distance between the word vector and the class representative vector calculated by the calculating; and wherein the producing the new sequence produces the new sequence by replacing each word occurrence in the input sequence of items by w_i, where i comprises the class index among closest classes that the cosine distance of the representative context vector of the class is closest to an average word vector for the items in a window around the item. 7. The method of claim 1 , wherein the producing the new sequence replaces the item with a variation of the item based on a sense of the item in a current context usage.
| 0.654039 |
11. A computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to: render, by an application executing on a target platform, a document that specifies one or more widgets of each of a first widget type and a second widget type, the rendering including: in response to determining, by the application, that the application includes a first native widget renderer for rendering the one or more widgets of the first widget type, wherein the first native widget renderer is written using an application program interface (API) that is native to the target platform, render the one or more widgets of the first widget type by the first native widget renderer for the first widget type, and in response to determining, by the application, that the application does not include a second native widget renderer for rendering the one or more widgets of the second widget type, wherein the second native widget renderer is written using the API that is native to the target platform, render the one or more widgets of the second widget type, by a default widget renderer for rendering the second widget type, wherein the default widget renderer is written using cross-platform code for a plurality of target platforms including the target platform.
|
11. A computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to: render, by an application executing on a target platform, a document that specifies one or more widgets of each of a first widget type and a second widget type, the rendering including: in response to determining, by the application, that the application includes a first native widget renderer for rendering the one or more widgets of the first widget type, wherein the first native widget renderer is written using an application program interface (API) that is native to the target platform, render the one or more widgets of the first widget type by the first native widget renderer for the first widget type, and in response to determining, by the application, that the application does not include a second native widget renderer for rendering the one or more widgets of the second widget type, wherein the second native widget renderer is written using the API that is native to the target platform, render the one or more widgets of the second widget type, by a default widget renderer for rendering the second widget type, wherein the default widget renderer is written using cross-platform code for a plurality of target platforms including the target platform. 12. The computer program product of claim 11 , wherein the one or more widgets of the first widget type rendered by the first native widget renderer for rendering the one or more widgets of the first widget type includes one or more features that are not available for the one or more widgets of the first widget type rendered by a first default widget renderer for rendering the first widget type.
| 0.514578 |
25. A method comprising: producing a first rendering file of a hierarchical data file; changing a node of the hierarchical data file, thereby making a part of the first rendering file out-of-date with respect to the changed node of the hierarchical data file; producing an interim rendering file by applying an XSLT transformation file on the changed hierarchical data file; determining a difference between the interim rendering file and the first rendering file; attempting to map the difference to the out-of-date part of the first rendering file; and producing a partial rendering file based on the difference if the map is successful and producing a full rendering file if the map is not successful.
|
25. A method comprising: producing a first rendering file of a hierarchical data file; changing a node of the hierarchical data file, thereby making a part of the first rendering file out-of-date with respect to the changed node of the hierarchical data file; producing an interim rendering file by applying an XSLT transformation file on the changed hierarchical data file; determining a difference between the interim rendering file and the first rendering file; attempting to map the difference to the out-of-date part of the first rendering file; and producing a partial rendering file based on the difference if the map is successful and producing a full rendering file if the map is not successful. 28. The method of claim 25 , wherein the hierarchical data file is written in XML and the first, interim, partial, and full rendering files are written in XHTML.
| 0.872964 |
16. A computer program product for schema integration, the computer program product including a non-transitory computer readable medium storing instructions for causing a computer to implement a method, the method comprising: recasting a first source schema into a first graph of concepts with HasA relationships; recasting a second source schema into a second graph of concepts with HasA relationships; identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts; enumerating the first graph of concepts and the second graph of concepts to output a plurality of integrated schemas that consider choices of concepts that merge and concepts that do not merge; applying enumeration constraints to determine how the concepts merge; and systematically determining alternative integrated schemas and associated mappings, based on identifying possible choices of matching concepts to merge to produce an integrated schema from the plurality of integrated schemas.
|
16. A computer program product for schema integration, the computer program product including a non-transitory computer readable medium storing instructions for causing a computer to implement a method, the method comprising: recasting a first source schema into a first graph of concepts with HasA relationships; recasting a second source schema into a second graph of concepts with HasA relationships; identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts; enumerating the first graph of concepts and the second graph of concepts to output a plurality of integrated schemas that consider choices of concepts that merge and concepts that do not merge; applying enumeration constraints to determine how the concepts merge; and systematically determining alternative integrated schemas and associated mappings, based on identifying possible choices of matching concepts to merge to produce an integrated schema from the plurality of integrated schemas. 20. The computer program product as claimed in claim 16 wherein the systematically determining avoids exploring configurations that output a duplicate alternative integrated schema.
| 0.535273 |
22. A non-transitory machine readable storage medium having instructions stored thereon which, when executed by one or more processors, cause the one or more processors to perform the operations of: receiving user input from a user; in response to the user input, accessing a plurality of electronic mail messages (emails), including a certain email, that are part of an email conversation; extracting content from each of the accessed emails, including the certain email; automatically generating a composite email which includes the content extracted from each of the accessed emails; receiving further user input indicating one or more markups made to the content of the certain email in the composite email to give rise to a marked up version of the content of the certain email; and storing a set of markup information indicative of the one or more markups made to the content of the certain email, wherein the markup information is stored separate from the content of the certain email, and wherein the markup information is applicable to the content of the certain email to reproduce the marked up version of the content of the certain email.
|
22. A non-transitory machine readable storage medium having instructions stored thereon which, when executed by one or more processors, cause the one or more processors to perform the operations of: receiving user input from a user; in response to the user input, accessing a plurality of electronic mail messages (emails), including a certain email, that are part of an email conversation; extracting content from each of the accessed emails, including the certain email; automatically generating a composite email which includes the content extracted from each of the accessed emails; receiving further user input indicating one or more markups made to the content of the certain email in the composite email to give rise to a marked up version of the content of the certain email; and storing a set of markup information indicative of the one or more markups made to the content of the certain email, wherein the markup information is stored separate from the content of the certain email, and wherein the markup information is applicable to the content of the certain email to reproduce the marked up version of the content of the certain email. 24. The machine readable storage medium of claim 22 , wherein the one or more markups include one or more comments or notations that have been associated with at least a portion of the content of the certain email.
| 0.704856 |
7. A computer for optimizing a source program that executes on the computer, comprising: a graph representing the source program, the graph including a plurality of nodes, each node including at least one instruction, the instruction including at least one variable; a definition instruction executable procedure including at least one instruction that establishes at least one original name variable, at least one cloned name variable, or at least one incarnation name variable; a use instruction executable procedure including at least one instruction that includes use of the original name, use of the cloned name, or use of the incarnation name; a correspondence executable procedure including at least one instruction that maintains correspondence between the cloned name and the original name; a first executable procedure including at least one instruction that identifies at least one node having the definition instructions and the identified nodes are inside of the loop; a second executable procedure including at least one instruction that identifies nodes having the use instructions and the identified nodes are outside of the loop; a tail node executable procedure including at least one instruction that identifies at least one tail node; a third executable procedure including at least one instruction having the original names that are in the instructions in nodes identified in both the first procedure and the second procedure; for each tail node: wherein, when the original name is in the tail node and identified in instructions the third procedure, a cloned definition instruction being inserted in the tail node that includes the cloned name by the correspondence to the original name; and wherein, for all the use instructions in the second procedure, when the original name is used, and when the cloned name is included in the cloned definition instruction, the corresponding cloned name replaces the original name; and an executable module representing the instructions in the graph that executes on the computer thereby optimizing the source program that executes on the computer with the cloned name.
|
7. A computer for optimizing a source program that executes on the computer, comprising: a graph representing the source program, the graph including a plurality of nodes, each node including at least one instruction, the instruction including at least one variable; a definition instruction executable procedure including at least one instruction that establishes at least one original name variable, at least one cloned name variable, or at least one incarnation name variable; a use instruction executable procedure including at least one instruction that includes use of the original name, use of the cloned name, or use of the incarnation name; a correspondence executable procedure including at least one instruction that maintains correspondence between the cloned name and the original name; a first executable procedure including at least one instruction that identifies at least one node having the definition instructions and the identified nodes are inside of the loop; a second executable procedure including at least one instruction that identifies nodes having the use instructions and the identified nodes are outside of the loop; a tail node executable procedure including at least one instruction that identifies at least one tail node; a third executable procedure including at least one instruction having the original names that are in the instructions in nodes identified in both the first procedure and the second procedure; for each tail node: wherein, when the original name is in the tail node and identified in instructions the third procedure, a cloned definition instruction being inserted in the tail node that includes the cloned name by the correspondence to the original name; and wherein, for all the use instructions in the second procedure, when the original name is used, and when the cloned name is included in the cloned definition instruction, the corresponding cloned name replaces the original name; and an executable module representing the instructions in the graph that executes on the computer thereby optimizing the source program that executes on the computer with the cloned name. 11. The computer of claim 7, further comprising: when the original name is replaced with the corresponding cloned name, and for each tail node further having: wherein when the correspondence of all uses of the original name and that are in the second procedure is between one of the cloned names, replacing the all uses of the original name with the one cloned name thereby optimizing the source program that executes on the computer by using the one cloned name.
| 0.876795 |
15. A method of saving digital content classified by person-based clustering, comprising: generating, on a non-transitory computer readable medium, a data structure composed of a plurality of nodes using a schema of a database that stores a plurality of digital content; extracting, on the non-transitory computer readable medium, a face descriptor of new digital content to be saved in the database; classifying, on the non-transitory computer readable medium, the new digital content and the plurality of digital content by the person-based clustering using the extracted face descriptor; and updating, on the non-transitory computer readable medium, the data structure according to the classification.
|
15. A method of saving digital content classified by person-based clustering, comprising: generating, on a non-transitory computer readable medium, a data structure composed of a plurality of nodes using a schema of a database that stores a plurality of digital content; extracting, on the non-transitory computer readable medium, a face descriptor of new digital content to be saved in the database; classifying, on the non-transitory computer readable medium, the new digital content and the plurality of digital content by the person-based clustering using the extracted face descriptor; and updating, on the non-transitory computer readable medium, the data structure according to the classification. 18. The method of claim 15 , wherein the extracting comprises: extracting a face region from the new digital content; and computing a feature vector by extracting feature points from the extracted face region; wherein the classifying comprises determining whether the face descriptor is within a cluster range through comparison of distances between the computed feature vector and feature vectors of faces included in the plurality of digital content using the computed feature vector.
| 0.523014 |
1. A method comprising: receiving a first query; receiving a second, follow-up query; determining that an anaphora is present in the second, follow-up query by determining that the second, follow-up query includes a pronoun that refers to an entity that is not present in the second, follow-up query; in response to determining that the anaphora is present in the second, follow-up query, determining that the first query is associated with a plurality of possible entities; generating a plurality of candidate queries, wherein each candidate query of the plurality of candidate queries is generated by replacing the pronoun in the second, follow-up query with a corresponding possible entity; obtaining a ranking for the plurality of candidate queries from a ranking engine; determining that a corresponding possible entity in a highest-ranked candidate query of the plurality of candidate queries is an entity associated with the anaphora from the second, follow-up query, wherein the entity associated with the anaphora from the second, follow-up query is the entity that is not present in the second, follow-up query and is referred to by the pronoun in the second, follow-up query; and based on determining that the corresponding possible entity in the highest-ranked candidate query is the entity associated with the anaphora, providing the highest-ranked candidate query to a search engine and obtaining search results for the highest-ranked candidate query from the search engine.
|
1. A method comprising: receiving a first query; receiving a second, follow-up query; determining that an anaphora is present in the second, follow-up query by determining that the second, follow-up query includes a pronoun that refers to an entity that is not present in the second, follow-up query; in response to determining that the anaphora is present in the second, follow-up query, determining that the first query is associated with a plurality of possible entities; generating a plurality of candidate queries, wherein each candidate query of the plurality of candidate queries is generated by replacing the pronoun in the second, follow-up query with a corresponding possible entity; obtaining a ranking for the plurality of candidate queries from a ranking engine; determining that a corresponding possible entity in a highest-ranked candidate query of the plurality of candidate queries is an entity associated with the anaphora from the second, follow-up query, wherein the entity associated with the anaphora from the second, follow-up query is the entity that is not present in the second, follow-up query and is referred to by the pronoun in the second, follow-up query; and based on determining that the corresponding possible entity in the highest-ranked candidate query is the entity associated with the anaphora, providing the highest-ranked candidate query to a search engine and obtaining search results for the highest-ranked candidate query from the search engine. 6. The method of claim 1 wherein the ranking engine ranks the plurality of candidate queries by ranking n-grams contained within the candidate queries.
| 0.608521 |
1. A search engine operating with a processor and configured with: a first relevancy determination stage that includes a textual matching ranking feature, a social distance ranking feature, and a levels to the top (LTT) ranking feature to identify a number of preliminary search results, wherein the LTT ranking feature is used to generate a weight adjusting multiplier that uses a transformation operation comprising an inverse rational transformation to generate the weight adjusting multiplier; and, a second relevancy determination stage that includes a proximity ranking feature that operates on the number of preliminary search results, wherein the proximity ranking feature is used to determine weights to adjust relevancy scores of the preliminary search results and the search engine is further configured during the second relevancy determination stage to identify relevant individuals based in part on the inverse rational transformation operation associated with the LTT ranking feature and a transformation operation associated with the proximity ranking feature.
|
1. A search engine operating with a processor and configured with: a first relevancy determination stage that includes a textual matching ranking feature, a social distance ranking feature, and a levels to the top (LTT) ranking feature to identify a number of preliminary search results, wherein the LTT ranking feature is used to generate a weight adjusting multiplier that uses a transformation operation comprising an inverse rational transformation to generate the weight adjusting multiplier; and, a second relevancy determination stage that includes a proximity ranking feature that operates on the number of preliminary search results, wherein the proximity ranking feature is used to determine weights to adjust relevancy scores of the preliminary search results and the search engine is further configured during the second relevancy determination stage to identify relevant individuals based in part on the inverse rational transformation operation associated with the LTT ranking feature and a transformation operation associated with the proximity ranking feature. 5. The search engine of claim 1 further configured to use a relevance model to identify one or more relevant individuals of interest based in part on received query terms and an identity or other identifying parameter to identify a searching user.
| 0.523387 |
25. A machine-readable storage medium storing executable instructions to cause a machine to perform a machine-implemented method comprising: receiving first search input within a search field of a web browser application; determining, based on characteristics of the first search input, whether the first search input triggers an automatic submission of a first query to a search engine; determining, based on characteristics of the first search input, whether to delay the trigger for automatic submission, wherein the first query is automatically submitted to the search engine if the first search input satisfies a temporal trigger, wherein the temporal trigger is based upon a connection speed to the search engine; automatically submitting the first query to the search engine, the first query based on the received first search input; and displaying, within the web browser application, a first results web page returned from the first query submitted to the search engine.
|
25. A machine-readable storage medium storing executable instructions to cause a machine to perform a machine-implemented method comprising: receiving first search input within a search field of a web browser application; determining, based on characteristics of the first search input, whether the first search input triggers an automatic submission of a first query to a search engine; determining, based on characteristics of the first search input, whether to delay the trigger for automatic submission, wherein the first query is automatically submitted to the search engine if the first search input satisfies a temporal trigger, wherein the temporal trigger is based upon a connection speed to the search engine; automatically submitting the first query to the search engine, the first query based on the received first search input; and displaying, within the web browser application, a first results web page returned from the first query submitted to the search engine. 26. The machine-readable storage medium of claim 25 , wherein the search engine is an Internet search engine.
| 0.721997 |
1. A method of analyzing element names in a patent document, said method comprising the steps of: providing a patent document, wherein said patent document includes text data having a claims section; identifying a first element name within a first claim in said claims section, by performing an optical character recognition (OCR) process of the first element name wherein said step of identifying a first element name is comprised of identifying an antecedent basis word in said first claim and identifying element name text following said antecedent basis word using the optical character recognition (OCR), wherein said antecedent basis word is comprised of the word “a” or “an”; and emphasizing, via a processor, said first element name within said first claim, wherein said step of emphasizing said first element name is comprised of one of the following: bolding, underlining, italics, highlighting, adding characters or coloring a font of said element name and inserting a first element number that corresponds to said first element name adjacent to said first element name, wherein said first element number is inserted after said first element name.
|
1. A method of analyzing element names in a patent document, said method comprising the steps of: providing a patent document, wherein said patent document includes text data having a claims section; identifying a first element name within a first claim in said claims section, by performing an optical character recognition (OCR) process of the first element name wherein said step of identifying a first element name is comprised of identifying an antecedent basis word in said first claim and identifying element name text following said antecedent basis word using the optical character recognition (OCR), wherein said antecedent basis word is comprised of the word “a” or “an”; and emphasizing, via a processor, said first element name within said first claim, wherein said step of emphasizing said first element name is comprised of one of the following: bolding, underlining, italics, highlighting, adding characters or coloring a font of said element name and inserting a first element number that corresponds to said first element name adjacent to said first element name, wherein said first element number is inserted after said first element name. 6. The method of claim 1 , wherein said step of emphasizing said first element name is comprised of changing a font characteristic of said first element name compared to a normal font characteristic of said first claim.
| 0.53532 |
9. The device of claim 8 , wherein the operations comprise: classifying a specific search result as very relevant to the search query based on an observed historical click through rate associated with the specific search result, the specific search result being one of the one or more search results that are each classified as very relevant to the search query.
|
9. The device of claim 8 , wherein the operations comprise: classifying a specific search result as very relevant to the search query based on an observed historical click through rate associated with the specific search result, the specific search result being one of the one or more search results that are each classified as very relevant to the search query. 10. The device of claim 9 , wherein the operations comprise: calculating the observed historical click through rate as a ratio representing a total number of times users have selected the specific search result to a total number of times users have selected another search result different from the specific search result.
| 0.891746 |
9. A communications device comprising: a processor; and a feature accessing function configured for: accessing first features offered by an application of an application server from a plurality of application servers using a session communication protocol; obtaining a non-executable editable file that comprises (a) first information describing how to access at least one additional feature offered by the application of the application server for which the communications device was not previously configured to access and where the additional feature is specific to the application server and (b) second information describing how to represent the at least one additional feature; dynamically updating an existing Graphic User Interface ‘GUI’ so as to display a representation of the at least one additional feature offered by the application, in accordance with the second information; receiving input for selecting an additional feature of the at least one additional feature offered by the application via the GUI that has been dynamically updated; and accessing the additional feature offered by the application without having to change any compiled software on the communications device by using the session communication protocol in a manner for which the communications device was not previously configured to use or by using an extension of the session communication protocol in accordance with the first information.
|
9. A communications device comprising: a processor; and a feature accessing function configured for: accessing first features offered by an application of an application server from a plurality of application servers using a session communication protocol; obtaining a non-executable editable file that comprises (a) first information describing how to access at least one additional feature offered by the application of the application server for which the communications device was not previously configured to access and where the additional feature is specific to the application server and (b) second information describing how to represent the at least one additional feature; dynamically updating an existing Graphic User Interface ‘GUI’ so as to display a representation of the at least one additional feature offered by the application, in accordance with the second information; receiving input for selecting an additional feature of the at least one additional feature offered by the application via the GUI that has been dynamically updated; and accessing the additional feature offered by the application without having to change any compiled software on the communications device by using the session communication protocol in a manner for which the communications device was not previously configured to use or by using an extension of the session communication protocol in accordance with the first information. 12. The communications device of claim 9 wherein the application server is a media server, the at least one additional feature being at least one additional media feature, the session communication protocol being based on SIP.
| 0.670058 |
15. A decoding apparatus comprising: one or more hardware processors configured to: receive an input of a keyword for retrieving a plaintext; acquire a piece of mapping information corresponding to the received keyword from internal storage storing a plurality of keywords each of which is paired with a piece of mapping information; generate a tag based on the received keyword and the piece of mapping information mapped to the received keyword; transmit the generated tag to external storage storing a plurality of concealed texts each of which is paired with a tag; acquire a concealed text corresponding to the generated tag from the external storage; and decode the plaintext from, the concealed text with the concealing key, wherein the mapping information is generated such that different mapping information is associated with each instance of the same keyword when generating the concealed text.
|
15. A decoding apparatus comprising: one or more hardware processors configured to: receive an input of a keyword for retrieving a plaintext; acquire a piece of mapping information corresponding to the received keyword from internal storage storing a plurality of keywords each of which is paired with a piece of mapping information; generate a tag based on the received keyword and the piece of mapping information mapped to the received keyword; transmit the generated tag to external storage storing a plurality of concealed texts each of which is paired with a tag; acquire a concealed text corresponding to the generated tag from the external storage; and decode the plaintext from, the concealed text with the concealing key, wherein the mapping information is generated such that different mapping information is associated with each instance of the same keyword when generating the concealed text. 17. The apparatus according to claim 15 , wherein the concealing key is generated from identification information for identifying the plaintext, the one or more hardware processors acquire the concealed text and the identification information corresponding to the generated tag from the external storage storing a plurality of concealed texts each of which is paired with a piece of identification information and a tag, and the one or more hardware processors are further configured to generate the concealing key based on the acquired identification information.
| 0.602141 |
10. The computer-readable medium of claim 9 , wherein the step of computing the tag-mediated reviewer rank for a particular reviewer comprises the steps of: obtaining implicit engagement metrics indicative of user interaction with the reviews submitted by all reviewers represented in the content quality information database; obtaining implicit engagement metrics indicative of user interaction with the reviews submitted by the particular reviewer; and normalizing the reviewer rank for the particular reviewer based on the implicit engagement metrics for the particular reviewer and the implicit engagement metrics for all reviewers represented in the content quality information database.
|
10. The computer-readable medium of claim 9 , wherein the step of computing the tag-mediated reviewer rank for a particular reviewer comprises the steps of: obtaining implicit engagement metrics indicative of user interaction with the reviews submitted by all reviewers represented in the content quality information database; obtaining implicit engagement metrics indicative of user interaction with the reviews submitted by the particular reviewer; and normalizing the reviewer rank for the particular reviewer based on the implicit engagement metrics for the particular reviewer and the implicit engagement metrics for all reviewers represented in the content quality information database. 11. The computer-readable medium of claim 10 , further comprising the steps of: receiving a plurality of moderator reviews concerning the moderator reports, each moderator review expressing quality assessment information for a moderator report and one or more tags identifying subject matter addressed by the moderator review; computing a tag-mediated moderator rank for each moderator based on the moderator reviews, wherein each tag-mediated moderator rank includes tag scores for one or more tags in the associated moderator reports; storing the tag-mediated moderator ranks in the content quality information database in association with the associated tags and identifiers of the associated moderators; wherein the computation of the a tag-mediated content quality score for each electronic source document is based at least in part on the moderator ranks of one or more moderators who have submitted moderator reports concerning one or more reviews concerning the electronic source document.
| 0.770388 |
15. A system, comprising: at least one processor; and data storage comprising program instructions executable by the at least one processor to cause the at least one processor to perform functions comprising: receiving one or more data logs, wherein the one or more data logs comprise at least one or more recordings of spoken queries; transcribing the one or more recordings of spoken queries; identifying within transcriptions of the one or more recordings of spoken queries transcriptions having an occurrence exceeding a threshold, wherein the threshold is based on a comparison of the transcriptions with previous transcribed queries; processing recordings of spoken queries corresponding to the identified transcriptions using both a language model and an acoustic model; based on a comparison of the processing using the language model with the processing using the acoustic model, identifying, from the one or more data logs, one or more recordings of spoken queries corresponding to transcriptions deemed to be due to noise and a remainder of the one or more recordings of spoken queries; generating one or more modified data logs including the remainder of the recordings of spoken queries; and providing the one or more modified data logs and associated transcriptions of the one or more recordings of spoken queries within the one or more modified data logs as a training data set to update one or more acoustic models for particular languages.
|
15. A system, comprising: at least one processor; and data storage comprising program instructions executable by the at least one processor to cause the at least one processor to perform functions comprising: receiving one or more data logs, wherein the one or more data logs comprise at least one or more recordings of spoken queries; transcribing the one or more recordings of spoken queries; identifying within transcriptions of the one or more recordings of spoken queries transcriptions having an occurrence exceeding a threshold, wherein the threshold is based on a comparison of the transcriptions with previous transcribed queries; processing recordings of spoken queries corresponding to the identified transcriptions using both a language model and an acoustic model; based on a comparison of the processing using the language model with the processing using the acoustic model, identifying, from the one or more data logs, one or more recordings of spoken queries corresponding to transcriptions deemed to be due to noise and a remainder of the one or more recordings of spoken queries; generating one or more modified data logs including the remainder of the recordings of spoken queries; and providing the one or more modified data logs and associated transcriptions of the one or more recordings of spoken queries within the one or more modified data logs as a training data set to update one or more acoustic models for particular languages. 19. The system of claim 15 , wherein the functions further comprise removing transcriptions comprising a uniform resource locator (URL).
| 0.712766 |
36. A multilevel semiotic and fuzzy logic user and metadata interface apparatus according to claim 1 , wherein said multimedia representation is a game.
|
36. A multilevel semiotic and fuzzy logic user and metadata interface apparatus according to claim 1 , wherein said multimedia representation is a game. 38. A multilevel semiotic and fuzzy logic user and metadata interface apparatus according to claim 36 , wherein said game is a multiplayer game having a first player that is the user of said user control device, and said game has a second player that is a second user.
| 0.927437 |
12. A method according to claim 11 , wherein automatically establishing the cross-language communication session comprises establishing the cross-language communication session only if a distance between the first and second wireless communication devices is less than a threshold value.
|
12. A method according to claim 11 , wherein automatically establishing the cross-language communication session comprises establishing the cross-language communication session only if a distance between the first and second wireless communication devices is less than a threshold value. 13. A method according to claim 12 , further comprising automatically calculating the threshold value, based on a number of wireless communication devices physically proximate the first wireless communication device.
| 0.953051 |
20. A web agent creator embodied on a tangible computer readable medium coupled to a processor for creating a web agent to acquire product information from the world wide web, said web agent creator comprising: a web browser user interface, a pattern expression discovery algorithm coupled to said user interface, said algorithm including means for discovering patterns of product information, a results editor coupled to said user interface and said pattern expression discovery algorithm, said results editor having means for editing product information, an agent generator coupled to said user interface and said results editor, said generator having means for generating said web agent having characteristics determined by said algorithm, and a form value editor coupled to said user interface and said agent generator, said form value editor having means for setting parameters of said web agent, said web agent creator providing the tangible result of a web agent executable on a processor which together acquire product information from the world wide web.
|
20. A web agent creator embodied on a tangible computer readable medium coupled to a processor for creating a web agent to acquire product information from the world wide web, said web agent creator comprising: a web browser user interface, a pattern expression discovery algorithm coupled to said user interface, said algorithm including means for discovering patterns of product information, a results editor coupled to said user interface and said pattern expression discovery algorithm, said results editor having means for editing product information, an agent generator coupled to said user interface and said results editor, said generator having means for generating said web agent having characteristics determined by said algorithm, and a form value editor coupled to said user interface and said agent generator, said form value editor having means for setting parameters of said web agent, said web agent creator providing the tangible result of a web agent executable on a processor which together acquire product information from the world wide web. 21. The web agent creator according to claim 20 , wherein: said user interface indicates text selected by the user interface to said pattern expression discovery algorithm, said results editor, said agent generator, and said form value editor.
| 0.707601 |
1. A method of implementing setup configurations for a network interface device, comprising: identifying a plurality of electronic parameters that need to be programmed into memory associated with a network interface device to properly establish a communication link with at least one other node in a communication network; electronically providing a graphical user interface to a user, said graphical user interface comprising a plurality of interface elements configured to receive data defining a first set of variable parameters, wherein said first set of variable parameters corresponds to variable parameters which change based on at least one of user selection and customization, at least one of said user selection and customization being based upon specific options available to a client of said network interface device; analyzing and mapping the first set of variable parameters to a set of static parameters electronically via an application layer module, wherein said set of static parameters corresponds to static parameters required to program said network interface device, said static parameters being defined at least in part by direct dependencies with data which defines the first set of variable parameters; electronically receiving from a user data defining the first set of variable parameters as provided via the graphical user interface; electronically accessing a data file defining the set of static parameters; automatically programming the memory associated with the network interface device to establish a communication link in accordance with a configuration defined by the first set of variable parameters provided via the graphical user interface and the set of static parameters electronically accessed by the data file.
|
1. A method of implementing setup configurations for a network interface device, comprising: identifying a plurality of electronic parameters that need to be programmed into memory associated with a network interface device to properly establish a communication link with at least one other node in a communication network; electronically providing a graphical user interface to a user, said graphical user interface comprising a plurality of interface elements configured to receive data defining a first set of variable parameters, wherein said first set of variable parameters corresponds to variable parameters which change based on at least one of user selection and customization, at least one of said user selection and customization being based upon specific options available to a client of said network interface device; analyzing and mapping the first set of variable parameters to a set of static parameters electronically via an application layer module, wherein said set of static parameters corresponds to static parameters required to program said network interface device, said static parameters being defined at least in part by direct dependencies with data which defines the first set of variable parameters; electronically receiving from a user data defining the first set of variable parameters as provided via the graphical user interface; electronically accessing a data file defining the set of static parameters; automatically programming the memory associated with the network interface device to establish a communication link in accordance with a configuration defined by the first set of variable parameters provided via the graphical user interface and the set of static parameters electronically accessed by the data file. 3. The method of claim 1 , wherein said network interface device is a virtual private network (VPN) router and wherein the at least one other node in a communication network comprises a VPN server provided in a different geographic location than the VPN router.
| 0.65972 |
1. A method for automatically generating playlists of audio files, the method comprising: collecting a plurality of audio file playlists into a playlist database, wherein each audio file playlist indicates an ordered sequence of audio files; generating an N-gram statistical model of the audio file playlists in the playlist database, wherein the N-gram statistical model models ordering sequences of the audio files indicated in the playlists; receiving a request to generate a new playlist; and in response to receiving the request: determining an initial ordered sequence of one or more audio files; and generating a new playlist comprising an ordered sequence including an indication of one or more of the audio files from the playlist database, wherein said generating a new playlist comprises applying the initial ordered sequence to the N-gram statistical model.
|
1. A method for automatically generating playlists of audio files, the method comprising: collecting a plurality of audio file playlists into a playlist database, wherein each audio file playlist indicates an ordered sequence of audio files; generating an N-gram statistical model of the audio file playlists in the playlist database, wherein the N-gram statistical model models ordering sequences of the audio files indicated in the playlists; receiving a request to generate a new playlist; and in response to receiving the request: determining an initial ordered sequence of one or more audio files; and generating a new playlist comprising an ordered sequence including an indication of one or more of the audio files from the playlist database, wherein said generating a new playlist comprises applying the initial ordered sequence to the N-gram statistical model. 10. The method as recited in claim 1 , further comprising generating a class-based statistical model of the playlist database, wherein the class-based statistical model comprises higher-level statistics for the audio files indicated by the playlists in the playlist database, and wherein the higher-level statistics are derived from information about the audio files indicated by the playlists other than ordering sequences.
| 0.594548 |
1. A spinal implant that is adapted to be mounted to a spine comprising: a deflection rod system having a first section and a second section; a horizontal rod adapted to be secured at each end by a bone anchor to a vertebra; a first mount connected to the first section and adapted to secure the first section of the deflection rod system to a vertical rod which supports a load from an adjacent vertebra; a second mount connected to the second section which secures the second section of the deflection rod system to the horizontal rod; wherein the deflection rod system is adapted, by bending of the deflection rod system, to permit resilient deflection of the first mount relative to the horizontal rod and thereby supports the load from the adjacent vertebra while accommodating relative movement between the vertebra and the adjacent vertebra; said deflection rod system including an inner rod and an outer shell; wherein said inner rod is cylindrical in shape; and wherein said outer shell increases in diameter going from the first mount towards the second mount.
|
1. A spinal implant that is adapted to be mounted to a spine comprising: a deflection rod system having a first section and a second section; a horizontal rod adapted to be secured at each end by a bone anchor to a vertebra; a first mount connected to the first section and adapted to secure the first section of the deflection rod system to a vertical rod which supports a load from an adjacent vertebra; a second mount connected to the second section which secures the second section of the deflection rod system to the horizontal rod; wherein the deflection rod system is adapted, by bending of the deflection rod system, to permit resilient deflection of the first mount relative to the horizontal rod and thereby supports the load from the adjacent vertebra while accommodating relative movement between the vertebra and the adjacent vertebra; said deflection rod system including an inner rod and an outer shell; wherein said inner rod is cylindrical in shape; and wherein said outer shell increases in diameter going from the first mount towards the second mount. 3. The implant of claim 1 , wherein said second mount connects the second section of the deflection rod system to the horizontal rod with the deflection rod system substantially parallel to the horizontal rod.
| 0.675216 |
14. A method of encoding digital data representative of a document to be duplicated and obtained by scanning said document comprising the steps of: assembling said digital data into scanned strips of said document with each scanned strip comprising a plurality of scan lines of said document; reading the scan lines in parallel to form data words defining columns of said scanned strips; counting the number of consecutive data words in each scanned strip which are identical to one another to determine the run lengths of said identical data words; encoding runs of data words read and the corresponding run lengths into fixed length coded words, said run lengths being equal to or less than one of a number of maximum run lengths associated with said fixed length coded words; and concatenating all fixed length coded words to represent said document.
|
14. A method of encoding digital data representative of a document to be duplicated and obtained by scanning said document comprising the steps of: assembling said digital data into scanned strips of said document with each scanned strip comprising a plurality of scan lines of said document; reading the scan lines in parallel to form data words defining columns of said scanned strips; counting the number of consecutive data words in each scanned strip which are identical to one another to determine the run lengths of said identical data words; encoding runs of data words read and the corresponding run lengths into fixed length coded words, said run lengths being equal to or less than one of a number of maximum run lengths associated with said fixed length coded words; and concatenating all fixed length coded words to represent said document. 15. A method of encoding digital data as claimed in claim 14 further comprising the step of prefixing a synchronization word to each encoded scanned strip.
| 0.750584 |
14. A system comprising data processing apparatus and one or more storage devices storing instructions that, when executed by the data processing apparatus, cause the system to perform operations comprising: receiving an expressive search query in a search interface, wherein the search interface is not customized for flight search inputs from a user computing device, and the search interface is configured to accept a search query that is not flight-related; determining that the received search query is a flights-related query based on context in the search query; and in response to determining that the search query is a flights-related query and without further user input, providing a flight search interface including a plurality of search dimensions and a plurality of specific flight search results, each dimension associated with an attribute of flight search and each dimension having an associated value, wherein one or more dimension values correspond to values extracted from the search query, wherein each specific flight search result identifies a flight responsive to the query, and wherein the plurality of specific flight search results are filtered according to the dimension values.
|
14. A system comprising data processing apparatus and one or more storage devices storing instructions that, when executed by the data processing apparatus, cause the system to perform operations comprising: receiving an expressive search query in a search interface, wherein the search interface is not customized for flight search inputs from a user computing device, and the search interface is configured to accept a search query that is not flight-related; determining that the received search query is a flights-related query based on context in the search query; and in response to determining that the search query is a flights-related query and without further user input, providing a flight search interface including a plurality of search dimensions and a plurality of specific flight search results, each dimension associated with an attribute of flight search and each dimension having an associated value, wherein one or more dimension values correspond to values extracted from the search query, wherein each specific flight search result identifies a flight responsive to the query, and wherein the plurality of specific flight search results are filtered according to the dimension values. 19. The system of claim 14 wherein: the dimensions portion includes a flights scatterplot displaying flights with respect to a pair of dimensions; and the system stores instructions that, when executed by the data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving a user input modifying a marker position associated with one or more of the pair of dimensions in the scatterplot; and updating specific flight search results according to flights within the region of the scatterplot demarcated by the user input.
| 0.5 |
14. A non-transitory computer-readable storage medium having computer-executable instructions that, when executed by at least one processor, causes the at least one processor to perform operations comprising: computer program code for receiving, by a Web server over a communications network including the Internet, a request from a user client device to access content of a target domain, the request being addressed to a domain address of the target domain; computer program code for identifying, by the Web server, a new content domain that is determined to be relevant to the request to access content of a target domain based on a combination of the domain address of the target domain, source context factors that characterize the user client device, and historical relevance data associated with the target domain, the historical relevance data including source context factors of multiple users who requested to access at least one given address from addresses belonging to the domain address of the target domain and interests of the multiple users, the interests of the multiple users based on pre-access behavior of the multiple users; and computer program code for providing, by the Web server, the user client device with access to content of the identified new content domain over the communications network, responsive to the request.
|
14. A non-transitory computer-readable storage medium having computer-executable instructions that, when executed by at least one processor, causes the at least one processor to perform operations comprising: computer program code for receiving, by a Web server over a communications network including the Internet, a request from a user client device to access content of a target domain, the request being addressed to a domain address of the target domain; computer program code for identifying, by the Web server, a new content domain that is determined to be relevant to the request to access content of a target domain based on a combination of the domain address of the target domain, source context factors that characterize the user client device, and historical relevance data associated with the target domain, the historical relevance data including source context factors of multiple users who requested to access at least one given address from addresses belonging to the domain address of the target domain and interests of the multiple users, the interests of the multiple users based on pre-access behavior of the multiple users; and computer program code for providing, by the Web server, the user client device with access to content of the identified new content domain over the communications network, responsive to the request. 21. The tangible computer-readable medium of claim 14 wherein the computer program code for identifying a new content domain that is determined to be relevant to the request to access content of a target domain is further based on the source context factors including a geographical location of the user client device.
| 0.507964 |
1. A method of processing a query, comprising: providing a pre-defined logical schema to a user of a database system, wherein the pre-defined logical schema is mapped to at least two relational database entities of different databases storing data therein; receiving a logical query for data stored in the databases from the user, wherein the logical query is written in an object-oriented query language utilizing the pre-defined logical schema, and comprises two or more predicates and an operator specifying an action to take with one or more of the predicates; in response to receiving the logical query, interpreting the logical query using the pre-defined logical schema to determine which of the relational database entities is a subject of the logical query, and which of the relational database entities is associated with each predicate; requesting the database of each determined relational database entity of the logical query to: translate each of the associated predicates of that database in the logical query into a query language specific to that database, wherein at least two different databases translate an associated predicate; and apply an authorization rule with each of the associated predicates of that database in the logical query, wherein the authorization rule identifies unauthorized data: receiving a translated predicate query for each determined predicate of the logical query from its associated database of the relational database entity, wherein each translated predicate query is written in a relational query language specific to the associated database and is a translation of one of the object-oriented predicates in the logical query; combining each translated predicate query received from the databases of the determined relational database entities into a master query using the operator; executing the master query against the databases of the relational database entities that are subjects of the logical query; in response to executing the master query, receiving a query result set from the databases of the relational database entities that are subjects of the logical query; and providing the query result set to the user, wherein the query result set lacks the unauthorized data.
|
1. A method of processing a query, comprising: providing a pre-defined logical schema to a user of a database system, wherein the pre-defined logical schema is mapped to at least two relational database entities of different databases storing data therein; receiving a logical query for data stored in the databases from the user, wherein the logical query is written in an object-oriented query language utilizing the pre-defined logical schema, and comprises two or more predicates and an operator specifying an action to take with one or more of the predicates; in response to receiving the logical query, interpreting the logical query using the pre-defined logical schema to determine which of the relational database entities is a subject of the logical query, and which of the relational database entities is associated with each predicate; requesting the database of each determined relational database entity of the logical query to: translate each of the associated predicates of that database in the logical query into a query language specific to that database, wherein at least two different databases translate an associated predicate; and apply an authorization rule with each of the associated predicates of that database in the logical query, wherein the authorization rule identifies unauthorized data: receiving a translated predicate query for each determined predicate of the logical query from its associated database of the relational database entity, wherein each translated predicate query is written in a relational query language specific to the associated database and is a translation of one of the object-oriented predicates in the logical query; combining each translated predicate query received from the databases of the determined relational database entities into a master query using the operator; executing the master query against the databases of the relational database entities that are subjects of the logical query; in response to executing the master query, receiving a query result set from the databases of the relational database entities that are subjects of the logical query; and providing the query result set to the user, wherein the query result set lacks the unauthorized data. 4. The method according to claim 1 , further comprising: requesting the database of each relational database entity to check for authorization for each of its associated predicates; receiving the authorization rule including an authorization filter for each predicate from its associated database of the relational database entity, wherein the authorization filter specifies unauthorized data; and applying the received authorization filters to the received query result to remove unauthorized data prior to providing the query result set to the user.
| 0.673759 |
1. A method comprising: receiving data indicative of a location; receiving a search term; identifying a first geographical coordinate and a second geographical coordinate corresponding to the location; combining, using a processor, the first geographical coordinate and the second geographical coordinate into a single dimensional location value; and combining, using the processor, the single dimensional location value and the search term into a vector.
|
1. A method comprising: receiving data indicative of a location; receiving a search term; identifying a first geographical coordinate and a second geographical coordinate corresponding to the location; combining, using a processor, the first geographical coordinate and the second geographical coordinate into a single dimensional location value; and combining, using the processor, the single dimensional location value and the search term into a vector. 2. The method of claim 1 , further comprising: querying a geographic database with the vector.
| 0.761755 |
5. The method of claim 4 , further comprising using the completion scores in selecting the one or more terms of the unique suffixes as the suggested query completions for the partial query.
|
5. The method of claim 4 , further comprising using the completion scores in selecting the one or more terms of the unique suffixes as the suggested query completions for the partial query. 6. The method of claim 5 , wherein calculating the completion scores for the unique suffixes includes: calculating query popularity scores for the candidate queries indicating frequency of the candidate queries in a log of past queries submitted to one or more search engines; and calculating the completion scores for the unique suffixes using the query popularity scores of the corresponding candidate queries.
| 0.839772 |
21. A computer-program product, tangibly embodied in a non-transitory machine-readable medium, including instructions configured to cause a data processing apparatus to: receive raw data on a computing device; divide the raw data into a set of time stamped searchable events; store the set of events in an indexed data store; apply an extraction rule to the set of events, wherein an extraction rule defines a field within an event from which to extract a value; extract a value from a field within an event, wherein the value is extracted using the extraction rule; and display the event in a graphical interface, wherein the value extracted from the field within the event is emphasized.
|
21. A computer-program product, tangibly embodied in a non-transitory machine-readable medium, including instructions configured to cause a data processing apparatus to: receive raw data on a computing device; divide the raw data into a set of time stamped searchable events; store the set of events in an indexed data store; apply an extraction rule to the set of events, wherein an extraction rule defines a field within an event from which to extract a value; extract a value from a field within an event, wherein the value is extracted using the extraction rule; and display the event in a graphical interface, wherein the value extracted from the field within the event is emphasized. 28. The computer-program product of claim 21 , further including instructions configured to cause the data processing apparatus to: extract an additional value from the displayed event using an additional extraction rule; and emphasize the additional value differently than the displayed emphasized value.
| 0.667468 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.