patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
10,013,161 | 20 | 26 | 20. A computer-implemented method, comprising: at a device with a display and a touch-sensitive surface: displaying text of an electronic document on the display; displaying an insertion marker at a first position in the text of the electronic document, the text around the first position having a visual appearance; detecting a first input at a location on the touch-sensitive surface, the location on the touch-sensitive surface corresponding to a location on the display where the text of the electronic document is displayed other than the first position in the text and a second position in the text, wherein the first input is an input in a first direction; and in response to detecting the first input: in accordance with a determination that the first input in the first direction at the location on the touch-sensitive surface that corresponds to the location on the display satisfies a first set of one or more predefined conditions: translating the electronic document on the display, and maintaining the insertion marker at the first position in the text; and, in accordance with a determination that the first input in the first direction at the location on the touch-sensitive surface that corresponds to the location on the display satisfies a second set of one or more predefined conditions that is distinct from the first set of one or more predefined conditions, the second set of one or more predefined conditions including a condition that the first input has a speed greater than a predefined threshold velocity: moving the insertion marker in the text from the first position to the second position in the text, and maintaining the visual appearance of the text around the first position in the text. | 20. A computer-implemented method, comprising: at a device with a display and a touch-sensitive surface: displaying text of an electronic document on the display; displaying an insertion marker at a first position in the text of the electronic document, the text around the first position having a visual appearance; detecting a first input at a location on the touch-sensitive surface, the location on the touch-sensitive surface corresponding to a location on the display where the text of the electronic document is displayed other than the first position in the text and a second position in the text, wherein the first input is an input in a first direction; and in response to detecting the first input: in accordance with a determination that the first input in the first direction at the location on the touch-sensitive surface that corresponds to the location on the display satisfies a first set of one or more predefined conditions: translating the electronic document on the display, and maintaining the insertion marker at the first position in the text; and, in accordance with a determination that the first input in the first direction at the location on the touch-sensitive surface that corresponds to the location on the display satisfies a second set of one or more predefined conditions that is distinct from the first set of one or more predefined conditions, the second set of one or more predefined conditions including a condition that the first input has a speed greater than a predefined threshold velocity: moving the insertion marker in the text from the first position to the second position in the text, and maintaining the visual appearance of the text around the first position in the text. 26. The computer-implemented method of claim 20 , wherein moving the insertion marker in the text from the first position to the second position in the text comprises moving the insertion marker to an edge of a selected portion of the text in which the insertion marker is currently located. | 0.759504 |
7,475,018 | 1 | 2 | 1. A method of structuring contents of an unstructured domain so as to impart value to the domain, comprising the steps of: identifying a plurality of elements of information associated with an unstructured domain; developing an initial domain model for utilizing the plurality of elements of information associated with the domain to create value; developing an estimate of costs associated with developing a knowledge map cataloging and describing at least some of said elements of information associated with the domain, and developing an estimate of the value of said knowledge map; comparing the estimates of costs and value and, based on said comparison, performing at least one of the steps of: storing and maintaining said model and said plurality of elements of information; and developing and storing the knowledge map so as to add structure and impart value to said domain. | 1. A method of structuring contents of an unstructured domain so as to impart value to the domain, comprising the steps of: identifying a plurality of elements of information associated with an unstructured domain; developing an initial domain model for utilizing the plurality of elements of information associated with the domain to create value; developing an estimate of costs associated with developing a knowledge map cataloging and describing at least some of said elements of information associated with the domain, and developing an estimate of the value of said knowledge map; comparing the estimates of costs and value and, based on said comparison, performing at least one of the steps of: storing and maintaining said model and said plurality of elements of information; and developing and storing the knowledge map so as to add structure and impart value to said domain. 2. The method of claim 1 , wherein the step of developing an initial domain model comprises at least one of the steps of defining an organizational scope, defining a content scope, defining a process scope, and defining economic factors relating to the domain. | 0.833972 |
9,600,169 | 19 | 20 | 19. The one or more non-transitory computer-readable storage media of claim 13 , wherein the one or more conditions external to the first device include that the one or more devices, other than the first device, are in the presence of the first device. | 19. The one or more non-transitory computer-readable storage media of claim 13 , wherein the one or more conditions external to the first device include that the one or more devices, other than the first device, are in the presence of the first device. 20. The one or more non-transitory computer-readable storage media of claim 19 , wherein the one or more conditions external to the first device include that the one or more devices, other than the first device, are logged in to the particular user account. | 0.956367 |
7,948,400 | 1 | 8 | 1. A computer-implemented system for valuation of relative utility of data associated with an arterial flow system, comprising: at least one computer adapted to implement components comprising: a flow system representation that describes probable flow for the flow system; a valuation component that generates a utility value associated with a plurality of sensors, each sensor sensing flow in a respective section of a plurality of sections of the flow system based at least in part upon the flow system representation, the utility value is generated as a function of historical data and indicates a utility of sensor data associated with the section in detecting congestion for the flow system; and a filter component that selectively communicates sensor data to at least one mobile device comprising a route planning system, the communicated sensor data comprising data from a subset of the plurality of sensors based on the utility value, the subset comprising multiple sensors selected by comparing utility values for sensors of the plurality of sensors to a threshold. | 1. A computer-implemented system for valuation of relative utility of data associated with an arterial flow system, comprising: at least one computer adapted to implement components comprising: a flow system representation that describes probable flow for the flow system; a valuation component that generates a utility value associated with a plurality of sensors, each sensor sensing flow in a respective section of a plurality of sections of the flow system based at least in part upon the flow system representation, the utility value is generated as a function of historical data and indicates a utility of sensor data associated with the section in detecting congestion for the flow system; and a filter component that selectively communicates sensor data to at least one mobile device comprising a route planning system, the communicated sensor data comprising data from a subset of the plurality of sensors based on the utility value, the subset comprising multiple sensors selected by comparing utility values for sensors of the plurality of sensors to a threshold. 8. The system of claim 1 , further comprising: a bottleneck identification component that identifies a location of a probable bottleneck; a bottleneck indicator component that identifies a bottleneck indicator section indicative of a bottleneck; and a route generating component that generates an alternate route based upon the probable bottleneck and the bottleneck indicator section. | 0.501295 |
8,005,866 | 1 | 13 | 1. A database system, comprising a computer having at least one processor; a non-relational transactional and analytical database executing on said processor, said database having at least two neurons, wherein one of said neurons is classified as a meme that is identified by at least one name, said name being termed as an alias, and the other said neuron is classified as a link, said link representing a logical three-way relationship between any three neurons in the database, and wherein said meme and said link are identified in terms of identifiers belonging to an arbitrary system of unique identification; and further wherein the database is operated through an application program interface (API); wherein each of said memes references a file of binary data stored with name equal to the identifier of said meme, file system metadata related to the file is stored within the meme and actual data of the file is stored on the underlying file-system. | 1. A database system, comprising a computer having at least one processor; a non-relational transactional and analytical database executing on said processor, said database having at least two neurons, wherein one of said neurons is classified as a meme that is identified by at least one name, said name being termed as an alias, and the other said neuron is classified as a link, said link representing a logical three-way relationship between any three neurons in the database, and wherein said meme and said link are identified in terms of identifiers belonging to an arbitrary system of unique identification; and further wherein the database is operated through an application program interface (API); wherein each of said memes references a file of binary data stored with name equal to the identifier of said meme, file system metadata related to the file is stored within the meme and actual data of the file is stored on the underlying file-system. 13. The database system of claim 1 , wherein said API exposing at least three major calls, namely a first call, and a second call, and a third call, wherein said first call, being a GET call, takes either the canonical name for a meme or its UUID, where after all attributes of the meme are retrieved, an instance of said class definition for the meme is created, and the properties of the are populated with the attributes of the meme, and wherein if the definition of class doesn't support an attribute of the meme, the attribute is ignored; and wherein the second call, being a G ET V ALUE call, takes an instance of a class and uses introspection to identify all attribute names and values of that instance, whereafter, said G ET V ALUE call serializes this information recursively using the basic API by converting attribute names and values to memes and relations between them into links, and wherein said third call, being a PUT call, takes an instance of a class and identifies introspectively all properties of that instance, whereafter said second call serializes the instance recursively using said API by converting attribute names and values to memes and relations between them into links. | 0.500416 |
7,484,185 | 14 | 16 | 14. The method of claim 13 , wherein a first graphical connector graphically connects only the plurality of found occurrences of the specified information element within the multilevel treeview and wherein a second graphical connector graphically connects all of the information elements within the multilevel treeview to indicate the hierarchy. | 14. The method of claim 13 , wherein a first graphical connector graphically connects only the plurality of found occurrences of the specified information element within the multilevel treeview and wherein a second graphical connector graphically connects all of the information elements within the multilevel treeview to indicate the hierarchy. 16. The method of claim 14 , wherein a level of the displayed multilevel treeview of the information hierarchy comprises at least one of the plurality of occurrences of the specified information element and the information elements of the information hierarchy. | 0.940601 |
8,332,206 | 1 | 3 | 1. A computer-implemented method for providing a definition or a translation, comprising: receiving an input indicating a word selected by a user; determining a user's language; communicating the determined user's language to a definition server and a translation server; sending, simultaneously, a definition request for the word to the definition server along with sending a translation request for the word to the translation server; receiving a response to the definition request from the definition server, wherein the response to the definition request indicates whether there is at least one definition of the word in the user's language; receiving a response to the translation request from the translation server, wherein the response to the translation request indicates whether there is at least one translation of the word in the user's language, wherein the response to the definition request and the response to the translation request are received simultaneously; determining whether to provide the user with a definition or a translation of the word based on the responses from the definition server and the translation server, wherein the determination comprises: determining to provide the user with the definition of the word when the response to the definition request includes at least one definition of the word in the user's language; and determining to provide the user with the translation of the word when the response to the definition request indicates that there is no definition of the word in the user's language and the response to the translation request includes at least one translation of the word in the user's language; and providing the user with the definition or the translation of the word based on the determination of whether to provide the user with a definition or a translation of the word, wherein the providing comprises a bubble showing the at least one definition or the at least one translation of the selected word. | 1. A computer-implemented method for providing a definition or a translation, comprising: receiving an input indicating a word selected by a user; determining a user's language; communicating the determined user's language to a definition server and a translation server; sending, simultaneously, a definition request for the word to the definition server along with sending a translation request for the word to the translation server; receiving a response to the definition request from the definition server, wherein the response to the definition request indicates whether there is at least one definition of the word in the user's language; receiving a response to the translation request from the translation server, wherein the response to the translation request indicates whether there is at least one translation of the word in the user's language, wherein the response to the definition request and the response to the translation request are received simultaneously; determining whether to provide the user with a definition or a translation of the word based on the responses from the definition server and the translation server, wherein the determination comprises: determining to provide the user with the definition of the word when the response to the definition request includes at least one definition of the word in the user's language; and determining to provide the user with the translation of the word when the response to the definition request indicates that there is no definition of the word in the user's language and the response to the translation request includes at least one translation of the word in the user's language; and providing the user with the definition or the translation of the word based on the determination of whether to provide the user with a definition or a translation of the word, wherein the providing comprises a bubble showing the at least one definition or the at least one translation of the selected word. 3. The method of claim 1 , wherein determining whether to provide the user with a definition or a translation of the word comprises determining to provide the user with the definition of the word when the response to the definition request includes at least one definition of the word in the user's language, and the response to the translation request indicates a detected source language of the word matching the user's language. | 0.741607 |
7,835,578 | 6 | 7 | 6. The method of claim 1 , further comprising the steps of: assigning each of the semantic class labels to a corresponding node of the graph; computing a count of the 4-connections between nodes; and forming an edge between two nodes when the count is above a predetermined number of pixels. | 6. The method of claim 1 , further comprising the steps of: assigning each of the semantic class labels to a corresponding node of the graph; computing a count of the 4-connections between nodes; and forming an edge between two nodes when the count is above a predetermined number of pixels. 7. The method of claim 6 , wherein the predetermined amount is about 10 pixels. | 0.973772 |
8,271,453 | 1 | 8 | 1. A method, comprising: receiving textual input; processing, by one or more computers, the textual input to produce a first output comprising first keys, wherein each first key is an ngram occurring in the textual input; processing, by the one or more computers, the first output to produce a second output comprising second keys and associated second values, wherein each second key is an anchor extracted from at least one of the first keys, wherein each anchor is defined by a beginning portion and an ending portion of a respective first key ngram, the beginning portion and ending portion being separated by a middle portion of the respective first key ngram, and wherein each second value is a set of middle portions associated with each distinct anchor; and processing, by the one or more computers, the second output to produce a third output comprising third keys and associated third values, wherein each third key is a potential paraphrase pair identified from a second value set of middle portions, and each third value is a set of anchors associated with the potential paraphrase pair. | 1. A method, comprising: receiving textual input; processing, by one or more computers, the textual input to produce a first output comprising first keys, wherein each first key is an ngram occurring in the textual input; processing, by the one or more computers, the first output to produce a second output comprising second keys and associated second values, wherein each second key is an anchor extracted from at least one of the first keys, wherein each anchor is defined by a beginning portion and an ending portion of a respective first key ngram, the beginning portion and ending portion being separated by a middle portion of the respective first key ngram, and wherein each second value is a set of middle portions associated with each distinct anchor; and processing, by the one or more computers, the second output to produce a third output comprising third keys and associated third values, wherein each third key is a potential paraphrase pair identified from a second value set of middle portions, and each third value is a set of anchors associated with the potential paraphrase pair. 8. The method of claim 1 , wherein each ngram occurs once in the first output. | 0.912162 |
8,468,163 | 1 | 3 | 1. A computer implemented method of enabling an ontology system to provide enhanced search capability, wherein said ontology system maintains information in the form of a plurality of ontologies, wherein each of said plurality of ontologies contains a corresponding plurality of nodes and a corresponding plurality of edges, some of said plurality of edges being of a corresponding one of a plurality of relationship types between a corresponding pair of said plurality of nodes, wherein the relationship type of an edge identifies the specific relation represented by the edge, said method comprising: receiving a search request specifying a set of nodes and a set of edges of interest, said search request further specifying a corresponding one of a set of relationship types for each of said set of edges of interest, wherein said received search request contains express data which explicitly identifies each of said set of nodes, said set of edges of interest and said set of relationship types, wherein said set of relationship types is contained in said plurality of relationship types; determining a set of ontologies matching said search request based on said set of nodes and said set of edges of interest, wherein said set of ontologies is contained in said plurality of ontologies, wherein said set of ontologies contains a first ontology and a second ontology, said first ontology and said second ontology respectively containing a first edge and a second edge, wherein both of said first edge and said second edge are between a same pair of nodes of said first ontology and said second ontology, wherein both of said same pair of nodes are contained in said set of nodes received in said search request, wherein said first edge in said first ontology is of a first relationship type matching the corresponding relationship type explicitly identified for a first edge of interest in said search request, wherein said first edge of interest is also between said same pair of nodes in said search request, wherein said second edge in said second ontology is not of said first relationship type; computing a match score for each of said set of ontologies, wherein a first match score and a second match score are respectively computed for said first ontology and said second ontology, wherein said first edge contributes more to said first match score than said second edge contributes to said second match score in view of said first edge being of said first relationship type in said first ontology, and said second edge not being of said first relationship type in said second ontology, ranking said set of ontologies according to the computed match scores; and sending a data indicating said set of ontologies and corresponding ranks as a result of said search request. | 1. A computer implemented method of enabling an ontology system to provide enhanced search capability, wherein said ontology system maintains information in the form of a plurality of ontologies, wherein each of said plurality of ontologies contains a corresponding plurality of nodes and a corresponding plurality of edges, some of said plurality of edges being of a corresponding one of a plurality of relationship types between a corresponding pair of said plurality of nodes, wherein the relationship type of an edge identifies the specific relation represented by the edge, said method comprising: receiving a search request specifying a set of nodes and a set of edges of interest, said search request further specifying a corresponding one of a set of relationship types for each of said set of edges of interest, wherein said received search request contains express data which explicitly identifies each of said set of nodes, said set of edges of interest and said set of relationship types, wherein said set of relationship types is contained in said plurality of relationship types; determining a set of ontologies matching said search request based on said set of nodes and said set of edges of interest, wherein said set of ontologies is contained in said plurality of ontologies, wherein said set of ontologies contains a first ontology and a second ontology, said first ontology and said second ontology respectively containing a first edge and a second edge, wherein both of said first edge and said second edge are between a same pair of nodes of said first ontology and said second ontology, wherein both of said same pair of nodes are contained in said set of nodes received in said search request, wherein said first edge in said first ontology is of a first relationship type matching the corresponding relationship type explicitly identified for a first edge of interest in said search request, wherein said first edge of interest is also between said same pair of nodes in said search request, wherein said second edge in said second ontology is not of said first relationship type; computing a match score for each of said set of ontologies, wherein a first match score and a second match score are respectively computed for said first ontology and said second ontology, wherein said first edge contributes more to said first match score than said second edge contributes to said second match score in view of said first edge being of said first relationship type in said first ontology, and said second edge not being of said first relationship type in said second ontology, ranking said set of ontologies according to the computed match scores; and sending a data indicating said set of ontologies and corresponding ranks as a result of said search request. 3. The method of claim 1 , wherein said receiving receives said express data representing said search request in the form of a file containing said set of nodes, said set of relationship types, and said set of edges of interest. | 0.866354 |
9,460,091 | 1 | 5 | 1. A method of annotating a text document, the method comprising: determining, by a computing device, a term of interest within the text document; searching a data structure storing incongruous term pairs (t x , tt) determined from a controlled vocabulary for the term of interest appearing as a term tt, wherein the term tt is a linguistic head of a term t x of the incongruous term pairs (t x , tt) and term t x is a linguistic derivative of term tt, wherein terms t x , tt have a hierarchical relationship corresponding to the controlled vocabulary; determining a plurality of compound noun phrases within the controlled vocabulary, wherein each compound noun phrase includes terms t x and tt; determining a semantic distance between the second term and the first term, and for each compound noun phrase wherein the semantic distance between t x , and tt is greater than a predetermined threshold distance, saving the compound noun phrase in a data structure as an incongruous term pair (t x , tt), wherein the incongruous term pair has a linguistic discrepancy and a semantic discrepancy, wherein the second term is term tt and the first term is t; and annotating, by the computing device, the term of interest with a meaning provided by the controlled vocabulary only when each term t x of the incongruous term pairs (t x , tt) including the term of interest as term tt in the data structure is not present within a predetermined textual distance of the term of interest in the text document. | 1. A method of annotating a text document, the method comprising: determining, by a computing device, a term of interest within the text document; searching a data structure storing incongruous term pairs (t x , tt) determined from a controlled vocabulary for the term of interest appearing as a term tt, wherein the term tt is a linguistic head of a term t x of the incongruous term pairs (t x , tt) and term t x is a linguistic derivative of term tt, wherein terms t x , tt have a hierarchical relationship corresponding to the controlled vocabulary; determining a plurality of compound noun phrases within the controlled vocabulary, wherein each compound noun phrase includes terms t x and tt; determining a semantic distance between the second term and the first term, and for each compound noun phrase wherein the semantic distance between t x , and tt is greater than a predetermined threshold distance, saving the compound noun phrase in a data structure as an incongruous term pair (t x , tt), wherein the incongruous term pair has a linguistic discrepancy and a semantic discrepancy, wherein the second term is term tt and the first term is t; and annotating, by the computing device, the term of interest with a meaning provided by the controlled vocabulary only when each term t x of the incongruous term pairs (t x , tt) including the term of interest as term tt in the data structure is not present within a predetermined textual distance of the term of interest in the text document. 5. The method of claim 1 , wherein, for each incongruous term pair (t x , tt), a semantic distance between the term t x and the term tt is greater than a threshold distance within the controlled vocabulary. | 0.643599 |
10,013,418 | 7 | 11 | 7. A translation system comprising: a translation device for performing translation into a set translation language; and a control device including a translation language setting processor for (i) regularly determining whether a change in a position of the translation device has occurred and (ii) when a change in the position of the translation device is determined, setting the translation language from among used languages of speakers near the translation device based on located language information and position information of the translation device, wherein the translation device includes an input device for inputting an input sentence the input device including a microphone, and an output device for outputting an output sentence obtained by translating the input sentence into the translation language set by the translation language setting processor, the output device including a speaker, wherein the control device detects the position information of the translation device, and transmits information identifying the translation language to the translation device, and wherein the located language information includes a predetermined location of each of a plurality of speakers and a used language of the each of the plurality of speakers. | 7. A translation system comprising: a translation device for performing translation into a set translation language; and a control device including a translation language setting processor for (i) regularly determining whether a change in a position of the translation device has occurred and (ii) when a change in the position of the translation device is determined, setting the translation language from among used languages of speakers near the translation device based on located language information and position information of the translation device, wherein the translation device includes an input device for inputting an input sentence the input device including a microphone, and an output device for outputting an output sentence obtained by translating the input sentence into the translation language set by the translation language setting processor, the output device including a speaker, wherein the control device detects the position information of the translation device, and transmits information identifying the translation language to the translation device, and wherein the located language information includes a predetermined location of each of a plurality of speakers and a used language of the each of the plurality of speakers. 11. The translation system according to claim 7 , wherein the second communication device transmits the input sentence and the translation language to the control device, and receives the output sentence that has been translated into the translation language by the translation device, and wherein the output device outputs the output sentence received by the second communication device. | 0.766827 |
9,728,185 | 11 | 12 | 11. The system of claim 7 , wherein adjusting, by the speech recognition system and using the text label scores for the plurality of text label sequences for the audio input, at least some of the first trained parameter values for the acoustic model, the inverse pronunciation model, and the language model comprises training the inverse pronunciation model and the acoustic model using a backpropagation technique. | 11. The system of claim 7 , wherein adjusting, by the speech recognition system and using the text label scores for the plurality of text label sequences for the audio input, at least some of the first trained parameter values for the acoustic model, the inverse pronunciation model, and the language model comprises training the inverse pronunciation model and the acoustic model using a backpropagation technique. 12. The system of claim 11 , wherein: the inverse pronunciation model comprises one or more LSTM blocks that receive the phoneme scores and generate an output from the phoneme scores and one or more CTC layers that receive the output from the LSTM blocks and transform the output into the grapheme scores; and the language model comprises one or more LSTM blocks that receive the grapheme scores and generate an output from the grapheme scores and one or more CTC layers that receive the output from the LSTM blocks and transform the output into the text label scores. | 0.92768 |
8,832,542 | 17 | 18 | 17. The apparatus as in claim 10 , wherein the decoding module is further adapted for segmenting the at least one character into at least two segments and determining a symbol in each of the at least two segments. | 17. The apparatus as in claim 10 , wherein the decoding module is further adapted for segmenting the at least one character into at least two segments and determining a symbol in each of the at least two segments. 18. The method as in claim 17 , wherein the decoding module is further adapted for summing the numerical values determined for the symbols in each of the at least two segments. | 0.921847 |
9,235,871 | 1 | 2 | 1. A system to interface between a CPU and GPU to execute a program, the system comprising: a general purpose central processing unit (CPU) device executing commands in a CPU programming language; a graphic processing unit (GPU) device executing commands in a GPU programming language that is distinct from the CPU programming language; a command processor accessible to the CPU device and the GPU device, the command processor managing jobs from the program for processing by the CPU device or the GPU device, the command processor creating commands from the jobs in a state free command format, the command processor generating a first sequence of commands for execution by the CPU device and a second sequence of commands for execution by the GPU device in the command format; and a data compiler running a meta language to convert program data for the commands into a first data format readable by the CPU programming language and a second data format readable by the GPU programming language. | 1. A system to interface between a CPU and GPU to execute a program, the system comprising: a general purpose central processing unit (CPU) device executing commands in a CPU programming language; a graphic processing unit (GPU) device executing commands in a GPU programming language that is distinct from the CPU programming language; a command processor accessible to the CPU device and the GPU device, the command processor managing jobs from the program for processing by the CPU device or the GPU device, the command processor creating commands from the jobs in a state free command format, the command processor generating a first sequence of commands for execution by the CPU device and a second sequence of commands for execution by the GPU device in the command format; and a data compiler running a meta language to convert program data for the commands into a first data format readable by the CPU programming language and a second data format readable by the GPU programming language. 2. The system of claim 1 , wherein the commands in the command format include commands for specific graphic processing functions or for general GPU operations. | 0.731419 |
8,082,270 | 6 | 7 | 6. The computer implemented system of claim 4 , further comprising a computation module for computing length of the accepted search terms, wherein said length is compared with a predefined value to determine need for comparing the accepted search terms with the stored data in the first data fields to find exact matches. | 6. The computer implemented system of claim 4 , further comprising a computation module for computing length of the accepted search terms, wherein said length is compared with a predefined value to determine need for comparing the accepted search terms with the stored data in the first data fields to find exact matches. 7. The computer implemented system of claim 6 , wherein said computation module further computes a matching score for each of said found matches. | 0.969345 |
9,431,005 | 8 | 12 | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform a method comprising: projecting an expected demand for speech recognition resources; identifying, based on the expected demand for speech recognition, a main speech recognizer and a supplemental speech recognizer; assigning the main speech recognizer to recognize a plurality of speech from a plurality of speakers; beginning to process the plurality of speech using the main speech recognizer, to yield main results; and upon determining that first speech recognition results of a first user in the plurality of speakers have a lower accuracy than alternative speech recognition results of a second user: assigning the supplemental speech recognizer to recognize speech from the first user, wherein the assigning of the supplemental speech recognizer is a reallocation of the supplemental speech recognizer away from the second user; continuing to process the speech from the first user using the supplemental speech recognizer and the main speech recognizer, to yield supplemental results; and combining additional speech recognition results, produced by the main speech recognizer, and the supplemental results. | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform a method comprising: projecting an expected demand for speech recognition resources; identifying, based on the expected demand for speech recognition, a main speech recognizer and a supplemental speech recognizer; assigning the main speech recognizer to recognize a plurality of speech from a plurality of speakers; beginning to process the plurality of speech using the main speech recognizer, to yield main results; and upon determining that first speech recognition results of a first user in the plurality of speakers have a lower accuracy than alternative speech recognition results of a second user: assigning the supplemental speech recognizer to recognize speech from the first user, wherein the assigning of the supplemental speech recognizer is a reallocation of the supplemental speech recognizer away from the second user; continuing to process the speech from the first user using the supplemental speech recognizer and the main speech recognizer, to yield supplemental results; and combining additional speech recognition results, produced by the main speech recognizer, and the supplemental results. 12. The system of claim 8 , wherein the main results and the supplemental results comprise recognition strings. | 0.837243 |
7,747,633 | 1 | 6 | 1. A computer-implemented method for maintaining a hierarchical tree representation of an extensible markup language (XML) data string, comprising using at least one processor coupled to a memory to perform the following operations: detecting a modification to an XML data string; determining a location of the modification in the XML data string; correlating the location of the modification to at least one node in a hierarchical tree formed as a tokenized representation of the XML data string; deleting a portion of the hierarchical tree based at least in part on the modification corresponding to deleting a portion of the XML data string; determining a last node in the deleted portion of the hierarchical tree, and populating at least one sub-tree with nodes associated with the last node in the deleted portion of the hierarchical tree; and inserting the at least one sub-tree into the hierarchical tree following the deleting the portion of the hierarchical tree. | 1. A computer-implemented method for maintaining a hierarchical tree representation of an extensible markup language (XML) data string, comprising using at least one processor coupled to a memory to perform the following operations: detecting a modification to an XML data string; determining a location of the modification in the XML data string; correlating the location of the modification to at least one node in a hierarchical tree formed as a tokenized representation of the XML data string; deleting a portion of the hierarchical tree based at least in part on the modification corresponding to deleting a portion of the XML data string; determining a last node in the deleted portion of the hierarchical tree, and populating at least one sub-tree with nodes associated with the last node in the deleted portion of the hierarchical tree; and inserting the at least one sub-tree into the hierarchical tree following the deleting the portion of the hierarchical tree. 6. The computer-implemented method of claim 1 , further comprising locating a common ancestor of at least two nodes, one node of the at least two nodes representing a node before a first node deleted in the deleting the portion of the XML string, and another node of the at least two nodes representing a last node deleted in the deleting the portion of the XML data string. | 0.501333 |
9,729,479 | 9 | 16 | 9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. | 9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. 16. The computer program product of claim 9 , wherein the displaying of the reply message with the one or more topics as the temporary text in the body of the reply message comprises: displaying a prompt for confirmation for the one or more topics as appropriate for the original text. | 0.749561 |
9,015,611 | 6 | 8 | 6. A computer program product encoded on a computer storage medium, operable to cause data processing apparatus to perform operations comprising: associating a parent component and a child component in an executing source application, where an output of the child component is connected with an input of the parent component, and where the parent and child components are used in a presentation of document data during navigation among documents; presenting a first navigation user interface in a source application window, including displaying a first representation of a source document in accordance with the parent and child components of the source application; receiving input adding the first representation of the source document from the source application window to a target application window of an executing target application; determining, in response to receiving the first representation of the source document, a relationship between the parent and child components associated with the first representation, and then inserting one or more computer-readable instructions associated with the parent component and one or more computer-readable instructions associated with the child component into the target application; presenting a second navigation user interface in the target application window, including displaying a second representation of a target document in accordance with the relationship between the parent and child components associated with the first representation; and determining, in response to receiving the first representation of the source document, that the output of the grandchild component is connected with the input of the child component, and then inserting one or more computer-readable instructions associated with the grandchild component into the target application; wherein associating the parent and child components further comprises associating a grandchild component with the child component in the executing source application, where an output of the grandchild component is connected with an input of the child component and where the parent and child and grandchild components are used in the presentation of document data during navigation among documents; and wherein presenting the second navigation interface includes displaying the second representation of the target document according to the parent component, the child component, and the grandchild component. | 6. A computer program product encoded on a computer storage medium, operable to cause data processing apparatus to perform operations comprising: associating a parent component and a child component in an executing source application, where an output of the child component is connected with an input of the parent component, and where the parent and child components are used in a presentation of document data during navigation among documents; presenting a first navigation user interface in a source application window, including displaying a first representation of a source document in accordance with the parent and child components of the source application; receiving input adding the first representation of the source document from the source application window to a target application window of an executing target application; determining, in response to receiving the first representation of the source document, a relationship between the parent and child components associated with the first representation, and then inserting one or more computer-readable instructions associated with the parent component and one or more computer-readable instructions associated with the child component into the target application; presenting a second navigation user interface in the target application window, including displaying a second representation of a target document in accordance with the relationship between the parent and child components associated with the first representation; and determining, in response to receiving the first representation of the source document, that the output of the grandchild component is connected with the input of the child component, and then inserting one or more computer-readable instructions associated with the grandchild component into the target application; wherein associating the parent and child components further comprises associating a grandchild component with the child component in the executing source application, where an output of the grandchild component is connected with an input of the child component and where the parent and child and grandchild components are used in the presentation of document data during navigation among documents; and wherein presenting the second navigation interface includes displaying the second representation of the target document according to the parent component, the child component, and the grandchild component. 8. The computer program product of claim 6 , further operable to cause data processing apparatus to perform operations comprising: determining that an input of the child component is not connected to an output of a component in the target application; identifying a first component in the target application that has an output of a same type as the input of the child component and that is not connected to an input of a component in the target application; and associating the child component and the first component in the target application and connecting the input of the child component with the output of the first component. | 0.507031 |
10,089,555 | 1 | 7 | 1. A method executed by a processor of an optical character recognition (OCR) accuracy testing apparatus for testing an OCR process on a healthcare document, the method comprising: receiving an original text file and a template for the healthcare document, the healthcare document being one of an electronic health record, a lab result, a patient visit record, a triage report, an emergency room report, or a surgery report, wherein the original text file comprises machine-readable text, wherein the template defines a font and a layout to be applied to the text in the original text file; automatically converting the original text file according to the font and the layout defined by the template to generate a plurality of images of different file formats, each image in the plurality of images having pixels indicative of the text, an associated resolution, and the font and the layout defined by the template; causing the OCR process to be executed for each image in the plurality of images to generate a converted text file for each image, the converted text file for each image comprising second machine-readable text, wherein the second machine-readable text is based upon the pixels; calculating, with the processor, an accuracy score of the OCR process for each image in the plurality of the images based on a comparison of the text in the original text file and the second text in the converted text file for each image; and flagging an image in the plurality of images when an accuracy score of the OCR process associated with the image is below a threshold score, wherein flagging the image indicates that a problem exists in the OCR process with respect to a file format of the image and the template. | 1. A method executed by a processor of an optical character recognition (OCR) accuracy testing apparatus for testing an OCR process on a healthcare document, the method comprising: receiving an original text file and a template for the healthcare document, the healthcare document being one of an electronic health record, a lab result, a patient visit record, a triage report, an emergency room report, or a surgery report, wherein the original text file comprises machine-readable text, wherein the template defines a font and a layout to be applied to the text in the original text file; automatically converting the original text file according to the font and the layout defined by the template to generate a plurality of images of different file formats, each image in the plurality of images having pixels indicative of the text, an associated resolution, and the font and the layout defined by the template; causing the OCR process to be executed for each image in the plurality of images to generate a converted text file for each image, the converted text file for each image comprising second machine-readable text, wherein the second machine-readable text is based upon the pixels; calculating, with the processor, an accuracy score of the OCR process for each image in the plurality of the images based on a comparison of the text in the original text file and the second text in the converted text file for each image; and flagging an image in the plurality of images when an accuracy score of the OCR process associated with the image is below a threshold score, wherein flagging the image indicates that a problem exists in the OCR process with respect to a file format of the image and the template. 7. The method of claim 1 , wherein the layout defined by the template comprises predefined columns or tables. | 0.943406 |
8,060,494 | 4 | 11 | 4. The computer-implemented method of claim 1 , further comprising binning the word lattice to organize each word lattice in columns containing the words candidates and associated confidence scores, each confidence score defined as a likelihood that the word candidate is a possible substitute for a query term. | 4. The computer-implemented method of claim 1 , further comprising binning the word lattice to organize each word lattice in columns containing the words candidates and associated confidence scores, each confidence score defined as a likelihood that the word candidate is a possible substitute for a query term. 11. The computer-implemented method of claim 4 , further comprising: quantizing a plurality of confidence scores into a discrete number of confidence scores; and decorating a word candidate with a confidence score by appending to the word candidate a suffix corresponding to that confidence score. | 0.886294 |
9,244,906 | 6 | 7 | 6. The method of claim 5 , further comprising displaying the suggested candidate words as user-selectable on a display of the electronic communication device. | 6. The method of claim 5 , further comprising displaying the suggested candidate words as user-selectable on a display of the electronic communication device. 7. The method of claim 6 , further comprising displaying at least two of the suggested candidate words superimposed on a virtual keyboard. | 0.965552 |
7,526,459 | 1 | 5 | 1. An adaptive social network system, comprising: a computer-implemented structural aspect comprising a plurality of objects and at least one relationship between a first object and a second object; a representation of one or more users of the system as one or more objects of the plurality of objects; a usage aspect, comprising captured usage behaviors, wherein the usage behaviors are associated with one or more users; a function to determine an affinity between a first user represented as an object and a second user represented as an object of the plurality of objects based, at least in part, on inferred interests derived from the e plurality of usage behaviors associated with the one or more users; and a function to generate a user accessible social network representation, wherein the social network representation comprises a plurality of users represented as objects and the affinity between the representation of a first user as an object and the representation of a second user as an object. | 1. An adaptive social network system, comprising: a computer-implemented structural aspect comprising a plurality of objects and at least one relationship between a first object and a second object; a representation of one or more users of the system as one or more objects of the plurality of objects; a usage aspect, comprising captured usage behaviors, wherein the usage behaviors are associated with one or more users; a function to determine an affinity between a first user represented as an object and a second user represented as an object of the plurality of objects based, at least in part, on inferred interests derived from the e plurality of usage behaviors associated with the one or more users; and a function to generate a user accessible social network representation, wherein the social network representation comprises a plurality of users represented as objects and the affinity between the representation of a first user as an object and the representation of a second user as an object. 5. The adaptive social network system of claim 1 , wherein a function to determine an affinity between a first user represented as an object and a second user represented as an object of the plurality of objects based, at least in part, on inferred interests derived from the plurality of usage behaviors associated with the one or more users comprises: means to apply usage behavior categories, wherein the usage behavior categories are selected from a group consisting of navigation and access patterns, collaborative patterns, direct feedback patterns, subscription patterns, self-profiling patterns, reference patterns, physical location patterns, and usage temporal patterns. | 0.559014 |
8,839,194 | 1 | 10 | 1. A web page creating system, comprising: a runtime engine to execute a method of a business object and return an execution result in response to a request; a script component to perform preprocessing on an input value, to perform post-processing on the execution result, to integrate the business object with a separate user interface object in runtime, and to dynamically arrange the user interface object using a Markup Language template and to render and provide the user interface object as a markup language in runtime; a core component to initialize a framework and confirm whether the request can be processed in the framework; and a processor to execute one or more of the runtime engine, the script component, and the core component, wherein a prototype business object is created and used during the integration of the business object with the separate user interface object. | 1. A web page creating system, comprising: a runtime engine to execute a method of a business object and return an execution result in response to a request; a script component to perform preprocessing on an input value, to perform post-processing on the execution result, to integrate the business object with a separate user interface object in runtime, and to dynamically arrange the user interface object using a Markup Language template and to render and provide the user interface object as a markup language in runtime; a core component to initialize a framework and confirm whether the request can be processed in the framework; and a processor to execute one or more of the runtime engine, the script component, and the core component, wherein a prototype business object is created and used during the integration of the business object with the separate user interface object. 10. The system of claim 1 , wherein the script component dynamically arranges a plurality of user interface objects with respect to one another. | 0.861538 |
7,860,855 | 7 | 8 | 7. The system of claim 1 wherein each of the taxonomies includes one root node and one or more hierarchically ordered paths, wherein each hierarchically ordered path is associated with an enumerated path representation including an ordered sequence of identifiers of branches from hierarchical predecessor nodes to each immediate hierarchical successor node in the each hierarchically ordered path, based on a concept hierarchy, and wherein the hierarchical path engine is configured to determine, for each one of the concept pairs, the associated length of the nondiverging intersection based on a comparison of enumerated path representations associated with each of the first concept node representing the first set concept included in the each one of the concept pairs, and the second concept node representing the second set concept included in the each one of the concept pairs. | 7. The system of claim 1 wherein each of the taxonomies includes one root node and one or more hierarchically ordered paths, wherein each hierarchically ordered path is associated with an enumerated path representation including an ordered sequence of identifiers of branches from hierarchical predecessor nodes to each immediate hierarchical successor node in the each hierarchically ordered path, based on a concept hierarchy, and wherein the hierarchical path engine is configured to determine, for each one of the concept pairs, the associated length of the nondiverging intersection based on a comparison of enumerated path representations associated with each of the first concept node representing the first set concept included in the each one of the concept pairs, and the second concept node representing the second set concept included in the each one of the concept pairs. 8. The system of claim 7 wherein each enumerated path representation includes an ordered sequence of numeric identifiers of branches from hierarchical predecessor nodes to each immediate hierarchical successor node in the each hierarchically ordered path, based on a concept hierarchy. | 0.943068 |
9,535,983 | 5 | 13 | 5. The method in accordance with claim 3 , wherein the act of performing a search comprises an act of performing a search for a text sample that includes a first particular text component, the method comprising: an act of scanning through the text sample identifiers of the plurality of text sample entry groups in search of a first particular text component identifier that identifies the first particular text component; whenever upon finding the first particular text component identifier during the act of scanning, an act of using the corresponding text sample identifier to identify the text sample that includes the first particular text component. | 5. The method in accordance with claim 3 , wherein the act of performing a search comprises an act of performing a search for a text sample that includes a first particular text component, the method comprising: an act of scanning through the text sample identifiers of the plurality of text sample entry groups in search of a first particular text component identifier that identifies the first particular text component; whenever upon finding the first particular text component identifier during the act of scanning, an act of using the corresponding text sample identifier to identify the text sample that includes the first particular text component. 13. The method in accordance with claim 5 , wherein the act of performing a search comprises an act of performing a search for a text sample that includes the first particular text component, but which also does not include a second particular text component, the act of scanning also performed in search of a second particular text component identifier that identifies the second particular text component; whenever upon finding the second particular text component identifier during the act of scanning, an act of using the corresponding text sample identifier to identify the text sample that includes the second particular text component, the method further comprising: an act of identifying a result of the search as including at least some of the text samples that include the first particular text component, but which does not include the second particular text component. | 0.839122 |
9,116,706 | 4 | 7 | 4. The method according to claim 1 , wherein the method further comprises a new software function type called //DC representing interactive operation of a new abstract distributed execution-time object comprising a new application program thread connected to a new browser window via a new TCP connection which in this embodiment is a new websocket connection, wherein the application code for a //DC function is encapsulated in the thread of said object whereas source-code name of a //DC function identifies the execution-time purpose of said object whereas this claim refers to said object also as “//DC object”; wherein a DFWAP's source-code notation identifies a //DC function and identifies the application program code of said function; wherein a call in source code to a //DC function is not a traditional function call but is a place-holder for YWAM's Dual Server Web Application Protocol (DSWAP); and wherein said DSWAP protocol dynamically creates at run time said function's //DC object and starts execution of the function's application program code encapsulated in said thread of said //DC object whereas the dialogue functions of said thread interact with the documents of the window of said object. | 4. The method according to claim 1 , wherein the method further comprises a new software function type called //DC representing interactive operation of a new abstract distributed execution-time object comprising a new application program thread connected to a new browser window via a new TCP connection which in this embodiment is a new websocket connection, wherein the application code for a //DC function is encapsulated in the thread of said object whereas source-code name of a //DC function identifies the execution-time purpose of said object whereas this claim refers to said object also as “//DC object”; wherein a DFWAP's source-code notation identifies a //DC function and identifies the application program code of said function; wherein a call in source code to a //DC function is not a traditional function call but is a place-holder for YWAM's Dual Server Web Application Protocol (DSWAP); and wherein said DSWAP protocol dynamically creates at run time said function's //DC object and starts execution of the function's application program code encapsulated in said thread of said //DC object whereas the dialogue functions of said thread interact with the documents of the window of said object. 7. The method according to claim 4 , wherein implementation of a //DC function with a user-interface dialogue document containing a Parallel Interactive Document Object (PIDO) comprises steps: (a) include in the dialogue document a PIDO definition comprising a set of HTML elements and encapsulate this set of HTML elements between “begin PIDO_identifier” and “end PIDO_identifier” statements and/or include in each element of the set a PIDO_identifier attribute; (b) Include in the dialogue document code for sending PIDO's websocket messages to the PIDO's //DC-function server thread; (c) program the //DC-function server thread with a message-dispatching loop to: (i) read a websocket PIDO message sent by a browser document and, if not already created, create the PIDO's thread; and (ii) pass the message to the target PIDO thread via classical producer-consumer synchronization between this message dispatching //DC thread (i.e., the producer) and the PIDO's server application-program thread (i.e., the consumer); (d) Within the PIDO's server thread, write code to process incoming messages and send display-manipulating output websocket messages to the PIDO's dialogue document. | 0.947999 |
9,703,547 | 13 | 15 | 13. A method for determining program equivalence between a first program and multiple candidate programs, the method comprising steps of: defining a program semantic abstraction for the first program; generating a search query based on said program semantic abstraction for the first program; executing said search query against an index of multiple programs, wherein said index comprises a program semantics abstraction defined for each of the multiple programs; outputting a pre-determined number of candidate equivalent programs, from the index of multiple programs, as a result of executing said search query against the index, wherein the pre-determined number of candidate equivalent programs is based on one or more metrics; refactoring (i) the first program and (ii) each program in the pre-determined number of candidate equivalent programs, wherein said refactoring is based on (a) one or more patterns of program equivalence and (b) one or more canonicalization operators; outputting a canonical representation of (i) the first program and (ii) each respective program in the pre-determined number of candidate equivalent programs as a result of said refactoring; classifying one or more programs among the pre-determined number of candidate equivalent programs as matching the first program by performing a comparison, across the pre-determined number of candidate equivalent programs, of the canonical representation associated with each respective program in the pre-determined number of candidate equivalent programs to the canonical representation associated with the first program, wherein said performing the comparison comprises: extracting multiple semantic features from (i) the canonical representation associated with each respective program in the candidate equivalent programs and (ii) the canonical representation associated with the first program; creating an index based on the extracted semantic features from the canonical representation associated with each respective program in the candidate equivalent programs; searching the created index using the extracted semantic features from the canonical representation associated with the first program; and computing similarity measures between (i) the canonical representation associated with each respective program in the candidate equivalent programs and (ii) the canonical representation associated with the first program, wherein each similarity measure comprises a function of overlap of extracted semantic features based on said searching, and wherein computing each similarity measure comprises: identifying a variable in a canonical representation associated with a given program in the set of candidate programs, wherein the identified variable is equivalent to an output variable in the canonical representation associated with the first program, and wherein said identifying comprises implementing data-slicing analysis; and analyzing slices with respect to (i) the identified variable in the canonical representation associated with a given program in the set of candidate programs and (ii) the output variable in the canonical representation associated with the first program to determining whether the given program and the first program both comply with a given pattern of computing; and outputting an identification of the one or more programs classified as matching to at least one user; wherein the steps are carried out by at least one processor coupled to a memory. | 13. A method for determining program equivalence between a first program and multiple candidate programs, the method comprising steps of: defining a program semantic abstraction for the first program; generating a search query based on said program semantic abstraction for the first program; executing said search query against an index of multiple programs, wherein said index comprises a program semantics abstraction defined for each of the multiple programs; outputting a pre-determined number of candidate equivalent programs, from the index of multiple programs, as a result of executing said search query against the index, wherein the pre-determined number of candidate equivalent programs is based on one or more metrics; refactoring (i) the first program and (ii) each program in the pre-determined number of candidate equivalent programs, wherein said refactoring is based on (a) one or more patterns of program equivalence and (b) one or more canonicalization operators; outputting a canonical representation of (i) the first program and (ii) each respective program in the pre-determined number of candidate equivalent programs as a result of said refactoring; classifying one or more programs among the pre-determined number of candidate equivalent programs as matching the first program by performing a comparison, across the pre-determined number of candidate equivalent programs, of the canonical representation associated with each respective program in the pre-determined number of candidate equivalent programs to the canonical representation associated with the first program, wherein said performing the comparison comprises: extracting multiple semantic features from (i) the canonical representation associated with each respective program in the candidate equivalent programs and (ii) the canonical representation associated with the first program; creating an index based on the extracted semantic features from the canonical representation associated with each respective program in the candidate equivalent programs; searching the created index using the extracted semantic features from the canonical representation associated with the first program; and computing similarity measures between (i) the canonical representation associated with each respective program in the candidate equivalent programs and (ii) the canonical representation associated with the first program, wherein each similarity measure comprises a function of overlap of extracted semantic features based on said searching, and wherein computing each similarity measure comprises: identifying a variable in a canonical representation associated with a given program in the set of candidate programs, wherein the identified variable is equivalent to an output variable in the canonical representation associated with the first program, and wherein said identifying comprises implementing data-slicing analysis; and analyzing slices with respect to (i) the identified variable in the canonical representation associated with a given program in the set of candidate programs and (ii) the output variable in the canonical representation associated with the first program to determining whether the given program and the first program both comply with a given pattern of computing; and outputting an identification of the one or more programs classified as matching to at least one user; wherein the steps are carried out by at least one processor coupled to a memory. 15. The method of claim 13 , wherein said outputting comprises outputting the identification of the one or more programs classified as matching to a human user. | 0.613527 |
8,397,223 | 1 | 8 | 1. A computer-implemented method, comprising: receiving input files comprising markup language text for a graphical user interface; obtaining an application framework code; receiving web application business logic objects; organizing the application framework code and the web application business logic objects into web application source code; and binding the web application source code with the input files, the binding including compiling the input files; wherein the application framework code is configured to, at runtime, detect any change to web application screens and to re-compile the input files in response to detecting the any change. | 1. A computer-implemented method, comprising: receiving input files comprising markup language text for a graphical user interface; obtaining an application framework code; receiving web application business logic objects; organizing the application framework code and the web application business logic objects into web application source code; and binding the web application source code with the input files, the binding including compiling the input files; wherein the application framework code is configured to, at runtime, detect any change to web application screens and to re-compile the input files in response to detecting the any change. 8. The computer-implemented method of claim 1 , further comprising generating an event handler code, the generating comprising: parsing the markup language text; identifying an input tag in the markup language text; identifying, in the markup language text, an attribute within the identified input tag; identifying, in the markup language text, a value corresponding to the identified attribute; and using the identified input tag, the identified attribute, and the identified value to identify a rule; and using the identified rule, the identified input tag, the identified attribute, and the identified value to create the event handler code. | 0.500774 |
8,869,048 | 10 | 11 | 10. The system of claim 5 , wherein said wizard engine being configured to read a user interface container definition comprises said wizard engine being configured to select between a plurality of user interface containers to select said user interface container. | 10. The system of claim 5 , wherein said wizard engine being configured to read a user interface container definition comprises said wizard engine being configured to select between a plurality of user interface containers to select said user interface container. 11. The system of claim 10 , wherein said wizard engine being configured to read a user-created declarative story comprises said wizard engine being configured to read a user-created declarative story that includes one or more of: a data item layout hint, a section item layout hint, and a story layout hint. | 0.913191 |
9,471,943 | 1 | 6 | 1. A method comprising: providing a sponsored story unit to one or more client devices for initial presentation to one or more users of the social networking system connected to an acting user of the social networking system, the sponsored story unit including descriptions of a first action and a second action associated with the acting user; responsive to the initial presentation of the sponsored story unit to the one or more users of the social networking system, providing instructions to a client device associated with the acting user that cause the client device to present a notification to the acting user, the notification including information describing the presented sponsored story unit including the descriptions of the first and the second action associated with the acting user and including one or more settings for preventing inclusion of the first action associated with the acting user in one or more sponsored story units, wherein the one or more settings at least identify an action prevented from inclusion in the one or more sponsored story units based on the identity of a promoting user that provided the one or more sponsored story units; receiving one or more selected settings included in the notification from the client device associated with the acting user, the selected settings identifying the first action to be prevented from inclusion in the one or more sponsored story units; storing the one or more selected settings in a user profile associated with the acting user and maintained by the social networking system; and modifying the sponsored story unit for presentation based on the one or more selected settings, the modified sponsored story unit not including a description of the first action. | 1. A method comprising: providing a sponsored story unit to one or more client devices for initial presentation to one or more users of the social networking system connected to an acting user of the social networking system, the sponsored story unit including descriptions of a first action and a second action associated with the acting user; responsive to the initial presentation of the sponsored story unit to the one or more users of the social networking system, providing instructions to a client device associated with the acting user that cause the client device to present a notification to the acting user, the notification including information describing the presented sponsored story unit including the descriptions of the first and the second action associated with the acting user and including one or more settings for preventing inclusion of the first action associated with the acting user in one or more sponsored story units, wherein the one or more settings at least identify an action prevented from inclusion in the one or more sponsored story units based on the identity of a promoting user that provided the one or more sponsored story units; receiving one or more selected settings included in the notification from the client device associated with the acting user, the selected settings identifying the first action to be prevented from inclusion in the one or more sponsored story units; storing the one or more selected settings in a user profile associated with the acting user and maintained by the social networking system; and modifying the sponsored story unit for presentation based on the one or more selected settings, the modified sponsored story unit not including a description of the first action. 6. The method of claim 1 , wherein a setting for preventing inclusion of the first action associated with the acting user in one or more sponsored story units further identifies one or more from a group consisting of: an action prevented from inclusion in one or more sponsored story units, a type of action prevented from inclusion in one or more sponsored story units, a user prevented from being presented with a sponsored story unit including the action associated with the acting user, a group of users prevented from being presented with the sponsored story unit including the action associated with the acting user, a type of connection between the acting user and one or more users, and any combination thereof. | 0.500694 |
7,831,580 | 1 | 4 | 1. A computer-implemented process for use in a computer network that includes at least two computers communicatively coupled to each other, the process comprising the steps of: (a) accepting a first user's request; (b) searching a local knowledge object repository comprising local knowledge each of the local knowledge objects being associated with the first user; (c) searching a central knowledge object repository comprising contributed knowledge objects; (d) returning to the first user a list of links for all matching local and contributed knowledge objects, said matching local and contributed knowledge objects being marked either local or published or listed; (e) allowing access to said matching local and contributed knowledge objects if the first user chooses a knowledge object marked local or published; (f) forwarding the first user's request to a second user and prompting the second user for authorization of access if the first user chooses a knowledge object marked listed from the list, the second user having control of access to the knowledge object marked listed object; (g) returning to the first user the chosen knowledge object marked listed if the second user allows access; (h) notifying the first user that the request is not completed if the second user declines access to the listed knowledge object. | 1. A computer-implemented process for use in a computer network that includes at least two computers communicatively coupled to each other, the process comprising the steps of: (a) accepting a first user's request; (b) searching a local knowledge object repository comprising local knowledge each of the local knowledge objects being associated with the first user; (c) searching a central knowledge object repository comprising contributed knowledge objects; (d) returning to the first user a list of links for all matching local and contributed knowledge objects, said matching local and contributed knowledge objects being marked either local or published or listed; (e) allowing access to said matching local and contributed knowledge objects if the first user chooses a knowledge object marked local or published; (f) forwarding the first user's request to a second user and prompting the second user for authorization of access if the first user chooses a knowledge object marked listed from the list, the second user having control of access to the knowledge object marked listed object; (g) returning to the first user the chosen knowledge object marked listed if the second user allows access; (h) notifying the first user that the request is not completed if the second user declines access to the listed knowledge object. 4. The process of claim 1 , wherein the step (e) further comprises the step of: prompting the first user to enter a correct user identification. | 0.778462 |
7,765,209 | 9 | 29 | 9. A computer-implemented device comprising: a memory storing computer readable instructions; and one or more processors to execute the computer-readable instructions to implement: logic to extract first information from a post to a blog; logic to extract different second information from at least one of an update feed or the blog, where the second information includes information that is not included in any post to the blog; logic to create a hybrid document using the first information and the second information; logic to store the hybrid document in a searchable index; and logic to use the searchable index to determine a relevance of the post to a search query. | 9. A computer-implemented device comprising: a memory storing computer readable instructions; and one or more processors to execute the computer-readable instructions to implement: logic to extract first information from a post to a blog; logic to extract different second information from at least one of an update feed or the blog, where the second information includes information that is not included in any post to the blog; logic to create a hybrid document using the first information and the second information; logic to store the hybrid document in a searchable index; and logic to use the searchable index to determine a relevance of the post to a search query. 29. The computer-implemented device of claim 9 , where the one or more processors are further to execute the computer-readable instructions to implement: logic to extract information from a document to which the blog links, and where the logic to create a hybrid document includes: logic to create the hybrid document using the information extracted from the at least one of the update feed or the blog, the information extracted from the post, and the information extracted from the document to which the blog links. | 0.587061 |
9,455,891 | 11 | 12 | 11. A tangible computer readable storage medium, comprising computer readable instructions which, when executed, cause a processor to at least: access interaction data and contact data for a user of a first social networking site via an interface provided by the first social networking site; determine a connectedness for the user based on the contact data; determine an interactivity for the user based on the interaction data; determine a network constancy for the user by determining a ratio of (a) connections between contacts of the user of the first social networking site to (b) at least one of: (1) broken connections between the contacts of the user in response to removal of the user from the first social networking site; or (2) connections between the contacts of the user that exhibit changed degrees of connection in response to removal of the user from the first social networking site; determine a first network efficacy of the first social networking site based on the connectedness, the interactivity, and the network constancy, the network constancy being based on the ratio; and transmit the first network efficacy to an advertising server to facilitate delivery of an advertisement to the user of the first social networking site. | 11. A tangible computer readable storage medium, comprising computer readable instructions which, when executed, cause a processor to at least: access interaction data and contact data for a user of a first social networking site via an interface provided by the first social networking site; determine a connectedness for the user based on the contact data; determine an interactivity for the user based on the interaction data; determine a network constancy for the user by determining a ratio of (a) connections between contacts of the user of the first social networking site to (b) at least one of: (1) broken connections between the contacts of the user in response to removal of the user from the first social networking site; or (2) connections between the contacts of the user that exhibit changed degrees of connection in response to removal of the user from the first social networking site; determine a first network efficacy of the first social networking site based on the connectedness, the interactivity, and the network constancy, the network constancy being based on the ratio; and transmit the first network efficacy to an advertising server to facilitate delivery of an advertisement to the user of the first social networking site. 12. The storage medium as defined in claim 11 , wherein the instructions are to cause the processor to determine the network constancy by determining a number of connections between users in the social networking site that are based on the presence of the user in the first social networking site. | 0.848315 |
9,171,092 | 10 | 12 | 10. A computing device comprising an automated personal assistant, the computing device comprising: a processor; a memory; and an automated personal assistant stored in the memory and executable by the processor, wherein the automated personal assistant is configured to: detect a computing device network Application Programming Interface (API) communication including one or more of an API call or an API response; obtain parsed personal assistant data comprising data extracted from the network API communication; convert at least a portion of the parsed personal assistant data from the network API communication to produce converted data, wherein conversion comprises: identifying a network API corresponding to the network API communication; identifying service translation information for the identified network API, wherein the service translation information comprises terms used in connection with the identified network API, and corresponding translation outputs; and converting at least a portion of the parsed personal assistant data into the converted data using the identified service translation information for the identified network API; store at least a portion of the converted data in a personal assistant context database; adjust relative weights of relationships among the converted data stored in the personal assistant context database, wherein the adjusting comprises strengthening weights of relationships among the converted data relative to weights of relationships among other data stored in the personal assistant context database; receive an automated personal assistant user input; determine, using the received automated personal assistant user input and the personal assistant context database, one or more strong weighted relationships between the received automated personal assistant user input and data stored in the personal assistant context database; and configure an automated personal assistant user interaction operation using data stored in the personal assistant context database having the one or more strong weighted relationships with the received automated personal assistant user input. | 10. A computing device comprising an automated personal assistant, the computing device comprising: a processor; a memory; and an automated personal assistant stored in the memory and executable by the processor, wherein the automated personal assistant is configured to: detect a computing device network Application Programming Interface (API) communication including one or more of an API call or an API response; obtain parsed personal assistant data comprising data extracted from the network API communication; convert at least a portion of the parsed personal assistant data from the network API communication to produce converted data, wherein conversion comprises: identifying a network API corresponding to the network API communication; identifying service translation information for the identified network API, wherein the service translation information comprises terms used in connection with the identified network API, and corresponding translation outputs; and converting at least a portion of the parsed personal assistant data into the converted data using the identified service translation information for the identified network API; store at least a portion of the converted data in a personal assistant context database; adjust relative weights of relationships among the converted data stored in the personal assistant context database, wherein the adjusting comprises strengthening weights of relationships among the converted data relative to weights of relationships among other data stored in the personal assistant context database; receive an automated personal assistant user input; determine, using the received automated personal assistant user input and the personal assistant context database, one or more strong weighted relationships between the received automated personal assistant user input and data stored in the personal assistant context database; and configure an automated personal assistant user interaction operation using data stored in the personal assistant context database having the one or more strong weighted relationships with the received automated personal assistant user input. 12. The computing device of claim 10 , wherein obtaining the parsed personal assistant data comprises forwarding by the computing device a copy of the network API communication to a remote parsing service, and receiving the parsed personal assistant data by the computing device from the remote parsing service. | 0.675365 |
8,239,562 | 6 | 7 | 6. The method of claim 3 , wherein the restrictions on the use of the at least one context entry include at least one restriction based on time. | 6. The method of claim 3 , wherein the restrictions on the use of the at least one context entry include at least one restriction based on time. 7. The method of claim 6 , wherein the at least one restriction defines an expiration of the context entry. | 0.965945 |
8,625,451 | 1 | 9 | 1. A method for non-intrusive mean opinion score estimation based on packet loss pattern, the method comprising: receiving a packet data stream; measuring the packet loss for the received data stream; calculating a probability of packet loss based on the measured packet loss; and calculating an estimated mean opinion score based on the calculated probability of packet loss using a function that maps probabilities of packet loss to measured mean opinion scores, wherein the function was derived by generating a plurality of probabilities of packet loss, and, for each generated probability of packet loss: generating, from a reference data stream, a degraded data stream suffering packet loss according to the generated probability, measuring a mean opinion score for the degraded data stream using an intrusive algorithm that operates on the contents of the data packets of the degraded data stream, and determining an association between the generated probability of packet loss and the calculated mean opinion score. | 1. A method for non-intrusive mean opinion score estimation based on packet loss pattern, the method comprising: receiving a packet data stream; measuring the packet loss for the received data stream; calculating a probability of packet loss based on the measured packet loss; and calculating an estimated mean opinion score based on the calculated probability of packet loss using a function that maps probabilities of packet loss to measured mean opinion scores, wherein the function was derived by generating a plurality of probabilities of packet loss, and, for each generated probability of packet loss: generating, from a reference data stream, a degraded data stream suffering packet loss according to the generated probability, measuring a mean opinion score for the degraded data stream using an intrusive algorithm that operates on the contents of the data packets of the degraded data stream, and determining an association between the generated probability of packet loss and the calculated mean opinion score. 9. The method of claim 1 wherein measuring the packet loss includes detecting the absence of a packet by detection of a missing packet sequence number. | 0.797587 |
9,798,767 | 1 | 6 | 1. An automated method in a computing system for facilitating a search of intellectual property information from a corpus of patent related publications by automatically performing citation analysis upon each iteration of the search, the citation analysis comprising citations from a respective face of each patent publication, which lists backward references as well as forward references to patents and/or patent publications, comprising: receiving an indication of source text and/or patent related publications as source input; automatically analyzing the indicated source input using semantic analysis of the indicated source input to automatically determine a first set of search-based keywords that are present in the indicated source text, wherein the automatically analyzing the source input to determine the first set of search-based keywords using semantic analysis parses the source in to determine grammatical usage to automatically determine the first set of search-based key words; from the automatically determined first set of search-based keywords, performing an initial search iteration automatically, and wherein the initial search iteration is performed without additional user input, by performing the steps of: automatically determining an initial set of patent related publications that include the automatically determined first set of keywords; automatically determining a correlated set of patent related publications that are correlated to the initial set of patent related publications using automatic citation analysis of the initial set of patent related publications, wherein the correlated set is determined to be some number of patent related publications from the corpus that have unique citation relationships to any one of the patent related publications of the initial set, and wherein the correlated set is automatically sorted based upon the correlated patent related publications that involve the most number of citation paths with the initial set of patent related publications; and automatically extracting from the automatically determined initial set of patent related publications a set of related keywords not found in the first set of keywords or in the source input; and providing indicators to the automatically determined initial set and the sorted determined correlated set of patent related publications and the set of related keywords as output from the initial search iteration. | 1. An automated method in a computing system for facilitating a search of intellectual property information from a corpus of patent related publications by automatically performing citation analysis upon each iteration of the search, the citation analysis comprising citations from a respective face of each patent publication, which lists backward references as well as forward references to patents and/or patent publications, comprising: receiving an indication of source text and/or patent related publications as source input; automatically analyzing the indicated source input using semantic analysis of the indicated source input to automatically determine a first set of search-based keywords that are present in the indicated source text, wherein the automatically analyzing the source input to determine the first set of search-based keywords using semantic analysis parses the source in to determine grammatical usage to automatically determine the first set of search-based key words; from the automatically determined first set of search-based keywords, performing an initial search iteration automatically, and wherein the initial search iteration is performed without additional user input, by performing the steps of: automatically determining an initial set of patent related publications that include the automatically determined first set of keywords; automatically determining a correlated set of patent related publications that are correlated to the initial set of patent related publications using automatic citation analysis of the initial set of patent related publications, wherein the correlated set is determined to be some number of patent related publications from the corpus that have unique citation relationships to any one of the patent related publications of the initial set, and wherein the correlated set is automatically sorted based upon the correlated patent related publications that involve the most number of citation paths with the initial set of patent related publications; and automatically extracting from the automatically determined initial set of patent related publications a set of related keywords not found in the first set of keywords or in the source input; and providing indicators to the automatically determined initial set and the sorted determined correlated set of patent related publications and the set of related keywords as output from the initial search iteration. 6. The method of claim 1 wherein the automatic citation analysis is performed considering direct citation references and only one level of indirect citation references. | 0.948967 |
8,583,635 | 22 | 23 | 22. The system of claim 16 , where the processor is further to: receive a search query that includes a form of the first word, and increase, in an ordered list of documents associated with the search query, a ranking of a document associated with the particular category, and where the ordered list of documents includes search results. | 22. The system of claim 16 , where the processor is further to: receive a search query that includes a form of the first word, and increase, in an ordered list of documents associated with the search query, a ranking of a document associated with the particular category, and where the ordered list of documents includes search results. 23. The system of claim 22 , where the processor, when increasing the ranking of the document, is further to: organize the search results, associated with the search query, based on increasing the ranking of the document associated with the particular category. | 0.930879 |
8,005,832 | 1 | 7 | 1. A method for using a target search document, the method comprising: determining an indication for activating the target search document; determining one or more partial search results for the target search document as a user is performing a search by accessing a plurality of resources, the one or more partial search results being determined over multiple interactions being performed in a first search by a user; storing the one or more partial search results in the target search document; providing an interface to the target search document to the user, allowing the user to interact with and modify the one or more partial search results; using the target search document including the one or more partial search results for providing a recommendation for the first search; and providing, using a computing device, the recommendation for the first search to the user using the one or more partial search results, wherein the recommendation includes a reference to a resource determined from a subset of prior search documents that are dynamically determined from a plurality of prior search documents created, modified, and submitted by other users, wherein the subset of prior search documents are dynamically determined by: ranking the plurality of prior search documents based on a first relevance calculation, wherein the first relevance calculation compares the plurality of prior search documents to the target search document to determine the ranking, and selecting the subset of prior search documents, the subset including a number of prior search documents considered to be most relevant to the target search document in the ranking of plurality of prior search documents, wherein the recommendation of the reference to the resource is dynamically provided for the first search from one or more partial search results found in the subset of prior search documents by: ranking, a plurality of resources contained in the one or more partial search results found in the subset of prior search documents based on a second relevance calculation, the second relevance calculation based on a calculated importance of a resource in comparison to calculated importance of other resources in the plurality of resources, and determining the resource in the ranked plurality of resources, the resource being considered to be a highest ranked resource in the plurality of resources. | 1. A method for using a target search document, the method comprising: determining an indication for activating the target search document; determining one or more partial search results for the target search document as a user is performing a search by accessing a plurality of resources, the one or more partial search results being determined over multiple interactions being performed in a first search by a user; storing the one or more partial search results in the target search document; providing an interface to the target search document to the user, allowing the user to interact with and modify the one or more partial search results; using the target search document including the one or more partial search results for providing a recommendation for the first search; and providing, using a computing device, the recommendation for the first search to the user using the one or more partial search results, wherein the recommendation includes a reference to a resource determined from a subset of prior search documents that are dynamically determined from a plurality of prior search documents created, modified, and submitted by other users, wherein the subset of prior search documents are dynamically determined by: ranking the plurality of prior search documents based on a first relevance calculation, wherein the first relevance calculation compares the plurality of prior search documents to the target search document to determine the ranking, and selecting the subset of prior search documents, the subset including a number of prior search documents considered to be most relevant to the target search document in the ranking of plurality of prior search documents, wherein the recommendation of the reference to the resource is dynamically provided for the first search from one or more partial search results found in the subset of prior search documents by: ranking, a plurality of resources contained in the one or more partial search results found in the subset of prior search documents based on a second relevance calculation, the second relevance calculation based on a calculated importance of a resource in comparison to calculated importance of other resources in the plurality of resources, and determining the resource in the ranked plurality of resources, the resource being considered to be a highest ranked resource in the plurality of resources. 7. The method of claim 1 , wherein providing the recommendation comprises using information determined from user interaction with, or modification of, one or more partial search results in the subset of prior search documents to determine the recommendation. | 0.718954 |
7,912,650 | 1 | 8 | 1. A computer implemented method for processing information on a nucleotide sequence comprising the steps of: (a) receiving, via a communication network, request information of an object or service, wherein the object or service is provided for an individual based on one or more genetic differences between individuals, and wherein the request information does not include genetic information; (b) searching a first memory area for positional information, and wherein the positional information corresponds to information on classification of the object or service, and wherein the positional information represents a position in a nucleotide sequence, and retrieving the positional information, and wherein the first memory area is permitted to be accessed by a first processor; (c) transmitting, via the communication network, the positional information retrieved in step (b) above to a second processor which is permitted to access a second memory area storing polymorphism information regarding the individual; (d) receiving, via the communication network, polymorphism information based on the positional information transmitted in step (c) above; (e) searching a third memory area for semantic information or information corresponding to the semantic information based on the polymorphism information received in step (d) above, and retrieving said semantic information or information corresponding to the semantic information, and wherein the third memory area is permitted to be accessed by the first processor; and (f) outputting the semantic information or information corresponding to the semantic information retrieved in step (e) above to a user; and wherein steps (a)-(f) are conducted under the control of the first processor. | 1. A computer implemented method for processing information on a nucleotide sequence comprising the steps of: (a) receiving, via a communication network, request information of an object or service, wherein the object or service is provided for an individual based on one or more genetic differences between individuals, and wherein the request information does not include genetic information; (b) searching a first memory area for positional information, and wherein the positional information corresponds to information on classification of the object or service, and wherein the positional information represents a position in a nucleotide sequence, and retrieving the positional information, and wherein the first memory area is permitted to be accessed by a first processor; (c) transmitting, via the communication network, the positional information retrieved in step (b) above to a second processor which is permitted to access a second memory area storing polymorphism information regarding the individual; (d) receiving, via the communication network, polymorphism information based on the positional information transmitted in step (c) above; (e) searching a third memory area for semantic information or information corresponding to the semantic information based on the polymorphism information received in step (d) above, and retrieving said semantic information or information corresponding to the semantic information, and wherein the third memory area is permitted to be accessed by the first processor; and (f) outputting the semantic information or information corresponding to the semantic information retrieved in step (e) above to a user; and wherein steps (a)-(f) are conducted under the control of the first processor. 8. The method for processing information on a nucleotide sequence according to claim 1 , wherein in step (e) above, additional information is retrieved from a memory or is received via a communication network, and wherein in step (f) above, the semantic information or the information corresponding to the semantic information retrieved in step (e) above is outputted along with the additional information. | 0.722678 |
5,400,434 | 34 | 35 | 34. The improvement of claim 29 wherein said memory means stores the address of one other glottal pulse along with each glottal pulse stored, effectively providing a list of glottal pulses, whereby the stored glottal pulses and the list of glottal pulses are examined to determine which one best meets the requirement. | 34. The improvement of claim 29 wherein said memory means stores the address of one other glottal pulse along with each glottal pulse stored, effectively providing a list of glottal pulses, whereby the stored glottal pulses and the list of glottal pulses are examined to determine which one best meets the requirement. 35. The improvement of claim 34 wherein said utilizing means further comprises: means for cross-fading between a selected ending glottal pulse and a selected beginning glottal pulse to be concatenated together, according to the relation: EQU S.P.=A X.sub.n +B Y.sub.n wherein A and B are fractions that always total 1, X.sub.n is a point on the ending glottal pulse, Y.sub.n is a point on the beginning glottal pulse, and S.P. is the resulting sample point which is a combination of the starting and beginning glottal pulses. | 0.63132 |
10,127,583 | 1 | 7 | 1. A system comprising: one or more hardware processors, configured to: receive, from a network, a feedback request requested via a user interface and for a feedback page, the feedback request identifying a particular product; extract phrases from a plurality of textual feedback entries that are about the particular product identified in the feedback request, the extracted phrases comprising a first phrase and a second phrase; determine a score for each of the extracted phrases based, at least in part, on a frequency of the extracted phrases in the textual feedback entries; determine a first gradation for a first visual indication in the feedback page that corresponds to the first phrase based on the score for the first phrase; determine a second gradation for a second visual indication in the feedback page that corresponds to the second phrase based on the score for the second phrase; generate the feedback page as a response to the feedback request, the feedback page including text data corresponding to at least the first and second phrases and generated, in part, by applying the first gradation to the first visual indication corresponding to the first phrase at a first position in the feedback request and applying the second gradation to the second visual indication corresponding to the second phrase at a second position in the feedback page; and transmit the feedback page over the network to a client device associated with the feedback request. | 1. A system comprising: one or more hardware processors, configured to: receive, from a network, a feedback request requested via a user interface and for a feedback page, the feedback request identifying a particular product; extract phrases from a plurality of textual feedback entries that are about the particular product identified in the feedback request, the extracted phrases comprising a first phrase and a second phrase; determine a score for each of the extracted phrases based, at least in part, on a frequency of the extracted phrases in the textual feedback entries; determine a first gradation for a first visual indication in the feedback page that corresponds to the first phrase based on the score for the first phrase; determine a second gradation for a second visual indication in the feedback page that corresponds to the second phrase based on the score for the second phrase; generate the feedback page as a response to the feedback request, the feedback page including text data corresponding to at least the first and second phrases and generated, in part, by applying the first gradation to the first visual indication corresponding to the first phrase at a first position in the feedback request and applying the second gradation to the second visual indication corresponding to the second phrase at a second position in the feedback page; and transmit the feedback page over the network to a client device associated with the feedback request. 7. The system of claim 1 , wherein the one or more hardware processors are further configured to determine a count for each of the extracted phrases in the plurality of textual feedback entries, wherein the score for each of the extracted phrases is determined based, in part, on a respective count of the extracted phrase and a number of the textual feedback entries. | 0.659259 |
8,266,602 | 1 | 5 | 1. A method, comprising: receiving first information describing characteristics of one or more parameters of a field device, the field device operable to operate in a process control system, the characteristics described in the first information using a first device description language, the first information associated with a first communication protocol, the first information comprising a first device description language source file; converting the first information into second information describing the characteristics of the one or more parameters of the field device, the characteristics described in the second information using a second device description language, the second information associated with a second communication protocol; and providing the second information to facilitate interaction with the field device; wherein converting the first information into the second information comprises: parsing the first device description language source file into individual first components; mapping each first component from the first device description language source file to a corresponding second component of a target file that is compliant with the second device description language; and generating the target file using the component mappings by (i) taking each first component, (ii) extracting data from that first component, and (iii) generating the corresponding second component using the extracted data, wherein each second component is compliant with the second device description language. | 1. A method, comprising: receiving first information describing characteristics of one or more parameters of a field device, the field device operable to operate in a process control system, the characteristics described in the first information using a first device description language, the first information associated with a first communication protocol, the first information comprising a first device description language source file; converting the first information into second information describing the characteristics of the one or more parameters of the field device, the characteristics described in the second information using a second device description language, the second information associated with a second communication protocol; and providing the second information to facilitate interaction with the field device; wherein converting the first information into the second information comprises: parsing the first device description language source file into individual first components; mapping each first component from the first device description language source file to a corresponding second component of a target file that is compliant with the second device description language; and generating the target file using the component mappings by (i) taking each first component, (ii) extracting data from that first component, and (iii) generating the corresponding second component using the extracted data, wherein each second component is compliant with the second device description language. 5. The method of claim 1 , wherein: the first information comprises a first device description language binary file; and converting the first information into the second information comprises converting the first device description language binary file into a second device description language binary file. | 0.764571 |
8,010,340 | 22 | 23 | 22. A computer program product, comprising a computer readable storage device having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by a processor of a data processing system to implement a method for providing national language support for an application, said method comprising: generating a multi-language property file by processing each individual property file of a plurality of individual property files, wherein each individual property file comprises a file name and further comprises file content comprising a key value and a translated text, wherein the key value is a member of a class, wherein said processing each individual property file comprises generating a translation and recording the generated translation in the multi-language property file, wherein the generated translation comprises the translated text and a key comprising a keyword appended to the key value, and wherein the translated text of each said translation is formatted in a character set that is displayable in a natural font of a language represented by the translated text; and storing the generated multi-language property file in a memory of the data processing system. | 22. A computer program product, comprising a computer readable storage device having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by a processor of a data processing system to implement a method for providing national language support for an application, said method comprising: generating a multi-language property file by processing each individual property file of a plurality of individual property files, wherein each individual property file comprises a file name and further comprises file content comprising a key value and a translated text, wherein the key value is a member of a class, wherein said processing each individual property file comprises generating a translation and recording the generated translation in the multi-language property file, wherein the generated translation comprises the translated text and a key comprising a keyword appended to the key value, and wherein the translated text of each said translation is formatted in a character set that is displayable in a natural font of a language represented by the translated text; and storing the generated multi-language property file in a memory of the data processing system. 23. The computer program product of claim 22 , wherein the translated text of each said translation is formatted in a character set that is displayable in a natural font of a language represented by the translated text. | 0.903354 |
9,965,502 | 8 | 11 | 8. A method for an apparatus which manages a plurality of objects, each object including content data and metadata, the method comprising: generating an index for the objects using a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; and searching, upon receipt of a search request including the first name and a first value, the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding at least one match, returning an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. | 8. A method for an apparatus which manages a plurality of objects, each object including content data and metadata, the method comprising: generating an index for the objects using a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; and searching, upon receipt of a search request including the first name and a first value, the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding at least one match, returning an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. 11. A method according to claim 8 , wherein the first content property further includes a first data type which defines a data type allowed in the first field identified by the first expression information. | 0.767494 |
7,873,499 | 1 | 11 | 1. A computer program product on a computer readable storage medium comprising computer code for i) encoding two or more biological molecules into initial character strings to provide a collection of two or more different initial character strings wherein each of said biological molecules comprises at least about ten subunits; ii) selecting at least two substrings from said initial character strings; iii) concatenating said at least two substrings to form one or more product strings about the same length as one or more of the initial character strings; iv) determining sequence identities of at least one of the product strings relative to at least one initial character string; and v) selecting one or more product biological molecules for production, wherein the one or more product biological molecules correspond to one or more of the product strings. | 1. A computer program product on a computer readable storage medium comprising computer code for i) encoding two or more biological molecules into initial character strings to provide a collection of two or more different initial character strings wherein each of said biological molecules comprises at least about ten subunits; ii) selecting at least two substrings from said initial character strings; iii) concatenating said at least two substrings to form one or more product strings about the same length as one or more of the initial character strings; iv) determining sequence identities of at least one of the product strings relative to at least one initial character string; and v) selecting one or more product biological molecules for production, wherein the one or more product biological molecules correspond to one or more of the product strings. 11. The computer program product of claim 1 , wherein the initial character strings of (i) are related in that they encode the same gene or protein family but differ in sequence. | 0.823413 |
8,775,328 | 20 | 23 | 20. A system of a global neighborhood environment comprising: a computer server of the global neighborhood environment: the computer server including one or more computers having non-transitory instructions stored thereon that when executed cause the one or more computers: to verify that a user lives at a residence associated with a geographic location claimed by the user of the global neighborhood environment using a processor and a memory, to create a social network page of the user once verified, to enable the user to constrain a communication to neighboring users within a geospatial vicinity of the residence of the user, to provide an additional privilege as a lead user in the online community of the global neighborhood environment based on at least one of a participation level of the user in the online community and an activity level of the user associated with encouraging neighbors to participate in the online community, and to automatically determine a set of access privileges in the online community associated with each user of the online community by constraining access in private web sites of the online community to neighboring users based on each residence associated with each geographic location claimed by each user of the global neighborhood environment, wherein the one or more computers to permit the user of the global neighborhood environment to mark certain information communicated directly to a particular neighboring user as private, such that privately shared information is shared only with the particular neighboring user and is designated as non-public to other neighboring users of the online community. | 20. A system of a global neighborhood environment comprising: a computer server of the global neighborhood environment: the computer server including one or more computers having non-transitory instructions stored thereon that when executed cause the one or more computers: to verify that a user lives at a residence associated with a geographic location claimed by the user of the global neighborhood environment using a processor and a memory, to create a social network page of the user once verified, to enable the user to constrain a communication to neighboring users within a geospatial vicinity of the residence of the user, to provide an additional privilege as a lead user in the online community of the global neighborhood environment based on at least one of a participation level of the user in the online community and an activity level of the user associated with encouraging neighbors to participate in the online community, and to automatically determine a set of access privileges in the online community associated with each user of the online community by constraining access in private web sites of the online community to neighboring users based on each residence associated with each geographic location claimed by each user of the global neighborhood environment, wherein the one or more computers to permit the user of the global neighborhood environment to mark certain information communicated directly to a particular neighboring user as private, such that privately shared information is shared only with the particular neighboring user and is designated as non-public to other neighboring users of the online community. 23. The system of the global neighborhood environment of claim 20 : wherein the global neighborhood environment formed through the computer server is named nextdoor. | 0.919669 |
8,718,610 | 3 | 5 | 3. The communication terminal of claim 2 , wherein: the controller is further configured to regulate pitch of the played alert tune segments in response to matching text from the message to the different entries in the stored list of words and/or phrases. | 3. The communication terminal of claim 2 , wherein: the controller is further configured to regulate pitch of the played alert tune segments in response to matching text from the message to the different entries in the stored list of words and/or phrases. 5. The communication terminal of claim 3 , wherein: the controller is further configured to increase pitch of the played alert tune segments in response to matching text from the message to one or more of the stored words and/or phrases that are known to indicate that an urgent situation is being conveyed in the message text. | 0.844877 |
9,785,617 | 17 | 21 | 17. A method for defining a template document for use by a user to create a document by adding content to the template document, the method comprising: defining a set of default pages of the template document, each page for populating the template document with content; and defining placeholder content that initially populates each page, the placeholder content replaceable by user-generated content; and defining at least one field of a particular page of the template document, each field of the at least one field initially comprising placeholder content that is replaceable by user-generated content, wherein: in response to a selection of content of a respective field of the at least one field comprising a click operation on the content within the respective field of the template document: determining whether the content comprises the placeholder content or the user-generated content; when the content comprises the placeholder content: automatically selecting the entirety of the placeholder content of the respective field; and when the content comprises the user-generated content: automatically selecting only a portion of the user-generated content. | 17. A method for defining a template document for use by a user to create a document by adding content to the template document, the method comprising: defining a set of default pages of the template document, each page for populating the template document with content; and defining placeholder content that initially populates each page, the placeholder content replaceable by user-generated content; and defining at least one field of a particular page of the template document, each field of the at least one field initially comprising placeholder content that is replaceable by user-generated content, wherein: in response to a selection of content of a respective field of the at least one field comprising a click operation on the content within the respective field of the template document: determining whether the content comprises the placeholder content or the user-generated content; when the content comprises the placeholder content: automatically selecting the entirety of the placeholder content of the respective field; and when the content comprises the user-generated content: automatically selecting only a portion of the user-generated content. 21. The method of claim 17 , wherein the entirety of the placeholder content is highlighted when the entirety of the placeholder content is automatically selected. | 0.906429 |
9,158,794 | 1 | 2 | 1. A method comprising: creating an association between each of a plurality of media objects and temporal, spatial, social network and topical data including deriving relationships between specific media objects and metadata sources associated with a specific media object, user profile data, social network data and interaction data; receiving a request from a requesting device associated with a user for media matching each criteria of multiple criteria included in a combined context, the combined context defined by social criteria, location criteria, topical criteria, and temporal criteria included in the request, the social criteria describing one or more people or types of people associated with the requested media, the location criteria describing a location or type of location associated with the requested media, the topical criteria describing one or more topics associated with the requested media, and the temporal criteria describing a past time period associated with the requested media; locating a user profile associated with the user including one or more designations of favorite media of the user; determining media associated with the one or more people or types of people defined by the social criteria based on the association; identifying a location associated with the request and determining media associated with the location based on the association; identifying topics associated with the request and determining media associated with the identified topics based on the association; identifying a time associated with the request and determining media associated with the identified time based on the association; locating a plurality of media files that each match each criteria included in the combined context based on the located user profile, determined media associated with the one or more people or types of people, media associated with the location, media associated with the identified topics, and media associated with the identified time; assembling, via the network, a playlist containing a reference to the plurality of media files; and transmitting the plurality of media files on the playlist over the network to the requesting device. | 1. A method comprising: creating an association between each of a plurality of media objects and temporal, spatial, social network and topical data including deriving relationships between specific media objects and metadata sources associated with a specific media object, user profile data, social network data and interaction data; receiving a request from a requesting device associated with a user for media matching each criteria of multiple criteria included in a combined context, the combined context defined by social criteria, location criteria, topical criteria, and temporal criteria included in the request, the social criteria describing one or more people or types of people associated with the requested media, the location criteria describing a location or type of location associated with the requested media, the topical criteria describing one or more topics associated with the requested media, and the temporal criteria describing a past time period associated with the requested media; locating a user profile associated with the user including one or more designations of favorite media of the user; determining media associated with the one or more people or types of people defined by the social criteria based on the association; identifying a location associated with the request and determining media associated with the location based on the association; identifying topics associated with the request and determining media associated with the identified topics based on the association; identifying a time associated with the request and determining media associated with the identified time based on the association; locating a plurality of media files that each match each criteria included in the combined context based on the located user profile, determined media associated with the one or more people or types of people, media associated with the location, media associated with the identified topics, and media associated with the identified time; assembling, via the network, a playlist containing a reference to the plurality of media files; and transmitting the plurality of media files on the playlist over the network to the requesting device. 2. The method of claim 1 wherein the social criteria comprise criteria that match a plurality of users within a social network, and the preferences of the plurality of users are used when determining media associated with the one or more people or types of people defined by the social criteria. | 0.907524 |
9,965,704 | 16 | 18 | 16. A non-transitory machine-readable medium having instructions embodied thereon, the instructions executable by one or more processors of a system to perform operations comprising: accessing a set of images uploaded to a network-based system by a plurality of users of a network-based service provided by the network-based system, each image of the set of images having a text description of the corresponding image as provided by a user of the plurality of users who uploaded the corresponding image; generating a set of associated weak labels for each image of the set of images based on the corresponding text description of the respective image, each set of associated weak labels including one or more weak labels for the respective image that are derived from the corresponding text description of the respective image; generating a weakly-labeled dataset comprising the set of images; clustering images of the set of images based on each of the clustered images sharing a particular label of the weak labels; accessing a set of examples selected from the set of images uploaded to the network-based system, each example of the set of examples being selected based on the respective example not being associated with the particular label associated with the clustered images; training a recognition engine using the clustered images as positive examples and the set of examples as negative examples; and generating strong labels for the clustered images using the trained recognition engine, the strong labels including the particular label based on a ranking of the particular label with respect to the cluster as provided by the trained recognition engine. | 16. A non-transitory machine-readable medium having instructions embodied thereon, the instructions executable by one or more processors of a system to perform operations comprising: accessing a set of images uploaded to a network-based system by a plurality of users of a network-based service provided by the network-based system, each image of the set of images having a text description of the corresponding image as provided by a user of the plurality of users who uploaded the corresponding image; generating a set of associated weak labels for each image of the set of images based on the corresponding text description of the respective image, each set of associated weak labels including one or more weak labels for the respective image that are derived from the corresponding text description of the respective image; generating a weakly-labeled dataset comprising the set of images; clustering images of the set of images based on each of the clustered images sharing a particular label of the weak labels; accessing a set of examples selected from the set of images uploaded to the network-based system, each example of the set of examples being selected based on the respective example not being associated with the particular label associated with the clustered images; training a recognition engine using the clustered images as positive examples and the set of examples as negative examples; and generating strong labels for the clustered images using the trained recognition engine, the strong labels including the particular label based on a ranking of the particular label with respect to the cluster as provided by the trained recognition engine. 18. The non-transitory machine-readable medium of claim 16 , wherein the operations further comprise: using the recognition engine to determine weak instances in the set of examples; in accordance with a determination that a weak instance is in the set of examples: modifying the set of examples by: removing the weak instance from the set of examples; and adding to the set of examples a replacement image selected from the set of images, the replacement image not being associated with the label associated with the clustered images; and training the recognition engine using the clustered images as positive examples and the modified set of examples as negative examples. | 0.500741 |
8,463,715 | 99 | 101 | 99. The computer program product of claim 87 , wherein the instructions further enable the processor to perform the operations of: sending a representation of the resume, the representation including a portion of the resume and the resume summary. | 99. The computer program product of claim 87 , wherein the instructions further enable the processor to perform the operations of: sending a representation of the resume, the representation including a portion of the resume and the resume summary. 101. The computer program product of claim 99 , wherein the sending of the representation of the resume is to a recruitment team that includes at least one recruitment team member. | 0.96368 |
8,661,331 | 12 | 13 | 12. The method of claim 1 , said meeting documents being printed based on meeting document information stored in said computer storage repository. | 12. The method of claim 1 , said meeting documents being printed based on meeting document information stored in said computer storage repository. 13. The method of claim 12 , said providing one or more printed meeting documents further comprising transmitting said meeting document information to said printer. | 0.957949 |
8,010,547 | 2 | 4 | 2. The method of claim 1 , wherein reformulating further comprises generating hyphen and apostrophe candidates algorithmically. | 2. The method of claim 1 , wherein reformulating further comprises generating hyphen and apostrophe candidates algorithmically. 4. The method of claim 2 , wherein the must-split sub-dictionary contains split candidates with a confidence score above a predetermined high threshold, the must-join sub-dictionary contains join candidates with a confidence score above a second predetermined high threshold, and the normal sub-dictionary contains all other split, join, hyphen, and apostrophe candidates. | 0.891923 |
9,336,290 | 5 | 6 | 5. A system comprising: one or more computers including one or more storage devices and one or more processor devices configured to perform operations comprising: receiving a document from a user device; analyzing the document to extract a plurality of values having corresponding attributes associated with attribute-value pairs in one or more domain models, wherein the analysis is based at least in part on associating the document with the one or more domain models generated through analysis of a plurality of documents from one or more corpora and using an ontology associated with the one or more domain models to determine one or more attributes from the document, wherein the ontology includes terms relevant to particular domains corresponding to the one or more domain models, and wherein the attributes from the document are associated with particular terms of the ontology; associating the determined one or more attributes with the document; and using the associated attributes to generate search results responsive to a received search query. | 5. A system comprising: one or more computers including one or more storage devices and one or more processor devices configured to perform operations comprising: receiving a document from a user device; analyzing the document to extract a plurality of values having corresponding attributes associated with attribute-value pairs in one or more domain models, wherein the analysis is based at least in part on associating the document with the one or more domain models generated through analysis of a plurality of documents from one or more corpora and using an ontology associated with the one or more domain models to determine one or more attributes from the document, wherein the ontology includes terms relevant to particular domains corresponding to the one or more domain models, and wherein the attributes from the document are associated with particular terms of the ontology; associating the determined one or more attributes with the document; and using the associated attributes to generate search results responsive to a received search query. 6. The system of claim 5 , wherein the analysis is used to extract one or more values from the document as corresponding to ontology terms and one or more candidate ontology terms associated with respective attributes. | 0.748848 |
9,412,392 | 81 | 93 | 81. A electronic device comprising: one or more input devices; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for: receiving user input; in response to receiving user input, recording at least a portion of a voice command; storing contextual information of the electronic device, the contextual information related to a state of the electronic device at a time the at least a portion of the voice command is recorded; and after recording the at least a portion of the voice command and storing the contextual information, transmitting the at least a portion of the recorded voice command and the stored contextual information from the electronic device to remote computing equipment; and receiving, from the remote computing equipment, data related to processing the voice command. | 81. A electronic device comprising: one or more input devices; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for: receiving user input; in response to receiving user input, recording at least a portion of a voice command; storing contextual information of the electronic device, the contextual information related to a state of the electronic device at a time the at least a portion of the voice command is recorded; and after recording the at least a portion of the voice command and storing the contextual information, transmitting the at least a portion of the recorded voice command and the stored contextual information from the electronic device to remote computing equipment; and receiving, from the remote computing equipment, data related to processing the voice command. 93. The electronic device of claim 81 , wherein the contextual information comprises information associated with a web-browsing operation of an Internet browsing application of the electronic device occurring at the time the at least a portion of the voice command is recorded. | 0.602011 |
8,352,870 | 11 | 12 | 11. A computer readable storage medium storing executable instructions, which perform a method of resolving editing conflicts when executed by a computing device, the editing conflicts existing between a user copy of a data file and a master copy of the data file, the method comprising: presenting a display window to a user of the computing device, the display window including an editing area and a summary area; displaying any content locks and content of the user copy including any identified conflicting content within the editing area of the display window, wherein the user may edit the content of the user copy including the identified conflicting content freely in the editing area, the identified conflicting content being annotated to distinguish the identified conflicting content from non-conflicting content; displaying the identified conflicting content and any identified conflicting content locks within the summary area; displaying a resolution interface including an accept option and a reject option, the accept option comprising an accept control, the reject option comprising a reject control, the resolution interface configured to present the user copy of the data file including displaying content locks and displaying user content annotated to indicate the identified conflicting content, the resolution interface being displayed when the identified conflicting content is selected; enabling the user to select the accept control resulting in accepting the identified conflicting content and the reject control resulting in rejecting the identified conflicting content; and presenting a toggle interface to the user, wherein selection of the toggle interface by the user removes any annotations to the identified conflicting content within the editing area of the display window. | 11. A computer readable storage medium storing executable instructions, which perform a method of resolving editing conflicts when executed by a computing device, the editing conflicts existing between a user copy of a data file and a master copy of the data file, the method comprising: presenting a display window to a user of the computing device, the display window including an editing area and a summary area; displaying any content locks and content of the user copy including any identified conflicting content within the editing area of the display window, wherein the user may edit the content of the user copy including the identified conflicting content freely in the editing area, the identified conflicting content being annotated to distinguish the identified conflicting content from non-conflicting content; displaying the identified conflicting content and any identified conflicting content locks within the summary area; displaying a resolution interface including an accept option and a reject option, the accept option comprising an accept control, the reject option comprising a reject control, the resolution interface configured to present the user copy of the data file including displaying content locks and displaying user content annotated to indicate the identified conflicting content, the resolution interface being displayed when the identified conflicting content is selected; enabling the user to select the accept control resulting in accepting the identified conflicting content and the reject control resulting in rejecting the identified conflicting content; and presenting a toggle interface to the user, wherein selection of the toggle interface by the user removes any annotations to the identified conflicting content within the editing area of the display window. 12. The computer readable storage medium of claim 11 , wherein election of the toggle interface by the user also removes the resolution interface from the display window. | 0.868012 |
7,957,969 | 9 | 16 | 9. A method for generating base forms for non-native language in a speech-based system for processing a native language, the method comprising acts performed by at least one processor, of: receiving input textual data containing both native language and non-native language words; identifying the native language and non-native language words within the textual data; tagging the native language words with a tag indicating that the words belong to the native language and tagging the non-native language words with a tag indicating that the words belong to the non-native language; generating, by the at least one processor, a native phonetic transcription of the native language words using phonetic units of the native language; generating a non-native phonetic transcription of the non-native language words using phonetic units of the non-native language; generating a native pronunciation of the non-native language words using phonetic units of the native language by mapping the phonetic units of the non-native phonetic transcription to acoustically similar phonetic units of the native language; and storing the input textual data with the corresponding native phonetic transcription of the native language words and the mapped native pronunciation of the non-native language words in a native phonetic lexicon. | 9. A method for generating base forms for non-native language in a speech-based system for processing a native language, the method comprising acts performed by at least one processor, of: receiving input textual data containing both native language and non-native language words; identifying the native language and non-native language words within the textual data; tagging the native language words with a tag indicating that the words belong to the native language and tagging the non-native language words with a tag indicating that the words belong to the non-native language; generating, by the at least one processor, a native phonetic transcription of the native language words using phonetic units of the native language; generating a non-native phonetic transcription of the non-native language words using phonetic units of the non-native language; generating a native pronunciation of the non-native language words using phonetic units of the native language by mapping the phonetic units of the non-native phonetic transcription to acoustically similar phonetic units of the native language; and storing the input textual data with the corresponding native phonetic transcription of the native language words and the mapped native pronunciation of the non-native language words in a native phonetic lexicon. 16. The method of claim 9 further comprising an act of receiving at least one spoken utterance from a speaker and refining the native pronunciation of at least one of the non-native language words based, at least in part, on the at least one spoken utterance from the speaker. | 0.538462 |
9,063,971 | 4 | 5 | 4. The method of claim 1 , wherein the computing domain comprises a directory server, an authentication server, and the LDAP repository. | 4. The method of claim 1 , wherein the computing domain comprises a directory server, an authentication server, and the LDAP repository. 5. The method of claim 4 , wherein the configuration file is stored in the LDAP repository. | 0.95495 |
9,699,472 | 22 | 23 | 22. The device of claim 20 , wherein the one or more processors are configured to determine that the PU is restricted to uni-directional inter prediction if a height or a width of a video block associated with the PU is below a threshold. | 22. The device of claim 20 , wherein the one or more processors are configured to determine that the PU is restricted to uni-directional inter prediction if a height or a width of a video block associated with the PU is below a threshold. 23. The device of claims 22 , wherein the threshold is 8. | 0.975367 |
8,832,151 | 1 | 7 | 1. A computer-implemented method, comprising: establishing a relationship between a partner and a hosted server system based on a received request from the partner; receiving a request from a partner administrator to customize a container document to provide to a partner end user, the container document including a first level of content and configurations selected by the partner administrator; receiving an identification of the partner end user with access to the container document from the partner administrator; serving, by operation of a computer, a customized container document to the partner end user; and receiving a request from the partner end user to customize the container document. | 1. A computer-implemented method, comprising: establishing a relationship between a partner and a hosted server system based on a received request from the partner; receiving a request from a partner administrator to customize a container document to provide to a partner end user, the container document including a first level of content and configurations selected by the partner administrator; receiving an identification of the partner end user with access to the container document from the partner administrator; serving, by operation of a computer, a customized container document to the partner end user; and receiving a request from the partner end user to customize the container document. 7. The method of claim 1 , wherein the customized container document served to the partner end user includes a first level of content and configurations. | 0.815217 |
7,664,734 | 30 | 40 | 30. A computer system for generating multiple implicit search queries, comprising: a memory; a processor; a monitoring module stored in the memory and executable by the processor to identify a plurality of events responsive to monitoring real-time user interactions with a client device; a user-context attributes module stored in the memory and executable by the processor to identify a plurality of user-context attributes based at least in part on the plurality of events, wherein the plurality of user-context attributes indicate aspects of real-time user interactions with the client device; a search query module stored in the memory and executable by the processor to generate implicit search queries comprising terms, wherein the terms are based at least in part on the plurality of user-context attributes; a search results module stored in the memory and executable by the processor to receive a plurality of search results generated responsive to the plurality of implicit search queries; and a display module stored in the memory and executable by the processor to update a display of search results responsive to receiving the plurality of search results. | 30. A computer system for generating multiple implicit search queries, comprising: a memory; a processor; a monitoring module stored in the memory and executable by the processor to identify a plurality of events responsive to monitoring real-time user interactions with a client device; a user-context attributes module stored in the memory and executable by the processor to identify a plurality of user-context attributes based at least in part on the plurality of events, wherein the plurality of user-context attributes indicate aspects of real-time user interactions with the client device; a search query module stored in the memory and executable by the processor to generate implicit search queries comprising terms, wherein the terms are based at least in part on the plurality of user-context attributes; a search results module stored in the memory and executable by the processor to receive a plurality of search results generated responsive to the plurality of implicit search queries; and a display module stored in the memory and executable by the processor to update a display of search results responsive to receiving the plurality of search results. 40. The system of claim 30 , wherein the display module for updating the display of search results responsive to receiving the plurality of search results is adapted to rank the search results based at least in part on a history of user interactions with previously-displayed search results. | 0.631646 |
9,553,922 | 21 | 30 | 21. A system for presenting social media content items associated with time-based media events, the system comprising: a computer processor; and a memory storing program code for presenting social media content items associated with time-based media events, the program when executed by the computer processor causing the processor to: generate a graph interface element including a set of positions along a time axis, where each position is associated with a different portion of a broadcasted media event, the graph interface element depicting a measure of a plurality of content items that are authored by one or more users of a social networking system and that have been determined to be correlated with the portions of the broadcasted media event associated with the set of positions; generate a movable interface element that enables selection among the set of positions included in the graph interface element, populate a content timeline interface element with the plurality of content items arranged in chronological order, each portion of the content timeline interface element including content items correlated with a different portion of the broadcasted media event, provide a concurrent display of the content timeline interface element, the graph interface element, and the movable interface element, determine selection of a first of the set of positions based on the movable interface element having been visually moved to select the first position, and in response to the selection of the first position; cause the provided content timeline interface element to vertically scroll to a first portion of the content timeline interface element that includes content items correlated with a first portion of the broadcasted media event associated with the selected first position; extract non-textual content from a plurality of the content items correlated with the first portion of the broadcasted media event; combine the extracted non-textual content to generate a vignette representing the first portion of the broadcasted media event; and include the vignette in a visually distinct portion of the concurrent display. | 21. A system for presenting social media content items associated with time-based media events, the system comprising: a computer processor; and a memory storing program code for presenting social media content items associated with time-based media events, the program when executed by the computer processor causing the processor to: generate a graph interface element including a set of positions along a time axis, where each position is associated with a different portion of a broadcasted media event, the graph interface element depicting a measure of a plurality of content items that are authored by one or more users of a social networking system and that have been determined to be correlated with the portions of the broadcasted media event associated with the set of positions; generate a movable interface element that enables selection among the set of positions included in the graph interface element, populate a content timeline interface element with the plurality of content items arranged in chronological order, each portion of the content timeline interface element including content items correlated with a different portion of the broadcasted media event, provide a concurrent display of the content timeline interface element, the graph interface element, and the movable interface element, determine selection of a first of the set of positions based on the movable interface element having been visually moved to select the first position, and in response to the selection of the first position; cause the provided content timeline interface element to vertically scroll to a first portion of the content timeline interface element that includes content items correlated with a first portion of the broadcasted media event associated with the selected first position; extract non-textual content from a plurality of the content items correlated with the first portion of the broadcasted media event; combine the extracted non-textual content to generate a vignette representing the first portion of the broadcasted media event; and include the vignette in a visually distinct portion of the concurrent display. 30. The system of claim 21 , wherein the program when executed by the computer processor further causes the processor to analyze a set of candidate content items to determine the content items that are correlated with the broadcast media event, the analysis comprises: performing a comparative feature extraction on the candidate content items to generate feature vector representations for the candidate content items; inputting the feature vector representations and information associated with the broadcasted media event into a correlation function to determine a set of confidences that the candidate content items are correlated with the broadcasted media event; and identifying the content items where the confidence exceeds a threshold. | 0.500671 |
9,600,771 | 1 | 5 | 1. A method, comprising: pretreating a textual message that includes a plurality of semantic sentences suitable for use in generating a sequence of binary bits, with each bit of the sequence of binary bits corresponding to a respective one of the semantic sentences; determining that a number of the plurality of semantic sentences in the textual message is of a sufficient number to carry a code, wherein the code includes one or more bits; selecting a subset of the plurality of semantic sentences to carry the code; embedding the code in the selected subset of the plurality of semantic sentences to generate a pattern of binary bits, wherein the pattern of binary bits corresponding to the selected subset of the plurality of semantic sentences matches a pattern of the one or more bits of the code; and tagging the selected subset of the plurality of semantic sentences. | 1. A method, comprising: pretreating a textual message that includes a plurality of semantic sentences suitable for use in generating a sequence of binary bits, with each bit of the sequence of binary bits corresponding to a respective one of the semantic sentences; determining that a number of the plurality of semantic sentences in the textual message is of a sufficient number to carry a code, wherein the code includes one or more bits; selecting a subset of the plurality of semantic sentences to carry the code; embedding the code in the selected subset of the plurality of semantic sentences to generate a pattern of binary bits, wherein the pattern of binary bits corresponding to the selected subset of the plurality of semantic sentences matches a pattern of the one or more bits of the code; and tagging the selected subset of the plurality of semantic sentences. 5. The method of claim 1 , further comprising determining that a semantic richness of the textual message is sufficient to carry the code, by: comparing the code to the sequence of binary bits; and determining that the one or more bits of the code can be represented by a corresponding number of binary bits of the sequence of binary bits. | 0.802678 |
9,454,764 | 1 | 5 | 1. A method, comprising: receiving a sequence of one or more words optically or acoustically captured from a rendered document; identifying an electronic version of the rendered document based on the captured sequence of one or more words; selecting an advertising message by at least: identifying a keyword associated with the electronic version of the rendered document; determining whether the captured sequence of one or more words is located in the electronic version of the rendered document within a threshold number of words of the keyword associated with the electronic version of the rendered document; in response to determining that the captured sequence of one or more words is located in the electronic version of the rendered document within the threshold number of words of the keyword associated with the electronic version of the rendered document, selecting an advertising message related to (i) the captured sequence of one or more words and (ii) the keyword associated with the electronic version of the rendered document; and in response to determining that the captured sequence of one or more words is not located in the electronic version of the rendered document within the threshold number of words of the keyword associated with the electronic version of the rendered document, selecting an advertising message related to the captured sequence of one or more words; and providing the selected advertising message. | 1. A method, comprising: receiving a sequence of one or more words optically or acoustically captured from a rendered document; identifying an electronic version of the rendered document based on the captured sequence of one or more words; selecting an advertising message by at least: identifying a keyword associated with the electronic version of the rendered document; determining whether the captured sequence of one or more words is located in the electronic version of the rendered document within a threshold number of words of the keyword associated with the electronic version of the rendered document; in response to determining that the captured sequence of one or more words is located in the electronic version of the rendered document within the threshold number of words of the keyword associated with the electronic version of the rendered document, selecting an advertising message related to (i) the captured sequence of one or more words and (ii) the keyword associated with the electronic version of the rendered document; and in response to determining that the captured sequence of one or more words is not located in the electronic version of the rendered document within the threshold number of words of the keyword associated with the electronic version of the rendered document, selecting an advertising message related to the captured sequence of one or more words; and providing the selected advertising message. 5. The method of claim 1 , wherein selecting the advertising message comprises selecting the advertising message based on a source of the rendered document. | 0.84585 |
7,797,146 | 1 | 8 | 1. A computer-implemented method of simulating interactive communication between a user and a human subject, comprising: assigning at least one phrase to a stored content sequence, wherein the content sequence comprises a content clip of the subject, the subject being a human recorded on video, the content clip including a contemporaneously-recorded head and mouth of the subject and contemporaneously-recorded audio of the subject, wherein the content clip is free of any superimposed facial features; parsing the at least one phrase to produce at least one phonetic clone; associating the at least one phonetic clone with the stored content sequence; creating a transition between the content clip and the second content sequence by frame-matching a frame of the stored content sequence, the content sequence including the human subject speaking, with a frame of a second content sequence, the frame-matching being performed with respect to the recorded video of the entire head and facial features of the human subject; receiving an utterance from the user; matching the utterance to the at least one phonetic clone; and in response to matching the utterance, displaying the stored content sequence associated with the at least one phonetic clone in succession with the second content sequence. | 1. A computer-implemented method of simulating interactive communication between a user and a human subject, comprising: assigning at least one phrase to a stored content sequence, wherein the content sequence comprises a content clip of the subject, the subject being a human recorded on video, the content clip including a contemporaneously-recorded head and mouth of the subject and contemporaneously-recorded audio of the subject, wherein the content clip is free of any superimposed facial features; parsing the at least one phrase to produce at least one phonetic clone; associating the at least one phonetic clone with the stored content sequence; creating a transition between the content clip and the second content sequence by frame-matching a frame of the stored content sequence, the content sequence including the human subject speaking, with a frame of a second content sequence, the frame-matching being performed with respect to the recorded video of the entire head and facial features of the human subject; receiving an utterance from the user; matching the utterance to the at least one phonetic clone; and in response to matching the utterance, displaying the stored content sequence associated with the at least one phonetic clone in succession with the second content sequence. 8. The method of claim 1 , further comprising: storing a video clip as a content clip; and following display of the content sequence, displaying a neutral image of the subject. | 0.914646 |
9,026,545 | 17 | 21 | 17. A system comprising: at least one processor; and a computer-readable hardware storage device storing instructions that are executable by the at least one processor to perform operations comprising: detecting information specifying a domain name for one or more resources; searching a cache for cached content that is associated with the domain name for the one or more resources, with the cached content differing from the information specifying the domain name, and with the cache storing copies of content in the one or more resources obtained through periodic crawling of a network for the content in the one or more resources; retrieving, from the cache, the cached content associated with the domain name; determining a type of language used in the retrieved cached content that is associated with the domain name; and selecting, at least partly based on the determined type of language, an advertisement item for display in at least one of the one or more resources associated with the domain name. | 17. A system comprising: at least one processor; and a computer-readable hardware storage device storing instructions that are executable by the at least one processor to perform operations comprising: detecting information specifying a domain name for one or more resources; searching a cache for cached content that is associated with the domain name for the one or more resources, with the cached content differing from the information specifying the domain name, and with the cache storing copies of content in the one or more resources obtained through periodic crawling of a network for the content in the one or more resources; retrieving, from the cache, the cached content associated with the domain name; determining a type of language used in the retrieved cached content that is associated with the domain name; and selecting, at least partly based on the determined type of language, an advertisement item for display in at least one of the one or more resources associated with the domain name. 21. The system of claim 17 , wherein the operations further comprise: parsing the domain name to obtain a query; deriving contextual cues from the query; and selecting the advertisement item using the query, the derived contextual cues, and the determined type of language. | 0.522727 |
8,515,737 | 13 | 22 | 13. A method, comprising: receiving an instruction to define a narrative content portion based at least in part on an event; receiving, from a database, a plurality of data associated with the event; selecting, based on a narrative tone type that is based on the event, a narrative content template including a plurality of variable identifiers; defining the narrative content portion based at least in part on a combination of: a text portion of the narrative content template, the text portion being based on the narrative tone type; and for each variable identifier from the plurality of variable identifiers, a datum from the plurality of data associated with that variable identifier; and sending a signal such that the narrative content portion is output at a display. | 13. A method, comprising: receiving an instruction to define a narrative content portion based at least in part on an event; receiving, from a database, a plurality of data associated with the event; selecting, based on a narrative tone type that is based on the event, a narrative content template including a plurality of variable identifiers; defining the narrative content portion based at least in part on a combination of: a text portion of the narrative content template, the text portion being based on the narrative tone type; and for each variable identifier from the plurality of variable identifiers, a datum from the plurality of data associated with that variable identifier; and sending a signal such that the narrative content portion is output at a display. 22. The method of claim 13 , wherein the narrative content portion is associated with an in-progress event. | 0.906632 |
8,548,246 | 1 | 9 | 1. A method of preprocessing an image for optical character recognition (OCR), wherein the image comprises a plurality of columns, each column of the plurality of columns comprising text, the method comprising: determining a plurality of components associated with the text, wherein a component comprises a series of connected pixels; calculating a line height and a column spacing associated with the plurality of components; associating at least one component of the plurality of components with a column of the plurality of columns based on at least one of the line height and the column spacing; calculating a first set of characteristic parameters for each column of the plurality of columns; merging the plurality of components of each column of the plurality of columns based on the first set of characteristic parameters to form at least one of at least one sub-word and at least one word; merging a first plurality of words, subwords, or a combination thereof to be processed as a first region; merging a second plurality of words, subwords, or a combination thereof to be processed as a second region wherein at least a portion of the second region vertically overlaps at least a portion of the first region; wherein calculating a word spacing associated with each column comprises creating a histogram of spaces between consecutive components of the plurality of components associated with each column, identifying a frequently occurring space from the histogram, the frequently occurring space being within a threshold range determined by the line height, and computing the word spacing based on the frequently occurring space; and wherein calculating the line spacing associated with each column comprises creating a histogram of a plurality of horizontal projections of the plurality of components associated with each column, a horizontal projection of the plurality of horizontal projections indicating a number of pixels associated with the plurality of components corresponding to each sweep of a raster scan, calculating an average distance between two consecutive maximum horizontal projections, and computing the line spacing based on the average distance. | 1. A method of preprocessing an image for optical character recognition (OCR), wherein the image comprises a plurality of columns, each column of the plurality of columns comprising text, the method comprising: determining a plurality of components associated with the text, wherein a component comprises a series of connected pixels; calculating a line height and a column spacing associated with the plurality of components; associating at least one component of the plurality of components with a column of the plurality of columns based on at least one of the line height and the column spacing; calculating a first set of characteristic parameters for each column of the plurality of columns; merging the plurality of components of each column of the plurality of columns based on the first set of characteristic parameters to form at least one of at least one sub-word and at least one word; merging a first plurality of words, subwords, or a combination thereof to be processed as a first region; merging a second plurality of words, subwords, or a combination thereof to be processed as a second region wherein at least a portion of the second region vertically overlaps at least a portion of the first region; wherein calculating a word spacing associated with each column comprises creating a histogram of spaces between consecutive components of the plurality of components associated with each column, identifying a frequently occurring space from the histogram, the frequently occurring space being within a threshold range determined by the line height, and computing the word spacing based on the frequently occurring space; and wherein calculating the line spacing associated with each column comprises creating a histogram of a plurality of horizontal projections of the plurality of components associated with each column, a horizontal projection of the plurality of horizontal projections indicating a number of pixels associated with the plurality of components corresponding to each sweep of a raster scan, calculating an average distance between two consecutive maximum horizontal projections, and computing the line spacing based on the average distance. 9. The method of claim 1 , wherein calculating the word spacing associated with each column comprises: creating a histogram of spaces between consecutive components of the plurality of components associated with each column; identifying a frequently occurring space from the histogram, wherein the frequently occurring space is within a threshold range determined by the line height; and computing the word spacing based on the frequently occurring space. | 0.714555 |
9,881,617 | 1 | 4 | 1. A method for automatically transcribing a customer service telephone conversation between an arbitrary number of speakers, the method comprising: receiving data corresponding to the telephone conversation, wherein the received data comprises audio data and metadata that identifies one or more of the speakers in the audio data; separating the audio data into frames; analyzing the frames to identify utterances, wherein each utterance comprises a plurality of frames; performing blind diarization of the audio data to differentiate speakers, wherein the blind diarization comprises: representing each utterance as a utterance model based on acoustic features of each utterance, clustering the utterance models, creating speaker models from each of the clusters, constructing a hidden Markov model from the speaker models, and decoding the hidden Markov model to differentiate speakers of each utterance; tagging homogeneous speaker segments in the telephone conversation with a tag unique for each speaker; performing speaker diarization to replace one or more of the tags with a speaker's identity, wherein the speaker diarization comprises: comparing the homogeneous speaker segments in the telephone conversation to one or more models retrieved from a database wherein the one or more models retrieved correspond to the one or more speakers identified in the metadata, and based on the comparison, identifying one or more of the speakers; and transcribing the conversation to obtain a text representation of the conversation, wherein each spoken part of the conversation is labeled with either the speaker's identity or the tag associated with the speaker. | 1. A method for automatically transcribing a customer service telephone conversation between an arbitrary number of speakers, the method comprising: receiving data corresponding to the telephone conversation, wherein the received data comprises audio data and metadata that identifies one or more of the speakers in the audio data; separating the audio data into frames; analyzing the frames to identify utterances, wherein each utterance comprises a plurality of frames; performing blind diarization of the audio data to differentiate speakers, wherein the blind diarization comprises: representing each utterance as a utterance model based on acoustic features of each utterance, clustering the utterance models, creating speaker models from each of the clusters, constructing a hidden Markov model from the speaker models, and decoding the hidden Markov model to differentiate speakers of each utterance; tagging homogeneous speaker segments in the telephone conversation with a tag unique for each speaker; performing speaker diarization to replace one or more of the tags with a speaker's identity, wherein the speaker diarization comprises: comparing the homogeneous speaker segments in the telephone conversation to one or more models retrieved from a database wherein the one or more models retrieved correspond to the one or more speakers identified in the metadata, and based on the comparison, identifying one or more of the speakers; and transcribing the conversation to obtain a text representation of the conversation, wherein each spoken part of the conversation is labeled with either the speaker's identity or the tag associated with the speaker. 4. The method according to claim 1 , wherein the received data comprises an initial transcription of the telephone conversation without any separation or identification of speakers. | 0.857928 |
8,024,323 | 1 | 3 | 1. A method in a computing system for defining a group of people, comprising: providing a visual user interface containing a control for receiving a query string; receiving a query string via the control; using an index on a body of documents to identify documents of the body that satisfy the received query string; accessing a record indicating which documents of the body were accessed by each of a population of people during a foregoing time period to identify people among the population that accessed at least a threshold number of the identified documents during the foregoing time period; and displaying within the visual user interface, in conjunction with the control, information characterizing the people identified. | 1. A method in a computing system for defining a group of people, comprising: providing a visual user interface containing a control for receiving a query string; receiving a query string via the control; using an index on a body of documents to identify documents of the body that satisfy the received query string; accessing a record indicating which documents of the body were accessed by each of a population of people during a foregoing time period to identify people among the population that accessed at least a threshold number of the identified documents during the foregoing time period; and displaying within the visual user interface, in conjunction with the control, information characterizing the people identified. 3. The method of claim 1 , further comprising: receiving a modified query string via the control; and repeating the two identifying acts and the displaying act with respect to the received modified query string. | 0.502358 |
8,131,663 | 13 | 21 | 13. The apparatus as recited in claim 1 , wherein said shapes are selected from the group consisting of Action, Dialog, Module, Decision, Connector, Module Begin, Module End, Begin Flow, End Flow, Jump, Condition, Terminate, Wait Decision, Wait Condition, Question List and Update Variables shapes and combinations thereof. | 13. The apparatus as recited in claim 1 , wherein said shapes are selected from the group consisting of Action, Dialog, Module, Decision, Connector, Module Begin, Module End, Begin Flow, End Flow, Jump, Condition, Terminate, Wait Decision, Wait Condition, Question List and Update Variables shapes and combinations thereof. 21. The apparatus as recited in claim 13 , wherein said shapes are characterized by conditions defined by properties, said properties including a driver property, a selection property, a module begin property, and a module end property. | 0.904531 |
9,886,432 | 1 | 14 | 1. A method for predicting words, the method comprising: at an electronic device: receiving input from a user; determining, using an n-gram language model, a probability of a predicted word based on a previously-input word in the received input, wherein the predicted word comprises a stem and a suffix; determining, a probability of the suffix being grammatically valid for the stem; determining an integrated probability of the predicted word based on the probability of the predicted word and the probability of the suffix being grammatically valid for the stem; and providing output of the predicted word, based on the integrated probability. | 1. A method for predicting words, the method comprising: at an electronic device: receiving input from a user; determining, using an n-gram language model, a probability of a predicted word based on a previously-input word in the received input, wherein the predicted word comprises a stem and a suffix; determining, a probability of the suffix being grammatically valid for the stem; determining an integrated probability of the predicted word based on the probability of the predicted word and the probability of the suffix being grammatically valid for the stem; and providing output of the predicted word, based on the integrated probability. 14. The method of claim 1 , wherein the received input is verbal input. | 0.927551 |
10,025,454 | 13 | 16 | 13. A non-transitory computer-readable storage medium including instructions that, when executed by a processor, cause the processor to provide a mechanism for navigating a software application, by performing the steps of: generating a first graphic that includes a first wheel configured to allow a first user to navigate a software application, wherein the first wheel has a first plurality of activation zones, and each activation zone included in the first plurality of activation zones is associated with a different function in a first plurality of functions for navigating the software application, generating a second graphic that includes a second wheel configured to allow a second user to navigate the software application, wherein the second wheel has a second plurality of activation zones that comprises a superset of the first plurality of activation zones, and a portion of the activation zones included in the second plurality of activation zones is associated with different functions in a second plurality of functions for navigating the software application that are not included in the first plurality of function, and displaying at least one of the first graphic and the second graphic, generating a mini wheel, distinct from the first wheel and the second wheel, wherein the mini wheel is a miniaturized version of the second wheel and includes the second plurality of activation zones and corresponding functions from the first plurality and the second plurality of functions, displaying the mini wheel as a pie menu at a position of a cursor, wherein the cursor is hidden when the mini wheel is displayed, wherein the mini wheel has a third plurality of activation zones; responsive to a first input, highlighting a first activation zone located the third plurality of activation zones that corresponds to a direction of a movement of an input device and highlighting a command that corresponds to the first activation zone, responsive to a second input, displaying a tool cursor associated with the first activation zone and remove the mini wheel from the display, responsive to a third input, executing a first function that is included in either the first plurality of functions or the second plurality of functions and is associated with the first activation zone to modify the software application, and responsive to a fourth input, replacing the displayed tool cursor with the mini wheel. | 13. A non-transitory computer-readable storage medium including instructions that, when executed by a processor, cause the processor to provide a mechanism for navigating a software application, by performing the steps of: generating a first graphic that includes a first wheel configured to allow a first user to navigate a software application, wherein the first wheel has a first plurality of activation zones, and each activation zone included in the first plurality of activation zones is associated with a different function in a first plurality of functions for navigating the software application, generating a second graphic that includes a second wheel configured to allow a second user to navigate the software application, wherein the second wheel has a second plurality of activation zones that comprises a superset of the first plurality of activation zones, and a portion of the activation zones included in the second plurality of activation zones is associated with different functions in a second plurality of functions for navigating the software application that are not included in the first plurality of function, and displaying at least one of the first graphic and the second graphic, generating a mini wheel, distinct from the first wheel and the second wheel, wherein the mini wheel is a miniaturized version of the second wheel and includes the second plurality of activation zones and corresponding functions from the first plurality and the second plurality of functions, displaying the mini wheel as a pie menu at a position of a cursor, wherein the cursor is hidden when the mini wheel is displayed, wherein the mini wheel has a third plurality of activation zones; responsive to a first input, highlighting a first activation zone located the third plurality of activation zones that corresponds to a direction of a movement of an input device and highlighting a command that corresponds to the first activation zone, responsive to a second input, displaying a tool cursor associated with the first activation zone and remove the mini wheel from the display, responsive to a third input, executing a first function that is included in either the first plurality of functions or the second plurality of functions and is associated with the first activation zone to modify the software application, and responsive to a fourth input, replacing the displayed tool cursor with the mini wheel. 16. The computer-readable storage medium of claim 13 , wherein the first graphic further includes text graphics describing one or more functions in the first plurality of functions associated with the different activation zones included in the first plurality of activation zones, and wherein the second graphic further includes text graphics describing one or more functions in the second plurality of functions associated with the different activation zones included in the second plurality of activation zones. | 0.500973 |
8,230,332 | 17 | 18 | 17. The method of claim 16 , wherein the structure of the table includes the order of items in the table. | 17. The method of claim 16 , wherein the structure of the table includes the order of items in the table. 18. The method of claim 17 , wherein the structure of the table further includes the nesting of items within the table. | 0.973626 |
7,904,461 | 1 | 14 | 1. A method implemented by a computer system, the method comprising: generating, by the computer system, a set of content-based keywords based on content generated by users of a social network, wherein users are represented by nodes in a graph that represents the social network; labeling, by the computer system, nodes comprising the user nodes with advertising labels comprising content-based keywords from the set of content-based keywords that coincide with advertiser-selected keywords, wherein the advertiser-selected keywords are based on one or more terms specified by an advertiser; and outputting, by the computer system for each respective node, weights for the advertising labels which are determined from weights of the advertising labels associated with neighboring nodes that are related to the respective node by a relationship, each weight expressing a magnitude of a contribution of an associated advertising label to a characterization of the respective node. | 1. A method implemented by a computer system, the method comprising: generating, by the computer system, a set of content-based keywords based on content generated by users of a social network, wherein users are represented by nodes in a graph that represents the social network; labeling, by the computer system, nodes comprising the user nodes with advertising labels comprising content-based keywords from the set of content-based keywords that coincide with advertiser-selected keywords, wherein the advertiser-selected keywords are based on one or more terms specified by an advertiser; and outputting, by the computer system for each respective node, weights for the advertising labels which are determined from weights of the advertising labels associated with neighboring nodes that are related to the respective node by a relationship, each weight expressing a magnitude of a contribution of an associated advertising label to a characterization of the respective node. 14. The method of claim 1 , where the advertiser-selected keywords comprise the terms specified by the advertisers. | 0.828869 |
9,990,386 | 1 | 9 | 1. A method, comprising: creating two or more sets of field searchable, time stamped event records from raw data stored in at least one data store, wherein each set of field searchable, time stamped event records among the two or more sets of field searchable, time stamped event records comprises field searchable, time stamped event records having time stamps that fall within a time range, the time range different than time ranges associated with other sets of field searchable, time stamped event records among the two or more sets of field searchable, time stamped event records, wherein each field searchable, time stamped event record in the two or more sets of field searchable, time stamped event records includes a portion of the raw data and is associated with a time stamp derived from the raw data, wherein the raw data reflects activity in an information technology environment; generating a summarization table for each set of field searchable, time stamped event records in the two or more sets of field searchable, time stamped event records that: identifies one or more field values, wherein a field value comprises a value that appears in an associated field in one or more field searchable, time stamped event records in the set of field searchable, time stamped event records; and for each field value, includes a posting value to the one or more field searchable, time stamped event records in the set of field searchable, time stamped event records that contain the field value for the associated field; storing the summarization table for each set of field searchable, time stamped event records among the two or more sets of time stamped field searchable event records; selecting a stored summarization table based on a received query that includes search criteria for evaluating field values for one or more fields; using the search criteria to evaluate field values for one or more fields in the selected summarization table to generate a query result; and wherein the query result reflects an aspect of activity in the information technology environment. | 1. A method, comprising: creating two or more sets of field searchable, time stamped event records from raw data stored in at least one data store, wherein each set of field searchable, time stamped event records among the two or more sets of field searchable, time stamped event records comprises field searchable, time stamped event records having time stamps that fall within a time range, the time range different than time ranges associated with other sets of field searchable, time stamped event records among the two or more sets of field searchable, time stamped event records, wherein each field searchable, time stamped event record in the two or more sets of field searchable, time stamped event records includes a portion of the raw data and is associated with a time stamp derived from the raw data, wherein the raw data reflects activity in an information technology environment; generating a summarization table for each set of field searchable, time stamped event records in the two or more sets of field searchable, time stamped event records that: identifies one or more field values, wherein a field value comprises a value that appears in an associated field in one or more field searchable, time stamped event records in the set of field searchable, time stamped event records; and for each field value, includes a posting value to the one or more field searchable, time stamped event records in the set of field searchable, time stamped event records that contain the field value for the associated field; storing the summarization table for each set of field searchable, time stamped event records among the two or more sets of time stamped field searchable event records; selecting a stored summarization table based on a received query that includes search criteria for evaluating field values for one or more fields; using the search criteria to evaluate field values for one or more fields in the selected summarization table to generate a query result; and wherein the query result reflects an aspect of activity in the information technology environment. 9. The method of claim 1 , further comprising: storing the two or more sets of field searchable, time stamped event records in an indexed data store; wherein the indexed data store is stored in a distributed manner among two or more devices. | 0.853406 |
8,219,728 | 1 | 8 | 1. An unmanned aerial vehicle system certified for aviation, the unmanned aerial vehicle system comprising: at least two separate disjunctive exchangeable components that are certified for aviation, wherein said disjunctive exchangeable components are hierarchically organized in top-level disjunctive exchangeable components and sub-level disjunctive exchangeable components, wherein said sub-level disjunctive exchangeable components are arranged to comprise disjunctive parts in disjunctive exchangeable components at higher levels, wherein at least a first disjunctive exchangeable component at a sub-level is arranged to provide services to at least one second disjunctive exchangeable component at a higher level and/or to an operator of said unmanned aerial vehicle system; at least one message bus arranged to perform real-time transfers of communications from/to said at least one first disjunctive exchangeable component to/from said at least one second disjunctive exchangeable component, wherein said at least one message bus is connected to or integrated in an internal communication backbone comprising an outgoing communication module configured to establish outgoing communication links, wherein the at least one message bus is certified for aviation; and a predetermined message based interface arranged relative to each of said first and second disjunctive exchangeable components and said at least one message bus such that all communications between said at least one first disjunctive exchangeable component and said at least one second disjunctive exchangeable component are defined in the same single standardized message language, whereby re-certification of any components beside a new or upgraded disjunctive exchangeable component is avoided in said UAV-system. | 1. An unmanned aerial vehicle system certified for aviation, the unmanned aerial vehicle system comprising: at least two separate disjunctive exchangeable components that are certified for aviation, wherein said disjunctive exchangeable components are hierarchically organized in top-level disjunctive exchangeable components and sub-level disjunctive exchangeable components, wherein said sub-level disjunctive exchangeable components are arranged to comprise disjunctive parts in disjunctive exchangeable components at higher levels, wherein at least a first disjunctive exchangeable component at a sub-level is arranged to provide services to at least one second disjunctive exchangeable component at a higher level and/or to an operator of said unmanned aerial vehicle system; at least one message bus arranged to perform real-time transfers of communications from/to said at least one first disjunctive exchangeable component to/from said at least one second disjunctive exchangeable component, wherein said at least one message bus is connected to or integrated in an internal communication backbone comprising an outgoing communication module configured to establish outgoing communication links, wherein the at least one message bus is certified for aviation; and a predetermined message based interface arranged relative to each of said first and second disjunctive exchangeable components and said at least one message bus such that all communications between said at least one first disjunctive exchangeable component and said at least one second disjunctive exchangeable component are defined in the same single standardized message language, whereby re-certification of any components beside a new or upgraded disjunctive exchangeable component is avoided in said UAV-system. 8. The unmanned aerial vehicle system according to claim 1 , wherein at least one of said disjunctive exchangeable components is arranged to perform an instantiation in connection with a certificate being issued. | 0.604478 |
9,201,965 | 1 | 6 | 1. A method, comprising: receiving data propagating in a network environment; ignoring Joint Photographic Experts Group (JPEG) documents in the data; identifying an audio and video media file in the data, wherein the audio and video media file is associated with a plurality of individuals; generating a text file based on the audio and video media file; comparing the text file to a plurality of blacklisted words; dropping the text file if a blacklisted word is found in the text file; identifying, using a processor, selected words within the text file based on a whitelist to create a first word list, wherein the first word list includes fewer words than the text file; comparing the selected words in the first word list to a personal vocabulary database associated with an individual from the plurality of individuals, wherein the personal vocabulary database associated with the individual includes one or more words that the individual added to the personal vocabulary database, and wherein words in the personal vocabulary database associated with the individual may be marked as private; and removing from the first word list, one or more of the selected words to create a second word list based on the selected words not being found in the personal vocabulary database associated with the individual, wherein the second word list includes fewer words then the first word list, wherein at least one of the selected words that is removed is associated with a false positive from two words that phonetically sound similar. | 1. A method, comprising: receiving data propagating in a network environment; ignoring Joint Photographic Experts Group (JPEG) documents in the data; identifying an audio and video media file in the data, wherein the audio and video media file is associated with a plurality of individuals; generating a text file based on the audio and video media file; comparing the text file to a plurality of blacklisted words; dropping the text file if a blacklisted word is found in the text file; identifying, using a processor, selected words within the text file based on a whitelist to create a first word list, wherein the first word list includes fewer words than the text file; comparing the selected words in the first word list to a personal vocabulary database associated with an individual from the plurality of individuals, wherein the personal vocabulary database associated with the individual includes one or more words that the individual added to the personal vocabulary database, and wherein words in the personal vocabulary database associated with the individual may be marked as private; and removing from the first word list, one or more of the selected words to create a second word list based on the selected words not being found in the personal vocabulary database associated with the individual, wherein the second word list includes fewer words then the first word list, wherein at least one of the selected words that is removed is associated with a false positive from two words that phonetically sound similar. 6. The method of claim 1 , further comprising: receiving a query to search for one or more files based on the selected words that are tagged and not removed. | 0.810843 |
8,838,605 | 31 | 32 | 31. An apparatus comprising: memory; one or more computers configured to: parse patent data to generate a set of nodes; select at least one node of the set of nodes; determine initial links from meta data associated with the patent data for the at least one node; create links among the set of nodes based on the metadata; identify a set of seed nodes; determine a community structure for the set of seed nodes, the community structure including a plurality of communities; and assign concepts to the plurality of communities, wherein determining the community structure comprises: initiating a percolation message from a source node of a linked network, the linked network comprising a plurality of nodes and a plurality of edges, each edge connecting at least two of the plurality of nodes, wherein a node is a neighbor if the node is connected to another node in the plurality of nodes by an edge, wherein the percolation message comprises a percolation probability and an identifier of the source node, and wherein initiating a percolation message from the source node comprises transmitting the percolation message to each neighbor of the source node with the percolation probability; propagating the percolation message through the linked network, wherein propagating the percolation message through the linked network comprises: transmitting the percolation message from each node that receives the percolation message to each neighbor of each node that receives the percolation message; and transmitting a response to the source node from each node that receives the percolation message; collecting each response to the percolation message at the source node; and storing a list of nodes that transmitted the response at the source node. | 31. An apparatus comprising: memory; one or more computers configured to: parse patent data to generate a set of nodes; select at least one node of the set of nodes; determine initial links from meta data associated with the patent data for the at least one node; create links among the set of nodes based on the metadata; identify a set of seed nodes; determine a community structure for the set of seed nodes, the community structure including a plurality of communities; and assign concepts to the plurality of communities, wherein determining the community structure comprises: initiating a percolation message from a source node of a linked network, the linked network comprising a plurality of nodes and a plurality of edges, each edge connecting at least two of the plurality of nodes, wherein a node is a neighbor if the node is connected to another node in the plurality of nodes by an edge, wherein the percolation message comprises a percolation probability and an identifier of the source node, and wherein initiating a percolation message from the source node comprises transmitting the percolation message to each neighbor of the source node with the percolation probability; propagating the percolation message through the linked network, wherein propagating the percolation message through the linked network comprises: transmitting the percolation message from each node that receives the percolation message to each neighbor of each node that receives the percolation message; and transmitting a response to the source node from each node that receives the percolation message; collecting each response to the percolation message at the source node; and storing a list of nodes that transmitted the response at the source node. 32. The apparatus of claim 31 , wherein the one or more computers are further configured to refine weights of the plurality of communities and modifying the community structure. | 0.817901 |
9,185,064 | 1 | 5 | 1. A method of presenting extensible emails from a third party to a user, comprising the steps of: (a) receiving an extensible email from the third party via a service provider which provides email service to the user, the extensible email including metadata listing a URL of a server controlled by the third party, the URL having code for generating an interactive view for the email; (b) checking whether the URL points to a web address inside a firewall of the service provider; (c) if the URL points to a web address inside the firewall of the service provider, taking no action with respect to accessing the URL; (d) if the URL points to a web address outside of the firewall of the service provider, fetching the code from the URL listed in the metadata in response to interacting with the email received in said step (a); and (e) if the URL points to a web address outside of the firewall of the service provider, running the code to generate an interactive view in the email, including the step of running the code in a secure sandbox which isolates the code and prevents the code from adversely affecting at least one of the service provider presenting the extensible email and a user receiving the extensible email. | 1. A method of presenting extensible emails from a third party to a user, comprising the steps of: (a) receiving an extensible email from the third party via a service provider which provides email service to the user, the extensible email including metadata listing a URL of a server controlled by the third party, the URL having code for generating an interactive view for the email; (b) checking whether the URL points to a web address inside a firewall of the service provider; (c) if the URL points to a web address inside the firewall of the service provider, taking no action with respect to accessing the URL; (d) if the URL points to a web address outside of the firewall of the service provider, fetching the code from the URL listed in the metadata in response to interacting with the email received in said step (a); and (e) if the URL points to a web address outside of the firewall of the service provider, running the code to generate an interactive view in the email, including the step of running the code in a secure sandbox which isolates the code and prevents the code from adversely affecting at least one of the service provider presenting the extensible email and a user receiving the extensible email. 5. The method recited in claim 1 , further comprising the step of authenticating at least one of the URL and the domain specified in the URL before said step (d) of fetching the code. | 0.889225 |
8,375,303 | 7 | 8 | 7. The method of claim 1 , wherein the relative significances are determined at least with respect to the person associated with the work of communication, and wherein the person associated with the work of communication is an author of the work of communication, an audience member viewing the work of communication, or a performer of the work of communication. | 7. The method of claim 1 , wherein the relative significances are determined at least with respect to the person associated with the work of communication, and wherein the person associated with the work of communication is an author of the work of communication, an audience member viewing the work of communication, or a performer of the work of communication. 8. The method of claim 7 , wherein the person associated with the work of communication is an audience member viewing the work of communication over a network. | 0.932741 |
7,496,767 | 1 | 8 | 1. A secure content object for distributing and controlling access to a document and annotations associated with the document, comprising: an electronic document, the electronic document having been encrypted with a document encryption key, wherein access to the electronic document is available to a first set of authorized users; an encrypted header comprising information pertaining to the electronic document; a first multi-key encryption table for use in a multi-key encryption method associated with the electronic document, the first table comprising at least one multi-key component associated with each authorized user in the first set and a plurality of dummy encryption components, wherein the multi-key encryption table includes no information that may identify a user or the electronic document; a plurality of annotations associated with the electronic document, generated by an annotation author and having been encrypted with an annotation encryption key, wherein access to the plurality of annotations is available to authorized annotation users comprising the annotation author and those users in the first set having been designated by the annotation author as having access to the plurality of annotations; a second multi-key encryption table for use in a multi-key encryption method associated with the plurality of annotations, the second table comprising at least one multi-key component associated with each authorized annotation user; and a user interface device comprising unencrypted information for identifying the electronic document and an interactive element for enabling a user to input a user authorization for access to at least a portion of the encrypted electronic document, for inputting the user authorization to a decryption engine using the multi-key encryption method for combining the user authorization with each of the multi-key components in the first multi-key encryption key table to decrypt the encrypted header, and for combining the user authorization with each of the stored multi-key components in the second multi-key encryption key table to decrypt an annotation, wherein upon a valid decryption of the annotation indicates the correct annotation encryption key has been found and the user is an authorized annotation user; and upon a valid decryption of the encrypted header, for enabling decryption of the portion of the encrypted electronic document. | 1. A secure content object for distributing and controlling access to a document and annotations associated with the document, comprising: an electronic document, the electronic document having been encrypted with a document encryption key, wherein access to the electronic document is available to a first set of authorized users; an encrypted header comprising information pertaining to the electronic document; a first multi-key encryption table for use in a multi-key encryption method associated with the electronic document, the first table comprising at least one multi-key component associated with each authorized user in the first set and a plurality of dummy encryption components, wherein the multi-key encryption table includes no information that may identify a user or the electronic document; a plurality of annotations associated with the electronic document, generated by an annotation author and having been encrypted with an annotation encryption key, wherein access to the plurality of annotations is available to authorized annotation users comprising the annotation author and those users in the first set having been designated by the annotation author as having access to the plurality of annotations; a second multi-key encryption table for use in a multi-key encryption method associated with the plurality of annotations, the second table comprising at least one multi-key component associated with each authorized annotation user; and a user interface device comprising unencrypted information for identifying the electronic document and an interactive element for enabling a user to input a user authorization for access to at least a portion of the encrypted electronic document, for inputting the user authorization to a decryption engine using the multi-key encryption method for combining the user authorization with each of the multi-key components in the first multi-key encryption key table to decrypt the encrypted header, and for combining the user authorization with each of the stored multi-key components in the second multi-key encryption key table to decrypt an annotation, wherein upon a valid decryption of the annotation indicates the correct annotation encryption key has been found and the user is an authorized annotation user; and upon a valid decryption of the encrypted header, for enabling decryption of the portion of the encrypted electronic document. 8. The secure content object of claim 1 , wherein the information pertaining to the electronic document comprises a user permission table for access to all or portions of the electronic document and wherein only those permitted portions of the electronic document are decrypted. | 0.719192 |
5,542,024 | 48 | 49 | 48. An information processing system as claimed in claim 47, wherein said second means includes an object oriented command module which responds to selections of options by the developer to generate command statements for said data base manager. | 48. An information processing system as claimed in claim 47, wherein said second means includes an object oriented command module which responds to selections of options by the developer to generate command statements for said data base manager. 49. The information processing system as claimed in claim 48, wherein said command statements include executable computer operating system commands. | 0.955689 |
9,323,841 | 17 | 20 | 17. A method to identify a document, the method comprising: converting classified categories of recorded document data representing aspects of the recorded document data into a multi-dimensional vector signature, wherein each aspect provides a dimension of the multi-dimensional vector signature; determining uniqueness is high for the multi-dimensional vector signature by analysis of a term frequency of signatures within a specified distance of the multi-dimensional vector signature that indicates a number of similar multi-dimensional vector signatures within the specified distance is less than a specified value; using a hash of the multi-dimensional vector signature having high uniqueness as an address to data stored in a leaf node of a content database to access an associated signature at the leaf node of the content database; and correlating the associated signature with stored signatures obtained in a search of the content database to identify the document that was recorded. | 17. A method to identify a document, the method comprising: converting classified categories of recorded document data representing aspects of the recorded document data into a multi-dimensional vector signature, wherein each aspect provides a dimension of the multi-dimensional vector signature; determining uniqueness is high for the multi-dimensional vector signature by analysis of a term frequency of signatures within a specified distance of the multi-dimensional vector signature that indicates a number of similar multi-dimensional vector signatures within the specified distance is less than a specified value; using a hash of the multi-dimensional vector signature having high uniqueness as an address to data stored in a leaf node of a content database to access an associated signature at the leaf node of the content database; and correlating the associated signature with stored signatures obtained in a search of the content database to identify the document that was recorded. 20. The method of claim 17 , wherein the search of the content database produces nearest matching results that are used to generate one or more correlation scores. | 0.886332 |
8,971,630 | 17 | 18 | 17. One or more physical non-transitory computer accessible media encoded with instructions for performing a method, the method comprising: identifying a line of glyph-based character representations in the electronic image; isolating a plurality of glyph-based character representations; loading a set of glyph-based character patterns into a computer memory; loading the plurality of glyph-based character representations into the computer cache; and recognizing the plurality of glyph-based character representations with the set of glyph-based character patterns while one or more of the plurality of glyph-based character representations are in the computer cache. | 17. One or more physical non-transitory computer accessible media encoded with instructions for performing a method, the method comprising: identifying a line of glyph-based character representations in the electronic image; isolating a plurality of glyph-based character representations; loading a set of glyph-based character patterns into a computer memory; loading the plurality of glyph-based character representations into the computer cache; and recognizing the plurality of glyph-based character representations with the set of glyph-based character patterns while one or more of the plurality of glyph-based character representations are in the computer cache. 18. The one or more physical non-transitory computer accessible media of claim 17 , wherein the method further comprises: detecting character gaps in the line of glyph-based character representations; creating a histogram of distances for the detected character gaps; constructing a graph according to the detected character gaps; assigning a penalty to arcs of the graph wherein the penalty is based in part on the histogram of distances; and selecting a path in the graph associated with the character cells based on said penalty and arcs of the graph. | 0.736441 |
7,886,137 | 14 | 15 | 14. A method of selecting BIOS components for inclusion within a BIOS project, comprising: retrieving a script file corresponding to a project type; searching the script file for a component category and component category selection criteria, wherein the component category selection criteria comprises a requirement indicator as to whether a BIOS component from the BIOS component category is required to be included in the BIOS project and a unicity indicator as to whether more than one BIOS component from the BIOS component category may be included in the BIOS project; retrieving identifiers from a component storage medium of all BIOS components characterized by a component category matching the component category from the script file; requesting user selection of any component identifiers corresponding to BIOS components to be included within the BIOS project; receiving the user selection component identifiers according to the component category selection criteria; and identifying the BIOS components corresponding to the user selection as BIOS project components. | 14. A method of selecting BIOS components for inclusion within a BIOS project, comprising: retrieving a script file corresponding to a project type; searching the script file for a component category and component category selection criteria, wherein the component category selection criteria comprises a requirement indicator as to whether a BIOS component from the BIOS component category is required to be included in the BIOS project and a unicity indicator as to whether more than one BIOS component from the BIOS component category may be included in the BIOS project; retrieving identifiers from a component storage medium of all BIOS components characterized by a component category matching the component category from the script file; requesting user selection of any component identifiers corresponding to BIOS components to be included within the BIOS project; receiving the user selection component identifiers according to the component category selection criteria; and identifying the BIOS components corresponding to the user selection as BIOS project components. 15. The method of claim 14 , further comprising: prior to identifying the BIOS components corresponding to the user selection as BIOS project components, displaying the user selection of component identifiers in a dialog box; displaying with each component identifier a directory location within the BIOS project file for storing a corresponding BIOS component and a source location of the BIOS component within the component storage medium; and providing means for deselecting BIOS components from being included in the BIOS project and for modifying project and source locations corresponding to each component identifier. | 0.611457 |
8,781,829 | 2 | 21 | 2. The method of claim 1 , wherein (C) comprises: (C)(1) prompting a human user to provide the content; (C)(2) receiving input from the human user representing the content; and (C)(3) inserting the content into the structured document. | 2. The method of claim 1 , wherein (C) comprises: (C)(1) prompting a human user to provide the content; (C)(2) receiving input from the human user representing the content; and (C)(3) inserting the content into the structured document. 21. The method of claim 2 : wherein (C)(1) comprises displaying a structured input element; wherein (C)(2) comprises receiving input from the human user in the structured input element. | 0.915833 |
9,626,685 | 14 | 19 | 14. A system comprising: a plurality of processors; a physical entity request engine implemented by at least one of said plurality of processors comprising: a request sub-module that receives one or more requests to display information related to first a physical entity; a transform sub-module that transforms the request into search data; a subset generation and matching sub-module that dynamically applies the search data to descriptive information related to a set of other physical entities known to a network, said application comprising deriving a subset of other physical entities matching the search data from the descriptive information related to the set of other known physical entities, the descriptive information corresponding to the other physical entities is analyzed as part of said deriving the subset of other physical entities that match the search data; and an attention rank engine for ranking the subset of other physical entities to form a ranked subset of physical entities after having generated entity rank, attention rank, and personal rank, the ranked subset based upon the applied search data, the ranked subset comprising the descriptive information corresponding to the other physical entities of the subset; and a mapping manager module implemented by at least one of said plurality of processors for presenting information related to the ranked subset of physical entities to a first user, the presenting of the ranked physical entities information being dependent upon user information stored in the network, the user information comprising data generated by the user, data associated with the user, and data associated with the request. | 14. A system comprising: a plurality of processors; a physical entity request engine implemented by at least one of said plurality of processors comprising: a request sub-module that receives one or more requests to display information related to first a physical entity; a transform sub-module that transforms the request into search data; a subset generation and matching sub-module that dynamically applies the search data to descriptive information related to a set of other physical entities known to a network, said application comprising deriving a subset of other physical entities matching the search data from the descriptive information related to the set of other known physical entities, the descriptive information corresponding to the other physical entities is analyzed as part of said deriving the subset of other physical entities that match the search data; and an attention rank engine for ranking the subset of other physical entities to form a ranked subset of physical entities after having generated entity rank, attention rank, and personal rank, the ranked subset based upon the applied search data, the ranked subset comprising the descriptive information corresponding to the other physical entities of the subset; and a mapping manager module implemented by at least one of said plurality of processors for presenting information related to the ranked subset of physical entities to a first user, the presenting of the ranked physical entities information being dependent upon user information stored in the network, the user information comprising data generated by the user, data associated with the user, and data associated with the request. 19. The system of claim 14 , wherein each physical entity is one of a user, a user proxy device, a location, a legal entity, or a physical object. | 0.869176 |
7,650,597 | 1 | 6 | 1. A method for transforming an XML data structure into an application programming language data structure comprising: receiving a request for an XML data structure from an application; retrieving the requested XML data structure; executing a transformation program associated with an application programming language data structure, the transformation program including a directional serialization construct and a directional deserialization construct which specify different respective behaviors for transforming the XML data structure into the application programming language data structure and for transforming the application programming language data structure into the XML data structure, wherein an application of source data to both directional constructs yields result data which exactly matches the source data, the directional serialization construct comprising a first construct which, during serialization, terminates with an error when a current referenced node does not have a same value as a node referenced in an attribute, and the directional deserialization construct comprising a second construct which, during deserialization, assigns a value of a node referenced in the attribute to the current referenced node; parsing the XML data structure in a strictly linear fashion using the transformation program, without constructing a tree representation of the XML data structure; evaluating the deserialization construct of the transformation program; and transforming the parsed XML data structure into the application programming language data structure based on the evaluated deserialization construct; and sending the application programming language data structure to the application. | 1. A method for transforming an XML data structure into an application programming language data structure comprising: receiving a request for an XML data structure from an application; retrieving the requested XML data structure; executing a transformation program associated with an application programming language data structure, the transformation program including a directional serialization construct and a directional deserialization construct which specify different respective behaviors for transforming the XML data structure into the application programming language data structure and for transforming the application programming language data structure into the XML data structure, wherein an application of source data to both directional constructs yields result data which exactly matches the source data, the directional serialization construct comprising a first construct which, during serialization, terminates with an error when a current referenced node does not have a same value as a node referenced in an attribute, and the directional deserialization construct comprising a second construct which, during deserialization, assigns a value of a node referenced in the attribute to the current referenced node; parsing the XML data structure in a strictly linear fashion using the transformation program, without constructing a tree representation of the XML data structure; evaluating the deserialization construct of the transformation program; and transforming the parsed XML data structure into the application programming language data structure based on the evaluated deserialization construct; and sending the application programming language data structure to the application. 6. The method of claim 1 , wherein the transformation program includes a transformation template that defines symmetric programming constructs responsible for transforming the requested XML data structure into the application programming language data structure. | 0.507519 |
7,503,075 | 18 | 20 | 18. The computer-readable storage medium of claim 11 , wherein reporting the retrieved document data to the requesting user comprises: assembling a Web page listing all of the document data retrieved by the one or more database queries; and transferring the Web page to the requesting user. | 18. The computer-readable storage medium of claim 11 , wherein reporting the retrieved document data to the requesting user comprises: assembling a Web page listing all of the document data retrieved by the one or more database queries; and transferring the Web page to the requesting user. 20. A computer-readable storage medium according to claim 18 , wherein the retrieved document data is linked to the one or more data base servers. | 0.935852 |
9,164,778 | 10 | 15 | 10. A system for modal progress dialog comprising: a system interface to receive an action request associated with a resource; a resource manager, comprising at least one processor, to process the action on the resource; and a progress manager, comprising at least one processor, to determine when a progress dialog is to be displayed triggered on a predicted duration of the processing of the action, the predicted duration being a function of the action requested, the resource associated with the action requested, a location of the resource, or a measured time to execute a portion of the action, where the process manager displays the progress dialog when the determination is triggered by the predicted duration exceeding a threshold. | 10. A system for modal progress dialog comprising: a system interface to receive an action request associated with a resource; a resource manager, comprising at least one processor, to process the action on the resource; and a progress manager, comprising at least one processor, to determine when a progress dialog is to be displayed triggered on a predicted duration of the processing of the action, the predicted duration being a function of the action requested, the resource associated with the action requested, a location of the resource, or a measured time to execute a portion of the action, where the process manager displays the progress dialog when the determination is triggered by the predicted duration exceeding a threshold. 15. The system for modal progress dialog of claim 10 , where the requested action is any of: a file system operation, a network operation and an input/output operation. | 0.575758 |
7,685,194 | 1 | 8 | 1. A computer-implemented system that facilitates fine-grained access control of a database, comprising: a processor configured to execute computer-readable instructions; a performance component for detecting and removing redundant authorizations associated with a query expression, the removing including: implementing a set of transformation rules, the transformation rules including: testing for semi-join subsumption and relation mapping; and given disjunction of query expression, transforming the expression into a disjunction of semi-joins, and testing for subsumption of each of the semi-joins; and initiating redundancy removal before applying decorrelation transformations; security component for controlling information leakage associated with the query expression, the security component configured to identify at least one unsafe function in the query expression and to determine an optimal safe location for the at least one unsafe function in an optimal query plan; and a safety component for maintaining safety of the query plan, the query plan including a relocation of the at least one unsafe function to a safe location determined in part by a safety analysis and in part by a cost-based analysis, the unsafe functions including user defined functions, system-defined functions, and operators that may reveal information whether directly or by means of exception or error messages, the maintaining including: parsing the query expression and determining base relations of the query expression; specifying authorizations based on predicated grants in the query expression; creating a regular view by combining a plurality of authorizations made to a user; and giving permission to the user on the regular view instead of underlying relations. | 1. A computer-implemented system that facilitates fine-grained access control of a database, comprising: a processor configured to execute computer-readable instructions; a performance component for detecting and removing redundant authorizations associated with a query expression, the removing including: implementing a set of transformation rules, the transformation rules including: testing for semi-join subsumption and relation mapping; and given disjunction of query expression, transforming the expression into a disjunction of semi-joins, and testing for subsumption of each of the semi-joins; and initiating redundancy removal before applying decorrelation transformations; security component for controlling information leakage associated with the query expression, the security component configured to identify at least one unsafe function in the query expression and to determine an optimal safe location for the at least one unsafe function in an optimal query plan; and a safety component for maintaining safety of the query plan, the query plan including a relocation of the at least one unsafe function to a safe location determined in part by a safety analysis and in part by a cost-based analysis, the unsafe functions including user defined functions, system-defined functions, and operators that may reveal information whether directly or by means of exception or error messages, the maintaining including: parsing the query expression and determining base relations of the query expression; specifying authorizations based on predicated grants in the query expression; creating a regular view by combining a plurality of authorizations made to a user; and giving permission to the user on the regular view instead of underlying relations. 8. The system of claim 1 , wherein the performance component checks for redundancy between predicates in a query and predicates in authorizations. | 0.645631 |
8,176,067 | 5 | 6 | 5. A computer-implemented method according to claim 1 , wherein selecting the fixed phrases comprises: determining a pointwise mutual information score threshold based at least in part on the greatest pointwise mutual information score determined for the topic; and selecting candidate phrases with pointwise mutual information scores greater than the pointwise mutual information score threshold. | 5. A computer-implemented method according to claim 1 , wherein selecting the fixed phrases comprises: determining a pointwise mutual information score threshold based at least in part on the greatest pointwise mutual information score determined for the topic; and selecting candidate phrases with pointwise mutual information scores greater than the pointwise mutual information score threshold. 6. A computer-implemented method according to claim 5 , wherein the pointwise mutual information score threshold is a specified fraction of the greatest pointwise mutual information score. | 0.913444 |
5,495,603 | 3 | 4 | 3. The method of claim 2 wherein said plurality of file identifiers includes a file name, a file directory and a file storage group. | 3. The method of claim 2 wherein said plurality of file identifiers includes a file name, a file directory and a file storage group. 4. The method of claim 3 wherein said plurality of file characteristics includes a file size designation and one or more file type designations. | 0.939035 |
8,103,510 | 31 | 32 | 31. The non-transitory recording medium according to claim 28 , wherein the computer is incorporated in an on-vehicle device control device so constructed as to be mountable on a vehicle, wherein the process execution means which specifies a content of control to be performed on the on-vehicle device based on the specified content of the uttered speech, and performs the control. | 31. The non-transitory recording medium according to claim 28 , wherein the computer is incorporated in an on-vehicle device control device so constructed as to be mountable on a vehicle, wherein the process execution means which specifies a content of control to be performed on the on-vehicle device based on the specified content of the uttered speech, and performs the control. 32. The non-transitory recording medium according to claim 31 , further storing a program causing the computer to function as: information acquisition means which acquires information via predeteimined communication means; and speech output means which outputs a speech based on the information acquired by the information acquisition means, whereby when the control specified by the process execution means is to output information acquired by the information acquisition means, the speech output means outputs a speech based on the information. | 0.844622 |
5,562,453 | 2 | 3 | 2. A prompt-providing adaptive biofeedback speech tutor system according to claim 1, wherein said input transducer means (2, 3) includes both microphone (2) and voice activated start sequencer (3). | 2. A prompt-providing adaptive biofeedback speech tutor system according to claim 1, wherein said input transducer means (2, 3) includes both microphone (2) and voice activated start sequencer (3). 3. A prompt-providing adaptive biofeedback speech tutor system according to claim 2, wherein said input transducer means (2,3,4) includes microphone (2), voice activated start sequencer (3) and environmental noise filter (4). | 0.917703 |
9,271,130 | 14 | 21 | 14. A method for managing communications across a plurality of identities, the method comprising: receiving, from a first user, a request to create a first account; using a processor to create, in response to one or more indications from the first user, a first profile and a second profile associated with the first account, wherein the first profile comprises a temporary profile that expires after a first length of time; receiving, from the first user, a plurality of messages, wherein the plurality of messages include a first message from the first user to a second user using the first profile, and a second message from the first user to a third user using the second profile; transmitting the plurality of messages from the first user, including by transmitting the first message to the second user using the first profile and the second message to the third user using the second profile; archiving the plurality of messages; determining that the first profile has expired after the first length of time and suspending the expired first profile for a second length of time before the expired first profile can be used by one of the second user, the third user, and a fourth user. | 14. A method for managing communications across a plurality of identities, the method comprising: receiving, from a first user, a request to create a first account; using a processor to create, in response to one or more indications from the first user, a first profile and a second profile associated with the first account, wherein the first profile comprises a temporary profile that expires after a first length of time; receiving, from the first user, a plurality of messages, wherein the plurality of messages include a first message from the first user to a second user using the first profile, and a second message from the first user to a third user using the second profile; transmitting the plurality of messages from the first user, including by transmitting the first message to the second user using the first profile and the second message to the third user using the second profile; archiving the plurality of messages; determining that the first profile has expired after the first length of time and suspending the expired first profile for a second length of time before the expired first profile can be used by one of the second user, the third user, and a fourth user. 21. The method of claim 14 , wherein at least one of the first profile and the second profile comprises a business profile. | 0.849633 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.