sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. A method for adaptive similarity search resolution in a data deduplication system using a processor device in a computing environment, comprising: partitioning input data into input data chunks, the input data chunks each being at least 4 Megabytes (MB) in size; calculating input similarity elements for an input chunk; using the input similarity elements to find similar data in a repository of data using a similarity search structure; calculating a resolution level for storing the input similarity elements, the resolution level comprising a number of the input similarity elements in relation to a size of the input chunk; storing the input similarity elements in the calculated resolution level in the similarity search structure; deduplicating the input chunk with the found similar data in the repository of data using the input similarity units in the calculated resolution level; calculating the resolution level for storing the input similarity elements based on calculated sets of similarity element matches and on a calculated deduplication ratio, the deduplication ratio defined as a total size of the input data covered by matches with repository data out of the total size of the input data; and decreasing the resolution level of the stored input similarity elements if an aggregated deduplication ratio is not lower than a predefined threshold and an average size of the calculated sets of similarity element matches is not lower than two and a current resolution level is higher than a lowest resolution level.
|
1. A method for adaptive similarity search resolution in a data deduplication system using a processor device in a computing environment, comprising: partitioning input data into input data chunks, the input data chunks each being at least 4 Megabytes (MB) in size; calculating input similarity elements for an input chunk; using the input similarity elements to find similar data in a repository of data using a similarity search structure; calculating a resolution level for storing the input similarity elements, the resolution level comprising a number of the input similarity elements in relation to a size of the input chunk; storing the input similarity elements in the calculated resolution level in the similarity search structure; deduplicating the input chunk with the found similar data in the repository of data using the input similarity units in the calculated resolution level; calculating the resolution level for storing the input similarity elements based on calculated sets of similarity element matches and on a calculated deduplication ratio, the deduplication ratio defined as a total size of the input data covered by matches with repository data out of the total size of the input data; and decreasing the resolution level of the stored input similarity elements if an aggregated deduplication ratio is not lower than a predefined threshold and an average size of the calculated sets of similarity element matches is not lower than two and a current resolution level is higher than a lowest resolution level. 6. The method of claim 1 , further including increasing a storage resolution level of similarity elements if an aggregated deduplication ratio is lower than a predefined threshold and a current resolution level is lower than a highest resolution level.
| 0.63509 |
13. The method of claim 9 , wherein the editor interface comprises a panel with one or more graphical elements for modifying website data for the website.
|
13. The method of claim 9 , wherein the editor interface comprises a panel with one or more graphical elements for modifying website data for the website. 14. The method of claim 13 , the method comprising allowing a user to use an input device to drag the editor interface from a first location to a second location.
| 0.927673 |
1. In an integrated multiple data editor of the type which produces a compound document having diverse text and/or non-text objects positioned on the same page or on the preceding or succeeding page of the document, said editor manipulating object sets containing said objects wherein each object set has a data structure for its type including data which points to the previous and next object sets and each object set data structure has a unique identification used in paging data, said object sets each having objects of the same type residing therein and being delineated by displayable icons indicating the object set type, the method of implicitly creating a superblock data structure containing data which points to two or more object set data structures for object sets positioned so that the object sets overlap one another, reside side-by-side or extend above or below one another so that the document may be formatted by manipulating the superblock data structure as a single entity as if it were an object set data structure without taking into consideration the complexity inside the superblock data structure except when a page end decision must be made, the process of implicitly creating said superblock data structure comprising the steps of: selecting a location within a first object set where a second object set is to be added, and adding said second object set at the selected location and creating said superblock data structure as an object set data structure while retaining the data structures of said first and second object sets within said superblock data structure.
|
1. In an integrated multiple data editor of the type which produces a compound document having diverse text and/or non-text objects positioned on the same page or on the preceding or succeeding page of the document, said editor manipulating object sets containing said objects wherein each object set has a data structure for its type including data which points to the previous and next object sets and each object set data structure has a unique identification used in paging data, said object sets each having objects of the same type residing therein and being delineated by displayable icons indicating the object set type, the method of implicitly creating a superblock data structure containing data which points to two or more object set data structures for object sets positioned so that the object sets overlap one another, reside side-by-side or extend above or below one another so that the document may be formatted by manipulating the superblock data structure as a single entity as if it were an object set data structure without taking into consideration the complexity inside the superblock data structure except when a page end decision must be made, the process of implicitly creating said superblock data structure comprising the steps of: selecting a location within a first object set where a second object set is to be added, and adding said second object set at the selected location and creating said superblock data structure as an object set data structure while retaining the data structures of said first and second object sets within said superblock data structure. 4. The method as recited in claim 1 wherein the step of adding comprises the steps of: creating as said second object set a new object set of type text, image, graphics or data; inserting said new object set at said selected location; and linking said new object set of type text, image, graphics or data to said selected location.
| 0.868567 |
1. A method implemented in a computer system for extracting location information from unstructured text by utilizing a language model and a classifier, the method comprising: obtaining, by a computer, the unstructured text; identifying by the computer, via use of the language model and based upon the received unstructured text, a location referred to by the received unstructured text; and determining by the computer, via use of the classifier, whether the location referred to by the received unstructured text is also a physical location from where the received unstructured text was sent; wherein the language model is based upon a source of data that is distinct from the unstructured text.
|
1. A method implemented in a computer system for extracting location information from unstructured text by utilizing a language model and a classifier, the method comprising: obtaining, by a computer, the unstructured text; identifying by the computer, via use of the language model and based upon the received unstructured text, a location referred to by the received unstructured text; and determining by the computer, via use of the classifier, whether the location referred to by the received unstructured text is also a physical location from where the received unstructured text was sent; wherein the language model is based upon a source of data that is distinct from the unstructured text. 11. The method of claim 1 , further comprising outputting, by the computer, at least one of: (a) the location referred to by the received unstructured text; (b) the physical location from where the received unstructured text was sent; and (c) any combination thereof.
| 0.613996 |
3. The apparatus of claim 1 , wherein the pre-existing script is manually generated.
|
3. The apparatus of claim 1 , wherein the pre-existing script is manually generated. 4. The apparatus of claim 3 , wherein the matching engine further: identifies GUI actions that contain keywords and parameters that exist in the pre-existing script; adds the further identified actions to a candidate list; and adds the further identified actions to the new test script if they are determined from the candidate list as possible actions.
| 0.888609 |
1. An electronic device comprising: a touch sensitive screen; a detection component configured to detect a change in physical orientation of the electronic device; and a translator application configured to: in response to the detection component detecting a change in the physical orientation of the electronic device from a first orientation to a second orientation: cause translation of a first text of a first language, entered via a first virtual keyboard on the touch sensitive screen, to a first translated text of a second language, the first virtual keyboard comprising characters of the first language; and cause display, on the touch sensitive screen, of the first translated text and a second virtual keyboard, the second virtual keyboard comprising characters of the second language; and in response to the detection component detecting a change in the physical orientation of the electronic device from the second orientation back to the first orientation: cause translation of a second text of the second language, entered via the second virtual keyboard on the touch sensitive screen, to a second translated text of the first language, and cause display, on the touch sensitive screen, of the second translated text and the first virtual keyboard.
|
1. An electronic device comprising: a touch sensitive screen; a detection component configured to detect a change in physical orientation of the electronic device; and a translator application configured to: in response to the detection component detecting a change in the physical orientation of the electronic device from a first orientation to a second orientation: cause translation of a first text of a first language, entered via a first virtual keyboard on the touch sensitive screen, to a first translated text of a second language, the first virtual keyboard comprising characters of the first language; and cause display, on the touch sensitive screen, of the first translated text and a second virtual keyboard, the second virtual keyboard comprising characters of the second language; and in response to the detection component detecting a change in the physical orientation of the electronic device from the second orientation back to the first orientation: cause translation of a second text of the second language, entered via the second virtual keyboard on the touch sensitive screen, to a second translated text of the first language, and cause display, on the touch sensitive screen, of the second translated text and the first virtual keyboard. 4. The device of claim 1 , wherein: detecting a change in the physical orientation of the electronic device from the first orientation to the second orientation comprises detecting a rotation of the electronic device from the first orientation to the second orientation, wherein the first translated text and the second virtual keyboard are displayed right side up in a landscape view while the electronic device is in the second orientation, and detecting a change in the physical orientation of the electronic from the second orientation back to the first orientation comprises detecting a rotation of the electronic device from the second orientation to the first orientation, wherein the second translated text and the first virtual keyboard are displayed right side up in portrait view while the electronic device is in the first orientation, and the first orientation is a vertical orientation and the second orientation is a horizontal orientation.
| 0.507593 |
1. A device, comprising: a processor; and a memory having instructions stored thereon that, when executed by the processor, cause the processor to perform operations comprising: identifying a sender of a voice message; selecting an abbreviation library associated with the sender of the voice message; producing a text representation of the voice message; and compacting the text representation using the abbreviation library selected to produce a compact text representation, wherein the compact text representation includes an abbreviation from the abbreviation library selected, and an extent to which the voice message is compacted is based on network capacity and a subscriber profile.
|
1. A device, comprising: a processor; and a memory having instructions stored thereon that, when executed by the processor, cause the processor to perform operations comprising: identifying a sender of a voice message; selecting an abbreviation library associated with the sender of the voice message; producing a text representation of the voice message; and compacting the text representation using the abbreviation library selected to produce a compact text representation, wherein the compact text representation includes an abbreviation from the abbreviation library selected, and an extent to which the voice message is compacted is based on network capacity and a subscriber profile. 6. The device of claim 1 , wherein the abbreviation library includes abbreviation rules.
| 0.738235 |
14. A candidate selection system for finding matches between entities, comprising: at least one machine learning system which includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: implement the at least one machine learning system including an input layer, an output layer and a hidden layer, the at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities, the hypothetical alternative pairings based on at least one value of at least one attribute of a plurality of attributes associated with the second entity and at least one loosened constraint of a number of constraints on matching the at least one value of the at least one attribute associated with the second entity; and at least one processor-based system, the at least one processor-based system communicatively coupled to the machine learning system, the at least one processor-based system includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: receive a number of heuristic values indicative of a strength of a pairing between the first entity and at least one of the entities of the first set of entities; and execute a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes to identify prospective candidates within a second set of entities.
|
14. A candidate selection system for finding matches between entities, comprising: at least one machine learning system which includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: implement the at least one machine learning system including an input layer, an output layer and a hidden layer, the at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities, the hypothetical alternative pairings based on at least one value of at least one attribute of a plurality of attributes associated with the second entity and at least one loosened constraint of a number of constraints on matching the at least one value of the at least one attribute associated with the second entity; and at least one processor-based system, the at least one processor-based system communicatively coupled to the machine learning system, the at least one processor-based system includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: receive a number of heuristic values indicative of a strength of a pairing between the first entity and at least one of the entities of the first set of entities; and execute a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes to identify prospective candidates within a second set of entities. 23. The candidate selection system of claim 14 , further comprising: at least a first processor-based server system, communicatively coupled to receive information about the first entity and the second entity, to receive requests for prospective candidates, to provide prospective candidate information to at least some of the entities, and to present a plurality of messages sent to the first entity by other ones of the entities in a ranked order, the ranked order reflecting a strength of a pairing between at least the first entity and the other ones of the entities.
| 0.5 |
26. The computing device of claim 21 , wherein the process of determining the rule includes calculating statistics of special characters from a result of splitting at least some character strings of the unstructured data by a certain unit of length and determining a separator to be included in the parsing rule based on the statistics.
|
26. The computing device of claim 21 , wherein the process of determining the rule includes calculating statistics of special characters from a result of splitting at least some character strings of the unstructured data by a certain unit of length and determining a separator to be included in the parsing rule based on the statistics. 27. The computing device of claim 26 , wherein the statistics of the special characters include at least one of a degree of distribution and frequency of the special characters, and at least one of special characters with a highest statistical value is determined as the separator.
| 0.91699 |
1. A computer-readable storage medium having computer-executable instructions, which when executed perform steps, comprising: a) extracting features from a selected sample of a plurality of samples of digital ink training data, wherein the digital ink training data corresponds to digital ink representative of at least two different types of digital ink input, each of the plurality of samples belong to one of a plurality of classes having combined feature data, and each of the plurality of samples is associated with a label comprising a recognition value; b) processing a feature dataset of the selected sample into a recognition model by adjusting the combined feature data of the class to which the selected sample belongs and maintaining data representative of the features extracted from the selected sample in association with the recognition value associated with the selected sample; c) selecting another sample from the plurality of samples and repeating steps a) and b) until each sample of the plurality of samples has been processed; and d) providing a unified recognizer that recognizes an input item of one of the at least two different types of digital ink input without mode selection or recognition parameter input, the input item being recognized by extracting features of the input item and determining a matching class having combined feature data that best match features of the input item, and outputting a matching recognition value associated with the matching class.
|
1. A computer-readable storage medium having computer-executable instructions, which when executed perform steps, comprising: a) extracting features from a selected sample of a plurality of samples of digital ink training data, wherein the digital ink training data corresponds to digital ink representative of at least two different types of digital ink input, each of the plurality of samples belong to one of a plurality of classes having combined feature data, and each of the plurality of samples is associated with a label comprising a recognition value; b) processing a feature dataset of the selected sample into a recognition model by adjusting the combined feature data of the class to which the selected sample belongs and maintaining data representative of the features extracted from the selected sample in association with the recognition value associated with the selected sample; c) selecting another sample from the plurality of samples and repeating steps a) and b) until each sample of the plurality of samples has been processed; and d) providing a unified recognizer that recognizes an input item of one of the at least two different types of digital ink input without mode selection or recognition parameter input, the input item being recognized by extracting features of the input item and determining a matching class having combined feature data that best match features of the input item, and outputting a matching recognition value associated with the matching class. 2. The computer-readable storage medium of claim 1 wherein maintaining the data representative of the features comprises maintaining information representative of the features corresponding to multiple dimensions.
| 0.58008 |
8. The method of claim 1 , in which the semantic zoom display of the one or more citations is determined based on transformations of the plurality of sections.
|
8. The method of claim 1 , in which the semantic zoom display of the one or more citations is determined based on transformations of the plurality of sections. 10. The method of claim 8 , in which the transformations are performed upon the data comprising at least one of characters, words and phrases contained in the plurality of sections.
| 0.937328 |
17. An accessory device comprising: one or more hardware elements, including a computer processor; one or more executable modules stored as executable instructions that when executed via the computer processor cause the accessory device to perform operations including: supplying data to a host computing device indicative of an identity of the accessory device; exchanging power with the host computing device in accordance with settings defined by an active power contract associated with the identity of the accessory device, the settings including current limits and a power exchange direction; monitoring to detect a change in power exchange conditions between the host computing device and the accessory device; determining whether the change to the power exchange conditions prompts modification of the active power exchange contract and when the change to the power exchange conditions prompts the modification of the active power exchange contract: communicating a power contract update message to the host computing device to adjust the settings, the power contract update message specifying values for the power exchange direction and the current limits based on the power exchange conditions detected by the monitoring; detecting receipt of a power contract update message from the host computing device, the power contract update message indicating changes to the settings of the active power contract and the power contract update message indicating the power exchange conditions that prompt adjusting the settings; and subsequently exchanging the power with the host computing device in accordance with the changes to the settings for the current limits and the power exchange direction defined by an updated active power contract.
|
17. An accessory device comprising: one or more hardware elements, including a computer processor; one or more executable modules stored as executable instructions that when executed via the computer processor cause the accessory device to perform operations including: supplying data to a host computing device indicative of an identity of the accessory device; exchanging power with the host computing device in accordance with settings defined by an active power contract associated with the identity of the accessory device, the settings including current limits and a power exchange direction; monitoring to detect a change in power exchange conditions between the host computing device and the accessory device; determining whether the change to the power exchange conditions prompts modification of the active power exchange contract and when the change to the power exchange conditions prompts the modification of the active power exchange contract: communicating a power contract update message to the host computing device to adjust the settings, the power contract update message specifying values for the power exchange direction and the current limits based on the power exchange conditions detected by the monitoring; detecting receipt of a power contract update message from the host computing device, the power contract update message indicating changes to the settings of the active power contract and the power contract update message indicating the power exchange conditions that prompt adjusting the settings; and subsequently exchanging the power with the host computing device in accordance with the changes to the settings for the current limits and the power exchange direction defined by an updated active power contract. 20. An accessory device as recited in claim 17 , wherein the power exchange conditions include at least an amount of power available to the accessory device via internal and external power supplies.
| 0.509146 |
14. The non-transitory computer-readable storage medium of claim 9 , wherein the method further comprises: assigning a label to a respective vertex in the graph; propagating a label from a first vertex to a second vertex; and identifying a set of vertices associated with the same label.
|
14. The non-transitory computer-readable storage medium of claim 9 , wherein the method further comprises: assigning a label to a respective vertex in the graph; propagating a label from a first vertex to a second vertex; and identifying a set of vertices associated with the same label. 15. The non-transitory computer-readable storage medium of claim 14 , wherein identifying that a number of traversal steps for the second connected component is smaller than the minimum graph traversal threshold comprises determining whether a size of the identified set of vertices is smaller than the minimum graph traversal threshold.
| 0.892894 |
14. A non-transitory computer-readable medium comprising instructions executable by a processor, the instructions for: receiving a plurality of labelled contextual slices derived from contextual data of a user, each labelled contextual slice comprising a time range, a location, and a contextual label indicating a semantic description of the labelled contextual slice, wherein receiving the plurality of labelled contextual slices comprises: receiving a plurality of contextual slices derived from associated context data collected from a plurality of observation sources, each contextual slice is bound by the time range at the location; and for each of the plurality of contextual slices: identifying a set of candidate labels based on context data associated with the contextual slice, the candidate labels each comprising semantic data describing context data associated with the contextual slice, the semantic data selected from a group consisting of venue geography boundary, venue name, venue type, and venue activity name, venue activity location, venue activity popularity and calendar event; ranking the set of candidate labels by likelihood based on a proximity threshold to the venue geography boundary and ordered by the venue activity popularity, the proximity threshold from the centroid location of the venue geography boundary; and applying one or more of the candidate labels to the contextual slice to make one of the plurality of labelled contextual slices; retrieving, from a storage, a contextual pattern specifying a sequence of contextual labels, wherein the sequence includes a plurality of contextual labels with semantic descriptions that when aggregated correspond to a common semantic description; searching the received labelled contextual slices for a temporally contiguous group of contextual slices having the sequence of contextual labels specified by the pattern; identifying, by a processor, the temporally contiguous group of contextual slices as a matching group responsive to the temporally contiguous group of contextual slices having the sequence of contextual labels specified by the pattern and rank; ordering the matching group of labelled contextual slices by rank; grouping the matching group of labelled contextual slices having at least a minimum threshold rank based on visit year; and applying the common semantic description to the ranked matching group of labelled contextual slices as the user's storyline.
|
14. A non-transitory computer-readable medium comprising instructions executable by a processor, the instructions for: receiving a plurality of labelled contextual slices derived from contextual data of a user, each labelled contextual slice comprising a time range, a location, and a contextual label indicating a semantic description of the labelled contextual slice, wherein receiving the plurality of labelled contextual slices comprises: receiving a plurality of contextual slices derived from associated context data collected from a plurality of observation sources, each contextual slice is bound by the time range at the location; and for each of the plurality of contextual slices: identifying a set of candidate labels based on context data associated with the contextual slice, the candidate labels each comprising semantic data describing context data associated with the contextual slice, the semantic data selected from a group consisting of venue geography boundary, venue name, venue type, and venue activity name, venue activity location, venue activity popularity and calendar event; ranking the set of candidate labels by likelihood based on a proximity threshold to the venue geography boundary and ordered by the venue activity popularity, the proximity threshold from the centroid location of the venue geography boundary; and applying one or more of the candidate labels to the contextual slice to make one of the plurality of labelled contextual slices; retrieving, from a storage, a contextual pattern specifying a sequence of contextual labels, wherein the sequence includes a plurality of contextual labels with semantic descriptions that when aggregated correspond to a common semantic description; searching the received labelled contextual slices for a temporally contiguous group of contextual slices having the sequence of contextual labels specified by the pattern; identifying, by a processor, the temporally contiguous group of contextual slices as a matching group responsive to the temporally contiguous group of contextual slices having the sequence of contextual labels specified by the pattern and rank; ordering the matching group of labelled contextual slices by rank; grouping the matching group of labelled contextual slices having at least a minimum threshold rank based on visit year; and applying the common semantic description to the ranked matching group of labelled contextual slices as the user's storyline. 17. The computer-readable medium of claim 14 , wherein the contextual pattern further specifies a threshold likelihood for each contextual label in the sequence and the instructions for identifying the temporally contiguous group of contextual slices as a matching group include instructions for determining that a likelihood of a label of each slice in the temporally contiguous group exceeds the corresponding threshold likelihood.
| 0.606654 |
7. An apparatus, comprising: a storage device configured to store a plurality of portable voice profiles; and a computer-based system coupled to the storage device, the computer-based system including (1) a speech recognition engine configured to convert a voice signal to text, the speech recognition engine including speaker identification logic configured to analyze the voice signal to identify the speaker and then dynamically select a particular portable voice profile associated with the identified speaker, in real-time, from the plurality of portable voice profiles; (2) a local group manager configured to manage access privileges to a local user's portable voice profile according to connections between a local user of the apparatus and other members of a group to which the local user belongs and instructions of the local user; and (3) a local voice profile manager configured to receive the plurality of portable voice profiles, each portable voice profile associated with a speaker and including speaker-dependent data accessible to a plurality of speech recognition engines through an interface, the speaker-dependent data to enhance an accuracy with which each speech recognition engine in the plurality of speech recognition engines recognizes spoken words in a voice signal from a speaker associated with a portable voice profile, wherein at least one of the plurality of portable voice profiles includes data derived from use with a variety of speech recognition engines.
|
7. An apparatus, comprising: a storage device configured to store a plurality of portable voice profiles; and a computer-based system coupled to the storage device, the computer-based system including (1) a speech recognition engine configured to convert a voice signal to text, the speech recognition engine including speaker identification logic configured to analyze the voice signal to identify the speaker and then dynamically select a particular portable voice profile associated with the identified speaker, in real-time, from the plurality of portable voice profiles; (2) a local group manager configured to manage access privileges to a local user's portable voice profile according to connections between a local user of the apparatus and other members of a group to which the local user belongs and instructions of the local user; and (3) a local voice profile manager configured to receive the plurality of portable voice profiles, each portable voice profile associated with a speaker and including speaker-dependent data accessible to a plurality of speech recognition engines through an interface, the speaker-dependent data to enhance an accuracy with which each speech recognition engine in the plurality of speech recognition engines recognizes spoken words in a voice signal from a speaker associated with a portable voice profile, wherein at least one of the plurality of portable voice profiles includes data derived from use with a variety of speech recognition engines. 17. The apparatus of claim 7 , wherein the speaker-dependent data of each portable voice profile includes acoustic characteristics of a speaker associated with the portable voice profile.
| 0.589692 |
1. A system for servicing photon map queries, comprising: a memory storing an acceleration structure including nodes that respectively define surfaces that each spatially bound a respective selection of a plurality of photons spatially located in a 3-D scene, the selections of varying relative granularity, and the nodes arranged in a graph with edges connecting pairs of nodes; a processor configured for executing an interface for accepting photon queries from one or more code modules or shaders, each of the photon queries defining a respective locus, a spatially located volume in the 3-D scene that includes the respective locus, and a maximum number (k) of photons to be returned responsive to the photon query, wherein k>=1; and an acceleration structure traversal resource configured for processing the accepted photon queries by traversing the acceleration structure with collections of photon queries from the accepted photon queries, wherein each collection is associated with one or more nodes of the acceleration structure, the traversal performed, collection-by-collection, for the photon queries by testing each of a plurality of child nodes of the node(s) associated with a selected collection of photon queries for overlap with each of the spatially located volumes of the photon queries of that collection, and updating a status of collections maintained in a memory by referencing each photon query in a respective collection associated with each child node found to overlap with the spatially located volume of that photon query, wherein the acceleration structure traversal resource is operable to identify, as an output of traversal, for each of the photon queries, identifiers for up to k photons that are closest to the locus in the 3-D scene defined by that photon query and within the spatially located volume defined by that photon query.
|
1. A system for servicing photon map queries, comprising: a memory storing an acceleration structure including nodes that respectively define surfaces that each spatially bound a respective selection of a plurality of photons spatially located in a 3-D scene, the selections of varying relative granularity, and the nodes arranged in a graph with edges connecting pairs of nodes; a processor configured for executing an interface for accepting photon queries from one or more code modules or shaders, each of the photon queries defining a respective locus, a spatially located volume in the 3-D scene that includes the respective locus, and a maximum number (k) of photons to be returned responsive to the photon query, wherein k>=1; and an acceleration structure traversal resource configured for processing the accepted photon queries by traversing the acceleration structure with collections of photon queries from the accepted photon queries, wherein each collection is associated with one or more nodes of the acceleration structure, the traversal performed, collection-by-collection, for the photon queries by testing each of a plurality of child nodes of the node(s) associated with a selected collection of photon queries for overlap with each of the spatially located volumes of the photon queries of that collection, and updating a status of collections maintained in a memory by referencing each photon query in a respective collection associated with each child node found to overlap with the spatially located volume of that photon query, wherein the acceleration structure traversal resource is operable to identify, as an output of traversal, for each of the photon queries, identifiers for up to k photons that are closest to the locus in the 3-D scene defined by that photon query and within the spatially located volume defined by that photon query. 5. The system of claim 1 , wherein the interface comprises an emit photon call that accepts, from a first code module executing on a processor, arbitrary data to be associated with a first photon query, the arbitrary data made available for use by a second code module identified by resolving a second photon query to identify one or more photons satisfying the second photon query.
| 0.550801 |
1. A method for managing a view-size of an electronic document and useful for displaying information on a display device, comprising: providing a user interface window; displaying at least a portion of the electronic document in the user interface window; storing a viewable document section corresponding to the view-size of the electronic document, wherein the viewable document section includes boundary information cumulative of only portions of the electronic document that have previously been displayed in the user interface window; providing a first system that enables a user to change a size of the user interface window, wherein, responsive to the user interface window being enlarged, the stored boundary information in the viewable document section is adjusted based on a new portion of the electronic document displayed in the user interface window that was not previously displayed in the user interface window; and providing the viewable document section with an additional input to include information indicative of a registering activity of any digitizing user-input at an outer portion of the user interface window that associates a user-input extending beyond the outer portion of the user interface window, while suppressing any scrolling view handle display or similar scroll bar display.
|
1. A method for managing a view-size of an electronic document and useful for displaying information on a display device, comprising: providing a user interface window; displaying at least a portion of the electronic document in the user interface window; storing a viewable document section corresponding to the view-size of the electronic document, wherein the viewable document section includes boundary information cumulative of only portions of the electronic document that have previously been displayed in the user interface window; providing a first system that enables a user to change a size of the user interface window, wherein, responsive to the user interface window being enlarged, the stored boundary information in the viewable document section is adjusted based on a new portion of the electronic document displayed in the user interface window that was not previously displayed in the user interface window; and providing the viewable document section with an additional input to include information indicative of a registering activity of any digitizing user-input at an outer portion of the user interface window that associates a user-input extending beyond the outer portion of the user interface window, while suppressing any scrolling view handle display or similar scroll bar display. 3. A method according to claim 1 , wherein the electronic document includes electronic ink data.
| 0.719923 |
6. A computer implemented method for motivating community members to work with content editors to improve and add to editorially-controlled content, wherein a program stored on a non-transitory computer-readable storage medium instructs a processor to perform the method comprising the steps of: a computer authorizing at least one member in an online community to view an at least one category of editorially-controlled content, viewing at least one published comment on said at least one category from a member of said group, a computer adding at least one additional comment to said at least one category, a computer adding at least one further comment to an at least one published comment and rating said published comment, wherein said computer published comment is operable to motivate community evolvement toward the evolution and improvement of said editorially-controlled content; a computer authorizing a first editor of said group in said online community to publish said at least one category of editorially-controlled content, said computer incorporating said additional and further comment into said at least one category of editorially-controlled content; a computer generating a rating of said published comment, said rating being determined at least based upon inputs received from a reviewing member of said online community, wherein said computer generated rating is further based on the number of times or length of time said published comment was viewed; a computer assigning points within a predefined range for ratings of said comments exceeding a predetermined level to a member contributing said additional comment and a member contributing said further comment, in which said assigned points identify subject matter expertise for said member contributing additional comments and said member contributing further comments in said category, wherein said ratings are thereby operable to lessen the work required by said editor and instead utilize members of said online community to identify comments that warrant a review; a computer receiving said additional comments from a contributing member of said group; a computer authorizing said first editor to review said additional comments to determine suitability for incorporation of said additional comments into said at least one category of editorially-controlled content and determining whether to award points to said contributing member within a second predefined range; a computer receiving suitable additional comments from said first editor and incorporating them into said at least one category of editorially-controlled content and publishing an edited category of editorially-controlled content wherein said suitable additional comments improves the content of said at least one category; and a computer determining and assigning contribution points to at least one member of said group, determination of said contribution points being based at least in part on their awarded points and rating of their published comments in which said awarded points are capped by a maximum number assigned to said editorially-controlled content, wherein contribution points earned by said member beyond said capped points for said content is not awarded and recognized.
|
6. A computer implemented method for motivating community members to work with content editors to improve and add to editorially-controlled content, wherein a program stored on a non-transitory computer-readable storage medium instructs a processor to perform the method comprising the steps of: a computer authorizing at least one member in an online community to view an at least one category of editorially-controlled content, viewing at least one published comment on said at least one category from a member of said group, a computer adding at least one additional comment to said at least one category, a computer adding at least one further comment to an at least one published comment and rating said published comment, wherein said computer published comment is operable to motivate community evolvement toward the evolution and improvement of said editorially-controlled content; a computer authorizing a first editor of said group in said online community to publish said at least one category of editorially-controlled content, said computer incorporating said additional and further comment into said at least one category of editorially-controlled content; a computer generating a rating of said published comment, said rating being determined at least based upon inputs received from a reviewing member of said online community, wherein said computer generated rating is further based on the number of times or length of time said published comment was viewed; a computer assigning points within a predefined range for ratings of said comments exceeding a predetermined level to a member contributing said additional comment and a member contributing said further comment, in which said assigned points identify subject matter expertise for said member contributing additional comments and said member contributing further comments in said category, wherein said ratings are thereby operable to lessen the work required by said editor and instead utilize members of said online community to identify comments that warrant a review; a computer receiving said additional comments from a contributing member of said group; a computer authorizing said first editor to review said additional comments to determine suitability for incorporation of said additional comments into said at least one category of editorially-controlled content and determining whether to award points to said contributing member within a second predefined range; a computer receiving suitable additional comments from said first editor and incorporating them into said at least one category of editorially-controlled content and publishing an edited category of editorially-controlled content wherein said suitable additional comments improves the content of said at least one category; and a computer determining and assigning contribution points to at least one member of said group, determination of said contribution points being based at least in part on their awarded points and rating of their published comments in which said awarded points are capped by a maximum number assigned to said editorially-controlled content, wherein contribution points earned by said member beyond said capped points for said content is not awarded and recognized. 7. The method as recited in claim 6 , in which said awarded points represents an accumulation of ratings.
| 0.515802 |
5. The system as recited in claim 1 , wherein the transaction phrase token processing service updates the processing information based upon receipt of an approval by the transaction phrase token holder corresponding to the transaction phrase token.
|
5. The system as recited in claim 1 , wherein the transaction phrase token processing service updates the processing information based upon receipt of an approval by the transaction phrase token holder corresponding to the transaction phrase token. 7. The system as recited in claim 5 , wherein the approval instructs the transaction phrase token processing service to automatically accept subsequent transactions with an item associated with a request to complete a transaction.
| 0.942279 |
1. A system, comprising: a processor; and a memory operatively coupled to the processor, the memory storing processor-readable instructions executable by the processor to: receive a data analytics request including a user desired data variable via a user interface; receive, via the user interface, user configured parameters identifying a plurality of user selected data sources and a plurality of user defined data fields for a new data set, a user defined data field from the plurality of user defined data fields representing a logic operation, each data source of the user selected data sources being a separate data source with a data structure schema different from a data structure schema of each of a remaining data source from the user selected data sources; generate an intermediate query based on the data analytics request; define an execution path for the intermediate query, the execution path including locations for a plurality of schema-independent distributed index files located on a plurality of distributed server node engines; transmit, substantially simultaneously, the intermediate query to each distributed service node engine of the plurality of distributed server node engines so as to instruct that distributed server node engine to run the intermediate query, using a schema-independent distributed index file from the plurality of schema-independent distributed index files that is stored at that distributed server node engine; receive intermediate query results from each distributed service node engine of the plurality of distributed server node engines based on the intermediate query; form the new data set based at least in part on the intermediate query results and on a relationship between the plurality of user selected data sources and the plurality of user defined data fields; query the new data set to obtain a first value relating to the user desired data variable; calculate an output value for the user desired data variable based on the first value and the logic operation; and send a signal to generate a user interactive graphical representation of the output value of user desired data variable.
|
1. A system, comprising: a processor; and a memory operatively coupled to the processor, the memory storing processor-readable instructions executable by the processor to: receive a data analytics request including a user desired data variable via a user interface; receive, via the user interface, user configured parameters identifying a plurality of user selected data sources and a plurality of user defined data fields for a new data set, a user defined data field from the plurality of user defined data fields representing a logic operation, each data source of the user selected data sources being a separate data source with a data structure schema different from a data structure schema of each of a remaining data source from the user selected data sources; generate an intermediate query based on the data analytics request; define an execution path for the intermediate query, the execution path including locations for a plurality of schema-independent distributed index files located on a plurality of distributed server node engines; transmit, substantially simultaneously, the intermediate query to each distributed service node engine of the plurality of distributed server node engines so as to instruct that distributed server node engine to run the intermediate query, using a schema-independent distributed index file from the plurality of schema-independent distributed index files that is stored at that distributed server node engine; receive intermediate query results from each distributed service node engine of the plurality of distributed server node engines based on the intermediate query; form the new data set based at least in part on the intermediate query results and on a relationship between the plurality of user selected data sources and the plurality of user defined data fields; query the new data set to obtain a first value relating to the user desired data variable; calculate an output value for the user desired data variable based on the first value and the logic operation; and send a signal to generate a user interactive graphical representation of the output value of user desired data variable. 8. The method of claim 1 , wherein the user interactive graphical representation includes an engageable widget triggered to show an option of the user submitted query result parameter.
| 0.544045 |
1. A method of detecting a missing case of a fixed scope among a plurality of business rules of unrestricted forms, said method comprising: building a rule inhibition graph for each of the plurality of business rules, wherein each rule inhibition graph describes one or more cases that do not satisfy a condition of the rule; building a rules inhibition graph based on the rule inhibition graphs that were built for the plurality of business rules, said rules inhibition graph representing a constraint model comprising a plurality of nodes and describing a plurality of cases which make the plurality of business rules non-applicable; labeling the rules inhibition graph with values satisfying constraints of said constraint model utilizing search and inference procedures; and determining a missing case when a consistent labeling satisfying the constraints of said constraints model is obtained pursuant to labeling of the rules inhibition graph, wherein the missing case is a case that does not satisfy a condition of any of the plurality of business rules.
|
1. A method of detecting a missing case of a fixed scope among a plurality of business rules of unrestricted forms, said method comprising: building a rule inhibition graph for each of the plurality of business rules, wherein each rule inhibition graph describes one or more cases that do not satisfy a condition of the rule; building a rules inhibition graph based on the rule inhibition graphs that were built for the plurality of business rules, said rules inhibition graph representing a constraint model comprising a plurality of nodes and describing a plurality of cases which make the plurality of business rules non-applicable; labeling the rules inhibition graph with values satisfying constraints of said constraint model utilizing search and inference procedures; and determining a missing case when a consistent labeling satisfying the constraints of said constraints model is obtained pursuant to labeling of the rules inhibition graph, wherein the missing case is a case that does not satisfy a condition of any of the plurality of business rules. 6. The method of claim 1 wherein said search and inference procedures include at least one of: deriving basic forms of constraints, wherein said constraints include quantifier-free constraints; propagating arithmetic intervals; propagating Boolean truth values; propagating equality; deriving bounds from linear relaxations; chronological backtracking dependency-directed backtracking; and clause learning.
| 0.5 |
1. A computer implemented method for evaluating potential confusion within a grammar structure for a set of statements to be used in speech recognition during a computing event, comprising: receiving a plurality of statements from within a grammar structure, each of the plurality of statements formed by a number of word sets; identifying a number of alignment regions across the plurality of statements by aligning the plurality of statements on a word set basis, wherein each aligned word set represents an alignment region; identifying a number of potential confusion zones across the plurality of statements, wherein each potential confusion zone is defined by words from two or more of the plurality of statements at corresponding positions outside the number of alignment regions; for each of the identified potential confusion zones, analyzing using a computer phonetic pronunciations of the words within the potential confusion zone to determine a measure of confusion probability between the words when audibly processed by a speech recognition system during the computing event; and generating, using the computer, a report to convey an identity of the potential confusion zones across the plurality of statements and their corresponding measure of confusion probability.
|
1. A computer implemented method for evaluating potential confusion within a grammar structure for a set of statements to be used in speech recognition during a computing event, comprising: receiving a plurality of statements from within a grammar structure, each of the plurality of statements formed by a number of word sets; identifying a number of alignment regions across the plurality of statements by aligning the plurality of statements on a word set basis, wherein each aligned word set represents an alignment region; identifying a number of potential confusion zones across the plurality of statements, wherein each potential confusion zone is defined by words from two or more of the plurality of statements at corresponding positions outside the number of alignment regions; for each of the identified potential confusion zones, analyzing using a computer phonetic pronunciations of the words within the potential confusion zone to determine a measure of confusion probability between the words when audibly processed by a speech recognition system during the computing event; and generating, using the computer, a report to convey an identity of the potential confusion zones across the plurality of statements and their corresponding measure of confusion probability. 3. A computer implemented method as recited in claim 1 , wherein each word set includes one or more words.
| 0.651341 |
26. The computer-readable medium of claim 23 , wherein the shape size and the shape position for each shape in the graphic are defined by the one or more algorithms utilizing constraints and constraint rules.
|
26. The computer-readable medium of claim 23 , wherein the shape size and the shape position for each shape in the graphic are defined by the one or more algorithms utilizing constraints and constraint rules. 27. The computer-readable medium of claim 26 , wherein the constraints comprise one or more numeric constraints for use by the one or more algorithms, and wherein a numeric constraint represents a numeric value.
| 0.907969 |
10. A method comprising: storing an extension file configured to perform an action with respect to a browser application during rendering therewith of a page using a page script associated with a page model, the extension file associated with a content script configured to interact with the page model during rendering of the page sript to provide the page; loading the page script, including the page model, into a page script execution environment within a rendering environment of the browser application, the page script execution environment having a page script namespace; implementing a content script execution environment within the rendering environment of the browser application, using a copy of the page model within a content script namespac; wherein communication between the content script execution environment and the page script execution environment is restricted to a one-way direction from the content script execution environment to the page script execution environment; initiating the action using the content script within the content script execution environment; sending a message to the extension file to implement the action; and performing the action using the extension file and in conjunction with the rendering of the page.
|
10. A method comprising: storing an extension file configured to perform an action with respect to a browser application during rendering therewith of a page using a page script associated with a page model, the extension file associated with a content script configured to interact with the page model during rendering of the page sript to provide the page; loading the page script, including the page model, into a page script execution environment within a rendering environment of the browser application, the page script execution environment having a page script namespace; implementing a content script execution environment within the rendering environment of the browser application, using a copy of the page model within a content script namespac; wherein communication between the content script execution environment and the page script execution environment is restricted to a one-way direction from the content script execution environment to the page script execution environment; initiating the action using the content script within the content script execution environment; sending a message to the extension file to implement the action; and performing the action using the extension file and in conjunction with the rendering of the page. 12. The method of claim 10 , wherein the content script execution environment is not accessible by the page script.
| 0.894161 |
9. A web analytics server system, comprising: a processor; a memory which is interoperable with the processor; reception code configuring the memory and capable of controlling the processor to make the server system receive a web-beacon request and a dynamic variable specification, wherein the dynamic variable specification was built, at least partially, at a web-reading device for inclusion in a transmission of the web-beacon request, and wherein the dynamic variable specification comprises identification of: one or more dynamic data variables; and for each of the one or more dynamic data variables, a data source from which to collect a data value corresponding to the respective dynamic data variable identified; and interpretation code configuring the memory and capable of controlling the processor to cause the server system to interpret the dynamic variable specification, wherein interpreting the dynamic variable specification comprises: collecting, from the data source identified by the dynamic variable specification, the data value corresponding to each of the one or more dynamic data variables identified; and assigning each data value collected to the corresponding dynamic data variable identified.
|
9. A web analytics server system, comprising: a processor; a memory which is interoperable with the processor; reception code configuring the memory and capable of controlling the processor to make the server system receive a web-beacon request and a dynamic variable specification, wherein the dynamic variable specification was built, at least partially, at a web-reading device for inclusion in a transmission of the web-beacon request, and wherein the dynamic variable specification comprises identification of: one or more dynamic data variables; and for each of the one or more dynamic data variables, a data source from which to collect a data value corresponding to the respective dynamic data variable identified; and interpretation code configuring the memory and capable of controlling the processor to cause the server system to interpret the dynamic variable specification, wherein interpreting the dynamic variable specification comprises: collecting, from the data source identified by the dynamic variable specification, the data value corresponding to each of the one or more dynamic data variables identified; and assigning each data value collected to the corresponding dynamic data variable identified. 14. The system of claim 9 , further comprising an analytics data facility configured to store the data value collected in association with the corresponding dynamic data variable identified.
| 0.844968 |
7. The method of claim 1 , wherein the received data value comprises a recipient email address.
|
7. The method of claim 1 , wherein the received data value comprises a recipient email address. 8. The method of claim 7 , wherein the one or more use rules limit the sender email address that can send an email to the recipient email address.
| 0.951407 |
15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: receiving data encoding sounds produced by a human voice; extracting a monophonic melody line from an audio channel of the data encoding the sounds produced by the human voice; providing, to a recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice; comparing, at the recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice with one or more monophonic melody lines of candidate videos of a subset of a set of candidate videos that are each (i) identified as being associated with a particular song, and (ii) are classified as a cappella video recordings; determining, based on the comparison, that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset; and in response to determining that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset, providing an identifier of the particular song for output.
|
15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: receiving data encoding sounds produced by a human voice; extracting a monophonic melody line from an audio channel of the data encoding the sounds produced by the human voice; providing, to a recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice; comparing, at the recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice with one or more monophonic melody lines of candidate videos of a subset of a set of candidate videos that are each (i) identified as being associated with a particular song, and (ii) are classified as a cappella video recordings; determining, based on the comparison, that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset; and in response to determining that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset, providing an identifier of the particular song for output. 19. The computer-readable medium of claim 15 , wherein the a cappella video recordings include audio portions of one or more persons producing vocal sounds without instrumental sound.
| 0.818955 |
16. At least one server, comprising: at least one non-transitory computer readable storage medium configured to store: a mapping of values to sets of evidences U in a knowledge base, and objects in the form E→A, where A is a rule among rules in the knowledge base, and E is a subset of the sets of evidences U from the knowledge base that supports the rule A, so that the rule A is supportable by the subset of evidences E; and at least one hardware processor coupled to the at least one memory to execute instructions stored in the at least one memory, which instructions when executed by the at least one hardware processor, cause the at least one server: determine relationship constraints κ in form of set relations among a plurality of subsets of evidences E; and in response to at least one request, compute for a target rule L, a first composite object with respect to validity (v) ω 1 v =G 1 →L 0 and/or with respect to plausibility (p), ω 1 p =G 1 →L 0 , the first composite object ω 1 v or ω 1 p constructed from a combination of the objects E→A to create a composite sets of evidences G 1 v or G 1 p subject to the relationship constraints κ which support a composite rule L 0 v or L 0 p , the composite rule L 0 v or L 0 p being a combination of the rules implying the target rule L according to deductive reasoning indicated by the mapping of the values to the sets of evidences U, the first composite object ω 1 v or ω 1 p indicative according to the deductive reasoning of a first validity value or a first plausibility value for the target rule L.
|
16. At least one server, comprising: at least one non-transitory computer readable storage medium configured to store: a mapping of values to sets of evidences U in a knowledge base, and objects in the form E→A, where A is a rule among rules in the knowledge base, and E is a subset of the sets of evidences U from the knowledge base that supports the rule A, so that the rule A is supportable by the subset of evidences E; and at least one hardware processor coupled to the at least one memory to execute instructions stored in the at least one memory, which instructions when executed by the at least one hardware processor, cause the at least one server: determine relationship constraints κ in form of set relations among a plurality of subsets of evidences E; and in response to at least one request, compute for a target rule L, a first composite object with respect to validity (v) ω 1 v =G 1 →L 0 and/or with respect to plausibility (p), ω 1 p =G 1 →L 0 , the first composite object ω 1 v or ω 1 p constructed from a combination of the objects E→A to create a composite sets of evidences G 1 v or G 1 p subject to the relationship constraints κ which support a composite rule L 0 v or L 0 p , the composite rule L 0 v or L 0 p being a combination of the rules implying the target rule L according to deductive reasoning indicated by the mapping of the values to the sets of evidences U, the first composite object ω 1 v or ω 1 p indicative according to the deductive reasoning of a first validity value or a first plausibility value for the target rule L. 20. The at least one server according to claim 16 , wherein the at least one hardware processor further: creates a new knowledge base including complements of the objects E→A; computes for a negated target rule L′ of the target rule L, subject to the relationship constraints κ , a second composite object with respect to validity ω 2 v −=G 2 →L 1 , and/or with respect to plausibility ω 2 p −=G 2 →L 1 , the second composite object ω 2 v or ω 2 p constructed from a combination of the complements of the objects E→A to create a composite sets of evidences G 2 v or G 2 p subject to the relationship constraints κ which support a composite rule L 1 v or L 1 p , the composite rule L 1 v or L 1 p being a combination of negated rules L′ implying the target rule L according to inductive reasoning using the new knowledge base, the second composite object ω 2 v or ω 2 p indicative according to inductive reasoning of a third validity or a third plausibility value for the target rule L using the new knowledge base.
| 0.5 |
1. A method in a host organization having at least a processor and a memory therein to execute instructions, the method comprising: receiving a request at the host organization from a user device to display a tabular dataset; retrieving the tabular dataset from a database system executing at the host organization; displaying the tabular dataset as output to the user device, the displayed output including a plurality of data values depicted as known values and a plurality of null values depicted as unknown values; receiving input from the user device to populate the tabular dataset to a specified fill percentage; querying the database system for predicted values to populate a portion of the null values of the tabular dataset, wherein querying the database system comprises issuing a PREDICT command term and passing as a parameter one or more specified columns of the tabular dataset to be predicted; receiving a distribution for every one of the plurality of null values within the tabular dataset responsive to querying the indices for the predicted values; calculating a credible interval for each distribution received; populating the portion of the null values of the tabular dataset with the predicted values until the specified fill percentage is reached; and displaying the tabular dataset having the predicted values populated therein as updated output to the user device by displaying selected ones of the predicted values that correspond to a calculated credible interval in excess of a minimum threshold.
|
1. A method in a host organization having at least a processor and a memory therein to execute instructions, the method comprising: receiving a request at the host organization from a user device to display a tabular dataset; retrieving the tabular dataset from a database system executing at the host organization; displaying the tabular dataset as output to the user device, the displayed output including a plurality of data values depicted as known values and a plurality of null values depicted as unknown values; receiving input from the user device to populate the tabular dataset to a specified fill percentage; querying the database system for predicted values to populate a portion of the null values of the tabular dataset, wherein querying the database system comprises issuing a PREDICT command term and passing as a parameter one or more specified columns of the tabular dataset to be predicted; receiving a distribution for every one of the plurality of null values within the tabular dataset responsive to querying the indices for the predicted values; calculating a credible interval for each distribution received; populating the portion of the null values of the tabular dataset with the predicted values until the specified fill percentage is reached; and displaying the tabular dataset having the predicted values populated therein as updated output to the user device by displaying selected ones of the predicted values that correspond to a calculated credible interval in excess of a minimum threshold. 8. The method of claim 1 : wherein displaying the tabular dataset having the predicted values populated therein as updated output to the user device comprises displaying the updated output within a spreadsheet or table at a Graphical User Interface (GUI); wherein the known values are displayed as populated cells within the spreadsheet or table at the GUI in a first type of text; wherein predicted values are displayed as populated cells within the spreadsheet or table at the GUI in a second type of text discernable from the first type of text corresponding to the known values; and wherein any remaining unknown values are displayed as empty cells within the spreadsheet or table at the GUI.
| 0.569023 |
1. A computer-implemented method, comprising: identifying, via at least a first processor, a plurality of records associated with a cluster identifier in a local search data repository, where the plurality of records include a first record storing contact information and a plurality of records storing web site addresses; using a web site address stored in at least one of the plurality of records associated with the cluster identifier to obtain candidate contact information if a size of a website that includes the web site address is smaller than a predetermined size, where the size of the web site is determined by a number of web pages for the web site; determining whether the candidate contact information matches the contact information stored in the first record; and storing information associated with the cluster identifier with the web site address in a web search index when the candidate contact information matches the contact information stored in the first record.
|
1. A computer-implemented method, comprising: identifying, via at least a first processor, a plurality of records associated with a cluster identifier in a local search data repository, where the plurality of records include a first record storing contact information and a plurality of records storing web site addresses; using a web site address stored in at least one of the plurality of records associated with the cluster identifier to obtain candidate contact information if a size of a website that includes the web site address is smaller than a predetermined size, where the size of the web site is determined by a number of web pages for the web site; determining whether the candidate contact information matches the contact information stored in the first record; and storing information associated with the cluster identifier with the web site address in a web search index when the candidate contact information matches the contact information stored in the first record. 4. The method of claim 1 , where the information associated with the cluster identifier is stored with the web site address in the web search index when the candidate contact information matches the contact information stored in the first record.
| 0.779857 |
13. The method of claim 1 , further comprising determining, based at least in part on the transcript and the information associated with the decode, a modification of the speech recognizer to improve its performance.
|
13. The method of claim 1 , further comprising determining, based at least in part on the transcript and the information associated with the decode, a modification of the speech recognizer to improve its performance. 17. The method of claim 13 , wherein the modification comprises modifying a call flow.
| 0.881684 |
1. A method, comprising: a computer system receiving, via a web interface, a subscription preference relating to one or more message topics and a telephone number corresponding to a portable communication device capable of receiving text messages; in response to receiving the telephone number, the computer system generating an authorization code and causing a text message including the authorization code to be sent to the telephone number; receiving at the computer system, via the web interface, input that includes the authorization code; and in response to authenticating the authorization code, the computer system storing the subscription preference relating to the one or more message topics on a non-transitory computer readable storage medium, wherein the stored subscription preference indicates the computer system has permission to cause one or more text messages that include content directed to the one or more message topics to be sent to the telephone number corresponding to the portable communication device.
|
1. A method, comprising: a computer system receiving, via a web interface, a subscription preference relating to one or more message topics and a telephone number corresponding to a portable communication device capable of receiving text messages; in response to receiving the telephone number, the computer system generating an authorization code and causing a text message including the authorization code to be sent to the telephone number; receiving at the computer system, via the web interface, input that includes the authorization code; and in response to authenticating the authorization code, the computer system storing the subscription preference relating to the one or more message topics on a non-transitory computer readable storage medium, wherein the stored subscription preference indicates the computer system has permission to cause one or more text messages that include content directed to the one or more message topics to be sent to the telephone number corresponding to the portable communication device. 4. The method of claim 1 , further comprising sending a targeted message to a plurality of telephone numbers in first and second subscriber groups, wherein the first and second subscriber groups correspond to different topics, and wherein at least one of the plurality of telephone numbers is in the second subscriber group but not the first subscriber group.
| 0.554313 |
4. A method comprising: causing, at least in part, transmission of a notification of context change requiring update of a database of a user terminal, wherein the database stores a plurality of phrases corresponding to a particular language and the update includes one or more phrases, corresponding to one or more of the plurality of phrases, to be added to the database based at least upon a present or anticipated context; and causing, at least in part, reception of the update to the database at the user terminal in response to the notification, wherein one or more of the one or more phrases comprise a string of words, wherein the update further includes at least one phrase to be added to the database that is based, at least in part, on a detected environmental condition, and wherein the update further specifies removal of one or more phrases corresponding to the particular language that is determined to be irrelevant based, at least in part, on the context change.
|
4. A method comprising: causing, at least in part, transmission of a notification of context change requiring update of a database of a user terminal, wherein the database stores a plurality of phrases corresponding to a particular language and the update includes one or more phrases, corresponding to one or more of the plurality of phrases, to be added to the database based at least upon a present or anticipated context; and causing, at least in part, reception of the update to the database at the user terminal in response to the notification, wherein one or more of the one or more phrases comprise a string of words, wherein the update further includes at least one phrase to be added to the database that is based, at least in part, on a detected environmental condition, and wherein the update further specifies removal of one or more phrases corresponding to the particular language that is determined to be irrelevant based, at least in part, on the context change. 5. A method of claim 4 , further comprising: detecting whether stored phrases corresponding to the particular language cover the present or anticipated context of the user terminal.
| 0.594926 |
9. In a method of encoding equal word length digital signals which includes converting those equal word length digital signals which are within a predetermined signal range to code words of different length and labeling those equal word length digital signals which are outside said predetermined signal range with a single code word which is of a length which is different than each of said different length code words, the improvement comprising, implementing the converting and labeling step by use of a code wherein each of the different length code words includes a single 1 bit at one end bit position thereof.
|
9. In a method of encoding equal word length digital signals which includes converting those equal word length digital signals which are within a predetermined signal range to code words of different length and labeling those equal word length digital signals which are outside said predetermined signal range with a single code word which is of a length which is different than each of said different length code words, the improvement comprising, implementing the converting and labeling step by use of a code wherein each of the different length code words includes a single 1 bit at one end bit position thereof. 10. In a method of encoding digital signals as defined in claim 9 wherein the single 1 bit of the code words is located at the least significant bit position thereof.
| 0.702731 |
1. A method comprising: receiving, by at least one computing device, a request for one or more advertisements, each advertisement comprising content that is to be served for display in an initial web page; selecting, by the at least one computing device, one or more keyword candidates from the initial web page; performing, by the at least one computing device, a first query of a network for a first set of web pages containing a first keyword candidate from the one or more keyword candidates, the first query being performed using the first keyword candidate; identifying, by the at least one computing device, a contextual relevancy of the first keyword candidate to the initial web page by analyzing one or more of the web pages of the first set of web pages returned by the first query performed using the first keyword candidate; selecting, by the at least one computing device, one or more representative keywords from the one or more keyword candidates using the contextual relevancy of the first keyword candidate to the initial web page; selecting, by the at least one computing device in response to the request, the one or more advertisements using the one or more representative keywords selected using the identified contextual relevancy of the first keyword candidate to the initial web page; and transmitting, by the at least one computing device, the selected advertisement such that the selected advertisement is served for display with the initial web page.
|
1. A method comprising: receiving, by at least one computing device, a request for one or more advertisements, each advertisement comprising content that is to be served for display in an initial web page; selecting, by the at least one computing device, one or more keyword candidates from the initial web page; performing, by the at least one computing device, a first query of a network for a first set of web pages containing a first keyword candidate from the one or more keyword candidates, the first query being performed using the first keyword candidate; identifying, by the at least one computing device, a contextual relevancy of the first keyword candidate to the initial web page by analyzing one or more of the web pages of the first set of web pages returned by the first query performed using the first keyword candidate; selecting, by the at least one computing device, one or more representative keywords from the one or more keyword candidates using the contextual relevancy of the first keyword candidate to the initial web page; selecting, by the at least one computing device in response to the request, the one or more advertisements using the one or more representative keywords selected using the identified contextual relevancy of the first keyword candidate to the initial web page; and transmitting, by the at least one computing device, the selected advertisement such that the selected advertisement is served for display with the initial web page. 3. The method of claim 1 wherein: the one or more of keyword candidates are selected via a weighted assessment of the initial webpage title and proper nouns in the initial webpage.
| 0.615364 |
21. One or more computer-readable storage medium having computer-executable components for providing metadata associated with media content and stored in a database on a first computing device, said components comprising: a user interface component of a media player for enabling a user of a second computing device to select a media file stored on the second computing device, said media file storing media content; an interface component for receiving, from the second computing device, a request comprising an item of initial metadata identified by the selected media file stored on said second computing device, said media file storing media content, wherein said request is in response to the user selecting the media file; a tokenizer component for extracting one or more tokens from the item of initial metadata in the request received by the interface component, each of said extracted tokens representing a portion of the item of initial metadata, said tokenizer component further selecting a plurality of the extracted tokens to create a token group; a weighting component for assigning a weight to each of the extracted tokens, said assigned weight corresponding to a frequency of occurrence of the extracted token in the metadata stored in the database; and a query component for searching the database on the first computing device for additional metadata associated with the media content using the token group created by the tokenizer component and for providing the additional metadata from the database on the first computing device to the second computing device, wherein searching the database comprises generating a list of items of media content ordered according to the assigned weights of the extracted tokens, wherein the second computing device updates metadata associated with the media file stored on the second computing device with the additional metadata from the database, wherein the request comprises a plurality of items of initial metadata each corresponding to one of a plurality of categories, and wherein the query component searches the database based on the items corresponding to one of the categories, wherein the query component further performs additional searching based on the items corresponding to at least one of the other categories, and wherein the query component produces additional metadata relating to a single item of media content and further identifies the additional metadata and the single item of media content to the second computing device.
|
21. One or more computer-readable storage medium having computer-executable components for providing metadata associated with media content and stored in a database on a first computing device, said components comprising: a user interface component of a media player for enabling a user of a second computing device to select a media file stored on the second computing device, said media file storing media content; an interface component for receiving, from the second computing device, a request comprising an item of initial metadata identified by the selected media file stored on said second computing device, said media file storing media content, wherein said request is in response to the user selecting the media file; a tokenizer component for extracting one or more tokens from the item of initial metadata in the request received by the interface component, each of said extracted tokens representing a portion of the item of initial metadata, said tokenizer component further selecting a plurality of the extracted tokens to create a token group; a weighting component for assigning a weight to each of the extracted tokens, said assigned weight corresponding to a frequency of occurrence of the extracted token in the metadata stored in the database; and a query component for searching the database on the first computing device for additional metadata associated with the media content using the token group created by the tokenizer component and for providing the additional metadata from the database on the first computing device to the second computing device, wherein searching the database comprises generating a list of items of media content ordered according to the assigned weights of the extracted tokens, wherein the second computing device updates metadata associated with the media file stored on the second computing device with the additional metadata from the database, wherein the request comprises a plurality of items of initial metadata each corresponding to one of a plurality of categories, and wherein the query component searches the database based on the items corresponding to one of the categories, wherein the query component further performs additional searching based on the items corresponding to at least one of the other categories, and wherein the query component produces additional metadata relating to a single item of media content and further identifies the additional metadata and the single item of media content to the second computing device. 24. The computer-readable storage medium of claim 21 , wherein the categories comprise at least one of the following: album title, artist name, and song title.
| 0.527047 |
31. The method of claim 22 , wherein delivering the user-requested pages further comprises: delivering the user-requested pages of said specific document in a low resolution format sufficient for permitting viewing and selecting by a user but not sufficient for acceptable printing, copying, or saving by the user.
|
31. The method of claim 22 , wherein delivering the user-requested pages further comprises: delivering the user-requested pages of said specific document in a low resolution format sufficient for permitting viewing and selecting by a user but not sufficient for acceptable printing, copying, or saving by the user. 32. The method of claim 31 wherein delivering the user-selected portion further comprises: delivering the user-requested portion in a high resolution format sufficient for acceptable printing, copying and/or saving by the user.
| 0.841975 |
18. The method of claim 1 , further comprising obtaining the document related to the item and the further document related to at least the further item.
|
18. The method of claim 1 , further comprising obtaining the document related to the item and the further document related to at least the further item. 23. The method of claim 18 , further comprising merging the at least one term appearing in the document with the at least a further term appearing in the further document.
| 0.964197 |
1. A method for detecting a spelling error in one or more documents, comprising: obtaining a maximum edit distance at which a word, w, is to be considered a possible misspelling of another word, w′; determining if at least one given word in said one or more documents satisfies a predefined misspelling criteria, wherein said predefined misspelling criteria comprises said at least one given word having a frequency below a predefined low threshold and said at least one given word being within the obtained maximum edit distance of one or more other words in said one or more documents having a frequency above a predefined high threshold; identifying a given word as a potentially misspelled word if said given word satisfies said predefined misspelling criteria; and maintaining a lexicon such that said lexicon will include said given word if said given word does not satisfy said predefined misspelling criteria and will exclude said given word if said given word satisfies said predefined misspelling criteria, wherein one or more of said steps are performed by a processor.
|
1. A method for detecting a spelling error in one or more documents, comprising: obtaining a maximum edit distance at which a word, w, is to be considered a possible misspelling of another word, w′; determining if at least one given word in said one or more documents satisfies a predefined misspelling criteria, wherein said predefined misspelling criteria comprises said at least one given word having a frequency below a predefined low threshold and said at least one given word being within the obtained maximum edit distance of one or more other words in said one or more documents having a frequency above a predefined high threshold; identifying a given word as a potentially misspelled word if said given word satisfies said predefined misspelling criteria; and maintaining a lexicon such that said lexicon will include said given word if said given word does not satisfy said predefined misspelling criteria and will exclude said given word if said given word satisfies said predefined misspelling criteria, wherein one or more of said steps are performed by a processor. 3. The method of claim 1 , further comprising the steps of adding all words in said one or more documents to a lexicon, determining a frequency of occurrence of each of said words in said one or more documents and marking said potentially misspelled word within said lexicon in a manner that indicates that the word may be misspelled.
| 0.524038 |
1. A computer-implemented method for querying an opendata provider in communication with a server via an electronic communication network, the method comprising: receiving at the server a relational database query from an application running on a client computer coupled to the electronic communication network; parsing by a parsing engine the relational database query; creating an execution plan based on the results of the parsing step; transmitting an opendata query to the opendata provider, the opendata query including at least a portion of the execution plan; retrieving, at the server, document metadata from the opendata provider; building an internal model of the document metadata; mapping content of at least one opendata entity data model located at the opendata provider and the document metadata to at least one relational model catalog; transforming at the server a response from the opendata provider into a relational format; and providing the transformed response to the client computer application.
|
1. A computer-implemented method for querying an opendata provider in communication with a server via an electronic communication network, the method comprising: receiving at the server a relational database query from an application running on a client computer coupled to the electronic communication network; parsing by a parsing engine the relational database query; creating an execution plan based on the results of the parsing step; transmitting an opendata query to the opendata provider, the opendata query including at least a portion of the execution plan; retrieving, at the server, document metadata from the opendata provider; building an internal model of the document metadata; mapping content of at least one opendata entity data model located at the opendata provider and the document metadata to at least one relational model catalog; transforming at the server a response from the opendata provider into a relational format; and providing the transformed response to the client computer application. 5. The method of claim 1 , further including: processing at least one portion of the execution plan by an opendata driver implemented at the server; and providing at least one result of the processing step to the client computer application.
| 0.563356 |
13. The computer program product of claim 8 , wherein the search query comprises a domain and a scope.
|
13. The computer program product of claim 8 , wherein the search query comprises a domain and a scope. 14. The computer program product of claim 13 , wherein the search query further comprises a radix.
| 0.976899 |
11. A method of performing context-based encryption, the method comprising: detecting, by an encryption system comprising one or more hardware processors, a file interaction event with respect to a file; accessing, by the encryption system, an encryption rule the encryption rule including a set of rules for determining whether to encrypt files based at least in part on a set of context conditions, the set of context conditions including a geographic context; determining, by the encryption system, a set of data tokens for the file, each of the data tokens comprising a portion of content of the file; applying, by the encryption system, the encryption rule to the set of data tokens to determine whether the file includes content designated for protection, wherein applying the encryption rule includes: determining whether one or more data tokens from the set of data tokens satisfy the encryption rule; and ceasing to determine whether the one or more data tokens from the set of data tokens satisfy the encryption rule upon identification of a threshold number of data tokens satisfying the encryption rule regardless of whether each data token from the set of data tokens has been processed to determine whether it satisfies the encryption rule; responsive to determining that the file includes content designated for protection: determining a geographic location of the file; determining whether the geographic location of the file satisfies the geographic context for encrypting the file; and responsive to the geographic location of the file satisfying the geographic context, encrypting, by the encryption system, the file; and responsive to an indication that the file does not include content designated for protection: including the file with a set of training files used to generate one or more encryption rules; and modifying the encryption rule based at least in part on the set of training files and the file.
|
11. A method of performing context-based encryption, the method comprising: detecting, by an encryption system comprising one or more hardware processors, a file interaction event with respect to a file; accessing, by the encryption system, an encryption rule the encryption rule including a set of rules for determining whether to encrypt files based at least in part on a set of context conditions, the set of context conditions including a geographic context; determining, by the encryption system, a set of data tokens for the file, each of the data tokens comprising a portion of content of the file; applying, by the encryption system, the encryption rule to the set of data tokens to determine whether the file includes content designated for protection, wherein applying the encryption rule includes: determining whether one or more data tokens from the set of data tokens satisfy the encryption rule; and ceasing to determine whether the one or more data tokens from the set of data tokens satisfy the encryption rule upon identification of a threshold number of data tokens satisfying the encryption rule regardless of whether each data token from the set of data tokens has been processed to determine whether it satisfies the encryption rule; responsive to determining that the file includes content designated for protection: determining a geographic location of the file; determining whether the geographic location of the file satisfies the geographic context for encrypting the file; and responsive to the geographic location of the file satisfying the geographic context, encrypting, by the encryption system, the file; and responsive to an indication that the file does not include content designated for protection: including the file with a set of training files used to generate one or more encryption rules; and modifying the encryption rule based at least in part on the set of training files and the file. 15. The method of claim 11 , further comprising: requesting confirmation from a user that the file includes content designated for protection; and responsive to receiving from the user the indication that the file does not include content designated for protection, adding the file to the set of training files used to generate the one or more encryption rules.
| 0.505474 |
1. A method for annotating a three-dimensional page of a three-dimensional electronic document, comprising: displaying the three-dimensional page, the three-dimensional page having a first layer intrinsic therewith; receiving, via an annotation tool, an indication of an area of the object to be annotated; annotating a second layer, the second layer intrinsic with the three-dimensional page by marking the area of the three-dimensional page specified by the annotation tool, the second layer being represented by a three-dimensional geometry; and displaying an annotation corresponding to the specified area, wherein the annotation of the second layer is transformed to and displayed in a third layer other than the second layer and the first layer, the third layer being represented in a two-dimensional coordinate system of the three-dimensional page.
|
1. A method for annotating a three-dimensional page of a three-dimensional electronic document, comprising: displaying the three-dimensional page, the three-dimensional page having a first layer intrinsic therewith; receiving, via an annotation tool, an indication of an area of the object to be annotated; annotating a second layer, the second layer intrinsic with the three-dimensional page by marking the area of the three-dimensional page specified by the annotation tool, the second layer being represented by a three-dimensional geometry; and displaying an annotation corresponding to the specified area, wherein the annotation of the second layer is transformed to and displayed in a third layer other than the second layer and the first layer, the third layer being represented in a two-dimensional coordinate system of the three-dimensional page. 2. The method of claim 1 , wherein providing the annotation tool includes supporting at least one of a free-form annotation and a text annotation.
| 0.606354 |
24. The system for generating according to claim 16, wherein said programming model comprises at least one framework, the system further comprising: means for importing at least one framework from the programming model in the object oriented environment to the computer program design.
|
24. The system for generating according to claim 16, wherein said programming model comprises at least one framework, the system further comprising: means for importing at least one framework from the programming model in the object oriented environment to the computer program design. 25. The system for generating according to claim 24, wherein said modeling tool generated computer program design comprises at least one business class, the system further comprising: means for determining at least one relationship between the framework of the programming model and the business class; and means for adding the determined relationship between the modeling tool generated computer program design.
| 0.817666 |
1. A method of conducting a word based lottery game having a plurality of players, comprising the steps of: for each game, the players wagering on an entry defined by a set of words; in a random draw process, randomly generating an outcome that is a concatenation of characters, the draw being such that each outcome can be assigned a probability of occurrence; defining a rule that confers the words in the player entry a win status based on the outcome of the draw producing characters that are used to form the respective words in the player entry; selecting winning entries based on the words in an entry that are conferred a win status; and assigning a prize for each winning entry as a function of a value assigned to each of the words in the player entry formed by the randomly drawn characters, the value based on the commonality of the characters that form the words in the player entry.
|
1. A method of conducting a word based lottery game having a plurality of players, comprising the steps of: for each game, the players wagering on an entry defined by a set of words; in a random draw process, randomly generating an outcome that is a concatenation of characters, the draw being such that each outcome can be assigned a probability of occurrence; defining a rule that confers the words in the player entry a win status based on the outcome of the draw producing characters that are used to form the respective words in the player entry; selecting winning entries based on the words in an entry that are conferred a win status; and assigning a prize for each winning entry as a function of a value assigned to each of the words in the player entry formed by the randomly drawn characters, the value based on the commonality of the characters that form the words in the player entry. 4. The method of claim 1 , wherein the draw is a concatenation of letters restricted to outcomes that contain no repetition.
| 0.550682 |
1. A method of performing speech recognition in a distributed speech recognition system comprising an electronic device having an embedded speech recognizer and a network device having a remote speech recognizer remote from the electronic device, the method comprising: receiving, by the electronic device, input audio uninterrupted by one or more prompts output from the electronic device, wherein the input audio comprises input speech; identifying multiple types of information in the input speech; determining whether speech recognition by the remote speech recognizer is desired, wherein the determining is based, at least in part, on the identified types of information in the input speech; and in response to determining that speech recognition by the remote speech recognizer is desired, processing a first portion of the input speech by the embedded speech recognizer and sending a second portion of the input speech to the network device for recognition by the remote speech recognizer.
|
1. A method of performing speech recognition in a distributed speech recognition system comprising an electronic device having an embedded speech recognizer and a network device having a remote speech recognizer remote from the electronic device, the method comprising: receiving, by the electronic device, input audio uninterrupted by one or more prompts output from the electronic device, wherein the input audio comprises input speech; identifying multiple types of information in the input speech; determining whether speech recognition by the remote speech recognizer is desired, wherein the determining is based, at least in part, on the identified types of information in the input speech; and in response to determining that speech recognition by the remote speech recognizer is desired, processing a first portion of the input speech by the embedded speech recognizer and sending a second portion of the input speech to the network device for recognition by the remote speech recognizer. 2. The method of claim 1 , wherein the second portion of the input speech is processed prior to being sent to the network device.
| 0.743504 |
2. The method of claim 1 , wherein the process of determining the corresponding portions of the textual data for the captured digital images includes using a global sequence alignment algorithm to align lines of text in the textual data for the captured digital images, and to align words within the aligned lines of text.
|
2. The method of claim 1 , wherein the process of determining the corresponding portions of the textual data for the captured digital images includes using a global sequence alignment algorithm to align lines of text in the textual data for the captured digital images, and to align words within the aligned lines of text. 3. The method of claim 2 , wherein the global sequence alignment algorithm is a Needleman-Wunsch algorithm.
| 0.931595 |
1. A method to generate graphical object classifier data structures comprising: identifying graphical objects within an image recorded by a camera; for each identified graphical object within the image: i) creating a bounding region encompassing the graphical object such that a border of the bounding region is located at a predetermined distance from segments of the graphical object; ii) determining pixels within the bounding region that correspond to the graphical object; iii) determining an origin of the graphical object based on at least one origin rule; iv) determining a text coordinate relative to the origin for each determined pixel; and v) determining a statistical probability that features are present within the graphical object, each of the features including at least one pixel having text coordinates; and for each graphical object type, combining the statistical probabilities for each of the features of the identified graphical objects into a classifier data structure.
|
1. A method to generate graphical object classifier data structures comprising: identifying graphical objects within an image recorded by a camera; for each identified graphical object within the image: i) creating a bounding region encompassing the graphical object such that a border of the bounding region is located at a predetermined distance from segments of the graphical object; ii) determining pixels within the bounding region that correspond to the graphical object; iii) determining an origin of the graphical object based on at least one origin rule; iv) determining a text coordinate relative to the origin for each determined pixel; and v) determining a statistical probability that features are present within the graphical object, each of the features including at least one pixel having text coordinates; and for each graphical object type, combining the statistical probabilities for each of the features of the identified graphical objects into a classifier data structure. 5. The method of claim 1 , wherein each of the features includes at least one of a line segment, two line segments connected at an angle, a polygon, and a curved line segment.
| 0.675559 |
14. A method of presenting news content to a user with a computing system within a graphical interface comprising: a) determining a first user geographic region associated with the user; b) identifying a first breaking news story containing content for a first event; wherein said first breaking news story is determined by the computing system to be a first instance of an electronic publication of content for said first event from a set of reference content sources; c) automatically determining a target region associated with said first event by analyzing content of said first breaking news story; d) determining if said first event in said target geographic region is related to said first user geographic region; e) automatically selecting one or more local sources with the computing system to collect local content for stories associated with said first event; wherein said one or more local sources include news sources within or proximate to said geographic region; f) automatically identifying story updates to said first event by examining content published electronically by said one or more local sources; wherein for said identifying step (f) said local content is given a news rank higher than rankings of content from other content sources at least for identifying story updates associated with said first event to be presented to the user for said first user geographic region within the graphical interface.
|
14. A method of presenting news content to a user with a computing system within a graphical interface comprising: a) determining a first user geographic region associated with the user; b) identifying a first breaking news story containing content for a first event; wherein said first breaking news story is determined by the computing system to be a first instance of an electronic publication of content for said first event from a set of reference content sources; c) automatically determining a target region associated with said first event by analyzing content of said first breaking news story; d) determining if said first event in said target geographic region is related to said first user geographic region; e) automatically selecting one or more local sources with the computing system to collect local content for stories associated with said first event; wherein said one or more local sources include news sources within or proximate to said geographic region; f) automatically identifying story updates to said first event by examining content published electronically by said one or more local sources; wherein for said identifying step (f) said local content is given a news rank higher than rankings of content from other content sources at least for identifying story updates associated with said first event to be presented to the user for said first user geographic region within the graphical interface. 17. The method of claim 14 wherein said first breaking news story contains content determined to be published online from one or more content sources within a recent time interval of less than an hour.
| 0.539474 |
14. A computer-implemented method comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving audio data comprising speech from a first client device; receiving an identifier of an application from the first client device, wherein a first language model is associated with the application generating speech recognition results from the speech using the first language model; providing the speech recognition results to the first client device; receiving feedback on the speech recognition results from the first client device; and updating the first language model based at least in part on the feedback.
|
14. A computer-implemented method comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving audio data comprising speech from a first client device; receiving an identifier of an application from the first client device, wherein a first language model is associated with the application generating speech recognition results from the speech using the first language model; providing the speech recognition results to the first client device; receiving feedback on the speech recognition results from the first client device; and updating the first language model based at least in part on the feedback. 15. The computer-implemented method of claim 14 , wherein the audio data is received from a second client device.
| 0.664286 |
14. A gaming device comprising: a playfield that is configured as an array of display positions, wherein each display position is used to display a letter of an alphabet, wherein a letter may be combined with adjacent letters to form a word, and wherein at least one word is hidden along a column, row, or a diagonal axis, a microprocessor with a computer-readable medium encoded with a computer program to control the operation of the gaming device, a program segment to continuously rotate at least one of the letters at an entire row and the letters at an entire column, wherein a letter at a display position is continuously shifted to an adjacent display position along a row or a column, a program segment that randomly stops said rotation, a program segment that determines if a hidden word is uncovered when the rotation is randomly stopped, and a program segment that determines a payout amount associated with uncovered word.
|
14. A gaming device comprising: a playfield that is configured as an array of display positions, wherein each display position is used to display a letter of an alphabet, wherein a letter may be combined with adjacent letters to form a word, and wherein at least one word is hidden along a column, row, or a diagonal axis, a microprocessor with a computer-readable medium encoded with a computer program to control the operation of the gaming device, a program segment to continuously rotate at least one of the letters at an entire row and the letters at an entire column, wherein a letter at a display position is continuously shifted to an adjacent display position along a row or a column, a program segment that randomly stops said rotation, a program segment that determines if a hidden word is uncovered when the rotation is randomly stopped, and a program segment that determines a payout amount associated with uncovered word. 19. A gaming device as recited in claim 14 , wherein said program segment to rotate at least one of the letters at an entire row and the letters at an entire column is activated by an input control mechanism.
| 0.570529 |
9. The system of claim 1 , wherein iteratively computing a respective final score for each entity comprises: iteratively computing new score values x t+1 and y t+1 according to: x t + 1 ( i ) = alpha × ( ∑ j ∈ N ( i ) ( W ( i , j ) ∑ k ∈ N ( j ) W ( k , j ) × y t ( j ) ) ) + x 0 ( i ) and y t + 1 ( j ) = beta × ( ∑ i ∈ N ( j ) ( W ( i , j ) ∑ k ∈ N ( i ) W ( i , k ) × x t ( i ) ) ) + y 0 ( j ) ; wherein: x t+1 (i) represents a score for a first entity i at a t+1 th iterative step; y t+1 (j) represents a score for a second entity j at a t+1 th iterative step; alpha and beta are propagation constants; N(p) represents a set of all nodes in the bipartite graph that share an edge with a vertex p; W(s,t) represents an aggregate weight of the edge in the bipartite graph between nodes s and t; x 0 (i) represents an initial score for the first entity i; and y 0 (j) represents an initial score for the second entity j.
|
9. The system of claim 1 , wherein iteratively computing a respective final score for each entity comprises: iteratively computing new score values x t+1 and y t+1 according to: x t + 1 ( i ) = alpha × ( ∑ j ∈ N ( i ) ( W ( i , j ) ∑ k ∈ N ( j ) W ( k , j ) × y t ( j ) ) ) + x 0 ( i ) and y t + 1 ( j ) = beta × ( ∑ i ∈ N ( j ) ( W ( i , j ) ∑ k ∈ N ( i ) W ( i , k ) × x t ( i ) ) ) + y 0 ( j ) ; wherein: x t+1 (i) represents a score for a first entity i at a t+1 th iterative step; y t+1 (j) represents a score for a second entity j at a t+1 th iterative step; alpha and beta are propagation constants; N(p) represents a set of all nodes in the bipartite graph that share an edge with a vertex p; W(s,t) represents an aggregate weight of the edge in the bipartite graph between nodes s and t; x 0 (i) represents an initial score for the first entity i; and y 0 (j) represents an initial score for the second entity j. 13. The system of claim 9 , the operations further comprising: precomputing U ( i ) = 1 ∑ k ∈ N ( i ) W ( i , k ) and V ( j ) = 1 ∑ k ∈ N ( j ) W ( k , j ) ; distributing U(i) and V(j) on multiple worker nodes, wherein the multiple worker nodes are partitioned by i values for U(i) and by j values for V(j); and iteratively computing new score values x t+1 and y t+1 according to:
x t+1 ( i )=alpha×(Σ j∈N(i) V ( j )× W ( i,j )× y t ( j ))+ x 0 ( i ) and
y t+1 ( j )=beta×(Σ i∈N(j) U ( i )× W ( i,j )× x t ( i ))+ y 0 ( j ).
| 0.807597 |
9. A computer-implemented system for automatically spell-checking dynamically generated web pages generated in response to a request from a client computing device for a web page associated with a workflow, the server computing device comprising: means for receiving a request from a client computing device for a web page associated with a workflow; means for dynamically generating, responsive to the received request, a web page containing at least some text; means for intercepting the web page after dynamic generation and before transmission to a client computing device; means for identifying the at least some text in the intercepted web page; means for executing a spelling check on the at least some text; and means for outputting at least one word identified by the spelling check as misspelled.
|
9. A computer-implemented system for automatically spell-checking dynamically generated web pages generated in response to a request from a client computing device for a web page associated with a workflow, the server computing device comprising: means for receiving a request from a client computing device for a web page associated with a workflow; means for dynamically generating, responsive to the received request, a web page containing at least some text; means for intercepting the web page after dynamic generation and before transmission to a client computing device; means for identifying the at least some text in the intercepted web page; means for executing a spelling check on the at least some text; and means for outputting at least one word identified by the spelling check as misspelled. 10. The system of claim 9 , wherein the server computing device further comprises means for receiving user input indicating that the at least one word was misspelled.
| 0.603916 |
4. The method of claim 3 , wherein the at least one of the one or more sub-units points to a subsequent sub-unit.
|
4. The method of claim 3 , wherein the at least one of the one or more sub-units points to a subsequent sub-unit. 5. The method of claim 4 , wherein pointing to subsequent sub-units includes pointing to a location of the sub-unit in memory.
| 0.959918 |
4. The method of claim 3 , wherein the extraction is performed through an activation of finite state machines.
|
4. The method of claim 3 , wherein the extraction is performed through an activation of finite state machines. 5. The method of claim 4 , wherein the tokens belong to one of a plurality of buffers, wherein the plurality of buffers include at least one of text, HTML tag name, HTML attribute name, HTML attribute value, CSS selector, CSS property name, and CSS property value.
| 0.843681 |
1. A computer-implemented method, comprising: outputting, for display, a plurality of open document representations in a carousel view, wherein each of the plurality of representations includes content from a corresponding open document and a document viewport portion is displayed in the carousel view, the document viewport portion corresponding to content from the corresponding open document that would be output for display in a full view of the corresponding open document; upon receiving an indication of a first gesture associated with a selected representation of the plurality of representations, outputting, for display, the full view of the document viewport portion of the open document corresponding to the selected representation; adjusting content of the open document included in the document viewport portion based upon a user navigation to a next position in the open document; and upon receiving an indication of a second gesture: closing the full view of the document viewport portion; and outputting, for display, the plurality of open document representations in the carousel view, wherein the document viewport portion for the selected representation is displayed in the carousel view corresponding to the adjusted content of the corresponding open document, and a remaining portion of the content from the corresponding open document is displayed outside of the document viewport portion for the selected representation.
|
1. A computer-implemented method, comprising: outputting, for display, a plurality of open document representations in a carousel view, wherein each of the plurality of representations includes content from a corresponding open document and a document viewport portion is displayed in the carousel view, the document viewport portion corresponding to content from the corresponding open document that would be output for display in a full view of the corresponding open document; upon receiving an indication of a first gesture associated with a selected representation of the plurality of representations, outputting, for display, the full view of the document viewport portion of the open document corresponding to the selected representation; adjusting content of the open document included in the document viewport portion based upon a user navigation to a next position in the open document; and upon receiving an indication of a second gesture: closing the full view of the document viewport portion; and outputting, for display, the plurality of open document representations in the carousel view, wherein the document viewport portion for the selected representation is displayed in the carousel view corresponding to the adjusted content of the corresponding open document, and a remaining portion of the content from the corresponding open document is displayed outside of the document viewport portion for the selected representation. 7. The method of claim 1 , wherein the second gesture is a zoom-out gesture with a zoom-out scale beyond a determined threshold.
| 0.857301 |
1. An image-forming system configured to perform at least a first operation to input image data, a second operation to process said image data and form a print finish, and a third operation to display an expected image finish as a result of said first and said second operations, comprising: a finish information generation unit configured to generate expected image finish information on completion of said first and said second operations; an input setting screen information generation unit configured to generate input setting screen information for receiving a setting input by an operator based on said expected image finish information generated by said finish information generation unit; a display unit configured to display on a display unit an expected image finish resulting from said expected image finish information and an input setting screen resulting from said input setting screen information generated by said input setting screen information generation unit; and a setting unit configured to receive a variety of setting inputs including said setting input by the operator by way of said input setting screen displayed on said display unit, wherein, on receiving said variety of setting inputs by said setting unit: said finish information generation unit generates said expected image finish information based on said variety of setting inputs currently received, said input setting screen information generation unit generates said input setting screen information based on said expected image finish information generated by said finish information generation unit, said display unit displays said expected image finish resulting from said expected image finish information and said input setting screen resulting from said input setting screen information generated by said input setting screen information generation unit, and said setting unit receives said variety of setting inputs including said setting input by the operator by way of said input setting screen displayed on said display unit.
|
1. An image-forming system configured to perform at least a first operation to input image data, a second operation to process said image data and form a print finish, and a third operation to display an expected image finish as a result of said first and said second operations, comprising: a finish information generation unit configured to generate expected image finish information on completion of said first and said second operations; an input setting screen information generation unit configured to generate input setting screen information for receiving a setting input by an operator based on said expected image finish information generated by said finish information generation unit; a display unit configured to display on a display unit an expected image finish resulting from said expected image finish information and an input setting screen resulting from said input setting screen information generated by said input setting screen information generation unit; and a setting unit configured to receive a variety of setting inputs including said setting input by the operator by way of said input setting screen displayed on said display unit, wherein, on receiving said variety of setting inputs by said setting unit: said finish information generation unit generates said expected image finish information based on said variety of setting inputs currently received, said input setting screen information generation unit generates said input setting screen information based on said expected image finish information generated by said finish information generation unit, said display unit displays said expected image finish resulting from said expected image finish information and said input setting screen resulting from said input setting screen information generated by said input setting screen information generation unit, and said setting unit receives said variety of setting inputs including said setting input by the operator by way of said input setting screen displayed on said display unit. 8. The image-forming system according to claim 1 , wherein, if a portion in said input setting screen, resulting from said input setting screen information generated by said input setting screen information generation unit, is different from that corresponding to said portion in an initial input setting screen, resulting from initial setting values, said display unit displays said portion with emphasis.
| 0.548333 |
1. A system for detecting a three-way call in a monitored telephone conversation, the system comprising: a speech recognition module configured to extract at least one characteristic of the monitored telephone conversation; a database that stores a representation of the monitored telephone conversation in correspondence with the extracted at least one characteristic; a three-way call detection module configured to analyze the at least one characteristic of the monitored telephone conversation so as to detect a presence or absence of the three-way call in the monitored telephone conversation; and a tagging module configured to determine a starting point of the three-way call in the monitored telephone conversation, wherein the database further stores the determined starting point in correspondence with the representation of the monitored telephone conversation.
|
1. A system for detecting a three-way call in a monitored telephone conversation, the system comprising: a speech recognition module configured to extract at least one characteristic of the monitored telephone conversation; a database that stores a representation of the monitored telephone conversation in correspondence with the extracted at least one characteristic; a three-way call detection module configured to analyze the at least one characteristic of the monitored telephone conversation so as to detect a presence or absence of the three-way call in the monitored telephone conversation; and a tagging module configured to determine a starting point of the three-way call in the monitored telephone conversation, wherein the database further stores the determined starting point in correspondence with the representation of the monitored telephone conversation. 2. The system of claim 1 , wherein the at least one characteristic includes a non-verbal characteristic based on properties of the monitored telephone conversation other than speech.
| 0.546392 |
12. The computer system of claim 11 , wherein the monitoring module is further configured to process the unverified executable file according to an unverified file policy if the file is identified as being obfuscated by an unknown obfuscator program.
|
12. The computer system of claim 11 , wherein the monitoring module is further configured to process the unverified executable file according to an unverified file policy if the file is identified as being obfuscated by an unknown obfuscator program. 13. The computer system of claim 12 , wherein the unverified file policy comprises instructions to delete the unverified executable file, provide an inquiry to a user regarding the processing of the unverified executable file, or block the execution of the unverified executable file.
| 0.835139 |
16. A computer system comprising: a processor; a memory comprising computer code executed using the processor, in which the computer code implements: a computing platform to: identify a first social site, the first social site having a first access interface comprising a first application programming interface (API) specific to the first social sites identifying a social event corresponding to a post on the first social site or a message on the first social site at the first social site, the social event corresponding to a first event type; sharing the social event from the first social site to a second social site by implementing an integration platform located separate from social sites, the sharing comprising the steps of: (1) receiving the social event from the first social site; (2) Identifying the second social site associated with a user that created the social event at the first social site, the second social site identified on a basis of having a supported event type that corresponds to the first event type associated with the social event, the second social site having a second access interface, that comprises a second API specific to the second social site and different from the first access interface; and (3) modifying the social event into a modified social event of the supported event type for the second social site; and sending the modified social event of the supported event type to the second social site through the second access interface having the second API specific to the second social site; creating the social event on the first social site by interacting with an application, wherein creation of the social event results in sending the social event to the first social site over a request path, the first social site responding to the social event with an acknowledgement that the first social site processed the social event; perform security processing on the social event; classifying the social event into at least one classification; performing mapping to standardize a set of common social networking concepts, wherein a mapping function comprises: receiving the social event from the first social site; determining semantics in the social event from the first social site, and mapping the social event from the first social site to a second social event on a second social event; contacting a network interface to broadcast the modified social event to additional sites, wherein the integration platform is configured by configuration data, wherein the configuration data comprises user preferences, wherein the modifying the social event into a modified social event further comprises at least one of modifying a header, modifying a destination address, modifying a source address, modifying a format, or modifying a message content.
|
16. A computer system comprising: a processor; a memory comprising computer code executed using the processor, in which the computer code implements: a computing platform to: identify a first social site, the first social site having a first access interface comprising a first application programming interface (API) specific to the first social sites identifying a social event corresponding to a post on the first social site or a message on the first social site at the first social site, the social event corresponding to a first event type; sharing the social event from the first social site to a second social site by implementing an integration platform located separate from social sites, the sharing comprising the steps of: (1) receiving the social event from the first social site; (2) Identifying the second social site associated with a user that created the social event at the first social site, the second social site identified on a basis of having a supported event type that corresponds to the first event type associated with the social event, the second social site having a second access interface, that comprises a second API specific to the second social site and different from the first access interface; and (3) modifying the social event into a modified social event of the supported event type for the second social site; and sending the modified social event of the supported event type to the second social site through the second access interface having the second API specific to the second social site; creating the social event on the first social site by interacting with an application, wherein creation of the social event results in sending the social event to the first social site over a request path, the first social site responding to the social event with an acknowledgement that the first social site processed the social event; perform security processing on the social event; classifying the social event into at least one classification; performing mapping to standardize a set of common social networking concepts, wherein a mapping function comprises: receiving the social event from the first social site; determining semantics in the social event from the first social site, and mapping the social event from the first social site to a second social event on a second social event; contacting a network interface to broadcast the modified social event to additional sites, wherein the integration platform is configured by configuration data, wherein the configuration data comprises user preferences, wherein the modifying the social event into a modified social event further comprises at least one of modifying a header, modifying a destination address, modifying a source address, modifying a format, or modifying a message content. 23. The computer system of claim 16 , wherein the social event comprises at least one of, a wall post, a status update, a news feed, a like, and a friend recommendation.
| 0.518996 |
1. A method comprising: receiving, in a processor associated with a vehicle, an audio signal; receiving, in the processor, sound related vehicle information representing one or more sounds, the sound related vehicle information not comprising an audio signal; selecting a previously generated acoustic model from among a plurality of acoustic models, to decode speech; and modifying a speech recognition process of the previously generated acoustic model based on the sound related vehicle information, wherein the modifying includes: determining a pre-trained filter according to filter parameters based on the sound related vehicle information; and applying the pre-trained filter to the audio signal.
|
1. A method comprising: receiving, in a processor associated with a vehicle, an audio signal; receiving, in the processor, sound related vehicle information representing one or more sounds, the sound related vehicle information not comprising an audio signal; selecting a previously generated acoustic model from among a plurality of acoustic models, to decode speech; and modifying a speech recognition process of the previously generated acoustic model based on the sound related vehicle information, wherein the modifying includes: determining a pre-trained filter according to filter parameters based on the sound related vehicle information; and applying the pre-trained filter to the audio signal. 4. The method of claim 1 , wherein the filter is in an automatic speech recognition system front-end and wherein the applying the filter to the audio signal is in the automatic speech recognition system front-end.
| 0.618611 |
20. The method of claim 14 , further comprising mapping one or more of the first plurality of documents to a knowledge sub-dimension, wherein each of the one or more documents is characterized by a subset of the one or more concepts.
|
20. The method of claim 14 , further comprising mapping one or more of the first plurality of documents to a knowledge sub-dimension, wherein each of the one or more documents is characterized by a subset of the one or more concepts. 21. The method of claim 20 , wherein the ordering includes arranging a plurality of knowledge sub-dimensions in an order determined by relevance of corresponding subsets of concepts to a selected concept.
| 0.914692 |
9. The method of claim 1 , wherein determining the relative location of the element in the DOM tree structure is based on a previously successful determined location of the element in the DOM tree structure.
|
9. The method of claim 1 , wherein determining the relative location of the element in the DOM tree structure is based on a previously successful determined location of the element in the DOM tree structure. 10. The method of claim 9 , wherein the relative location of the element is determined by searching from neighboring nodes of the DOM tree structure from the previously successful determined location of the element.
| 0.93199 |
20. A method for operating an automated assistant, comprising: at a server computer system provided by a first entity, the server computer system comprising a processor and memory storing instructions for execution by the processor: receiving a voice command and contextual information from the portable electronic device; processing the voice command, using a speech recognition service provided by a second entity different from the first entity, to generate a text string from the voice command; processing the text string and the contextual information; and transmitting results associated with processing the text string and the contextual information to the portable electronic device.
|
20. A method for operating an automated assistant, comprising: at a server computer system provided by a first entity, the server computer system comprising a processor and memory storing instructions for execution by the processor: receiving a voice command and contextual information from the portable electronic device; processing the voice command, using a speech recognition service provided by a second entity different from the first entity, to generate a text string from the voice command; processing the text string and the contextual information; and transmitting results associated with processing the text string and the contextual information to the portable electronic device. 28. The method of claim 20 , wherein processing the text string and the contextual information comprises: identifying a search query in the text string; identifying a geographical constraint in the text string; and performing a search based at least in part on the search query and the geographical constraint; wherein transmitting the results comprises transmitting results of the search to the portable electronic device.
| 0.5 |
9. A non-transitory machine-readable storage medium storing instructions that, when executed, cause a device to perform a method comprising: executing a cross-platform application programming interface (API), wherein the cross-platform API includes functionality to support a plurality of applications, wherein execution of one of the plurality of the applications includes interaction between a plurality of entities within a local network, and wherein the cross-platform API implements a request from the application for the device to participate in a unique conversation, wherein the unique conversation is identified by a topic and independent of a unique identifier for entities, the cross-platform API provides the application an abstracted discovery mechanism by which the application causes the device to discover an entity that is accessible on the local network participating in the unique conversation, wherein the abstracted discovery mechanism performs said discovery by: sending a first message according to a first of the plurality of underlying discovery protocols, monitoring for a second message utilizing the first discovery protocol from the entity, determining that the second message has not been received, sending, in response to determining that the second message has not been received, a third message according to a second of the plurality of underlying discovery protocols, and receiving a fourth message utilizing the second discovery protocol from the entity, and the cross-platform API provides the application with a message passing mechanism by which the application causes the device to exchange messages related to the unique conversation with the entity.
|
9. A non-transitory machine-readable storage medium storing instructions that, when executed, cause a device to perform a method comprising: executing a cross-platform application programming interface (API), wherein the cross-platform API includes functionality to support a plurality of applications, wherein execution of one of the plurality of the applications includes interaction between a plurality of entities within a local network, and wherein the cross-platform API implements a request from the application for the device to participate in a unique conversation, wherein the unique conversation is identified by a topic and independent of a unique identifier for entities, the cross-platform API provides the application an abstracted discovery mechanism by which the application causes the device to discover an entity that is accessible on the local network participating in the unique conversation, wherein the abstracted discovery mechanism performs said discovery by: sending a first message according to a first of the plurality of underlying discovery protocols, monitoring for a second message utilizing the first discovery protocol from the entity, determining that the second message has not been received, sending, in response to determining that the second message has not been received, a third message according to a second of the plurality of underlying discovery protocols, and receiving a fourth message utilizing the second discovery protocol from the entity, and the cross-platform API provides the application with a message passing mechanism by which the application causes the device to exchange messages related to the unique conversation with the entity. 12. The machine-readable storage medium of claim 9 , wherein the plurality of applications supported by the cross-platform API include a variety of types of applications.
| 0.59387 |
1. A method, comprising: pre-processing a message at a message processing server to determine a particular contextual classification associated with at least one word included in the message; assigning the message to a predefined message bucket comprising a plurality of automated responses by selecting at least one of a plurality of different predefined message buckets, wherein one of the predefined message buckets has a higher relevancy rating than the other plurality of different predefined message buckets based on a relevancy rating of the particular contextual classification associated with the at least one word included in the message; and processing the message to determine whether to generate an automated response and transmit the automated response to an end user device; wherein prior to assigning the message to the predefined message bucket, at least one term in the message is replaced with a known alias term linked to the predefined message bucket.
|
1. A method, comprising: pre-processing a message at a message processing server to determine a particular contextual classification associated with at least one word included in the message; assigning the message to a predefined message bucket comprising a plurality of automated responses by selecting at least one of a plurality of different predefined message buckets, wherein one of the predefined message buckets has a higher relevancy rating than the other plurality of different predefined message buckets based on a relevancy rating of the particular contextual classification associated with the at least one word included in the message; and processing the message to determine whether to generate an automated response and transmit the automated response to an end user device; wherein prior to assigning the message to the predefined message bucket, at least one term in the message is replaced with a known alias term linked to the predefined message bucket. 7. The method of claim 1 , comprising transmitting the automated response to the end user device based on a confidence score.
| 0.61231 |
55. A computer-readable memory device storing instructions executable by at least one processor, the computer-readable memory device comprising: one or more instructions to receive a search query; one or more instructions to provide a list of search results in response to the search query; one or more instructions to receive selection of one of the search results in the list of search results; one or more instructions to identify links in a document corresponding to the selected search result; one or more instructions to determine a score for one of the links based on a degree of match between the search query and a content of a linked document pointed to by the one of the links; one or more instructions to modify the document based on the determined score for the one of the links; and one or more instructions to provide the modified document.
|
55. A computer-readable memory device storing instructions executable by at least one processor, the computer-readable memory device comprising: one or more instructions to receive a search query; one or more instructions to provide a list of search results in response to the search query; one or more instructions to receive selection of one of the search results in the list of search results; one or more instructions to identify links in a document corresponding to the selected search result; one or more instructions to determine a score for one of the links based on a degree of match between the search query and a content of a linked document pointed to by the one of the links; one or more instructions to modify the document based on the determined score for the one of the links; and one or more instructions to provide the modified document. 61. The computer-readable memory device of claim 55 , wherein the links in the document point to a plurality of linked documents; and wherein the one or more instructions to determine the score for the one of the links further include: one or more instructions to determine a clickthrough rate for the linked document pointed to by the one of the links, one or more instructions to determine a score for the linked document based on the determined clickthrough rate, and one or more instructions to associate the determined score for the linked document with the one of the links in the document.
| 0.72766 |
12. The method of claim 1 , further comprising: prompting the user of the social networking system to create a limited user profile for the additional user based on a characteristic determined of the additional user by application of a face analysis algorithm on an image of the additional user.
|
12. The method of claim 1 , further comprising: prompting the user of the social networking system to create a limited user profile for the additional user based on a characteristic determined of the additional user by application of a face analysis algorithm on an image of the additional user. 13. The method of claim 12 , wherein the characteristic is determined from a group consisting of: age, gender, relationship status, work history, academic history, location, timestamps, and any combination thereof.
| 0.934033 |
29. The at least one non-transitory computer-readable storage medium of claim 25 , wherein receiving the original free-form text narrative comprises performing automatic speech recognition on a spoken free-form narration provided by the clinician.
|
29. The at least one non-transitory computer-readable storage medium of claim 25 , wherein receiving the original free-form text narrative comprises performing automatic speech recognition on a spoken free-form narration provided by the clinician. 30. The at least one non-transitory computer-readable storage medium of claim 29 , wherein performing the automatic speech recognition comprises accessing a lexicon of terms linked to a clinical ontology.
| 0.910588 |
9. A computer program product comprising: a non-transitory computer-readable medium comprising: a first set of codes for causing a computer to identify an electronic data set comprising data items for collecting by an electronic discovery system; a second set of codes for causing a computer to determine an estimated size of memory required to collect data items of the electronic data set; a third set of codes for causing a computer to determine whether or not the estimated size of memory required to collect data items of the electronic data set is below a predetermined threshold; a fourth set of codes for causing a computer to collect the data items in response to determining that the estimated size of memory required to collect the data items of the electronic data set is below the predetermined threshold, thus resulting in a collected data set; a fifth set of codes for causing a computer to receive inputs that provide for a search term set that includes a plurality of search terms, wherein the search term set is associated with a case in the electronic discovery system and a search term is defined as a word or phrase associated with the case for identifying data items in the collected data set; a sixth set of codes for causing a computer to, prior to finalizing the search term set that will be applied to all of the electronic data associated with the case, determine a plurality of search term hit counts by applying the search term set to a portion of the collected data set, wherein the search term hit counts are defined as a number of data items in the portion of the collected data set in which (1) a specific search term included in the search term set occurs or (2) any one of the search terms in the search term set occur, and wherein the search term hit counts include: a per-data type search term hit count for one or more data types in the collected data set, wherein the one or more data types include electronic mail data and electronic file data, and a per-custodian search term hit count for each custodian associated with the case, wherein determining the per-data type search term hit count for one or more data types in the collected data set further comprises determining for each of the one or more data types in the collected data set a number of occurrences of the search term in each of the one or more data types, and wherein the per-custodian search term hit count is defined as a number of data items in the portion of the collected data set in which (1) the specific search term included in the search term set occurs or (2) any one of the search terms in the search term set occur and the data items in the search term hit count are also associated with a corresponding custodian; a seventh set of codes for causing a computer to predict, for an entirety of the collected data set based on results of applying the search term set to the portion of the collected data set, the volume of the collected data set required to be reviewed; an eighth set of codes for causing a computer to determine, for each of the plurality of search terms, a file size, each file size corresponding to an amount of storage space occupied by each of the data items that comprise a corresponding search term; and a ninth set of codes for causing a computer to store the plurality of search term hit counts and the associated file size, wherein storing includes storing the per-custodian search term hit counts in a corresponding custodian profile within a custodian database and storing all of the search term hit counts in an associated search term file within the electronic discovery system.
|
9. A computer program product comprising: a non-transitory computer-readable medium comprising: a first set of codes for causing a computer to identify an electronic data set comprising data items for collecting by an electronic discovery system; a second set of codes for causing a computer to determine an estimated size of memory required to collect data items of the electronic data set; a third set of codes for causing a computer to determine whether or not the estimated size of memory required to collect data items of the electronic data set is below a predetermined threshold; a fourth set of codes for causing a computer to collect the data items in response to determining that the estimated size of memory required to collect the data items of the electronic data set is below the predetermined threshold, thus resulting in a collected data set; a fifth set of codes for causing a computer to receive inputs that provide for a search term set that includes a plurality of search terms, wherein the search term set is associated with a case in the electronic discovery system and a search term is defined as a word or phrase associated with the case for identifying data items in the collected data set; a sixth set of codes for causing a computer to, prior to finalizing the search term set that will be applied to all of the electronic data associated with the case, determine a plurality of search term hit counts by applying the search term set to a portion of the collected data set, wherein the search term hit counts are defined as a number of data items in the portion of the collected data set in which (1) a specific search term included in the search term set occurs or (2) any one of the search terms in the search term set occur, and wherein the search term hit counts include: a per-data type search term hit count for one or more data types in the collected data set, wherein the one or more data types include electronic mail data and electronic file data, and a per-custodian search term hit count for each custodian associated with the case, wherein determining the per-data type search term hit count for one or more data types in the collected data set further comprises determining for each of the one or more data types in the collected data set a number of occurrences of the search term in each of the one or more data types, and wherein the per-custodian search term hit count is defined as a number of data items in the portion of the collected data set in which (1) the specific search term included in the search term set occurs or (2) any one of the search terms in the search term set occur and the data items in the search term hit count are also associated with a corresponding custodian; a seventh set of codes for causing a computer to predict, for an entirety of the collected data set based on results of applying the search term set to the portion of the collected data set, the volume of the collected data set required to be reviewed; an eighth set of codes for causing a computer to determine, for each of the plurality of search terms, a file size, each file size corresponding to an amount of storage space occupied by each of the data items that comprise a corresponding search term; and a ninth set of codes for causing a computer to store the plurality of search term hit counts and the associated file size, wherein storing includes storing the per-custodian search term hit counts in a corresponding custodian profile within a custodian database and storing all of the search term hit counts in an associated search term file within the electronic discovery system. 11. The computer program product of claim 9 , further comprising a tenth set of codes for causing a computer to receive an input that finalizes the search term set.
| 0.652381 |
17. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform a method comprising: collecting a customer specific services list associated with a customer about to use an interactive voice response system; for each service in the customer specific services list, generating country-specific weights; generating a set of summary weights for a plurality of countries based on an aggregation of the country-specific weights; selecting an interactive voice response system language model based on the set of summary weights; and recognizing speech received from the customer via the interactive voice response system based on the interactive voice response system language model.
|
17. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform a method comprising: collecting a customer specific services list associated with a customer about to use an interactive voice response system; for each service in the customer specific services list, generating country-specific weights; generating a set of summary weights for a plurality of countries based on an aggregation of the country-specific weights; selecting an interactive voice response system language model based on the set of summary weights; and recognizing speech received from the customer via the interactive voice response system based on the interactive voice response system language model. 18. The computer-readable storage device of claim 17 , wherein the interactive voice response system selects language options for a splash screen based on the set of summary weights and the country-specific weights.
| 0.591748 |
1. A computer-implemented method for disambiguating natural language meaning, the computer-implemented method comprising: employing a processor to execute computer-readable instructions that, if executed, cause the processor to perform; receiving a natural language input comprising a plurality of symbols; storing a plurality of input nodes in a semantic network, wherein at least one of the plurality of input nodes represents at least one of the plurality of symbols, wherein at least some of the input nodes have polysemy, wherein a plurality of candidate meanings for at least one of the input nodes having polysemy are stored respectively as a plurality of candidate nodes in the semantic network, and wherein the semantic network includes a stored natural language context, the stored natural language context including a plurality of context nodes; identifying a plurality of semantic links, wherein at least one of the plurality of semantic links traverses from at least one of the plurality of candidate nodes to at least one of the plurality of context nodes; computing at least one contextual distance, the at least one contextual distance corresponding to at least one of the plurality of semantic links; comparing at least one of the plurality of contextual distances to determine a contextual distance for at least one of the input nodes having polysemy; selecting at least one of the plurality of candidate nodes for at least one of the input nodes having polysemy, wherein at least one of the selected candidate nodes has an associated contextual distance approximating the contextual distance for the corresponding input node; outputting a contextual meaning corresponding to the natural language input, wherein the contextual meaning comprises at least one of the candidate meanings corresponding to the selected candidate nodes; and storing in the semantic network a semantic inheritance link between at least one of the input nodes having polysemy and the corresponding at least one selected candidate node.
|
1. A computer-implemented method for disambiguating natural language meaning, the computer-implemented method comprising: employing a processor to execute computer-readable instructions that, if executed, cause the processor to perform; receiving a natural language input comprising a plurality of symbols; storing a plurality of input nodes in a semantic network, wherein at least one of the plurality of input nodes represents at least one of the plurality of symbols, wherein at least some of the input nodes have polysemy, wherein a plurality of candidate meanings for at least one of the input nodes having polysemy are stored respectively as a plurality of candidate nodes in the semantic network, and wherein the semantic network includes a stored natural language context, the stored natural language context including a plurality of context nodes; identifying a plurality of semantic links, wherein at least one of the plurality of semantic links traverses from at least one of the plurality of candidate nodes to at least one of the plurality of context nodes; computing at least one contextual distance, the at least one contextual distance corresponding to at least one of the plurality of semantic links; comparing at least one of the plurality of contextual distances to determine a contextual distance for at least one of the input nodes having polysemy; selecting at least one of the plurality of candidate nodes for at least one of the input nodes having polysemy, wherein at least one of the selected candidate nodes has an associated contextual distance approximating the contextual distance for the corresponding input node; outputting a contextual meaning corresponding to the natural language input, wherein the contextual meaning comprises at least one of the candidate meanings corresponding to the selected candidate nodes; and storing in the semantic network a semantic inheritance link between at least one of the input nodes having polysemy and the corresponding at least one selected candidate node. 6. The method of claim 1 , wherein at least one of the plurality of semantic links corresponds to at least one of a plurality of semantic link types.
| 0.536705 |
17. A system comprising: wrapping code coupled to an error handler of a routine, in which the routine produces an error and the wrapping code wraps the error with relevant information to provide a wrapped exception instance, including to use an exception type hierarchy to preserve information in the wrapped exception instance including an exception type; and an exception manager that receives the wrapped exception instance and determines one or more actions to take based upon the exception type of the wrapped exception instance, wherein the exception manager takes the one or more actions, including to present an interactive dialog associated with the exception type and wherein the dialog includes an interactive input mechanism, which when selected, results in the exception manager taking further action to navigate back to a prior location, or retry an operation that caused the error.
|
17. A system comprising: wrapping code coupled to an error handler of a routine, in which the routine produces an error and the wrapping code wraps the error with relevant information to provide a wrapped exception instance, including to use an exception type hierarchy to preserve information in the wrapped exception instance including an exception type; and an exception manager that receives the wrapped exception instance and determines one or more actions to take based upon the exception type of the wrapped exception instance, wherein the exception manager takes the one or more actions, including to present an interactive dialog associated with the exception type and wherein the dialog includes an interactive input mechanism, which when selected, results in the exception manager taking further action to navigate back to a prior location, or retry an operation that caused the error. 22. The system of claim 17 wherein the interactive input mechanism, when selected, is further interactive to allow the exception manager to take further action to navigate back to a prior location, or retry an operation that caused the error.
| 0.607651 |
1. A method for emotion recognition based on a minimum classification error, the method comprising: extracting a feature vector for emotion recognition based on a voice signal generated from a speaker and a galvanic skin response of the speaker, the feature vector for emotion recognition including a voice signal feature vector containing information extracted from the voice signal of the speaker and a galvanic skin response feature vector extracted from galvanic skin response of the speaker; classifying a neutral emotion using a Gaussian mixture model based on the extracted feature vector for emotion recognition; and classifying other emotions except the previously classified neutral emotion using the Gaussian Mixture Model to which a discriminative weight for minimizing the loss function of a classification error for the feature vector for emotion recognition is applied, wherein the emotions are classified by comparing a likelihood ratio with a threshold value, and the likelihood ratio is obtained from the Gaussian Mixture Model modified by the discriminative weight.
|
1. A method for emotion recognition based on a minimum classification error, the method comprising: extracting a feature vector for emotion recognition based on a voice signal generated from a speaker and a galvanic skin response of the speaker, the feature vector for emotion recognition including a voice signal feature vector containing information extracted from the voice signal of the speaker and a galvanic skin response feature vector extracted from galvanic skin response of the speaker; classifying a neutral emotion using a Gaussian mixture model based on the extracted feature vector for emotion recognition; and classifying other emotions except the previously classified neutral emotion using the Gaussian Mixture Model to which a discriminative weight for minimizing the loss function of a classification error for the feature vector for emotion recognition is applied, wherein the emotions are classified by comparing a likelihood ratio with a threshold value, and the likelihood ratio is obtained from the Gaussian Mixture Model modified by the discriminative weight. 5. The method according to claim 1 , wherein classifying other emotions except the previously classified neutral emotion comprises: obtaining optimum discriminative weight for minimizing the loss function based on training data; and applying the optimum discriminative weight to the Gaussian Mixture Model for emotion recognition.
| 0.5 |
19. The apparatus of claim 17, wherein said selection means includes means to selectively display the symbolic language characters corresponding to index codes stored in said selection storage means; and text file means to receive and store the single character word to be typed.
|
19. The apparatus of claim 17, wherein said selection means includes means to selectively display the symbolic language characters corresponding to index codes stored in said selection storage means; and text file means to receive and store the single character word to be typed. 21. The apparatus of claim 19, wherein said graphic characters are ideographic characters.
| 0.943723 |
1. A method of context-aware communication, comprising: obtaining, by an access terminal, a plurality of terminal data representing a current operating environment of the access terminal from a plurality of access terminal subsystems, one or more terminal applications, or a combination of both; storing the plurality of terminal data obtained over time in a historical database; determining at least one context corresponding to a portion of the plurality of terminal data by: receiving a user input on the access terminal at a first time that defines the respective context identifier, recognizing a relationship between the plurality of terminal data obtained at the first time and the plurality of terminal data in the historical database, identifying the portion of the plurality of terminal data corresponding to the context based on the recognized relationship, and associating the portion of the plurality of terminal data with the respective context identifier; creating a context profile having a context identifier identifying each context, wherein each context profile comprises profile parameters corresponding to the respective portion of the plurality of terminal data determined to correspond to the respective context; and storing each context profile.
|
1. A method of context-aware communication, comprising: obtaining, by an access terminal, a plurality of terminal data representing a current operating environment of the access terminal from a plurality of access terminal subsystems, one or more terminal applications, or a combination of both; storing the plurality of terminal data obtained over time in a historical database; determining at least one context corresponding to a portion of the plurality of terminal data by: receiving a user input on the access terminal at a first time that defines the respective context identifier, recognizing a relationship between the plurality of terminal data obtained at the first time and the plurality of terminal data in the historical database, identifying the portion of the plurality of terminal data corresponding to the context based on the recognized relationship, and associating the portion of the plurality of terminal data with the respective context identifier; creating a context profile having a context identifier identifying each context, wherein each context profile comprises profile parameters corresponding to the respective portion of the plurality of terminal data determined to correspond to the respective context; and storing each context profile. 3. The method of claim 1 , wherein receiving a user input on the access terminal further comprises receiving a context code, wherein the context code corresponds to the context identifier.
| 0.652329 |
1. A system, comprising: A) a database running on one or more server computers communicatively coupled to a network, said database comprising one or more data records, each of said one or more data records comprising: i) a text string; and ii) a monetary value associated with said text string; B) said one or more server computers running a domain name appraisal module configured to: i) receive an appraisal request for a domain name; ii) set an appraisal of said domain name to 0; iii) identify a keyword within said domain name; iv) determine the existence, within said database, of one or more matching data records wherein said text string matches said keyword; v) responsive to a determination that said one or more matching data records do not exist within said database, generate a keyword appraisal value of 0; vi) responsive to a determination that said one or more matching data records exist within said database: a) identify a keyword frequency count comprising a quantity of said one or more matching data records; b) identify a keyword monetary value comprising a sum of said monetary value, associated with said text string, for all of said one or more matching data records; c) generate said keyword appraisal value comprising a quotient calculated by dividing said keyword monetary value by said keyword frequency count; d) add said keyword appraisal value to said appraisal value of said domain name; and vii) transmit said appraisal value to one or more client computers communicatively coupled to said network.
|
1. A system, comprising: A) a database running on one or more server computers communicatively coupled to a network, said database comprising one or more data records, each of said one or more data records comprising: i) a text string; and ii) a monetary value associated with said text string; B) said one or more server computers running a domain name appraisal module configured to: i) receive an appraisal request for a domain name; ii) set an appraisal of said domain name to 0; iii) identify a keyword within said domain name; iv) determine the existence, within said database, of one or more matching data records wherein said text string matches said keyword; v) responsive to a determination that said one or more matching data records do not exist within said database, generate a keyword appraisal value of 0; vi) responsive to a determination that said one or more matching data records exist within said database: a) identify a keyword frequency count comprising a quantity of said one or more matching data records; b) identify a keyword monetary value comprising a sum of said monetary value, associated with said text string, for all of said one or more matching data records; c) generate said keyword appraisal value comprising a quotient calculated by dividing said keyword monetary value by said keyword frequency count; d) add said keyword appraisal value to said appraisal value of said domain name; and vii) transmit said appraisal value to one or more client computers communicatively coupled to said network. 18. The system of claim 1 , wherein said domain name appraisal module is further configured to write said keyword frequency count and said keyword monetary value to said database.
| 0.705364 |
24. A method, performed by a content search system including a parser, a rules database memory device, a normalizer having a decoder and a plurality of transducers, and a search engine, for determining whether an input string matches one or more rules stored in the rules database, comprising: extracting selected portions of the input string, using the parser, to form a filtered input string; forwarding, by the parser, the filtered input string to the normalizer; generating, by the parser, an activation signal for at least one of the plurality of transducers within the normalizer; decoding the filtered input string, by the decoder, to produce an un-encoded filtered input string; activating each transducer of the plurality of transducers for which an activation signal has been generated; removing a field-specific obfuscation from the un-encoded filtered input string using the at least one activated transducer; forwarding the normalized un-encoded filtered input string to the search engine; generating a rule select signal, using the parser, in response to the selected portions of the input string; selecting a set of rules in the rules database memory device in response to the rule select signal; and loading the selected set of rules from the rules database memory device into the search engine; wherein each transducer of the plurality of transducers is configured to be activated or deactivated in response to a signal from the parser.
|
24. A method, performed by a content search system including a parser, a rules database memory device, a normalizer having a decoder and a plurality of transducers, and a search engine, for determining whether an input string matches one or more rules stored in the rules database, comprising: extracting selected portions of the input string, using the parser, to form a filtered input string; forwarding, by the parser, the filtered input string to the normalizer; generating, by the parser, an activation signal for at least one of the plurality of transducers within the normalizer; decoding the filtered input string, by the decoder, to produce an un-encoded filtered input string; activating each transducer of the plurality of transducers for which an activation signal has been generated; removing a field-specific obfuscation from the un-encoded filtered input string using the at least one activated transducer; forwarding the normalized un-encoded filtered input string to the search engine; generating a rule select signal, using the parser, in response to the selected portions of the input string; selecting a set of rules in the rules database memory device in response to the rule select signal; and loading the selected set of rules from the rules database memory device into the search engine; wherein each transducer of the plurality of transducers is configured to be activated or deactivated in response to a signal from the parser. 40. The method of claim 24 , further comprising: selectively removing duplicate slashes in a pathname provided within the input string.
| 0.661013 |
9. A computer program product providing data source modeling for heterogeneous data sources, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising: computer readable program code to define a first interface for a first abstract sub-model of a first sub-model without defining a data source structure for the first sub-model responsive to user input through a user interface; computer readable program code to define a second interface for a second abstract sub-model of a second sub-model without defining a data source structure for the second sub-model responsive to user input through the user interface; computer readable program code to define a connection between the first interface of the first abstract sub-model and the second interface of the second abstract sub-model; computer readable program code to define a first data source structure for the first sub-model separately from the first abstract sub-model, wherein the first data source structure defines a coupling to the first interface of the first abstract sub-model; computer readable program code to define a second data source structure for the second sub-model separately from the second abstract sub-model, wherein the second data source structure defines a coupling to the second interface, wherein the first and second data source structures are heterogeneous data source structures having respective different data source structure types, and wherein at least one of the first and second data source structure types comprises a database structure; computer readable program code to generate a unified data source model after defining the first and second data source structures for the first and second sub-models, the unified data source model including the first and second sub-models having the respective first and second data source structures and having the respective first and second interfaces of the first and second abstract sub-models, wherein the first and second sub-models are coupled through the connection defined between the respective first and second interfaces of the first and second abstract sub-models; and computer readable program code to render the unified data source model including the first and second sub-models having the respective first and second data source structures and coupled through the connection between the first and second interfaces on a display.
|
9. A computer program product providing data source modeling for heterogeneous data sources, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising: computer readable program code to define a first interface for a first abstract sub-model of a first sub-model without defining a data source structure for the first sub-model responsive to user input through a user interface; computer readable program code to define a second interface for a second abstract sub-model of a second sub-model without defining a data source structure for the second sub-model responsive to user input through the user interface; computer readable program code to define a connection between the first interface of the first abstract sub-model and the second interface of the second abstract sub-model; computer readable program code to define a first data source structure for the first sub-model separately from the first abstract sub-model, wherein the first data source structure defines a coupling to the first interface of the first abstract sub-model; computer readable program code to define a second data source structure for the second sub-model separately from the second abstract sub-model, wherein the second data source structure defines a coupling to the second interface, wherein the first and second data source structures are heterogeneous data source structures having respective different data source structure types, and wherein at least one of the first and second data source structure types comprises a database structure; computer readable program code to generate a unified data source model after defining the first and second data source structures for the first and second sub-models, the unified data source model including the first and second sub-models having the respective first and second data source structures and having the respective first and second interfaces of the first and second abstract sub-models, wherein the first and second sub-models are coupled through the connection defined between the respective first and second interfaces of the first and second abstract sub-models; and computer readable program code to render the unified data source model including the first and second sub-models having the respective first and second data source structures and coupled through the connection between the first and second interfaces on a display. 11. The computer program product of claim 9 wherein the first data source structure type of the first data source structure comprises a structured query language (SQL) database structure, and wherein the second data source structure type of the second data source structure comprises a NoSQL database structure.
| 0.615221 |
18. A system comprising: one or more processors; an eye sensor device; and one or more computer-readable storage media storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to: receive, from the eye sensor device, information related to a gaze direction of eyes of a user as the user reads displayed text of a document in a first formatted version; determine, based on an analysis of the information related to the gaze direction, a current reading speed of the displayed text; detect that an irregularity occurs based on a determination that the current reading speed is less than a regular reading speed of the user; determine that the irregularity is associated with a display screen location that contains a portion of the displayed text; and associate the display screen location that contains the portion of the displayed text with an identifiable section within a second formatted version of the document that is different than the first formatted version of the document, wherein the identifiable section comprises a page.
|
18. A system comprising: one or more processors; an eye sensor device; and one or more computer-readable storage media storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to: receive, from the eye sensor device, information related to a gaze direction of eyes of a user as the user reads displayed text of a document in a first formatted version; determine, based on an analysis of the information related to the gaze direction, a current reading speed of the displayed text; detect that an irregularity occurs based on a determination that the current reading speed is less than a regular reading speed of the user; determine that the irregularity is associated with a display screen location that contains a portion of the displayed text; and associate the display screen location that contains the portion of the displayed text with an identifiable section within a second formatted version of the document that is different than the first formatted version of the document, wherein the identifiable section comprises a page. 22. The system as recited in claim 18 , wherein the irregularity is indicative of a personal interest, and the computer-executable instructions further cause the one or more processors to display a recommendation based at least in part on the personal interest.
| 0.606658 |
16. A machine-readable medium comprising instructions stored therein, which when executed by a machine, cause the machine to perform operations comprising: receiving an indication of a request to provide a user with one or more suggestions; identifying one or more social content items; selecting a plurality of n-grams from the one or more social content items, each of the n-grams representing a plurality of terms from the one or more social content items, the social content items comprising content corresponding to activity performed by at least one user within a social networking service; assigning a score to each of the plurality of n-grams based on one or more significance criteria; generating one or more candidate suggestions from the n-grams based on the score of each of the plurality of n-grams, the one or more candidate suggestions including recommended actions to perform within the social networking service; identifying one or more contacts or groups of contacts associated with at least one of the one or more candidate suggestions; and providing the one or more contacts or groups of contacts for display by the social network service, along with the at least one of the one or more candidate suggestions to facilitate additional user activity within the social networking service.
|
16. A machine-readable medium comprising instructions stored therein, which when executed by a machine, cause the machine to perform operations comprising: receiving an indication of a request to provide a user with one or more suggestions; identifying one or more social content items; selecting a plurality of n-grams from the one or more social content items, each of the n-grams representing a plurality of terms from the one or more social content items, the social content items comprising content corresponding to activity performed by at least one user within a social networking service; assigning a score to each of the plurality of n-grams based on one or more significance criteria; generating one or more candidate suggestions from the n-grams based on the score of each of the plurality of n-grams, the one or more candidate suggestions including recommended actions to perform within the social networking service; identifying one or more contacts or groups of contacts associated with at least one of the one or more candidate suggestions; and providing the one or more contacts or groups of contacts for display by the social network service, along with the at least one of the one or more candidate suggestions to facilitate additional user activity within the social networking service. 18. The machine-readable medium of claim 16 , wherein the one or more significance criteria includes one or more of popularity of the n-grams, volume of social activity performed with respect to the one or more social content items, a social affinity of the user and one or more contacts associated with the one or more social content items, a level of interest of the user in content items relating to the n-grams, or relevance of the n-grams to user activity.
| 0.607805 |
9. The apparatus of claim 8 , wherein the predetermined collection comprises names of individuals.
|
9. The apparatus of claim 8 , wherein the predetermined collection comprises names of individuals. 10. The apparatus of claim 9 , wherein the individuals are candidates to participating in a group having expertise in a subject associated with the query.
| 0.908246 |
4. The method of claim 1 , wherein analyzing data previously entered into one or more data entry areas of the document comprises recognizing one or more patterns in the data previously entered into the one or more data entry areas of the document.
|
4. The method of claim 1 , wherein analyzing data previously entered into one or more data entry areas of the document comprises recognizing one or more patterns in the data previously entered into the one or more data entry areas of the document. 5. The method of claim 4 , wherein generating the list of one or more suggestions comprises using the one or more recognized patterns to predict one or more suggestions and including the one or more predicted suggestions in the list of one or more suggestions.
| 0.899601 |
47. One or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform a method comprising the steps of: providing for creation of a first access rule for one or more resources; storing said first access rule at an access server; receiving and storing a set of one or more query variables to be associated with said first access rule; and receiving and storing one or more values for said one or more query variables, said one or more values uniquely identify said first access rule from a plurality of access rules; and determining whether access to said one or more resources is authorized based on said identification of said one or more resources without granting authorization to said one or more resources, said determining including accessing said first access rule for said one or more resources and accessing an identity profile for a first user to determine whether at least a portion of said first access rule is satisfied based on information in said identity profile, wherein said first access rule is not part of said identity profile.
|
47. One or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform a method comprising the steps of: providing for creation of a first access rule for one or more resources; storing said first access rule at an access server; receiving and storing a set of one or more query variables to be associated with said first access rule; and receiving and storing one or more values for said one or more query variables, said one or more values uniquely identify said first access rule from a plurality of access rules; and determining whether access to said one or more resources is authorized based on said identification of said one or more resources without granting authorization to said one or more resources, said determining including accessing said first access rule for said one or more resources and accessing an identity profile for a first user to determine whether at least a portion of said first access rule is satisfied based on information in said identity profile, wherein said first access rule is not part of said identity profile. 51. One or more processor readable storage devices according to claim 47 , wherein: said one or more query variables are order independent.
| 0.66477 |
1. A computer-implemented method for identifying related search queries, performed on a server having at least one processor and memory storing at least one program for execution by the at least one processor to perform the method, comprising: receiving a search query from a user; identifying a set of ranked search results satisfying the search query; identifying, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, wherein the identifying includes querying a query database to identify the at least one last related search query in the at least one chain of related search queries that are related to the search query, wherein a respective chain of related search queries is a sequence of consecutive search queries that are issued by a respective user and that include an initial search query that is successively refined; the query database includes a plurality of records, wherein each respective record includes: a respective search query; a number of times the respective search query was issued; a respective search result that was selected by users who issued the respective search query and that corresponds to at least one respective related search query in at least one respective chain of related search queries that are related to the respective search query; the at least one respective related search query; and a number of times the respective search query led to a selection of the respective search result; and returning the set of ranked search results and the at least one last related search query to the user.
|
1. A computer-implemented method for identifying related search queries, performed on a server having at least one processor and memory storing at least one program for execution by the at least one processor to perform the method, comprising: receiving a search query from a user; identifying a set of ranked search results satisfying the search query; identifying, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, wherein the identifying includes querying a query database to identify the at least one last related search query in the at least one chain of related search queries that are related to the search query, wherein a respective chain of related search queries is a sequence of consecutive search queries that are issued by a respective user and that include an initial search query that is successively refined; the query database includes a plurality of records, wherein each respective record includes: a respective search query; a number of times the respective search query was issued; a respective search result that was selected by users who issued the respective search query and that corresponds to at least one respective related search query in at least one respective chain of related search queries that are related to the respective search query; the at least one respective related search query; and a number of times the respective search query led to a selection of the respective search result; and returning the set of ranked search results and the at least one last related search query to the user. 3. The computer-implemented method of claim 1 , wherein each respective related search query in the at least one chain of related search queries, except for the at least one last related search query in the at least one chain of related search queries, violates a timing criterion with respect to user-selection of search results.
| 0.533369 |
1. A method of testing an application program using a test script containing test commands in a first language, the application program having a second language different from the first language, the method comprising the computer implemented steps of: employing translations used in the application program itself, comparing test commands in the first language to converted test commands in the second language by: determining a support file of the application program supporting program execution in various languages and having translations to the second language, the support file being a prior established file of the application program and the support file having resource name and URL for the second language; and accessing the determined support file and obtaining translations of the test commands in the second language.
|
1. A method of testing an application program using a test script containing test commands in a first language, the application program having a second language different from the first language, the method comprising the computer implemented steps of: employing translations used in the application program itself, comparing test commands in the first language to converted test commands in the second language by: determining a support file of the application program supporting program execution in various languages and having translations to the second language, the support file being a prior established file of the application program and the support file having resource name and URL for the second language; and accessing the determined support file and obtaining translations of the test commands in the second language. 6. A method as claimed in claim 1 wherein the application program is a tagged application.
| 0.669628 |
7. A non-transitory computer-readable medium, comprising: a plurality of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to: receive a document requested by a browser program on a client device; analyze the document to generate a list of domain names associated with a plurality of links, within the document, that are selectable via the browser program, the instructions, which cause the one or more processors to analyze the document further causing the one or more processors to: determine, based on historical data, for which links, of the plurality of links within the document, to include associated domain names in the list of names, the historical data being based on at least one of: a quantity of times that a particular link, of the plurality of links, has been accessed, or an amount of time spent by users accessing documents linked to by the plurality of links the list of domain names being ordered based on a relevance of documents, associated with the domain names, to the document; transmit the list to the client device, the list permitting the client device to perform domain name system (DNS) lookups for the domain names in the list prior to receiving a selection, at the client device, of any of the plurality of links within the document; transmit the document to the client device; and perform, in an order indicated by the list, one or more DNS lookups for one or more of the domain names in the list without receiving a selection of any of the plurality of links within the document.
|
7. A non-transitory computer-readable medium, comprising: a plurality of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to: receive a document requested by a browser program on a client device; analyze the document to generate a list of domain names associated with a plurality of links, within the document, that are selectable via the browser program, the instructions, which cause the one or more processors to analyze the document further causing the one or more processors to: determine, based on historical data, for which links, of the plurality of links within the document, to include associated domain names in the list of names, the historical data being based on at least one of: a quantity of times that a particular link, of the plurality of links, has been accessed, or an amount of time spent by users accessing documents linked to by the plurality of links the list of domain names being ordered based on a relevance of documents, associated with the domain names, to the document; transmit the list to the client device, the list permitting the client device to perform domain name system (DNS) lookups for the domain names in the list prior to receiving a selection, at the client device, of any of the plurality of links within the document; transmit the document to the client device; and perform, in an order indicated by the list, one or more DNS lookups for one or more of the domain names in the list without receiving a selection of any of the plurality of links within the document. 12. The computer-readable medium of claim 7 , where the list of domain names additionally includes domain names selected from domains referenced by documents corresponding to links within the document.
| 0.683579 |
21. A method of analyzing rhythmic measures of speech comprising the steps of: speaking a sequence of syllables; manually entering into an analysis device with keystrokes a series of discrete input signals having an input rhythm corresponding to the spoken sequence of syllables; comparing in the analysis device the input rhythm of the series of discrete input signals to at least one of plural known rhythmic groups of rhythmic measures of speech stored in the analysis device; providing as an output from the analysis device a representation of the input rhythm; and providing as a further output from the analysis device a result of the comparing step indicating a correspondence of the input rhythm to a one of the known rhythmic groups of rhythmic measures of speech, thereby providing an analysis of a relationship between the spoken sequence of syllables to the one of the known rhythmic groups.
|
21. A method of analyzing rhythmic measures of speech comprising the steps of: speaking a sequence of syllables; manually entering into an analysis device with keystrokes a series of discrete input signals having an input rhythm corresponding to the spoken sequence of syllables; comparing in the analysis device the input rhythm of the series of discrete input signals to at least one of plural known rhythmic groups of rhythmic measures of speech stored in the analysis device; providing as an output from the analysis device a representation of the input rhythm; and providing as a further output from the analysis device a result of the comparing step indicating a correspondence of the input rhythm to a one of the known rhythmic groups of rhythmic measures of speech, thereby providing an analysis of a relationship between the spoken sequence of syllables to the one of the known rhythmic groups. 28. The method of claim 21, further comprising the step of indicating a lack of correspondence between the spoken sequence of syllables and the one of the known rhythmic groups.
| 0.56151 |
8. The computer readable medium of claim 7 , wherein the instructions cause the computer to perform operations comprising: identifying, from a corpus of images, two or more images each having an initial relevance score that meets a threshold relevance score, the initial relevance score being a measure of relevance of the image to the query; and for each image in the identified two or more images: identifying a measure of visual quality of the image, the measure of visual quality for each image being based at least in part on visual features of the image; and determining the query score for the image based at least in part on the measure of visual quality, and the measure of importance of image quality for the query; and adjusting, based on the query score for the image, the relevance score for the image.
|
8. The computer readable medium of claim 7 , wherein the instructions cause the computer to perform operations comprising: identifying, from a corpus of images, two or more images each having an initial relevance score that meets a threshold relevance score, the initial relevance score being a measure of relevance of the image to the query; and for each image in the identified two or more images: identifying a measure of visual quality of the image, the measure of visual quality for each image being based at least in part on visual features of the image; and determining the query score for the image based at least in part on the measure of visual quality, and the measure of importance of image quality for the query; and adjusting, based on the query score for the image, the relevance score for the image. 10. The computer readable medium of claim 8 , wherein determining the query score comprises computing, for a first image, a first query score that is higher than a second query score for a second image having a higher visual quality score than the first image.
| 0.889917 |
14. A computer system comprising a processor, a memory coupled to said processor, and a computer-readable hardware storage device coupled to said processor, said storage device containing program code configured to be run by said processor via the memory to implement a method for automatically deriving a context of a business rule when inferring the business rule from an information source, the method comprising: a processor of a computer system inferring the business rule as a function of a first element of information comprised by a first information source; the processor identifying a next element of information that is associated with a first context of the first element of information, wherein the first context associates the first element with a first context-dependent characteristic of the first element, and wherein the next element of information is comprised by a next information source that is distinct from the first information source; the processor modifying the business rule as a function of the next element of information; the processor attempting to recognize a further element of information that is associated with a next context of the next element of information, wherein the next context associates the next element with a next context-dependent characteristic of the next element, and wherein the further element of information is comprised by a further information source that is distinct from the first information source; the processor, if successfully recognizing the further element of information, updating the business rule as a function of the further element of information; and the processor iteratively repeating the attempting to recognize and the updating until the processor fails to recognize the further element, where the processor in each iteration initially resets values of the next element and the next information source respectively to those of the further element and the further information source that had been recognized by the processor in the previous iteration, and where the processor in each iteration attempts to recognize new values of the next context, the next context-dependent characteristic, the further element, and the further information source as functions of the reset values of the next element and the next information source.
|
14. A computer system comprising a processor, a memory coupled to said processor, and a computer-readable hardware storage device coupled to said processor, said storage device containing program code configured to be run by said processor via the memory to implement a method for automatically deriving a context of a business rule when inferring the business rule from an information source, the method comprising: a processor of a computer system inferring the business rule as a function of a first element of information comprised by a first information source; the processor identifying a next element of information that is associated with a first context of the first element of information, wherein the first context associates the first element with a first context-dependent characteristic of the first element, and wherein the next element of information is comprised by a next information source that is distinct from the first information source; the processor modifying the business rule as a function of the next element of information; the processor attempting to recognize a further element of information that is associated with a next context of the next element of information, wherein the next context associates the next element with a next context-dependent characteristic of the next element, and wherein the further element of information is comprised by a further information source that is distinct from the first information source; the processor, if successfully recognizing the further element of information, updating the business rule as a function of the further element of information; and the processor iteratively repeating the attempting to recognize and the updating until the processor fails to recognize the further element, where the processor in each iteration initially resets values of the next element and the next information source respectively to those of the further element and the further information source that had been recognized by the processor in the previous iteration, and where the processor in each iteration attempts to recognize new values of the next context, the next context-dependent characteristic, the further element, and the further information source as functions of the reset values of the next element and the next information source. 17. The computer system of claim 14 , wherein the first information source comprises a first set of computer-program instructions, the first element of information comprises a first subset of the first set of computer-program instructions, and the next element of information is selected from the group comprising: a data element that is directly or indirectly processed by the first subset of the first set of computer-program instructions, a data element that is otherwise associated with the first subset of the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a time, platform, or manner of performance of the first subset of the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a scope of the first subset of the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a time, platform, or manner of performance of the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a scope of the first subset of the first set of computer-program instructions, a third set of computer-program instructions that comprises a reference to the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a reference to the first set of computer-program instructions, a second computer-program instruction that imposes a condition upon a scope of the first subset of the first set of computer-program instructions, a reference to an extrinsic information source that is associated with a context of the first subset of the first set of computer-program instructions; a business process that is associated with a context of the first subset of the first set of computer-program instructions, and a business goal that is associated with a context of the first subset of the first set of computer-program instructions.
| 0.5 |
10. A computing apparatus to manage security actions for a computing environment comprising a plurality of computing assets, the apparatus comprising: one or more non-transitory computer readable media; a processing system operatively coupled to the one or more non-transitory computer readable media; and processing instructions stored on the one or more non-transitory computer readable media that, when executed by the processing system, direct the processing system to at least: provide security incident information to an administrator associated with the computing environment, wherein the security incident information comprises asset identifiers for assets related to a security incident and enrichment information for the security incident obtained from internal or external sources; in response to providing the security incident information, identify a user generated security action in a command language for the computing environment; identify one or more computing assets related to the security action; obtain hardware and software characteristics for the one or more computing assets; translate the security action in the command language to one or more action procedures based on the hardware and software characteristics; and initiate implementation of the one or more action procedures in the one or more computing assets.
|
10. A computing apparatus to manage security actions for a computing environment comprising a plurality of computing assets, the apparatus comprising: one or more non-transitory computer readable media; a processing system operatively coupled to the one or more non-transitory computer readable media; and processing instructions stored on the one or more non-transitory computer readable media that, when executed by the processing system, direct the processing system to at least: provide security incident information to an administrator associated with the computing environment, wherein the security incident information comprises asset identifiers for assets related to a security incident and enrichment information for the security incident obtained from internal or external sources; in response to providing the security incident information, identify a user generated security action in a command language for the computing environment; identify one or more computing assets related to the security action; obtain hardware and software characteristics for the one or more computing assets; translate the security action in the command language to one or more action procedures based on the hardware and software characteristics; and initiate implementation of the one or more action procedures in the one or more computing assets. 11. The computing apparatus of claim 10 wherein the processing instructions further direct the processing system to identify the security incident within the computing environment, and wherein the processing instructions to provide the security incident information to the administrator direct the processing system to provide the security incident information to the administrator in response to identifying the security incident.
| 0.5 |
1. A machine-implemented method of albuming graphic elements, comprising: identifying candidate relative layouts of graphic elements on a page, wherein each of the candidate relative layouts describes a respective set of layout relationships among the graphic elements; generating for each of the candidate relative layouts a respective set of constraints describing the corresponding set of layout relationships among the graphic elements; determining a respective determinate layout of the graphic elements on the page from each set of constraints; and selecting one of the determinate layouts as a final layout of the graphic elements on the page.
|
1. A machine-implemented method of albuming graphic elements, comprising: identifying candidate relative layouts of graphic elements on a page, wherein each of the candidate relative layouts describes a respective set of layout relationships among the graphic elements; generating for each of the candidate relative layouts a respective set of constraints describing the corresponding set of layout relationships among the graphic elements; determining a respective determinate layout of the graphic elements on the page from each set of constraints; and selecting one of the determinate layouts as a final layout of the graphic elements on the page. 7. The method of claim 1 , further comprising generating a set of paths through each of the candidate relative layouts.
| 0.637528 |
1. A method for a multimedia seek sequence using a synchronization index and a mobile computing device comprising the steps: providing, to a mobile computing device, information for displaying on the mobile computing device text from a synchronization index, wherein said synchronization index comprises an electronic transcript that indicates text corresponding to audio from the multimedia and respective times within multimedia corresponding to when a word or range of words is audible in the multimedia; wherein said mobile computing device comprises a viewing screen and a touch-sensitive input interface; displaying, after said providing step, at least a portion of said text from a synchronization index on said viewing screen, wherein said text is displayed other than as a web page; receiving, from the mobile computing device, information indicating a user's selected mobile computing device touch-sensitive input interface gesture performed on a portion of said viewing screen corresponding to a displayed word, or a range of words, from said synchronization index, wherein said gesture is recognized by said touch-sensitive input interface on the mobile computing device; performing a timecode lookup, using the synchronization index, and in response to the gesture performed to select a word or range of words, said timecode lookup functioning to associate a time, t1, within multimedia to the selected word or range of words; and delivering multimedia beginning at time t1, or providing instructions for the delivery of multimedia beginning at time t1, to a receiving device to play said multimedia, wherein said multimedia corresponds to the word or range of words selected by the gesture.
|
1. A method for a multimedia seek sequence using a synchronization index and a mobile computing device comprising the steps: providing, to a mobile computing device, information for displaying on the mobile computing device text from a synchronization index, wherein said synchronization index comprises an electronic transcript that indicates text corresponding to audio from the multimedia and respective times within multimedia corresponding to when a word or range of words is audible in the multimedia; wherein said mobile computing device comprises a viewing screen and a touch-sensitive input interface; displaying, after said providing step, at least a portion of said text from a synchronization index on said viewing screen, wherein said text is displayed other than as a web page; receiving, from the mobile computing device, information indicating a user's selected mobile computing device touch-sensitive input interface gesture performed on a portion of said viewing screen corresponding to a displayed word, or a range of words, from said synchronization index, wherein said gesture is recognized by said touch-sensitive input interface on the mobile computing device; performing a timecode lookup, using the synchronization index, and in response to the gesture performed to select a word or range of words, said timecode lookup functioning to associate a time, t1, within multimedia to the selected word or range of words; and delivering multimedia beginning at time t1, or providing instructions for the delivery of multimedia beginning at time t1, to a receiving device to play said multimedia, wherein said multimedia corresponds to the word or range of words selected by the gesture. 4. The method of claim 1 , wherein the receiving device is other than said mobile computing device and configured to receive multimedia input from a source selected from the group comprising satellite receiver, internet connection, WiFi, computer network, cable television system, fiber optic cable delivery network for data, cellular communication channel, bluetooth, UPnP, and local wireless connection.
| 0.553181 |
2. The method of claim 1 , wherein the documents relate to a first document based at least on a frame of time.
|
2. The method of claim 1 , wherein the documents relate to a first document based at least on a frame of time. 7. The method of claim 2 , the method further comprising running an automatic transcription of the first document as a query on the collection of documents to retrieve related documents from the documents.
| 0.887432 |
13. A system comprising: means for storing one or more units of content included in an updated version of a structured document; means for updating a table of contents having an entry associated with each unit of content; means for automatically generating a list of modified topics comprising means for determining that a unit of content in the updated version of the structured document and a related unit of content in a previous version of the structured document are associated with the same entry, wherein the means for determining comprises: means for accessing a base topic set having a single topic identifier associated with each unit of content in the previous version of the structured document; means for accessing an updated topic set having a single topic identifier associated with each unit of content in the updated version of the structured document; means for identifying a particular topic identifier in the updated topic set that corresponds to the same particular topic identifier in the base topic set; means for comparing the unit of content associated with the particular topic identifier in the updated version of the structured document with the related unit of content associated with the particular topic identifier in the previous version of the structured document, to determine whether the unit of content in the updated version of the structured document has been modified with respect to the related unit of content in the previous version of the structured document; means for generating a table of contents associated with the updated version of a structured document, the table of contents having one entry associated with each unit of content in the updated version of the structured document; and means for automatically marking a first entry in the table of contents indicating that the unit of content associated with the first entry has been modified a predetermined degree from a previous version of the content, wherein the predetermined degree is represented by a difference metric as determined by a content comparator, such that: in an event that the each difference is counted as a modification, the difference metric represents each change in words, tags, and formatting, wherein the changes comprise changes in font, color, size, inserted content, and deleted content between the respective units of content in the updated version of the structured document and the previous version of the structured document; and in an event that not all differences are counted as modifications, changes are classified by type such that changes of meaning are classified in a different type than changes in form, wherein changes in form include rephrasing that does not change the meaning of the content. and the difference metric represents the number of changes of meaning within each unit of content.
|
13. A system comprising: means for storing one or more units of content included in an updated version of a structured document; means for updating a table of contents having an entry associated with each unit of content; means for automatically generating a list of modified topics comprising means for determining that a unit of content in the updated version of the structured document and a related unit of content in a previous version of the structured document are associated with the same entry, wherein the means for determining comprises: means for accessing a base topic set having a single topic identifier associated with each unit of content in the previous version of the structured document; means for accessing an updated topic set having a single topic identifier associated with each unit of content in the updated version of the structured document; means for identifying a particular topic identifier in the updated topic set that corresponds to the same particular topic identifier in the base topic set; means for comparing the unit of content associated with the particular topic identifier in the updated version of the structured document with the related unit of content associated with the particular topic identifier in the previous version of the structured document, to determine whether the unit of content in the updated version of the structured document has been modified with respect to the related unit of content in the previous version of the structured document; means for generating a table of contents associated with the updated version of a structured document, the table of contents having one entry associated with each unit of content in the updated version of the structured document; and means for automatically marking a first entry in the table of contents indicating that the unit of content associated with the first entry has been modified a predetermined degree from a previous version of the content, wherein the predetermined degree is represented by a difference metric as determined by a content comparator, such that: in an event that the each difference is counted as a modification, the difference metric represents each change in words, tags, and formatting, wherein the changes comprise changes in font, color, size, inserted content, and deleted content between the respective units of content in the updated version of the structured document and the previous version of the structured document; and in an event that not all differences are counted as modifications, changes are classified by type such that changes of meaning are classified in a different type than changes in form, wherein changes in form include rephrasing that does not change the meaning of the content. and the difference metric represents the number of changes of meaning within each unit of content. 14. A system as recited in claim 13 wherein the means for identifying comprises a new topic identification module generating a list of new topics.
| 0.549334 |
1. A computer-implemented method, comprising: at a computer system having one or more processors and memory: obtaining a plurality of incoming messages from a set of users of a messaging system, the plurality of incoming messages including both priority messages and non-priority messages, the priority messages having a content type that is different from a content type of the non-priority messages; receiving one or more selection criteria from a user of the messaging system, the one or more selection criteria including one or more keywords; identifying a set of target messages from among the plurality of messages based at least in part on the one or more keywords, the set of target messages including both priority and non-priority messages; for each message in the set of target messages: in accordance with a determination that the message is not a priority message, scoring the message; in accordance with a determination that the message is a priority message, selecting the message; selecting a subset of the non-priority messages in the set of target messages based on the scoring of each message; and sending the selected non-priority messages and the selected priority messages to a client device of the user for presentation to the user.
|
1. A computer-implemented method, comprising: at a computer system having one or more processors and memory: obtaining a plurality of incoming messages from a set of users of a messaging system, the plurality of incoming messages including both priority messages and non-priority messages, the priority messages having a content type that is different from a content type of the non-priority messages; receiving one or more selection criteria from a user of the messaging system, the one or more selection criteria including one or more keywords; identifying a set of target messages from among the plurality of messages based at least in part on the one or more keywords, the set of target messages including both priority and non-priority messages; for each message in the set of target messages: in accordance with a determination that the message is not a priority message, scoring the message; in accordance with a determination that the message is a priority message, selecting the message; selecting a subset of the non-priority messages in the set of target messages based on the scoring of each message; and sending the selected non-priority messages and the selected priority messages to a client device of the user for presentation to the user. 2. The method of claim 1 , wherein selecting the subset of non-priority messages comprises: sorting the non-priority messages in the set of target messages based on the score for each non-priority message; and selecting the subset of non-priority messages in accordance with the sort.
| 0.616377 |
4. The method of claim 1 wherein the determining the first context class is an initial classification of the received sensor data.
|
4. The method of claim 1 wherein the determining the first context class is an initial classification of the received sensor data. 6. The method of claim 4 further comprising identifying an operational property of the initial classification, the operational property including at least one of a motion, a location, an event, or an environment associated with the initial classification.
| 0.935678 |
10. A handheld electronic device comprising an input apparatus, a processor apparatus, and an output apparatus, the processor apparatus comprising a processor and a memory, the memory having stored therein a number of routines which, when executed by the processor, cause the handheld electronic device to be adapted to perform operations comprising: detecting as an ambiguous input a plurality of input key selections comprising at least a current input key selection and a preceding input key selection; responsive to the preceding input key selection: generating a plurality of prefix objects corresponding with an initial portion of the ambiguous input comprising the preceding input key selection; and for each of at least two of the prefix objects, identifying a language object that corresponds with the prefix object; outputting the prefix object as a proposed textual interpretation of the initial portion of the ambiguous input; and enabling a user of the handheld electronic device to select from the at least two prefix objects; responsive to the current input key selection: outputting a text output as being a proposed textual interpretation of the ambiguous input and having an arrangement of linguistic elements different than the arrangement of linguistic elements of the ambiguous input.
|
10. A handheld electronic device comprising an input apparatus, a processor apparatus, and an output apparatus, the processor apparatus comprising a processor and a memory, the memory having stored therein a number of routines which, when executed by the processor, cause the handheld electronic device to be adapted to perform operations comprising: detecting as an ambiguous input a plurality of input key selections comprising at least a current input key selection and a preceding input key selection; responsive to the preceding input key selection: generating a plurality of prefix objects corresponding with an initial portion of the ambiguous input comprising the preceding input key selection; and for each of at least two of the prefix objects, identifying a language object that corresponds with the prefix object; outputting the prefix object as a proposed textual interpretation of the initial portion of the ambiguous input; and enabling a user of the handheld electronic device to select from the at least two prefix objects; responsive to the current input key selection: outputting a text output as being a proposed textual interpretation of the ambiguous input and having an arrangement of linguistic elements different than the arrangement of linguistic elements of the ambiguous input. 11. The handheld electronic device of claim 10 , wherein the current input key selection occurs prior to a delimiter input.
| 0.542486 |
17. The system of claim 11 , wherein the processor is configured to cluster the obtained sets of annotations into annotation clusters based on the features within the piece of source data identified by the annotations.
|
17. The system of claim 11 , wherein the processor is configured to cluster the obtained sets of annotations into annotation clusters based on the features within the piece of source data identified by the annotations. 18. The system of claim 17 , wherein: the set source data comprises image data; and the annotation clusters comprise annotations that are within a distance threshold from each other within the image data.
| 0.948827 |
16. A device for access to a production among a plurality of productions of at least one grammar, said device comprising: a unit configured to store the productions, the productions forming a set of rules for constructing hierarchical data of a structured electronic XML document, said plurality of productions comprising a first group of productions associated with a first group of events and each production of the first group being defined for an event type and contextual information including a name associated with an element in the hierarchical data, and a second group of productions associated with a second group of events distinct from the first group of events, said events describing the hierarchical data of the structured electronic XML document; a first determination unit configured to determine whether an event in question is of the first group by including determining whether the event in question is defined by a name associated with an element in addition to an event type; a prediction unit configured to predict a production from the first group that is associated with the event in question in the event that the first determination unit determines that the event in question is of the first group; and a second determining unit that determines the event in question is solely defined by an event type, and determines a production from the second group that is associated with the event in question by calculating identification data for said event in question and by recovering a production in a table including productions of the second group from said calculated identification data in the event that the first determining unit determines that the event in question is not of the first group.
|
16. A device for access to a production among a plurality of productions of at least one grammar, said device comprising: a unit configured to store the productions, the productions forming a set of rules for constructing hierarchical data of a structured electronic XML document, said plurality of productions comprising a first group of productions associated with a first group of events and each production of the first group being defined for an event type and contextual information including a name associated with an element in the hierarchical data, and a second group of productions associated with a second group of events distinct from the first group of events, said events describing the hierarchical data of the structured electronic XML document; a first determination unit configured to determine whether an event in question is of the first group by including determining whether the event in question is defined by a name associated with an element in addition to an event type; a prediction unit configured to predict a production from the first group that is associated with the event in question in the event that the first determination unit determines that the event in question is of the first group; and a second determining unit that determines the event in question is solely defined by an event type, and determines a production from the second group that is associated with the event in question by calculating identification data for said event in question and by recovering a production in a table including productions of the second group from said calculated identification data in the event that the first determining unit determines that the event in question is not of the first group. 20. A device according to claim 16 , further comprising a third determination unit configured to determine production associated with an event of the second group, said third determination unit comprising a table associating, with identification data for an event, a production describing said event.
| 0.506384 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.