sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
2. The method as in claim 1 further comprising: based on the analyzing, creating a tree in which a first term in a given grouping of the groupings is defined as a parent node in the tree and a second term in the given grouping is defined as a child node of the parent node in the tree. both the first term and the second term in the given grouping being consecutive text-based terms present in the order collection.
|
2. The method as in claim 1 further comprising: based on the analyzing, creating a tree in which a first term in a given grouping of the groupings is defined as a parent node in the tree and a second term in the given grouping is defined as a child node of the parent node in the tree. both the first term and the second term in the given grouping being consecutive text-based terms present in the order collection. 3. The method of claim 2 further comprising: maintaining a frequency counter for each parent node in the tree, a frequency counter of a given parent node being incremented when the first term is found in a grouping of the ordered collection; and maintaining a frequency counter for each child node in the tree, the frequency counter of a given child node being incremented for each detected occurrence of the second term in the ordered collection that immediately follows an occurrence of the first term.
| 0.783754 |
4. The system of claim 1 , where the backoff factors are derived using discriminative training of a translation model.
|
4. The system of claim 1 , where the backoff factors are derived using discriminative training of a translation model. 5. The system of claim 4 , where indicator feature functions are used to identify the backoff factors.
| 0.973671 |
40. A search engine as claimed in claim 38 or 39 , including a cluster for processing indices output by said index network in response to said query, generating term frequency vectors for data indexed by said indices, comparing similarities between the indexed data on the basis of a distance between said frequency vectors and generating content based categories on the basis of said distances and placing the output indices into said categories for display.
|
40. A search engine as claimed in claim 38 or 39 , including a cluster for processing indices output by said index network in response to said query, generating term frequency vectors for data indexed by said indices, comparing similarities between the indexed data on the basis of a distance between said frequency vectors and generating content based categories on the basis of said distances and placing the output indices into said categories for display. 41. A search engine as claimed in claim 40 , wherein the feature extractor receives content features of said categories from said cluster and selects a unique descriptive feature for each category.
| 0.837342 |
1. A method for implementing intelligent agent services, comprising: generating, via a computer, an ontological domain for an individual based upon a plurality of sets of information elements, wherein a set of the information elements represents aspects of a detectable behavior of the individual at a point in time, the detectable behavior comprising one of a number of detectable behaviors of the individual occurring within a physical and virtual geography and in relation to time, the detectable behaviors including an activity conducted by the individual at a computer and a presence of the individual at a function; determining, via the computer, relevance of relationships among the plurality of sets of the information elements in the ontological domain, wherein a relationship determined to be relevant is identified as an interest of the individual; and searching sources of information using the plurality of sets of the information elements having the relationship determined to be relevant, and identifying a solution for satisfying the interest responsive to the searching, the solution having a relationship to the activity conducted at the computer and the presence of the individual at the function.
|
1. A method for implementing intelligent agent services, comprising: generating, via a computer, an ontological domain for an individual based upon a plurality of sets of information elements, wherein a set of the information elements represents aspects of a detectable behavior of the individual at a point in time, the detectable behavior comprising one of a number of detectable behaviors of the individual occurring within a physical and virtual geography and in relation to time, the detectable behaviors including an activity conducted by the individual at a computer and a presence of the individual at a function; determining, via the computer, relevance of relationships among the plurality of sets of the information elements in the ontological domain, wherein a relationship determined to be relevant is identified as an interest of the individual; and searching sources of information using the plurality of sets of the information elements having the relationship determined to be relevant, and identifying a solution for satisfying the interest responsive to the searching, the solution having a relationship to the activity conducted at the computer and the presence of the individual at the function. 2. The method of claim 1 , wherein the generating includes creating subdomains of contextually organized collections of the plurality of sets of the information elements, the subdomains including any orthogonally related data identified among the detectable behaviors.
| 0.652683 |
47. A computer readable storage medium having stored thereon computer-executable instructions for application-layer monitoring of communication between one or more database clients and one or more database sewers, the computer executable instructions configured to: on a database device at a first network location between one or more database clients residing at one or more second network locations distinct from the first network location and one or more database servers residing at one or more third network locations distinct from both the first network location and the one or more second network locations using one or more decoders on the database device to: receive database messages communicated over the network from any of the database clients residing at the one or more second network locations and intended for the database servers at the one or more third network locations and database messages communicated from the database servers and intended for the database clients; decoding the database messages, wherein decoding the database messages comprises decoding a protocol generated as an output of a database connectivity driver in response to an input by a database application residing at an application layer, wherein decoding the database messages comprises decoding database messages of database implementations different from each other and, wherein the database connectivity driver is utilized by the one or more database clients to communicate with the database serve; and extracting query-language statements from the database messages, wherein the query-language statements are created by the database application at one or more of the database clients and provided as input to the database connectivity driver and the database connectivity driver generate the database message as an output based on the query-language statement; and at an application layer above the decoding layer at the first network location, using a monitoring application on the database device for receiving query-language statements extracted at the decoders and recording observations on the database messages based at least in part on the query-language statements extracted at the decoding layer.
|
47. A computer readable storage medium having stored thereon computer-executable instructions for application-layer monitoring of communication between one or more database clients and one or more database sewers, the computer executable instructions configured to: on a database device at a first network location between one or more database clients residing at one or more second network locations distinct from the first network location and one or more database servers residing at one or more third network locations distinct from both the first network location and the one or more second network locations using one or more decoders on the database device to: receive database messages communicated over the network from any of the database clients residing at the one or more second network locations and intended for the database servers at the one or more third network locations and database messages communicated from the database servers and intended for the database clients; decoding the database messages, wherein decoding the database messages comprises decoding a protocol generated as an output of a database connectivity driver in response to an input by a database application residing at an application layer, wherein decoding the database messages comprises decoding database messages of database implementations different from each other and, wherein the database connectivity driver is utilized by the one or more database clients to communicate with the database serve; and extracting query-language statements from the database messages, wherein the query-language statements are created by the database application at one or more of the database clients and provided as input to the database connectivity driver and the database connectivity driver generate the database message as an output based on the query-language statement; and at an application layer above the decoding layer at the first network location, using a monitoring application on the database device for receiving query-language statements extracted at the decoders and recording observations on the database messages based at least in part on the query-language statements extracted at the decoding layer. 60. The computer-executable instructions of claim 47 , operable, at the decoding layer, to decode Distributed Relational Database Architecture (DRDA) database messages, Tabular Data Stream (TDS) database messages, and OracleNet database messages.
| 0.686968 |
34. A system for processing a markup language file having one or more portions, the system having a computer having at least a processor, a memory operably coupled to said memory, said memory being configured for storing a computer program executable by said processor, said computer program comprising: computer program code for automatically downloading by said processor a first markup language file using the hyper text transfer protocol and automatically referencing by said processor the first markup language file by its uniform resource location (URL) or by a name of a local file on a system on which a user is operating, said first markup language file including arbitrarily named tags; computer program code for automatically determining by said processor when the steps of downloading and referencing are complete and, upon a determination that the steps of downloading and referencing are complete, computer program code for automatically parsing by said processor the first markup language file for one or more portions of the first markup language file; computer program code for automatically determining by said processor when the step of parsing is complete and, upon a determination that the step of parsing is complete, computer program code for automatically storing by said processor each portion of the first markup language file into a directory structure containing folders, subfolders, and files, complying with the structure of the first markup language file, wherein each of the folders and subfolders depend from the tag names in the markup language file; and computer program code for automatically determining by said processor when the step of storing is complete and, upon a determination that the step of storing is complete, automatically modifying the content of markup language documents.
|
34. A system for processing a markup language file having one or more portions, the system having a computer having at least a processor, a memory operably coupled to said memory, said memory being configured for storing a computer program executable by said processor, said computer program comprising: computer program code for automatically downloading by said processor a first markup language file using the hyper text transfer protocol and automatically referencing by said processor the first markup language file by its uniform resource location (URL) or by a name of a local file on a system on which a user is operating, said first markup language file including arbitrarily named tags; computer program code for automatically determining by said processor when the steps of downloading and referencing are complete and, upon a determination that the steps of downloading and referencing are complete, computer program code for automatically parsing by said processor the first markup language file for one or more portions of the first markup language file; computer program code for automatically determining by said processor when the step of parsing is complete and, upon a determination that the step of parsing is complete, computer program code for automatically storing by said processor each portion of the first markup language file into a directory structure containing folders, subfolders, and files, complying with the structure of the first markup language file, wherein each of the folders and subfolders depend from the tag names in the markup language file; and computer program code for automatically determining by said processor when the step of storing is complete and, upon a determination that the step of storing is complete, automatically modifying the content of markup language documents. 37. The system of claim 34 wherein said computer program further comprises computer program code for reading said URL embedded in computer program code.
| 0.50324 |
37. A system, comprising: a host computing device including a machine learning network, the host computing device initializing at least one of i) nodes in the network and ii) connections between the nodes, to a respective predetermined strength value, the host computing device outputting questions, each question corresponding to at least one of the connections; and a plurality of client computing devices receiving the questions, the client computing devices transmitting guesstimates from users thereof in response to the questions, wherein the host computing device adjusts the predetermined strength value as a function of the guesstimates, and wherein the network is a consensus network and the users are able to combine their own guesstimates with those of other users to develop and evaluate the network.
|
37. A system, comprising: a host computing device including a machine learning network, the host computing device initializing at least one of i) nodes in the network and ii) connections between the nodes, to a respective predetermined strength value, the host computing device outputting questions, each question corresponding to at least one of the connections; and a plurality of client computing devices receiving the questions, the client computing devices transmitting guesstimates from users thereof in response to the questions, wherein the host computing device adjusts the predetermined strength value as a function of the guesstimates, and wherein the network is a consensus network and the users are able to combine their own guesstimates with those of other users to develop and evaluate the network. 47. The system according to claim 37 , wherein additional user guesstimates are made after examining output from the machine learning network.
| 0.770017 |
1. A computer-readable storage medium that is not a signal having computer-executable instructions stored thereon which, when executed by a computer system, cause the computer system to perform a method comprising: creating a plurality of iterators, one of the plurality of iterators being a parent iterator operating at least a further one of the plurality of iterators as a child iterator, the parent iterator comprising first fixed state information that remains constant over a life of the parent iterator, first dynamic state information that is updated over the life of the parent iterator, and a first checkpoint mechanism that includes a first stack structure associated with a plurality of entries, the first checkpoint mechanism being responsive to an internal checkpoint command to copy at least one instance of only the first dynamic state information, and not the first fixed state information, into one of the entries of the first stack structure, and to update a first counter mechanism to indicate that a first checkpoint including only the first dynamic state information has been copied into the first stack structure, and the child iterator comprising second fixed state information that remains constant over a life of the child iterator, second dynamic state information that is updated over the life of the child iterator, and a second checkpoint mechanism that includes a second stack structure associated with a plurality of entries, the second checkpoint mechanism being responsive to an external checkpoint command received from the parent iterator to copy at least one instance of only the second dynamic state information, and not the second fixed state information, into one of the entries of the second stack structure, and to update a second counter mechanism to indicate that a second checkpoint including the second dynamic state information has been copied into the second stack structure; traversing at least the child iterator through at least a portion of at least one postings list in response to at least one search request; updating at least one instance of the second dynamic state information in response to traversing the child iterator through at least a portion of the postings list; storing the first checkpoint in the first stack structure, wherein the first checkpoint includes the first dynamic state information; storing the second checkpoint in the second stack structure, wherein the second checkpoint includes the second dynamic state information; restoring at least the child iterator to a previous state by copying the second dynamic state information from the second checkpoint; and restoring at least the parent iterator to the previous state by copying the first dynamic state information from the first checkpoint.
|
1. A computer-readable storage medium that is not a signal having computer-executable instructions stored thereon which, when executed by a computer system, cause the computer system to perform a method comprising: creating a plurality of iterators, one of the plurality of iterators being a parent iterator operating at least a further one of the plurality of iterators as a child iterator, the parent iterator comprising first fixed state information that remains constant over a life of the parent iterator, first dynamic state information that is updated over the life of the parent iterator, and a first checkpoint mechanism that includes a first stack structure associated with a plurality of entries, the first checkpoint mechanism being responsive to an internal checkpoint command to copy at least one instance of only the first dynamic state information, and not the first fixed state information, into one of the entries of the first stack structure, and to update a first counter mechanism to indicate that a first checkpoint including only the first dynamic state information has been copied into the first stack structure, and the child iterator comprising second fixed state information that remains constant over a life of the child iterator, second dynamic state information that is updated over the life of the child iterator, and a second checkpoint mechanism that includes a second stack structure associated with a plurality of entries, the second checkpoint mechanism being responsive to an external checkpoint command received from the parent iterator to copy at least one instance of only the second dynamic state information, and not the second fixed state information, into one of the entries of the second stack structure, and to update a second counter mechanism to indicate that a second checkpoint including the second dynamic state information has been copied into the second stack structure; traversing at least the child iterator through at least a portion of at least one postings list in response to at least one search request; updating at least one instance of the second dynamic state information in response to traversing the child iterator through at least a portion of the postings list; storing the first checkpoint in the first stack structure, wherein the first checkpoint includes the first dynamic state information; storing the second checkpoint in the second stack structure, wherein the second checkpoint includes the second dynamic state information; restoring at least the child iterator to a previous state by copying the second dynamic state information from the second checkpoint; and restoring at least the parent iterator to the previous state by copying the first dynamic state information from the first checkpoint. 2. The storage medium of claim 1 , further comprising instructions for creating at least a further child iterator, the further child iterator comprising: third fixed state information that remains constant over a life of the further child iterator, third dynamic state information that is updated over the life of the further child iterator, and a third checkpoint mechanism that includes a third stack structure having a plurality of entries, the third checkpoint mechanism being responsive to an external checkpoint command received from the parent iterator to copy at least one instance of only the third dynamic state information, and not the third fixed state information, into one of the entries of the third stack structure, and to update a third counter mechanism to indicate that a third checkpoint including the third dynamic state information has been copied into the third stack structure.
| 0.538497 |
1. A computer implemented method implemented with a processor, comprising: maintaining an automated follow and un-follow architecture comprising a database application, a relational database table, an implicit follow mechanism, a follow mechanism, an automatic un-follow mechanism, an un-follow mechanism, and an activity stream framework, the database application maintaining a plurality of database objects, at least some of the plurality of database objects being marked to support implicit following, and at least some of the plurality of database objects being coupled to the activity stream framework and publishing updates to the activity stream framework, the relational database table being coupled to the follow mechanism and the un-follow mechanism, the relational database table conforming to a schema having a first column identifying users following database objects, a second column identifying followable database objects, and a third column identifying database object types, the relational database table having a plurality of entries corresponding to a plurality of follow relationships between database objects and users, the implicit follow mechanism being coupled to the follow mechanism, the implicit follow mechanism triggering the follow mechanism to issue creation instructions corresponding to relationships between database objects and users, the follow mechanism being coupled to the implicit follow mechanism and the relational database table, the follow mechanism issuing the creation instructions corresponding to the relationships between the database objects and the users to add entries to the relational database table, issuance of the creation instructions being triggered by the implicit follow mechanism, the automatic un-follow mechanism being coupled to the un-follow mechanism, the automatic un-follow mechanism triggering the un-follow mechanism to issue disassociation instructions corresponding to deletion of entries in the relational database table, the un-follow mechanism being coupled to the automatic un-follow mechanism and the relational database table, the un-follow mechanism issuing the disassociation instructions corresponding to the deletion of the entries in the relational database table, issuance of the disassociation instructions being triggered by the implicit follow mechanism, and the activity stream framework receiving and maintaining published updates for objects types that publish activity to the activity stream framework; identifying the plurality of database objects maintained by the database application; identifying, among the plurality of database objects a first database object configured to allow implicit following, the first database object being marked to support implicit following, implicit following comprising automatically determining when a user is to be associated with one of the plurality of database objects for following and configuring following of one of the plurality of database objects when it is determined that the user is to be associated with one of the plurality of database objects; establishing implicit following of the first database object, the implicit following of the first database object being established after a determination that the first database object is enabled for implicit following by: identifying an existence of a relationship that is between the first database object and the user based upon an automatic determination to associate the user with the first database object by the implicit follow mechanism; issuing one or more first instructions to update the relational database table by the follow mechanism, issuance of the one or more first instructions being triggered by the implicit follow mechanism, and the one or more first instructions causing a creation of an entry in the relational database table, the entry comprising a row of the relational database table with a first field in the first column populated with a user ID of the user, a second field in the second column populated with an object ID of the database object, and a third field in the third column populated with an object type of the database object identified in the second field, the entry registering the implicit following of the first database object by the user, wherein creation of the entry corresponds to registering a follow relationship between the first database object and the user, wherein when an automatic determination that the user is to be disassociated with the database object is made by the automatic un-follow mechanism, the un-follow mechanism is triggered by the automatic un-follow mechanism to issue one or more second instructions to update the relational database table by the un-follow mechanism, the one or more second instructions causing a deletion of the entry from the relational database table, wherein deletion of the entry corresponds to an un-follow action of the first database object for the user; identifying a change to the first database object, the change to the first database object being published to an activity stream of the activity stream framework; processing the relational database table to identify the implicit following of the first database object by the user; determining that a set of conditions are met to provide a message regarding the change to the first database object to the user, the set of conditions specifying that the object type corresponding to the first database object publishes activity to the activity stream and that the user has authorization to access the first database object; and providing, in response to determining that the set of conditions are met, the message regarding the change to the first database object to the user.
|
1. A computer implemented method implemented with a processor, comprising: maintaining an automated follow and un-follow architecture comprising a database application, a relational database table, an implicit follow mechanism, a follow mechanism, an automatic un-follow mechanism, an un-follow mechanism, and an activity stream framework, the database application maintaining a plurality of database objects, at least some of the plurality of database objects being marked to support implicit following, and at least some of the plurality of database objects being coupled to the activity stream framework and publishing updates to the activity stream framework, the relational database table being coupled to the follow mechanism and the un-follow mechanism, the relational database table conforming to a schema having a first column identifying users following database objects, a second column identifying followable database objects, and a third column identifying database object types, the relational database table having a plurality of entries corresponding to a plurality of follow relationships between database objects and users, the implicit follow mechanism being coupled to the follow mechanism, the implicit follow mechanism triggering the follow mechanism to issue creation instructions corresponding to relationships between database objects and users, the follow mechanism being coupled to the implicit follow mechanism and the relational database table, the follow mechanism issuing the creation instructions corresponding to the relationships between the database objects and the users to add entries to the relational database table, issuance of the creation instructions being triggered by the implicit follow mechanism, the automatic un-follow mechanism being coupled to the un-follow mechanism, the automatic un-follow mechanism triggering the un-follow mechanism to issue disassociation instructions corresponding to deletion of entries in the relational database table, the un-follow mechanism being coupled to the automatic un-follow mechanism and the relational database table, the un-follow mechanism issuing the disassociation instructions corresponding to the deletion of the entries in the relational database table, issuance of the disassociation instructions being triggered by the implicit follow mechanism, and the activity stream framework receiving and maintaining published updates for objects types that publish activity to the activity stream framework; identifying the plurality of database objects maintained by the database application; identifying, among the plurality of database objects a first database object configured to allow implicit following, the first database object being marked to support implicit following, implicit following comprising automatically determining when a user is to be associated with one of the plurality of database objects for following and configuring following of one of the plurality of database objects when it is determined that the user is to be associated with one of the plurality of database objects; establishing implicit following of the first database object, the implicit following of the first database object being established after a determination that the first database object is enabled for implicit following by: identifying an existence of a relationship that is between the first database object and the user based upon an automatic determination to associate the user with the first database object by the implicit follow mechanism; issuing one or more first instructions to update the relational database table by the follow mechanism, issuance of the one or more first instructions being triggered by the implicit follow mechanism, and the one or more first instructions causing a creation of an entry in the relational database table, the entry comprising a row of the relational database table with a first field in the first column populated with a user ID of the user, a second field in the second column populated with an object ID of the database object, and a third field in the third column populated with an object type of the database object identified in the second field, the entry registering the implicit following of the first database object by the user, wherein creation of the entry corresponds to registering a follow relationship between the first database object and the user, wherein when an automatic determination that the user is to be disassociated with the database object is made by the automatic un-follow mechanism, the un-follow mechanism is triggered by the automatic un-follow mechanism to issue one or more second instructions to update the relational database table by the un-follow mechanism, the one or more second instructions causing a deletion of the entry from the relational database table, wherein deletion of the entry corresponds to an un-follow action of the first database object for the user; identifying a change to the first database object, the change to the first database object being published to an activity stream of the activity stream framework; processing the relational database table to identify the implicit following of the first database object by the user; determining that a set of conditions are met to provide a message regarding the change to the first database object to the user, the set of conditions specifying that the object type corresponding to the first database object publishes activity to the activity stream and that the user has authorization to access the first database object; and providing, in response to determining that the set of conditions are met, the message regarding the change to the first database object to the user. 5. The method of claim 1 , in which the automatic determination that the user is to be disassociated with the database object is based on a status change that makes the user unqualified to follow the first database object.
| 0.648385 |
1. A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by one of a Central Processing Unit (CPU) processor and at least one Graphics Processing Unit (GPU) processor to perform: selecting a document from a set of documents to be analyzed; converting a character stream from the document into a token stream based on tokenization rules; removing irrelevant tokens from the token stream; converting tokens remaining in the token stream into an integer domain representation based on a domain specific ontology dictionary, wherein each of the tokens is mapped to an integer based on mappings in the domain specific ontology dictionary; storing the integer domain representation to a Graphics Processing Unit (GPU) processing queue of each of one or more GPUs; receiving a result set from the one or more GPUs, wherein the result set includes tuples of 1) a specific pattern and 2) an offset from a beginning of the integer domain representation, and wherein the result set is generated using a compiled super Regular Expression (REGEX) that is compiled using the domain specific ontology dictionary; storing the result set into an index for use in processing a search query; and persisting the integer domain representation once for the document for processing of the document with a different compiled super REGEX.
|
1. A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by one of a Central Processing Unit (CPU) processor and at least one Graphics Processing Unit (GPU) processor to perform: selecting a document from a set of documents to be analyzed; converting a character stream from the document into a token stream based on tokenization rules; removing irrelevant tokens from the token stream; converting tokens remaining in the token stream into an integer domain representation based on a domain specific ontology dictionary, wherein each of the tokens is mapped to an integer based on mappings in the domain specific ontology dictionary; storing the integer domain representation to a Graphics Processing Unit (GPU) processing queue of each of one or more GPUs; receiving a result set from the one or more GPUs, wherein the result set includes tuples of 1) a specific pattern and 2) an offset from a beginning of the integer domain representation, and wherein the result set is generated using a compiled super Regular Expression (REGEX) that is compiled using the domain specific ontology dictionary; storing the result set into an index for use in processing a search query; and persisting the integer domain representation once for the document for processing of the document with a different compiled super REGEX. 4. The computer program product of claim 1 , wherein the program code is executable by at least one processor to perform: selecting a REGEX rule from a set of character based domain REGEX rules; applying the domain specific ontology dictionary to map a character based REGEX to an integer based REGEX; compiling the integer based REGEX; and adding the compiled integer based REGEX to the super REGEX.
| 0.636116 |
8. Apparatus for executing a software application relating to an audio-visual presentation, wherein the audio-visual presentation is one of a plurality of titles stored on a first storage medium, the apparatus comprising means for detecting a title selection request; means for reading data from the first storage medium, the data comprising files with audio-visual presentation data and software application data, the software application data having a language label associated, wherein the means for reading data from the first storage medium operates in response to the detection of a title selection request in said means for detecting a title selection request; means for generating or updating a virtual file system based on the files and software application data read from the first storage medium; means for comparing the language label associated with the read software application data with a preferred language identifier within said virtual file system; means for selecting within said virtual file system software application data that are associated with a language label matching the preferred language identifier; caching means for caching the selected software application data that are associated with a language label matching the preferred language identifier; means for generating first audio-visual presentation from said audio-visual presentation data upon said virtual file system being generated or updated, wherein the first audio-visual presentation starts automatically while said caching means caches the selected software application data, and for generating a second audio-visual presentation after said caching means cached the selected software application data; means for executing a software application based on the cached data while generating said second audio-visual presentation, wherein the software application is distinct from the audio-visual presentation and the software application modifies the audio-visual presentation, and wherein said title selection request refers to the title of the second audio-visual presentation.
|
8. Apparatus for executing a software application relating to an audio-visual presentation, wherein the audio-visual presentation is one of a plurality of titles stored on a first storage medium, the apparatus comprising means for detecting a title selection request; means for reading data from the first storage medium, the data comprising files with audio-visual presentation data and software application data, the software application data having a language label associated, wherein the means for reading data from the first storage medium operates in response to the detection of a title selection request in said means for detecting a title selection request; means for generating or updating a virtual file system based on the files and software application data read from the first storage medium; means for comparing the language label associated with the read software application data with a preferred language identifier within said virtual file system; means for selecting within said virtual file system software application data that are associated with a language label matching the preferred language identifier; caching means for caching the selected software application data that are associated with a language label matching the preferred language identifier; means for generating first audio-visual presentation from said audio-visual presentation data upon said virtual file system being generated or updated, wherein the first audio-visual presentation starts automatically while said caching means caches the selected software application data, and for generating a second audio-visual presentation after said caching means cached the selected software application data; means for executing a software application based on the cached data while generating said second audio-visual presentation, wherein the software application is distinct from the audio-visual presentation and the software application modifies the audio-visual presentation, and wherein said title selection request refers to the title of the second audio-visual presentation. 9. Apparatus according to claim 8 , further comprising means for processing the cached data, wherein the processing comprises preparing archived Java code for setting up a Java Virtual Machine.
| 0.745199 |
8. A computing system comprising: one or more processors; and one or more computer readable media maintaining instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: determining one or more locations amongst multiple different locations in a file system, the one or more locations storing one or more files that are associated with a domain of a user; generating, based at least in part on linguistic characteristics of the one or more files that are associated with the domain of the user, a personal language model for the user; receiving a Latin character string via an input method editor interface; determining, based at least in part on the personal language model, a first non-Latin character string that is associated with the Latin character string; determining, based at least in part on a general language model, a second non-Latin character string that is associated with the Latin character string; determining a first conversion probability for the first non-Latin character string; determining a second conversion probability for the second non-Latin character string; determining that the first conversion probability is higher than the second conversion probability; and providing the first non-Latin character string based at least in part on the determining that the first conversion probability is higher than the second conversion probability.
|
8. A computing system comprising: one or more processors; and one or more computer readable media maintaining instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: determining one or more locations amongst multiple different locations in a file system, the one or more locations storing one or more files that are associated with a domain of a user; generating, based at least in part on linguistic characteristics of the one or more files that are associated with the domain of the user, a personal language model for the user; receiving a Latin character string via an input method editor interface; determining, based at least in part on the personal language model, a first non-Latin character string that is associated with the Latin character string; determining, based at least in part on a general language model, a second non-Latin character string that is associated with the Latin character string; determining a first conversion probability for the first non-Latin character string; determining a second conversion probability for the second non-Latin character string; determining that the first conversion probability is higher than the second conversion probability; and providing the first non-Latin character string based at least in part on the determining that the first conversion probability is higher than the second conversion probability. 11. The computing system as recited in claim 8 , wherein the one or more locations are identified by the user via a location selection interface as locations that contain content specific to the domain of the user, and the domain of the user is associated with at least one of a profession of the user or interests of the user.
| 0.502165 |
1. A computer-implemented method for providing a legitimacy rating of a content source, comprising: receiving, by a computer system, a request for a document, the request comprising a request for a document associated with a concept; providing, by the computer system, an electronic document by a document provider based on the request, wherein the electronic document is associated with a content source and selected based on a relevance to the concept; and providing, by the computer system, a legitimacy rating of the content source wherein the legitimacy rating is based on a history rating and a transaction volume rating and wherein at least one of the history rating and the transaction volume rating comprise a metric that is normalized based on at least one of history ratings and transaction volume ratings of a plurality of content sources who provide documents to the document provider.
|
1. A computer-implemented method for providing a legitimacy rating of a content source, comprising: receiving, by a computer system, a request for a document, the request comprising a request for a document associated with a concept; providing, by the computer system, an electronic document by a document provider based on the request, wherein the electronic document is associated with a content source and selected based on a relevance to the concept; and providing, by the computer system, a legitimacy rating of the content source wherein the legitimacy rating is based on a history rating and a transaction volume rating and wherein at least one of the history rating and the transaction volume rating comprise a metric that is normalized based on at least one of history ratings and transaction volume ratings of a plurality of content sources who provide documents to the document provider. 5. The method of claim 1 , wherein the electronic document is an advertisement, and wherein the content source is an advertiser.
| 0.600386 |
1. A processor-implemented method of improving a computer system, the processor-implemented method comprising: receiving, by the processor, a data stream that describes graph nodes in a non-hierarchical graph database, wherein each of the graph nodes represents a synthetic context-based object, and wherein synthetic context-based objects are generated by: associating, by the processor, a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object, wherein the synthetic context-based object, the non-contextual data object, and the context object are in a same processing and storage logic, and wherein the synthetic context-based object points to the non-contextual data object and the context object; defining, by the processor, multiple graph node clusters from the graph nodes in the non-hierarchical graph database, wherein the multiple graph node clusters share a common non-contextual data object; generating, by the processor, a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters by identifying the common non-contextual data object; transmitting, by the processor, only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; communicating, by the processor, the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and executing, by the processor, a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes.
|
1. A processor-implemented method of improving a computer system, the processor-implemented method comprising: receiving, by the processor, a data stream that describes graph nodes in a non-hierarchical graph database, wherein each of the graph nodes represents a synthetic context-based object, and wherein synthetic context-based objects are generated by: associating, by the processor, a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object, wherein the synthetic context-based object, the non-contextual data object, and the context object are in a same processing and storage logic, and wherein the synthetic context-based object points to the non-contextual data object and the context object; defining, by the processor, multiple graph node clusters from the graph nodes in the non-hierarchical graph database, wherein the multiple graph node clusters share a common non-contextual data object; generating, by the processor, a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters by identifying the common non-contextual data object; transmitting, by the processor, only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; communicating, by the processor, the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and executing, by the processor, a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes. 3. The processor-implemented method of claim 1 , wherein the graph nodes represent data nodes.
| 0.647218 |
18. A computer program product comprising: a computer-usable non-transitory instruction media that, when executed by a computer, cause the computer to perform a method comprising a method of knowledge gathering for transforming product descriptions into process networks; the method comprising providing a library of product descriptions; selecting for product visualization a product description from said library of product descriptions; using a product visualizer to display the product defined by the selected product description; gathering additional product information further defining a product type of the visualized product; and mapping the visualized product description and gathered additional product type information into a product type abstraction of a classification system.
|
18. A computer program product comprising: a computer-usable non-transitory instruction media that, when executed by a computer, cause the computer to perform a method comprising a method of knowledge gathering for transforming product descriptions into process networks; the method comprising providing a library of product descriptions; selecting for product visualization a product description from said library of product descriptions; using a product visualizer to display the product defined by the selected product description; gathering additional product information further defining a product type of the visualized product; and mapping the visualized product description and gathered additional product type information into a product type abstraction of a classification system. 19. The computer program product of claim 18 , wherein gathering additionl product type information further defining the visualized product comprises gathering additional product type information provided via a graphical user interface.
| 0.63722 |
1. An apparatus, comprising: a processor circuit; and non-transitory computer-readable storage media having stored thereon instructions for execution by the processor circuit to: determine one or more respective suitability metrics for each of one or more candidate partitioning policies for a set of pixel shader inputs for a graphics frame, each candidate partitioning policy comprising one or more rules for partitioning the set of pixel shader inputs for multi-phase pixel shading based on quality sensitivity values for the pixel shader inputs; select a partitioning policy for the set of pixel shader inputs from among the one or more candidate partitioning policies based on the determined suitability metrics; and construct a multi-phase pixel shader for the graphics frame by partitioning the set of pixel shader inputs into multiple classes according to the selected partitioning policy.
|
1. An apparatus, comprising: a processor circuit; and non-transitory computer-readable storage media having stored thereon instructions for execution by the processor circuit to: determine one or more respective suitability metrics for each of one or more candidate partitioning policies for a set of pixel shader inputs for a graphics frame, each candidate partitioning policy comprising one or more rules for partitioning the set of pixel shader inputs for multi-phase pixel shading based on quality sensitivity values for the pixel shader inputs; select a partitioning policy for the set of pixel shader inputs from among the one or more candidate partitioning policies based on the determined suitability metrics; and construct a multi-phase pixel shader for the graphics frame by partitioning the set of pixel shader inputs into multiple classes according to the selected partitioning policy. 8. The apparatus of claim 1 , the set of pixel shader inputs comprising a set of pixel shader inputs for an original pixel shader of the graphics frame.
| 0.620362 |
1. A method for generating an aggregated social feed the method comprising: receiving a feed from each of a plurality of social networking systems, each feed comprising a plurality of content items personalized for a user based on the user's social connections in the social networking system; determining a grouping criteria based on content in the plurality of content items; forming a group including a plurality of content items satisfying the grouping criteria; scoring the content items from the plurality of feeds based on one or more relevance factors, wherein each content item is scored by: assigning one or more of the relevance factors to the content item, weighting the assigned relevance factors based on a target velocity of the aggregated social feed, the target velocity representing a predetermined number of content items received from the plurality of social networking system feeds to be included in the aggregated social feed, wherein the weighting is applied to achieve the target velocity for the aggregated social feed, and calculating a composite score based on the weighted relevance factors for the content item; selecting one or more of the scored content items having a composite score that meets a relevance threshold; and sending the selected content items in the aggregated social feed for display in a content region of a page.
|
1. A method for generating an aggregated social feed the method comprising: receiving a feed from each of a plurality of social networking systems, each feed comprising a plurality of content items personalized for a user based on the user's social connections in the social networking system; determining a grouping criteria based on content in the plurality of content items; forming a group including a plurality of content items satisfying the grouping criteria; scoring the content items from the plurality of feeds based on one or more relevance factors, wherein each content item is scored by: assigning one or more of the relevance factors to the content item, weighting the assigned relevance factors based on a target velocity of the aggregated social feed, the target velocity representing a predetermined number of content items received from the plurality of social networking system feeds to be included in the aggregated social feed, wherein the weighting is applied to achieve the target velocity for the aggregated social feed, and calculating a composite score based on the weighted relevance factors for the content item; selecting one or more of the scored content items having a composite score that meets a relevance threshold; and sending the selected content items in the aggregated social feed for display in a content region of a page. 4. The method of claim 1 , wherein the grouping criteria comprises an author of the content item.
| 0.597172 |
16. A system comprising: a memory to store a plurality of instructions; and a processor to execute the plurality of instructions in the memory to: identify, as a keyword candidate, a first word included in one or more of previously submitted queries, calculate a first value based on a first frequency that the first word appears in the previously submitted queries, create a pair that includes the first word and a second word that differs from the first word, the second word being descriptive of a particular category of a plurality of categories, calculate a second value based on occurrences of the pair in a collection of documents, one or more documents, in the collection of documents, being classified in the particular category based on occurrences of the second word in the one or more documents, and the second value being calculated based on a second frequency that the first word appears in the one or more documents classified in the particular category, determine, based on the first value, that the first value satisfies a first threshold; determine, based on the second value, that the second value satisfies a second threshold, determine, based on the first value satisfying the first threshold and the second value satisfying the second threshold, that the first word is a keyword for the particular category, and store information associating the first word with the one or more documents, associated with the particular category, based on determining that the first word is the keyword for the particular category.
|
16. A system comprising: a memory to store a plurality of instructions; and a processor to execute the plurality of instructions in the memory to: identify, as a keyword candidate, a first word included in one or more of previously submitted queries, calculate a first value based on a first frequency that the first word appears in the previously submitted queries, create a pair that includes the first word and a second word that differs from the first word, the second word being descriptive of a particular category of a plurality of categories, calculate a second value based on occurrences of the pair in a collection of documents, one or more documents, in the collection of documents, being classified in the particular category based on occurrences of the second word in the one or more documents, and the second value being calculated based on a second frequency that the first word appears in the one or more documents classified in the particular category, determine, based on the first value, that the first value satisfies a first threshold; determine, based on the second value, that the second value satisfies a second threshold, determine, based on the first value satisfying the first threshold and the second value satisfying the second threshold, that the first word is a keyword for the particular category, and store information associating the first word with the one or more documents, associated with the particular category, based on determining that the first word is the keyword for the particular category. 22. The system of claim 16 , where the processor is further to: receive a search query that includes a form of the first word, and increase, in an ordered list of documents associated with the search query, a ranking of a document associated with the particular category, and where the ordered list of documents includes search results.
| 0.589268 |
1. A character input device comprising a display unit having a display screen simultaneously displaying, when characters of hiragana 50-character Japanese language phonetic syllabary or alphanumeric characters are divided into a plurality of groups comprising columns and rows, characters of at least two columns spanning from at least two lines on a character input region provided on said display screen, a first group of two input keys and a second group of two input keys, and a display control unit displaying, in an identifiable manner, at least one selected character among the characters displayed on the character input region, said display control unit sequentially changing at least one character which is to be focused so as to be identifiable by scrolling at least two lines of characters in accordance with an operation of said first group of two input keys, said at least two lines of characters being displayed simultaneously; and changing the character, which is being focused so as to be identifiable, with another character belonging to the same row as that character in accordance with operation of said second group of two input keys.
|
1. A character input device comprising a display unit having a display screen simultaneously displaying, when characters of hiragana 50-character Japanese language phonetic syllabary or alphanumeric characters are divided into a plurality of groups comprising columns and rows, characters of at least two columns spanning from at least two lines on a character input region provided on said display screen, a first group of two input keys and a second group of two input keys, and a display control unit displaying, in an identifiable manner, at least one selected character among the characters displayed on the character input region, said display control unit sequentially changing at least one character which is to be focused so as to be identifiable by scrolling at least two lines of characters in accordance with an operation of said first group of two input keys, said at least two lines of characters being displayed simultaneously; and changing the character, which is being focused so as to be identifiable, with another character belonging to the same row as that character in accordance with operation of said second group of two input keys. 6. A character input device as set forth in claim 1 , which displays the identifiably displayed character in a larger size larger than the remaining displayed characters.
| 0.918182 |
27. The method of claim 26 , wherein predicting a value comprises predicting multiple values for the multiple current form field objects in the current form instance.
|
27. The method of claim 26 , wherein predicting a value comprises predicting multiple values for the multiple current form field objects in the current form instance. 28. The method of claim 27 , wherein predicting multiple values comprises: displaying values selected from the possible values in the multiple current form field objects; and displaying a new value in place of one of the displayed values in one of the multiple current form field objects in response to user input, the new value being a predicted value based on generated likelihood assessments and the user input.
| 0.851175 |
2. A method for performing a telephone directory assistance function, comprising: for each of a plurality of callers: prompting the caller to speak a name associated with a desired directory listing; receiving a speech signal from the caller; applying a speech recognition algorithm to the received speech signal to recognize a name in a name vocabulary as corresponding to the received speech signal; determining a telephone number desired by the caller using the recognized name; releasing the desired telephone number to the caller; and creating a call record comprising the released telephone number and a stored representation of the speech signal to associate the stored representation of the speech signal with the released telephone number; processing according to a parameter modification algorithm a plurality of the call records to modify parameters of the speech recognition algorithm, said processing comprising: processing each of the call records by: deriving a plurality of name candidates from the released telephone number; for each name candidate, calculating a measure of probability that the name candidate corresponds to the stored representation of the speech signal; identifying a best name candidate having the highest measure of probability of the plurality of name candidates; applying acceptance criteria based on the calculated measures of probability and, in response to the acceptance criteria being met, creating a training record comprising the stored representation of the speech signal and the best candidate name; and processing the training records according to a training algorithm to modify the parameters of the speech recognition algorithm by, for each name of the name vocabulary: accumulating statistics for said name derived from plural training records containing said name as a best name candidate; and recalculating parameters associated with said name by the speech recognition algorithm from the statistics accumulated for said name; and employing the speech recognition algorithm to recognize names spoken by callers in directory assistance calls received subsequent to modification of the parameters of the speech recognition algorithm.
|
2. A method for performing a telephone directory assistance function, comprising: for each of a plurality of callers: prompting the caller to speak a name associated with a desired directory listing; receiving a speech signal from the caller; applying a speech recognition algorithm to the received speech signal to recognize a name in a name vocabulary as corresponding to the received speech signal; determining a telephone number desired by the caller using the recognized name; releasing the desired telephone number to the caller; and creating a call record comprising the released telephone number and a stored representation of the speech signal to associate the stored representation of the speech signal with the released telephone number; processing according to a parameter modification algorithm a plurality of the call records to modify parameters of the speech recognition algorithm, said processing comprising: processing each of the call records by: deriving a plurality of name candidates from the released telephone number; for each name candidate, calculating a measure of probability that the name candidate corresponds to the stored representation of the speech signal; identifying a best name candidate having the highest measure of probability of the plurality of name candidates; applying acceptance criteria based on the calculated measures of probability and, in response to the acceptance criteria being met, creating a training record comprising the stored representation of the speech signal and the best candidate name; and processing the training records according to a training algorithm to modify the parameters of the speech recognition algorithm by, for each name of the name vocabulary: accumulating statistics for said name derived from plural training records containing said name as a best name candidate; and recalculating parameters associated with said name by the speech recognition algorithm from the statistics accumulated for said name; and employing the speech recognition algorithm to recognize names spoken by callers in directory assistance calls received subsequent to modification of the parameters of the speech recognition algorithm. 12. A method as defined in claim 2, wherein the step of creating the training record is completed only if the calculated measures of probability meet predefined acceptance criteria.
| 0.547382 |
9. The method of claim 1 , wherein tuning the speech recognition system includes inputting a collection of utterances of the particular type of utterance into a learning module of the speech recognition system.
|
9. The method of claim 1 , wherein tuning the speech recognition system includes inputting a collection of utterances of the particular type of utterance into a learning module of the speech recognition system. 10. The method of claim 9 , wherein inputting the collection of utterances includes playing one or more files that represent recordings of the particular type of utterance.
| 0.850761 |
1. A sentiment calculator using social media messages for the real-time evaluation of publicly traded assets wherein a sentiment is a computed integer per asset comprising: means for determining polarity in the social media messages based upon pairs of lexical items in local syntactic context; and means for determining a strength value in the social media messages based upon the pairs of lexical items in local syntactic context.
|
1. A sentiment calculator using social media messages for the real-time evaluation of publicly traded assets wherein a sentiment is a computed integer per asset comprising: means for determining polarity in the social media messages based upon pairs of lexical items in local syntactic context; and means for determining a strength value in the social media messages based upon the pairs of lexical items in local syntactic context. 10. The sentiment calculator according to claim 1 , wherein the means for determining a strength value derives strength of syntactic constituents by application of an arithmetic operation.
| 0.572008 |
15. The system of claim 10 wherein the input interface includes a filter input field via which a filter criteria is received, and wherein the network-based commerce facility is to identify a plurality of items by application of the filter criteria to a database of items.
|
15. The system of claim 10 wherein the input interface includes a filter input field via which a filter criteria is received, and wherein the network-based commerce facility is to identify a plurality of items by application of the filter criteria to a database of items. 18. The system of claim 15 , wherein the plurality of items includes items offered for sale on a network-based commerce facility.
| 0.944528 |
14. The information storage medium of claim 12 , wherein each segment uniquely contains a first data element that is a sibling of a second data element uniquely contained within another segment.
|
14. The information storage medium of claim 12 , wherein each segment uniquely contains a first data element that is a sibling of a second data element uniquely contained within another segment. 15. The information storage medium of claim 14 , wherein each segment uniquely contains a sibling having the same parent as the siblings in the other segments.
| 0.949416 |
1. A spine implant comprising: an anchor adapted to be inserted into the bone of a patient, the anchor having a longitudinal axis; an anchor head extending from said anchor; a deflection guide cavity in said anchor head, said deflection guide cavity having a deflection guide cavity wall, and an opening at a proximal end of said anchor head; a deflection rod having a distal portion secured within the deflection guide cavity and a proximal portion extending out of the opening of the deflection guide cavity; wherein the spine implant is configured such that, in the absence of a load applied to the proximal portion of the deflection rod, the deflection rod is aligned with the longitudinal axis of the anchor; wherein the spine implant is configured such that a load applied to the proximal portion of the deflection rod causes resilient deflection of the proximal portion of the deflection rod away from alignment with the longitudinal axis of the bone anchor; and wherein resilient deflection of the proximal portion of the deflection rod is limited by contact between the proximal portion of the deflection rod and the deflection guide cavity wall.
|
1. A spine implant comprising: an anchor adapted to be inserted into the bone of a patient, the anchor having a longitudinal axis; an anchor head extending from said anchor; a deflection guide cavity in said anchor head, said deflection guide cavity having a deflection guide cavity wall, and an opening at a proximal end of said anchor head; a deflection rod having a distal portion secured within the deflection guide cavity and a proximal portion extending out of the opening of the deflection guide cavity; wherein the spine implant is configured such that, in the absence of a load applied to the proximal portion of the deflection rod, the deflection rod is aligned with the longitudinal axis of the anchor; wherein the spine implant is configured such that a load applied to the proximal portion of the deflection rod causes resilient deflection of the proximal portion of the deflection rod away from alignment with the longitudinal axis of the bone anchor; and wherein resilient deflection of the proximal portion of the deflection rod is limited by contact between the proximal portion of the deflection rod and the deflection guide cavity wall. 5. The implant of claim 1 wherein said deflection rod comprises a superelastic material.
| 0.862245 |
1. A method comprising: receiving an input pattern to a dialogue system generated from an acoustic signal that includes a description of a dialogue contribution from a speaker, the dialogue contribution comprising part of an activity oriented dialog concerning activities carried out by the speaker and at least one current device; managing the activities in an activity tree (AT), each of the activities being initiated by a command included in the dialogue contribution from the speaker; defining an activity model (AM) for each device of the at least one device, the activity model comprising scripts encapsulating device-specific information and constituting a declarative specification of device capabilities and their relationships to linguistic information involved in the dialogue contribution; identifying the description and at least one parameter of the description using a dialogue move script (DMS), wherein the DMS corresponds to the at least one device; mapping the description to a dialogue move using the DMS, the dialogue move corresponding to the identified parameter and independent of the device and using the DMS to translate the command into a query to retrieve an object of the command; adding a new dialogue-capable device the dialogue system including associating a device-specific DMS with the new dialogue-capable device that includes mappings to device-specific dialogue moves; receiving a broadcast of an interface from the new dialogue-capable device, wherein the broadcast comprises information including functionality of the new dialogue-capable device, languages recognized by the new dialogue-capable device, and any device-specific DMS required for the new dialogue-capable device, to allow the new dialogue-capable device to self-register with a dialogue manager component of the dialogue system; and defining the new dialogue-capable device to be a current device within an information state of the dialogue system after receipt of the broadcast.
|
1. A method comprising: receiving an input pattern to a dialogue system generated from an acoustic signal that includes a description of a dialogue contribution from a speaker, the dialogue contribution comprising part of an activity oriented dialog concerning activities carried out by the speaker and at least one current device; managing the activities in an activity tree (AT), each of the activities being initiated by a command included in the dialogue contribution from the speaker; defining an activity model (AM) for each device of the at least one device, the activity model comprising scripts encapsulating device-specific information and constituting a declarative specification of device capabilities and their relationships to linguistic information involved in the dialogue contribution; identifying the description and at least one parameter of the description using a dialogue move script (DMS), wherein the DMS corresponds to the at least one device; mapping the description to a dialogue move using the DMS, the dialogue move corresponding to the identified parameter and independent of the device and using the DMS to translate the command into a query to retrieve an object of the command; adding a new dialogue-capable device the dialogue system including associating a device-specific DMS with the new dialogue-capable device that includes mappings to device-specific dialogue moves; receiving a broadcast of an interface from the new dialogue-capable device, wherein the broadcast comprises information including functionality of the new dialogue-capable device, languages recognized by the new dialogue-capable device, and any device-specific DMS required for the new dialogue-capable device, to allow the new dialogue-capable device to self-register with a dialogue manager component of the dialogue system; and defining the new dialogue-capable device to be a current device within an information state of the dialogue system after receipt of the broadcast. 12. The method of claim 1 , wherein the description is a structured language-based description that includes at least one of a semantic description, a syntactic description, phonological information, utterance-level information, and topic-classification of the dialogue contribution.
| 0.626376 |
9. A method implemented by at least one computer processor, the method comprising: caching a recurring query and associated document result entries in a cache; determining that a received query is the recurring query; maintaining an incremental index that includes a changed document index and an unchanged document index, the changed document index identifying changed documents that have changed since a previous time and the unchanged document index identifying unchanged documents that have not changed since the previous time; when processing the received query, computing the received query on the changed document index without computing the received query on the unchanged document index, wherein an updated document result entry identifying an individual changed document is obtained from the changed document index; and serving at least some of the associated document result entries from the cache and the updated document result entry in response to the received query.
|
9. A method implemented by at least one computer processor, the method comprising: caching a recurring query and associated document result entries in a cache; determining that a received query is the recurring query; maintaining an incremental index that includes a changed document index and an unchanged document index, the changed document index identifying changed documents that have changed since a previous time and the unchanged document index identifying unchanged documents that have not changed since the previous time; when processing the received query, computing the received query on the changed document index without computing the received query on the unchanged document index, wherein an updated document result entry identifying an individual changed document is obtained from the changed document index; and serving at least some of the associated document result entries from the cache and the updated document result entry in response to the received query. 14. The method of claim 9 , further comprising: computing a top N documents for the received query on the changed document index; and merging the top N documents with an individual document result entry in the cache.
| 0.618008 |
1. A computer-network system implemented by an online stationery/card service for a user to personalize and send non-electronic stationery/cards, the system comprising: a computer server configured to enable a graphical user interface for personalizing and sending non-electronic stationery/cards, the graphical user interface comprising: a reminder list comprised of a plurality of reminder entries, each of the reminder entries identifying an upcoming event including events generated based on a specified relationship between the user and one or more contacts stored in a contacts database of the user; a recommendation region comprising a plurality of stationery/card design recommendations, the recommendation region populated with stationery/card designs associated with a specified one or the one or more entries in the reminder list, including the events generated based on the specified relationship between the user and each of the contacts, wherein the reminder list is organized based on a specified prioritization scheme, with a highest priority event selected within the reminder list, wherein upon the user initially opening the GUI the recommendation region is automatically populated with stationery/card designs associated with the highest priority event in the reminder list; and a stationery/card personalization engine executed in response to the user selecting one of the stationery/card design recommendations from the recommendation region, the stationery personalization engine providing the end user with a set of personalization options related to the selected stationery/card design, and generating personalized stationery with the selected stationery/card design based on user input.
|
1. A computer-network system implemented by an online stationery/card service for a user to personalize and send non-electronic stationery/cards, the system comprising: a computer server configured to enable a graphical user interface for personalizing and sending non-electronic stationery/cards, the graphical user interface comprising: a reminder list comprised of a plurality of reminder entries, each of the reminder entries identifying an upcoming event including events generated based on a specified relationship between the user and one or more contacts stored in a contacts database of the user; a recommendation region comprising a plurality of stationery/card design recommendations, the recommendation region populated with stationery/card designs associated with a specified one or the one or more entries in the reminder list, including the events generated based on the specified relationship between the user and each of the contacts, wherein the reminder list is organized based on a specified prioritization scheme, with a highest priority event selected within the reminder list, wherein upon the user initially opening the GUI the recommendation region is automatically populated with stationery/card designs associated with the highest priority event in the reminder list; and a stationery/card personalization engine executed in response to the user selecting one of the stationery/card design recommendations from the recommendation region, the stationery personalization engine providing the end user with a set of personalization options related to the selected stationery/card design, and generating personalized stationery with the selected stationery/card design based on user input. 8. The computer-network system as in claim 1 wherein the GUI further comprises a calendar window including a plurality of calendar entries for a particular month, each entry representing a particular day of the month, one or more of the entries having stored therein different graphical elements, wherein a first type of graphical element is displayed to represent a scheduled stationery/card order and a second type of graphical element is displayed to represent a calendar event related to a contact in the user's contacts database for which a stationery/card order has not been scheduled.
| 0.509953 |
1. A method, comprising: determining, by at least one computer, based on a timed media file, data representing at least a word or phrase; and using, by the at least one computer, the data to determine a first portion of the timed media file based on the word or phrase.
|
1. A method, comprising: determining, by at least one computer, based on a timed media file, data representing at least a word or phrase; and using, by the at least one computer, the data to determine a first portion of the timed media file based on the word or phrase. 6. The method of claim 1 , wherein the data represents at least a plurality of words or phrases, the method further comprising using, by the at least one computer, the data to determine a plurality of portions of the timed media file, one for each of the plurality of words or phrases, wherein the plurality of portions overlap each another within the timed media file.
| 0.726736 |
8. A system for speech-enabled content navigation and control of a distributed multimodal browser, the distributed multimodal browser providing an execution environment for a multimodal application, the distributed multi modal browser including a graphical user agent and a voice user agent operatively coupled to the graphical user agent, the graphical user agent operating on a multimodal device supporting multiple modes of user interaction including a voice mode and one or more non-voice modes, the voice user agent operating on a voice server, the system comprising one or more computer processors and computer memory operatively coupled to the computer processors, the computer memory having disposed within it computer program instructions configured to perform: transmitting, by the graphical user agent, a link message to the voice user agent, the link message containing voice commands that control the distributed multimodal browser including at least one grammar associated with the voice commands, the link message also containing an event corresponding to each voice command, wherein at least one of the voice commands is received by the graphical user agent from a voice markup corresponding to the multimodal application; receiving, by the graphical user agent, a voice utterance from a user, the voice utterance specifying a particular voice command; transmitting, by the graphical user agent, the voice utterance to the voice user agent for speech recognition by the voice user agent; receiving, by the graphical user agent, an event message from the voice user agent, the event message specifying a particular event corresponding to the particular voice command specified by the voice utterance; and controlling, by the graphical user agent, the distributed multimodal browser in dependence upon the particular event.
|
8. A system for speech-enabled content navigation and control of a distributed multimodal browser, the distributed multimodal browser providing an execution environment for a multimodal application, the distributed multi modal browser including a graphical user agent and a voice user agent operatively coupled to the graphical user agent, the graphical user agent operating on a multimodal device supporting multiple modes of user interaction including a voice mode and one or more non-voice modes, the voice user agent operating on a voice server, the system comprising one or more computer processors and computer memory operatively coupled to the computer processors, the computer memory having disposed within it computer program instructions configured to perform: transmitting, by the graphical user agent, a link message to the voice user agent, the link message containing voice commands that control the distributed multimodal browser including at least one grammar associated with the voice commands, the link message also containing an event corresponding to each voice command, wherein at least one of the voice commands is received by the graphical user agent from a voice markup corresponding to the multimodal application; receiving, by the graphical user agent, a voice utterance from a user, the voice utterance specifying a particular voice command; transmitting, by the graphical user agent, the voice utterance to the voice user agent for speech recognition by the voice user agent; receiving, by the graphical user agent, an event message from the voice user agent, the event message specifying a particular event corresponding to the particular voice command specified by the voice utterance; and controlling, by the graphical user agent, the distributed multimodal browser in dependence upon the particular event. 14. The system of claim 8 wherein the event message specifies the particular event as a string using dot notation.
| 0.81202 |
2. The computer-implemented method of claim 1 , further comprising: the computing device, by executing the rule-based logic agent, reading the third runtime data of the electronic tax return from the shared data store, selecting candidate topics or questions based at least in part upon the second runtime data, and generating a second plurality of non-binding suggestions of candidate topics or questions to be presented to the user; and the computing device, by executing the user interface controller, receiving the second plurality of non-binding suggestions generated by the rule-based logic agent; the computing device, by executing a pagination engine, receiving second prioritization data generated by the rule-based logic agent and associated with the second plurality of non-binding suggestions, and generating a second output based at least in part upon the second prioritization data; the computing device, by executing the user interface controller generating a second interview screen that is presented to the user through the display of the computing device, the second interview screen comprising a second paginated screen including topics or questions of at least one non-binding suggestion of the second plurality of non-binding suggestions and structured based at least in part upon the second pagination engine output, receiving second user input through the second paginated screen, the second user input corresponding to selection of a second topic or question of the second paginated screen and providing a second response to the second selected topic or question, and writing the second response to the shared data store to update the third runtime data and generate fourth runtime data.
|
2. The computer-implemented method of claim 1 , further comprising: the computing device, by executing the rule-based logic agent, reading the third runtime data of the electronic tax return from the shared data store, selecting candidate topics or questions based at least in part upon the second runtime data, and generating a second plurality of non-binding suggestions of candidate topics or questions to be presented to the user; and the computing device, by executing the user interface controller, receiving the second plurality of non-binding suggestions generated by the rule-based logic agent; the computing device, by executing a pagination engine, receiving second prioritization data generated by the rule-based logic agent and associated with the second plurality of non-binding suggestions, and generating a second output based at least in part upon the second prioritization data; the computing device, by executing the user interface controller generating a second interview screen that is presented to the user through the display of the computing device, the second interview screen comprising a second paginated screen including topics or questions of at least one non-binding suggestion of the second plurality of non-binding suggestions and structured based at least in part upon the second pagination engine output, receiving second user input through the second paginated screen, the second user input corresponding to selection of a second topic or question of the second paginated screen and providing a second response to the second selected topic or question, and writing the second response to the shared data store to update the third runtime data and generate fourth runtime data. 5. The method of claim 2 , the first paginated screen and the second paginated screen each comprising a plurality of frames or segments, respective frames or segments comprising different questions or topic content.
| 0.782743 |
28. The educational aid of claim 27, wherein each successive notation is a visual cue in said readable format text.
|
28. The educational aid of claim 27, wherein each successive notation is a visual cue in said readable format text. 31. The educational aid of claim 28, wherein said visual cues are colored to be less prominent than the print of said readable format text.
| 0.943503 |
1. A method comprising: selecting a first configuration item from a source dataset; failing to identify the first configuration item with configuration items in a target dataset of a configuration management database using identification rules without automatically modifiable acceptance criteria; evaluating a rule against the first configuration item and a second configuration item of the target dataset; marking the first configuration item as identified with the second configuration item upon successful evaluation of the rule if a threshold value for the rule exceeds a predetermined acceptance value; and automatically adjusting the threshold value responsive to the act of marking.
|
1. A method comprising: selecting a first configuration item from a source dataset; failing to identify the first configuration item with configuration items in a target dataset of a configuration management database using identification rules without automatically modifiable acceptance criteria; evaluating a rule against the first configuration item and a second configuration item of the target dataset; marking the first configuration item as identified with the second configuration item upon successful evaluation of the rule if a threshold value for the rule exceeds a predetermined acceptance value; and automatically adjusting the threshold value responsive to the act of marking. 15. A non-transitory computer readable medium with instructions for a programmable control device stored thereon wherein the instructions cause the programmable control device to perform the method of claim 1 .
| 0.782568 |
19. A computer-implemented method for performing voice recognition, at least in part, using a language model incorporating a plurality of words and a plurality of n-grams, each of the plurality of n-grams formed by two or more of the plurality of words and defining a probability of occurrence of each word in the respective n-gram given the occurrence of one of the two or more of the plurality of words forming the respective n-gram, the method comprising: receiving a first text comprising a sequence of one or more words from a first participant in a text-based conversation with a second participant via at least one first user device; receiving a voice response provided by the second participant in the text-based conversation in response to the first text; selecting at least one of the plurality of n-grams from the language model that includes at least one word in the first text; and automatically recognizing at least a portion of the voice response to provide a second text, at least in part, by using the at least one selected n-gram, wherein automatically recognizing comprises determining whether a number of messages from the first participant to the second participant exceeds a predetermined threshold.
|
19. A computer-implemented method for performing voice recognition, at least in part, using a language model incorporating a plurality of words and a plurality of n-grams, each of the plurality of n-grams formed by two or more of the plurality of words and defining a probability of occurrence of each word in the respective n-gram given the occurrence of one of the two or more of the plurality of words forming the respective n-gram, the method comprising: receiving a first text comprising a sequence of one or more words from a first participant in a text-based conversation with a second participant via at least one first user device; receiving a voice response provided by the second participant in the text-based conversation in response to the first text; selecting at least one of the plurality of n-grams from the language model that includes at least one word in the first text; and automatically recognizing at least a portion of the voice response to provide a second text, at least in part, by using the at least one selected n-gram, wherein automatically recognizing comprises determining whether a number of messages from the first participant to the second participant exceeds a predetermined threshold. 20. The computer-implemented method of claim 19 , further comprising adjusting the probability for at least one word in the at least one selected n-gram based, at least in part, on the first text.
| 0.622956 |
9. The system of claim 8 , wherein the first label associated with the element in the first language of the user interface is converted into the second label associated with the element in the second language without losing a session of a user of the computing device.
|
9. The system of claim 8 , wherein the first label associated with the element in the first language of the user interface is converted into the second label associated with the element in the second language without losing a session of a user of the computing device. 10. The system of claim 9 , the processing device to refresh the session of the user of the computing device with the reset value.
| 0.908394 |
8. A computer program product comprising: a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code comprising computer-readable program code configured to: receive a plurality of electronic documents, wherein each electronic document is arranged according to a different, respective format comprising a plurality of headers; identify a properties file associated with one of the electronic documents, the properties file defining a particular header of the respective format in the one electronic document, an action corresponding to a text portion associated with the particular header, and an extension class; instantiate a preprocessor for parsing the one electronic document based on the extension class, wherein the preprocessor is configured to parse only electronic documents arranged using the respective format; parse the one electronic document to identify the particular header using the preprocessor; upon identifying the text portion associated with the particular header, perform the action to the text portion by assigning the text portion to a formatting element of a normalized format; and store the text portion into a natural language processing (NLP) object based on the formatting element of the normalized format, wherein text in the NLP object is arranged based on the normalized format.
|
8. A computer program product comprising: a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code comprising computer-readable program code configured to: receive a plurality of electronic documents, wherein each electronic document is arranged according to a different, respective format comprising a plurality of headers; identify a properties file associated with one of the electronic documents, the properties file defining a particular header of the respective format in the one electronic document, an action corresponding to a text portion associated with the particular header, and an extension class; instantiate a preprocessor for parsing the one electronic document based on the extension class, wherein the preprocessor is configured to parse only electronic documents arranged using the respective format; parse the one electronic document to identify the particular header using the preprocessor; upon identifying the text portion associated with the particular header, perform the action to the text portion by assigning the text portion to a formatting element of a normalized format; and store the text portion into a natural language processing (NLP) object based on the formatting element of the normalized format, wherein text in the NLP object is arranged based on the normalized format. 13. The computer program product of claim 8 , wherein instantiating the preprocessor comprises computer-readable program code configured to: select a type of preprocessor based on the extension class, wherein each type of preprocessor corresponds to a different data source transmitting the plurality of electronic documents.
| 0.501005 |
1. A computer-implemented system for automating call center phone calls, comprising: a telephony interface to receive a stream of verbal speech utterances from a callee of a call made from a call center; an agent application to process the verbal speech utterances through a customer support scenario controlled by a live agent of the call center; a post-call processor to identify one or more characteristics of the callee based on the verbal speech utterances; a command processor to automate an outgoing call to a different callee with characteristics similar to the characteristics of the callee of the call made from the call center; a script engine to receive a user selection of one or more scripts, each script comprising a grammar that defines a set of executable instructions for a question-and-response dialog and to affect an execution of the selected script; and a performance module comprising at least one of: a start module to begin the execution of the selected script; an adjustment module to adjust a point of the execution within the selected script; and a repeat module to repeat a portion of the selected script.
|
1. A computer-implemented system for automating call center phone calls, comprising: a telephony interface to receive a stream of verbal speech utterances from a callee of a call made from a call center; an agent application to process the verbal speech utterances through a customer support scenario controlled by a live agent of the call center; a post-call processor to identify one or more characteristics of the callee based on the verbal speech utterances; a command processor to automate an outgoing call to a different callee with characteristics similar to the characteristics of the callee of the call made from the call center; a script engine to receive a user selection of one or more scripts, each script comprising a grammar that defines a set of executable instructions for a question-and-response dialog and to affect an execution of the selected script; and a performance module comprising at least one of: a start module to begin the execution of the selected script; an adjustment module to adjust a point of the execution within the selected script; and a repeat module to repeat a portion of the selected script. 7. A system according to claim 1 , further comprising: a record of the call made to the callee; and the command processor to manipulate the record comprising at least one of reordering and ranking of the verbal speech utterances.
| 0.574184 |
9. An apparatus for clustering a plurality of speech utterances into multiple clusters associated with multiple respective speakers, the apparatus comprising: a processor; and a memory with computer code instructions stored therein, the processor and the memory, with the computer code instructions, being configured to cause the apparatus to: define a clustering pattern having multiple clusters, each of the multiple clusters including at least one of the plurality of vector representations; iteratively, (1) evaluate a clustering confidence score in terms of silhouette width criterion values associated with at least a subset of the plurality of vector representations, the clustering confidence score representing a clustering validation metric, and (2) update the clustering pattern by merging a pair of nearest clusters, among clusters associated with the clustering pattern, into a single cluster, the pair of nearest clusters merged being determined based on a similarity score indicative of similarity between vector representations associated with different clusters; employ a modified silhouette width criterion function with a penalty term, the penalty term regularizing the silhouette width criterion values, the modified silhouette width criterion function enabling a stopping condition for the evaluating and updating; and provide an indication of a final clustering pattern to a speaker recognition engine, the final clustering pattern being determined as the clustering pattern corresponding to a highest value of the clustering confidence score, the final clustering pattern employed by the speaker recognition engine in associating speech utterances from at least one speaker of the multiple respective speakers with the at least one speaker.
|
9. An apparatus for clustering a plurality of speech utterances into multiple clusters associated with multiple respective speakers, the apparatus comprising: a processor; and a memory with computer code instructions stored therein, the processor and the memory, with the computer code instructions, being configured to cause the apparatus to: define a clustering pattern having multiple clusters, each of the multiple clusters including at least one of the plurality of vector representations; iteratively, (1) evaluate a clustering confidence score in terms of silhouette width criterion values associated with at least a subset of the plurality of vector representations, the clustering confidence score representing a clustering validation metric, and (2) update the clustering pattern by merging a pair of nearest clusters, among clusters associated with the clustering pattern, into a single cluster, the pair of nearest clusters merged being determined based on a similarity score indicative of similarity between vector representations associated with different clusters; employ a modified silhouette width criterion function with a penalty term, the penalty term regularizing the silhouette width criterion values, the modified silhouette width criterion function enabling a stopping condition for the evaluating and updating; and provide an indication of a final clustering pattern to a speaker recognition engine, the final clustering pattern being determined as the clustering pattern corresponding to a highest value of the clustering confidence score, the final clustering pattern employed by the speaker recognition engine in associating speech utterances from at least one speaker of the multiple respective speakers with the at least one speaker. 15. An apparatus according to claim 9 , wherein the similarity score, between a first cluster and a second cluster, includes one of: a minimum value of a similarity metric evaluated between pairs of vector representations, with one vector representation of each pair being associated with the first cluster and the other vector representation being associated with the second cluster; a maximum value of a similarity metric evaluated between pairs of vector representations, with one vector representation of each pair being associated with the first cluster and the other vector representation being associated with the second cluster; or an average of similarity metric values evaluated between pairs of vector representations, with one vector representation of each pair being associated with the first cluster and the other vector representation being associated with the second cluster.
| 0.5 |
22. The handheld electronic device of claim 16 wherein said processor apparatus is structured to detect a selection of a predetermined language and, responsive thereto, to initiate the making of said determination.
|
22. The handheld electronic device of claim 16 wherein said processor apparatus is structured to detect a selection of a predetermined language and, responsive thereto, to initiate the making of said determination. 23. The handheld electronic device of claim 22 wherein said processor apparatus is structured to detect as said predetermined language the French language.
| 0.868101 |
1. A braille generator and converter system comprising: one or more refreshable braille display devices, each refreshable braille display device comprising: a plurality of electromechanical braille cells, each electromechanical braille cell comprising a plurality of output dots configured to raise and lower in response to voltages applied at the electromechanical braille cell; a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the refreshable braille display device to: receive data corresponding to one or more braille output math characters; determine an electromechanical braille cell for displaying each of the braille output math characters; and transmit control instructions to each of the determined electromechanical braille cells to display the one or more braille output math characters; an expression input device, comprising: an I/O subsystem configured to receive mathematical expression input data via one or more input devices integrated into or connected with the expression input device; a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the expression input device to: receive math input data via the I/O subsystem corresponding to a mathematical expression; and transmit data representing the mathematical expression to an expression converter; and the expression converter, the expression converter comprising: a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the expression converter to: initiate a multi-user interactive math computing session including at least one of the refreshable braille display devices and at least one visual presentation device; receive the math input data from the expression input device representing presentation markup representation of a the mathematical expression during the multi-user interactive math computing session; convert the math input data representing the presentation markup representation of the mathematical expression to a mathematical markup languge (MathML) representation of the mathematical expression, using a first set of data conversion rules for converting presentation markup of mathematical expressions to MathML; convert the MathML representation of the mathematical expression to a set of braille output math characters, using a second set of data conversion rules for converting MathML to braille math output, wherein the set of braille math output characters includes at least one braille mathematical symbol that does not correspond to any character in the received input data or in the MathML representation of the mathematical expression; transmit the set of braille output characters to the at least one of the refreshable braille display devices configured to receive braille output within the interactive computing session, wherein the converting and transmitting of the braille math output characters is performed in real-time in response to the receiving the math input data representing the presentation markup representation of the mathematical expression; receive a plurality of single-character revisions to the mathematical expression during the multi-user interactive math computing session, including at least a first single-character revision received as braille math input from the at least one refreshable braille display device, and a second single-character revision received as presentation markup math input from the at least one visual presentation device; and in response to each of the plurality of single-character revisions to the mathematical expression received during the multi-user interactive math computing session; (a) determine an input data type of the received single-character revision to the mathematical expression; (b) determine a set of conversion rules for converting the revised mathematical expression to MathML based on the determined input data type; (c) convert the revised mathematical expression incorporating the single-character revision into revised MathML of the mathematical expression using the determined set of conversion rules; (d) convert the revised MathML of the mathematical expression into one or more output math formats comprising at least one of the braille math output or presentation markup math output; and (e) transmit the revised mathematical expression, converted into the one or more output math formats, to one or more output devices including at least one of the visual presentation devices or at least one refreshable braille display devices.
|
1. A braille generator and converter system comprising: one or more refreshable braille display devices, each refreshable braille display device comprising: a plurality of electromechanical braille cells, each electromechanical braille cell comprising a plurality of output dots configured to raise and lower in response to voltages applied at the electromechanical braille cell; a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the refreshable braille display device to: receive data corresponding to one or more braille output math characters; determine an electromechanical braille cell for displaying each of the braille output math characters; and transmit control instructions to each of the determined electromechanical braille cells to display the one or more braille output math characters; an expression input device, comprising: an I/O subsystem configured to receive mathematical expression input data via one or more input devices integrated into or connected with the expression input device; a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the expression input device to: receive math input data via the I/O subsystem corresponding to a mathematical expression; and transmit data representing the mathematical expression to an expression converter; and the expression converter, the expression converter comprising: a processing unit comprising one or more processors; and memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the expression converter to: initiate a multi-user interactive math computing session including at least one of the refreshable braille display devices and at least one visual presentation device; receive the math input data from the expression input device representing presentation markup representation of a the mathematical expression during the multi-user interactive math computing session; convert the math input data representing the presentation markup representation of the mathematical expression to a mathematical markup languge (MathML) representation of the mathematical expression, using a first set of data conversion rules for converting presentation markup of mathematical expressions to MathML; convert the MathML representation of the mathematical expression to a set of braille output math characters, using a second set of data conversion rules for converting MathML to braille math output, wherein the set of braille math output characters includes at least one braille mathematical symbol that does not correspond to any character in the received input data or in the MathML representation of the mathematical expression; transmit the set of braille output characters to the at least one of the refreshable braille display devices configured to receive braille output within the interactive computing session, wherein the converting and transmitting of the braille math output characters is performed in real-time in response to the receiving the math input data representing the presentation markup representation of the mathematical expression; receive a plurality of single-character revisions to the mathematical expression during the multi-user interactive math computing session, including at least a first single-character revision received as braille math input from the at least one refreshable braille display device, and a second single-character revision received as presentation markup math input from the at least one visual presentation device; and in response to each of the plurality of single-character revisions to the mathematical expression received during the multi-user interactive math computing session; (a) determine an input data type of the received single-character revision to the mathematical expression; (b) determine a set of conversion rules for converting the revised mathematical expression to MathML based on the determined input data type; (c) convert the revised mathematical expression incorporating the single-character revision into revised MathML of the mathematical expression using the determined set of conversion rules; (d) convert the revised MathML of the mathematical expression into one or more output math formats comprising at least one of the braille math output or presentation markup math output; and (e) transmit the revised mathematical expression, converted into the one or more output math formats, to one or more output devices including at least one of the visual presentation devices or at least one refreshable braille display devices. 2. The braille generator and converter system of claim 1 , the memory of the expression converter storing therein further instructions which, when executed by the processing unit, causes the expression converter to: receive a set of braille input characters from a first refreshable braille display device, the set of braille input characters representing an updated mathematical expression; retrieve a third set of data conversion rules for converting braille input to MathML, and convert the received braille input characters representing the updated mathematical expression to a MathML representation of the updated mathematical expression, using the third set of data conversion rules.
| 0.592976 |
6. A method, comprising: receiving, by at least one computing device, user input to an interface, the user input selecting a first item of content associated with a first service, the interface identifying at least a plurality of items of content, including the first item of content, associated with a plurality of services; and in response to the user input selecting the first item of content: determining, by the at least one computing device, a different second item of content of a different second service not indicated by the interface based at least in part on the first item of content; and updating, by the at least one computing device, the interface to indicate the plurality of items of content simultaneously with the second item of content.
|
6. A method, comprising: receiving, by at least one computing device, user input to an interface, the user input selecting a first item of content associated with a first service, the interface identifying at least a plurality of items of content, including the first item of content, associated with a plurality of services; and in response to the user input selecting the first item of content: determining, by the at least one computing device, a different second item of content of a different second service not indicated by the interface based at least in part on the first item of content; and updating, by the at least one computing device, the interface to indicate the plurality of items of content simultaneously with the second item of content. 7. The method of claim 6 , wherein the first item of content is an item of scheduled content.
| 0.710128 |
1. A method for implementing an interface terminology in a longitudinal electronic medical record, the interface terminology comprising concepts and descriptions, a description being an alternative way to express a concept, the method comprising: storing a plurality of concepts in a first table a database; storing a plurality of descriptions in a second table in the database; storing in a third table in the database linking information that links each description in the second table to a respective concept in the first table; storing an external code set in a fourth table in the database, the external code set comprising a plurality of external codes; and mapping an external code to a respective concept via a directed graph structure linking each external code in the fourth table to the respective concept in the first table; wherein said plurality of concepts provide a unique terminology for a user and can be added, updated, deleted, and merged; wherein multiple of said plurality of descriptions may link to one of said plurality of concepts; wherein said plurality of descriptions include terms used by both clinicians and patients; wherein, for each concept, one of said plurality of descriptions is a preferred description for the linked concept and one of said plurality of descriptions is a preferred consumer term for the linked concept; wherein multiple of said plurality of external codes may map to one of said plurality of concepts; wherein said method for implementing an interface terminology serves the ends of capturing clinician's intent, driving financial aspects including billing, and driving analytical functions; creating a longitudinal electronic medical record by: generating a first instance of a plurality of data objects during a first encounter, said plurality of data objects comprising data elements further comprising a first instance identifier and temporal identifiers; linking a data object in said first instance to a summarization reference with a pointer, where the plurality of data objects and the summarization reference are related as part of a directed graph data structure; creating an additional instance of a plurality of data objects during a later encounter, said additional instance of a plurality of data objects comprising data elements further comprising an additional instance identifier and temporal identifier; and providing continuity for said plurality of data objects of said first instance over time by tracking a relationship between said data object of said first instance and a data object of said additional instance; tagging elements within a domain within the longitudinal electronic medical record with one or more of said plurality of descriptions; and displaying the preferred descriptions and the preferred consumer term.
|
1. A method for implementing an interface terminology in a longitudinal electronic medical record, the interface terminology comprising concepts and descriptions, a description being an alternative way to express a concept, the method comprising: storing a plurality of concepts in a first table a database; storing a plurality of descriptions in a second table in the database; storing in a third table in the database linking information that links each description in the second table to a respective concept in the first table; storing an external code set in a fourth table in the database, the external code set comprising a plurality of external codes; and mapping an external code to a respective concept via a directed graph structure linking each external code in the fourth table to the respective concept in the first table; wherein said plurality of concepts provide a unique terminology for a user and can be added, updated, deleted, and merged; wherein multiple of said plurality of descriptions may link to one of said plurality of concepts; wherein said plurality of descriptions include terms used by both clinicians and patients; wherein, for each concept, one of said plurality of descriptions is a preferred description for the linked concept and one of said plurality of descriptions is a preferred consumer term for the linked concept; wherein multiple of said plurality of external codes may map to one of said plurality of concepts; wherein said method for implementing an interface terminology serves the ends of capturing clinician's intent, driving financial aspects including billing, and driving analytical functions; creating a longitudinal electronic medical record by: generating a first instance of a plurality of data objects during a first encounter, said plurality of data objects comprising data elements further comprising a first instance identifier and temporal identifiers; linking a data object in said first instance to a summarization reference with a pointer, where the plurality of data objects and the summarization reference are related as part of a directed graph data structure; creating an additional instance of a plurality of data objects during a later encounter, said additional instance of a plurality of data objects comprising data elements further comprising an additional instance identifier and temporal identifier; and providing continuity for said plurality of data objects of said first instance over time by tracking a relationship between said data object of said first instance and a data object of said additional instance; tagging elements within a domain within the longitudinal electronic medical record with one or more of said plurality of descriptions; and displaying the preferred descriptions and the preferred consumer term. 8. The method according to claim 1 , wherein at least one concept includes a preferred clinician term and a preferred patient term linked as descriptions of that concept.
| 0.506634 |
1. A computer-implemented method, comprising: outputting, from a server to a developer of a web page in a source language, an offer to opt-in to a translation feature that enables one or more other users to translate the web page to a different target language; receiving, by the server from the developer, a first request to opt-in to the translation feature; and in response to receiving the first request to opt-in to the translation feature: generating and storing, by the server, a copy of the web page; obtaining, by the server from the one or more other users, translations of at least a portion of the web page from the source language to the target language; modifying, by the server, the web page copy based on the obtained translations to obtain a translated web page, the translated web page being a translated version of the web page; detecting, by the server, a second request for the web page from a computing device associated with the target language; and in response to detecting the second request, outputting, from the server to the computing device, the translated web page with additional content relevant to the computing device or a user associated with the computing device.
|
1. A computer-implemented method, comprising: outputting, from a server to a developer of a web page in a source language, an offer to opt-in to a translation feature that enables one or more other users to translate the web page to a different target language; receiving, by the server from the developer, a first request to opt-in to the translation feature; and in response to receiving the first request to opt-in to the translation feature: generating and storing, by the server, a copy of the web page; obtaining, by the server from the one or more other users, translations of at least a portion of the web page from the source language to the target language; modifying, by the server, the web page copy based on the obtained translations to obtain a translated web page, the translated web page being a translated version of the web page; detecting, by the server, a second request for the web page from a computing device associated with the target language; and in response to detecting the second request, outputting, from the server to the computing device, the translated web page with additional content relevant to the computing device or a user associated with the computing device. 3. The computer-implemented method of claim 1 , further comprising intercepting, by the server from the computing device, the second request for the web page, wherein outputting the translated web page with the additional content is performed in response to intercepting the second request.
| 0.590852 |
16. A non-transitory computer readable storage medium having instructions stored thereon that are executable to cause a computer system to perform operations comprising: training a distortion classifier that is configured to identify distortion categories based on distorted image statistics, wherein the training includes: applying a given distortion type to a plurality of reference images to produce a plurality of distorted images; and fitting one or more functions to the plurality of distorted images, wherein the one or more functions are usable to determine a probability that the given distortion type applies to a given distorted image; receiving one or more image frames, but not reference image frames for the one or more image frames; identifying, via the trained distortion classifier, one or more distortion categories for the one or more image frames; and determining a quality of the one or more image frames based on the identified one or more distortion categories.
|
16. A non-transitory computer readable storage medium having instructions stored thereon that are executable to cause a computer system to perform operations comprising: training a distortion classifier that is configured to identify distortion categories based on distorted image statistics, wherein the training includes: applying a given distortion type to a plurality of reference images to produce a plurality of distorted images; and fitting one or more functions to the plurality of distorted images, wherein the one or more functions are usable to determine a probability that the given distortion type applies to a given distorted image; receiving one or more image frames, but not reference image frames for the one or more image frames; identifying, via the trained distortion classifier, one or more distortion categories for the one or more image frames; and determining a quality of the one or more image frames based on the identified one or more distortion categories. 17. The non-transitory computer readable storage medium of claim 16 , wherein the operations further comprise applying one or more corrections to the one or more image frames based on the identified one or more distortion categories.
| 0.577091 |
29. An apparatus comprising: a pen movement capturing device configured to receive data representing a handwritten pattern; a computational device according to claim 15 configured to receive said data from said pen movement capturing device and to output matching templates; said computational device configured to match said templates into symbols; and a display configured to present said symbols; wherein said apparatus is a data handling device.
|
29. An apparatus comprising: a pen movement capturing device configured to receive data representing a handwritten pattern; a computational device according to claim 15 configured to receive said data from said pen movement capturing device and to output matching templates; said computational device configured to match said templates into symbols; and a display configured to present said symbols; wherein said apparatus is a data handling device. 30. An apparatus according to claim 29 , wherein said pen movement capturing device is a touch sensitive surface.
| 0.815245 |
15. A computer program product comprising: one or more computer-readable tangible storage devices; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to receive a search term; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to identify instances of the search term in a source text; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to identify, for each of the instances of the search term identified in the source text, a prefix string comprising a plurality of tokens preceding the search term in the source text, and to identify a suffix string comprising a plurality of tokens subsequent to the search term in the source text; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to provide data to display a visualization interface that comprises the search term within a combined tree diagram comprising a prefix tree extending to a first side of the search term, and a suffix tree extending to a second side of the search term, such that the prefix tree displays, in tree diagram format, the prefix strings for the instances of the search term identified in the source text, and the suffix tree displays, in tree diagram format, the suffix strings for the instances of the search term identified in the source text, wherein the prefix tree comprises tokens that are shared in common among the prefix strings as nodes connected to adjacent tokens by branches, and the suffix tree comprises tokens that are shared in common among the suffix strings as nodes connected to adjacent tokens by branches, wherein the branches in the prefix tree and the suffix tree are user-selectable in the visualization interface; and program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to provide, in response to receiving a user input selecting one of the branches in the prefix tree or in the suffix tree, and for each of one or more matching sequences that are connected through the selected branch, data to display a visual indication of a particular prefix string and a particular suffix string in the visualization interface that form a unique matching sequence of the particular prefix string, the search term, and the particular suffix string that occur together in the source text, wherein each of the one or more matching sequences forms a unique matching sequence from the source text, and wherein the visual indication comprises a unique graphical indicator applied to each unique matching sequence through the corresponding nodes in the prefix tree, the search term, and the corresponding nodes in the suffix tree for each of the unique matching sequences that comprise the search term and the selected branch.
|
15. A computer program product comprising: one or more computer-readable tangible storage devices; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to receive a search term; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to identify instances of the search term in a source text; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to identify, for each of the instances of the search term identified in the source text, a prefix string comprising a plurality of tokens preceding the search term in the source text, and to identify a suffix string comprising a plurality of tokens subsequent to the search term in the source text; program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to provide data to display a visualization interface that comprises the search term within a combined tree diagram comprising a prefix tree extending to a first side of the search term, and a suffix tree extending to a second side of the search term, such that the prefix tree displays, in tree diagram format, the prefix strings for the instances of the search term identified in the source text, and the suffix tree displays, in tree diagram format, the suffix strings for the instances of the search term identified in the source text, wherein the prefix tree comprises tokens that are shared in common among the prefix strings as nodes connected to adjacent tokens by branches, and the suffix tree comprises tokens that are shared in common among the suffix strings as nodes connected to adjacent tokens by branches, wherein the branches in the prefix tree and the suffix tree are user-selectable in the visualization interface; and program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to provide, in response to receiving a user input selecting one of the branches in the prefix tree or in the suffix tree, and for each of one or more matching sequences that are connected through the selected branch, data to display a visual indication of a particular prefix string and a particular suffix string in the visualization interface that form a unique matching sequence of the particular prefix string, the search term, and the particular suffix string that occur together in the source text, wherein each of the one or more matching sequences forms a unique matching sequence from the source text, and wherein the visual indication comprises a unique graphical indicator applied to each unique matching sequence through the corresponding nodes in the prefix tree, the search term, and the corresponding nodes in the suffix tree for each of the unique matching sequences that comprise the search term and the selected branch. 18. The computer program product of claim 15 , further comprising: program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to receive a user input selecting one of the nodes; and program instructions, stored on at least one of the one or more computer-readable tangible storage devices, to combine a token in the selected node with the search term into a new search term, and to provide data to display an updated visualization interface that comprises the new search term within a combined tree diagram, comprising a new prefix tree and a new suffix tree, such that the new prefix tree displays, in a tree diagram format, the prefix strings for instances of the new search term in the source text, and the new suffix tree displays, in a tree diagram format, the suffix strings for instances of the new search term in the source text.
| 0.559085 |
1. A computer readable medium for use in validating an eXtensible Markup Language (XML) message in a particular wire format, said computer readable medium containing computer-executable instructions which, when performed by a processor in a computing device, cause the computing device to: from a custom XML schema based message model having at least one wire format specific rendering option associated with an XML entity representing at least a portion of said XML message, generate an XML schema fragment for use in validating said XML message at a node that lacks said custom XML schema based message model, wherein said XML schema fragment conforms to said particular wire format, wherein said custom XML schema based message model comprises a logical model of said message that complies with a standard XML schema, and wherein said custom XML schema based message model comprises a physical model that customizes said message using a logical model extension that is unsupported by said standard XML schema, and wherein said physical model comprises said logical model extension and a wire format specific rendering option, wherein said wire format specific rendering option is a directive that specifies a different wire format for each partial component of said message.
|
1. A computer readable medium for use in validating an eXtensible Markup Language (XML) message in a particular wire format, said computer readable medium containing computer-executable instructions which, when performed by a processor in a computing device, cause the computing device to: from a custom XML schema based message model having at least one wire format specific rendering option associated with an XML entity representing at least a portion of said XML message, generate an XML schema fragment for use in validating said XML message at a node that lacks said custom XML schema based message model, wherein said XML schema fragment conforms to said particular wire format, wherein said custom XML schema based message model comprises a logical model of said message that complies with a standard XML schema, and wherein said custom XML schema based message model comprises a physical model that customizes said message using a logical model extension that is unsupported by said standard XML schema, and wherein said physical model comprises said logical model extension and a wire format specific rendering option, wherein said wire format specific rendering option is a directive that specifies a different wire format for each partial component of said message. 6. The computer readable medium of claim 1 , wherein said XML entity is a local element declaration of simple type or an element reference referencing a referenced global element declaration of simple type, and wherein said wire format specific rendering option specifies that said XML entity is to be rendered as an attribute of an XML element of complex type having a complex type definition which contains said XML entity.
| 0.646197 |
10. One or more computer-readable storage media having computer-readable instructions thereon which, when executed by a computer, implement the method of claim 9 .
|
10. One or more computer-readable storage media having computer-readable instructions thereon which, when executed by a computer, implement the method of claim 9 . 11. A computer system comprising the one or more computer-readable storage media of claim 10 .
| 0.990281 |
20. The computer-readable medium of claim 19 , wherein the signals comprise instructions.
|
20. The computer-readable medium of claim 19 , wherein the signals comprise instructions. 24. The computer-readable medium of claim 20 , wherein the previous act by a user comprises a quantity of times the physical entity has been retrieved in a defined interval.
| 0.923932 |
1. A distributed configuration utility facilitating remote configuration of process control data access servers, the distributed configuration utility comprising: a configuration editor located at a configuration console; a configuration storage for storing information including parameter values corresponding to a current configuration of a configurable process control data access server; a rules storage for storing a set of configuration rules associated with the configurable process control data access server, wherein the set of configuration rules provide a guide to processing the configuration information within the configuration storage corresponding to the current configuration of the configurable process control data access server; and a server agent, located on a computing node remote from the configuration console and containing the configurable process control data access server, the server agent including executable procedures for notifying the configuration editor of the configurable process control data access server and thereby facilitating establishing a configuration interface between the configuration editor and the configurable process control data access server.
|
1. A distributed configuration utility facilitating remote configuration of process control data access servers, the distributed configuration utility comprising: a configuration editor located at a configuration console; a configuration storage for storing information including parameter values corresponding to a current configuration of a configurable process control data access server; a rules storage for storing a set of configuration rules associated with the configurable process control data access server, wherein the set of configuration rules provide a guide to processing the configuration information within the configuration storage corresponding to the current configuration of the configurable process control data access server; and a server agent, located on a computing node remote from the configuration console and containing the configurable process control data access server, the server agent including executable procedures for notifying the configuration editor of the configurable process control data access server and thereby facilitating establishing a configuration interface between the configuration editor and the configurable process control data access server. 9. The distributed configuration utility of claim 1 wherein the configuration editor resides upon a computing node at a supervisory level of a process control system.
| 0.547253 |
18. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, performs acts comprising: identifying geometric centers of characters in a page image of text comprising logograms; determining one or more geometric relationships between the geometric centers of the characters; and inferring elements of a layout of the text from the geometric relationships.
|
18. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, performs acts comprising: identifying geometric centers of characters in a page image of text comprising logograms; determining one or more geometric relationships between the geometric centers of the characters; and inferring elements of a layout of the text from the geometric relationships. 20. The computer-readable media of claim 18 , wherein the geometric relationships comprise at least one of a distance between the geometric centers or a displacement between the geometric centers and a reference location.
| 0.899942 |
5. A software shell as claimed in claim 3 wherein the blackboard module database includes a hierarchy of objects having vertical hierarchical connections and horizontal links.
|
5. A software shell as claimed in claim 3 wherein the blackboard module database includes a hierarchy of objects having vertical hierarchical connections and horizontal links. 9. A software shell as claimed in claim 5 wherein the vertical hierarchical connections include IS-A and PART-OF hierarchical connections.
| 0.9535 |
1. A complex background-oriented optical character recognition method, comprising: capturing image information, to obtain a captured image; acquiring a region of target characters from the captured image based on character characteristics as a target object; extracting character edge information in the target object by using a differential method, to obtain an extracted image; superposing the target object and the extracted image, to obtain a recovery image; performing an inverse and a Gaussian filtering on the recovery image, to obtain a processed image; searching for a location of the target characters in the processed image; and recognizing the target characters.
|
1. A complex background-oriented optical character recognition method, comprising: capturing image information, to obtain a captured image; acquiring a region of target characters from the captured image based on character characteristics as a target object; extracting character edge information in the target object by using a differential method, to obtain an extracted image; superposing the target object and the extracted image, to obtain a recovery image; performing an inverse and a Gaussian filtering on the recovery image, to obtain a processed image; searching for a location of the target characters in the processed image; and recognizing the target characters. 5. The complex background-oriented optical character recognition method according to claim 1 , wherein, the searching for the location of the target characters in the processed image comprises: determining a search box based on the character characteristics and the processed image; and sliding the search box in the processed image continuously by a predetermined rule, calculating a sum of grayscales of pixels in the search box, and determining a location of the search box in which the sum of grayscales of pixels is the greatest to be the location of the target characters.
| 0.594376 |
6. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, from a user device, a search query for a content item, the search query including one or more search terms; identifying a corpus of content items previously delivered to the user device, wherein the content items included in the corpus of content items are advertisements corresponding to content sponsors; creating an index of the corpus of content items previously delivered to the user device, wherein the index of the corpus of content items previously delivered to the user device is populated of a cookie stored at the user device; using the received search terms to search the index of the corpus of content items; determining that at least one content item in the index corresponds to the received search terms; and delivering, to the user device, a content item search result, the content item search result including the at least one content item corresponding to the received search terms.
|
6. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, from a user device, a search query for a content item, the search query including one or more search terms; identifying a corpus of content items previously delivered to the user device, wherein the content items included in the corpus of content items are advertisements corresponding to content sponsors; creating an index of the corpus of content items previously delivered to the user device, wherein the index of the corpus of content items previously delivered to the user device is populated of a cookie stored at the user device; using the received search terms to search the index of the corpus of content items; determining that at least one content item in the index corresponds to the received search terms; and delivering, to the user device, a content item search result, the content item search result including the at least one content item corresponding to the received search terms. 8. The non-transitory computer storage medium of claim 6 , wherein cached copies of the content items included in the corpus of content items previously delivered to the user device are stored with the index.
| 0.514513 |
10. A system comprising: a machine-readable storage device having instructions stored thereon; and a data processing apparatus in communication with the machine-readable storage device and operable to execute the instructions to perform operations comprising: obtaining an audio message associated with one or more image files, wherein the obtaining comprises detecting that a first image file is being displayed on a device associated with a user, determining a first period of time when the first image file is displayed on the device associated with the user, and time stamping the obtained audio message; processing the audio message using speech recognition technology to detect a text component of the audio message; determining one or more textual tags for the one or more image files based on the detected text component, wherein the determining comprises determining a first portion of the detected text component corresponding to the first period of time using the time stamps of the obtained audio message and identifying a first set of the one or more textual tags that were determined based on the first portion of the detected text component; and assigning the one or more textual tags to the one or more image files, wherein the assigning comprises assigning one or more of the textual tags from the first set of the one or more textual tags to the first image file.
|
10. A system comprising: a machine-readable storage device having instructions stored thereon; and a data processing apparatus in communication with the machine-readable storage device and operable to execute the instructions to perform operations comprising: obtaining an audio message associated with one or more image files, wherein the obtaining comprises detecting that a first image file is being displayed on a device associated with a user, determining a first period of time when the first image file is displayed on the device associated with the user, and time stamping the obtained audio message; processing the audio message using speech recognition technology to detect a text component of the audio message; determining one or more textual tags for the one or more image files based on the detected text component, wherein the determining comprises determining a first portion of the detected text component corresponding to the first period of time using the time stamps of the obtained audio message and identifying a first set of the one or more textual tags that were determined based on the first portion of the detected text component; and assigning the one or more textual tags to the one or more image files, wherein the assigning comprises assigning one or more of the textual tags from the first set of the one or more textual tags to the first image file. 18. The system of claim 10 , wherein the assigning the one or more textual tags to the one or more image files comprises assigning the one or more textual tags to a portion of an image or group of images in the one or more image files.
| 0.54537 |
9. The mobile device of claim 8 , further comprising receiving an input from a user interface of the mobile device to selectively display one of the graphical representation of the surface of the object, at least one marking of the plurality of markings, a symbol of the plurality of alternative groups of symbols, a transliteration of the plurality of alternative transliterations, a translation of the plurality of alternative translations, or combinations thereof.
|
9. The mobile device of claim 8 , further comprising receiving an input from a user interface of the mobile device to selectively display one of the graphical representation of the surface of the object, at least one marking of the plurality of markings, a symbol of the plurality of alternative groups of symbols, a transliteration of the plurality of alternative transliterations, a translation of the plurality of alternative translations, or combinations thereof. 10. The mobile device of claim 9 , wherein one of the plurality of alternative groups of symbols, the plurality of alternative transliterations or the plurality of alternative translations are presented on the display device.
| 0.902192 |
36. A text-to-speech processor according to claim 33, wherein the look-up table is comprised by speech commands associated with punctuation and arithmetic symbols.
|
36. A text-to-speech processor according to claim 33, wherein the look-up table is comprised by speech commands associated with punctuation and arithmetic symbols. 37. A text-to-speech processor according to claim 36, wherein said table is further comprised by pre-designated text associated with punctuation and arithmetic symbols, said text generator generating text in response to pre-designated text in the look-up table.
| 0.880386 |
1. A computer-implemented method for utilizing a plurality of recognizers to process an utterance based on a markup language document, comprising: receiving the markup language document; receiving the utterance; selecting at least one of the plurality of recognizers for returning a results set for the utterance based on markup language in the markup language document, the at least one of the plurality of recognizers for returning the results set for the utterance being selected based on markup language in the markup language document, the selection based on the markup language further comprising: recognizing a grammar used in the utterance; parsing the markup language document for at least one markup language tag identifying at least one of the plurality of recognizers for returning the results set for the utterance based on the grammar; and selecting, by an event handler, the at least one of the plurality of recognizers identified by the at least one markup language tag, the selected at least one of the plurality of recognizers comprising a local recognizer embedded on a client computing device, when the grammar includes data stored on the client computing device, the selected at least one of the plurality of recognizers comprising a network recognizer on a network server, when the grammar includes data which is retrieved via a query from the network server to a remote search engine; receiving the results set from the selected at least one of the plurality of recognizers in a format determined by a processing method specified in the markup language document; and executing an event in response to receiving the results set, the event comprising determining actions in response to receiving the results set, the actions being based on at least an assigned confidence score indicating an accuracy of a speech recognition for the utterance, the actions comprising ignoring the results set when the results sets comprises unprocessed results for the utterance and the confidence score is below a predetermined threshold, the actions further comprising preventing the results set from being displayed to a user.
|
1. A computer-implemented method for utilizing a plurality of recognizers to process an utterance based on a markup language document, comprising: receiving the markup language document; receiving the utterance; selecting at least one of the plurality of recognizers for returning a results set for the utterance based on markup language in the markup language document, the at least one of the plurality of recognizers for returning the results set for the utterance being selected based on markup language in the markup language document, the selection based on the markup language further comprising: recognizing a grammar used in the utterance; parsing the markup language document for at least one markup language tag identifying at least one of the plurality of recognizers for returning the results set for the utterance based on the grammar; and selecting, by an event handler, the at least one of the plurality of recognizers identified by the at least one markup language tag, the selected at least one of the plurality of recognizers comprising a local recognizer embedded on a client computing device, when the grammar includes data stored on the client computing device, the selected at least one of the plurality of recognizers comprising a network recognizer on a network server, when the grammar includes data which is retrieved via a query from the network server to a remote search engine; receiving the results set from the selected at least one of the plurality of recognizers in a format determined by a processing method specified in the markup language document; and executing an event in response to receiving the results set, the event comprising determining actions in response to receiving the results set, the actions being based on at least an assigned confidence score indicating an accuracy of a speech recognition for the utterance, the actions comprising ignoring the results set when the results sets comprises unprocessed results for the utterance and the confidence score is below a predetermined threshold, the actions further comprising preventing the results set from being displayed to a user. 2. The method of claim 1 further comprising: sending version data for the at least one of the plurality of recognizers from a first computing device to a second computing device; and if the version data identifies an updated version for the at least one of the plurality of recognizers, then receiving additional markup language from the second computing device at the first computing device, the additional markup language comprising instructions for utilizing newly added features in the updated version.
| 0.752441 |
7. A system comprising: a first server to provide a first application to a client; a storage system to store compatibility data; and a second server to provide a second application to the client, the second server sharing resources with the first server, the second server to check the expiration of the compatibility data and intercompatibility of the first application and an update of the second application using the compatibility data prior to update of the second application on the second server, the second server to select any one of a parallel or a rolling update to update the second application based on the check of the compatibility data, the parallel update to update the second application of the second server for an update that is incompatible with the first application of the first server at a same time that the first application is updated and the rolling update to update the application of the second server for an update that is compatible with the first application of the first server while the compatible first application is executed by the first server, the second server to schedule automatically the parallel update process in response to the expiration of the compatibility data.
|
7. A system comprising: a first server to provide a first application to a client; a storage system to store compatibility data; and a second server to provide a second application to the client, the second server sharing resources with the first server, the second server to check the expiration of the compatibility data and intercompatibility of the first application and an update of the second application using the compatibility data prior to update of the second application on the second server, the second server to select any one of a parallel or a rolling update to update the second application based on the check of the compatibility data, the parallel update to update the second application of the second server for an update that is incompatible with the first application of the first server at a same time that the first application is updated and the rolling update to update the application of the second server for an update that is compatible with the first application of the first server while the compatible first application is executed by the first server, the second server to schedule automatically the parallel update process in response to the expiration of the compatibility data. 10. The system of claim 7 , wherein the compatibility data indicates compatible software versions of the first application and the second application.
| 0.848697 |
1. A method, comprising: using a computer to perform: collecting information about a user manipulation of a stylus in relation to a tablet device associated with the computer; recognizing, from the collected information, a stylus gesture performed by the user via manipulation of the stylus, such that: the stylus gesture is one of a plurality of stylus gestures that are recognized by the computer to perform at least one of a plurality of actions in a graphics application that comprises a natural media painting application, at least some of the stylus gestures are mapped to user manipulation of the stylus at a distance from the tablet device, at least some of the stylus gestures involve contact of the stylus with the tablet device, and the stylus gestures include a brush switching gesture in which a proximity of the stylus to the tablet changes from a first position relative to the tablet to a second position that is further away from the tablet and with at least a rate of change that corresponds to the brush switching gesture, the first position being within a first pre-defined distance threshold relative the tablet and the second position being beyond a second pre-defined distance threshold, and switching between paintbrushes of a brush tool being performed responsive to recognition of the brush switching gesture; determining which of the plurality of actions to perform based on the recognized stylus gesture; and performing a painting function for a digital image in the graphics application including performing the determined actions.
|
1. A method, comprising: using a computer to perform: collecting information about a user manipulation of a stylus in relation to a tablet device associated with the computer; recognizing, from the collected information, a stylus gesture performed by the user via manipulation of the stylus, such that: the stylus gesture is one of a plurality of stylus gestures that are recognized by the computer to perform at least one of a plurality of actions in a graphics application that comprises a natural media painting application, at least some of the stylus gestures are mapped to user manipulation of the stylus at a distance from the tablet device, at least some of the stylus gestures involve contact of the stylus with the tablet device, and the stylus gestures include a brush switching gesture in which a proximity of the stylus to the tablet changes from a first position relative to the tablet to a second position that is further away from the tablet and with at least a rate of change that corresponds to the brush switching gesture, the first position being within a first pre-defined distance threshold relative the tablet and the second position being beyond a second pre-defined distance threshold, and switching between paintbrushes of a brush tool being performed responsive to recognition of the brush switching gesture; determining which of the plurality of actions to perform based on the recognized stylus gesture; and performing a painting function for a digital image in the graphics application including performing the determined actions. 4. The method of claim 1 , wherein the plurality of stylus gestures that are recognized by the computer includes a translation in one or more dimensions, a twisting motion, a barrel rotation, a fanning motion, a mashing down of the stylus into a tablet device, a jerking down motion, shaking the stylus away from the tablet device, and shaking the stylus toward the tablet device.
| 0.766544 |
29. An apparatus for generating text, the apparatus comprising: a modeling mechanism in a computer system configured to: represent a concept as a cluster node; represent a word as a terminal node; assign a weight to a link from a first node to a second node, wherein the weight indicates a probability of the second node triggering additional nodes when the first node triggers the second node; a model-training mechanism in the computer system configured to train the model based on a set of documents, wherein the training comprises: for each cluster node, computing a probabilistic cost of a corresponding concept existing in a document but not triggering any words.
|
29. An apparatus for generating text, the apparatus comprising: a modeling mechanism in a computer system configured to: represent a concept as a cluster node; represent a word as a terminal node; assign a weight to a link from a first node to a second node, wherein the weight indicates a probability of the second node triggering additional nodes when the first node triggers the second node; a model-training mechanism in the computer system configured to train the model based on a set of documents, wherein the training comprises: for each cluster node, computing a probabilistic cost of a corresponding concept existing in a document but not triggering any words. 41. The apparatus of claim 29 , wherein the word comprises: a single word; or a compound comprising two or more words.
| 0.645141 |
10. A non-transitory computer-readable medium having instructions stored thereon, which, when executed by one or more computers, cause the one or more computers to perform operations comprising: generating one or more webpages each including a link to a respective destination document hosted on a respective destination server; specifying a style for the link in each of the webpages according to a style sheet language, the style including a behavior trigger and a display property, wherein the display property includes a retrieval address for a resource at the one or more computers, wherein the behavior trigger is programmed to be activated by a user selection of the link on the webpage, wherein the activation causes a request for the resource from to be made to the retrieval address at the one or more computers, and, wherein the resource is different from the destination document and the destination server is different from the one or more computers; providing, in response to a search query from a client, the webpages, each with the specified style, to the client; receiving a plurality of requests for a resource from the client, wherein each request for the resource is caused an activation of a behavior trigger, and wherein the behavior trigger is specified in a style in one of the webpages for a link to a destination document; and counting how many times the client has selected the destination document in response to receiving the plurality of requests; and transmitting a respective reply to the client in response to each of the received requests for the resource, the respective reply having no cacheable content with regard to how many times the client has selected the destination document.
|
10. A non-transitory computer-readable medium having instructions stored thereon, which, when executed by one or more computers, cause the one or more computers to perform operations comprising: generating one or more webpages each including a link to a respective destination document hosted on a respective destination server; specifying a style for the link in each of the webpages according to a style sheet language, the style including a behavior trigger and a display property, wherein the display property includes a retrieval address for a resource at the one or more computers, wherein the behavior trigger is programmed to be activated by a user selection of the link on the webpage, wherein the activation causes a request for the resource from to be made to the retrieval address at the one or more computers, and, wherein the resource is different from the destination document and the destination server is different from the one or more computers; providing, in response to a search query from a client, the webpages, each with the specified style, to the client; receiving a plurality of requests for a resource from the client, wherein each request for the resource is caused an activation of a behavior trigger, and wherein the behavior trigger is specified in a style in one of the webpages for a link to a destination document; and counting how many times the client has selected the destination document in response to receiving the plurality of requests; and transmitting a respective reply to the client in response to each of the received requests for the resource, the respective reply having no cacheable content with regard to how many times the client has selected the destination document. 15. The computer-readable medium of claim 10 , wherein the retrieval address for the resource specified for the link further encodes a time at which a respective webpage containing the link was provided to the client.
| 0.513619 |
8. A non-transitory computer readable medium having stored thereon instructions that when executed by a processor will cause the processor to: identify one or more schema objects of each of a first XML schema and a second XML schema; compare one of the identified schema objects of the first XML schema with one of the identified schema objects of the second XML schema; if a difference is detected between the compared schema objects, evaluate a risk of the detected difference affecting operation of a composite application incorporating the first schema or the second schema; and issue a notification of the evaluated risk of the detected difference; wherein evaluating the risk comprises evaluating the risk in accordance with a predetermined rule.
|
8. A non-transitory computer readable medium having stored thereon instructions that when executed by a processor will cause the processor to: identify one or more schema objects of each of a first XML schema and a second XML schema; compare one of the identified schema objects of the first XML schema with one of the identified schema objects of the second XML schema; if a difference is detected between the compared schema objects, evaluate a risk of the detected difference affecting operation of a composite application incorporating the first schema or the second schema; and issue a notification of the evaluated risk of the detected difference; wherein evaluating the risk comprises evaluating the risk in accordance with a predetermined rule. 14. The non-transitory computer readable medium of claim 8 , wherein the instructions to compare the schema objects comprise instructions to compare a name, type, or attribute of an element defined in the first or second XML schema.
| 0.586981 |
26. A method of configuring a complex event processing (CEP) system in which a stream of events is received via an event bus, each said event having a predefined event type, the method comprising: receiving queries that are to be executable in connection with the CEP system; determining, in connection with at least one processor, whether a received query either initially conforms to a CEP query language executable by an event processing agent, or must be translated from an enhanced query that conforms to a version of the CEP query language that has been enriched so that semantics thereof are represented in accordance with an ontology in order to render it executable via the event processing agent; when the received query must be translated, generating a translated query from the enhanced query in accordance with mappings between concepts of the CEP system and concepts of the ontology, wherein the enhanced query includes references to ontology concepts and the references to the ontology concepts are translated into queries processable by the event processing agent in accordance with the query language; and deploying all queries that initially conform to the CEP query language and all translated queries for possible subsequent execution; wherein the concepts of the ontology are classes, and wherein the generating of the translated query comprises, for the enhanced query: retrieving a class definition for all referenced classes from a corresponding ontology; determining whether the referenced classes are marked as being handled; when the referenced classes are marked as being handled, transforming the respective class definition to the query language, and compiling the translated query; and when the referenced classes are not marked as being handled: when the respective class does not have a corresponding mapping, replacing the class with a union of all of its sub-classes; when the respective class has a corresponding mapping but no sub-classes, removing the reference to the class; and when the respective class has a corresponding mapping and any sub-classes, adding a union with all sub-classes to the class and marking the class as handled.
|
26. A method of configuring a complex event processing (CEP) system in which a stream of events is received via an event bus, each said event having a predefined event type, the method comprising: receiving queries that are to be executable in connection with the CEP system; determining, in connection with at least one processor, whether a received query either initially conforms to a CEP query language executable by an event processing agent, or must be translated from an enhanced query that conforms to a version of the CEP query language that has been enriched so that semantics thereof are represented in accordance with an ontology in order to render it executable via the event processing agent; when the received query must be translated, generating a translated query from the enhanced query in accordance with mappings between concepts of the CEP system and concepts of the ontology, wherein the enhanced query includes references to ontology concepts and the references to the ontology concepts are translated into queries processable by the event processing agent in accordance with the query language; and deploying all queries that initially conform to the CEP query language and all translated queries for possible subsequent execution; wherein the concepts of the ontology are classes, and wherein the generating of the translated query comprises, for the enhanced query: retrieving a class definition for all referenced classes from a corresponding ontology; determining whether the referenced classes are marked as being handled; when the referenced classes are marked as being handled, transforming the respective class definition to the query language, and compiling the translated query; and when the referenced classes are not marked as being handled: when the respective class does not have a corresponding mapping, replacing the class with a union of all of its sub-classes; when the respective class has a corresponding mapping but no sub-classes, removing the reference to the class; and when the respective class has a corresponding mapping and any sub-classes, adding a union with all sub-classes to the class and marking the class as handled. 34. The method of claim 26 , further comprising detecting when an ontology has changed and, in response, to a detection of a change, recompiling and redeploying any affected enriched queries in order to reflect a most recent state of the changed ontology.
| 0.584178 |
1. A computer-based method of determining a location, comprising: receiving a signal representing an utterance from the user, the utterance specifying a location attribute and a landmark; identifying a set of candidate locations based on the specified location attribute; identifying a set of landmarks based on the specified landmark; generating an associated kernel model for each landmark in the set of landmarks, each kernel model comprising a three-dimensional model centered on a map at the location of a landmark associated with the kernel model; ranking the candidate locations based on kernel model amplitudes at each candidate location, wherein at least one candidate location is associated with multiple kernel models, and wherein the at least one candidate location is ranked based on a sum of the amplitudes of the multiple kernel models at the at least one candidate location; and selecting a location to provide to the user based on the ranked candidate locations.
|
1. A computer-based method of determining a location, comprising: receiving a signal representing an utterance from the user, the utterance specifying a location attribute and a landmark; identifying a set of candidate locations based on the specified location attribute; identifying a set of landmarks based on the specified landmark; generating an associated kernel model for each landmark in the set of landmarks, each kernel model comprising a three-dimensional model centered on a map at the location of a landmark associated with the kernel model; ranking the candidate locations based on kernel model amplitudes at each candidate location, wherein at least one candidate location is associated with multiple kernel models, and wherein the at least one candidate location is ranked based on a sum of the amplitudes of the multiple kernel models at the at least one candidate location; and selecting a location to provide to the user based on the ranked candidate locations. 3. The method of claim 1 , wherein identifying a set of candidate locations comprises performing semantic belief tracking to identify candidate locations representative of the specified location attribute.
| 0.630753 |
15. The method of claim 10 , wherein the step of sorting the document vectors comprises sorting the document vectors in descending order by the similarity values.
|
15. The method of claim 10 , wherein the step of sorting the document vectors comprises sorting the document vectors in descending order by the similarity values. 16. The method of claim 15 , wherein forming clusters of documents based on the similarity values between adjacent document vectors in the sorted list comprises iterating through the sorted list successively to determine if a next document has at least a predetermined similarity to a preceding document by the comparison of the document vectors.
| 0.8766 |
40. The non-transitory computer readable storage medium of claim 33 , further comprising instructions that if executed enable the computing system to: extract metadata from unstructured text documents.
|
40. The non-transitory computer readable storage medium of claim 33 , further comprising instructions that if executed enable the computing system to: extract metadata from unstructured text documents. 45. The non-transitory computer readable storage medium of claim 40 , further comprising instructions that if executed enable the computing system to: compute a sentiment on the unstructured text data; and analyze an aggregation of metadata values to provide a measure of sentiment.
| 0.92702 |
1. A computer-implemented method for an eigenvalue-based data query, comprising: receiving a query request that includes a query statement; calculating eigenvalues of key component elements in the query statement; matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements; based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in the execution plan of the historical query statement, generating an execution plan of the query statement; establishing a global column set sequence based on corresponding columns of all tables in a database management system; establishing corresponding predicate bitmap codes for all predicates in the database management system; adding, to at least one node of the execution plan of the historical query statement a table bitmap attribute, a column bitmap attribute and a predicate bitmap attribute; and calculating at least one of a table bitmap attribute eigenvalue, a column bitmap attribute eigenvalue and a predicate bitmap attribute eigenvalue corresponding to at least one node of the execution plan based on at least one of the global table set sequence, the global column set sequence and the predicate bitmap codes, wherein the calculating further comprises: calculating the table bitmap attribute eigenvalue, the column bitmap attribute eigenvalue and the predicate bitmap attribute eigenvalue of at least one node of the execution plan based on at least one of all tables, all columns and all predicates involved in sub nodes and leaf nodes corresponding to the at least one node and the at least one node, in combination with at least one of the respective global table set sequence, global column set sequence and predicate bitmap codes.
|
1. A computer-implemented method for an eigenvalue-based data query, comprising: receiving a query request that includes a query statement; calculating eigenvalues of key component elements in the query statement; matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements; based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in the execution plan of the historical query statement, generating an execution plan of the query statement; establishing a global column set sequence based on corresponding columns of all tables in a database management system; establishing corresponding predicate bitmap codes for all predicates in the database management system; adding, to at least one node of the execution plan of the historical query statement a table bitmap attribute, a column bitmap attribute and a predicate bitmap attribute; and calculating at least one of a table bitmap attribute eigenvalue, a column bitmap attribute eigenvalue and a predicate bitmap attribute eigenvalue corresponding to at least one node of the execution plan based on at least one of the global table set sequence, the global column set sequence and the predicate bitmap codes, wherein the calculating further comprises: calculating the table bitmap attribute eigenvalue, the column bitmap attribute eigenvalue and the predicate bitmap attribute eigenvalue of at least one node of the execution plan based on at least one of all tables, all columns and all predicates involved in sub nodes and leaf nodes corresponding to the at least one node and the at least one node, in combination with at least one of the respective global table set sequence, global column set sequence and predicate bitmap codes. 4. The computer-implemented method according to claim 1 , wherein the generating an execution plan of the query statement comprises: specifying the execution plan corresponding to the nodes as at least one part of the execution plan of the query statement.
| 0.829801 |
10. A method comprising: receiving a first plurality of images at a first image resolution and a second plurality of images at a second image resolution, wherein the first image resolution is lower than the second image resolution; for each image of the first plurality of images: transforming the image into a transformed image of the second image resolution; identifying a plurality of first image pixel sets comprising a plurality of pixels of the transformed image; identifying, for each first image pixel set, a corresponding second image pixel set of the second plurality of images; storing each first image pixel set and each corresponding second image pixel set in a database repository of corresponding image pixel sets; based on the first image pixel sets in the database repository of corresponding image pixel sets, computing a plurality of first image pixel set features, wherein each first image pixel set may be computed as a linear combination of a subset of the plurality of first image pixel set features; based on the first image pixel set features for each first image pixel set and corresponding second image pixel set, computing a corresponding plurality of second image pixel set features, wherein each first image pixel feature corresponds to a second image pixel set feature of the corresponding plurality of second image pixel set features, and wherein each second image pixel set may be computed as a linear combination of a subset of the corresponding plurality of second image pixel set features and each second image pixel feature of the subset corresponds to a first image pixel feature in the subset of the plurality of first image pixel set features for the first image pixel set that corresponds to the second image pixel set; storing, in a data record, each first image pixel feature and each corresponding second image pixel feature; receiving a first particular image at the first image resolution; transforming the first particular image from the first image resolution to the second image resolution; identifying a plurality of first particular image pixel sets of the transformed particular image; for each of the plurality of first particular image pixel sets: identifying a particular subset of the plurality of first image pixel set features such that the first particular image pixel set may be computed as a linear combination of the particular subset of the plurality of first image pixel set features; for each first image pixel set feature of the particular subset, identifying a corresponding second image pixel set feature; computing a second particular image pixel set as a linear combination of the identified corresponding second image pixel set features; generating and displaying, on a computing device, a second particular image from the second particular image sets.
|
10. A method comprising: receiving a first plurality of images at a first image resolution and a second plurality of images at a second image resolution, wherein the first image resolution is lower than the second image resolution; for each image of the first plurality of images: transforming the image into a transformed image of the second image resolution; identifying a plurality of first image pixel sets comprising a plurality of pixels of the transformed image; identifying, for each first image pixel set, a corresponding second image pixel set of the second plurality of images; storing each first image pixel set and each corresponding second image pixel set in a database repository of corresponding image pixel sets; based on the first image pixel sets in the database repository of corresponding image pixel sets, computing a plurality of first image pixel set features, wherein each first image pixel set may be computed as a linear combination of a subset of the plurality of first image pixel set features; based on the first image pixel set features for each first image pixel set and corresponding second image pixel set, computing a corresponding plurality of second image pixel set features, wherein each first image pixel feature corresponds to a second image pixel set feature of the corresponding plurality of second image pixel set features, and wherein each second image pixel set may be computed as a linear combination of a subset of the corresponding plurality of second image pixel set features and each second image pixel feature of the subset corresponds to a first image pixel feature in the subset of the plurality of first image pixel set features for the first image pixel set that corresponds to the second image pixel set; storing, in a data record, each first image pixel feature and each corresponding second image pixel feature; receiving a first particular image at the first image resolution; transforming the first particular image from the first image resolution to the second image resolution; identifying a plurality of first particular image pixel sets of the transformed particular image; for each of the plurality of first particular image pixel sets: identifying a particular subset of the plurality of first image pixel set features such that the first particular image pixel set may be computed as a linear combination of the particular subset of the plurality of first image pixel set features; for each first image pixel set feature of the particular subset, identifying a corresponding second image pixel set feature; computing a second particular image pixel set as a linear combination of the identified corresponding second image pixel set features; generating and displaying, on a computing device, a second particular image from the second particular image sets. 11. The method of claim 10 , further comprising: computing the plurality of first image pixel set features such that each first image pixel set may be computed as a linear combination of the subset of the plurality of first image pixel set features with first weights for each feature in the subset; computing the corresponding plurality of second image pixel set features such that each second image pixel set may be computed as a linear combination of the subset of the corresponding plurality of second image pixel set features with the same first weights for each feature in the subset as the corresponding first weights for each feature in the corresponding subset; for each of the first particular image sets: identifying, with the particular subset of the plurality of first image pixel set features, second weights for each feature such that the first particular image pixel set may be computed as a linear combination of the particular subset of the plurality of first image pixel set features with the second weights for each feature in the particular subset; computing the second particular image pixel set as a linear combination of the identified corresponding second image pixel set features with the same second weights for each feature in the subset as the corresponding second weights for each feature in the corresponding particular subset.
| 0.5 |
4. The method of claim 3 , further comprising selecting the subset of instructions as a portion of an entire instruction set for the program code.
|
4. The method of claim 3 , further comprising selecting the subset of instructions as a portion of an entire instruction set for the program code. 6. The method of claim 4 , wherein the selected subset of instructions is capable of interpreting a majority of the basic blocks of a specific target program application.
| 0.915408 |
10. A computer-implemented method for causing at least one processor to execute instructions recorded on a computer-readable storage medium, the method comprising: determining a semantic metamodel applicable to at least two software applications, the semantic metamodel including a description of semantics, processes, and data that are applicable to the at least two software applications; obtaining application metadata describing functionality provided by a first software application of the at least two software applications; transforming the first application metadata into a first application-specific metamodel instance of the semantic metamodel, the transformation including translating the first application metadata into requirements that specify application functionality for the first software application, and mapping a portion of the requirements in the first software application to requirements in a second software application of the at least two software applications, the portion selected based on discovering that the first software application is requesting functionality associated with the second software application; and integrating the at least two software applications, including the portion, based on the first application-specific metamodel instance and the requested functionality, and based on a second application-specific metamodel instance of the semantic metamodel obtained from second application metadata of the second software application, wherein the transformation engine is configured to cause the at least one processor to transform the first application metadata into the first application-specific metamodel instance of the semantic metamodel independently of the second application-specific metamodel instance.
|
10. A computer-implemented method for causing at least one processor to execute instructions recorded on a computer-readable storage medium, the method comprising: determining a semantic metamodel applicable to at least two software applications, the semantic metamodel including a description of semantics, processes, and data that are applicable to the at least two software applications; obtaining application metadata describing functionality provided by a first software application of the at least two software applications; transforming the first application metadata into a first application-specific metamodel instance of the semantic metamodel, the transformation including translating the first application metadata into requirements that specify application functionality for the first software application, and mapping a portion of the requirements in the first software application to requirements in a second software application of the at least two software applications, the portion selected based on discovering that the first software application is requesting functionality associated with the second software application; and integrating the at least two software applications, including the portion, based on the first application-specific metamodel instance and the requested functionality, and based on a second application-specific metamodel instance of the semantic metamodel obtained from second application metadata of the second software application, wherein the transformation engine is configured to cause the at least one processor to transform the first application metadata into the first application-specific metamodel instance of the semantic metamodel independently of the second application-specific metamodel instance. 12. The method of claim 10 , wherein the semantic metamodel defines features applicable to the at least two software applications, and the first application-specific metamodel instance includes instantiations of a subset of the defined features that are provided by the first software application.
| 0.642113 |
2. A computer-implemented method for building a polyhierarchical classification of objects, comprising: a) identifying a plurality of criteria for specializing the objects based on their properties, wherein each criterion of the plurality of criteria is defined by a set of mutually exclusive attributes, wherein each attribute describes one or more properties of the objects; b) recurrently defining a root category for each criterion in terms of an attributive expression representing a logical composition of one or more attributes of criteria whose root categories have been previously defined in the recurrent sequence, or the empty attributive expression; wherein no one criterion participates in the definition of its own root category, and each attributive expression encodes a sequence of specializations by criteria so that the root category of each following criterion includes the category represented by the sequence of all previous specializations; c) storing in a computer-readable medium the plurality of criteria and their root categories in the form of attributive expressions; and d) using the stored plurality of criteria for polyhierachically structuring, updating and accessing information associated with the objects.
|
2. A computer-implemented method for building a polyhierarchical classification of objects, comprising: a) identifying a plurality of criteria for specializing the objects based on their properties, wherein each criterion of the plurality of criteria is defined by a set of mutually exclusive attributes, wherein each attribute describes one or more properties of the objects; b) recurrently defining a root category for each criterion in terms of an attributive expression representing a logical composition of one or more attributes of criteria whose root categories have been previously defined in the recurrent sequence, or the empty attributive expression; wherein no one criterion participates in the definition of its own root category, and each attributive expression encodes a sequence of specializations by criteria so that the root category of each following criterion includes the category represented by the sequence of all previous specializations; c) storing in a computer-readable medium the plurality of criteria and their root categories in the form of attributive expressions; and d) using the stored plurality of criteria for polyhierachically structuring, updating and accessing information associated with the objects. 24. The method of claim 2 , further comprising extending the polyhierarchy classification by introducing an additional attribute to an existing criterion.
| 0.700283 |
55. The invention set forth in claim 54 wherein said first class (a) of subproblems is investigated by a method comprising the steps of identifying the portion of the directory in which the first character of the input string is matched by the first character of the directory strings, said portion to be known as the matching portion of the directory, and searching a directory obtained from the matching portion by removing the first character from each string in said matching portion for a character string closely resembling the input string with its first character removed.
|
55. The invention set forth in claim 54 wherein said first class (a) of subproblems is investigated by a method comprising the steps of identifying the portion of the directory in which the first character of the input string is matched by the first character of the directory strings, said portion to be known as the matching portion of the directory, and searching a directory obtained from the matching portion by removing the first character from each string in said matching portion for a character string closely resembling the input string with its first character removed. 56. The invention set forth in claim 55 wherein said second class (b) of subproblems is investigated by finding a string in the directory that closely resembles the input string with its first character removed.
| 0.652085 |
1. A method of providing voicemail to a mobile telephone, in which a caller initiates a voice call to the mobile telephone, but that call is diverted to a voicemail server, with the caller then leaving a voice message on the voicemail server, the method comprising the steps of: when a recording time of the voice message exceeds a maximum time, sending a standard notification to the mobile telephone indicating that an end-user of the mobile telephone has a new voicemail to listen to; when the recording time of the voice message is less than a maximum time: converting the voice message to an audio file format; sending or streaming the audio file to a voice to text transcription system comprising at least one computer adapted to play back the voice message to an operator to enable the operator to transcribe the voice message into the computer to generate a transcribed text message; including a unique identification in the transcribed text message that links the text message to the voice message held at the voicemail server; sending the transcribed text message to the mobile phone; and providing the voice message held at the server to the mobile telephone when the end-user of the mobile telephone selects or uses the unique identification.
|
1. A method of providing voicemail to a mobile telephone, in which a caller initiates a voice call to the mobile telephone, but that call is diverted to a voicemail server, with the caller then leaving a voice message on the voicemail server, the method comprising the steps of: when a recording time of the voice message exceeds a maximum time, sending a standard notification to the mobile telephone indicating that an end-user of the mobile telephone has a new voicemail to listen to; when the recording time of the voice message is less than a maximum time: converting the voice message to an audio file format; sending or streaming the audio file to a voice to text transcription system comprising at least one computer adapted to play back the voice message to an operator to enable the operator to transcribe the voice message into the computer to generate a transcribed text message; including a unique identification in the transcribed text message that links the text message to the voice message held at the voicemail server; sending the transcribed text message to the mobile phone; and providing the voice message held at the server to the mobile telephone when the end-user of the mobile telephone selects or uses the unique identification. 10. The method of claim 1 in which the operator omits from the transcribed text message hesitations, artifacts, and/or repetitions present in the voice message.
| 0.541124 |
2. The information processor according to claim 1 , further comprising basic information generation means for generating basic information corresponding to the context information based on a result of clustering the proper noun pair included in the context information.
|
2. The information processor according to claim 1 , further comprising basic information generation means for generating basic information corresponding to the context information based on a result of clustering the proper noun pair included in the context information. 3. The information processor according to claim 2 , further comprising selection means for selecting an element in the characteristic amount based on the context topic ratio estimated regarding the characteristic amount of the respective context information.
| 0.916235 |
15. In a general purpose computer, a method for automatically testing a business intelligence artifact, the method comprising: developing an initial version of a business intelligence artifact based on requirements of a business intelligence stakeholder, wherein the business intelligence artifact is selected from the group consisting of: a report specification, an analysis cube, and a metadata model; executing the initial version of the business intelligence artifact to generate a business intelligence output populated with business intelligence data corresponding to the requirements of the business intelligence stakeholder; creating at least one test case for the initial version of the business intelligence artifact, the at least one test case having at least one assertion condition to verify that the initial version of the business intelligence artifact is functioning properly after the initial version of the business intelligence artifact is executed; using an automated agent interfaced with the business intelligence system to test the initial version of the business intelligence artifact for errors by determining whether the business intelligence output generated by the initial version of the business intelligence artifact satisfies the assertion conditions after the business intelligence artifact is executed; and when errors are detected, using a subsequent version of the business intelligence artifact.
|
15. In a general purpose computer, a method for automatically testing a business intelligence artifact, the method comprising: developing an initial version of a business intelligence artifact based on requirements of a business intelligence stakeholder, wherein the business intelligence artifact is selected from the group consisting of: a report specification, an analysis cube, and a metadata model; executing the initial version of the business intelligence artifact to generate a business intelligence output populated with business intelligence data corresponding to the requirements of the business intelligence stakeholder; creating at least one test case for the initial version of the business intelligence artifact, the at least one test case having at least one assertion condition to verify that the initial version of the business intelligence artifact is functioning properly after the initial version of the business intelligence artifact is executed; using an automated agent interfaced with the business intelligence system to test the initial version of the business intelligence artifact for errors by determining whether the business intelligence output generated by the initial version of the business intelligence artifact satisfies the assertion conditions after the business intelligence artifact is executed; and when errors are detected, using a subsequent version of the business intelligence artifact. 16. The method according to claim 15 , further comprising recording the business intelligence output and associating the business intelligence output with the version of the business intelligence artifact that generated the business intelligence output.
| 0.736322 |
37. The information analysis method according to claim 32 , further comprising the steps of: (f) estimating, for each unit of training, a density indicating a degree to which the unit of training contains the target information; and (g) generating feature data from the density estimated in the step (f) and the training data, and further acquiring a determination model usable in the determination performed in the step (b), using the feature data, wherein in the step (b), it is determined whether or not each sentence is target information in accordance with the determination model acquired in the step (g).
|
37. The information analysis method according to claim 32 , further comprising the steps of: (f) estimating, for each unit of training, a density indicating a degree to which the unit of training contains the target information; and (g) generating feature data from the density estimated in the step (f) and the training data, and further acquiring a determination model usable in the determination performed in the step (b), using the feature data, wherein in the step (b), it is determined whether or not each sentence is target information in accordance with the determination model acquired in the step (g). 38. The information analysis method according to claim 37 , wherein in the step (f), for each unit of training, a density indicating a degree to which the unit of training contains the target information is estimated using the density estimation model acquired in the step (e).
| 0.850485 |
2. The method of claim 1 , wherein the first preset rule includes: returning a corresponding result and using the corresponding result as a first partial regular expression when the first character string satisfies a second preset rule.
|
2. The method of claim 1 , wherein the first preset rule includes: returning a corresponding result and using the corresponding result as a first partial regular expression when the first character string satisfies a second preset rule. 5. The method of claim 2 , wherein the second preset rule includes: returning a second preset identifier when the first character string is not empty, the first character string is composed of word characters including letters, and the to-be-collected character string is empty, or the first character of the to-be-collected character string is not a word character.
| 0.782583 |
1. A method for searching for an item, comprising: receiving a keystroke sequence, wherein a keystroke of the keystroke sequence is associated with a symbol; in response to receiving the keystroke sequence, searching a collection of items to generate a first result set of items, wherein each item of the collection of items is associated with metadata, and wherein the searching comprises identifying items that comprise symbols associated with the keystroke sequence in the metadata; generating for display the items of the first result set; receiving a user selection of an item of the first result set; receiving a user input that selects a search option that corresponds to metadata associated with the selected item; obtaining, without receiving an additional keystroke sequence, metadata associated with the selected item after receiving the user selection of the item and the user input; searching the collection of items to generate a second result set of items based on the obtained metadata associated with the selected item, wherein the searching comprises identifying items that comprise the obtained metadata associated with the selected item; and generating for display the items of the second result set.
|
1. A method for searching for an item, comprising: receiving a keystroke sequence, wherein a keystroke of the keystroke sequence is associated with a symbol; in response to receiving the keystroke sequence, searching a collection of items to generate a first result set of items, wherein each item of the collection of items is associated with metadata, and wherein the searching comprises identifying items that comprise symbols associated with the keystroke sequence in the metadata; generating for display the items of the first result set; receiving a user selection of an item of the first result set; receiving a user input that selects a search option that corresponds to metadata associated with the selected item; obtaining, without receiving an additional keystroke sequence, metadata associated with the selected item after receiving the user selection of the item and the user input; searching the collection of items to generate a second result set of items based on the obtained metadata associated with the selected item, wherein the searching comprises identifying items that comprise the obtained metadata associated with the selected item; and generating for display the items of the second result set. 2. The method of claim 1 , wherein the search option is associated with an intended user keystroke sequence.
| 0.566641 |
22. An apparatus for determining a person's response to a retail element, based on the person's facial expression and shopping behavior, comprising: a) at least a first means for capturing images that captures first input images, b) at least a control and processing system that performs the following steps of: detecting and tracking a face from the first input images, estimating two-dimensional and three-dimensional pose of the face, localizing facial features, estimating gaze direction of the person using the two-dimensional and three-dimensional poses and the positions of the facial features and changes in affective state of the person by extracting emotion-sensitive features, c) at least a second means for capturing images that captures second input images, d) the control and processing system that performs the following steps of: detecting and tracking the person from the second input images producing a trajectory of the person, and estimating body orientation, identifying the shopping behaviors of the person toward the retail element, utilizing position and the body orientation of the person relative to the retail element, and determining intermediate responses and end response of the person to the retail element by analyzing the changes in affective states and interest, in the context of the shopping behavior, and e) at least a means for video interface that connects the first means for capturing images and the second means for capturing images to the control and processing system, wherein the shopping behaviors include showing interest, engagement, interaction, or purchasing.
|
22. An apparatus for determining a person's response to a retail element, based on the person's facial expression and shopping behavior, comprising: a) at least a first means for capturing images that captures first input images, b) at least a control and processing system that performs the following steps of: detecting and tracking a face from the first input images, estimating two-dimensional and three-dimensional pose of the face, localizing facial features, estimating gaze direction of the person using the two-dimensional and three-dimensional poses and the positions of the facial features and changes in affective state of the person by extracting emotion-sensitive features, c) at least a second means for capturing images that captures second input images, d) the control and processing system that performs the following steps of: detecting and tracking the person from the second input images producing a trajectory of the person, and estimating body orientation, identifying the shopping behaviors of the person toward the retail element, utilizing position and the body orientation of the person relative to the retail element, and determining intermediate responses and end response of the person to the retail element by analyzing the changes in affective states and interest, in the context of the shopping behavior, and e) at least a means for video interface that connects the first means for capturing images and the second means for capturing images to the control and processing system, wherein the shopping behaviors include showing interest, engagement, interaction, or purchasing. 24. The apparatus according to claim 22 , wherein the apparatus further comprises means for training a plurality of second machines for localizing facial features in the face.
| 0.555341 |
1. A system for displaying an electronic document, the system comprising: a display device for presenting a rendered electronic document; an electronic document including first embedded content and second embedded content within the first embedded content, wherein a file type of the electronic document differs from respective file types of the first and second embedded contents; a document handling application configured to invoke rendering engines to render documents on the display device; a plurality of rendering engines, each rendering engine having a common interface, wherein each of the rendering engines is configured to render content associated with at least one corresponding file type; and one or more processors configured to perform operations comprising: identifying, by the document handling application, a first file type of the first embedded content and a first rendering engine that is configured to render embedded content of the first file type; invoking, by the document handling application and in response to the identification, the first rendering engine through the first rendering engine's common interface to render the first embedded content; identifying, by the first rendering engine, the second embedded content within the first embedded content; identifying, by the first rendering engine and in response to identifying the second embedded content within the first embedded content, a second file type of the second embedded content within the first embedded content and a second rendering engine that is configured to render embedded content of the second type; invoking, by the first rendering engine and in response to identifying the second file type, the second rendering engine through the second rendering engine's common interface to render the second embedded content; receiving, by the first rendering engine, the rendered second embedded content from the second rendering engine; rendering, by the first rendering engine and in response to receiving the rendered second embedded content, the first embedded content; blending, by the first rendering engine, the rendered second embedded content with the rendered first embedded content; receiving, by the document handling application, the blended rendered first and second embedded content from the first rendering engine; rendering, by the document handling application and after receiving the blended rendered first and second embedded content, the electronic document; blending the blended rendered first and second embedded content with the rendered electronic document; and displaying, by the display device, the blended first and second embedded content and rendered electronic document where the first file type is different from the second file type and the first rendering engine is different from the second rendering engine.
|
1. A system for displaying an electronic document, the system comprising: a display device for presenting a rendered electronic document; an electronic document including first embedded content and second embedded content within the first embedded content, wherein a file type of the electronic document differs from respective file types of the first and second embedded contents; a document handling application configured to invoke rendering engines to render documents on the display device; a plurality of rendering engines, each rendering engine having a common interface, wherein each of the rendering engines is configured to render content associated with at least one corresponding file type; and one or more processors configured to perform operations comprising: identifying, by the document handling application, a first file type of the first embedded content and a first rendering engine that is configured to render embedded content of the first file type; invoking, by the document handling application and in response to the identification, the first rendering engine through the first rendering engine's common interface to render the first embedded content; identifying, by the first rendering engine, the second embedded content within the first embedded content; identifying, by the first rendering engine and in response to identifying the second embedded content within the first embedded content, a second file type of the second embedded content within the first embedded content and a second rendering engine that is configured to render embedded content of the second type; invoking, by the first rendering engine and in response to identifying the second file type, the second rendering engine through the second rendering engine's common interface to render the second embedded content; receiving, by the first rendering engine, the rendered second embedded content from the second rendering engine; rendering, by the first rendering engine and in response to receiving the rendered second embedded content, the first embedded content; blending, by the first rendering engine, the rendered second embedded content with the rendered first embedded content; receiving, by the document handling application, the blended rendered first and second embedded content from the first rendering engine; rendering, by the document handling application and after receiving the blended rendered first and second embedded content, the electronic document; blending the blended rendered first and second embedded content with the rendered electronic document; and displaying, by the display device, the blended first and second embedded content and rendered electronic document where the first file type is different from the second file type and the first rendering engine is different from the second rendering engine. 5. The system of claim 1 , wherein at least one of the plurality of rendering engines is a reentrant rendering engine.
| 0.51154 |
15. A non-transitory computer-readable storage device storing a computer program, the program comprising instructions that when executed by a computing device cause the computing device to perform operations comprising: downloading, to the computing device, code that, when executed by the computing device, causes the computing device to perform second operations comprising: receiving, by the computing device, a user input; identifying, by the computing device, a set of cached autocomplete suggestions for the user input; requesting, by the computing device, a set of additional autocomplete suggestions for the user input over a network; after identifying the set of cached autocomplete suggestions, delaying, by the computing device, presentation of the set of cached autocomplete suggestions until an end of a timeout period; determining, by the computing device, that the set of additional autocomplete suggestions has not been received by the end of the timeout period; and in response to determining that the set of additional autocomplete suggestions has not been received by the end of the timeout period, presenting, by the computing device, at least a portion of the set of cached autocomplete suggestions.
|
15. A non-transitory computer-readable storage device storing a computer program, the program comprising instructions that when executed by a computing device cause the computing device to perform operations comprising: downloading, to the computing device, code that, when executed by the computing device, causes the computing device to perform second operations comprising: receiving, by the computing device, a user input; identifying, by the computing device, a set of cached autocomplete suggestions for the user input; requesting, by the computing device, a set of additional autocomplete suggestions for the user input over a network; after identifying the set of cached autocomplete suggestions, delaying, by the computing device, presentation of the set of cached autocomplete suggestions until an end of a timeout period; determining, by the computing device, that the set of additional autocomplete suggestions has not been received by the end of the timeout period; and in response to determining that the set of additional autocomplete suggestions has not been received by the end of the timeout period, presenting, by the computing device, at least a portion of the set of cached autocomplete suggestions. 17. The non-transitory computer-readable storage device of claim 15 , wherein the second operations further comprise: receiving the additional autocomplete suggestions; determining that the received additional autocomplete suggestions should be presented based on a number of additional autocomplete suggestions received or based on a quality score associated with one or more of the received autocomplete suggestions; and presenting the additional autocomplete suggestions in response to determining that the additional autocomplete suggestions should be presented.
| 0.72029 |
8. A system, comprising: a processor; and a memory containing a program which when executed by the processor performs an operation comprising: assigning each of a plurality of nodes of a graph to a distinct image, of a plurality of images including a first image and a second image, wherein the graph represents a story, wherein each node corresponds to a respective element of the story, wherein each node comprises: (i) an attribute and (ii) a predefined text of the respective element of the story, wherein a first edge of a plurality of edges of the graph specifies a constraint between the attributes of a first node and a second node of the plurality of nodes, wherein the plurality of nodes are assigned based on an attribute of each of the plurality of images and the attribute of each node, wherein the first and second nodes are assigned to the first and second images, respectively, based on the attributes of the first and second images satisfying the constraint specified by the first edge; and generating a visual depiction of the story, wherein the visual depiction comprises an ordered representation of each of the distinct images and the predefined text of each respective element of the story.
|
8. A system, comprising: a processor; and a memory containing a program which when executed by the processor performs an operation comprising: assigning each of a plurality of nodes of a graph to a distinct image, of a plurality of images including a first image and a second image, wherein the graph represents a story, wherein each node corresponds to a respective element of the story, wherein each node comprises: (i) an attribute and (ii) a predefined text of the respective element of the story, wherein a first edge of a plurality of edges of the graph specifies a constraint between the attributes of a first node and a second node of the plurality of nodes, wherein the plurality of nodes are assigned based on an attribute of each of the plurality of images and the attribute of each node, wherein the first and second nodes are assigned to the first and second images, respectively, based on the attributes of the first and second images satisfying the constraint specified by the first edge; and generating a visual depiction of the story, wherein the visual depiction comprises an ordered representation of each of the distinct images and the predefined text of each respective element of the story. 14. The system of claim 8 , wherein the graph comprises a multi-graph, wherein the attribute of each image is determined based on at least one of: (i) global positioning system (GPS) coordinates of each image, (ii) a timestamp of each image, (iii) facial recognition algorithms, and (iv) user defined values, the method further comprising outputting the generated visual depiction of the story.
| 0.758779 |
10. The method of claim 9 wherein the object option includes at least one of, an operation and attribute.
|
10. The method of claim 9 wherein the object option includes at least one of, an operation and attribute. 16. The method of claim 10 wherein the operation is an action to be taken on the object.
| 0.960719 |
10. The method of claim 8 , wherein causing the page of current query results to be presented based at least in part on the quantity of compliant current query results includes comparing the quantity of compliant current query results to the desired quantity of query results to display per page.
|
10. The method of claim 8 , wherein causing the page of current query results to be presented based at least in part on the quantity of compliant current query results includes comparing the quantity of compliant current query results to the desired quantity of query results to display per page. 11. The method of claim 10 , wherein in the event that the quantity of compliant current query results is equal to the desired quantity of query results to display per page, wherein causing the page of current query results to be presented includes sending data associated with the page of current query results including compliant current query results associated with the quantity of compliant current query results to a client device.
| 0.888322 |
1. A computer-implemented method for producing at least one Security Descriptor Definition Language, SDDL, rule from an eXtensible Access Control Markup Language, XACML, policy (P), said method comprising: providing, on a non-transitory computer readable media, a XACML policy (P) that, when implemented by a processor, is configured to control access to one or more resources in a computer network; feeding the XACML policy (P) to a transformation engine, the transformation engine including software that, when executed by a processor, creates the at least one SDDL rule; producing a reverse query indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests; translating, by the transformation engine based on the reverse query, the XACML policy (P) and the given decision (d) into a satisfiable logic proposition in Boolean variables (v i , i=1, 2, . . . ); deriving, by the transformation engine, variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition; creating, by the transformation engine, the at least one SDDL rule based on said variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition, wherein the at least one SDDL rule, when implemented by a processor, is configured to control access to the one or more resources in a computer network; loading the at least one SDDL rule onto a non-transitory computer readable media of an SDDL system; and controlling access to the one or more resources in the computer network using the at least one SDDL rule.
|
1. A computer-implemented method for producing at least one Security Descriptor Definition Language, SDDL, rule from an eXtensible Access Control Markup Language, XACML, policy (P), said method comprising: providing, on a non-transitory computer readable media, a XACML policy (P) that, when implemented by a processor, is configured to control access to one or more resources in a computer network; feeding the XACML policy (P) to a transformation engine, the transformation engine including software that, when executed by a processor, creates the at least one SDDL rule; producing a reverse query indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests; translating, by the transformation engine based on the reverse query, the XACML policy (P) and the given decision (d) into a satisfiable logic proposition in Boolean variables (v i , i=1, 2, . . . ); deriving, by the transformation engine, variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition; creating, by the transformation engine, the at least one SDDL rule based on said variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition, wherein the at least one SDDL rule, when implemented by a processor, is configured to control access to the one or more resources in a computer network; loading the at least one SDDL rule onto a non-transitory computer readable media of an SDDL system; and controlling access to the one or more resources in the computer network using the at least one SDDL rule. 9. The method of claim 1 , wherein the given decision (d) is deny access.
| 0.948824 |
19. A method of designing an essentially digital system, the method comprising: generating a description of the functionality and timing of the digital system, the description comprising a plurality of tasks; determining trade-off task optimal schedules; obtaining an optimized description, including trade-off task optimization information, and a subset of the optimized description defining the trade-off task optimization information; and designing the essentially digital system based on the optimized description, wherein the method is executed on a processor-based system.
|
19. A method of designing an essentially digital system, the method comprising: generating a description of the functionality and timing of the digital system, the description comprising a plurality of tasks; determining trade-off task optimal schedules; obtaining an optimized description, including trade-off task optimization information, and a subset of the optimized description defining the trade-off task optimization information; and designing the essentially digital system based on the optimized description, wherein the method is executed on a processor-based system. 21. The method of claim 19 , wherein the description comprises a system-level description wherein non-deterministic behavior of the digital system is modeled by interacting the tasks, while each of the tasks describe part of the deterministic behavior of the digital system.
| 0.63001 |
1. A method for evaluating a conjunctive query, the method executed as a computer program by a general purpose computer, the conjunctive query comprising an at least one first predicate having variables; wherein the at least one first predicate is a relational predicate that is evaluated with a first engine using a relational database, and an at least one second predicate having variables, wherein the at least one second predicate is an external predicate that is evaluated using a second engine without using a relational database; the method comprising the steps of: defining the relational predicates as treated and defining the external predicates as non-treated; defining a variable (X) as distinguished if it appears as an argument in a treated predicate and it is a variable of an expression of a non-treated predicate; selecting a distinguished variable (X) from the conjunctive query, in absence of a distinguished variable by definition, choosing one of the variables in a non-treated predicate to serve as distinguished; forming a binding column (Bx) that contains a superset of values that are possible values of the selected distinguished variable (X) that fit limitations imposed by being an argument of the treated predicates; wherein said binding column (Bx) includes all possible values if it was chosen to serve as distinguished; evaluating the non-treated predicates having the selected distinguished variable (X) as a variable using the possible values from the binding column (Bx); updating the binding column (Bx) to be limited to the possible values fitting the evaluated non-treated predicates; marking the evaluated non-treated predicates as treated; repeating the steps for additionally chosen or selected distinguished variables, until resolving the query.
|
1. A method for evaluating a conjunctive query, the method executed as a computer program by a general purpose computer, the conjunctive query comprising an at least one first predicate having variables; wherein the at least one first predicate is a relational predicate that is evaluated with a first engine using a relational database, and an at least one second predicate having variables, wherein the at least one second predicate is an external predicate that is evaluated using a second engine without using a relational database; the method comprising the steps of: defining the relational predicates as treated and defining the external predicates as non-treated; defining a variable (X) as distinguished if it appears as an argument in a treated predicate and it is a variable of an expression of a non-treated predicate; selecting a distinguished variable (X) from the conjunctive query, in absence of a distinguished variable by definition, choosing one of the variables in a non-treated predicate to serve as distinguished; forming a binding column (Bx) that contains a superset of values that are possible values of the selected distinguished variable (X) that fit limitations imposed by being an argument of the treated predicates; wherein said binding column (Bx) includes all possible values if it was chosen to serve as distinguished; evaluating the non-treated predicates having the selected distinguished variable (X) as a variable using the possible values from the binding column (Bx); updating the binding column (Bx) to be limited to the possible values fitting the evaluated non-treated predicates; marking the evaluated non-treated predicates as treated; repeating the steps for additionally chosen or selected distinguished variables, until resolving the query. 18. The method of claim 1 , wherein choosing a variable to serve as distinguished is based on predicate data distribution.
| 0.642689 |
11. The method of claim 1 , further comprising tracking user submissions.
|
11. The method of claim 1 , further comprising tracking user submissions. 12. The method of claim 11 , wherein the user is evaluated based on the tracked user submissions.
| 0.961356 |
15. A device comprising: at least one processor; data storage; and program instructions in the data storage that, upon execution by the at least one processor, cause the device to: receive information indicative of a frequency of submission of a search query to a search engine in a given period of time, wherein the search query comprises a sequence of words; based on the information indicative of the frequency of submission of the search query to the search engine in the given period of time, determine, for the sequence of words of the search query, groupings of one or more words of the search query based on an order in which the one or more words occur in the sequence of words of the search query; and provide information indicating the groupings to a speech recognition system to update a corpus of given sequences of words, wherein the speech recognition system is configured to convert a given spoken utterance into a given sequence of words based on the corpus of given sequences of words.
|
15. A device comprising: at least one processor; data storage; and program instructions in the data storage that, upon execution by the at least one processor, cause the device to: receive information indicative of a frequency of submission of a search query to a search engine in a given period of time, wherein the search query comprises a sequence of words; based on the information indicative of the frequency of submission of the search query to the search engine in the given period of time, determine, for the sequence of words of the search query, groupings of one or more words of the search query based on an order in which the one or more words occur in the sequence of words of the search query; and provide information indicating the groupings to a speech recognition system to update a corpus of given sequences of words, wherein the speech recognition system is configured to convert a given spoken utterance into a given sequence of words based on the corpus of given sequences of words. 19. The device of claim 15 , wherein, to determine the groupings, the program instructions in the data storage, upon execution by the at least one processor, cause the device to generate a factor graph that includes automaton states and automaton arcs, each of the automaton arcs corresponding to a word from the sequence of words of the search query.
| 0.584109 |
12. The non-transitory computer readable storage medium of claim 10 , further including: generating a layered set of sorted anchor map data structures, wherein each sorted map in the layered set of anchor maps stores a respective production time.
|
12. The non-transitory computer readable storage medium of claim 10 , further including: generating a layered set of sorted anchor map data structures, wherein each sorted map in the layered set of anchor maps stores a respective production time. 13. The non-transitory computer readable storage medium of claim 12 , further including: generating a merged anchor map including a plurality of merged anchor map records, each merged anchor record corresponding to at least one anchor record from the layered set of sorted anchor map data structures, wherein the merged anchor records are ordered in the merged anchor map based on respective target document identifiers.
| 0.904323 |
10. The system of claim 9 , wherein the presence resource is configured for detecting a presence of each of the sending party and the destination party for transfer of instant messages in response to a corresponding registration with the presence resource, the presence resource configured for determining the language preference for the destination party in response to detecting the corresponding presence.
|
10. The system of claim 9 , wherein the presence resource is configured for detecting a presence of each of the sending party and the destination party for transfer of instant messages in response to a corresponding registration with the presence resource, the presence resource configured for determining the language preference for the destination party in response to detecting the corresponding presence. 11. The system of claim 10 , wherein the presence resource is configured for detecting that the instant message is expressed in the first language based on determining the corresponding language preference for the sending party specifies the first language.
| 0.900997 |
1. A computerized method for retrieving data from a database stored in a data storage device of a data processing system having a central processing unit (CPU), memory, an operating system and a database management system (DBMS), using an application program written in an interpretive programming language, comprising the steps . of: (a) initializing by means of the CPU implementing a set of commands, a data processing environment for processing the application program; (b) executing the application program using a Rexx program interpreter stored in the data processing system memory; and (c) processing mapping call instructions for mapping constructs of the DBMS to constructs of the programming language, operating system call instructions, and DBMS call instructions for extracting data from the database, contained in the application program.
|
1. A computerized method for retrieving data from a database stored in a data storage device of a data processing system having a central processing unit (CPU), memory, an operating system and a database management system (DBMS), using an application program written in an interpretive programming language, comprising the steps . of: (a) initializing by means of the CPU implementing a set of commands, a data processing environment for processing the application program; (b) executing the application program using a Rexx program interpreter stored in the data processing system memory; and (c) processing mapping call instructions for mapping constructs of the DBMS to constructs of the programming language, operating system call instructions, and DBMS call instructions for extracting data from the database, contained in the application program. 2. The method of claim 1 wherein initializing the data processing environment further comprises designating areas of the data processing system memory for work area storage during the processing of the application program; and initializing data processing system variables for use during the processing of the application program.
| 0.674853 |
1. A computer-implemented method of providing a pass phrase at a client workstation, the computer-implemented method causing the client workstation to: display, at the client workstation, a plurality of fields for entering a plurality of pass phrase answers without displaying a plurality of pass phrase questions, receive, at the client workstation, the plurality of pass phrase answers; and combine, at the client workstation, the plurality of pass phrase answers into a single pass phrase, wherein the plurality of pass phrase answers are concatenated together with a fixed random value and a cryptographic hash function is applied to the concatenation to generate the single pass phrase.
|
1. A computer-implemented method of providing a pass phrase at a client workstation, the computer-implemented method causing the client workstation to: display, at the client workstation, a plurality of fields for entering a plurality of pass phrase answers without displaying a plurality of pass phrase questions, receive, at the client workstation, the plurality of pass phrase answers; and combine, at the client workstation, the plurality of pass phrase answers into a single pass phrase, wherein the plurality of pass phrase answers are concatenated together with a fixed random value and a cryptographic hash function is applied to the concatenation to generate the single pass phrase. 6. The computer-implemented method of claim 1 , the computer-implemented method further causing the client workstation to: retrieve and display, if the input for displaying pass phrase questions is received, at least one field for entering a retrieval answer.
| 0.682266 |
8. A system comprising: a memory device for storing instructions executable by a processor; a processor for executing instructions stored in the memory, at least a portion of those instructions representing an item listing presentation management module, which, when executed by the processor, is to process a query to i) identify a set of item listings, each item listing associated with an item or service being offered for sale and assigned to a leaf-level category, ii) obtain for the query a click probability score for each leaf-level category to which an item listing satisfying the query has been assigned, the click probability score for a particular leaf-level category derived by dividing a number of clicks for the particular leaf-level category by the total number of clicks for all leaf-level categories to which an item listing satisfying the query has been assigned, iii) identify up to a predetermined number of leaf-level categories with click probability scores exceeding a threshold score, iv) for each of the identified leaf-level categories, calculate a category boost score for use in determining the order in which the item listings are to be presented in a search results page, and iv) cause a search results page to be presented with the item listings ordered based in part on the category boost score for the leaf-level category to which each item listing is assigned.
|
8. A system comprising: a memory device for storing instructions executable by a processor; a processor for executing instructions stored in the memory, at least a portion of those instructions representing an item listing presentation management module, which, when executed by the processor, is to process a query to i) identify a set of item listings, each item listing associated with an item or service being offered for sale and assigned to a leaf-level category, ii) obtain for the query a click probability score for each leaf-level category to which an item listing satisfying the query has been assigned, the click probability score for a particular leaf-level category derived by dividing a number of clicks for the particular leaf-level category by the total number of clicks for all leaf-level categories to which an item listing satisfying the query has been assigned, iii) identify up to a predetermined number of leaf-level categories with click probability scores exceeding a threshold score, iv) for each of the identified leaf-level categories, calculate a category boost score for use in determining the order in which the item listings are to be presented in a search results page, and iv) cause a search results page to be presented with the item listings ordered based in part on the category boost score for the leaf-level category to which each item listing is assigned. 9. The system of claim 8 , wherein the item listing presentation management module is to derive the threshold score as a percentage of the click probability score of the leaf level category with the highest click probability score.
| 0.70977 |
13. The computer-usable memory of claim 8 further comprising computer-readable code for: refining the simplified command data model by allowing renaming of selected elements of the command data model based on user-specified instructions to create a refined command data model.
|
13. The computer-usable memory of claim 8 further comprising computer-readable code for: refining the simplified command data model by allowing renaming of selected elements of the command data model based on user-specified instructions to create a refined command data model. 14. The computer-usable memory of claim 13 further comprising computer-readable code for exporting the refined command data model as an XML (Extensible Markup Language) file.
| 0.920015 |
1. A computer-implemented method comprising: causing display of a graph using an application of a computer, the graph comprising at least two axes and a plurality of graphical elements representing data relative to the at least two axes; receiving user input highlight rules for the graph, the rules including a user input value and an indication that graphical elements of the plurality of graphical elements should be highlighted based on whether a value of a portion of the graphical elements is greater than the user input value or an indication that graphical elements of the plurality of graphical elements should be highlighted based on whether a value of a portion of the graphical elements is less than the user input value; analyzing, using at least one processor of the computer, a value of each graphical element of the plurality of graphical elements, to determine whether a portion of the graphical element is greater than the user input value or whether a portion of the graphical element is less than the user input value, based on the user input highlight rules; identifying, using at least one processor of the computer, a portion of at least one graphical element of the plurality of graphical elements that satisfies the user input highlight rules based on the portion of the at least one graphical element of the plurality of graphical elements that is greater than the user input value or the portion of the at least one graphical element of the plurality of graphical elements that is less than the user input value; modifying the display of the graph to highlight the portion of the at least one graphical element of the plurality of graphical elements to indicate the portion of the at least one graphical element of the plurality of graphical elements that is greater than the user input value or the portion of the at least one graphical element of the plurality of graphical elements that is less than the user input value based on the user input highlight rules; and wherein the modified display of the graph is displayed to the user.
|
1. A computer-implemented method comprising: causing display of a graph using an application of a computer, the graph comprising at least two axes and a plurality of graphical elements representing data relative to the at least two axes; receiving user input highlight rules for the graph, the rules including a user input value and an indication that graphical elements of the plurality of graphical elements should be highlighted based on whether a value of a portion of the graphical elements is greater than the user input value or an indication that graphical elements of the plurality of graphical elements should be highlighted based on whether a value of a portion of the graphical elements is less than the user input value; analyzing, using at least one processor of the computer, a value of each graphical element of the plurality of graphical elements, to determine whether a portion of the graphical element is greater than the user input value or whether a portion of the graphical element is less than the user input value, based on the user input highlight rules; identifying, using at least one processor of the computer, a portion of at least one graphical element of the plurality of graphical elements that satisfies the user input highlight rules based on the portion of the at least one graphical element of the plurality of graphical elements that is greater than the user input value or the portion of the at least one graphical element of the plurality of graphical elements that is less than the user input value; modifying the display of the graph to highlight the portion of the at least one graphical element of the plurality of graphical elements to indicate the portion of the at least one graphical element of the plurality of graphical elements that is greater than the user input value or the portion of the at least one graphical element of the plurality of graphical elements that is less than the user input value based on the user input highlight rules; and wherein the modified display of the graph is displayed to the user. 4. The computer-implemented method of claim 1 , further comprising modifying a visual format of the portion of each graphical element displayed that satisfy the user input highlight rules relative to a format of other graphical elements that do not satisfy the user input highlight rules.
| 0.547391 |
21. A method for servicing photon map queries, comprising: accepting photon queries from one or more code modules or shaders, each of the photon queries defining a spatially located volume and criteria for photons that are responsive to that photon query, at least some of the photon queries defining a locus and a number of photons (k) closest to the locus as the criteria, wherein k>=1; associating each of the accepted queries with a collection of photon queries that is associated with a node of an acceleration structure, the acceleration structure including nodes that respectively define surfaces that each spatially bound a respective selection of photons 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; traversing the acceleration structure with collections of photon queries from the accepted photon queries, wherein the traversal is performed, collection-by-collection, by testing, in an acceleration structure resource comprising one or more processors, each of a plurality of child nodes of the node 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; and returning, for each of the photon queries, identifiers for photons satisfying the criteria specified for that photon query.
|
21. A method for servicing photon map queries, comprising: accepting photon queries from one or more code modules or shaders, each of the photon queries defining a spatially located volume and criteria for photons that are responsive to that photon query, at least some of the photon queries defining a locus and a number of photons (k) closest to the locus as the criteria, wherein k>=1; associating each of the accepted queries with a collection of photon queries that is associated with a node of an acceleration structure, the acceleration structure including nodes that respectively define surfaces that each spatially bound a respective selection of photons 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; traversing the acceleration structure with collections of photon queries from the accepted photon queries, wherein the traversal is performed, collection-by-collection, by testing, in an acceleration structure resource comprising one or more processors, each of a plurality of child nodes of the node 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; and returning, for each of the photon queries, identifiers for photons satisfying the criteria specified for that photon query. 22. The method of claim 21 for servicing photon map queries, wherein the respective spatially located volume for at least some of the photon queries comprises a cone and the method further comprises returning identifiers for photons within the cone, associated with an identifier of the photon query to which that identified photon is responsive.
| 0.616934 |
12. A method for inputting text to be displayed on a display screen of a device where the display screen is capable of displaying m-words of data, comprising the steps: providing a pre-defined x-gram dictionary containing a plurality of entries, each said entry including an index, a candidate word and a frequency; selecting, from the dictionary, a list of n-number of candidate words whose index matches a precursor, where n>1; causing m-number of candidate words from said list of candidate words to be displayed on said display screen, where m>1; and prompting the user to select one of the displayed candidate words or enter a word; receiving text input and causing the selected or entered word to be displayed on the display screen; upon initial activation of the device and before text is input into a text field of the device, initializing the precursor to a predefined word, wherein the predefined word is selected from the x-gram dictionary from among the plurality of entries as the word associated with the highest order of frequency count, and after the user selects or enters a word, said processor setting the precursor to equal the word selected or entered by the user; and selecting, from the dictionary, a list of n-number of candidate words whose index matches the precursor; whereby the precursor provides a context for predicting a next word to be entered into the entry device.
|
12. A method for inputting text to be displayed on a display screen of a device where the display screen is capable of displaying m-words of data, comprising the steps: providing a pre-defined x-gram dictionary containing a plurality of entries, each said entry including an index, a candidate word and a frequency; selecting, from the dictionary, a list of n-number of candidate words whose index matches a precursor, where n>1; causing m-number of candidate words from said list of candidate words to be displayed on said display screen, where m>1; and prompting the user to select one of the displayed candidate words or enter a word; receiving text input and causing the selected or entered word to be displayed on the display screen; upon initial activation of the device and before text is input into a text field of the device, initializing the precursor to a predefined word, wherein the predefined word is selected from the x-gram dictionary from among the plurality of entries as the word associated with the highest order of frequency count, and after the user selects or enters a word, said processor setting the precursor to equal the word selected or entered by the user; and selecting, from the dictionary, a list of n-number of candidate words whose index matches the precursor; whereby the precursor provides a context for predicting a next word to be entered into the entry device. 16. The method according to claim 12 , wherein if no match between at least one said index stored in said dictionary and said precursor is found, then a new entry in said dictionary in which said precursor is the index and the candidate word is the entered word is created.
| 0.67586 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.