sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. A computer-readable storage medium containing a program which, when executed by a processor, performs a process of constructing queries selectively capable of returning aggregation information related to data in a database, the process comprising: in response to input specifying attributes for an abstract query, generating an object containing entities including at least one result criterion, selection criteria, an aggregation operation and aggregation logic associating the aggregation operation with the at least one result criterion; wherein the at least one result criterion for the abstract query comprises one or more logical fields, each corresponding to a logical field specification of a data abstraction model abstractly describing the data in the database, each result criterion corresponding to a respective one of the one or more logical fields for which data is to be returned; and wherein the aggregation operation is to be performed with respect to the at least one result criterion for generating aggregation information; and accessing the object to selectively (i) generate a first executable query corresponding to the abstract query inclusive of the aggregation operation and aggregation logic; and (ii) generate a second executable query corresponding to the abstract query exclusive of the aggregation operation and aggregation logic.
|
1. A computer-readable storage medium containing a program which, when executed by a processor, performs a process of constructing queries selectively capable of returning aggregation information related to data in a database, the process comprising: in response to input specifying attributes for an abstract query, generating an object containing entities including at least one result criterion, selection criteria, an aggregation operation and aggregation logic associating the aggregation operation with the at least one result criterion; wherein the at least one result criterion for the abstract query comprises one or more logical fields, each corresponding to a logical field specification of a data abstraction model abstractly describing the data in the database, each result criterion corresponding to a respective one of the one or more logical fields for which data is to be returned; and wherein the aggregation operation is to be performed with respect to the at least one result criterion for generating aggregation information; and accessing the object to selectively (i) generate a first executable query corresponding to the abstract query inclusive of the aggregation operation and aggregation logic; and (ii) generate a second executable query corresponding to the abstract query exclusive of the aggregation operation and aggregation logic. 4. The computer-readable storage medium of claim 1 , wherein the abstract query comprises at least a first and a second result criterion, the first result criterion being associated with the aggregation operation and the second result criterion being associated with a grouping operation to define a result group for the abstract query.
| 0.594632 |
5. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in the processor performing a method comprising: during a first execution of the natural language understanding application: receiving a sequence of words to yield a received sequence of words; assigning a sequence of tags to the received sequence of words by using the statistical model, to yield annotated words; and when sufficient annotated words become available, updating the statistical model; developing a replacement statistical model for the natural language understanding application using the annotated words by: developing a first part of the replacement model without the human knowledge; developing a second part of the replacement model from both the human knowledge and the annotated words; and when the received and subsequently annotated data is sufficient, weighting a contribution from the first part more to the assigning than when the received and subsequently annotated data is insufficient and during a second execution of the natural language understanding application, receiving a second sequence of words and assigning a second sequence of tags to the second sequence of words by using the replacement statistical model.
|
5. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in the processor performing a method comprising: during a first execution of the natural language understanding application: receiving a sequence of words to yield a received sequence of words; assigning a sequence of tags to the received sequence of words by using the statistical model, to yield annotated words; and when sufficient annotated words become available, updating the statistical model; developing a replacement statistical model for the natural language understanding application using the annotated words by: developing a first part of the replacement model without the human knowledge; developing a second part of the replacement model from both the human knowledge and the annotated words; and when the received and subsequently annotated data is sufficient, weighting a contribution from the first part more to the assigning than when the received and subsequently annotated data is insufficient and during a second execution of the natural language understanding application, receiving a second sequence of words and assigning a second sequence of tags to the second sequence of words by using the replacement statistical model. 10. The system of claim 5 , wherein the first part of the statistical model is developed to model (P(t i |f(w i ), t i . . . t i-1 ) and the second part is developed to model P(w i |w i-n , . . . w i-1 , t i-n . . . t i ), wherein variable t represents tags.
| 0.638504 |
1. A method for compiling a unique sample code for specific web content, comprising: defining at least one sample code template comprising multiple sample code segments to be used for building a sample code for specific web content, said sample code segments at least comprising: a sample owner identifying code segment, and a sample identifying code segment; specifying the content of the sample code segments to be used for building said sample code, wherein the sample owner identifying code segment is specified by an Internet address of an owner of the specific web content; stringing the specified sample code segments to form the sample code; defining a digital path to a digital location via which access can be gained to the specific web content and which is mutually distinctive from the sample code; creating a cross-reference between the sample code generated during the stringing of the specified sample code segments and the digital path defined during the defining of the digital path; and providing the sample code with a time stamp indicating a time dependency of the specific web content.
|
1. A method for compiling a unique sample code for specific web content, comprising: defining at least one sample code template comprising multiple sample code segments to be used for building a sample code for specific web content, said sample code segments at least comprising: a sample owner identifying code segment, and a sample identifying code segment; specifying the content of the sample code segments to be used for building said sample code, wherein the sample owner identifying code segment is specified by an Internet address of an owner of the specific web content; stringing the specified sample code segments to form the sample code; defining a digital path to a digital location via which access can be gained to the specific web content and which is mutually distinctive from the sample code; creating a cross-reference between the sample code generated during the stringing of the specified sample code segments and the digital path defined during the defining of the digital path; and providing the sample code with a time stamp indicating a time dependency of the specific web content. 10. The method according to claim 1 , wherein the sample code segments further comprise a sample code security identifying code segment.
| 0.624891 |
16. A computer program product comprising a computer-readable medium, the computer-readable medium being encoded with a computer program for updating database statistics, wherein the computer program, when executed on a computer system, causes the computer system to: receive a first query for a table in the database; determine whether valid and updated statistics for compiling the first query are available from a first store comprising a first entry with statistics associated with the table in the database; if valid and updated statistics for compiling the first query are not available from the first store, obtain updated statistics from a further store comprising statistics associated with the table in the database; and store the obtained updated statistics associated with the table in the database in the first store as a second entry, thereby storing multiple entries for the statistics associated with the same table in the database, wherein the first store is a metadata cache and the further store is a temporary cache.
|
16. A computer program product comprising a computer-readable medium, the computer-readable medium being encoded with a computer program for updating database statistics, wherein the computer program, when executed on a computer system, causes the computer system to: receive a first query for a table in the database; determine whether valid and updated statistics for compiling the first query are available from a first store comprising a first entry with statistics associated with the table in the database; if valid and updated statistics for compiling the first query are not available from the first store, obtain updated statistics from a further store comprising statistics associated with the table in the database; and store the obtained updated statistics associated with the table in the database in the first store as a second entry, thereby storing multiple entries for the statistics associated with the same table in the database, wherein the first store is a metadata cache and the further store is a temporary cache. 18. The computer program product of claim 16 , further causes the computer system to: determine whether sufficiently updated statistics for compiling the first query are available from a second store comprising statistics associated with the table in the database; if sufficiently updated statistics for compiling the first query are not available from the second store, collect the updated statistics from the database, store the updated statistics in the second store, and retrieve the updated statistics for compiling the first query from the second store.
| 0.589126 |
1. A computer-implemented people matching method comprising: determining a current location of a first person through the first person's use of a mobile location-aware processor-based device; accessing a computer-implemented map that comprises location information associated with a plurality of non-human physical objects; determining from the location information associated with the plurality of non-human physical objects a first physical object of the plurality of non-human physical objects that is proximal to the current location of the first person; determining a current location of a second person; and receiving on the mobile location-aware processor-based device a suggested match between the first person and the second person, wherein the suggested match is based, at least in part, on an inference of mutual interest that is based on the current location of the first person, the current location of the second person, and the first physical object.
|
1. A computer-implemented people matching method comprising: determining a current location of a first person through the first person's use of a mobile location-aware processor-based device; accessing a computer-implemented map that comprises location information associated with a plurality of non-human physical objects; determining from the location information associated with the plurality of non-human physical objects a first physical object of the plurality of non-human physical objects that is proximal to the current location of the first person; determining a current location of a second person; and receiving on the mobile location-aware processor-based device a suggested match between the first person and the second person, wherein the suggested match is based, at least in part, on an inference of mutual interest that is based on the current location of the first person, the current location of the second person, and the first physical object. 6. The method of claim 1 further comprising: receiving a computer-generated explanation for the suggested match.
| 0.648216 |
1. A method for expediting access to a document in a client-server network environment, comprising: at a client: monitoring a user's browsing activities within a currently displayed document having links to associated documents, including monitoring proximity of a user-controllable pointer to one or more of the links in the currently displayed document; prior to user selection of any respective link in the currently displayed document: identifying a link satisfying predefined criteria, the predefined criteria including proximity criteria with respect to the user-controllable pointer, and transmitting to a server a request for a document corresponding to the identified link.
|
1. A method for expediting access to a document in a client-server network environment, comprising: at a client: monitoring a user's browsing activities within a currently displayed document having links to associated documents, including monitoring proximity of a user-controllable pointer to one or more of the links in the currently displayed document; prior to user selection of any respective link in the currently displayed document: identifying a link satisfying predefined criteria, the predefined criteria including proximity criteria with respect to the user-controllable pointer, and transmitting to a server a request for a document corresponding to the identified link. 6. The method of claim 1 , wherein monitoring the user's browsing activities within the currently displayed document includes determining whether a user-controllable pointer has hovered over a predefined region associated with a link in the currently displayed document for at least a predefined threshold amount of time.
| 0.677281 |
1. A computer-implemented method comprising: storing unstructured data in an unstructured data store, wherein at least some of the unstructured data remains unstructured in the unstructured data store; receiving, at a query converter, a structured query in a structured query language from an application; identifying a field in data stored in the unstructured data store, based on an extraction rule that specifies where to find a subportion of text within a segment of the data; generating, by the query converter, a second query in a second query language associated with the unstructured data store, based on the structured query; causing execution of the second query against the unstructured data stored in the unstructured data store; receiving a result of execution of the second query against the unstructured data stored in the unstructured data store, the result including a value for the field; and causing an indication of the result to be provided to the application for output to a user.
|
1. A computer-implemented method comprising: storing unstructured data in an unstructured data store, wherein at least some of the unstructured data remains unstructured in the unstructured data store; receiving, at a query converter, a structured query in a structured query language from an application; identifying a field in data stored in the unstructured data store, based on an extraction rule that specifies where to find a subportion of text within a segment of the data; generating, by the query converter, a second query in a second query language associated with the unstructured data store, based on the structured query; causing execution of the second query against the unstructured data stored in the unstructured data store; receiving a result of execution of the second query against the unstructured data stored in the unstructured data store, the result including a value for the field; and causing an indication of the result to be provided to the application for output to a user. 9. A computer-implemented method as recited in claim 1 , further comprising: applying a schema to the data in the unstructured data store after storing data in the unstructured data store, to impose a structure on the unstructured data.
| 0.885728 |
1. A method comprising: collecting information describing a current activity at a computing device; determining a context based at least in part on the current activity; determining that a delivery of additional information is needed based at least in part on the determined context; generating actionable content based at least in part on the determined context and the collected information describing the current activity in response to determining that a delivery of additional information is needed; and providing the actionable content to the computing device.
|
1. A method comprising: collecting information describing a current activity at a computing device; determining a context based at least in part on the current activity; determining that a delivery of additional information is needed based at least in part on the determined context; generating actionable content based at least in part on the determined context and the collected information describing the current activity in response to determining that a delivery of additional information is needed; and providing the actionable content to the computing device. 2. The method of claim 1 , wherein the actionable content comprises one or more links to at least one of video, text, or image content.
| 0.850549 |
1. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting frame, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU2## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive frames, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized.
|
1. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting frame, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU2## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive frames, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized. 4. A method as claimed in claim 1, wherein said aggregated feature vector elements define spatially contiguous character segments generated in a temporally non-sequential manner.
| 0.84103 |
14. A computer system comprising: a processor, a computer readable memory, and a computer readable storage medium; first program instructions to receive a data stream that describes graph nodes in a non-hierarchical graph database; second program instructions to define multiple graph node clusters from the graph nodes in the non-hierarchical graph database; and third program instructions to generate a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters; fourth program instructions to associate 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; fifth program instructions to combine synthetic context-based objects that each contain a same non-contextual data object and a different context object from a first set of different context objects into a first synthetic context-based objects graph node cluster; sixth program instructions to combine synthetic context-based objects that each contain the same non-contextual data object and a different context object from a second set of different context objects into a second synthetic context-based objects graph node cluster; seventh program instructions to display the same non-contextual data object in a context-based cluster edge that links the first synthetic context-based objects graph node cluster to the second synthetic context-based objects graph node cluster; eighth program instructions to transmit only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; ninth program instructions to communicate the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and tenth program instructions to execute a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes; and wherein the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, and tenth program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory.
|
14. A computer system comprising: a processor, a computer readable memory, and a computer readable storage medium; first program instructions to receive a data stream that describes graph nodes in a non-hierarchical graph database; second program instructions to define multiple graph node clusters from the graph nodes in the non-hierarchical graph database; and third program instructions to generate a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters; fourth program instructions to associate 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; fifth program instructions to combine synthetic context-based objects that each contain a same non-contextual data object and a different context object from a first set of different context objects into a first synthetic context-based objects graph node cluster; sixth program instructions to combine synthetic context-based objects that each contain the same non-contextual data object and a different context object from a second set of different context objects into a second synthetic context-based objects graph node cluster; seventh program instructions to display the same non-contextual data object in a context-based cluster edge that links the first synthetic context-based objects graph node cluster to the second synthetic context-based objects graph node cluster; eighth program instructions to transmit only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; ninth program instructions to communicate the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and tenth program instructions to execute a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes; and wherein the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, and tenth program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory. 16. The computer system of claim 14 , wherein the graph nodes represent data nodes.
| 0.555801 |
1. A method of identifying web pages of a world wide web having relevance to a first file, comprising: identifying a plurality of web pages within the world wide web, wherein the plurality of web pages each have a relationship with the first file, wherein the world wide web provides a platform for sharing web pages, and wherein each web page includes a document or information resource that is suitable for the world wide web and is accessible through a web browser; generating, by a system server, a list of inquiries based on the plurality of web pages, wherein the list of inquiries includes search terms used in a search that identified the plurality of web pages; providing, by the system server, the list of inquiries to at least one author of the first file; receiving from the at least one author at least one response to the list of inquiries; selecting a subset of the plurality of web pages based on the at least one response; storing information related to the selected subset of the plurality of web pages for access if the first file is selected; providing, by the system server, the selected subset of the plurality of web pages to a user that selects the first file; and identifying the at least one author to the user.
|
1. A method of identifying web pages of a world wide web having relevance to a first file, comprising: identifying a plurality of web pages within the world wide web, wherein the plurality of web pages each have a relationship with the first file, wherein the world wide web provides a platform for sharing web pages, and wherein each web page includes a document or information resource that is suitable for the world wide web and is accessible through a web browser; generating, by a system server, a list of inquiries based on the plurality of web pages, wherein the list of inquiries includes search terms used in a search that identified the plurality of web pages; providing, by the system server, the list of inquiries to at least one author of the first file; receiving from the at least one author at least one response to the list of inquiries; selecting a subset of the plurality of web pages based on the at least one response; storing information related to the selected subset of the plurality of web pages for access if the first file is selected; providing, by the system server, the selected subset of the plurality of web pages to a user that selects the first file; and identifying the at least one author to the user. 5. The method of claim 1 , further comprising providing a hyperlink between the first file and the selected subset of the plurality of web pages, wherein the hyperlink influences a ranking of search results that include at least one of the first file and the plurality of web pages.
| 0.612507 |
1. A computer implemented method comprising: retrieving a plurality of search queries; defining relationships between search queries in the plurality of search queries based on semantic data associated with the search queries; generating, using at least one processor, a visual representation of the plurality of search queries; partitioning the visual representation into a plurality of tiles, each tile representing a predefined portion of the visual representation; storing multiple versions of the plurality of tiles, each version of the multiple versions associated with different zoom levels of the visual representation; retrieving metadata defining rendering characteristics of the plurality of search queries, the rendering characteristics including a characteristic defining how to render the plurality of search queries at each zoom level of the different zoom levels, the rendering of the search queries differing at the different zoom levels; and receiving a selection input selecting a first search query displayed in a tile of the plurality of tiles; identifying, using at least one processor, an additional tile associated with the first search query and additional search queries organized according to semantic relationship between the plurality of search queries; and transmitting the additional tile to a user device for display.
|
1. A computer implemented method comprising: retrieving a plurality of search queries; defining relationships between search queries in the plurality of search queries based on semantic data associated with the search queries; generating, using at least one processor, a visual representation of the plurality of search queries; partitioning the visual representation into a plurality of tiles, each tile representing a predefined portion of the visual representation; storing multiple versions of the plurality of tiles, each version of the multiple versions associated with different zoom levels of the visual representation; retrieving metadata defining rendering characteristics of the plurality of search queries, the rendering characteristics including a characteristic defining how to render the plurality of search queries at each zoom level of the different zoom levels, the rendering of the search queries differing at the different zoom levels; and receiving a selection input selecting a first search query displayed in a tile of the plurality of tiles; identifying, using at least one processor, an additional tile associated with the first search query and additional search queries organized according to semantic relationship between the plurality of search queries; and transmitting the additional tile to a user device for display. 3. The computer implemented method of claim 1 , wherein the semantic data includes a portion of an attribute shared by the first search query and a second search query.
| 0.862378 |
1. A machine-translation apparatus using multi-level verbal-phrase patterns, comprising: a basic verbal-phrase pattern database storing therein basic verbal-phrase patterns; a default verbal-phrase pattern database storing therein default verbal-phrase patterns; a default word-order verbal-phrase pattern database storing therein default word-order verbal-phrase patterns; a default preposition database storing therein default preposition patterns; a simple sentence generation unit for generating, by recomposing an input sentence, an input simple sentence having a structure of verbal-phrase patterns; a basic verbal-phrase pattern-matching unit for trying a match of a semantic code of each case component of the input simple sentence with the basic verbal-phrase patterns; a default verbal-phrase pattern matching unit for trying, if the basic verbal-phrase pattern-matching unit fails a complete match, a match of a size and case prepositions of the input simple sentence with the default verbal-phrase patterns having a verb identical to that of the input simple sentence; a default word-order matching unit for trying, if the default verbal-phrase pattern matching unit fails a complete match, a match of a word-order of the input simple sentence with the default word-order verbal-phrase patterns having a case component structure identical to that of the input simple sentence; and a default preposition matching unit for generating, if the default word-order verbal-phrase pattern matching unit succeeds in a complete match, a target sentence of the input sentence with the default preposition patterns having a context identical to that of the input simple sentence.
|
1. A machine-translation apparatus using multi-level verbal-phrase patterns, comprising: a basic verbal-phrase pattern database storing therein basic verbal-phrase patterns; a default verbal-phrase pattern database storing therein default verbal-phrase patterns; a default word-order verbal-phrase pattern database storing therein default word-order verbal-phrase patterns; a default preposition database storing therein default preposition patterns; a simple sentence generation unit for generating, by recomposing an input sentence, an input simple sentence having a structure of verbal-phrase patterns; a basic verbal-phrase pattern-matching unit for trying a match of a semantic code of each case component of the input simple sentence with the basic verbal-phrase patterns; a default verbal-phrase pattern matching unit for trying, if the basic verbal-phrase pattern-matching unit fails a complete match, a match of a size and case prepositions of the input simple sentence with the default verbal-phrase patterns having a verb identical to that of the input simple sentence; a default word-order matching unit for trying, if the default verbal-phrase pattern matching unit fails a complete match, a match of a word-order of the input simple sentence with the default word-order verbal-phrase patterns having a case component structure identical to that of the input simple sentence; and a default preposition matching unit for generating, if the default word-order verbal-phrase pattern matching unit succeeds in a complete match, a target sentence of the input sentence with the default preposition patterns having a context identical to that of the input simple sentence. 5. The machine-translation apparatus of claim 1 , wherein the default preposition database is constructed by storing therein prepositional target words as the default preposition patterns, the prepositional target words being extracted from the basic verbal-phrase patterns and corresponding to contexts of the basic verbal-phrase patterns.
| 0.737288 |
7. The method of claim 6 , wherein the first candidate word comprises a predicted word that is based at least in part on the set of candidate strings.
|
7. The method of claim 6 , wherein the first candidate word comprises a predicted word that is based at least in part on the set of candidate strings. 18. The method of claim 7 wherein the predicted word that is based at least in part on the set of candidate strings comprises the characters contained in one of the set of candidate strings.
| 0.960754 |
9. A system for generating, maintaining, updating, and augmenting a working database containing documents used as references for other documents in said working database through the use of a supplemental program operable within a word processor, comprising: a cpu processor and memory which perform the following: a symbol search and replace function where one or more symbols within the text of a new document are located and replaced with one or more corresponding codes, said one or more codes searchable by said word processor, said one or more codes having a standardized format identifiable by said word processor and other programs; an image search and replace function where one or more images within said new document are located and replaced with one or more corresponding textual image references, said one or more textual image references having a standardized format identifiable by said word processor and other programs; an automated text parsing function where said text and codes representing said symbols, and/or image within said new document are grouped and separated into discrete clusters by markers, initial positioning of said markers is determined by an algorithm, said automated text parsing function having a utility allowing said user to adjust said algorithm settings for initial positioning of said markers; a manual marker placement function, for placement adjustment, addition, and deletion of said markers within said new document; a highlighting function for highlighting said one or more marked discrete clusters within said new document, for verification by said user; an identification code assignment function for assigning one or more discrete identification codes to one or more corresponding said discrete clusters within said new document; a new document upload function for uploading said new document containing one or more said marked discrete clusters containing one or more corresponding said identification codes, into said working database; an upload verification function, for verification of the execution of a document upload and verification of a location and name of an uploaded document within a file system of said working database; a text segment selection function, for searching text of parent documents previously uploaded into said working database, said text segment selection function allowing said user to input a search string to retrieve a list of one or more of said parent documents relevant to said search string, said text segment selection function allowing said user to input a parent document identification code, parent document name, or parent document location on said working database in order to retrieve said relevant parent document text; a child document development function, where said user may select text from one or more of said parent documents and insert said selected text into a child document, said child document development function allowing said user to electively include or exclude said parent document identification codes when inserting said selected text into said child document; a text augmentation function where said user may alter, add to, and subtract from said inserted text within said child document, said text augmentation function allowing paraphrasing around said inserted text; an automated child document text parsing function where said text and said codes representing said symbols, and/or said images within said child document are grouped and separated into discrete clusters by markers; a marker repositioning function allowing adjustment of positioning of said markers in said child document to exclude said paraphrasing from said discrete clusters in said child document; a child document identification code assignment function where unique identification codes are assigned to said discrete clusters in said child document; an automated linking function where one or more links are automatically created between said discrete clusters within said one or more parent documents and said selected text inserted into said child document, said links contain said parent document identification codes and said child document identification codes; a manual linking function where one or more links are manually inserted by said user between one or more discrete clusters within said parent documents and one or discrete clusters within said child document, said links contain said parent document identification codes and said child document identification codes; a registry of links maintained by said system, said registry containing all said links between said parent document and said child document identification codes; an automated citation function where said one or more links are used to create one or more citations in said child document, said one or more citations referencing one or more said discrete clusters within said one or more parent documents; a child document upload function where said child document is uploaded into said working database, said child document upload function allowing said user to electively remove said parent document identification codes from said inserted text within said child document prior to uploading said child document into said working database, said child document upload retaining said links corresponding to said child document within said registry of links; a child document update function that searches for exact matches between text within said child document and text within one or more said documents stored within said working database, said child document update function using said child document text as a search string to search all text within said documents stored in said working database and/or said child document update function using said parent document identification codes electively retained in said child document or said parent document identification codes permanently recorded in said links, to search said working database for said exact matches; document maintenance function using said exact matches to set new markers around said text within said child document so that said discrete clusters of said child document matches said discrete clusters within said referenced parent documents; a prompting function alerting said user in the event said exact matches are not recovered, said prompting function providing a list of best matches between said text within said child document and text within one or more of said documents stored within said working database, said prompting function allowing said user to select from said list of best matches in order to set markers in said child document corresponding to text of one or more said best matches; a modified document upload function where said child document with added and or repositioned markers is uploaded into said working database, said modified document upload function either replacing the unmodified child document with a modified child document within said working database, or adding said modified child document to said working database; a document modification tracking function that monitors said parent documents having said links within said registry of links, said document modification tracking function monitoring said parent document for changes to text, symbols, format, and/or images, said document modification tracking function alerting users of corresponding child documents linked to said monitored parent documents, when one or more said monitored parent documents are modified; a document comparison function where one or more of said referenced documents are aligned with one or more referencing documents, said document comparison function visually tagging differences between said referenced and referencing documents.
|
9. A system for generating, maintaining, updating, and augmenting a working database containing documents used as references for other documents in said working database through the use of a supplemental program operable within a word processor, comprising: a cpu processor and memory which perform the following: a symbol search and replace function where one or more symbols within the text of a new document are located and replaced with one or more corresponding codes, said one or more codes searchable by said word processor, said one or more codes having a standardized format identifiable by said word processor and other programs; an image search and replace function where one or more images within said new document are located and replaced with one or more corresponding textual image references, said one or more textual image references having a standardized format identifiable by said word processor and other programs; an automated text parsing function where said text and codes representing said symbols, and/or image within said new document are grouped and separated into discrete clusters by markers, initial positioning of said markers is determined by an algorithm, said automated text parsing function having a utility allowing said user to adjust said algorithm settings for initial positioning of said markers; a manual marker placement function, for placement adjustment, addition, and deletion of said markers within said new document; a highlighting function for highlighting said one or more marked discrete clusters within said new document, for verification by said user; an identification code assignment function for assigning one or more discrete identification codes to one or more corresponding said discrete clusters within said new document; a new document upload function for uploading said new document containing one or more said marked discrete clusters containing one or more corresponding said identification codes, into said working database; an upload verification function, for verification of the execution of a document upload and verification of a location and name of an uploaded document within a file system of said working database; a text segment selection function, for searching text of parent documents previously uploaded into said working database, said text segment selection function allowing said user to input a search string to retrieve a list of one or more of said parent documents relevant to said search string, said text segment selection function allowing said user to input a parent document identification code, parent document name, or parent document location on said working database in order to retrieve said relevant parent document text; a child document development function, where said user may select text from one or more of said parent documents and insert said selected text into a child document, said child document development function allowing said user to electively include or exclude said parent document identification codes when inserting said selected text into said child document; a text augmentation function where said user may alter, add to, and subtract from said inserted text within said child document, said text augmentation function allowing paraphrasing around said inserted text; an automated child document text parsing function where said text and said codes representing said symbols, and/or said images within said child document are grouped and separated into discrete clusters by markers; a marker repositioning function allowing adjustment of positioning of said markers in said child document to exclude said paraphrasing from said discrete clusters in said child document; a child document identification code assignment function where unique identification codes are assigned to said discrete clusters in said child document; an automated linking function where one or more links are automatically created between said discrete clusters within said one or more parent documents and said selected text inserted into said child document, said links contain said parent document identification codes and said child document identification codes; a manual linking function where one or more links are manually inserted by said user between one or more discrete clusters within said parent documents and one or discrete clusters within said child document, said links contain said parent document identification codes and said child document identification codes; a registry of links maintained by said system, said registry containing all said links between said parent document and said child document identification codes; an automated citation function where said one or more links are used to create one or more citations in said child document, said one or more citations referencing one or more said discrete clusters within said one or more parent documents; a child document upload function where said child document is uploaded into said working database, said child document upload function allowing said user to electively remove said parent document identification codes from said inserted text within said child document prior to uploading said child document into said working database, said child document upload retaining said links corresponding to said child document within said registry of links; a child document update function that searches for exact matches between text within said child document and text within one or more said documents stored within said working database, said child document update function using said child document text as a search string to search all text within said documents stored in said working database and/or said child document update function using said parent document identification codes electively retained in said child document or said parent document identification codes permanently recorded in said links, to search said working database for said exact matches; document maintenance function using said exact matches to set new markers around said text within said child document so that said discrete clusters of said child document matches said discrete clusters within said referenced parent documents; a prompting function alerting said user in the event said exact matches are not recovered, said prompting function providing a list of best matches between said text within said child document and text within one or more of said documents stored within said working database, said prompting function allowing said user to select from said list of best matches in order to set markers in said child document corresponding to text of one or more said best matches; a modified document upload function where said child document with added and or repositioned markers is uploaded into said working database, said modified document upload function either replacing the unmodified child document with a modified child document within said working database, or adding said modified child document to said working database; a document modification tracking function that monitors said parent documents having said links within said registry of links, said document modification tracking function monitoring said parent document for changes to text, symbols, format, and/or images, said document modification tracking function alerting users of corresponding child documents linked to said monitored parent documents, when one or more said monitored parent documents are modified; a document comparison function where one or more of said referenced documents are aligned with one or more referencing documents, said document comparison function visually tagging differences between said referenced and referencing documents. 12. The system in claim 9 , in which one or more separate project databases are maintained for said system, said separate project databases operating identically and parallel to said working database.
| 0.563602 |
5. A method of copying data between disjoint applications, comprising: selecting a data record in a source application; extracting data from the data record, wherein the data extracted includes any portion of the data record that is required by a target application; launching a dialog box; displaying the extracted data in the dialog box; displaying a target application window of the target application; and copying and pasting the extracted data into the target application window in accordance with a set of data transfer rules, wherein the source application and the target application are disjoint from one another, wherein the set of data transfer rules include rules dictating at least one of a location in which the data is pasted, an order in which the data is pasted, and an arrangement of the data, and wherein a ticket number is generated by the target application and associated with the relevant data, and the ticket number is used in a subsequent window of the target application in order to complete the copying data between disjoint applications.
|
5. A method of copying data between disjoint applications, comprising: selecting a data record in a source application; extracting data from the data record, wherein the data extracted includes any portion of the data record that is required by a target application; launching a dialog box; displaying the extracted data in the dialog box; displaying a target application window of the target application; and copying and pasting the extracted data into the target application window in accordance with a set of data transfer rules, wherein the source application and the target application are disjoint from one another, wherein the set of data transfer rules include rules dictating at least one of a location in which the data is pasted, an order in which the data is pasted, and an arrangement of the data, and wherein a ticket number is generated by the target application and associated with the relevant data, and the ticket number is used in a subsequent window of the target application in order to complete the copying data between disjoint applications. 8. The method of claim 5 , wherein the data transfer rules provide a mapping of the data from the dialog box to the target application interface window.
| 0.614554 |
2. A system as in claim 1 , wherein the headline-editing module comprises a headline monitoring facility.
|
2. A system as in claim 1 , wherein the headline-editing module comprises a headline monitoring facility. 3. A system as in claim 2 , wherein the headline-monitoring facility uses at least some of the metadata generated by the preprocessing module and comprises a display that includes information associated with one or more articles to assist an editor in prioritizing the one or more articles for headlining.
| 0.871537 |
1. A computer-implemented method of interpreting well log data indicative of physical attributes of a portion of a subterranean formation comprising: partitioning, via computer, the well log data into i segments, each ith segment representing a respective contiguous portion of the extent of the logged well; defining, via computer, a membership function for each segment, the membership function defining a degree to which each segment belongs to a defined set; and determining, via computer, based on attribute values derived from previously interpreted depositional units, and the membership functions, a depositional type for each segment, converting, via computer, the well log data to shale volume data, wherein the shale volume data are represented as a series of numerical values V sh =s 1 , s 2 , . . . , s i , where s i is an average of the shale volume data within the ith segment.
|
1. A computer-implemented method of interpreting well log data indicative of physical attributes of a portion of a subterranean formation comprising: partitioning, via computer, the well log data into i segments, each ith segment representing a respective contiguous portion of the extent of the logged well; defining, via computer, a membership function for each segment, the membership function defining a degree to which each segment belongs to a defined set; and determining, via computer, based on attribute values derived from previously interpreted depositional units, and the membership functions, a depositional type for each segment, converting, via computer, the well log data to shale volume data, wherein the shale volume data are represented as a series of numerical values V sh =s 1 , s 2 , . . . , s i , where s i is an average of the shale volume data within the ith segment. 4. The computer-implemented method as in claim 1 , wherein the previously interpreted depositional units are previously interpreted by a human log data interpreter.
| 0.799757 |
11. A method of directing a computer that accesses hybrid network representation, the hybrid network representation having a schema describing a plurality of node types and link types, the method comprising: a. Receiving an identification from a user of a type of start node and a type of end node b. Determining a plurality of pathways from each node of the start node type to each node of the end node type c. Counting the links between nodes of each of the plurality of pathways; d. Ordering the plurality of pathways in order of fewest links per pathway to most links per pathway; and e. Ranking the ordered plurality of pathways on the basis of a cardinality of at least one node of at least one pathway.
|
11. A method of directing a computer that accesses hybrid network representation, the hybrid network representation having a schema describing a plurality of node types and link types, the method comprising: a. Receiving an identification from a user of a type of start node and a type of end node b. Determining a plurality of pathways from each node of the start node type to each node of the end node type c. Counting the links between nodes of each of the plurality of pathways; d. Ordering the plurality of pathways in order of fewest links per pathway to most links per pathway; and e. Ranking the ordered plurality of pathways on the basis of a cardinality of at least one node of at least one pathway. 12. The method of claim 11 , further comprising examining a first pathway for instances of start nodes and end nodes that comprises information that satisfies a query, the first pathway selected from the group of pathways between matching node types having a fewest link count.
| 0.629823 |
2. The method of claim 1 , wherein modifying the hierarchy of categories comprises adding a new category to generate a modified hierarchy of categories, the new category capable of being associated with one or more search results.
|
2. The method of claim 1 , wherein modifying the hierarchy of categories comprises adding a new category to generate a modified hierarchy of categories, the new category capable of being associated with one or more search results. 5. The method of claim 2 , wherein adding the new category comprises receiving a user entry defining the new category.
| 0.930714 |
1. A system for separating speech of individual speakers in audio segments representing speech of a plurality of speakers, the system comprising: one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a plurality of audio segments, wherein each audio segment of the plurality of audio segments includes a representation of speech generated by a speaker of the plurality of speakers; compute a speaker model for each audio segment of the plurality of audio segments; compute a plurality of scores, wherein each score of the plurality of scores corresponds to a pair of speaker models, the plurality of scores comprising a first score and a second score, wherein: the first score is computed using a first speaker model corresponding to a first audio segment and a second speaker model corresponding to a second audio segment, and the second score is computed using a third speaker model corresponding to a third audio segment and a fourth speaker model corresponding to a fourth audio segment; generate a graph, wherein each audio segment of the plurality of audio segments corresponds to a node in the graph; determine to include an edge between a first node of the graph and a second node of the graph using the first score, wherein the first node corresponds to the first audio segment and the second node corresponds to the second audio segment; determine to not include an edge between a third node of the graph and a fourth node of the graph using the second score, wherein the third node corresponds to the third audio segment and the fourth node corresponds to the fourth audio segment; determine that the first node corresponds to a first community of nodes using edges connected to the first node, wherein the first community of nodes corresponds to a first speaker of the plurality of speakers; and determine that the second node corresponds to a second community of nodes using edges connected to the second node, wherein the second community of nodes corresponds to a second speaker of the plurality of speakers.
|
1. A system for separating speech of individual speakers in audio segments representing speech of a plurality of speakers, the system comprising: one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a plurality of audio segments, wherein each audio segment of the plurality of audio segments includes a representation of speech generated by a speaker of the plurality of speakers; compute a speaker model for each audio segment of the plurality of audio segments; compute a plurality of scores, wherein each score of the plurality of scores corresponds to a pair of speaker models, the plurality of scores comprising a first score and a second score, wherein: the first score is computed using a first speaker model corresponding to a first audio segment and a second speaker model corresponding to a second audio segment, and the second score is computed using a third speaker model corresponding to a third audio segment and a fourth speaker model corresponding to a fourth audio segment; generate a graph, wherein each audio segment of the plurality of audio segments corresponds to a node in the graph; determine to include an edge between a first node of the graph and a second node of the graph using the first score, wherein the first node corresponds to the first audio segment and the second node corresponds to the second audio segment; determine to not include an edge between a third node of the graph and a fourth node of the graph using the second score, wherein the third node corresponds to the third audio segment and the fourth node corresponds to the fourth audio segment; determine that the first node corresponds to a first community of nodes using edges connected to the first node, wherein the first community of nodes corresponds to a first speaker of the plurality of speakers; and determine that the second node corresponds to a second community of nodes using edges connected to the second node, wherein the second community of nodes corresponds to a second speaker of the plurality of speakers. 6. The system of claim 1 , wherein the computer program components are further configured to determine that the first node corresponds to the first community of nodes through a plurality of iterations, wherein it is determined at each iteration whether to reassign a node to a different community.
| 0.506655 |
19. A method comprising: under control of one or more processors configured with executable instructions: performing an analysis of at least one of terms or phrases of searches performed by a plurality of members of the social network to infer interests of the plurality of members; determining, based on the analysis, that a number of the searches is associated with a topic of interest, the number of the searches being performed by a group of members included in the social network; storing mapping information in a database, the mapping information indicating that the group of members included in the social network is associated with the topic of interest; forming a subnetwork of the social network including the group of the members of the social network; receiving a search query from a user of the social network; determining search results responsive to the search query; returning the search results to the user of the social network; determining that the search query matches the topic of interest; and returning, to the user of the social network, a link associated with the group of members of the social network at least partly in response to determining that the search query matches the topic of interest.
|
19. A method comprising: under control of one or more processors configured with executable instructions: performing an analysis of at least one of terms or phrases of searches performed by a plurality of members of the social network to infer interests of the plurality of members; determining, based on the analysis, that a number of the searches is associated with a topic of interest, the number of the searches being performed by a group of members included in the social network; storing mapping information in a database, the mapping information indicating that the group of members included in the social network is associated with the topic of interest; forming a subnetwork of the social network including the group of the members of the social network; receiving a search query from a user of the social network; determining search results responsive to the search query; returning the search results to the user of the social network; determining that the search query matches the topic of interest; and returning, to the user of the social network, a link associated with the group of members of the social network at least partly in response to determining that the search query matches the topic of interest. 20. The method of claim 19 , further comprising generating a buddy list for the user of the social network that includes one or more other users of the social network that also share the topic of interest.
| 0.717895 |
1. A method for communication within a system, said method including: initiating an instant messaging conversation between a first user and a second user; receiving an indicator and a text entry from the first user during the instant messaging conversation, the indicator prompting a change in status of the first user; and changing the status of the first user, said changing of the status including: automatically setting the text entry as the status of the first user, and automatically including a name of the second user in the status of the first user if preferences of the first user indicate that the name of the second user is to be included in the status of the first user.
|
1. A method for communication within a system, said method including: initiating an instant messaging conversation between a first user and a second user; receiving an indicator and a text entry from the first user during the instant messaging conversation, the indicator prompting a change in status of the first user; and changing the status of the first user, said changing of the status including: automatically setting the text entry as the status of the first user, and automatically including a name of the second user in the status of the first user if preferences of the first user indicate that the name of the second user is to be included in the status of the first user. 6. The method according to claim 1 , wherein said changing of the status of the first user includes automatically setting the text entry as the status of the first user in the system and automatically setting the text entry as the status of the first user in at least one other system of the first user.
| 0.75 |
16. An electronically-implemented method for accessing mixed media reality document data structures, the method comprising: receiving, from a device, an image patch of a commercially printed document that includes a hotspot designation location, the image patch comprising at least a portion of an entire page of the commercially printed document that includes the hotspot designation location; extracting features from the image patch including generating a histogram to discriminate between text and non-text; determining a mixed media reality document data structure that corresponds to the image patch based on extracted features and the histogram; capturing an x-y location of a hotspot in response to receiving a print command by identifying a begin mark designating a beginning point of the hotspot designation location and an end mark designating an ending point of the hotspot designation location, the begin mark and the end mark being represented by a visually imperceptible font; instructing the device to highlight the hotspot based on the determining of the mixed media reality document data structure; retrieving the mixed media reality document data structure that corresponds to the image patch, the mixed media reality document data structure comprising: a representation of the portion of the commercially printed document corresponding to the image patch; and the hotspot that is sent for display along with the representation, the hotspot comprising a pointer to a supplemental media; and responsive to receiving an indication that a user selected the hotspot, sending the supplemental media associated with the hotspot.
|
16. An electronically-implemented method for accessing mixed media reality document data structures, the method comprising: receiving, from a device, an image patch of a commercially printed document that includes a hotspot designation location, the image patch comprising at least a portion of an entire page of the commercially printed document that includes the hotspot designation location; extracting features from the image patch including generating a histogram to discriminate between text and non-text; determining a mixed media reality document data structure that corresponds to the image patch based on extracted features and the histogram; capturing an x-y location of a hotspot in response to receiving a print command by identifying a begin mark designating a beginning point of the hotspot designation location and an end mark designating an ending point of the hotspot designation location, the begin mark and the end mark being represented by a visually imperceptible font; instructing the device to highlight the hotspot based on the determining of the mixed media reality document data structure; retrieving the mixed media reality document data structure that corresponds to the image patch, the mixed media reality document data structure comprising: a representation of the portion of the commercially printed document corresponding to the image patch; and the hotspot that is sent for display along with the representation, the hotspot comprising a pointer to a supplemental media; and responsive to receiving an indication that a user selected the hotspot, sending the supplemental media associated with the hotspot. 17. The method of claim 16 , wherein the mixed media reality document data structure includes a plurality of media files, and further comprising: receiving a user selection of one of the media files; and displaying the user-selected media file.
| 0.595034 |
4. The computer readable storage medium of claim 3 wherein the set of box elements is embodied as a vector of box elements and further comprising: an integer number of box elements in the DRS indicative of a length of the vector of box elements.
|
4. The computer readable storage medium of claim 3 wherein the set of box elements is embodied as a vector of box elements and further comprising: an integer number of box elements in the DRS indicative of a length of the vector of box elements. 5. The computer readable storage medium of claim 4 and the DRS further comprising: a vector map that includes a vector of lists of pairs of integers in the DRS; and an integer number of markers in the DRS, indicative of a length of the vector map.
| 0.848576 |
20. A system comprising at least one proxy server programmed to: receive a request comprising speech data from a mobile device; query a network service using query information obtained from the speech data, whereby search results are received from the network service; format the search results for presentation on a display of the mobile device; generate a voice grammar based at least in part on the search results; and send the search results and the voice grammar generated from the search results to the mobile device.
|
20. A system comprising at least one proxy server programmed to: receive a request comprising speech data from a mobile device; query a network service using query information obtained from the speech data, whereby search results are received from the network service; format the search results for presentation on a display of the mobile device; generate a voice grammar based at least in part on the search results; and send the search results and the voice grammar generated from the search results to the mobile device. 25. The system of claim 20 , wherein the at least one proxy server is further programmed to generate the voice grammar at least in part by selecting a term from the search results and dynamically generating the voice grammar to include the term selected from the search results, and wherein the at least one proxy server is further programmed to format the search results at least in part by creating a multi-modal markup language document which, upon execution, causes the term from the search results to be displayed upon a display screen of the mobile device, wherein the voice grammar is part of the multi-modal markup language document.
| 0.539447 |
13. A method for using an apparatus for differentiating between vowels and consonants in a spoken sound, the method comprising: passing a spoken sound longitudinally through a set of carbon nanotube bundles, wherein each carbon nanotube having different lengths and thickness from other carbon nanotube provides an output for differentiating the spoken sound as vowels and consonants; detecting variations on a set of characteristic parameters of the set of carbon nanotube bundles; and processing a plurality of signals associated with the set of characteristic parameters.
|
13. A method for using an apparatus for differentiating between vowels and consonants in a spoken sound, the method comprising: passing a spoken sound longitudinally through a set of carbon nanotube bundles, wherein each carbon nanotube having different lengths and thickness from other carbon nanotube provides an output for differentiating the spoken sound as vowels and consonants; detecting variations on a set of characteristic parameters of the set of carbon nanotube bundles; and processing a plurality of signals associated with the set of characteristic parameters. 15. The method of claim 13 , wherein the variations on the set of characteristic parameters are caused by a set of characteristics of the spoken sound.
| 0.803486 |
23. A system for responding to an inquiry comprising: means for retrieving a first web page and a second web page, the first web page associated with a first layout and the second web page associated with a second layout; means for comparing the first layout and the second layout; means for generating stored question-answer pairs based on the comparing the first layout and the second layout; means for receiving the inquiry via a network; means for analyzing stored question-answer pairs based on the inquiry; means for determining meta-level features of the stored question-answer pairs to define relationships among the stored question-answer pairs, the meta-level features of a particular stored question-answer pair based at least in part on the meta-level features of a previous related stored question-answer pair and a first related stored question-answer pair; means for clarifying the inquiry based on follow-up procedures including asking follow-up questions; means for determining a plurality of responses to the inquiry based on the analysis of the stored question-answer pairs, the relationships among the stored question-answer pairs, and the follow-up procedures; means for providing the plurality of responses; means for receiving a selection of a particular response from among the plurality of responses; and means for storing a measure of the eligibility of the particular response to be a response to the inquiry based on the selection.
|
23. A system for responding to an inquiry comprising: means for retrieving a first web page and a second web page, the first web page associated with a first layout and the second web page associated with a second layout; means for comparing the first layout and the second layout; means for generating stored question-answer pairs based on the comparing the first layout and the second layout; means for receiving the inquiry via a network; means for analyzing stored question-answer pairs based on the inquiry; means for determining meta-level features of the stored question-answer pairs to define relationships among the stored question-answer pairs, the meta-level features of a particular stored question-answer pair based at least in part on the meta-level features of a previous related stored question-answer pair and a first related stored question-answer pair; means for clarifying the inquiry based on follow-up procedures including asking follow-up questions; means for determining a plurality of responses to the inquiry based on the analysis of the stored question-answer pairs, the relationships among the stored question-answer pairs, and the follow-up procedures; means for providing the plurality of responses; means for receiving a selection of a particular response from among the plurality of responses; and means for storing a measure of the eligibility of the particular response to be a response to the inquiry based on the selection. 30. The system of claim 23 further comprising means for detecting semantic blocks encoded with similar layout properties to locate unstructured question-answer pairs.
| 0.544504 |
1. A multi-state barge-in acoustic model, the model comprising: a non-speech component comprising two one-state Hidden Markov Models (HMMs) and two three-state left-to-right HMMs; and a speech component comprising five three-state HMMs wherein each of the five three-state HMMs initially represents a different phonetic category.
|
1. A multi-state barge-in acoustic model, the model comprising: a non-speech component comprising two one-state Hidden Markov Models (HMMs) and two three-state left-to-right HMMs; and a speech component comprising five three-state HMMs wherein each of the five three-state HMMs initially represents a different phonetic category. 5. The model of claim 1 , wherein each state in the HMMs are represented as a Gaussian mixture.
| 0.881197 |
2. A method as recited in claim 1, wherein said generating step (d) comprises: (d1) generating optimal plans for the input query and for at least one of the alternative queries; and (d2) selecting for execution a lowest cost plan among said optimal plans.
|
2. A method as recited in claim 1, wherein said generating step (d) comprises: (d1) generating optimal plans for the input query and for at least one of the alternative queries; and (d2) selecting for execution a lowest cost plan among said optimal plans. 3. A method as recited in claim 2, wherein said generating step (d1) exploits commonality among queries across multiple queries.
| 0.831903 |
1. A method of searching a hierarchical database and an inverted index, comprising: receiving a single search query that has syntax identifying an unstructured search string within a structured search query to automatically cause a search of the inverted index and use of the result to automatically search the hierarchical database; extracting the unstructured search string from the single search query; searching the inverted index according to the unstructured search string, wherein the inverted index includes virtual documents created from data stored in the hierarchical database, wherein each virtual document includes a unique identifier from the hierarchical database used to designate the data in the hierarchical database from which that virtual document was created, wherein a result of the inverted index search includes the unique identifiers of the virtual documents that meet the search; and generating, for each of the unique identifiers in the result, a separate search query from the single search query by replacing the unstructured search string in the structured search query with that unique identifier, searching the hierarchical database according to the separate search query; wherein the hierarchical database includes one or more sub-trees branching from a tree root node, wherein each sub-tree includes one or more nodes starting at a sub-tree root node, and wherein each node has a unique identifier, and wherein creating the virtual documents includes selectively generating the virtual documents from the one or more sub-trees, wherein each of the virtual documents corresponds to one of the one or more sub-trees and includes all nodes of that sub-tree; and wherein the syntax for the single search query includes a SELECT clause and a FROM clause, wherein the SELECT clause includes syntax to identify a path in the hierarchical database starting at the tree root node, and wherein the FROM clause includes the unstructured search string.
|
1. A method of searching a hierarchical database and an inverted index, comprising: receiving a single search query that has syntax identifying an unstructured search string within a structured search query to automatically cause a search of the inverted index and use of the result to automatically search the hierarchical database; extracting the unstructured search string from the single search query; searching the inverted index according to the unstructured search string, wherein the inverted index includes virtual documents created from data stored in the hierarchical database, wherein each virtual document includes a unique identifier from the hierarchical database used to designate the data in the hierarchical database from which that virtual document was created, wherein a result of the inverted index search includes the unique identifiers of the virtual documents that meet the search; and generating, for each of the unique identifiers in the result, a separate search query from the single search query by replacing the unstructured search string in the structured search query with that unique identifier, searching the hierarchical database according to the separate search query; wherein the hierarchical database includes one or more sub-trees branching from a tree root node, wherein each sub-tree includes one or more nodes starting at a sub-tree root node, and wherein each node has a unique identifier, and wherein creating the virtual documents includes selectively generating the virtual documents from the one or more sub-trees, wherein each of the virtual documents corresponds to one of the one or more sub-trees and includes all nodes of that sub-tree; and wherein the syntax for the single search query includes a SELECT clause and a FROM clause, wherein the SELECT clause includes syntax to identify a path in the hierarchical database starting at the tree root node, and wherein the FROM clause includes the unstructured search string. 7. The method of claim 1 further comprising: receiving data to be merged in the hierarchical database; and merging the received data with the data stored in the hierarchical database upon receiving a single merge query that has syntax for inserting the received data into the hierarchical database and updating the data in the hierarchical database with the received data, wherein the received data is updated upon determining that the received data changes values of the data already stored in the hierarchical database.
| 0.644473 |
24. The system of claim 13 , wherein the trigger of the retrieval of the update to at least one of the registered retention policies, as a push mechanism, is by the at least one of the plurality of document owners.
|
24. The system of claim 13 , wherein the trigger of the retrieval of the update to at least one of the registered retention policies, as a push mechanism, is by the at least one of the plurality of document owners. 25. The system of claim 24 , wherein the at least one of the plurality of document owners specifies at creation of the same document whether the at least one of the registered retention policies may be updated by the push mechanism or is updated by a different mechanism.
| 0.963753 |
7. The method of claim 1 where returning the top-t records in R Q for a given value t, ranked by their relevancy to the query comprises maintaining a session cache for each user where each session cache keeps keywords that the user has input in the past and other information for each keyword, including its corresponding trie node and the top-t predicted records.
|
7. The method of claim 1 where returning the top-t records in R Q for a given value t, ranked by their relevancy to the query comprises maintaining a session cache for each user where each session cache keeps keywords that the user has input in the past and other information for each keyword, including its corresponding trie node and the top-t predicted records. 11. The method of claim 7 where prefix queries p 1 , p 2 ; : : : ; p x have been cached, further comprising inputting a new query p′=c 1 c 2 : : : c i c′ : : : c y , finding p i that has a longest prefix with p′, using node n i of p i to incrementally answer the new query p′ by inserting the characters after the longest prefix of the new query c′ : : : c y one by one, if there exists a cached keyword p i =p′, using the cached top-t records of p i to directly answer the query p′; otherwise if there is no such cached keyword, answering the query without use of any cache.
| 0.8602 |
11. The method of claim 8 , wherein the prior user interactions include a first prior user interaction and a second prior user interaction and wherein the first plurality of categories includes a first category and a second category.
|
11. The method of claim 8 , wherein the prior user interactions include a first prior user interaction and a second prior user interaction and wherein the first plurality of categories includes a first category and a second category. 12. The method of claim 11 , wherein the first prior user interaction includes purchasing an item that is described by the first listing that is included in the second category.
| 0.879211 |
10. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: selecting, from among a set of items of uploaded content, a first candidate training subset of the items of uploaded content that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, and (ii) are associated with a particular entity; for each of the items of uploaded content of the first candidate training subset that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, and (ii) are associated with a particular entity, obtaining one or more acoustic features that are extracted from the item of uploaded content of the first candidate training subset; selecting, from among the first candidate training subset of the items of uploaded content a second, filtered candidate training subset of the items of uploaded content that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, (ii) are associated with a particular entity, and (iii) each has acoustic features that are indicated as similar to acoustic features of one or more other items of uploaded content of the first subset; and using one or more respective acoustic features of one or more of the items of uploaded content of the second, filtered candidate training subset that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, (ii) are associated with a particular entity, and (iii) each has acoustic features that are indicated as similar to acoustic features of one or more other items of uploaded content of the first candidate training subset, in recognizing whether a subsequently received audio sample is likely also associated with the particular entity.
|
10. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: selecting, from among a set of items of uploaded content, a first candidate training subset of the items of uploaded content that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, and (ii) are associated with a particular entity; for each of the items of uploaded content of the first candidate training subset that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, and (ii) are associated with a particular entity, obtaining one or more acoustic features that are extracted from the item of uploaded content of the first candidate training subset; selecting, from among the first candidate training subset of the items of uploaded content a second, filtered candidate training subset of the items of uploaded content that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, (ii) are associated with a particular entity, and (iii) each has acoustic features that are indicated as similar to acoustic features of one or more other items of uploaded content of the first subset; and using one or more respective acoustic features of one or more of the items of uploaded content of the second, filtered candidate training subset that (i) each has a respective textual label that includes particular text that is indicative of a presence of a sound of a human voice, and of an absence of background sounds that include sounds other than that of a human voice, (ii) are associated with a particular entity, and (iii) each has acoustic features that are indicated as similar to acoustic features of one or more other items of uploaded content of the first candidate training subset, in recognizing whether a subsequently received audio sample is likely also associated with the particular entity. 15. The system of claim 10 , wherein using one or more respective acoustic features of one or more of the items of uploaded content of the second filtered candidate training subset in recognizing whether a subsequently received audio sample is likely also associated with the particular entity comprises training an automated recognition system using the one or more respective acoustic features.
| 0.516556 |
2. The automatic typographic page formatter set forth in claim 1 further including, in combination: define area means in said named area control means and being coupled to said receiving means to be responsive to second ones of said embedded commands to create named areas for receiving text and graphic digital signals and indicating location thereof, said created named areas including section named areas to be located with respect to predetermined ones of said predetermined portions and page named areas for receiving text and graphic digital signals for text and graphics to be located anywhere on a page being formatted independently of said portions; section named area means in said named area control means having said section named areas and being coupled to said receiving means to be responsive to first ones of said embedded commands to format received predetermined text and graphic digital signals to section named areas; page named area means in said named area control means and having page named areas and being coupled to said receiving means to be responsive to said first ones of said embedded commands to format predetermined received text and graphics digital signals to said page named areas; and named area placement means coupled to said page and section named area means and to said first means for being responsive to said first means indicating end of formatting said portions on a page to place text formatted to any of said page named areas on said page just ended and being further responsive to received third ones of said embedded commands to place text formatted to any of said section named areas to said page being formatted to a one of said portions.
|
2. The automatic typographic page formatter set forth in claim 1 further including, in combination: define area means in said named area control means and being coupled to said receiving means to be responsive to second ones of said embedded commands to create named areas for receiving text and graphic digital signals and indicating location thereof, said created named areas including section named areas to be located with respect to predetermined ones of said predetermined portions and page named areas for receiving text and graphic digital signals for text and graphics to be located anywhere on a page being formatted independently of said portions; section named area means in said named area control means having said section named areas and being coupled to said receiving means to be responsive to first ones of said embedded commands to format received predetermined text and graphic digital signals to section named areas; page named area means in said named area control means and having page named areas and being coupled to said receiving means to be responsive to said first ones of said embedded commands to format predetermined received text and graphics digital signals to said page named areas; and named area placement means coupled to said page and section named area means and to said first means for being responsive to said first means indicating end of formatting said portions on a page to place text formatted to any of said page named areas on said page just ended and being further responsive to received third ones of said embedded commands to place text formatted to any of said section named areas to said page being formatted to a one of said portions. 4. The automatic typographic page formatter set forth in claim 2 wherein said section named area means includes means for limiting placing text digital signals onto a page and further having means coupled to said first means for ending placing of said text signals onto a page for starting a new page based upon text digital signals from a section named area such that a plurality of pages can be formatted via said first means and said section named area means using text signals of said section named areas for determining pagination.
| 0.676059 |
1. A method of displaying an original document having text and possibly non-text images therein, and a translation of the original document, comprising the steps of: creating a bitmap image of the original document; creating a translation bitmap of the same size as the original document bitmap, the translation bitmap including reproductions of any non-text images in the original document and translations of the text of the original document, the translated text and any non-text images in the translation bitmap being spatially aligned with respect to the original document bitmap such that any non-text images appear at the same location in the original document bitmap and the translation bitmap, and the translated text appears at a location in the translation bitmap proximate to the location of the corresponding text in the original document bitmap; storing the bitmaps for use in a computer system having a display; displaying at least a portion of the original document bitmap in a main display area on the computer system display; and displaying a translation window over the main display area, with the translation window displaying the portion of the translation bitmap that corresponds to the portion of the original document bitmap covered by the translation window.
|
1. A method of displaying an original document having text and possibly non-text images therein, and a translation of the original document, comprising the steps of: creating a bitmap image of the original document; creating a translation bitmap of the same size as the original document bitmap, the translation bitmap including reproductions of any non-text images in the original document and translations of the text of the original document, the translated text and any non-text images in the translation bitmap being spatially aligned with respect to the original document bitmap such that any non-text images appear at the same location in the original document bitmap and the translation bitmap, and the translated text appears at a location in the translation bitmap proximate to the location of the corresponding text in the original document bitmap; storing the bitmaps for use in a computer system having a display; displaying at least a portion of the original document bitmap in a main display area on the computer system display; and displaying a translation window over the main display area, with the translation window displaying the portion of the translation bitmap that corresponds to the portion of the original document bitmap covered by the translation window. 9. The method of claim 1 wherein the size of the original document bitmap is larger than the main display, further comprising the step of scrolling the image displayed in the main display, and in response to scrolling of the main display, scrolling the translation windows contents such that the contents of the translation window continue to correspond to the portion of the original document bitmap which is covered by the translation window during the scrolling.
| 0.621235 |
5. A computer program product comprising a non-transitory computer readable medium having a computer readable program, wherein the computer readable program, when executed on a computing device, causes the computing device to: perform a look-ahead operation to examine an instruction stream being pre-fetched for a thread being executed by a processor, wherein the instruction stream comprises instructions to be executed by the processor; detect a programming idiom begin hint instruction that exposes a predetermined programming idiom comprising a sequence of a plurality of instructions that performs a function, and a programming idiom end hint instruction, wherein the programming idiom begin hint instruction marks a beginning of the programming idiom at a next instruction in the instruction stream and wherein the programming idiom end hint instruction marks an end of the programming idiom in the instruction stream; and perform an action to accelerate execution of the sequence of instructions by the processor; wherein the data processing system is a multiple processor data processing system and wherein performing a look-ahead operation comprises examining, by the programming idiom accelerator, instructions streams being pre-fetched from memory via a bus for a plurality of threads running on a plurality of processors in the multiple processor data processing system to identify at least one predetermined programming idiom; wherein the predetermined programming idiom is a wake-and-go programming idiom comprising a load instruction to load a data value from a target address, a compare instruction to compare the loaded data value to an expected value, and a branch instruction to branch responsive to the compare instruction resulting in a match; wherein the action comprises performing the following operations on behalf of the thread; storing the target address in a wake-and-go storage array; loading a data value from the target address; and comparing the loaded data value to the expected value.
|
5. A computer program product comprising a non-transitory computer readable medium having a computer readable program, wherein the computer readable program, when executed on a computing device, causes the computing device to: perform a look-ahead operation to examine an instruction stream being pre-fetched for a thread being executed by a processor, wherein the instruction stream comprises instructions to be executed by the processor; detect a programming idiom begin hint instruction that exposes a predetermined programming idiom comprising a sequence of a plurality of instructions that performs a function, and a programming idiom end hint instruction, wherein the programming idiom begin hint instruction marks a beginning of the programming idiom at a next instruction in the instruction stream and wherein the programming idiom end hint instruction marks an end of the programming idiom in the instruction stream; and perform an action to accelerate execution of the sequence of instructions by the processor; wherein the data processing system is a multiple processor data processing system and wherein performing a look-ahead operation comprises examining, by the programming idiom accelerator, instructions streams being pre-fetched from memory via a bus for a plurality of threads running on a plurality of processors in the multiple processor data processing system to identify at least one predetermined programming idiom; wherein the predetermined programming idiom is a wake-and-go programming idiom comprising a load instruction to load a data value from a target address, a compare instruction to compare the loaded data value to an expected value, and a branch instruction to branch responsive to the compare instruction resulting in a match; wherein the action comprises performing the following operations on behalf of the thread; storing the target address in a wake-and-go storage array; loading a data value from the target address; and comparing the loaded data value to the expected value. 7. The computer program product of claim 5 , wherein the computer readable program is stored in a computer readable storage medium in a data processing system and wherein the computer readable program was downloaded over a network from a remote data processing system.
| 0.606725 |
8. An Electronic Service System (ESS) computing device comprising: a processor; and memory coupled to the processor and storing instructions that, when executed by the processor, cause the ESS computing device to perform operations comprising: accessing an electronic document uploaded to the ESS computing device by a first client computing device of a first user; accessing a set of custody rules associated with the electronic document, the set of custody rules controlling access to the document by a plurality of users including the first user and a second user of a second client computing device, the set of custody rules including a custody rule transferring an access right from the first user to a second user of the plurality of users based on occurrence of at least one event; processing a transaction associated with the electronic document and involving a third client computing device of a third user of the plurality of users; detecting, based at least in part on evaluation of operations performed by the third client computing device in reference to the transaction, an occurrence of the at least one event; and in response to the occurrence of the at least one event, transferring custody of the electronic document from the first user to the second user in accordance with the access right, and denying the first user access, via the first client computing device, to the electronic document governed by the access right while granting the second user access, via the second client computing device, to the electronic document governed by the access right.
|
8. An Electronic Service System (ESS) computing device comprising: a processor; and memory coupled to the processor and storing instructions that, when executed by the processor, cause the ESS computing device to perform operations comprising: accessing an electronic document uploaded to the ESS computing device by a first client computing device of a first user; accessing a set of custody rules associated with the electronic document, the set of custody rules controlling access to the document by a plurality of users including the first user and a second user of a second client computing device, the set of custody rules including a custody rule transferring an access right from the first user to a second user of the plurality of users based on occurrence of at least one event; processing a transaction associated with the electronic document and involving a third client computing device of a third user of the plurality of users; detecting, based at least in part on evaluation of operations performed by the third client computing device in reference to the transaction, an occurrence of the at least one event; and in response to the occurrence of the at least one event, transferring custody of the electronic document from the first user to the second user in accordance with the access right, and denying the first user access, via the first client computing device, to the electronic document governed by the access right while granting the second user access, via the second client computing device, to the electronic document governed by the access right. 13. The computing system of claim 8 , wherein the instructions further include instructions that cause the computing system to perform an operation including storing data indicating the transfer of custody of the electronic document to prevent a client device associated with the first user from accessing the electronic document according to the access right with respect to the electronic document, and to allow access to the electronic document according to the access right with respect to the electronic document to a client device associated with the second user.
| 0.5 |
21. The method of claim 19 , comprising customizing, based on the user profile data, the first search result for receipt by the user.
|
21. The method of claim 19 , comprising customizing, based on the user profile data, the first search result for receipt by the user. 22. The method of claim 21 , wherein customizing, based on the user profile data, the first search result comprises at least one of aurally enhancing the first search result, visually enhancing the first search result, textually enhancing the first search result, anecdotally enhancing the first search result, and logically enhancing the first search result.
| 0.851955 |
1. A method comprising: extracting one or more features corresponding to one or more objects from a file containing two or more codestreams for a selected viewport of a page of the file, including extracting at least one of the one or more features without decoding; predicting a next viewport of the page from a plurality of different viewports based on a relationship of the next viewport to the selected viewport within the page, the predicted next viewport including one or more predicted objects from the file; ranking document objects based on a task being performed by an application, the one or more extracted features, and an overlap of document objects with the selected viewport that is to be displayed; selecting a set of the document objects based on rank and at least one constraint for the selected viewport; ranking the one or more predicted objects based on the task being performed by the application, the one or more extracted features for the document objects, and a probability that document objects overlap two or more of a plurality of different potential next viewports; and selecting a second set of document objects based on the predicted next viewport of the page and the ranking of the one or more predicted objects without receiving a client request associated with the predicted next viewport.
|
1. A method comprising: extracting one or more features corresponding to one or more objects from a file containing two or more codestreams for a selected viewport of a page of the file, including extracting at least one of the one or more features without decoding; predicting a next viewport of the page from a plurality of different viewports based on a relationship of the next viewport to the selected viewport within the page, the predicted next viewport including one or more predicted objects from the file; ranking document objects based on a task being performed by an application, the one or more extracted features, and an overlap of document objects with the selected viewport that is to be displayed; selecting a set of the document objects based on rank and at least one constraint for the selected viewport; ranking the one or more predicted objects based on the task being performed by the application, the one or more extracted features for the document objects, and a probability that document objects overlap two or more of a plurality of different potential next viewports; and selecting a second set of document objects based on the predicted next viewport of the page and the ranking of the one or more predicted objects without receiving a client request associated with the predicted next viewport. 4. The method defined in claim 1 further wherein extracting one or more features comprises determining a compression type and object location for each of a plurality of objects in the compressed file without decoding any codestream.
| 0.561404 |
23. A voice controlled wireless communications system, comprising: a central computing device unit; one or more concentrators coupled to the central computing device unit over a link wherein each network concentrator communicates with the central computing device unit, each network concentrator having a coverage range; a plurality of wireless devices that wirelessly communicate with a network concentrator when the wireless device is in the coverage range of the network concentrator; and the central computing device unit further comprising a voice command interpreter having a speech recognition engine and one or more pieces of grammar associated with the speech recognition engine wherein the one or more pieces of grammar contains a word and an artificial ambiguity about one or more homonyms for the word that are inserted into the one or more pieces of grammar of the speech recognition engine for the word to create an ambiguity between the word and the one or more homonyms; and the voice command interpreter identifies a correct interpretation for a received word that has the one or more homonyms based on the received word and the one or more pieces of grammar for the word that includes the inserted information about the one or more homonyms.
|
23. A voice controlled wireless communications system, comprising: a central computing device unit; one or more concentrators coupled to the central computing device unit over a link wherein each network concentrator communicates with the central computing device unit, each network concentrator having a coverage range; a plurality of wireless devices that wirelessly communicate with a network concentrator when the wireless device is in the coverage range of the network concentrator; and the central computing device unit further comprising a voice command interpreter having a speech recognition engine and one or more pieces of grammar associated with the speech recognition engine wherein the one or more pieces of grammar contains a word and an artificial ambiguity about one or more homonyms for the word that are inserted into the one or more pieces of grammar of the speech recognition engine for the word to create an ambiguity between the word and the one or more homonyms; and the voice command interpreter identifies a correct interpretation for a received word that has the one or more homonyms based on the received word and the one or more pieces of grammar for the word that includes the inserted information about the one or more homonyms. 31. The system of claim 23 further comprising a grammar database that stores the one or more pieces of grammar.
| 0.62331 |
7. A target speech extraction method for a microphone-array-based speech recognition system, comprising: separating mixed signals input through a plurality of microphone into sound-source signals by an ICA; extracting one target speech spoken for speech recognition from the separated sound-source signals; and recognizing a desired speech from the extracted target speech, wherein the extracting of the target speech comprises: extracting feature vector sequence X i from the separated sound-source signals; calculating an ith LLR (logarithm likelihood ratio) LLR i of the extracted feature vector sequence; calculating a maximum value using the LLR i ; comparing the maximum value with a predetermined threshold value; and determining the maximum value to be the target speech when the maximum value is larger than the threshold value.
|
7. A target speech extraction method for a microphone-array-based speech recognition system, comprising: separating mixed signals input through a plurality of microphone into sound-source signals by an ICA; extracting one target speech spoken for speech recognition from the separated sound-source signals; and recognizing a desired speech from the extracted target speech, wherein the extracting of the target speech comprises: extracting feature vector sequence X i from the separated sound-source signals; calculating an ith LLR (logarithm likelihood ratio) LLR i of the extracted feature vector sequence; calculating a maximum value using the LLR i ; comparing the maximum value with a predetermined threshold value; and determining the maximum value to be the target speech when the maximum value is larger than the threshold value. 15. The target speech extraction method of claim 7 , wherein the extracting of the target speech comprises: in a case where the additional information for the target speech is not provided, performing primary speech recognition for the separated sound-source signals by using an HMM (hidden Markov model) as a speech-recognition acoustic model; calculating a closest HMM and a state column thereof for a sequence of the words obtained through the speech recognition; calculating LLR i by using the HMMs; calculating a maximum value by using the calculated LLRi; comparing the maximum value with a predetermined threshold value; and determining the maximum value to be the target speech if the maximum value is larger than the threshold value.
| 0.5 |
11. A method to facilitate associating structured content in a structured document with unstructured content in an unstructured document, the method comprising: obtaining a matched set of documents, wherein the matched set of documents includes an unstructured document, and a structured document generated from the unstructured document having related content so that segmented unstructured content fragments from the unstructured document correspond to structured content fragments in the structured document; wherein generating the structured document from the unstructured document comprises: analyzing human-readable textual content in the unstructured document, segmenting the human-readable textual content into individual unstructured content fragments based on the analysis, the unstructured content fragments being contiguous sections of textual content in the unstructured document; facilitating application of tags to the unstructured content fragments by a user, the tags determined based on one or more of tags previously applied by the user or tags previously applied to content associated with the unstructured document; and generating the structured document based on the tags and the unstructured content fragments such that the segmented unstructured content fragments from the unstructured document correspond to the structured content fragments in the structured document; identifying numeric instances present in the obtained documents such that, responsive to obtaining the matched set of documents, a first set of numeric instances present in the structured document and a second set of numeric instances present in the unstructured document are identified, the first set of numeric instances including a first numeric instance appearing in the structured document with a first structured content fragment; determining the uniqueness of individual ones of the first set of numeric instances present in the structured document, wherein a unique numeric instance expresses a unique first number; obtaining differentiated data sets associated with non-unique numeric instances in the structured document that differentiate the non-unique numeric instances from other non-unique numeric instances with the same numeric value such that, responsive to the first numeric instance being non-unique, a differentiated data set associated with the first numeric instance is obtained, the differentiated data set including structured contextual information assigned to the first numeric instance; and correlating structured content fragments in the structured document with unstructured content fragments in the unstructured document such that, responsive to obtaining the differentiated data set associated with the first numeric instance in the structured document, a corresponding second numeric instance from the second set of numeric instances in the unstructured document is identified, and the first structured content fragment including the first numeric instance is correlated with an unstructured content fragment containing the second numeric instance in the unstructured document.
|
11. A method to facilitate associating structured content in a structured document with unstructured content in an unstructured document, the method comprising: obtaining a matched set of documents, wherein the matched set of documents includes an unstructured document, and a structured document generated from the unstructured document having related content so that segmented unstructured content fragments from the unstructured document correspond to structured content fragments in the structured document; wherein generating the structured document from the unstructured document comprises: analyzing human-readable textual content in the unstructured document, segmenting the human-readable textual content into individual unstructured content fragments based on the analysis, the unstructured content fragments being contiguous sections of textual content in the unstructured document; facilitating application of tags to the unstructured content fragments by a user, the tags determined based on one or more of tags previously applied by the user or tags previously applied to content associated with the unstructured document; and generating the structured document based on the tags and the unstructured content fragments such that the segmented unstructured content fragments from the unstructured document correspond to the structured content fragments in the structured document; identifying numeric instances present in the obtained documents such that, responsive to obtaining the matched set of documents, a first set of numeric instances present in the structured document and a second set of numeric instances present in the unstructured document are identified, the first set of numeric instances including a first numeric instance appearing in the structured document with a first structured content fragment; determining the uniqueness of individual ones of the first set of numeric instances present in the structured document, wherein a unique numeric instance expresses a unique first number; obtaining differentiated data sets associated with non-unique numeric instances in the structured document that differentiate the non-unique numeric instances from other non-unique numeric instances with the same numeric value such that, responsive to the first numeric instance being non-unique, a differentiated data set associated with the first numeric instance is obtained, the differentiated data set including structured contextual information assigned to the first numeric instance; and correlating structured content fragments in the structured document with unstructured content fragments in the unstructured document such that, responsive to obtaining the differentiated data set associated with the first numeric instance in the structured document, a corresponding second numeric instance from the second set of numeric instances in the unstructured document is identified, and the first structured content fragment including the first numeric instance is correlated with an unstructured content fragment containing the second numeric instance in the unstructured document. 19. The method of claim 11 , wherein the structured document is an XBRL document.
| 0.669106 |
13. A system, comprising: a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to: perform one or more machine learning operations on a set of seed rules to generate a new set of rules for determining whether a given pair of information items have a specific relationship, wherein the set of seed rules comprises one or more rules resulting from one or more previously performed machine learning operations and one or more randomly or pseudo-randomly generated rules, wherein: the one or more previously performed machine learning operations were performed in regard to a set of information items including one or more differences from another set of information items used in generating the new set of rules, or the specific relationship is different than another specific relationship for which the new set of rules was generated; and apply the new set of rules to one or more pairs of information items to identify at least one pair of information items as having the specific relationship.
|
13. A system, comprising: a memory; and one or more processors coupled to the memory, wherein the memory comprises program instructions executable by the one or more processors to: perform one or more machine learning operations on a set of seed rules to generate a new set of rules for determining whether a given pair of information items have a specific relationship, wherein the set of seed rules comprises one or more rules resulting from one or more previously performed machine learning operations and one or more randomly or pseudo-randomly generated rules, wherein: the one or more previously performed machine learning operations were performed in regard to a set of information items including one or more differences from another set of information items used in generating the new set of rules, or the specific relationship is different than another specific relationship for which the new set of rules was generated; and apply the new set of rules to one or more pairs of information items to identify at least one pair of information items as having the specific relationship. 15. The computer-implemented system of claim 13 , wherein to perform said one or more machine learning operations the program instructions are configured to perform genetic algorithm (GA) operations including one or more of: a mutation operation or a crossover operation.
| 0.722801 |
18. The non-transitory computer-readable storage medium of claim 12 , further comprising instructions for displaying, said instructions which when executed, cause the one or more processors to perform steps comprising: for each unique path representation found within the set of location indicators: counting a number of occurrences of said each unique path representation within the set of location indicators; and displaying (a) a path represented by said each unique path representation, and (b) the number of occurrences of said each unique path representation.
|
18. The non-transitory computer-readable storage medium of claim 12 , further comprising instructions for displaying, said instructions which when executed, cause the one or more processors to perform steps comprising: for each unique path representation found within the set of location indicators: counting a number of occurrences of said each unique path representation within the set of location indicators; and displaying (a) a path represented by said each unique path representation, and (b) the number of occurrences of said each unique path representation. 20. The non-transitory computer-readable storage medium of claim 18 , further comprising instructions, which when executed, cause the one or more processors to perform steps comprising: (a) display the path represented by said each unique path representation comprising: identifying a first prefix; associating the first prefix with a set of path representations, wherein the set of path representations is a subset of all the unique path representations for the entire set of XML document and the each path representation in the set of path representations starts with the first prefix; and displaying the first prefix; and (b) display the number of occurrences of said each unique path representation comprising: determining the sum of the number of occurrences for all of the path representations in the set of path representations; and displaying said sum.
| 0.611197 |
28. A system for managing an information network by providing an interface between a social network and a content network, the system comprising: a community keeper configured to maintain a community index table and coordinate operations of a created community of users across network devices; a resource grid configured to define an interaction record structure including a tagged grid; wherein the community keeper is further configured to store an interaction record of content in the community of users based upon the interaction record structure and to create a community index of content of the interaction record; wherein the resource grid is further configured to tag the interaction record with a user generated description of content; and a content synchronization module configured to synchronize the community of users based upon the community index by providing an updated content component in the stored interaction record to users such that the users have the same interaction record and wherein the content synchronization module is further configured to update the community index of the interaction record.
|
28. A system for managing an information network by providing an interface between a social network and a content network, the system comprising: a community keeper configured to maintain a community index table and coordinate operations of a created community of users across network devices; a resource grid configured to define an interaction record structure including a tagged grid; wherein the community keeper is further configured to store an interaction record of content in the community of users based upon the interaction record structure and to create a community index of content of the interaction record; wherein the resource grid is further configured to tag the interaction record with a user generated description of content; and a content synchronization module configured to synchronize the community of users based upon the community index by providing an updated content component in the stored interaction record to users such that the users have the same interaction record and wherein the content synchronization module is further configured to update the community index of the interaction record. 31. The system of claim 28 further comprising: a content management module configured to receive indexing standards created by the community of users and further configured to manage content within the community of users based upon the indexing standards.
| 0.641238 |
1. A method for processing a character comprising: receiving a value corresponding to a character; determining whether the character is associated with a predetermined language based at least in part on the received value; transforming the value corresponding to the character into a transformed value that falls within a private area of Unicode if it is determined that the value corresponding to the character is not associated with the predetermined language; transforming the value corresponding to the character into a transformed value that falls outside of the private area of Unicode if it is determined that the value corresponding to the character is associated with the predetermined language; and storing a result of the transformation.
|
1. A method for processing a character comprising: receiving a value corresponding to a character; determining whether the character is associated with a predetermined language based at least in part on the received value; transforming the value corresponding to the character into a transformed value that falls within a private area of Unicode if it is determined that the value corresponding to the character is not associated with the predetermined language; transforming the value corresponding to the character into a transformed value that falls outside of the private area of Unicode if it is determined that the value corresponding to the character is associated with the predetermined language; and storing a result of the transformation. 4. The method of claim 1 , wherein transforming includes adding a predetermined number of bits to a byte, wherein the byte is associated with the character.
| 0.632843 |
10. The computer-readable medium of claim 9 , wherein in response to the identification of the user of the document, calling a user information database from the manifest to obtain profile information associated with the user of the document; and wherein generating a document solution tailored to the profile information associated with the user of the document includes selecting one or more document solution components from a plurality of document solution components based on the profile information.
|
10. The computer-readable medium of claim 9 , wherein in response to the identification of the user of the document, calling a user information database from the manifest to obtain profile information associated with the user of the document; and wherein generating a document solution tailored to the profile information associated with the user of the document includes selecting one or more document solution components from a plurality of document solution components based on the profile information. 11. The computer-readable medium of claim 10 , prior to downloading the software components to the application, further comprising: if the plurality of software components is not present in the local library of software components, calling the manifest for obtaining the document solution.
| 0.919427 |
7. A device for posting microblog message on a network, comprising: a memory storing a set of program codes; and a processor configured to invoke the set of program codes to: receive text content and a posting operation instruction input by a user; acquire text content input by the user; calculate the number of characters of the text content; monitor the posting operation instruction for the text content of the user; store a preset threshold; determine whether the number of the characters of the text content exceeds the preset threshold; convert the text content into a format of messages, including the format of a picture, according to a user selection from a plurality of format settings, if the number of the characters of the text content exceeds the preset threshold, and post the converted format of messages received as a microblog message on the network.
|
7. A device for posting microblog message on a network, comprising: a memory storing a set of program codes; and a processor configured to invoke the set of program codes to: receive text content and a posting operation instruction input by a user; acquire text content input by the user; calculate the number of characters of the text content; monitor the posting operation instruction for the text content of the user; store a preset threshold; determine whether the number of the characters of the text content exceeds the preset threshold; convert the text content into a format of messages, including the format of a picture, according to a user selection from a plurality of format settings, if the number of the characters of the text content exceeds the preset threshold, and post the converted format of messages received as a microblog message on the network. 10. The device according to claim 7 , wherein the set of program codes is invoked by the processor to determine whether converting the text content into a format of messages according a user selection.
| 0.678222 |
2. The method of claim 1 , wherein the at least one related unit of measurement comprises an alias of the initial unit of measurement.
|
2. The method of claim 1 , wherein the at least one related unit of measurement comprises an alias of the initial unit of measurement. 3. The method of claim 2 , wherein the alias comprises at least one of a contracted form of the initial unit of measurement, a fall name of the initial unit of measurement, a language translation of the initial unit of measurement, and an alternate spelling of the initial unit of measurement.
| 0.923197 |
1. A search method comprising: creating a list of candidate probe words; for each candidate probe word, counting a number of item descriptions that contain the candidate probe word; choosing, with a computer, q i probe words from the candidate probe words whose word count is closest to |D i |/(q i +1), where D i is a set of remaining item descriptions after a previous repetition, and q i represents a number of probe words presented for user selection for the ith repetition and is an integer greater than 1; presenting the q i probe words for selection by the user; receiving a selection of one of the q i probe words by the user; pruning the list of candidate probe words to eliminate item descriptions that include non-selected ones of the q i probe words to create a pruned list of candidate probe words; choosing q i+1 probe words from the pruned list of candidate probe words that is closest to |D i+1 |/(q i+1 +1), wherein D i+1 is a set of remaining item descriptions after the ith repetition, q i+1 represents a number of probe words presented for user selection for the i+1 repetition and is an integer greater than 1, and the pruned list of candidate probe words includes the selected one of the q i probe words; and presenting the q i+1 probe words for selection by the user.
|
1. A search method comprising: creating a list of candidate probe words; for each candidate probe word, counting a number of item descriptions that contain the candidate probe word; choosing, with a computer, q i probe words from the candidate probe words whose word count is closest to |D i |/(q i +1), where D i is a set of remaining item descriptions after a previous repetition, and q i represents a number of probe words presented for user selection for the ith repetition and is an integer greater than 1; presenting the q i probe words for selection by the user; receiving a selection of one of the q i probe words by the user; pruning the list of candidate probe words to eliminate item descriptions that include non-selected ones of the q i probe words to create a pruned list of candidate probe words; choosing q i+1 probe words from the pruned list of candidate probe words that is closest to |D i+1 |/(q i+1 +1), wherein D i+1 is a set of remaining item descriptions after the ith repetition, q i+1 represents a number of probe words presented for user selection for the i+1 repetition and is an integer greater than 1, and the pruned list of candidate probe words includes the selected one of the q i probe words; and presenting the q i+1 probe words for selection by the user. 4. The method recited in claim 1 , wherein: the word count of the q i probe words most equally divides the number of remaining item descriptions after the previous repetition into q i +1 subgroups; and the q i +1 subgroups are disjoint subgroups.
| 0.558843 |
1. A method comprising: providing, to a client device associated with a first user of a plurality of users of a social networking system, a user interface for display to the first user; receiving from the first user, via the client device, a check-in at a location associated with a page in the social networking system, wherein the page is a social networking system page about at least one of a product, a business, a location, and a topic of interest, and wherein the page is a node in a social graph of the social networking system; responsive to receiving the check-in, providing a user interface element for receiving a tip associated with the page; receiving, via the client device, a tip from the first user that is associated with the page; identifying a plurality of tips, including the received tip, that are associated with the page, the plurality of tips shared by one or more of the plurality of users of the social networking system; receiving, via a second client device, a request from a second user of the plurality of users to display one or more of the plurality of tips associated with the page, wherein each tip is associated with privacy criteria that identify users having permission to view that tip; determining that the second user meets privacy criteria associated with a set of candidate tips of the plurality of tips; selecting, by a computer processor, one or more tips, including the received tip, from the set of candidate tips to display to the second user based in part on the second user meeting the privacy criteria associated with the received tip and a relevancy score associated with the received tip, the relevancy score providing a likelihood the second user will view the received tip and is based in part on a number of interactions between the second user and the first user within the social networking system; and responsive to the selecting, providing the page to the second client device, the page displaying the selected one or more tips.
|
1. A method comprising: providing, to a client device associated with a first user of a plurality of users of a social networking system, a user interface for display to the first user; receiving from the first user, via the client device, a check-in at a location associated with a page in the social networking system, wherein the page is a social networking system page about at least one of a product, a business, a location, and a topic of interest, and wherein the page is a node in a social graph of the social networking system; responsive to receiving the check-in, providing a user interface element for receiving a tip associated with the page; receiving, via the client device, a tip from the first user that is associated with the page; identifying a plurality of tips, including the received tip, that are associated with the page, the plurality of tips shared by one or more of the plurality of users of the social networking system; receiving, via a second client device, a request from a second user of the plurality of users to display one or more of the plurality of tips associated with the page, wherein each tip is associated with privacy criteria that identify users having permission to view that tip; determining that the second user meets privacy criteria associated with a set of candidate tips of the plurality of tips; selecting, by a computer processor, one or more tips, including the received tip, from the set of candidate tips to display to the second user based in part on the second user meeting the privacy criteria associated with the received tip and a relevancy score associated with the received tip, the relevancy score providing a likelihood the second user will view the received tip and is based in part on a number of interactions between the second user and the first user within the social networking system; and responsive to the selecting, providing the page to the second client device, the page displaying the selected one or more tips. 5. The method of claim 1 , wherein the user interface is also provided to users of the social networking system who at least one of visit the page and upload geo-tagged photos.
| 0.814854 |
15. The displacement actuator of claim 14 , wherein actuation of the lever causes the displacement actuator to change the position of the document cassette from the first position to the second position to mate the document cassette with the document validator.
|
15. The displacement actuator of claim 14 , wherein actuation of the lever causes the displacement actuator to change the position of the document cassette from the first position to the second position to mate the document cassette with the document validator. 16. The displacement actuator of claim 15 , wherein actuation of the lever through a predetermined range of motion causes the displacement actuator to change the position of the document cassette to the second position, wherein the second position varies based on a position of the document validator.
| 0.868601 |
11. The computing device as claimed in claim 10 wherein the corpus is a first corpus; and wherein the method further includes the conversational agent being further configured to: computationally process though a linguistics analysis of a second corpus of user utterances to identify semantic graphs that match respective user utterances in the second corpus, wherein the additional attached semantic graphs of user utterances are from the second corpus.
|
11. The computing device as claimed in claim 10 wherein the corpus is a first corpus; and wherein the method further includes the conversational agent being further configured to: computationally process though a linguistics analysis of a second corpus of user utterances to identify semantic graphs that match respective user utterances in the second corpus, wherein the additional attached semantic graphs of user utterances are from the second corpus. 16. The computing device as claimed in claim 11 , wherein user utterances from at least the first or second corpa are derived from voice input received via a mobile phone device.
| 0.793345 |
1. A computer-implemented method for enabling response to a query, the method comprising: receiving a query entered by a first user using a computer system; creating a selectable link that is representative of the query entered by the first user; causing a scrolling display of other selectable links that are representative of other received queries to be displayed by another computer system; causing the selectable link that is representative of the query entered by the first user to be added to the scrolling display displayed by the other computer system; receiving, from the other computer system, an indication of a selection, from within the scrolling display and by a second user, of the selectable link that is representative of the query entered by the first user; in response to receiving the indication of the selection of the selectable link that is representative of the query entered by the first user, providing a mechanism for responding to the query entered by the first user; and receiving, from the second user, a response to the query entered by the first user using the provided mechanism for responding.
|
1. A computer-implemented method for enabling response to a query, the method comprising: receiving a query entered by a first user using a computer system; creating a selectable link that is representative of the query entered by the first user; causing a scrolling display of other selectable links that are representative of other received queries to be displayed by another computer system; causing the selectable link that is representative of the query entered by the first user to be added to the scrolling display displayed by the other computer system; receiving, from the other computer system, an indication of a selection, from within the scrolling display and by a second user, of the selectable link that is representative of the query entered by the first user; in response to receiving the indication of the selection of the selectable link that is representative of the query entered by the first user, providing a mechanism for responding to the query entered by the first user; and receiving, from the second user, a response to the query entered by the first user using the provided mechanism for responding. 10. The method of claim 1 , wherein: providing a mechanism for responding to the query entered by the first user to the second user comprises enabling the second user to respond to the query entered by the first user by one of sending an e-mail, sending an instant message, and posting a message on a message board; and receiving a response to the query entered by the first user comprises receiving one of an e-mail, an instant message, and a message board post.
| 0.645186 |
17. A computer readable storage medium, comprising executable instructions to: receive a query specification; receive a semantic abstraction associated with the query specification, wherein the semantic abstraction represents data source entities to be retrieved from an underlying data source; compute an execution plan, wherein the executable instructions to compute the execution plan comprise executable instructions to: evaluate the query specification to identify one or more of the data source entities to be retrieved; determine relationships between the data source entities; group data source entities into sets of compatible data source entities based on logical relationships between the data source entities; process operation instructions required by the query specification; and execute the execution plan, wherein the executable instructions to execute the execution plan comprise executable instructions to: retrieve a data flow associated with the query specification from a data source driver; and assemble the data flows into a query result set; and provide the query result set.
|
17. A computer readable storage medium, comprising executable instructions to: receive a query specification; receive a semantic abstraction associated with the query specification, wherein the semantic abstraction represents data source entities to be retrieved from an underlying data source; compute an execution plan, wherein the executable instructions to compute the execution plan comprise executable instructions to: evaluate the query specification to identify one or more of the data source entities to be retrieved; determine relationships between the data source entities; group data source entities into sets of compatible data source entities based on logical relationships between the data source entities; process operation instructions required by the query specification; and execute the execution plan, wherein the executable instructions to execute the execution plan comprise executable instructions to: retrieve a data flow associated with the query specification from a data source driver; and assemble the data flows into a query result set; and provide the query result set. 18. The computer readable storage medium of claim 17 wherein the semantic abstraction further comprises an entity relationship model definition.
| 0.568289 |
12. A computer implemented method, comprising an implementation using a portion or whole capacity of one or more non-transitory computer readable media with a set of instructions thereon, executable by one or more processing devices, configured, while being or is executed, for processing at least one composition of ontological subjects comprising: getting the at least one composition of ontological subjects, partitioning, using one or more data processing or computing devices, the at least one composition into a plurality of partitions; extracting, using one or more data processing or computing devices, some of ontological subjects of said at least one composition; constructing, using one or more data processing, storage devices, or computing devices, one or more numerical data structures corresponding to at least one matrix representing participation of said extracted ontological subjects into said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said extracted ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; and constructing one or more data structures, using one or more data processing, storage devices, or computing devices, corresponding to at least one co-occurrence matrix representing co-occurrences of each two of said some of ontological subjects in the plurality of partitions of the at least one composition, from the one or more data structures corresponding to said at least one participations matrix, evaluating an importance score for the extracted ontological subject of the at least one composition based on one or more predefined criteria of importance, evaluating numerically an association value for a selected number of pairs of ontological subjects, using the data of said at least one participation matrix and said matrix representing co-occurrences of the extracted ontological subjects in the plurality of partitions of the at least one composition, indexing some or all of the extracted ontological subjects in such a way that each said ontological subject is indexed under most important ontological subjects, excluding under itself, that it has the highest association value with, processing or storing the indexing data into one or more data structure which arrays.
|
12. A computer implemented method, comprising an implementation using a portion or whole capacity of one or more non-transitory computer readable media with a set of instructions thereon, executable by one or more processing devices, configured, while being or is executed, for processing at least one composition of ontological subjects comprising: getting the at least one composition of ontological subjects, partitioning, using one or more data processing or computing devices, the at least one composition into a plurality of partitions; extracting, using one or more data processing or computing devices, some of ontological subjects of said at least one composition; constructing, using one or more data processing, storage devices, or computing devices, one or more numerical data structures corresponding to at least one matrix representing participation of said extracted ontological subjects into said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said extracted ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; and constructing one or more data structures, using one or more data processing, storage devices, or computing devices, corresponding to at least one co-occurrence matrix representing co-occurrences of each two of said some of ontological subjects in the plurality of partitions of the at least one composition, from the one or more data structures corresponding to said at least one participations matrix, evaluating an importance score for the extracted ontological subject of the at least one composition based on one or more predefined criteria of importance, evaluating numerically an association value for a selected number of pairs of ontological subjects, using the data of said at least one participation matrix and said matrix representing co-occurrences of the extracted ontological subjects in the plurality of partitions of the at least one composition, indexing some or all of the extracted ontological subjects in such a way that each said ontological subject is indexed under most important ontological subjects, excluding under itself, that it has the highest association value with, processing or storing the indexing data into one or more data structure which arrays. 18. The computer implemented method of claim 12 , further comprising using the data of at least one of said participation matrix to calculate an association value spectrum for one or more of ontological subjects.
| 0.794217 |
7. A computing device comprising: a ternary content addressable memory (TCAM) device including a TCAM array, the TCAM array including a plurality of TCAM cells arranged in a plurality of rows and columns; a memory storing instructions; and a control circuit, coupled to the TCAM array and the memory, to execute the instructions, wherein the instructions, when executed, cause the computing device to: perform a plurality of hash function operations on each of a set of TCAM words to be stored in the TCAM array; generate a bit vector for a Bloom filter based on the plurality of hash function operations; store (i) the bit vector for the Bloom filter in a first portion of the TCAM array, the first portion of the TCAM array corresponding to a first number of rows of the plurality of rows, and (ii) the set of TCAM words in a second portion of the TCAM array, the second portion of the TCAM array corresponding to a remaining number of rows of the plurality of rows; receive a search word; and perform a search of the TCAM array by (i) performing the plurality of hash function operations on the search word to generate a hashed search word, and (ii) determining whether bits at specified positions of the hashed search word match bits at corresponding positions of the bit vector stored in the first portion of the TCAM array before searching the second portion of the TCAM array with the search word.
|
7. A computing device comprising: a ternary content addressable memory (TCAM) device including a TCAM array, the TCAM array including a plurality of TCAM cells arranged in a plurality of rows and columns; a memory storing instructions; and a control circuit, coupled to the TCAM array and the memory, to execute the instructions, wherein the instructions, when executed, cause the computing device to: perform a plurality of hash function operations on each of a set of TCAM words to be stored in the TCAM array; generate a bit vector for a Bloom filter based on the plurality of hash function operations; store (i) the bit vector for the Bloom filter in a first portion of the TCAM array, the first portion of the TCAM array corresponding to a first number of rows of the plurality of rows, and (ii) the set of TCAM words in a second portion of the TCAM array, the second portion of the TCAM array corresponding to a remaining number of rows of the plurality of rows; receive a search word; and perform a search of the TCAM array by (i) performing the plurality of hash function operations on the search word to generate a hashed search word, and (ii) determining whether bits at specified positions of the hashed search word match bits at corresponding positions of the bit vector stored in the first portion of the TCAM array before searching the second portion of the TCAM array with the search word. 8. The computing device of claim 7 , wherein each bit of the bit vector is stored in a corresponding TCAM cell in the first portion of the TCAM array.
| 0.669173 |
11. A method of matching a data item in a data file to a search entity comprising: receiving, by one or more processors from a client device via a network, a search query sensed via a microphone of the client device; identifying, by the one or more processors, a first data file received from a computing device of a first third-party content provider, the first data file comprising a first data item with first identification data, a first data item type, and a first online action, the first data item associated with a first product or service of the first third-party content provider; determining, by the one or more processors, based on the first identification data and the first data item type, a first search entity corresponding to a named physical entity; generating, by the one or processors, a first entity-action pair comprising the first search entity and the first online action associated with the first data item in the first data file; associating the first entity-action pair with a first bidding parameter of the first third-party content provider, the first bidding parameter specific to the first entity-action pair; determining, by the one or more processors, that the search query received from the client device includes a query term indicative of the first search entity; identifying, by the one or more processors responsive to the query term in the received search query, the first entity-action pair, a second entity-action pair having a second bidding parameter specific to the second entity-action pair, and a third entity-action pair having a third bidding parameter specific to the third entity-action pair, wherein the second entity-action pair comprises the first search entity and a second online action that is different from the first online action, and the third entity-action pair comprises a second search entity and the first online action; determining, by the one or more processors, based on a comparison of respective online-actions of the first entity-action pair, the second entity-action pair, and the third entity-action pair, to conduct a first content auction for both the first entity-action pair and the third entity-action pair absent the second entity-action pair; conducting, by the one or more processors responsive to the determining, the first content auction; selecting, by the one or more processors, the first entity-action pair based on a comparison of the first bidding parameter and the third bidding parameter during the first content auction; and providing, by the one or more processors to the client device, responsive to selecting the first entity-action pair, a first content item received from the first third-party content provider that provided the first data file used to generate the first entity-action pair.
|
11. A method of matching a data item in a data file to a search entity comprising: receiving, by one or more processors from a client device via a network, a search query sensed via a microphone of the client device; identifying, by the one or more processors, a first data file received from a computing device of a first third-party content provider, the first data file comprising a first data item with first identification data, a first data item type, and a first online action, the first data item associated with a first product or service of the first third-party content provider; determining, by the one or more processors, based on the first identification data and the first data item type, a first search entity corresponding to a named physical entity; generating, by the one or processors, a first entity-action pair comprising the first search entity and the first online action associated with the first data item in the first data file; associating the first entity-action pair with a first bidding parameter of the first third-party content provider, the first bidding parameter specific to the first entity-action pair; determining, by the one or more processors, that the search query received from the client device includes a query term indicative of the first search entity; identifying, by the one or more processors responsive to the query term in the received search query, the first entity-action pair, a second entity-action pair having a second bidding parameter specific to the second entity-action pair, and a third entity-action pair having a third bidding parameter specific to the third entity-action pair, wherein the second entity-action pair comprises the first search entity and a second online action that is different from the first online action, and the third entity-action pair comprises a second search entity and the first online action; determining, by the one or more processors, based on a comparison of respective online-actions of the first entity-action pair, the second entity-action pair, and the third entity-action pair, to conduct a first content auction for both the first entity-action pair and the third entity-action pair absent the second entity-action pair; conducting, by the one or more processors responsive to the determining, the first content auction; selecting, by the one or more processors, the first entity-action pair based on a comparison of the first bidding parameter and the third bidding parameter during the first content auction; and providing, by the one or more processors to the client device, responsive to selecting the first entity-action pair, a first content item received from the first third-party content provider that provided the first data file used to generate the first entity-action pair. 16. The method of claim 11 , comprising: identifying the first search entity based on a search in a knowledge graph of search entities.
| 0.802198 |
1. A computer-implemented method comprising: receiving an unstructured document; receiving, via a user interface, information related to data fields of the received unstructured document; classifying, via a user interface, the received unstructured document into one of a plurality of document categories thereby specifying an associated document category, each document category of the plurality of document categories having a different associated rule set that defines a behavior with a corresponding set of operations to perform as related to a particular document in the document category, the set of operations including operations for dispatching the document after information is obtained from the data fields of the document; obtaining information from the document using the information related to data fields of the received unstructured document and the associated document category; storing portions of the information obtained from the document in a data set corresponding to the document; using a portion of the information obtained from the document to obtain an enterprise identifier corresponding to an intended recipient of the document; obtaining an enterprise record identified by the enterprise identifier and the information in the data set; using the data set and the enterprise identifier to dispatch the document to the intended recipient via an enterprise corresponding to the enterprise identifier; and using the data set and the associated document category to dispatch the document by performing the operations defined by the associated document category.
|
1. A computer-implemented method comprising: receiving an unstructured document; receiving, via a user interface, information related to data fields of the received unstructured document; classifying, via a user interface, the received unstructured document into one of a plurality of document categories thereby specifying an associated document category, each document category of the plurality of document categories having a different associated rule set that defines a behavior with a corresponding set of operations to perform as related to a particular document in the document category, the set of operations including operations for dispatching the document after information is obtained from the data fields of the document; obtaining information from the document using the information related to data fields of the received unstructured document and the associated document category; storing portions of the information obtained from the document in a data set corresponding to the document; using a portion of the information obtained from the document to obtain an enterprise identifier corresponding to an intended recipient of the document; obtaining an enterprise record identified by the enterprise identifier and the information in the data set; using the data set and the enterprise identifier to dispatch the document to the intended recipient via an enterprise corresponding to the enterprise identifier; and using the data set and the associated document category to dispatch the document by performing the operations defined by the associated document category. 3. The computer-implemented method as claimed in claim 1 including reconciling dispatched documents with received documents.
| 0.585888 |
96. The method of claim 93 also including providing controls in the interface that enable the human agent to choose a level of response with respect to the degree of involvement of the human agent.
|
96. The method of claim 93 also including providing controls in the interface that enable the human agent to choose a level of response with respect to the degree of involvement of the human agent. 97. The method of claim 96 in which the level of response includes direct conversation with the user.
| 0.898595 |
1. In a computing environment, a method of indexing domains of a declarative application with view state information for the domain to enable persisting the view state of the declarative application, wherein the domains are organized in a tree, each domain being built by a configuration builder, the method comprising: indexing a domain of a declarative application by indexing a path name in an index, wherein the path name comprises: a path name of a parent domain of the domain; an identifier of a configuration builder corresponding to the domain used to build the domain; and an identifier of one or more local decisions made by the corresponding configuration builder when creating the domain; correlating a unique identifier key to the path name in the index, wherein the unique identifier key is correlated to the path name in a first table of the index and the unique identifier key is used as a foreign key into a second table of the index; and correlating view state information for the domain to the unique identifier key in the second table in the index, wherein the view state information comprises an enumeration of changes to underlying source code for the corresponding configuration builder to build the domain from a base version of the underlying source code, while preserving the underlying source code for building the domain.
|
1. In a computing environment, a method of indexing domains of a declarative application with view state information for the domain to enable persisting the view state of the declarative application, wherein the domains are organized in a tree, each domain being built by a configuration builder, the method comprising: indexing a domain of a declarative application by indexing a path name in an index, wherein the path name comprises: a path name of a parent domain of the domain; an identifier of a configuration builder corresponding to the domain used to build the domain; and an identifier of one or more local decisions made by the corresponding configuration builder when creating the domain; correlating a unique identifier key to the path name in the index, wherein the unique identifier key is correlated to the path name in a first table of the index and the unique identifier key is used as a foreign key into a second table of the index; and correlating view state information for the domain to the unique identifier key in the second table in the index, wherein the view state information comprises an enumeration of changes to underlying source code for the corresponding configuration builder to build the domain from a base version of the underlying source code, while preserving the underlying source code for building the domain. 2. The method of claim 1 , further comprising repeating the acts of claim 1 for each domain in the declarative application that has view state.
| 0.580405 |
1. A method of managing voice communications provided over a network, the method comprising: establishing a voice conversation between an originating station and a terminal station, wherein audible communications are permitted between the originating station and the terminal station; permitting at least a portion of the conversation to proceed; processing audio data content of the conversation to detect words and phrases in the voice conversation; responsive to the processing of the audio data content, first matching the detected words and phrases with stored words and phrases to determine that one or more of the detected words and phrases correspond to a current topic of conversation; second matching the current topic of the conversation with a set of excluded topics to determine if the current topic is an excluded topic; responsive to matching the current topic with an excluded topic, first blanking a first portion of the audio data corresponding to the one or more of the detected words and phrases that correspond to the current topic of conversation; and second blanking a second portion of the audio data corresponding to a predetermined time interval after the one or more of the detected words and phrases that correspond to a current topic of conversation.
|
1. A method of managing voice communications provided over a network, the method comprising: establishing a voice conversation between an originating station and a terminal station, wherein audible communications are permitted between the originating station and the terminal station; permitting at least a portion of the conversation to proceed; processing audio data content of the conversation to detect words and phrases in the voice conversation; responsive to the processing of the audio data content, first matching the detected words and phrases with stored words and phrases to determine that one or more of the detected words and phrases correspond to a current topic of conversation; second matching the current topic of the conversation with a set of excluded topics to determine if the current topic is an excluded topic; responsive to matching the current topic with an excluded topic, first blanking a first portion of the audio data corresponding to the one or more of the detected words and phrases that correspond to the current topic of conversation; and second blanking a second portion of the audio data corresponding to a predetermined time interval after the one or more of the detected words and phrases that correspond to a current topic of conversation. 5. The method of claim 1 , wherein the processing audio data content is performed at a station that receives the content containing the excluded topic, and wherein the first blanking is performed to prevent the station that received the content containing the excluded topic from reproducing the content that is blanked during the predetermined period.
| 0.649709 |
9. An apparatus, comprising: a processor circuit on a device; an application support component operative on the processor circuit to generate an image representing a state of an application and to update the state of the application according to a text command; and a communication component operative on the processor circuit to transmit using a communications protocol over a first messaging channel the image to a messaging client on a client device via a messaging system as an image attachment to a first message, to receive over the first messaging channel a second message from the client device via the messaging system, to determine that a first portion of the second message comprises a text command from a set of available commands for the application and a second portion of the second message comprises text that does not comprise a text command from the set of available commands, to provide the text command of the first portion to the application support component, and to forward automatically the second portion of the message over the first messaging channel to a messaging client on a second client device via the messaging system.
|
9. An apparatus, comprising: a processor circuit on a device; an application support component operative on the processor circuit to generate an image representing a state of an application and to update the state of the application according to a text command; and a communication component operative on the processor circuit to transmit using a communications protocol over a first messaging channel the image to a messaging client on a client device via a messaging system as an image attachment to a first message, to receive over the first messaging channel a second message from the client device via the messaging system, to determine that a first portion of the second message comprises a text command from a set of available commands for the application and a second portion of the second message comprises text that does not comprise a text command from the set of available commands, to provide the text command of the first portion to the application support component, and to forward automatically the second portion of the message over the first messaging channel to a messaging client on a second client device via the messaging system. 13. The apparatus of claim 9 , comprising: the application support component operative to generate a second image representing the updated state of the application; and the communication component operative to transmit the second image to the client device as a third image attachment to a third message.
| 0.602866 |
29. A method to blend graphical objects comprising: (a) obtaining a page description language representation of the graphical objects, the graphical objects having transparency characteristics and color characteristics; (b) converting a portion of the page description language representation into a planar map representation, the planar map representation having regions wherein each region is associated with one or more of the graphical objects; (c) assigning a color to a planar map region as a function of the transparency characteristics and color characteristics of the graphical objects associated with the planar map region; (d) sorting the planar map regions into a print order; and (e) rasterizing a second portion of the print ordered planar map regions.
|
29. A method to blend graphical objects comprising: (a) obtaining a page description language representation of the graphical objects, the graphical objects having transparency characteristics and color characteristics; (b) converting a portion of the page description language representation into a planar map representation, the planar map representation having regions wherein each region is associated with one or more of the graphical objects; (c) assigning a color to a planar map region as a function of the transparency characteristics and color characteristics of the graphical objects associated with the planar map region; (d) sorting the planar map regions into a print order; and (e) rasterizing a second portion of the print ordered planar map regions. 34. The method of claim 29 wherein the portion of planar map regions comprises the entire page description language representation.
| 0.692425 |
13. A computerized software-updating system comprising a processor, a memory coupled to said processor, and a computer-readable hardware storage device coupled to said processor, said storage device containing program code configured to be run by said processor via the memory to implement a method for automated coding of a target software application by inferring a context-sensitive business rule from source code of a legacy business system, the method comprising: the processor inferring a business rule from an element of business information retrieved from the source code of the legacy business system; the processor identifying a context of the retrieved element as a function of a context-sensitive characteristic of the retrieved element; the processor repeating an iterative procedure until the processor determines that it cannot retrieve a next element of business information as a function of a context of a most recently retrieved element of business information, where the iterative procedure comprises a sequence of steps: the processor retrieving, from a next information source, a next element of business information as a function of the context of the most recently retrieved element of business information, such that the next element of business information then becomes the most recently retrieved element; the processor refining the business rule as a function of the most recently retrieved element of business information, where the further refining further narrows a scope of the business rule by incorporating the most recently retrieved element of business information into the business rule; the processor identifying a context of the most recently retrieved element of business information, where the context of the most recently retrieved element of business information is identified as a function of a context-sensitive characteristic of the most recently retrieved element of business information; and the processor determining whether it is possible to retrieve, from a next information source, another element of business information as a function of the context of the most recently retrieved element; the processor using the refined business rule to update the business-process model, where the business-process model is a data structure that represents logic implemented by the legacy business system; and the processor translating the business-process model into source code for implementing the target software application, where the target software application is an updated version of the legacy business system.
|
13. A computerized software-updating system comprising a processor, a memory coupled to said processor, and a computer-readable hardware storage device coupled to said processor, said storage device containing program code configured to be run by said processor via the memory to implement a method for automated coding of a target software application by inferring a context-sensitive business rule from source code of a legacy business system, the method comprising: the processor inferring a business rule from an element of business information retrieved from the source code of the legacy business system; the processor identifying a context of the retrieved element as a function of a context-sensitive characteristic of the retrieved element; the processor repeating an iterative procedure until the processor determines that it cannot retrieve a next element of business information as a function of a context of a most recently retrieved element of business information, where the iterative procedure comprises a sequence of steps: the processor retrieving, from a next information source, a next element of business information as a function of the context of the most recently retrieved element of business information, such that the next element of business information then becomes the most recently retrieved element; the processor refining the business rule as a function of the most recently retrieved element of business information, where the further refining further narrows a scope of the business rule by incorporating the most recently retrieved element of business information into the business rule; the processor identifying a context of the most recently retrieved element of business information, where the context of the most recently retrieved element of business information is identified as a function of a context-sensitive characteristic of the most recently retrieved element of business information; and the processor determining whether it is possible to retrieve, from a next information source, another element of business information as a function of the context of the most recently retrieved element; the processor using the refined business rule to update the business-process model, where the business-process model is a data structure that represents logic implemented by the legacy business system; and the processor translating the business-process model into source code for implementing the target software application, where the target software application is an updated version of the legacy business system. 15. The computer system of claim 13 , where each information source is selected from a group consisting of: computer-software source code, computer-software logic, a specification associated with computer program code, data stored on a computer-readable medium, a description of a procedure, workflow, convention, or standard, a data structure, a data model, a business-process model, an ontology, an infrastructure description, and an other description of a characteristic of a business function.
| 0.867173 |
15. A computer program product, encoded on a computer readable medium, operable to cause data processing apparatus to perform operations comprising: generating a compact language model, including: receiving a collection of n-grams from the corpus, each n-gram of the collection having a corresponding first probability of occurring in the corpus, and generating a trie representing the collection of n-grams including calculating a left word vector and a diversity count vector using the collection of n grams, the left word vector identifying each distinct left word for a given right context in the collection, the diversity count vector identifying a count of distinct left words for each right context in the collection, and using the language model to identify a second probability of a particular string occurring.
|
15. A computer program product, encoded on a computer readable medium, operable to cause data processing apparatus to perform operations comprising: generating a compact language model, including: receiving a collection of n-grams from the corpus, each n-gram of the collection having a corresponding first probability of occurring in the corpus, and generating a trie representing the collection of n-grams including calculating a left word vector and a diversity count vector using the collection of n grams, the left word vector identifying each distinct left word for a given right context in the collection, the diversity count vector identifying a count of distinct left words for each right context in the collection, and using the language model to identify a second probability of a particular string occurring. 17. The computer program product of claim 15 , where generating the trie includes: calculating a left context vector identifying each distinct left word for each distinct context in the collection, a left diversity vector identifying a count of distinct left words for each context in the collection, a future word vector identifying each distinct predicted word for a given context in the collection, and a future diversity vector identifying a count of distinct predicted words for each context in the collection.
| 0.50486 |
29. A system comprising: a processor; and a memory communicatively coupled to the processor, the memory storing instructions executable to perform a method, the method including: receiving an image of an identity document, the image being produced using a video stream; recognizing a plurality of text elements in the image using optical character recognition; finding a document template of a plurality of templates having a high degree of coincidence with the image using a substantially rectangular shape of the image overall, at least one of the text elements, and a respective location in the image for the at least one text element, wherein the respective location in the image for each of the text elements includes Cartesian coordinates where the origin lies at a corner of the image and a distance from another location in the image for another text element and a distance from an edge of the image, the distance determined using respective Cartesian coordinates of each of the text elements, the another text element, and the edge of the image; associating each of the text elements with a respective field of the document template using the text elements and a respective location in the image for each of the text elements; placing at least one of the associated text elements in a respective field of a form, the respective field of the form corresponding to the respective associated field of the document template; and making the completed form accessible on the system.
|
29. A system comprising: a processor; and a memory communicatively coupled to the processor, the memory storing instructions executable to perform a method, the method including: receiving an image of an identity document, the image being produced using a video stream; recognizing a plurality of text elements in the image using optical character recognition; finding a document template of a plurality of templates having a high degree of coincidence with the image using a substantially rectangular shape of the image overall, at least one of the text elements, and a respective location in the image for the at least one text element, wherein the respective location in the image for each of the text elements includes Cartesian coordinates where the origin lies at a corner of the image and a distance from another location in the image for another text element and a distance from an edge of the image, the distance determined using respective Cartesian coordinates of each of the text elements, the another text element, and the edge of the image; associating each of the text elements with a respective field of the document template using the text elements and a respective location in the image for each of the text elements; placing at least one of the associated text elements in a respective field of a form, the respective field of the form corresponding to the respective associated field of the document template; and making the completed form accessible on the system. 31. The system of claim 29 wherein the method further includes: storing the completed form in a data store.
| 0.569123 |
14. A computer program product comprising a computer readable program stored on a non-transitory computer usable medium, wherein the computer readable program when executed on a computer causes the computer to perform a phrase-based translation method, comprising: providing a statistically integrated phrase lattice (SIPL) (H) which represents an entire translational model; and translating an input (I) with a processor by determining a best path through an entire lattice (S) by performing an efficient composition operation between the input and the SIPL, wherein the efficient composition operation is performed by a multiple level search where each operand of the efficient composition operation represents a different search level and performing a state traversal search across the entire lattice (S) wherein each of multiple levels of the multiple level search is searched simultaneously.
|
14. A computer program product comprising a computer readable program stored on a non-transitory computer usable medium, wherein the computer readable program when executed on a computer causes the computer to perform a phrase-based translation method, comprising: providing a statistically integrated phrase lattice (SIPL) (H) which represents an entire translational model; and translating an input (I) with a processor by determining a best path through an entire lattice (S) by performing an efficient composition operation between the input and the SIPL, wherein the efficient composition operation is performed by a multiple level search where each operand of the efficient composition operation represents a different search level and performing a state traversal search across the entire lattice (S) wherein each of multiple levels of the multiple level search is searched simultaneously. 25. The computer program product as recited in claim 14 , wherein translating further comprises merging active search states of two or more of the input (I), the language model (L) and the translation model (M) when the states are identical.
| 0.505639 |
1. A speech recognition method comprising: a step for starting input of speech made by a user in response to a user's operation; a step for determining whether beginning of the input speech is missing; a step for setting pronunciation information for recognizing the input speech of which the beginning is not missing in a case where a head portion of a speech waveform power does not exceed a predetermined threshold value, and setting pronunciation information for recognizing the input speech of which the beginning is missing in a case where the head portion of the speech waveform power exceeds the predetermined threshold value; and a step for recognizing the input speech using the set pronunciation information.
|
1. A speech recognition method comprising: a step for starting input of speech made by a user in response to a user's operation; a step for determining whether beginning of the input speech is missing; a step for setting pronunciation information for recognizing the input speech of which the beginning is not missing in a case where a head portion of a speech waveform power does not exceed a predetermined threshold value, and setting pronunciation information for recognizing the input speech of which the beginning is missing in a case where the head portion of the speech waveform power exceeds the predetermined threshold value; and a step for recognizing the input speech using the set pronunciation information. 6. The speech recognition method according to claim 1 , wherein the step for inputting speech starts input of speech in accordance with a user's movement detected by a sensor.
| 0.710621 |
1. A computer-implemented method for associating categories with business names for generalizing search queries, the method comprising: receiving, using one or more computing devices, an indication of a search query from a user containing one or more search terms or phrases; identifying, using the one or more computing devices, one or more businesses within a first geographic region associated with the user; determining, using the one or more computing devices, a business name and one or more categories associated with each of the one or more businesses; generating, using the one or more computing devices, one or more name components for each of the one or more businesses, each name component comprising a subset of the business name of the business; generating, using the one or more computing devices, one or more name component groups from the name components of the one or more businesses, wherein each name component group comprises one or more identical name components; determining, using the one or more computing devices, for each name component group, if the one or more name components within the name component group share one or more common categories; associating, using the one or more computing devices, the one or more common categories with the name component of the name component group, when the one or more name components within the name component group share one or more common categories; and providing, using the one or more computing devices, the one or more common categories to the user for inclusion within the query.
|
1. A computer-implemented method for associating categories with business names for generalizing search queries, the method comprising: receiving, using one or more computing devices, an indication of a search query from a user containing one or more search terms or phrases; identifying, using the one or more computing devices, one or more businesses within a first geographic region associated with the user; determining, using the one or more computing devices, a business name and one or more categories associated with each of the one or more businesses; generating, using the one or more computing devices, one or more name components for each of the one or more businesses, each name component comprising a subset of the business name of the business; generating, using the one or more computing devices, one or more name component groups from the name components of the one or more businesses, wherein each name component group comprises one or more identical name components; determining, using the one or more computing devices, for each name component group, if the one or more name components within the name component group share one or more common categories; associating, using the one or more computing devices, the one or more common categories with the name component of the name component group, when the one or more name components within the name component group share one or more common categories; and providing, using the one or more computing devices, the one or more common categories to the user for inclusion within the query. 5. The method of claim 1 , wherein the one or more name components comprises the business name.
| 0.679836 |
7. The one or more computer storage media of claim 1 , wherein the method further comprises storing the cost function data.
|
7. The one or more computer storage media of claim 1 , wherein the method further comprises storing the cost function data. 8. The one or more computer storage media of claim 7 , wherein the cost function data further comprises the cost of a building block of a particular dimension.
| 0.938128 |
1. A method comprising: providing, by a computing system, a development environment, the development environment including a web page editor; receiving a command at the development environment, the command referencing an electronic document being edited or viewed in a graphical user interface of the development environment, the electronic document comprising a first element written in a markup language and a second element written in a style sheet language; analyzing a structure of the electronic document responsive to the command; identifying a relationship between the first and second elements, wherein the relationship is known to cause a rendering problem associated with a document viewer that supports the first and second elements, the rendering problem occurring when the first and second elements are specified using correct syntax and used in combination in rendering a document by the document viewer; and presenting information about the rendering problem via the development environment.
|
1. A method comprising: providing, by a computing system, a development environment, the development environment including a web page editor; receiving a command at the development environment, the command referencing an electronic document being edited or viewed in a graphical user interface of the development environment, the electronic document comprising a first element written in a markup language and a second element written in a style sheet language; analyzing a structure of the electronic document responsive to the command; identifying a relationship between the first and second elements, wherein the relationship is known to cause a rendering problem associated with a document viewer that supports the first and second elements, the rendering problem occurring when the first and second elements are specified using correct syntax and used in combination in rendering a document by the document viewer; and presenting information about the rendering problem via the development environment. 3. The method of claim 1 , wherein the document viewer is a web browser.
| 0.805794 |
17. The computer readable medium of claim 16 , further comprising: mapping a particular query to at least one targeting category; and presenting, on a computer display, the subject advertisement on the page, the subject advertisement selected on the basis of the value of the click probability.
|
17. The computer readable medium of claim 16 , further comprising: mapping a particular query to at least one targeting category; and presenting, on a computer display, the subject advertisement on the page, the subject advertisement selected on the basis of the value of the click probability. 18. The computer readable medium of claim 17 , wherein the mapping is performed using only an association between a query and at least one of a history of clicks.
| 0.962744 |
7. An apparatus for customizing a display of a tag cloud, the apparatus comprising: a processor; a memory connected to the processor; an indexing application running in the memory, operable to extract tags from a collection of items and collect usage statistics related to each item; a tag table file in the memory containing the indexed tags and statistics; a tag cloud customizer program in the memory operable to display an interactive legend, in conjunction with the display of the tag cloud, the interactive legend comprising a plurality of tag attributes, each tag attribute associated with a drop down menu comprising a plurality of display characteristics; responsive to a selection of a display characteristic from the drop down menu, mapping the display characteristic to a tag in the tag cloud, each display characteristic representing one of the plurality of tag attributes; modifying the tag cloud, wherein each tag is displayed in accordance with a display characteristic mapped to the tag by the interactive legend; and wherein the tag attributes are rearranged, added, or removed from the interactive legend.
|
7. An apparatus for customizing a display of a tag cloud, the apparatus comprising: a processor; a memory connected to the processor; an indexing application running in the memory, operable to extract tags from a collection of items and collect usage statistics related to each item; a tag table file in the memory containing the indexed tags and statistics; a tag cloud customizer program in the memory operable to display an interactive legend, in conjunction with the display of the tag cloud, the interactive legend comprising a plurality of tag attributes, each tag attribute associated with a drop down menu comprising a plurality of display characteristics; responsive to a selection of a display characteristic from the drop down menu, mapping the display characteristic to a tag in the tag cloud, each display characteristic representing one of the plurality of tag attributes; modifying the tag cloud, wherein each tag is displayed in accordance with a display characteristic mapped to the tag by the interactive legend; and wherein the tag attributes are rearranged, added, or removed from the interactive legend. 11. The apparatus of claim 7 wherein the tag cloud customizer program in the memory is further operable to set a sort criteria using one of the plurality of tag attributes and to display the tag cloud with the plurality of tags ordered based upon the sort criteria.
| 0.507556 |
5. The method of claim 4 , wherein the user preference data may be edited by an end user.
|
5. The method of claim 4 , wherein the user preference data may be edited by an end user. 7. The method of claim 5 , wherein the display of the advertisement insert is performed by the Java application.
| 0.942095 |
1. A method for determining a search result, the method comprising: tagging a plurality of knowledge documents with a plurality of association rules mapping the plurality of knowledge documents to one or more assets in an asset environment, wherein the plurality of association rules include at least one product rule associating an asset identifier with a knowledge document, at least one environment rule associating an environment with a knowledge document, and at least one configuration rule associating an asset configuration with a knowledge document; receiving, by a processor and from a requestor, a search request including a search term; transmitting an asset context request to a context engine, wherein the context engine maintains a context registry of the plurality of association rules for the one or more assets in the asset environment; receiving, by the processor, an asset context of an asset environment, wherein the asset environment is associated with the requestor, and wherein the asset context includes at least one of an asset identity information, an asset content information, an asset environment information, and an asset configuration information; determining, by the processor, a context-aware search result based, at least in part, on the search term, on the asset context, and on information stored in a search index; and transmitting, by the processor, the context-aware search result to the requestor.
|
1. A method for determining a search result, the method comprising: tagging a plurality of knowledge documents with a plurality of association rules mapping the plurality of knowledge documents to one or more assets in an asset environment, wherein the plurality of association rules include at least one product rule associating an asset identifier with a knowledge document, at least one environment rule associating an environment with a knowledge document, and at least one configuration rule associating an asset configuration with a knowledge document; receiving, by a processor and from a requestor, a search request including a search term; transmitting an asset context request to a context engine, wherein the context engine maintains a context registry of the plurality of association rules for the one or more assets in the asset environment; receiving, by the processor, an asset context of an asset environment, wherein the asset environment is associated with the requestor, and wherein the asset context includes at least one of an asset identity information, an asset content information, an asset environment information, and an asset configuration information; determining, by the processor, a context-aware search result based, at least in part, on the search term, on the asset context, and on information stored in a search index; and transmitting, by the processor, the context-aware search result to the requestor. 2. The method of claim 1 , further comprising: receiving, by the processor, an identification of the requestor; and determining, by the processor, the association between the asset environment and the requestor based on the received identification.
| 0.526658 |
1. A method for parsing business card information text from electronically derived text representing an electronically scanned business card, comprising: (a) electronically ordering, using an electronic device, lines of text linearly left-to-right, top-to-bottom; (b) generating, for each line of text having a keyword therein, a terminal symbol corresponding to the keyword therein, the terminal symbol being a member of a pre-defined set of terminal symbols; (c) generating, for each line of text not having a keyword therein and absent of numeric characters, an alphabetic terminal symbol; (d) generating, for each line of text not having a keyword therein and having a numeric character therein, an alphanumeric terminal symbol; (e) generating a string of terminal symbols from the generated terminal symbols; (f) electronically determining, using an electronic device, a probable parsing of the generated string of terminal symbols; (g) labeling each text line, according to a determined function, with non-terminal symbols; and (h) electronically parsing, using an electronic device, the business card information text into fields of business card information text based upon the non-terminal symbol of each text line and the determined probable parsing of the generated string of terminal symbols.
|
1. A method for parsing business card information text from electronically derived text representing an electronically scanned business card, comprising: (a) electronically ordering, using an electronic device, lines of text linearly left-to-right, top-to-bottom; (b) generating, for each line of text having a keyword therein, a terminal symbol corresponding to the keyword therein, the terminal symbol being a member of a pre-defined set of terminal symbols; (c) generating, for each line of text not having a keyword therein and absent of numeric characters, an alphabetic terminal symbol; (d) generating, for each line of text not having a keyword therein and having a numeric character therein, an alphanumeric terminal symbol; (e) generating a string of terminal symbols from the generated terminal symbols; (f) electronically determining, using an electronic device, a probable parsing of the generated string of terminal symbols; (g) labeling each text line, according to a determined function, with non-terminal symbols; and (h) electronically parsing, using an electronic device, the business card information text into fields of business card information text based upon the non-terminal symbol of each text line and the determined probable parsing of the generated string of terminal symbols. 19. The method as claimed in claim 1 , wherein a non-terminal symbol represents internet information.
| 0.588235 |
1. A method of classifying the material type of an unknown material into a probability distribution of multiple predetermined material types by using a collection of plural predetermined material classifiers, wherein each material type of the multiple predetermined material types is associated with a corresponding best performing classifier from the collection of plural predetermined material classifiers by a predesignated stored association, the method comprising the steps of: applying, using a processor, the plural material classifiers to the unknown material to obtain a list of candidate material types; looking up, using the processor, a list of potential best performing classifiers using the list of candidate material types as a reference into the predesignated stored association; and assigning, using the processor, a respective probability that the unknown material belongs to a material type based on the list of potential best performing classifiers, wherein applying comprises obtaining one or more feature vectors for the unknown material and inputting a corresponding one of the feature vectors into each of the plural material classifiers so as to obtain an output representative of material type from each of the plural material classifiers.
|
1. A method of classifying the material type of an unknown material into a probability distribution of multiple predetermined material types by using a collection of plural predetermined material classifiers, wherein each material type of the multiple predetermined material types is associated with a corresponding best performing classifier from the collection of plural predetermined material classifiers by a predesignated stored association, the method comprising the steps of: applying, using a processor, the plural material classifiers to the unknown material to obtain a list of candidate material types; looking up, using the processor, a list of potential best performing classifiers using the list of candidate material types as a reference into the predesignated stored association; and assigning, using the processor, a respective probability that the unknown material belongs to a material type based on the list of potential best performing classifiers, wherein applying comprises obtaining one or more feature vectors for the unknown material and inputting a corresponding one of the feature vectors into each of the plural material classifiers so as to obtain an output representative of material type from each of the plural material classifiers. 2. The method according to claim 1 , wherein the output of each material classifier is indicative of a probability that the unknown material belongs to each material type.
| 0.63027 |
19. The computer program product of claim 18 , wherein determining whether the text of the delimited phrase satisfies a condition of the rule comprises determining whether a particular pattern of characters is present in the delimited phrase, the particular pattern including a delimiter character, and wherein modifying the delimited phrase comprises modifying the particular pattern of characters.
|
19. The computer program product of claim 18 , wherein determining whether the text of the delimited phrase satisfies a condition of the rule comprises determining whether a particular pattern of characters is present in the delimited phrase, the particular pattern including a delimiter character, and wherein modifying the delimited phrase comprises modifying the particular pattern of characters. 21. The computer program product of claim 19 , wherein the particular pattern of characters is specified by a regular expression.
| 0.947844 |
8. A system for detecting malware, the system comprising: an identification module, stored in memory, that identifies a plurality of programs represented in machine code; a derivation module, stored in memory, that derives a plurality of opcode n-grams from opcode sequences within the plurality of programs, each opcode n-gram within the plurality of opcode n-grams representing a sequence of opcodes extracted from a program within the plurality of programs; a training module, stored in memory, that trains an autoencoder by using the plurality of opcode n-grams as input; a discovery module, stored in memory, that discovers a set of features within the autoencoder after training the autoencoder, each feature within the set of features comprising a linear combination of opcode n-grams from the plurality of opcode n-grams; a classification module, stored in memory, that classifies a potentially malicious program as malicious by using the set of features discovered within the autoencoder to analyze the potentially malicious program by: initializing a neural network with the set of features discovered within the autoencoder; training the neural network with supervision using a training set labeled to indicate whether each sample within the training set is malicious; and classifying the potentially malicious program using the trained neural network; and at least one physical processor configured to execute the identification module, the derivation module, the training module, the discovery module, and the classification module.
|
8. A system for detecting malware, the system comprising: an identification module, stored in memory, that identifies a plurality of programs represented in machine code; a derivation module, stored in memory, that derives a plurality of opcode n-grams from opcode sequences within the plurality of programs, each opcode n-gram within the plurality of opcode n-grams representing a sequence of opcodes extracted from a program within the plurality of programs; a training module, stored in memory, that trains an autoencoder by using the plurality of opcode n-grams as input; a discovery module, stored in memory, that discovers a set of features within the autoencoder after training the autoencoder, each feature within the set of features comprising a linear combination of opcode n-grams from the plurality of opcode n-grams; a classification module, stored in memory, that classifies a potentially malicious program as malicious by using the set of features discovered within the autoencoder to analyze the potentially malicious program by: initializing a neural network with the set of features discovered within the autoencoder; training the neural network with supervision using a training set labeled to indicate whether each sample within the training set is malicious; and classifying the potentially malicious program using the trained neural network; and at least one physical processor configured to execute the identification module, the derivation module, the training module, the discovery module, and the classification module. 12. The system of claim 8 , wherein the plurality of opcode n-grams comprises opcodes without accompanying operands.
| 0.728992 |
1. A graphic user interface, stored on a computer memory, for authoring an electronic document viewed on a display device, comprising a user interface for authoring alternate versions of the same portion of document content, comprising an edit view pane for displaying a linear version of document content for a document adaptable to being created in a given display space that varies based on the size and resolution of different display devices and transmission bandwidth constraints, and an alternate version view pane for displaying multiple alternate versions of the document content for the linear version of document content displayed in the edit view pane, wherein one of the multiple versions of alternate content can be selected to create the document so that it will fit within the given display space that varies based on the size and resolution of different display devices and complies with transmission bandwidth constraints, wherein hovering with an input device cursor over a region of document content configurable into alternate document content further comprises bringing up a menu with editing choices, comprising the following user options: select version, which when activated highlights selected content in said alternate version view pane along with other unhighlighted versions of document content; pop selection, which when activated displays the highest level of alternate version content if nested versions of alternate content exist; create version, which when activated to creates a version of alternate content; and freeze version, which when activated to prevent a version of alternate content from being changed.
|
1. A graphic user interface, stored on a computer memory, for authoring an electronic document viewed on a display device, comprising a user interface for authoring alternate versions of the same portion of document content, comprising an edit view pane for displaying a linear version of document content for a document adaptable to being created in a given display space that varies based on the size and resolution of different display devices and transmission bandwidth constraints, and an alternate version view pane for displaying multiple alternate versions of the document content for the linear version of document content displayed in the edit view pane, wherein one of the multiple versions of alternate content can be selected to create the document so that it will fit within the given display space that varies based on the size and resolution of different display devices and complies with transmission bandwidth constraints, wherein hovering with an input device cursor over a region of document content configurable into alternate document content further comprises bringing up a menu with editing choices, comprising the following user options: select version, which when activated highlights selected content in said alternate version view pane along with other unhighlighted versions of document content; pop selection, which when activated displays the highest level of alternate version content if nested versions of alternate content exist; create version, which when activated to creates a version of alternate content; and freeze version, which when activated to prevent a version of alternate content from being changed. 12. The graphic user interface of claim 1 further comprising text editing functionality of at least one of: selecting font type; selecting font size; and selecting font style.
| 0.542536 |
1. In a knowledge management system, a method for organically ranked knowledge and categorization, the method comprising: bookmarking answer content by adding the answer content to favorites for a first end user of the knowledge management system executing in memory of a computer; suggesting a set of categories previously associated with the answer content by other end users of the knowledge management system in response to the first end user bookmarking answer content; determining whether the first end user selected a category from the suggested set of categories or whether the first end user selected a new category; upon determining the first end user selected the new category, creating the new category and also categorizing the bookmarked answer content according to the new category; and, upon determining the first end user selected the category from the suggested set of categories, categorizing the bookmarked answer content with a category selected from the set of categories.
|
1. In a knowledge management system, a method for organically ranked knowledge and categorization, the method comprising: bookmarking answer content by adding the answer content to favorites for a first end user of the knowledge management system executing in memory of a computer; suggesting a set of categories previously associated with the answer content by other end users of the knowledge management system in response to the first end user bookmarking answer content; determining whether the first end user selected a category from the suggested set of categories or whether the first end user selected a new category; upon determining the first end user selected the new category, creating the new category and also categorizing the bookmarked answer content according to the new category; and, upon determining the first end user selected the category from the suggested set of categories, categorizing the bookmarked answer content with a category selected from the set of categories. 6. The method of claim 1 , further comprising bookmarking additional answer content for the first end user already categorized with the selected category by the other end users of the knowledge management system.
| 0.746143 |
1. A computer-implemented method for identifying facts described by electronic documents, comprising: defining a query, the query posing a question having an answer formed of terms from the electronic documents; creating one or more hypothetical facts in response to the query and the electronic documents, each hypothetical fact representing a possible answer to the query, wherein creating one or more hypothetical facts in response to the query comprises: parsing the query to filter out noise words and produce filtered terms; searching a repository of facts comprising attributes and values to identify attributes corresponding to the filtered terms; searching the electronic documents to identify terms that frequently appear near the filtered terms; and forming one or more hypothetical facts responsive to the attributes corresponding to the filtered terms and the terms that frequently appear near the filtered terms in the electronic documents; corroborating the one or more hypothetical facts using the electronic documents to identify a likely correct fact; and presenting the identified likely correct fact as the answer to the query.
|
1. A computer-implemented method for identifying facts described by electronic documents, comprising: defining a query, the query posing a question having an answer formed of terms from the electronic documents; creating one or more hypothetical facts in response to the query and the electronic documents, each hypothetical fact representing a possible answer to the query, wherein creating one or more hypothetical facts in response to the query comprises: parsing the query to filter out noise words and produce filtered terms; searching a repository of facts comprising attributes and values to identify attributes corresponding to the filtered terms; searching the electronic documents to identify terms that frequently appear near the filtered terms; and forming one or more hypothetical facts responsive to the attributes corresponding to the filtered terms and the terms that frequently appear near the filtered terms in the electronic documents; corroborating the one or more hypothetical facts using the electronic documents to identify a likely correct fact; and presenting the identified likely correct fact as the answer to the query. 8. The method of claim 1 , wherein presenting the identified likely correct fact as the answer to the query comprises: displaying the likely correct fact on a web page.
| 0.686924 |
1. A computerized method for generating a normalized database model from natural language expressions of business rules comprising: accessing a plurality of business rules, the business rules being in a linguistic form having a predefined syntax or format that conforms to grammatical rules of a natural language, and wherein the business rules comprise one or more definitional rules or authorization rules, wherein definitional rules define how information is derived or computed from other information or define how certain propositions become facts upon the occurrence of one or more events, and wherein definitional rules that define how certain propositions become true upon the occurrence of some event have at least a description of one or more events and one or more declarations, which are statements of propositions, each proposition including a fact type, that become true upon the event and wherein the authorization rules define authorizations of business actors to provide information or to request information; creating a first empty list of fact types; for each business rule that is a definitional rule, and based on the rules being definitional rules, adding all of the fact types of the business rule to the first list, the fact types being the declarations which are the statements of propositions, wherein the fact types are expressed in a sentence form, and wherein each of the fact types includes one or more roles, each of which is represented by a placeholder in the sentence form; for each business rule that is an authorization rule for provision of information indicating what information can be provided by a business actor, that comprises one or more authorized provisions of information corresponding to one or more fact types, and based on the rules being authorization rules for provision of information indicating what information can be provided by a business actor, adding the corresponding fact types to the first list, the fact type being expressed in a sentence form and wherein each of the fact types includes one or more roles, each of which is represented by a placeholder in the sentence form; for each role of each fact type in the first list, the role having a type, if the type of the role is not of a lexical type, adding the type to a second list of types; processing the types in the second list to create one or more database tables for the types in the second list; and processing the fact types in the first list by determining for each of the fact types, if a fact type is a basis for describing a pre-defined reference scheme for the fact type, the reference scheme being a pre-defined scheme by which a thing of some type is identified by relating the thing to signifiers or to other things identified by signifiers, and for each fact type in the second list which is not a basis for describing a predefined reference scheme, creating a database table for the fact type, the database table including a type column for each role of the fact type, while not creating a database table for each fact type in the second list which is a basis for describing a predefined reference scheme.
|
1. A computerized method for generating a normalized database model from natural language expressions of business rules comprising: accessing a plurality of business rules, the business rules being in a linguistic form having a predefined syntax or format that conforms to grammatical rules of a natural language, and wherein the business rules comprise one or more definitional rules or authorization rules, wherein definitional rules define how information is derived or computed from other information or define how certain propositions become facts upon the occurrence of one or more events, and wherein definitional rules that define how certain propositions become true upon the occurrence of some event have at least a description of one or more events and one or more declarations, which are statements of propositions, each proposition including a fact type, that become true upon the event and wherein the authorization rules define authorizations of business actors to provide information or to request information; creating a first empty list of fact types; for each business rule that is a definitional rule, and based on the rules being definitional rules, adding all of the fact types of the business rule to the first list, the fact types being the declarations which are the statements of propositions, wherein the fact types are expressed in a sentence form, and wherein each of the fact types includes one or more roles, each of which is represented by a placeholder in the sentence form; for each business rule that is an authorization rule for provision of information indicating what information can be provided by a business actor, that comprises one or more authorized provisions of information corresponding to one or more fact types, and based on the rules being authorization rules for provision of information indicating what information can be provided by a business actor, adding the corresponding fact types to the first list, the fact type being expressed in a sentence form and wherein each of the fact types includes one or more roles, each of which is represented by a placeholder in the sentence form; for each role of each fact type in the first list, the role having a type, if the type of the role is not of a lexical type, adding the type to a second list of types; processing the types in the second list to create one or more database tables for the types in the second list; and processing the fact types in the first list by determining for each of the fact types, if a fact type is a basis for describing a pre-defined reference scheme for the fact type, the reference scheme being a pre-defined scheme by which a thing of some type is identified by relating the thing to signifiers or to other things identified by signifiers, and for each fact type in the second list which is not a basis for describing a predefined reference scheme, creating a database table for the fact type, the database table including a type column for each role of the fact type, while not creating a database table for each fact type in the second list which is a basis for describing a predefined reference scheme. 2. The method of claim 1 further comprises: for each business rule, determining whether the business rule imposes a limit that a role of a fact type has a maximum cardinality of one; and if the business rule imposes such limit, adding the role of a fact type that has a maximum cardinality of one to a third list of single-valued roles.
| 0.559625 |
38. The computer program product of claim 37 , wherein the step of registering each of the plurality of event handlers comprises the step of: registering the plurality of created Simple Application Programming Interface for Extensible Markup Language event handlers for a method node found in the Extensible Markup Language description.
|
38. The computer program product of claim 37 , wherein the step of registering each of the plurality of event handlers comprises the step of: registering the plurality of created Simple Application Programming Interface for Extensible Markup Language event handlers for a method node found in the Extensible Markup Language description. 39. The computer program product of claim 38 , wherein the step of parsing the markup language description and invoking the registered event handler comprises the step of: parsing the Extensible Markup Language description using a Simple Application Programming Interface for Extensible Markup Language parser and invoking the plurality of registered Simple Application Programming Interface for Extensible Markup Language event handlers.
| 0.824803 |
16. A computer implemented method comprising: enabling, via a security module, secure information transfer between a web content scripting engine and layout engine, said enabling comprising: enabling restricted access to at least one Application Programming Interface (API) associated with a scripting language of the scripting engine; enabling at least one object to be returned cross-domain to a calling system, via the scripting engine and the layout engine, without divulging type system information associated with the at least one object; and enabling at least one sub-window proxy object to assert security policies associated with a primary window object associated with the layout engine.
|
16. A computer implemented method comprising: enabling, via a security module, secure information transfer between a web content scripting engine and layout engine, said enabling comprising: enabling restricted access to at least one Application Programming Interface (API) associated with a scripting language of the scripting engine; enabling at least one object to be returned cross-domain to a calling system, via the scripting engine and the layout engine, without divulging type system information associated with the at least one object; and enabling at least one sub-window proxy object to assert security policies associated with a primary window object associated with the layout engine. 22. The method of claim 16 , wherein enabling the at least one object to be returned across the one or more domains is performed by returning a proxy object associated with the at least one object, the proxy object created in a type system associated with the calling system.
| 0.647274 |
20. An apparatus for enabling interoperability between a plurality of participants in a network, the apparatus comprising: one or more memories; and one or more processors coupled to the one or more memories, the one or more processors configured: to determine a value associated with a value metric defined for at least a portion of the network; to determine two or more alternative information flows between two or more of the plurality of participants in the network based at least in part on one or more semantic models corresponding to the plurality of participants and on the value associated with the value metric, wherein the one or more semantic models define inputs, outputs, and functionality for each of the plurality of participants and define at least a portion of information produced or consumed by the plurality of participants; and to optimize an overall value of the network by selecting combinations of said alternative information flows for at least one portion of the network in order to satisfy consumers of information.
|
20. An apparatus for enabling interoperability between a plurality of participants in a network, the apparatus comprising: one or more memories; and one or more processors coupled to the one or more memories, the one or more processors configured: to determine a value associated with a value metric defined for at least a portion of the network; to determine two or more alternative information flows between two or more of the plurality of participants in the network based at least in part on one or more semantic models corresponding to the plurality of participants and on the value associated with the value metric, wherein the one or more semantic models define inputs, outputs, and functionality for each of the plurality of participants and define at least a portion of information produced or consumed by the plurality of participants; and to optimize an overall value of the network by selecting combinations of said alternative information flows for at least one portion of the network in order to satisfy consumers of information. 30. The apparatus of claim 20 , wherein one or more of the participants produce a low level metric, and wherein the one or more processors are further configured, when determining the value, to use the low level metric when determining the value.
| 0.637356 |
16. A method of facilitating online transactions involving seller financing and notifying users of time limited offers in an online marketplace, using at least one computing device, the method comprising: generating and storing trust profiles for buyer users and seller users, using the at least one computing device, the trust profiles configured to allow both the buyer users and the seller users to evaluate trustworthiness of each other prior to entering into online transactions involving seller financing, wherein the trust profiles include reputation data including: reputational factors, including: at least one rating of at least one of the user's prior transactions, from another user; historical data about the user's conformance to terms of the user's prior transactions; and information about a verification level of the user; and a trust score computed based on at least some of the reputational factors, including a number of the user's prior transactions; and receiving descriptions of a plurality of transaction offerings from a plurality of seller users of the online marketplace, using the at least one computing device, wherein the transaction offerings are available for purchase from the seller users over time for at least two payments; generating a user interface presenting a plurality of listings and the trust profiles using the at least one computing device, each of the listings including one of the descriptions of the plurality of transactions offerings, wherein the plurality of listings are associated with transaction offerings across a plurality of different transaction offering categories; presenting at least some of the plurality of listings to buyer users through the user interface, using the at least one computing device; and facilitating, using the at least one computing device and through the user interface, negotiation of binding contracts between the buyer users and the seller users for transfer of the transaction offerings from the seller users to the buyer users, wherein the binding contracts define payment terms, and wherein the payment terms include prices and seller-financing terms including at least two payments made by the buyer users to the seller users over a period of time, comprising: receiving an offer from a first user of the buyer users and the seller users for one of the transaction offerings, the offer including offer details and a time limit generating an offer alert from the offer that includes the offer details, the time limit, and a customized link, which is selectable by a second user of the buyer users and the seller users to view the offer on the online marketplace; formatting the offer alert according to a preferred offer communication method for the second user; transmitting the formatted offer alert to the second user over a wireless communication network, wherein the formatted offer alert upon receipt instantaneously activates an application on a remote computing device to display the formatted offer alert and enable connection via the customized link to the online marketplace over the Internet upon connection of the remote computing device via the customized link, generating for display on the remote computing device to the second user: a listing for the one of the transaction offerings; the offer including the offer details; the trust profile for the first user; and an option to accept the offer; and receiving an acceptance from the second user.
|
16. A method of facilitating online transactions involving seller financing and notifying users of time limited offers in an online marketplace, using at least one computing device, the method comprising: generating and storing trust profiles for buyer users and seller users, using the at least one computing device, the trust profiles configured to allow both the buyer users and the seller users to evaluate trustworthiness of each other prior to entering into online transactions involving seller financing, wherein the trust profiles include reputation data including: reputational factors, including: at least one rating of at least one of the user's prior transactions, from another user; historical data about the user's conformance to terms of the user's prior transactions; and information about a verification level of the user; and a trust score computed based on at least some of the reputational factors, including a number of the user's prior transactions; and receiving descriptions of a plurality of transaction offerings from a plurality of seller users of the online marketplace, using the at least one computing device, wherein the transaction offerings are available for purchase from the seller users over time for at least two payments; generating a user interface presenting a plurality of listings and the trust profiles using the at least one computing device, each of the listings including one of the descriptions of the plurality of transactions offerings, wherein the plurality of listings are associated with transaction offerings across a plurality of different transaction offering categories; presenting at least some of the plurality of listings to buyer users through the user interface, using the at least one computing device; and facilitating, using the at least one computing device and through the user interface, negotiation of binding contracts between the buyer users and the seller users for transfer of the transaction offerings from the seller users to the buyer users, wherein the binding contracts define payment terms, and wherein the payment terms include prices and seller-financing terms including at least two payments made by the buyer users to the seller users over a period of time, comprising: receiving an offer from a first user of the buyer users and the seller users for one of the transaction offerings, the offer including offer details and a time limit generating an offer alert from the offer that includes the offer details, the time limit, and a customized link, which is selectable by a second user of the buyer users and the seller users to view the offer on the online marketplace; formatting the offer alert according to a preferred offer communication method for the second user; transmitting the formatted offer alert to the second user over a wireless communication network, wherein the formatted offer alert upon receipt instantaneously activates an application on a remote computing device to display the formatted offer alert and enable connection via the customized link to the online marketplace over the Internet upon connection of the remote computing device via the customized link, generating for display on the remote computing device to the second user: a listing for the one of the transaction offerings; the offer including the offer details; the trust profile for the first user; and an option to accept the offer; and receiving an acceptance from the second user. 23. The method of claim 16 , further comprising receiving a hold payment from a buyer user before receiving an offer to enter into a transaction, and placing a listing on hold for a hold period.
| 0.565476 |
11. A computer readable storage device as recited in claim 9 , wherein the plurality of images with a same hash value are grouped into a same image cluster.
|
11. A computer readable storage device as recited in claim 9 , wherein the plurality of images with a same hash value are grouped into a same image cluster. 12. A computer readable storage device as recited in claim 11 further comprising, comparing a hash value of the personal image with hash values of the image clusters.
| 0.91221 |
9. The computing device of claim 7 , wherein the TCAM array includes a plurality pre-charge circuits and a match line for each row of the plurality of rows, wherein each pre-charge circuit is coupled to a match line for each row, and wherein the instructions cause the computing device to determine whether the bits at specified positions of the hashed search word match the bits at corresponding positions of the bit vector by causing a first set of pre-charge circuits for the first number of rows to set the corresponding match lines to a logical high and causing a second set of pre-charge circuits for the remaining number of rows to set the corresponding match lines to a logical low.
|
9. The computing device of claim 7 , wherein the TCAM array includes a plurality pre-charge circuits and a match line for each row of the plurality of rows, wherein each pre-charge circuit is coupled to a match line for each row, and wherein the instructions cause the computing device to determine whether the bits at specified positions of the hashed search word match the bits at corresponding positions of the bit vector by causing a first set of pre-charge circuits for the first number of rows to set the corresponding match lines to a logical high and causing a second set of pre-charge circuits for the remaining number of rows to set the corresponding match lines to a logical low. 10. The computing device of claim 9 , wherein the instructions further cause the computing device to: determine that the bits at specified positions of the hashed search word do not match the bits at corresponding positions of the bit vector stored in the first portion of the TCAM array; and provide an indication that the search word does not match any of the TCAM words stored in the second portion of the TCAM array without searching the second portion of the TCAM array.
| 0.79104 |
19. The medium of claim 14 , the instructions further defining the step of, receiving, by the processor, the user's selections of the relevant news items.
|
19. The medium of claim 14 , the instructions further defining the step of, receiving, by the processor, the user's selections of the relevant news items. 20. The medium of claim 19 , the instructions further defining the step of, storing, by the processor, the user's selections to the user logs.
| 0.948561 |
5. The method of claim 1 , wherein the remote host has a first plurality of user interface components, and the client device has a second plurality of user interface components, each of the first plurality of user interface components corresponding to a different one of the second plurality of user interface components, said method further comprising: substituting, by the client device, one of the second plurality of user interface components for a corresponding one of the first plurality of user interface components received from the remote host; and sending user input to the remote host responsive to the corresponding one of the first plurality of user interface components based on user input received via the corresponding one of the second plurality of user interface components.
|
5. The method of claim 1 , wherein the remote host has a first plurality of user interface components, and the client device has a second plurality of user interface components, each of the first plurality of user interface components corresponding to a different one of the second plurality of user interface components, said method further comprising: substituting, by the client device, one of the second plurality of user interface components for a corresponding one of the first plurality of user interface components received from the remote host; and sending user input to the remote host responsive to the corresponding one of the first plurality of user interface components based on user input received via the corresponding one of the second plurality of user interface components. 7. The method of claim 5 , wherein the first user interface component comprises status information about the first application, said status information intended for presentation in a dialog box, and said method further comprises intercepting the status information and presenting the status information in a dialog box rendered in a style of the user interface associated with the client device.
| 0.726363 |
22. The system of claim 21 , wherein the memory device further comprises instructions executable by the processing device for causing the processing device to: determine the overall sentiment for the electronic communication by: determining a plurality of total sentiment scores for the plurality of blocks of characters using the sentiment dictionary; determining an aggregate sentiment score for the electronic communication by aggregating the plurality of total sentiment scores; and determining the overall sentiment based on the aggregate sentiment score.
|
22. The system of claim 21 , wherein the memory device further comprises instructions executable by the processing device for causing the processing device to: determine the overall sentiment for the electronic communication by: determining a plurality of total sentiment scores for the plurality of blocks of characters using the sentiment dictionary; determining an aggregate sentiment score for the electronic communication by aggregating the plurality of total sentiment scores; and determining the overall sentiment based on the aggregate sentiment score. 23. The system of claim 22 , wherein the memory device further comprises instructions executable by the processing device for causing the processing device to: determine the plurality of total sentiment scores for the plurality of blocks of characters using the sentiment dictionary by: accessing the sentiment dictionary; identifying one or more expressions in a respective block of characters that are in the sentiment dictionary; mapping the one or more expressions in the respective block to one or more corresponding sentiment values using the sentiment dictionary; and determining a respective total sentiment score for the respective block of characters by aggregating the one or more corresponding sentiment values.
| 0.79894 |
17. A data processing system as set forth in claim 16, wherein the command for invoking the application program is issued by another application program, and further including: means for storing a current interaction language; means for storing nested language information; and means responsive to the means for invoking the application program for setting the current interaction language to the selected interaction language and for saving a previous current interaction language in the means for storing nested language information.
|
17. A data processing system as set forth in claim 16, wherein the command for invoking the application program is issued by another application program, and further including: means for storing a current interaction language; means for storing nested language information; and means responsive to the means for invoking the application program for setting the current interaction language to the selected interaction language and for saving a previous current interaction language in the means for storing nested language information. 18. A data processing system as set forth in claim 17, wherein the means for selecting the interaction language further selects from the previous current interaction language. further selects from the previous current interaction language.
| 0.87814 |
22. The computer readable medium of claim 15 , wherein the computer program further comprises a set of instructions for defining a reference to a content file in the menu theme description file, wherein said reference comprises data for importing said content file.
|
22. The computer readable medium of claim 15 , wherein the computer program further comprises a set of instructions for defining a reference to a content file in the menu theme description file, wherein said reference comprises data for importing said content file. 23. The computer readable medium of claim 22 , wherein the content file comprises data of a multimedia graphic, animation movie, or audio clip.
| 0.924658 |
1. A system comprising: a server system, including one or more computers, which is configured to receive query messages from a client object, the server system asynchronously receiving and responding to the query messages from the client object over a network; the client object that, while a user is providing input comprising a lengthening string of characters, sends query messages to the server system; whereby the query messages represent the lengthening string as additional characters are being input by the user; and wherein the server system, while receiving said query messages, uses the input to query data available to the server system and send return messages to the client object containing results in response to the input; and wherein, upon receiving a return message of the return messages from the server system, the client object tests the usability of the results in the return message by checking that the return message corresponds to the latest query, and if usability is established, the client object displays or returns at least some result data to the user.
|
1. A system comprising: a server system, including one or more computers, which is configured to receive query messages from a client object, the server system asynchronously receiving and responding to the query messages from the client object over a network; the client object that, while a user is providing input comprising a lengthening string of characters, sends query messages to the server system; whereby the query messages represent the lengthening string as additional characters are being input by the user; and wherein the server system, while receiving said query messages, uses the input to query data available to the server system and send return messages to the client object containing results in response to the input; and wherein, upon receiving a return message of the return messages from the server system, the client object tests the usability of the results in the return message by checking that the return message corresponds to the latest query, and if usability is established, the client object displays or returns at least some result data to the user. 16. The system of claim 1 , wherein results returned by the server system comprise a set of zero or more results; wherein each result consists of one or more of a string, key, fetch time, expiration time, metadata, logical link to other data sources, or a Uniform Resource Identifier.
| 0.586604 |
2. The method of claim 1 , wherein providing the indication of the result associated with the determination comprises: if the at least one condition is determined to be not valid, providing the indication of the result to a display device for displaying an expressed result indicating that the at least one condition is not valid.
|
2. The method of claim 1 , wherein providing the indication of the result associated with the determination comprises: if the at least one condition is determined to be not valid, providing the indication of the result to a display device for displaying an expressed result indicating that the at least one condition is not valid. 4. The method of claim 2 , wherein providing the indication of the result to the display device for displaying comprises: displaying the expressed result upon determining that the at least one condition is not valid.
| 0.89102 |
17. At least one non-transitory computer-readable medium encoded with instructions that, when executed by a processor, perform: via at least a camera module, receiving visual information from a camera module; determining that the visual information comprises visual information indicative of a printed document that is being viewed by a user through a see through display; determining a printed document identifier that identifies the printed document based, at least in part, on the visual information received via the camera module; determining that the printed document identifier corresponds with a historical printed document record comprising information regarding previous user interactions with the printed document by the user during at least one previous session in which the user interacted with a document associated with the printed document identifier via the see through display or other see through display; retrieving, from the historical printed document record, at least one printed document interaction attribute associated with the previous user interactions by the user; and causing rendering of information indicative of the printed document interaction attribute on the see through display according to the previous user interactions by the user with the printed document being viewed by the user through the see through display, such that the rendered information on the see through display corresponds to the printed document as provided in the historical printed document record.
|
17. At least one non-transitory computer-readable medium encoded with instructions that, when executed by a processor, perform: via at least a camera module, receiving visual information from a camera module; determining that the visual information comprises visual information indicative of a printed document that is being viewed by a user through a see through display; determining a printed document identifier that identifies the printed document based, at least in part, on the visual information received via the camera module; determining that the printed document identifier corresponds with a historical printed document record comprising information regarding previous user interactions with the printed document by the user during at least one previous session in which the user interacted with a document associated with the printed document identifier via the see through display or other see through display; retrieving, from the historical printed document record, at least one printed document interaction attribute associated with the previous user interactions by the user; and causing rendering of information indicative of the printed document interaction attribute on the see through display according to the previous user interactions by the user with the printed document being viewed by the user through the see through display, such that the rendered information on the see through display corresponds to the printed document as provided in the historical printed document record. 20. The medium of claim 17 , further encoded with instructions that, when executed by a processor, perform: determining locational printed document interaction attribute that identifies a location of the user; and causing storage of information indicative of the locational printed document interaction attribute in the historical printed document record.
| 0.65071 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.