sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. A method of creating an item configurator or bundle configurator, for at least one item, intended to run under the control of at least one processor in at least one computerized device possessing a GUI, said method comprising: creating a plurality of graphic layer files and graphic layer thumbnail files comprising various layers of said at least one item; wherein at least some of said plurality of graphic layer files contain some transparent pixels; wherein at least some of the graphic layer files have the same width and height dimensions in terms of pixels, so that these graphic layer files may be superimposed on each other to produce a composite image without the need to specify the relative location of any particular graphic layer file relative to another particular graphic layer file; creating at least one main table structure file describing the relationships between said plurality of graphic layer files; said main table structure file comprising a plurality of heading sections; each heading section comprising a heading and at least one assembly definitions; each at least one assembly definition comprising and being associated with at least one graphic layer file, at least one thumbnail graphic layer file (icon), at least one assembly title descriptor, and an optional link to an associated file or data structure that defines the attributes of said at least one assembly definition; obtaining an interactive generic configurator program (IGCP); said IGCP capable of reading and parsing said at least one main table structure file, and implementing a program loop wherein for each heading section in said at least one main table structure file, said IGCP will: 1: read said heading and display said heading onto said GUI; 2: read the first assembly definition or the default assembly of each heading and display the graphic layer file associated with said assembly definition into a GUI configurable object display window; 3: read said at least one assembly definition wherein; A: if said assembly definition contains a link to an associated data structure, then said IGCP will apply the attributes associated with this associated data structure to the at least one graphic layer file associated with said assembly, and display said attributes in a GUI attribute display window as additional attributes that may be applied should the user click on one of these attributes in the GUI attribute display window; B: For each assembly definition, said IGCP will display said thumbnail graphic layer file as an icon associated with said display of said heading onto said GUI, and display said at least one assembly title descriptor associated with said display of said heading onto said GUI; wherein if a user of said configurator selects an icon on said GUI, said IGCP will replace the associated graphic layer files in the at least one item configuration window with new graphic layer files associated with said selected icon, and apply the defined attributes specified by the linked associated data structure associated with said icon onto the assembly, and 4: when said user indicates on said GUI interface that said user is finished, said IGCP will save a record of the assemblies and attributes selected by said user wherein the main table structure file is produced by an automated scripting program that produces said main table structure file in response to a designer's selection of configurator options and modes of operation on a graphical user interface, wherein said IGCP comprises a plugin or add on for another software program. | 1. A method of creating an item configurator or bundle configurator, for at least one item, intended to run under the control of at least one processor in at least one computerized device possessing a GUI, said method comprising: creating a plurality of graphic layer files and graphic layer thumbnail files comprising various layers of said at least one item; wherein at least some of said plurality of graphic layer files contain some transparent pixels; wherein at least some of the graphic layer files have the same width and height dimensions in terms of pixels, so that these graphic layer files may be superimposed on each other to produce a composite image without the need to specify the relative location of any particular graphic layer file relative to another particular graphic layer file; creating at least one main table structure file describing the relationships between said plurality of graphic layer files; said main table structure file comprising a plurality of heading sections; each heading section comprising a heading and at least one assembly definitions; each at least one assembly definition comprising and being associated with at least one graphic layer file, at least one thumbnail graphic layer file (icon), at least one assembly title descriptor, and an optional link to an associated file or data structure that defines the attributes of said at least one assembly definition; obtaining an interactive generic configurator program (IGCP); said IGCP capable of reading and parsing said at least one main table structure file, and implementing a program loop wherein for each heading section in said at least one main table structure file, said IGCP will: 1: read said heading and display said heading onto said GUI; 2: read the first assembly definition or the default assembly of each heading and display the graphic layer file associated with said assembly definition into a GUI configurable object display window; 3: read said at least one assembly definition wherein; A: if said assembly definition contains a link to an associated data structure, then said IGCP will apply the attributes associated with this associated data structure to the at least one graphic layer file associated with said assembly, and display said attributes in a GUI attribute display window as additional attributes that may be applied should the user click on one of these attributes in the GUI attribute display window; B: For each assembly definition, said IGCP will display said thumbnail graphic layer file as an icon associated with said display of said heading onto said GUI, and display said at least one assembly title descriptor associated with said display of said heading onto said GUI; wherein if a user of said configurator selects an icon on said GUI, said IGCP will replace the associated graphic layer files in the at least one item configuration window with new graphic layer files associated with said selected icon, and apply the defined attributes specified by the linked associated data structure associated with said icon onto the assembly, and 4: when said user indicates on said GUI interface that said user is finished, said IGCP will save a record of the assemblies and attributes selected by said user wherein the main table structure file is produced by an automated scripting program that produces said main table structure file in response to a designer's selection of configurator options and modes of operation on a graphical user interface, wherein said IGCP comprises a plugin or add on for another software program. 5. The method of claim 1 used on an Internet based server-web browser ecommerce system; wherein said IGCP runs in a user's web browser; at least some of said plurality of graphic layer files are stored in a web server; and said record of the icons selected by said user is stored on said web server. | 0.517451 |
8. A system comprising: a graph builder configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; a finite state machine generator configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; a logic expresser configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; a combiner configured to combine the temporal representation and the finite state machine into a model; a statement generator configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and a model checker configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the graph builder, the finite state machine generator, the logic expresser, the statement generator, and the model checker are in operative associated with at least one processor, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement. | 8. A system comprising: a graph builder configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; a finite state machine generator configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; a logic expresser configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; a combiner configured to combine the temporal representation and the finite state machine into a model; a statement generator configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and a model checker configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the graph builder, the finite state machine generator, the logic expresser, the statement generator, and the model checker are in operative associated with at least one processor, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement. 10. The system according to claim 8 , wherein the user-selected verification-related property is expressible as a property represented by the event processing network and comprises at least one of: a reachability of at least one of the event processing agents; an equivalence of two or more of the event processing agents; a mutual exclusivity of two or more of the event processing agents; and a coverage of at least some of the event processing agents. | 0.616122 |
12. The system of claim 6 , wherein the puzzle layout is formed from a pattern comprised of the first areas and the second areas. | 12. The system of claim 6 , wherein the puzzle layout is formed from a pattern comprised of the first areas and the second areas. 14. The system of claim 12 , wherein the pattern is asymmetrical. | 0.992782 |
12. A system comprising: a plurality of processors; a query generation request receiving module implemented by at least one of said plurality of processors that receives requests over a network from users for generation of URL based context queries, wherein each request comprises at least one query generation criteria; a data cluster identification module implemented by at least one of said plurality of processors that, for each request received by the query generation request receiving module, searches, via the network, for clusters of related data objects within a multidimensional dataspace having at least one spatial axis, at least one temporal axis, at least one topical axis and at least one social axis using the at least one query generation criteria, wherein at least one cluster of data objects relating to the at least one query generation criteria is identified; a permission checking module implemented by at least one of said plurality of processors that, for each request processed by the data cluster identification module, checks permissions, via the network, relating to each data object in the at least one cluster of related data objects to determine if the user is permitted to access the data object, wherein if the user does not have permission to view the data object, the data object is removed from the cluster; a cluster based query generation module implemented by at least one of said plurality of processors that, for each cluster processed by the permission checking module, generates a URL having a context query comprising at least one context criteria, wherein the at least one context criteria is derived from the properties of the at least one cluster of data objects; and a context query transmission module implemented by at least one of said plurality of processors that, for each URL having a context query generated by the cluster based query generation module, transmits the URL having a context query to the user. | 12. A system comprising: a plurality of processors; a query generation request receiving module implemented by at least one of said plurality of processors that receives requests over a network from users for generation of URL based context queries, wherein each request comprises at least one query generation criteria; a data cluster identification module implemented by at least one of said plurality of processors that, for each request received by the query generation request receiving module, searches, via the network, for clusters of related data objects within a multidimensional dataspace having at least one spatial axis, at least one temporal axis, at least one topical axis and at least one social axis using the at least one query generation criteria, wherein at least one cluster of data objects relating to the at least one query generation criteria is identified; a permission checking module implemented by at least one of said plurality of processors that, for each request processed by the data cluster identification module, checks permissions, via the network, relating to each data object in the at least one cluster of related data objects to determine if the user is permitted to access the data object, wherein if the user does not have permission to view the data object, the data object is removed from the cluster; a cluster based query generation module implemented by at least one of said plurality of processors that, for each cluster processed by the permission checking module, generates a URL having a context query comprising at least one context criteria, wherein the at least one context criteria is derived from the properties of the at least one cluster of data objects; and a context query transmission module implemented by at least one of said plurality of processors that, for each URL having a context query generated by the cluster based query generation module, transmits the URL having a context query to the user. 13. The system of claim 12 wherein at least some of the requests received by the query generation request receiving module comprise at least one data axis limitation, wherein the data cluster identification module only searches for data clusters along the data axes specified in the at least one data axis limitation. | 0.586856 |
20. The method of claim 1 wherein the printing resources include printing device resources, finishing resources, consumable materials resources, or operator resources. | 20. The method of claim 1 wherein the printing resources include printing device resources, finishing resources, consumable materials resources, or operator resources. 21. The method of claim 20 wherein the set of resource descriptions for a particular printer device resource includes color printing capabilities, print quality capabilities, media capabilities, throughput capabilities, operational cost or setup time/complexity. | 0.8661 |
1. A method of providing access control (AC) in respect of a relational database storing information in tables and columns and being accessible from a user interface, which is configured to accept a database query from a user and return information extracted from the database, the method being implemented at least in part at a policy enforcement point (PEP), which is located between the database and the user interface, and comprising: i) intercepting, at the PEP, a database query; ii) assigning attribute values by performing at least one of the following substeps: ii-a) assigning a resource attribute value based on at least one target table or target column in the query; ii-b) assigning an action attribute value based on a construct type in the query; and ii-c) assigning a subject and/or environment attribute value based on an identity of the user or on environment data; iii) partially evaluating an attributed-based AC policy defined in terms of said attributes, by constructing a partial policy decision request containing the attribute values assigned in step ii) and evaluating the AC policy for this, whereby a simplified attribute-based AC policy is obtained; iv) deriving an access condition, for which the simplified AC policy evaluates to permit access; and v) amending the database query by imposing said access condition; and vi) transmitting the amended query to the database. | 1. A method of providing access control (AC) in respect of a relational database storing information in tables and columns and being accessible from a user interface, which is configured to accept a database query from a user and return information extracted from the database, the method being implemented at least in part at a policy enforcement point (PEP), which is located between the database and the user interface, and comprising: i) intercepting, at the PEP, a database query; ii) assigning attribute values by performing at least one of the following substeps: ii-a) assigning a resource attribute value based on at least one target table or target column in the query; ii-b) assigning an action attribute value based on a construct type in the query; and ii-c) assigning a subject and/or environment attribute value based on an identity of the user or on environment data; iii) partially evaluating an attributed-based AC policy defined in terms of said attributes, by constructing a partial policy decision request containing the attribute values assigned in step ii) and evaluating the AC policy for this, whereby a simplified attribute-based AC policy is obtained; iv) deriving an access condition, for which the simplified AC policy evaluates to permit access; and v) amending the database query by imposing said access condition; and vi) transmitting the amended query to the database. 10. The method of claim 1 , further comprising defining a column-to-attribute mapping, wherein: step iv) includes extracting an access condition containing a reference to a non-evaluated attribute; and step v) includes converting, using the column-to-attribute mapping, the reference to a non-evaluated attribute into a reference to at least one column in the relational database and imposing the access condition after this conversion, for thereby causing the relational database to substitute information retrieved from said at least one column for the non-evaluated attribute during processing of the amended query. | 0.540513 |
3. The method of claim 1 , further comprising determining if the content is configured to support multi-mode input. | 3. The method of claim 1 , further comprising determining if the content is configured to support multi-mode input. 5. The method of claim 3 , wherein identifying the at least one input indicator comprises identifying at least one input field in the content, analyzing the at least one input field to identify a type of input, and determining that a non-textual input device is available for entering the input. | 0.890936 |
15. The non-transitory computer readable medium of claim 9 , wherein said first and said second markup language are a markup language selected from the group consisting of hypertext markup language (HTML), extensible markup language (XML), standard generalized markup language (SGML), wireless markup language (WML), handheld device markup language (HDML), and VoiceXML. | 15. The non-transitory computer readable medium of claim 9 , wherein said first and said second markup language are a markup language selected from the group consisting of hypertext markup language (HTML), extensible markup language (XML), standard generalized markup language (SGML), wireless markup language (WML), handheld device markup language (HDML), and VoiceXML. 16. The non-transitory computer readable medium of claim 15 , wherein said first markup language in at least one of a hypertext markup language (HTML) and extensible markup language (XML). | 0.932128 |
11. The non-transitory computer readable medium of claim 10 , wherein the information includes at least one of an explanation or a hyper-explanation of the at least one first classification of the collection, and wherein the at least one first classification is one of a plurality of classifications. | 11. The non-transitory computer readable medium of claim 10 , wherein the information includes at least one of an explanation or a hyper-explanation of the at least one first classification of the collection, and wherein the at least one first classification is one of a plurality of classifications. 16. The non-transitory computer readable medium of claim 11 , wherein the at least one of the explanation or the hyper-explanation includes evidence exclusively indicating a positive classification. | 0.869471 |
1. A computer implemented method of assessing human sentiment from a group of documents, each document in the group of documents having a plurality of terms and being digitally represented in a computer, the method comprising: receiving, by the computer, a group of documents, each document in the group of documents comprising a context of a plurality of terms and all documents in the group of documents representative of a particular topic; constructing, by the computer, a document sentiment vector space from the group of documents, wherein construction of the document sentiment vector space comprises: assessing sentimentality of each document in the group of documents toward the topic, by the computer, wherein sentimentality represents human emotion toward the topic, comprising: deriving a publication date for each document in the group of documents; electing an extrinsic metric for the particular topic for assessing the sentimentality toward the topic, the extrinsic metric being related to an affirmative and intentional human action with a value of the extrinsic metric being indicative of the human action; receiving extrinsic metric historical data for each document in the group of documents proximate to the respective publication date for each document; and examining the extrinsic metric historical data for each document proximate to the respective publication date for each document over a timeframe of influence for changes in the value of the extrinsic metric, wherein the timeframe of influence is a predetermined time period in which a context of a document influences humans to undertake an affirmative and intentional human action resulting in a change in the value of the extrinsic metric; identifying sentimentally significant documents in the group of documents with heightened sentimentality toward the particular topic, by the computer, comprising: receiving a sentiment value for the change in the extrinsic metric historical data, the sentiment value being indicative of sentimental significance; and comparing the sentiment value to the changes in the value of the extrinsic metric over the timeframe of influence for each document in the group; labeling the identified sentimentally significant documents, in the computer, by including a unique sentiment binding term in the context of the plurality of terms; representing, by the computer, each document in the group of documents in the document sentiment vector space; defining, by the computer, a region of sentimental significance in the document sentiment vector space based on an occurrence of document representations for the identified sentimentally significant documents with the unique sentiment binding term; receiving, by the computer, a query string; and assessing, by the computer, the sentimentality of the query string by comparing a representation of the query string for semantic similarity to the region of sentimental significance in the document sentiment vector space. | 1. A computer implemented method of assessing human sentiment from a group of documents, each document in the group of documents having a plurality of terms and being digitally represented in a computer, the method comprising: receiving, by the computer, a group of documents, each document in the group of documents comprising a context of a plurality of terms and all documents in the group of documents representative of a particular topic; constructing, by the computer, a document sentiment vector space from the group of documents, wherein construction of the document sentiment vector space comprises: assessing sentimentality of each document in the group of documents toward the topic, by the computer, wherein sentimentality represents human emotion toward the topic, comprising: deriving a publication date for each document in the group of documents; electing an extrinsic metric for the particular topic for assessing the sentimentality toward the topic, the extrinsic metric being related to an affirmative and intentional human action with a value of the extrinsic metric being indicative of the human action; receiving extrinsic metric historical data for each document in the group of documents proximate to the respective publication date for each document; and examining the extrinsic metric historical data for each document proximate to the respective publication date for each document over a timeframe of influence for changes in the value of the extrinsic metric, wherein the timeframe of influence is a predetermined time period in which a context of a document influences humans to undertake an affirmative and intentional human action resulting in a change in the value of the extrinsic metric; identifying sentimentally significant documents in the group of documents with heightened sentimentality toward the particular topic, by the computer, comprising: receiving a sentiment value for the change in the extrinsic metric historical data, the sentiment value being indicative of sentimental significance; and comparing the sentiment value to the changes in the value of the extrinsic metric over the timeframe of influence for each document in the group; labeling the identified sentimentally significant documents, in the computer, by including a unique sentiment binding term in the context of the plurality of terms; representing, by the computer, each document in the group of documents in the document sentiment vector space; defining, by the computer, a region of sentimental significance in the document sentiment vector space based on an occurrence of document representations for the identified sentimentally significant documents with the unique sentiment binding term; receiving, by the computer, a query string; and assessing, by the computer, the sentimentality of the query string by comparing a representation of the query string for semantic similarity to the region of sentimental significance in the document sentiment vector space. 32. The method of claim 1 , wherein deriving the publication date for each document in the group of documents further comprises finding a explicit publication date associated with each document in the group, inferring the publication date, implying the publication date, and assuming the publication date. | 0.569902 |
15. A computer system for a database storage reclaiming program, the computer system comprising: one or more computer processors, one or more computer-readable storage media, and program instructions stored on one or more of the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to retrieve a list of data elements for deletion from a database catalog, wherein the list of data elements for deletion details one or more data elements contained in a database; program instructions to determine whether first data elements of the one or more data elements on the list of data elements for deletion have been active in one or more static Structured Query Language (SQL) statements, wherein the one or more static SQL statements are persistent and created before runtime; program instructions to remove the first data elements of the one or more data elements from the list of data elements for deletion that have been determined to be active in the one or more static SQL statements; program instructions to determine whether second data elements of the one or more data elements on the list of data elements for deletion have been active in one or more dynamic SQL statements, wherein the one or more dynamic SQL statements are non-persistent and created at runtime; program instructions to remove the second data elements of the one or more data elements from the list of data elements for deletion that have been determined to be active in the one or more dynamic SQL statements; program instructions to determine whether third data elements of the one or more data elements on the list of data elements for deletion are associated with one or more data elements not on the list of data elements for deletion; program instructions to remove the third data elements of the one or more data elements from the list of data elements for deletion that are determined to be associated with the one or more data elements not on the list of data elements for deletion; program instructions to determine whether fourth data elements of the one or more data elements on the list of data elements for deletion are used in a source code of one or more applications; and program instructions to remove the fourth data elements of the one or more data elements from the list of data elements for deletion that are determined to be used in the source code of the one or more applications. | 15. A computer system for a database storage reclaiming program, the computer system comprising: one or more computer processors, one or more computer-readable storage media, and program instructions stored on one or more of the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to retrieve a list of data elements for deletion from a database catalog, wherein the list of data elements for deletion details one or more data elements contained in a database; program instructions to determine whether first data elements of the one or more data elements on the list of data elements for deletion have been active in one or more static Structured Query Language (SQL) statements, wherein the one or more static SQL statements are persistent and created before runtime; program instructions to remove the first data elements of the one or more data elements from the list of data elements for deletion that have been determined to be active in the one or more static SQL statements; program instructions to determine whether second data elements of the one or more data elements on the list of data elements for deletion have been active in one or more dynamic SQL statements, wherein the one or more dynamic SQL statements are non-persistent and created at runtime; program instructions to remove the second data elements of the one or more data elements from the list of data elements for deletion that have been determined to be active in the one or more dynamic SQL statements; program instructions to determine whether third data elements of the one or more data elements on the list of data elements for deletion are associated with one or more data elements not on the list of data elements for deletion; program instructions to remove the third data elements of the one or more data elements from the list of data elements for deletion that are determined to be associated with the one or more data elements not on the list of data elements for deletion; program instructions to determine whether fourth data elements of the one or more data elements on the list of data elements for deletion are used in a source code of one or more applications; and program instructions to remove the fourth data elements of the one or more data elements from the list of data elements for deletion that are determined to be used in the source code of the one or more applications. 20. The computer system of claim 15 , wherein the determining whether the fourth data elements of the one or more data elements on the list of data elements for deletion are used in the source code of the one or more applications includes analyzing one or more application source codes and workload logic in order to extract the one or more SQL statements and cross reference the extracted one or more SQL statements with the one or more data elements on the list of data elements for deletion. | 0.508976 |
15. A computing system comprising: a processor; and computer storage memory having computer-executable instructions stored thereon which, when executed by the processor, configure the computing system to: receive a user input at an input mechanism (“IME”) program running on a computing device, the IME program enabling an associated input mechanism that provides input to multiple applications on the computing device; communicate the user input from the IME program to an application running on the computing device; communicate the user input from the IME program to a remote contextual-service provider; receive at the IME program a contextual-service instruction comprising information needed to provide one or more contextual services from the remote contextual-service provider; generate, by the IME program, a contextual interface that offers to provide one or more contextual services related to the user input and context in the application; receive a user selection of a contextual service offered in the contextual interface; and initiate the contextual service. | 15. A computing system comprising: a processor; and computer storage memory having computer-executable instructions stored thereon which, when executed by the processor, configure the computing system to: receive a user input at an input mechanism (“IME”) program running on a computing device, the IME program enabling an associated input mechanism that provides input to multiple applications on the computing device; communicate the user input from the IME program to an application running on the computing device; communicate the user input from the IME program to a remote contextual-service provider; receive at the IME program a contextual-service instruction comprising information needed to provide one or more contextual services from the remote contextual-service provider; generate, by the IME program, a contextual interface that offers to provide one or more contextual services related to the user input and context in the application; receive a user selection of a contextual service offered in the contextual interface; and initiate the contextual service. 18. The computing system of claim 15 , wherein the contextual service associates a user with multiple devices through a login to the service and builds a contextual service profile using information from the multiple devices. | 0.516088 |
1. In a communication system having a digital host computer and an instrument which generates a stream of serial digital outputs, a universal communication interface coupled between the host computer and the instrument, the interface comprising: a microprocessor having executive means for executing instructions entered by the host computer into the microprocessor, the instructions forming a set of distinct instructions; and a scratchpad memory for receiving and storing digital signals; wherein the executive means divides the scratchpad memory into a defined structure of at least one record in response to the receiving of at least one corresponding instruction having a selectable variable portion from the host computer, the selected variable portion determining the defined structure of the scratchpad memory and wherein digital signals, corresponding to the digital outputs from the instrument, are directed into and in conformance with the defined structure of one of the at least one record in response to a corresponding instruction from the host computer. | 1. In a communication system having a digital host computer and an instrument which generates a stream of serial digital outputs, a universal communication interface coupled between the host computer and the instrument, the interface comprising: a microprocessor having executive means for executing instructions entered by the host computer into the microprocessor, the instructions forming a set of distinct instructions; and a scratchpad memory for receiving and storing digital signals; wherein the executive means divides the scratchpad memory into a defined structure of at least one record in response to the receiving of at least one corresponding instruction having a selectable variable portion from the host computer, the selected variable portion determining the defined structure of the scratchpad memory and wherein digital signals, corresponding to the digital outputs from the instrument, are directed into and in conformance with the defined structure of one of the at least one record in response to a corresponding instruction from the host computer. 17. An interface according to claim 1 wherein digital signals entering the scratchpad memory either (a) wraparound or (b) do not wraparound once the scratchpad memory is filled, the wraparound mode being established by the executive means in response to one corresponding instruction from the host computer and the not wraparound mode being established by the executive means in response to a differing corresponding instruction from the host computer. | 0.689337 |
3. The method of claim 1 wherein the first number is a weighted combination of a plurality of the views of the document wherein one or more of the views is weighted using a respective weight based at least in part on a respective viewing duration of the document. | 3. The method of claim 1 wherein the first number is a weighted combination of a plurality of the views of the document wherein one or more of the views is weighted using a respective weight based at least in part on a respective viewing duration of the document. 5. The method of claim 3 wherein the weight is determined using a continuous function of viewing length. | 0.880072 |
1. A computer-implemented method for crawling application data from an application data store storing instances of business objects associated with an application, the method comprising: identifying, with a processor of a computer system, a first request for application data received from a search engine as a seed universal resource locator (URL) sourcing a business object associated with the application for crawling by the search engine; accessing, with the processor of the computer system, a crawlable definition for the business object associated with the application, the crawlable definition including information specifying a query selecting one or more attributes of the business object associated with the application; receiving, at the computer system, query results in response to sending the query to the application data store; forming, with the processor of the computer system, a crawlable document based on the query results, the crawlable document including information related to instances of the business object and corresponding to the one or more attributes of the business object from the query results; generating, with the processor of the computer system, a data feed based on the crawlable document; generating, with the processor of the computer system, a control feed based on dividing the data feed into a set of transferable batches according to predetermined criteria; generating, with the processor of the computer system, batch URLs for transferable batches in the set of transferable batches; returning a feed document to the search engine from the computer system, the feed document comprising the control feed and the batch URLs for the transferable batches in the set of transferable batches; identifying, with the of the computer system, a second request for application data received from the search engine as a re-entry URL associated with the feed document; returning, from the computer system, a batch from the data feed to the search engine where the batch is requested in the re-entry URL; returning, from the computer system, a related document to the search engine where the related document is requested in the re-entry URL; and returning, from the computer system, a dependent document to the search engine where the dependent document is requested in the re-entry URL. | 1. A computer-implemented method for crawling application data from an application data store storing instances of business objects associated with an application, the method comprising: identifying, with a processor of a computer system, a first request for application data received from a search engine as a seed universal resource locator (URL) sourcing a business object associated with the application for crawling by the search engine; accessing, with the processor of the computer system, a crawlable definition for the business object associated with the application, the crawlable definition including information specifying a query selecting one or more attributes of the business object associated with the application; receiving, at the computer system, query results in response to sending the query to the application data store; forming, with the processor of the computer system, a crawlable document based on the query results, the crawlable document including information related to instances of the business object and corresponding to the one or more attributes of the business object from the query results; generating, with the processor of the computer system, a data feed based on the crawlable document; generating, with the processor of the computer system, a control feed based on dividing the data feed into a set of transferable batches according to predetermined criteria; generating, with the processor of the computer system, batch URLs for transferable batches in the set of transferable batches; returning a feed document to the search engine from the computer system, the feed document comprising the control feed and the batch URLs for the transferable batches in the set of transferable batches; identifying, with the of the computer system, a second request for application data received from the search engine as a re-entry URL associated with the feed document; returning, from the computer system, a batch from the data feed to the search engine where the batch is requested in the re-entry URL; returning, from the computer system, a related document to the search engine where the related document is requested in the re-entry URL; and returning, from the computer system, a dependent document to the search engine where the dependent document is requested in the re-entry URL. 6. The method of claim 1 , wherein generating, with the processor associated with the computer system, the data feed based on the crawlable document further comprises generating the data feed based on the crawlable definition for the business object associated with the application. | 0.584758 |
1. A method implemented with a processor, comprising: generating a user interface that displays analysis results identified from within one or more social media data sources, the user interface comprising: (a) a first interface portion of the user interface comprising a list of one or more analysis results identified from within one or more social media data sources, an individual analysis result from among the one or more analysis results being selectable to display a set of terms associated with a selected individual analysis result in a second interface portion, (b) the second interface portion of the user interface comprising the set of terms, a first interface control, and a second interface control, the set of terms associated with the selected individual analysis result, the first interface control constraining a search to include themes that correspond to the selected individual analysis result, the second interface control constraining the search to exclude the themes that correspond to the selected individual analysis result, and (c) a third interface portion of the user interface comprising a set of one or more semantic filters selected according to the second interface portion; receiving a search criteria to perform a search of content from the one or more social media data sources; performing the search of the content from the one or more social media data sources to generate the list of the one or more analysis results, a volatility index corresponding to a level of commonality between two or more themes being generated for the one or more analysis results, the volatility index usable to automatically control creation of a new topic based at least in part upon a threshold value established for the volatility index, the level of commonality between the two or more themes is calculated by computing centroids for the two or more themes and determining distances between the centroids; displaying the list of one or more analysis results identified from within one or more social media data sources pertaining to the search criteria in the first interface portion of the user interface; receiving a selection of the first or second interface control in the second interface portion of the user interface corresponding to an application of a semantic filter, the semantic filter constraining the search of the content from the one or more social media data sources by: (a) adding the semantic filter to definition parameters for the new topic if the first interface control is selected; (b) adding the semantic filter to the set of one or more semantic filters in the third interface portion of the user interface if the second interface control is selected; and (c) performing a modified search of the content with application of the semantic filter, the modified search updating the list of one or more analysis results identified from within one or more social media data sources in the first interface portion of the user interface to either remove or add results in the first interface portion that pertain to the semantic filter; and creating the new topic based at least in part on the definition parameters, wherein the new topic corresponds to the search criteria and the semantic filter. | 1. A method implemented with a processor, comprising: generating a user interface that displays analysis results identified from within one or more social media data sources, the user interface comprising: (a) a first interface portion of the user interface comprising a list of one or more analysis results identified from within one or more social media data sources, an individual analysis result from among the one or more analysis results being selectable to display a set of terms associated with a selected individual analysis result in a second interface portion, (b) the second interface portion of the user interface comprising the set of terms, a first interface control, and a second interface control, the set of terms associated with the selected individual analysis result, the first interface control constraining a search to include themes that correspond to the selected individual analysis result, the second interface control constraining the search to exclude the themes that correspond to the selected individual analysis result, and (c) a third interface portion of the user interface comprising a set of one or more semantic filters selected according to the second interface portion; receiving a search criteria to perform a search of content from the one or more social media data sources; performing the search of the content from the one or more social media data sources to generate the list of the one or more analysis results, a volatility index corresponding to a level of commonality between two or more themes being generated for the one or more analysis results, the volatility index usable to automatically control creation of a new topic based at least in part upon a threshold value established for the volatility index, the level of commonality between the two or more themes is calculated by computing centroids for the two or more themes and determining distances between the centroids; displaying the list of one or more analysis results identified from within one or more social media data sources pertaining to the search criteria in the first interface portion of the user interface; receiving a selection of the first or second interface control in the second interface portion of the user interface corresponding to an application of a semantic filter, the semantic filter constraining the search of the content from the one or more social media data sources by: (a) adding the semantic filter to definition parameters for the new topic if the first interface control is selected; (b) adding the semantic filter to the set of one or more semantic filters in the third interface portion of the user interface if the second interface control is selected; and (c) performing a modified search of the content with application of the semantic filter, the modified search updating the list of one or more analysis results identified from within one or more social media data sources in the first interface portion of the user interface to either remove or add results in the first interface portion that pertain to the semantic filter; and creating the new topic based at least in part on the definition parameters, wherein the new topic corresponds to the search criteria and the semantic filter. 5. The method of claim 1 , wherein the one or more sources comprise social media sources. | 0.554254 |
8. A system for communication comprising: means for receiving an audio voice message from a caller; means for transcribing the audio voice message to produce text; means for providing a text message including the text and an identifier that uniquely identifies the specific audio voice message to link to the specific audio voice message; and means for transmitting the text message to the recipient's mobile telephone. | 8. A system for communication comprising: means for receiving an audio voice message from a caller; means for transcribing the audio voice message to produce text; means for providing a text message including the text and an identifier that uniquely identifies the specific audio voice message to link to the specific audio voice message; and means for transmitting the text message to the recipient's mobile telephone. 13. The system of claim 8 , further comprising means for providing options associated with the specific audio voice message to the recipient in response to the recipient linking to the specific audio voice message via the identifier. | 0.584778 |
1. An electronic dictionary to retrieve and display word data related to a word input into the dictionary comprising an input means to insert the letters of a word into the electronic dictionary to retrieve related word data including a plurality of character keys to insert character data representing a word, and a call key means to signal proceeding to a next designated word; a vocabulary storage section having a plurality of word data items; related groups of word data items in said vocabulary storage section with each of said related groups of word data items forming a closed loop beginning and ending with the character data; a word data memory location in said vocabulary storage section for storing each of said word data items; an identifying address appendixed to each of said word data items and included in said closed loop of that related group; address number datam also appendixed to each of said word data items and also included in said closed loop of that related group; an address number memory location for storing each of said address number datam; a working memory means for storing character data entered through said character keys; search means for searching, upon activation of said call key means, said word data memory locations having said word data item represented by said character data entered by said character keys; first retrieval means for retrieving said address number datam stored in said address number memory location corresponding to said word data memory location of said word data item to which said address number datum is appendixed and corresponding to said word data memory location searched by said search means; second retrieval means for retrieving said word data item stored in said word data memory location designated by said identifying address corresponding to said address number datum retrieved by said first retrieval means; display means for indicating said word data item retrieved by said second retrieval means as related to said character data; said first retrieval means operating upon each signal from call key means to retrieve said address number datum stored in said address number memory location corresponding to said word data memory location of said word data item to which said address number datum is apppendixed and corresponding to said word data item last retrieved by said second retrieval means; said second retrieval means, upon each operation of said first retrieval means, retrieving said word data item stored in said word data memory location designated by said identifying address corresponding to said address number datum retrieved by said first retrieval means; said first and second retrieval means operating in a closed loop of one of each of said related groups of word data items determined by said character data entered by said character keys; and means to exit from the closed hoop with clearing of the display means. | 1. An electronic dictionary to retrieve and display word data related to a word input into the dictionary comprising an input means to insert the letters of a word into the electronic dictionary to retrieve related word data including a plurality of character keys to insert character data representing a word, and a call key means to signal proceeding to a next designated word; a vocabulary storage section having a plurality of word data items; related groups of word data items in said vocabulary storage section with each of said related groups of word data items forming a closed loop beginning and ending with the character data; a word data memory location in said vocabulary storage section for storing each of said word data items; an identifying address appendixed to each of said word data items and included in said closed loop of that related group; address number datam also appendixed to each of said word data items and also included in said closed loop of that related group; an address number memory location for storing each of said address number datam; a working memory means for storing character data entered through said character keys; search means for searching, upon activation of said call key means, said word data memory locations having said word data item represented by said character data entered by said character keys; first retrieval means for retrieving said address number datam stored in said address number memory location corresponding to said word data memory location of said word data item to which said address number datum is appendixed and corresponding to said word data memory location searched by said search means; second retrieval means for retrieving said word data item stored in said word data memory location designated by said identifying address corresponding to said address number datum retrieved by said first retrieval means; display means for indicating said word data item retrieved by said second retrieval means as related to said character data; said first retrieval means operating upon each signal from call key means to retrieve said address number datum stored in said address number memory location corresponding to said word data memory location of said word data item to which said address number datum is apppendixed and corresponding to said word data item last retrieved by said second retrieval means; said second retrieval means, upon each operation of said first retrieval means, retrieving said word data item stored in said word data memory location designated by said identifying address corresponding to said address number datum retrieved by said first retrieval means; said first and second retrieval means operating in a closed loop of one of each of said related groups of word data items determined by said character data entered by said character keys; and means to exit from the closed hoop with clearing of the display means. 5. The electronic dictionary of claim 1 wherein upon each activation of said call key means, said display means clears one of said word data items of said related group of word data items and indicates another of said word data items of said same related group thereby indicating said word data items of said related group of word data items one after another. | 0.587622 |
23. The non-transitory computer readable storage medium of claim 20 , wherein the stored processor-executable software instructions are configured to cause a processor to perform operations such that receiving the implementation agnostic policy-charging service request message from the continuum orchestrator component comprises receiving the implementation agnostic policy-charging service request message from the second domain orchestrator computing device via the continuum orchestrator component. | 23. The non-transitory computer readable storage medium of claim 20 , wherein the stored processor-executable software instructions are configured to cause a processor to perform operations such that receiving the implementation agnostic policy-charging service request message from the continuum orchestrator component comprises receiving the implementation agnostic policy-charging service request message from the second domain orchestrator computing device via the continuum orchestrator component. 24. The non-transitory computer readable storage medium of claim 23 , wherein the stored processor-executable software instructions are configured to cause a processor to perform operations such that receiving the implementation agnostic policy-charging service request message from the continuum orchestrator component comprises receiving a request message generated in response to detecting a change in circumstances in the first domain. | 0.893044 |
13. An apparatus for displaying search information, comprising: means for displaying a summary result of a query having one or more search criterion in a search criteria control bar (SCCB) format, wherein the SCCB format includes each of the one or more search criterion having a first active control for editing the query with a one-click operation and a second active control for editing the query with another one-click operation; means for initiating a submission of another query when either the first or second active control is clicked to obtain another summary result in the SCCB format reflecting results of the another query based on which active control is clicked; a means for displaying the one or more search criterion each having an associated filter option for removing a chosen search criterion from the one or more search criterion when the another query is initiated, the associated filter option being the second active control; and a means for removing the chosen search criterion when the associated filter option is clicked and initiating the submission of the another query using any remaining one or more search criterion causing the results of the another query to be limited to the remaining one or more search criterion. | 13. An apparatus for displaying search information, comprising: means for displaying a summary result of a query having one or more search criterion in a search criteria control bar (SCCB) format, wherein the SCCB format includes each of the one or more search criterion having a first active control for editing the query with a one-click operation and a second active control for editing the query with another one-click operation; means for initiating a submission of another query when either the first or second active control is clicked to obtain another summary result in the SCCB format reflecting results of the another query based on which active control is clicked; a means for displaying the one or more search criterion each having an associated filter option for removing a chosen search criterion from the one or more search criterion when the another query is initiated, the associated filter option being the second active control; and a means for removing the chosen search criterion when the associated filter option is clicked and initiating the submission of the another query using any remaining one or more search criterion causing the results of the another query to be limited to the remaining one or more search criterion. 14. The apparatus of claim 13 , further comprising a means for displaying the summary result and the another summary result in the SCCB format wherein the one or more search criterion includes at least any one of one or more category words or phrase each delimited by a set of category delimiters and one or more keywords or phrase each delimited by a set of keyword delimiters. | 0.546196 |
16. The electronic device of claim 10 wherein the input apparatus comprises a plurality of input members, and wherein the memory has stored therein a map file comprising an assignment of each character to a corresponding input member, and wherein the operations further comprise: detecting a press-and-hold actuation of a particular input member; and outputting at least a first character from the map file that is assigned to the particular input member and is in the inactive character set. | 16. The electronic device of claim 10 wherein the input apparatus comprises a plurality of input members, and wherein the memory has stored therein a map file comprising an assignment of each character to a corresponding input member, and wherein the operations further comprise: detecting a press-and-hold actuation of a particular input member; and outputting at least a first character from the map file that is assigned to the particular input member and is in the inactive character set. 17. The electronic device of claim 16 wherein the operations further comprise detecting as the input of the particular character at least one of a navigational input and a selection input with respect to the particular character. | 0.828502 |
2. The method according to claim 1 , wherein the step (1) further comprises: extracting a title from the information of the source file, and segmenting the title; wherein if there is no title or the title cannot be segmented, then the title will be set as empty. | 2. The method according to claim 1 , wherein the step (1) further comprises: extracting a title from the information of the source file, and segmenting the title; wherein if there is no title or the title cannot be segmented, then the title will be set as empty. 3. The method according to claim 2 , wherein before extracting the main body text from the information of the source file, the method further comprises: filtering the source file information to keep a partitionable type tag and the information in the kept tag. | 0.949189 |
12. A computer program product according to claim 11 wherein the displayed figures define a plurality of areas of overlap within each of which the results delivered are for the core search query and a suggested query. | 12. A computer program product according to claim 11 wherein the displayed figures define a plurality of areas of overlap within each of which the results delivered are for the core search query and a suggested query. 13. A computer program product according to claim 12 wherein the response to the system user pointing a screen cursor to an area of overlap includes displaying results delivered by the search program for the queries represented by the area to which the cursor points. | 0.853958 |
17. A device, comprising: at least one processor; and at least one memory storing machine executable instructions, the machine-executable instructions configured to, with the at least one processor, cause the device to (a) receive data for a plurality of segments of a passage in a source voice, wherein the data for each segment of the plurality models a prosodic component of the source voice for that segment, (b) identify a target voice entry in a codebook for each of the source voice passage segments, wherein each of the identified target voice entries models a prosodic component of a target voice for a different segment of codebook training material, and (c) generate a target voice version of the plurality of passage segments by altering the modeled source voice prosodic component for each segment to replicate the target voice prosodic component modeled by the target voice entry identified for that segment in (b), and wherein the codebook includes multiple source voice entries, each of the multiple source voice entries models a prosodic component of the source voice for a different segment of the codebook training material, each of the multiple source voice entries corresponds to a target voice entry modeling a prosodic component of the target voice for the segment of the codebook training material for which the corresponding source voice entry models the prosodic component of the source voice, operation (b) includes, for each source voice passage segment, identifying a target voice entry by comparing data for the source voice passage segment to one or more of the multiple source voice entries, each of the multiple source voice entries and its corresponding target voice entry includes a plurality of transform coefficients representing a contour for the modeled prosodic component, and operation (b) includes, for each source voice passage segment, identifying a target voice entry by comparing transform coefficients representing a contour for the prosodic component of the source voice passage segment to the transform coefficients for one or more of the multiple source voice entries. | 17. A device, comprising: at least one processor; and at least one memory storing machine executable instructions, the machine-executable instructions configured to, with the at least one processor, cause the device to (a) receive data for a plurality of segments of a passage in a source voice, wherein the data for each segment of the plurality models a prosodic component of the source voice for that segment, (b) identify a target voice entry in a codebook for each of the source voice passage segments, wherein each of the identified target voice entries models a prosodic component of a target voice for a different segment of codebook training material, and (c) generate a target voice version of the plurality of passage segments by altering the modeled source voice prosodic component for each segment to replicate the target voice prosodic component modeled by the target voice entry identified for that segment in (b), and wherein the codebook includes multiple source voice entries, each of the multiple source voice entries models a prosodic component of the source voice for a different segment of the codebook training material, each of the multiple source voice entries corresponds to a target voice entry modeling a prosodic component of the target voice for the segment of the codebook training material for which the corresponding source voice entry models the prosodic component of the source voice, operation (b) includes, for each source voice passage segment, identifying a target voice entry by comparing data for the source voice passage segment to one or more of the multiple source voice entries, each of the multiple source voice entries and its corresponding target voice entry includes a plurality of transform coefficients representing a contour for the modeled prosodic component, and operation (b) includes, for each source voice passage segment, identifying a target voice entry by comparing transform coefficients representing a contour for the prosodic component of the source voice passage segment to the transform coefficients for one or more of the multiple source voice entries. 21. The device of claim 17 , wherein the transform is a discrete cosine transform. | 0.700936 |
1. A system comprising: a base device configured to operate from a fixed location to capture far-field audio containing first user speech in response to a user speaking a keyword; a handheld device configured to operate from a moveable location to capture near-field audio containing second user; a speech service configured to perform acts comprising: receiving a first audio signal from the base device, the first audio signal corresponding to the far-field audio; performing automatic speech recognition (ASR) on the first audio signal using a first ASR model to obtain first ASR results, wherein the first ASR model was trained using far-field audio signals; receiving a second audio signal from the handheld device, the second audio signal corresponding to the near-field audio; performing ASR on the near-field audio using a second ASR model to obtain second ASR results, wherein the second ASR model was trained using near-field audio signals; performing natural language understanding (NLU) on the first ASR results using a first NLU model to determine a first meaning of the first user speech, wherein the first NLU model was trained using ASR results from far-field audio signals; performing NLU on the second ASR results using a second NLU model to determine a second meaning of the second user speech, wherein the second NLU model was trained using ASR results from near-field audio signals. | 1. A system comprising: a base device configured to operate from a fixed location to capture far-field audio containing first user speech in response to a user speaking a keyword; a handheld device configured to operate from a moveable location to capture near-field audio containing second user; a speech service configured to perform acts comprising: receiving a first audio signal from the base device, the first audio signal corresponding to the far-field audio; performing automatic speech recognition (ASR) on the first audio signal using a first ASR model to obtain first ASR results, wherein the first ASR model was trained using far-field audio signals; receiving a second audio signal from the handheld device, the second audio signal corresponding to the near-field audio; performing ASR on the near-field audio using a second ASR model to obtain second ASR results, wherein the second ASR model was trained using near-field audio signals; performing natural language understanding (NLU) on the first ASR results using a first NLU model to determine a first meaning of the first user speech, wherein the first NLU model was trained using ASR results from far-field audio signals; performing NLU on the second ASR results using a second NLU model to determine a second meaning of the second user speech, wherein the second NLU model was trained using ASR results from near-field audio signals. 4. The system of claim 1 , wherein: performing ASR on the first audio signal is based at least in part on a first recognition confidence score threshold; and performing ASR on the second audio signal is based at least in part on a second recognition confidence score threshold. | 0.536715 |
9. The method of claim 8 , wherein processing the data set includes statistically curve fitting the data set to a probability distribution function and determining a set of pre-selected thresholds based on the parameters obtained by fitting the data set to the probability distribution function. | 9. The method of claim 8 , wherein processing the data set includes statistically curve fitting the data set to a probability distribution function and determining a set of pre-selected thresholds based on the parameters obtained by fitting the data set to the probability distribution function. 10. The method of claim 9 , wherein the probability distribution function is the normal distribution function and the parameters obtained by fitting the data set include a mean μ and a standard deviation σ of the fitted normal distribution function, and the maximum and minimum data values in the data set. | 0.912635 |
6. The computer-implemented method of claim 1 , wherein the one or more signals includes one or more characteristics of the partial search query. | 6. The computer-implemented method of claim 1 , wherein the one or more signals includes one or more characteristics of the partial search query. 7. The computer-implemented method of claim 6 , wherein the one or more characteristics of the partial search query include an identifier contained in the partial search query. | 0.920126 |
1. A recommendation search method for reducing human-machine interactions during a search, comprising: recording a search log and a click log for query terms during search processes performed with a search engine, the search engine including at least a vertical search engine and a web search engine; determining, by a processor of the search engine, weights of tendencies of vertical searches for the query terms based on the recorded search log and click log; upon detecting a query term in a search box, determining, by the processor, recommended query terms relating to the query term in the search box, searching for the weights of tendencies of the vertical searches for each of the recommended query terms and determining a tendentious vertical search type for each of the recommended query terms based on the weights of tendencies of the vertical searches, and displaying each of the recommended query terms and links of the tendentious vertical search types for the recommended query terms; upon detecting a click on a link of one of the tendentious vertical search types corresponding to one of the recommended query terms, performing, by the processor, a search based on the one of the recommended query terms by using a vertical search engine corresponding to the one of the tendentious vertical search type, and displaying search results, wherein: the recording the search log for the query terms further includes: for each type of vertical search engine, when a search is performed with a vertical search engine of the type of vertical search engine, recording, by the vertical search engine, content of the query term being entered, the number of links being clicked among the search results, and the type of the vertical search engine, and the recording the click log for the query terms further includes: recording, by the web search engine, the content of the query term being entered, links being clicked among the search results, and the vertical search types corresponding to the links being clicked, when a search is performed with the web search engine, the determining weights of tendencies of vertical searches for the query terms based on the recorded search log and click log further includes: determining weights of the tendencies of the vertical search types for each of the query terms, a weight of tendency of a certain vertical search type being determined by: determining a first weight of the tendency of the certain vertical search type for a certain query term based on the search log, determining a second weight of the tendency of the certain vertical search type for the certain query term based on the click log, and obtaining the weight of the tendency of the certain vertical search type for the certain query term by combining the first weight of the tendency and the second weight of the tendency. | 1. A recommendation search method for reducing human-machine interactions during a search, comprising: recording a search log and a click log for query terms during search processes performed with a search engine, the search engine including at least a vertical search engine and a web search engine; determining, by a processor of the search engine, weights of tendencies of vertical searches for the query terms based on the recorded search log and click log; upon detecting a query term in a search box, determining, by the processor, recommended query terms relating to the query term in the search box, searching for the weights of tendencies of the vertical searches for each of the recommended query terms and determining a tendentious vertical search type for each of the recommended query terms based on the weights of tendencies of the vertical searches, and displaying each of the recommended query terms and links of the tendentious vertical search types for the recommended query terms; upon detecting a click on a link of one of the tendentious vertical search types corresponding to one of the recommended query terms, performing, by the processor, a search based on the one of the recommended query terms by using a vertical search engine corresponding to the one of the tendentious vertical search type, and displaying search results, wherein: the recording the search log for the query terms further includes: for each type of vertical search engine, when a search is performed with a vertical search engine of the type of vertical search engine, recording, by the vertical search engine, content of the query term being entered, the number of links being clicked among the search results, and the type of the vertical search engine, and the recording the click log for the query terms further includes: recording, by the web search engine, the content of the query term being entered, links being clicked among the search results, and the vertical search types corresponding to the links being clicked, when a search is performed with the web search engine, the determining weights of tendencies of vertical searches for the query terms based on the recorded search log and click log further includes: determining weights of the tendencies of the vertical search types for each of the query terms, a weight of tendency of a certain vertical search type being determined by: determining a first weight of the tendency of the certain vertical search type for a certain query term based on the search log, determining a second weight of the tendency of the certain vertical search type for the certain query term based on the click log, and obtaining the weight of the tendency of the certain vertical search type for the certain query term by combining the first weight of the tendency and the second weight of the tendency. 9. The method of claim 1 , further comprising: upon detecting a certain one of the recommended query terms is clicked, searching for contents matching the recommended query term by using a web search engine and displaying the search results. | 0.667235 |
7. A method for locating line breaks in text, the method being carried out by a computer device having a processor and system memory, comprising: a) creating a probability function equal to the product of the probabilities of line break locations for all lines of a paragraph of text; b) setting parameters of the model, the parameters including inter-word spacing and line break location; and c) performing a max-product belief propagation operation on the model to find a sequence of line-breaks that maximizes the joint probability of line break positions with minimum deviation of inter-word spacing from an ideal value. | 7. A method for locating line breaks in text, the method being carried out by a computer device having a processor and system memory, comprising: a) creating a probability function equal to the product of the probabilities of line break locations for all lines of a paragraph of text; b) setting parameters of the model, the parameters including inter-word spacing and line break location; and c) performing a max-product belief propagation operation on the model to find a sequence of line-breaks that maximizes the joint probability of line break positions with minimum deviation of inter-word spacing from an ideal value. 9. A method in accordance with claim 7 , wherein setting the parameters of the probabilistic model comprises a step selected from the group consisting of (i) measuring the parameters from a selected sample of typeset text, and (ii) setting the parameters from design experience. | 0.5 |
1. A method comprising: tracking search queries of a user of a search engine to generate a search query history; comparing the search query history of the user with search query histories of other users of the search engine; determining a number of common search queries between the search query history of the user and the search query history of each other user in view of the comparing; associating the search query history of the user with the search query history of at least one other user having the most number of common search queries; determining where a test sequence of the search query history of the user is most similar to a reference sequence of at least one other user having the most number of common search queries; and generating, by a processing device, a predicted search query for the user that the user is predicted to use to perform a next search in relation to other possible searches from the search query history of at least one other user having the most number of common search queries in view of the test sequence and the reference sequence, wherein the predicted search query is the next sequential predicted search relative to the reference sequence, and wherein the search query histories of the other users with greater similarities to the search query history of the user have a greater computation weight in generating the predicted search query than the search query histories of the other users with fewer similarities to the search query history of the user. | 1. A method comprising: tracking search queries of a user of a search engine to generate a search query history; comparing the search query history of the user with search query histories of other users of the search engine; determining a number of common search queries between the search query history of the user and the search query history of each other user in view of the comparing; associating the search query history of the user with the search query history of at least one other user having the most number of common search queries; determining where a test sequence of the search query history of the user is most similar to a reference sequence of at least one other user having the most number of common search queries; and generating, by a processing device, a predicted search query for the user that the user is predicted to use to perform a next search in relation to other possible searches from the search query history of at least one other user having the most number of common search queries in view of the test sequence and the reference sequence, wherein the predicted search query is the next sequential predicted search relative to the reference sequence, and wherein the search query histories of the other users with greater similarities to the search query history of the user have a greater computation weight in generating the predicted search query than the search query histories of the other users with fewer similarities to the search query history of the user. 5. The method of claim 1 wherein the search queries of the user comprise orders placed by the user in view of results of the search queries. | 0.867978 |
1. A method, comprising: receiving, at a first communication device including a processor, input data comprising a group of words inputted via a user interface of the first communication device, the group of words comprising a target word having a type; performing, by the first communication device, auto-correction of the target word to generate a corrected text message; receiving, at the first communication device, an input command via the user interface, the input command requesting a transmission of the corrected text message to a second communication device; responsive to the receiving of the input command, presenting a correction alert at the first communication device, the correction alert indicating the target word that has been auto-corrected; and in response to the presenting of the correction alert, presenting, by the first communication device, an option for modifying the target word, wherein the transmission of the corrected text message to the second communication device is limited to after the option for modifying is presented at the first communication device, and wherein a type of the correction alert corresponds to the type of the target word. | 1. A method, comprising: receiving, at a first communication device including a processor, input data comprising a group of words inputted via a user interface of the first communication device, the group of words comprising a target word having a type; performing, by the first communication device, auto-correction of the target word to generate a corrected text message; receiving, at the first communication device, an input command via the user interface, the input command requesting a transmission of the corrected text message to a second communication device; responsive to the receiving of the input command, presenting a correction alert at the first communication device, the correction alert indicating the target word that has been auto-corrected; and in response to the presenting of the correction alert, presenting, by the first communication device, an option for modifying the target word, wherein the transmission of the corrected text message to the second communication device is limited to after the option for modifying is presented at the first communication device, and wherein a type of the correction alert corresponds to the type of the target word. 8. The method of claim 1 , comprising: receiving, at the first communication device, provisioning information indicating types of alerts to be applied for contact entries stored by the first communication device, wherein the presenting of the correction alert is according to a type of alert of the provisioning information that corresponds to the second communication device. | 0.645462 |
11. A system comprising: memory to store instructions; a processor to execute the instructions to: partition a memory-based state into a plurality of domains, each domain including separate address spaces of a memory and including variables within boundaries of the domain, the variables are isolated from outside of the boundaries of the domain, and the variables within each domain are isolated from the other domains; introduce a plurality of agents inside the boundaries of the domain corresponding with a client of an application including an application component, the agent acts on behalf of the client to access the variables within the domain via message-passing between the agent and the client and the agent does not use the same application component or the same thread of execution as the client, the agents include at least one read agent to read from variables within the domain, at least one write agent to read from or write to variables within the domain and at least one third agent to neither read from nor write to variables within the domain; execute any number of third agents concurrently with each other or with read agents or with one write agent; execute any number of read agents concurrently as long as no write agents are executing; execute only one write agent at a time such that the instance of the write agent as exclusive access to the domain while executing the write agent; the domains and the agents are each both declarative and runtime constructs in a programming language based model; and enforce isolation of the domain with a compiler and supporting runtime through the agent interacting with other agents via message-passing over separately defined channels. | 11. A system comprising: memory to store instructions; a processor to execute the instructions to: partition a memory-based state into a plurality of domains, each domain including separate address spaces of a memory and including variables within boundaries of the domain, the variables are isolated from outside of the boundaries of the domain, and the variables within each domain are isolated from the other domains; introduce a plurality of agents inside the boundaries of the domain corresponding with a client of an application including an application component, the agent acts on behalf of the client to access the variables within the domain via message-passing between the agent and the client and the agent does not use the same application component or the same thread of execution as the client, the agents include at least one read agent to read from variables within the domain, at least one write agent to read from or write to variables within the domain and at least one third agent to neither read from nor write to variables within the domain; execute any number of third agents concurrently with each other or with read agents or with one write agent; execute any number of read agents concurrently as long as no write agents are executing; execute only one write agent at a time such that the instance of the write agent as exclusive access to the domain while executing the write agent; the domains and the agents are each both declarative and runtime constructs in a programming language based model; and enforce isolation of the domain with a compiler and supporting runtime through the agent interacting with other agents via message-passing over separately defined channels. 12. The system of claim 11 wherein the programming language is an object oriented based language that allows or encourages to some degree object oriented programming techniques. | 0.541624 |
1. A method for conversing comprising: establishing a plurality of conference areas wherein each conference area supports a language and is operated in parallel with other conference areas such that each conference area contains the same messages in the same order, said plurality of conference areas managed by an online service conference manager that manages translations of messages from each conference area for broadcast of translated messages to other conference areas; connecting a first plurality of computer users to a first conference area, wherein said computers users are connected to said first conference area according to said computer users specified preference for a first language; connecting a second plurality of computer users to a second conference area, wherein said computers users are connected to said second conference area according to said computer users specified preference for a second language; electronically receiving, at said online service conference manager, text communications in said first language, said text communications originating from spoken communications by computer users currently connected to said first conference area for said first language; automatically polling for untranslated text communications from said first conference area, said polling performed by a polling server; automatically transmitting said untranslated text communications from said polling server to said online service conference manager, automatically translating at said online service conference manager said untranslated text communications in said first language to translated text communications in a second language when said online service conference manager receives untranslated text communications from said polling server; automatically transmitting said translated text communications to said second conference area for said second language; and automatically broadcasting said translated text communications from said online service conference manager to said computer users currently connected to said second conference area. | 1. A method for conversing comprising: establishing a plurality of conference areas wherein each conference area supports a language and is operated in parallel with other conference areas such that each conference area contains the same messages in the same order, said plurality of conference areas managed by an online service conference manager that manages translations of messages from each conference area for broadcast of translated messages to other conference areas; connecting a first plurality of computer users to a first conference area, wherein said computers users are connected to said first conference area according to said computer users specified preference for a first language; connecting a second plurality of computer users to a second conference area, wherein said computers users are connected to said second conference area according to said computer users specified preference for a second language; electronically receiving, at said online service conference manager, text communications in said first language, said text communications originating from spoken communications by computer users currently connected to said first conference area for said first language; automatically polling for untranslated text communications from said first conference area, said polling performed by a polling server; automatically transmitting said untranslated text communications from said polling server to said online service conference manager, automatically translating at said online service conference manager said untranslated text communications in said first language to translated text communications in a second language when said online service conference manager receives untranslated text communications from said polling server; automatically transmitting said translated text communications to said second conference area for said second language; and automatically broadcasting said translated text communications from said online service conference manager to said computer users currently connected to said second conference area. 2. The method of claim 1 wherein said first language is selected from the group consisting of English, German, and French. | 0.621476 |
3. The method as recited in claim 2 , wherein determining the connectedness of the one or more connected components comprises determining, for each of the one or more connected components, a number of connected component transitions across a vertical threshold position. | 3. The method as recited in claim 2 , wherein determining the connectedness of the one or more connected components comprises determining, for each of the one or more connected components, a number of connected component transitions across a vertical threshold position. 8. The method as recited in claim 3 , further comprising defining the vertical threshold position at approximately two thirds of a maximum vertical stroke height of each of the one or more connected components prior to determining the connectedness of the connected component. | 0.931231 |
1. A computer implemented method for indexing and retrieving documents stored in a database, comprising the steps of: extracting a document feature vector from each of a plurality of documents; indexing each of the plurality of documents according the associated document feature vector; converting, using a processor, a spoken query to an intermediate representation representing possible sequential combinations of terms in the spoken query, the intermediate representation is selected from a group consisting of a lattice of terms, an n-best list, or combination thereof; generating a query certainty vector from the intermediate representation; and comparing the query certainty vector to each of the document feature vectors to retrieve a ranked result set of documents. | 1. A computer implemented method for indexing and retrieving documents stored in a database, comprising the steps of: extracting a document feature vector from each of a plurality of documents; indexing each of the plurality of documents according the associated document feature vector; converting, using a processor, a spoken query to an intermediate representation representing possible sequential combinations of terms in the spoken query, the intermediate representation is selected from a group consisting of a lattice of terms, an n-best list, or combination thereof; generating a query certainty vector from the intermediate representation; and comparing the query certainty vector to each of the document feature vectors to retrieve a ranked result set of documents. 6. The method of claim 1 , in which the intermediate representation is the n-best list. | 0.694248 |
8. A control method for an information processing apparatus including a processing unit configured to generate an image based on structured language data as a processing target and a storage unit configured to store a first style sheet and a second style sheet which respectively correspond to a first interface and a second interface and define processing methods, different from each other, for generating an image based on the structured language data, the method comprising: a processor and a memory of the information processing apparatus executing: an acquisition step of acquiring structured language data as a processing target via one of the first interface and the second interface which differ physically or differ logically from one another, wherein in the acquisition step, the structured language data can be acquired via any of the first interface and the second interface; a selection step of selecting the first style sheet in a case where the first interface is used for the acquisition of the structured language data in said acquisition step, and selecting the second style sheet in a case where the second interface is used for the acquisition of the structured language data in said acquisition step; and a processing step of the processing unit generating an image based on the structured language data as a processing target acquired in the acquisition step in accordance with a processing method defined in the style sheet selected in the selection step among the first style sheet and the second style sheet stored by said storage unit, and executing the processing based on the selected style sheet in either case that the first style sheet or the second style sheet is selected in the selection step. | 8. A control method for an information processing apparatus including a processing unit configured to generate an image based on structured language data as a processing target and a storage unit configured to store a first style sheet and a second style sheet which respectively correspond to a first interface and a second interface and define processing methods, different from each other, for generating an image based on the structured language data, the method comprising: a processor and a memory of the information processing apparatus executing: an acquisition step of acquiring structured language data as a processing target via one of the first interface and the second interface which differ physically or differ logically from one another, wherein in the acquisition step, the structured language data can be acquired via any of the first interface and the second interface; a selection step of selecting the first style sheet in a case where the first interface is used for the acquisition of the structured language data in said acquisition step, and selecting the second style sheet in a case where the second interface is used for the acquisition of the structured language data in said acquisition step; and a processing step of the processing unit generating an image based on the structured language data as a processing target acquired in the acquisition step in accordance with a processing method defined in the style sheet selected in the selection step among the first style sheet and the second style sheet stored by said storage unit, and executing the processing based on the selected style sheet in either case that the first style sheet or the second style sheet is selected in the selection step. 13. The method according to claim 8 , wherein the processing step is physically implemented by one hardware. | 0.507209 |
16. The non-transitory machine-readable storage medium of claim 15 , further including instructions that, when executed on the device, cause the device to: receive a third user input selecting one of the items from the pop-up menu; and activate, in response to the user selecting one of the items from the pop-up menu, the corresponding item. | 16. The non-transitory machine-readable storage medium of claim 15 , further including instructions that, when executed on the device, cause the device to: receive a third user input selecting one of the items from the pop-up menu; and activate, in response to the user selecting one of the items from the pop-up menu, the corresponding item. 17. The non-transitory machine-readable storage medium of claim 16 , further including instructions that, when executed on the device, cause the device to: momentarily alter, in response to the user selecting one of the items from the pop-up menu, a visual characteristic of the corresponding highlighted item. | 0.919446 |
8. The apparatus according to claim 5 , wherein when the third setting item is set in the processing setting information, said typeface setting processing unit executes, based on the setting contents: reference processing for referring to a typeface table, which manages substitute typeface information including a typeface and a substitute typeface as a substitute for the typeface, based on the typeface information of the first character and the typeface information of the second character, which are located before and after the position of the input character; selection processing for selecting the substitute typeface information from the substitute typeface information referred to by the reference processing; and specifying processing for specifying a character that uses the substitute typeface information selected by said selection processing, and said typeface setting processing unit settles the substitute typeface information selected by the selection processing as typeface information of the character specified by the specifying processing. | 8. The apparatus according to claim 5 , wherein when the third setting item is set in the processing setting information, said typeface setting processing unit executes, based on the setting contents: reference processing for referring to a typeface table, which manages substitute typeface information including a typeface and a substitute typeface as a substitute for the typeface, based on the typeface information of the first character and the typeface information of the second character, which are located before and after the position of the input character; selection processing for selecting the substitute typeface information from the substitute typeface information referred to by the reference processing; and specifying processing for specifying a character that uses the substitute typeface information selected by said selection processing, and said typeface setting processing unit settles the substitute typeface information selected by the selection processing as typeface information of the character specified by the specifying processing. 9. The apparatus according to claim 8 , further comprising: a substitute setting unit adapted to, when said typeface setting processing unit searches for the substitute typeface information, set a character that uses the retrieved substitute typeface information. | 0.69834 |
32. The system of claim 28 , wherein the characteristics of the information being delivered is a function of the service. | 32. The system of claim 28 , wherein the characteristics of the information being delivered is a function of the service. 38. The system of claim 32 , wherein the function includes a stock quotation service function. | 0.946976 |
7. The system of claim 1 , further comprising the rules component employs at least one of the following operations: 1) add an object; 2) delete object; 3) accept change; or 4) reject change. | 7. The system of claim 1 , further comprising the rules component employs at least one of the following operations: 1) add an object; 2) delete object; 3) accept change; or 4) reject change. 8. The system of claim 7 , the operation add an object is implemented to at least one of the following: an object that is detached; an object that is already added; an object that is unchanged/modified; or an object that is deleted. | 0.863902 |
1. A non-transitory computer-readable medium embodying a program executable in at least one computing device, comprising: code that obtains a plurality of dialogue search queries from a plurality of users; code that, for individual ones of the plurality of dialogue search queries, determines a respective plurality of clips from a plurality of video content features by executing a respective dialogue search based at least in part on the individual ones of the plurality of dialogue search queries; code that sends a corresponding dialogue search result listing of the respective plurality of clips to respective ones of the plurality of users; code that determines that the plurality of users has expressed an interest in at least two of the clips of one of the plurality of video content features via the corresponding dialogue search result listing; and code that generates an abridgement of the one of the plurality of video content features based at least in part on the interest in the at least two of the clips, the abridgement including a first portion of the one of the plurality of video content features and a second portion of the one of the plurality of video content features and excluding a third portion of the one of the plurality of video content features that is between the first portion and the second portion. | 1. A non-transitory computer-readable medium embodying a program executable in at least one computing device, comprising: code that obtains a plurality of dialogue search queries from a plurality of users; code that, for individual ones of the plurality of dialogue search queries, determines a respective plurality of clips from a plurality of video content features by executing a respective dialogue search based at least in part on the individual ones of the plurality of dialogue search queries; code that sends a corresponding dialogue search result listing of the respective plurality of clips to respective ones of the plurality of users; code that determines that the plurality of users has expressed an interest in at least two of the clips of one of the plurality of video content features via the corresponding dialogue search result listing; and code that generates an abridgement of the one of the plurality of video content features based at least in part on the interest in the at least two of the clips, the abridgement including a first portion of the one of the plurality of video content features and a second portion of the one of the plurality of video content features and excluding a third portion of the one of the plurality of video content features that is between the first portion and the second portion. 6. The non-transitory computer-readable medium of claim 1 , further comprising code that recommends another video content feature to at least one of the plurality of users based at least in part on the interest. | 0.538699 |
10. The encoding apparatus according to claim 9 , wherein the generating unit is configured to: interchange first n characters in the first information group and the n boundary characters, delete the n boundary characters, and record, in at least first n bytes of the first information group, the type information and the position information that are of the n boundary characters to obtain the second information group, wherein the second information group comprises the m bytes; or delete the n boundary characters to obtain n idle bytes; move backward a character preceding the n th idle byte in the n idle bytes, so that remaining m-n characters in the first information group are recorded in consecutive bytes; and record, in at least first n bytes of the first information group, the type information and the position information that are of the n boundary characters to obtain the second information group, wherein the second information group comprises the m bytes. | 10. The encoding apparatus according to claim 9 , wherein the generating unit is configured to: interchange first n characters in the first information group and the n boundary characters, delete the n boundary characters, and record, in at least first n bytes of the first information group, the type information and the position information that are of the n boundary characters to obtain the second information group, wherein the second information group comprises the m bytes; or delete the n boundary characters to obtain n idle bytes; move backward a character preceding the n th idle byte in the n idle bytes, so that remaining m-n characters in the first information group are recorded in consecutive bytes; and record, in at least first n bytes of the first information group, the type information and the position information that are of the n boundary characters to obtain the second information group, wherein the second information group comprises the m bytes. 12. The encoding apparatus according to claim 10 , wherein the adding unit is configured to: if n bytes occupied by the n boundary characters are not sufficient to record the type information and the position information that are of the n boundary characters, add the header information to the second information group according to the type that is of the first information group and determined by the character attributes of the characters in the first information group, wherein the header information is used to mark the type of the first information group. | 0.781027 |
16. A system for dynamically generating a survey result(s) comprising: a profile management module configured to store and manage each registered user's one or more profile(s), preferences and relational connections or dynamic relationships at a central server; a Human Operating System (HOS) configured for each user to manage plurality of activities, profiles, applications, services, actions, transactions, groups, search, share, communication, contents and connections; a communication interface configured to present one or more domain or subject or taxonomy specific survey forms to user and to receive, via categories survey forms, a plurality of categories survey data or selections from the user, wherein survey data or selections relate or map, for each of plurality of different categories of user data for sharing with one or more other connected users who can access that category of user data and customization, personalization and configuration data utilize for customization of user's Human Operating System (HOS) including dynamically create one or more social networks, establishing communication and share selective one or more user resources or profiles with one or more other connected users, customize search and match, e-commerce, receive customized advertisements, applications and services lists and contents; a user profile management module, coupled to the communication interface, configured to update survey data and survey analysis to the related categories profile(s) of the user to apply or use the survey data for customization, personalization and configuration of each user's Human Operating System (HOS); and a survey results engine, coupled to the user profile management module, configured to generate and present a survey results to the user, wherein survey results comprises a details of customization, personalization and configuration of each user's Human Operating System (HOS) and which other connected users can access which categories of user data based on the survey data or selections. | 16. A system for dynamically generating a survey result(s) comprising: a profile management module configured to store and manage each registered user's one or more profile(s), preferences and relational connections or dynamic relationships at a central server; a Human Operating System (HOS) configured for each user to manage plurality of activities, profiles, applications, services, actions, transactions, groups, search, share, communication, contents and connections; a communication interface configured to present one or more domain or subject or taxonomy specific survey forms to user and to receive, via categories survey forms, a plurality of categories survey data or selections from the user, wherein survey data or selections relate or map, for each of plurality of different categories of user data for sharing with one or more other connected users who can access that category of user data and customization, personalization and configuration data utilize for customization of user's Human Operating System (HOS) including dynamically create one or more social networks, establishing communication and share selective one or more user resources or profiles with one or more other connected users, customize search and match, e-commerce, receive customized advertisements, applications and services lists and contents; a user profile management module, coupled to the communication interface, configured to update survey data and survey analysis to the related categories profile(s) of the user to apply or use the survey data for customization, personalization and configuration of each user's Human Operating System (HOS); and a survey results engine, coupled to the user profile management module, configured to generate and present a survey results to the user, wherein survey results comprises a details of customization, personalization and configuration of each user's Human Operating System (HOS) and which other connected users can access which categories of user data based on the survey data or selections. 18. The system as claimed in claim 16 , wherein enabling said user to search one or more domain or subject specific survey forms based on one or more criteria. | 0.628727 |
8. A subscriber unit comprising: means for extracting a plurality of features of a speech signal, the plurality of features being used for voice recognition; means for detecting voice activity within the speech signal, dividing the speech signal into speech frames and non-speech frames, wherein speech is detected in the speech frames and speech is not detected in the non-speech frames, providing an indication of detected voice activity, and generating output including the speech frames and excluding the non-speech frames; and means for transmitting the indication of detected voice activity and the output that includes the speech frames and excludes the non-speech frames over a wireless network to a voice recognition device in a distributed voice recognition system, wherein the indication of detected voice activity is transmitted over a separate channel than the output to identify the non-speech frames that were excluded from the output. | 8. A subscriber unit comprising: means for extracting a plurality of features of a speech signal, the plurality of features being used for voice recognition; means for detecting voice activity within the speech signal, dividing the speech signal into speech frames and non-speech frames, wherein speech is detected in the speech frames and speech is not detected in the non-speech frames, providing an indication of detected voice activity, and generating output including the speech frames and excluding the non-speech frames; and means for transmitting the indication of detected voice activity and the output that includes the speech frames and excludes the non-speech frames over a wireless network to a voice recognition device in a distributed voice recognition system, wherein the indication of detected voice activity is transmitted over a separate channel than the output to identify the non-speech frames that were excluded from the output. 12. The subscriber unit of claim 8 , further comprising: means for receiving from the voice recognition device in the distributed voice recognition system at least one word or command estimated based on the indication of detected voice activity and the plurality of features. | 0.585897 |
9. A system for automated interpretation of well log data indicative of physical attributes of a portion of a subterranean formation comprising: a data storage device, configured and arranged to store the well log data; a processor, configured and arranged to execute machine executable instructions to partition the well log data into segments, each segment representing a respective contiguous portion of the extent of the logged well; define a membership function for each segment, the membership function defining a degree to which each segment belongs to a defined set; determine, based on attribute values derived from previously interpreted depositional units, and the membership functions, a depositional type for each segment; and converting, via computer, the well log data to shale volume data, wherein the shale volume data are represented as a series of numerical values V sh =s 1 , s 2 , . . . , s i , where s i is an average of the shale volume data within the ith segment. | 9. A system for automated interpretation of well log data indicative of physical attributes of a portion of a subterranean formation comprising: a data storage device, configured and arranged to store the well log data; a processor, configured and arranged to execute machine executable instructions to partition the well log data into segments, each segment representing a respective contiguous portion of the extent of the logged well; define a membership function for each segment, the membership function defining a degree to which each segment belongs to a defined set; determine, based on attribute values derived from previously interpreted depositional units, and the membership functions, a depositional type for each segment; and converting, via computer, the well log data to shale volume data, wherein the shale volume data are represented as a series of numerical values V sh =s 1 , s 2 , . . . , s i , where s i is an average of the shale volume data within the ith segment. 10. The system as in claim 9 , further including an input device, configured and arranged for a user to input adjustments to boundaries of the segments. | 0.697816 |
1. A system comprising: a member network server implemented by one or more computer processors, the member network server comprising a member network database stored in machine-readable memory, the member network database storing profiles that represent members in a member network, the profiles comprising endorsements of electronic documents including web pages, and a member network engine programmed to allow users to interact with and participate in the member network, including by classifying particular electronic documents as user endorsed electronic documents by inputting a favorable rating on a control that is displayed simultaneously with a corresponding electronic document; and a search engine server implemented by one or more computer processors, the search engine server comprising an article index stored in machine-readable memory, the article index indexing electronic documents stored at other devices or systems and a search engine programmed to respond to receipt of a query signal that embodies a local search query made by a query-submitting member of the member network by performing operations, the operations including: performing a search of the article index, the search of the article index locating local information responsive to the local search query in the electronic documents indexed by the article index and returning identifiers of the electronic documents in a first local search result set, performing a search of the member network database, the search of the member network database locating endorsements of electronic documents in the member profiles and returning the endorsements in a second local search result set, wherein performing the search of the member network database comprises the search engine communicating with the member network engine to identify selected members in the member network and accessing the member profiles of the selected members to identify the endorsements in the member profiles of the selected members, merging the first local search result set and the second local search result set to form a final local search result set, wherein ranking of the electronic documents in the final local search result set differs from ranking of the electronic documents in the first local search result set and embodies the electronic document endorsements in the member profiles of the selected members, and providing the final local search result set for presentation to the query-submitting member of the member network, wherein the presentation identifies, with particular ones of the final local search result set, the selected members in the member network identified as having provided endorsements for electronic documents that correspond to the particular ones of the final local search result set. | 1. A system comprising: a member network server implemented by one or more computer processors, the member network server comprising a member network database stored in machine-readable memory, the member network database storing profiles that represent members in a member network, the profiles comprising endorsements of electronic documents including web pages, and a member network engine programmed to allow users to interact with and participate in the member network, including by classifying particular electronic documents as user endorsed electronic documents by inputting a favorable rating on a control that is displayed simultaneously with a corresponding electronic document; and a search engine server implemented by one or more computer processors, the search engine server comprising an article index stored in machine-readable memory, the article index indexing electronic documents stored at other devices or systems and a search engine programmed to respond to receipt of a query signal that embodies a local search query made by a query-submitting member of the member network by performing operations, the operations including: performing a search of the article index, the search of the article index locating local information responsive to the local search query in the electronic documents indexed by the article index and returning identifiers of the electronic documents in a first local search result set, performing a search of the member network database, the search of the member network database locating endorsements of electronic documents in the member profiles and returning the endorsements in a second local search result set, wherein performing the search of the member network database comprises the search engine communicating with the member network engine to identify selected members in the member network and accessing the member profiles of the selected members to identify the endorsements in the member profiles of the selected members, merging the first local search result set and the second local search result set to form a final local search result set, wherein ranking of the electronic documents in the final local search result set differs from ranking of the electronic documents in the first local search result set and embodies the electronic document endorsements in the member profiles of the selected members, and providing the final local search result set for presentation to the query-submitting member of the member network, wherein the presentation identifies, with particular ones of the final local search result set, the selected members in the member network identified as having provided endorsements for electronic documents that correspond to the particular ones of the final local search result set. 11. The system of claim 1 , wherein the final local search result set comprises annotations indicative of the electronic document endorsements identified in the member profiles of the selected members. | 0.51925 |
11. A system comprising: a memory; and a processing device operatively coupled to the memory, to: receive a job request to allocate one or more resources in a resource environment to a job, the job being related to an application, the job request specifying the job using a first description language; extract one or more tags from the job request, the one or more tags at least one of a handling parameter of the job or a feature of the application, wherein the one or more tags are in a declarative tag format with information to describe the at least one of the handling parameter or the feature of the application without specifying a specific quantity of resources to be used in the resource environment; translate the one or more tags into a resource requirement in a second format that can be processed by a job scheduler executing by the processing device, wherein, to translate the processing device is to use mapping information that maps the one or more tags into the resource requirement that can be processed by the job scheduler; and allocate, by the job scheduler, one or more resources in the resource environment to the job in view of the resource requirement, wherein, to allocate one or more resources in the resource environment to the job in view of the one or more tags, the processing device is to: determine whether one or more tags indicate data for the job is secure data; instantiate a container for the job if one or more tags indicate that the data for the job is not secure data; and instantiate a virtual machine for the job if one or more tags indicate that the data for the job is secure data. | 11. A system comprising: a memory; and a processing device operatively coupled to the memory, to: receive a job request to allocate one or more resources in a resource environment to a job, the job being related to an application, the job request specifying the job using a first description language; extract one or more tags from the job request, the one or more tags at least one of a handling parameter of the job or a feature of the application, wherein the one or more tags are in a declarative tag format with information to describe the at least one of the handling parameter or the feature of the application without specifying a specific quantity of resources to be used in the resource environment; translate the one or more tags into a resource requirement in a second format that can be processed by a job scheduler executing by the processing device, wherein, to translate the processing device is to use mapping information that maps the one or more tags into the resource requirement that can be processed by the job scheduler; and allocate, by the job scheduler, one or more resources in the resource environment to the job in view of the resource requirement, wherein, to allocate one or more resources in the resource environment to the job in view of the one or more tags, the processing device is to: determine whether one or more tags indicate data for the job is secure data; instantiate a container for the job if one or more tags indicate that the data for the job is not secure data; and instantiate a virtual machine for the job if one or more tags indicate that the data for the job is secure data. 13. The system of claim 11 , wherein the one or more tags are embedded in metadata of the job request, the metadata being in a second description language different from the first description language. | 0.754258 |
11. A non-transitory computer readable medium, comprising executable instructions to: access a website having an associated document retrieval component; retrieve, by the document retrieval component, reports related to the website from a business intelligence system, each report being automatically retrieved from a data source and structured in accordance with a report schema that specifies a form in which information contained within such report should be presented; and concurrently display the website and data characterizing the retrieved reports; wherein specifications used by the document retrieve component to retrieve the reports are collected by: parsing the website to identify logical sections of the website from which to extract keywords, presenting at least a portion of the sections to the user for selection of one or more but not all of the sections of the website, and extracting keywords from the selected section(s) by the user, the specifications comprising at least a portion of the extracted keywords, wherein the specifications for the document retrieval component are selected from one or more of how many reports to display, a minimum match threshold that indicates how closely a report must be associated with the set of keywords in order to be displayed, one or more website sections from which to retrieve a set of keywords describing the website and a look-and-feel for the document retrieval component. | 11. A non-transitory computer readable medium, comprising executable instructions to: access a website having an associated document retrieval component; retrieve, by the document retrieval component, reports related to the website from a business intelligence system, each report being automatically retrieved from a data source and structured in accordance with a report schema that specifies a form in which information contained within such report should be presented; and concurrently display the website and data characterizing the retrieved reports; wherein specifications used by the document retrieve component to retrieve the reports are collected by: parsing the website to identify logical sections of the website from which to extract keywords, presenting at least a portion of the sections to the user for selection of one or more but not all of the sections of the website, and extracting keywords from the selected section(s) by the user, the specifications comprising at least a portion of the extracted keywords, wherein the specifications for the document retrieval component are selected from one or more of how many reports to display, a minimum match threshold that indicates how closely a report must be associated with the set of keywords in order to be displayed, one or more website sections from which to retrieve a set of keywords describing the website and a look-and-feel for the document retrieval component. 12. The computer readable medium of claim 11 , further comprising executable instructions to: authenticate a website user accessing the website; return data access permissions of the user; and filtering the retrieved reports based on the data access permissions of the user. | 0.526875 |
12. The method of claim 11 , further including: displaying on the computer system display a template instance tree comprising a template instance node, wherein the template instance node represents the template instance. | 12. The method of claim 11 , further including: displaying on the computer system display a template instance tree comprising a template instance node, wherein the template instance node represents the template instance. 13. The method of claim 12 , further comprising: displaying on the computer system display a constraint node as a descendant of the template instance node in the template instance tree, wherein the constraint node represents a constraint associated with the template instance; and displaying on the computer system display a design object node in the tree as a descendant of the constraint node, wherein the design object node represents the design object. | 0.862253 |
1. A computer-implemented method, comprising: on a video content analysis device: delineating video data into intention units; extracting features from the video data, wherein each feature is used to estimate one or more human intentions wherein the extracting features includes extracting attention-specific features, and wherein each attention-specific feature represents one dimension of human attention, and wherein the extracting attention-specific features includes analyzing four dimensions of attention (DoA): an attention stability, an attention energy, an attention window, and a camera pattern; classifying the intention units into intention categories; and selecting a number of categories to be the intention categories and defining each of the intention categories according to a type of video content characteristic of one of the human intentions, wherein the intention categories include a static scene category, a dynamic event category, a close-un view category, a beautiful scenery category, a switch record category, a longtime record category, and a just record category. | 1. A computer-implemented method, comprising: on a video content analysis device: delineating video data into intention units; extracting features from the video data, wherein each feature is used to estimate one or more human intentions wherein the extracting features includes extracting attention-specific features, and wherein each attention-specific feature represents one dimension of human attention, and wherein the extracting attention-specific features includes analyzing four dimensions of attention (DoA): an attention stability, an attention energy, an attention window, and a camera pattern; classifying the intention units into intention categories; and selecting a number of categories to be the intention categories and defining each of the intention categories according to a type of video content characteristic of one of the human intentions, wherein the intention categories include a static scene category, a dynamic event category, a close-un view category, a beautiful scenery category, a switch record category, a longtime record category, and a just record category. 3. The computer-implemented method as recited in claim 1 , wherein the delineating video data into intention units further includes decomposing a video structure into sub-shots based on camera motion thresholds. | 0.60481 |
20. A method for performing a speech-recognition dictionary refinement procedure, comprising: utilizing a database analyzer to identify first vocabulary words that are present in a training database, and to identify second vocabulary words that are not present in said training database, said first vocabulary words and said second vocabulary words being from an initial dictionary; separating first pronunciations of said first vocabulary words into initial short word pronunciations and initial long word pronunciations by utilizing a relevance module that then performs a cumulative threshold procedure upon said initial short word pronunciations to create final short word pronunciations that are used to populate a refined dictionary, said relevance module also performing a standardized distance threshold procedure upon said initial long word pronunciations to create final long word pronunciations that are used to populate said refined dictionary; and computing plurality pronunciations for second pronunciations of said second vocabulary words by utilizing a consensus module that then compares said plurality pronunciations to said second pronunciations to identify final consensus pronunciations that are used to populate said refined dictionary, said consensus module determining whether said plurality pronunciations are validly represented in said second pronunciations. | 20. A method for performing a speech-recognition dictionary refinement procedure, comprising: utilizing a database analyzer to identify first vocabulary words that are present in a training database, and to identify second vocabulary words that are not present in said training database, said first vocabulary words and said second vocabulary words being from an initial dictionary; separating first pronunciations of said first vocabulary words into initial short word pronunciations and initial long word pronunciations by utilizing a relevance module that then performs a cumulative threshold procedure upon said initial short word pronunciations to create final short word pronunciations that are used to populate a refined dictionary, said relevance module also performing a standardized distance threshold procedure upon said initial long word pronunciations to create final long word pronunciations that are used to populate said refined dictionary; and computing plurality pronunciations for second pronunciations of said second vocabulary words by utilizing a consensus module that then compares said plurality pronunciations to said second pronunciations to identify final consensus pronunciations that are used to populate said refined dictionary, said consensus module determining whether said plurality pronunciations are validly represented in said second pronunciations. 25. The method of claim 20 wherein said relevance module performs a forced alignment procedure upon said first pronunciations to associate database words from said training database with most closely aligned of said first pronunciations. | 0.575758 |
1. A computer-implemented method for modifying a user experience associated with a software product, comprising: collecting behavioral metrics that are associated with a user's emotional state while the user is using the software product; determining, using a computer, the emotional state based on the collected behavioral metrics; and modifying the user experience based on the determined emotional state by changing a path in a process associated with the software product, wherein said changing involves modifying a flow in the software product so that at least a different user interface is presented based on the emotional state, wherein the different user interface includes additional content in the software product that enables the user to provide user inputs to the document with ease. | 1. A computer-implemented method for modifying a user experience associated with a software product, comprising: collecting behavioral metrics that are associated with a user's emotional state while the user is using the software product; determining, using a computer, the emotional state based on the collected behavioral metrics; and modifying the user experience based on the determined emotional state by changing a path in a process associated with the software product, wherein said changing involves modifying a flow in the software product so that at least a different user interface is presented based on the emotional state, wherein the different user interface includes additional content in the software product that enables the user to provide user inputs to the document with ease. 15. The method of claim 1 , wherein changing the path in the process associated with the software product involves modifying a flow in the software product so that a personalized marketing offer, a different guidance, different functionality, or a different feature is presented based on the emotional state. | 0.661486 |
1. A computer implemented method, comprising: identifying a set of documents from electronically stored information (ESI), wherein the set of documents is responsive to a request for electronic discovery; performing an electronic analysis of the set of documents, wherein the performing the electronic analysis further comprises identifying attributes of the set of documents; storing results of the electronic analysis in a repository of case knowledge, wherein the results comprise the attributes; automatically generating search parameters for at least one search query based on the repository of case knowledge; providing the search parameters as output; identifying an additional set of documents from the ESI, wherein the identifying the additional set of documents comprises performing the at least one search query against the ESI, the at least one search query comprises the search parameters, the additional set of documents is identified by the at least one search query, and the additional set of documents is responsive to the request for electronic discovery; automatically tagging the additional set of documents with an indication that the additional set of documents should be held for litigation; storing the search parameters in the repository of case knowledge; and monitoring use of the repository of case knowledge to produce audit information. | 1. A computer implemented method, comprising: identifying a set of documents from electronically stored information (ESI), wherein the set of documents is responsive to a request for electronic discovery; performing an electronic analysis of the set of documents, wherein the performing the electronic analysis further comprises identifying attributes of the set of documents; storing results of the electronic analysis in a repository of case knowledge, wherein the results comprise the attributes; automatically generating search parameters for at least one search query based on the repository of case knowledge; providing the search parameters as output; identifying an additional set of documents from the ESI, wherein the identifying the additional set of documents comprises performing the at least one search query against the ESI, the at least one search query comprises the search parameters, the additional set of documents is identified by the at least one search query, and the additional set of documents is responsive to the request for electronic discovery; automatically tagging the additional set of documents with an indication that the additional set of documents should be held for litigation; storing the search parameters in the repository of case knowledge; and monitoring use of the repository of case knowledge to produce audit information. 6. The method of claim 1 , wherein the providing the search parameters as output comprises: graphically displaying the search parameters using at least one visual representation. | 0.611631 |
1. A method of generating maintenance reports, the method comprising: in relation to a computer-mediated conversation between users of at least two computers, receiving user input relating to maintenance of a system; determining, with processing circuitry of a mediation computer, a candidate tag representative of a semantic context of the user input, wherein determining the candidate tag comprises: determining the candidate tag in an instance in which the user input relates to an initial message of the conversation based upon a domain within which the user input is provided, wherein the domain is selected from the group consisting of design, manufacturing and maintenance operations of the system within which the user input is provided; and determining the candidate tag in an instance in which the user input relates to an ongoing conversation based upon the semantic context of the conversation including a mapping of words in the conversation to concepts in the respective semantic context or matching of elements in the conversation to elements within a corpus of other conversations; providing an indication of the candidate tag to the user; receiving a response from the user regarding validity of the candidate tag with respect to the semantic context of the user input; and causing the maintenance report to be generated and stored with the maintenance report modified to include the computer-mediated conversation and the candidate tag associated therewith. | 1. A method of generating maintenance reports, the method comprising: in relation to a computer-mediated conversation between users of at least two computers, receiving user input relating to maintenance of a system; determining, with processing circuitry of a mediation computer, a candidate tag representative of a semantic context of the user input, wherein determining the candidate tag comprises: determining the candidate tag in an instance in which the user input relates to an initial message of the conversation based upon a domain within which the user input is provided, wherein the domain is selected from the group consisting of design, manufacturing and maintenance operations of the system within which the user input is provided; and determining the candidate tag in an instance in which the user input relates to an ongoing conversation based upon the semantic context of the conversation including a mapping of words in the conversation to concepts in the respective semantic context or matching of elements in the conversation to elements within a corpus of other conversations; providing an indication of the candidate tag to the user; receiving a response from the user regarding validity of the candidate tag with respect to the semantic context of the user input; and causing the maintenance report to be generated and stored with the maintenance report modified to include the computer-mediated conversation and the candidate tag associated therewith. 5. A method according to claim 1 further comprising storing the maintenance report including the user input and an associated tag. | 0.659708 |
2. The method of claim 1 wherein the scheduling classifications include one or more print job classifications that are used to classify individual print jobs. | 2. The method of claim 1 wherein the scheduling classifications include one or more print job classifications that are used to classify individual print jobs. 3. The method of claim 2 wherein at least one print job classification for at least one individual print job is automatically determined responsive to the corresponding print job description. | 0.898463 |
15. An apparatus comprising: a processor; and storage for storing data and a plurality of instructions for the processor, wherein the apparatus is configured to execute the plurality of instructions to control the processor to: semantically parse a received utterance by semantic role labeling to generate at least one semantic role label for only head words of phrases in the received utterance; extract a predicate from the semantically parsed utterance, identify a syntactic path between head words and their respective extracted predicate, and estimate an intent based on the extracted predicate and based on predicate/argument pairs, each predicate argument pair comprising a predicate verb and an argument which completes the predicate verb. | 15. An apparatus comprising: a processor; and storage for storing data and a plurality of instructions for the processor, wherein the apparatus is configured to execute the plurality of instructions to control the processor to: semantically parse a received utterance by semantic role labeling to generate at least one semantic role label for only head words of phrases in the received utterance; extract a predicate from the semantically parsed utterance, identify a syntactic path between head words and their respective extracted predicate, and estimate an intent based on the extracted predicate and based on predicate/argument pairs, each predicate argument pair comprising a predicate verb and an argument which completes the predicate verb. 20. The apparatus of claim 15 , wherein the apparatus is further configured to extract at least one argument from the semantically parsed utterance and estimate at least one associated named entity using the at least one argument. | 0.542012 |
12. The computer according to claim 11 , wherein said output module outputs data indicating that said target-language word in said data on the translation is translated based on said modified word, together with said data on translation. | 12. The computer according to claim 11 , wherein said output module outputs data indicating that said target-language word in said data on the translation is translated based on said modified word, together with said data on translation. 13. The computer according to claim 12 , further comprising a display for displaying the translation in which said target-language word is emphasized based on said data on the translation that is provided from said output module. | 0.934696 |
8. The system of claim 7 , wherein the first standardization function is a user defined function. | 8. The system of claim 7 , wherein the first standardization function is a user defined function. 9. The system of claim 8 , wherein the user defined function receives the first context of the first data value as a parameter. | 0.972198 |
3. The computer-generated user interface control of claim 1 , wherein the next page tab is displayed only if a total number of the page tabs exceeds a number of page tabs that is simultaneously displayed within a viewable area of an application window. | 3. The computer-generated user interface control of claim 1 , wherein the next page tab is displayed only if a total number of the page tabs exceeds a number of page tabs that is simultaneously displayed within a viewable area of an application window. 4. The computer-generated user interface control of claim 3 , further comprising: a new page tab displayed at an end of one of: the horizontal column of the page tabs and the vertical column of the page tabs, the new page tab operative to create a new one of the document pages and to create a new page tab corresponding to the new one of the document pages in response to being selected. | 0.938582 |
1. A method for presenting FLASH presentations comprising: accessing a FLASH presentation (FLAPRE) markup language (FLML) document representing a user-created FLASH presentation, wherein the user-created FLASH presentation comprises at least a plurality of content elements and format definitions; translating the FLML document into code usable by a FLASH animation engine, wherein the translating of the FLML document comprises validating the FLML document against a predefined document model; and rendering the translated FLML document in a display area, wherein FLASH refers to a format in conformance with the ADOBE FLASH specification as it existed at a time of this disclosure's filing, wherein the accessing, translating, and rendering of the FLML document is performed by a FLAPRE player, wherein the FLAPRE player is a FLASH software application, wherein the FLAPRE player is FLASH BASED and cannot render a FLASH presentation encoded within a .SWF file, wherein the rendering of the translated FLML document further comprises: determining a need to render a content element of the FLASH presentation, wherein data associated with said content element is contained in an electronic file external to and separate from the FLML document, wherein a location of the electronic file is defined within the FLML document; and accessing the data of the electronic file in real-time and in response to the determined need. | 1. A method for presenting FLASH presentations comprising: accessing a FLASH presentation (FLAPRE) markup language (FLML) document representing a user-created FLASH presentation, wherein the user-created FLASH presentation comprises at least a plurality of content elements and format definitions; translating the FLML document into code usable by a FLASH animation engine, wherein the translating of the FLML document comprises validating the FLML document against a predefined document model; and rendering the translated FLML document in a display area, wherein FLASH refers to a format in conformance with the ADOBE FLASH specification as it existed at a time of this disclosure's filing, wherein the accessing, translating, and rendering of the FLML document is performed by a FLAPRE player, wherein the FLAPRE player is a FLASH software application, wherein the FLAPRE player is FLASH BASED and cannot render a FLASH presentation encoded within a .SWF file, wherein the rendering of the translated FLML document further comprises: determining a need to render a content element of the FLASH presentation, wherein data associated with said content element is contained in an electronic file external to and separate from the FLML document, wherein a location of the electronic file is defined within the FLML document; and accessing the data of the electronic file in real-time and in response to the determined need. 3. The method of claim 1 , wherein the translating of the FLML document is performed by a FLML interpreter. | 0.691363 |
1. A method for identifying questionable content in a social network website, the social network website having therein content that has been posted in the social network website by a first user, the questionable content being identified in response to the first user performing steps of becoming a friend in the social network website to a second user, the method comprising: receiving by a processor the content that has been posted in the social network website by the first user; receiving by the processor an identification of the second user; receiving, by the processor, private information associated with the second user from a source of private information about the second user; receiving, by the processor, public information associated with the second user from a source of public information about the second user; identifying by the processor, based upon the received content that has been posted in the social network website by the first user, the received private information and the received public information, at least a part of the content that has been posted in the social network website by the first user as the questionable content; and indicating by the processor, to the first user, the identified questionable content. | 1. A method for identifying questionable content in a social network website, the social network website having therein content that has been posted in the social network website by a first user, the questionable content being identified in response to the first user performing steps of becoming a friend in the social network website to a second user, the method comprising: receiving by a processor the content that has been posted in the social network website by the first user; receiving by the processor an identification of the second user; receiving, by the processor, private information associated with the second user from a source of private information about the second user; receiving, by the processor, public information associated with the second user from a source of public information about the second user; identifying by the processor, based upon the received content that has been posted in the social network website by the first user, the received private information and the received public information, at least a part of the content that has been posted in the social network website by the first user as the questionable content; and indicating by the processor, to the first user, the identified questionable content. 9. The method of claim 1 , wherein the source of public information comprises one of: (a) one or more emails sent by the second user; (b) one or more micro blogging posts sent by the second user; (c) one or more articles by the second user; (d) one or more blogs by the second user; (e) one or more books by the second user; (f) one or more social network site wall posts by the second user; or (g) any combination thereof. | 0.5 |
7. A computer program product for determining digital content sensitivity comprising a non-transitory computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising: computer usable program code configured to identify a plurality of tags from a first set of tagged documents in a first repository; computer usable program code configured to identify a plurality of tags from a second set of tagged documents in a second repository, wherein access to documents in the second repository is more restrictive than access to documents in the first repository; computer usable program code configured to, for each of a plurality of tags in at least one of the first set and the second set: determine a ratio of tag instances in the second repository to tag instances in the first repository; determine whether the ratio exceeds a previously determined threshold; when the threshold is less than the previously determined ratio, change an indicator of at least of one tagged document associated with the tag that indicates that the tagged document is not likely to contain sensitive content; and when the threshold exceeds the previously determined ratio, notify a user via a user interface of a computing device, wherein the notifying confirms that the tagged document associated with the tag contains sensitive information, and responsive to a positive response by the user input via the user interface, change the indicator of at least one tagged document associated with the tag that indicates that the tagged document is likely to contain sensitive content. | 7. A computer program product for determining digital content sensitivity comprising a non-transitory computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising: computer usable program code configured to identify a plurality of tags from a first set of tagged documents in a first repository; computer usable program code configured to identify a plurality of tags from a second set of tagged documents in a second repository, wherein access to documents in the second repository is more restrictive than access to documents in the first repository; computer usable program code configured to, for each of a plurality of tags in at least one of the first set and the second set: determine a ratio of tag instances in the second repository to tag instances in the first repository; determine whether the ratio exceeds a previously determined threshold; when the threshold is less than the previously determined ratio, change an indicator of at least of one tagged document associated with the tag that indicates that the tagged document is not likely to contain sensitive content; and when the threshold exceeds the previously determined ratio, notify a user via a user interface of a computing device, wherein the notifying confirms that the tagged document associated with the tag contains sensitive information, and responsive to a positive response by the user input via the user interface, change the indicator of at least one tagged document associated with the tag that indicates that the tagged document is likely to contain sensitive content. 11. The computer program product of claim 7 , further comprising: computer usable program code configured to utilize a combination of tags and ratios based upon the combination of tags to determine whether each of the tagged documents are to be indicated as likely to contain sensitive information. | 0.630185 |
1. An information processing apparatus comprising: a memory; and at least one processor that executes a computer program in the memory to control the information processing apparatus to function as units comprising: an obtaining unit configured to obtain information corresponding to an editing portion which is a difference between an edited document and an original document; a specifying unit configured to specify a form of representation of objects included in the original document; a converting unit configured to convert the information corresponding to the editing portion so that a form of representation of the editing portion conforms with the specified form of representation of the objects included in the original document; and an integration unit configured to integrate the converted information corresponding to the editing portion with the original document. | 1. An information processing apparatus comprising: a memory; and at least one processor that executes a computer program in the memory to control the information processing apparatus to function as units comprising: an obtaining unit configured to obtain information corresponding to an editing portion which is a difference between an edited document and an original document; a specifying unit configured to specify a form of representation of objects included in the original document; a converting unit configured to convert the information corresponding to the editing portion so that a form of representation of the editing portion conforms with the specified form of representation of the objects included in the original document; and an integration unit configured to integrate the converted information corresponding to the editing portion with the original document. 9. The information processing apparatus according to claim 1 , wherein the converting unit does not convert the information corresponding to the editing portion in a case where a predetermined condition is met. | 0.582126 |
9. The pivotal bone anchor assembly of claim 1 , wherein the receiver upright arms further comprise inner sidewall surfaces mateable with the closure. | 9. The pivotal bone anchor assembly of claim 1 , wherein the receiver upright arms further comprise inner sidewall surfaces mateable with the closure. 10. The pivotal bone anchor assembly of claim 9 , further comprising the closure and wherein the closure is a two piece closure including an outer portion and an inner portion threadably received in the outer portion, the outer portion including an outer splay control thread configured to threadably engage the upright arms inner sidewall surfaces. | 0.923077 |
1. A method for expanding a seed document in a seed document set, wherein the seed document set comprises at least one seed document, the method comprising: identifying one or more entity words of the seed document in memory by a processor, wherein the one or more identified entity words are words indicating focused entities of the seed document; identifying by the processor, based on each of the one or more identified entity words of the seed document, one or more topic words related to each of the one or more identified entity words, the one or more identified topic words located in the seed document; forming, by the processor, an entity word-topic word pair from each of the one or more identified topic words and each of the one or more identified entity words upon which each of the one or more identified topic words is identified; and obtaining one or more expanded documents by the processor by taking the entity word and topic word in each entity word-topic word pair as key words for web searching at the same time, wherein the expanded documents comprise not only the entity word in the each entity word-topic word pair but also the topic word in the each entity word-topic word pair. | 1. A method for expanding a seed document in a seed document set, wherein the seed document set comprises at least one seed document, the method comprising: identifying one or more entity words of the seed document in memory by a processor, wherein the one or more identified entity words are words indicating focused entities of the seed document; identifying by the processor, based on each of the one or more identified entity words of the seed document, one or more topic words related to each of the one or more identified entity words, the one or more identified topic words located in the seed document; forming, by the processor, an entity word-topic word pair from each of the one or more identified topic words and each of the one or more identified entity words upon which each of the one or more identified topic words is identified; and obtaining one or more expanded documents by the processor by taking the entity word and topic word in each entity word-topic word pair as key words for web searching at the same time, wherein the expanded documents comprise not only the entity word in the each entity word-topic word pair but also the topic word in the each entity word-topic word pair. 3. The method according to claim 1 , wherein the identifying by the processor, based on the each of the one or more identified entity words of the seed document, one or more topic words related to each of the one or more identified entity words further comprises: identifying the one or more topic words based on a frequency of other words than the one or more identified entity words in the seed document and the one or more identified entity words upon which each of the one or more identified topic words is identified appearing in a same sentence in the seed document. | 0.5 |
25. A data storage system, comprising: a cache; a data storage; a dataset access log maintaining entries representing accesses of cached datasets; and a cache management engine linked to the data storage, the cache, and the dataset access log, the cache management engine including a single output back propagation neural network, the cache management engine being programmed to perform a method to train the neural network to evaluate cached datasets, the method comprising: designating multiple predetermined event triggers, each trigger comprising a predetermined event occurring in association with any one of the datasets contained in the cache; in response to the occurrence of an event trigger, the event trigger occurring at a trigger time and in association with a first dataset represented in the dataset access log, consulting the dataset access log to identify a latest access time of the first dataset; establishing one or more training times in an interval from the trigger time to the latest access time; for each training time, storing selected training input including characteristics of the first dataset in a training record, the characteristics having been exhibited by the first dataset at the training time and also storing training output including a representation of value provided by having the first dataset present in the cache to satisfy future requests for access to the first dataset; and according to a predetermined schedule, providing the training input from the training record as input to a single output back propagation neural network yielding a neural network output, and training the neural network according to any difference between the training output and the neural network output. | 25. A data storage system, comprising: a cache; a data storage; a dataset access log maintaining entries representing accesses of cached datasets; and a cache management engine linked to the data storage, the cache, and the dataset access log, the cache management engine including a single output back propagation neural network, the cache management engine being programmed to perform a method to train the neural network to evaluate cached datasets, the method comprising: designating multiple predetermined event triggers, each trigger comprising a predetermined event occurring in association with any one of the datasets contained in the cache; in response to the occurrence of an event trigger, the event trigger occurring at a trigger time and in association with a first dataset represented in the dataset access log, consulting the dataset access log to identify a latest access time of the first dataset; establishing one or more training times in an interval from the trigger time to the latest access time; for each training time, storing selected training input including characteristics of the first dataset in a training record, the characteristics having been exhibited by the first dataset at the training time and also storing training output including a representation of value provided by having the first dataset present in the cache to satisfy future requests for access to the first dataset; and according to a predetermined schedule, providing the training input from the training record as input to a single output back propagation neural network yielding a neural network output, and training the neural network according to any difference between the training output and the neural network output. 26. The system of claim 25, wherein: the method further includes establishing predefined expiration criteria for dataset entries represented in the dataset access log and removing dataset entries meeting the expiration criteria from the log; and the predetermined event triggers include removal of a dataset entry from the log and access of a cached dataset. | 0.503737 |
1. A computer-implemented method comprising: receiving, by a search system, (i) a pixel map corresponding to one or more characters that have been drawn on a display of a client device and (ii) data identifying one or more other characters that were previously recognized by the search system using one or more other pixel maps; recognizing, by the search system, the one or more characters that correspond to the pixel map based on the received pixel map and the one or more other characters; formulating, by the search system, a search that includes the one or more characters and the one or more other characters as a query term; and communicating, by the search system, (i) one or more search results for the search, (ii) data identifying the one or more characters that correspond to the received pixel map, and (iii) data identifying the one or more other characters to the client device that were previously recognized by the search system using the one or more other pixel maps. | 1. A computer-implemented method comprising: receiving, by a search system, (i) a pixel map corresponding to one or more characters that have been drawn on a display of a client device and (ii) data identifying one or more other characters that were previously recognized by the search system using one or more other pixel maps; recognizing, by the search system, the one or more characters that correspond to the pixel map based on the received pixel map and the one or more other characters; formulating, by the search system, a search that includes the one or more characters and the one or more other characters as a query term; and communicating, by the search system, (i) one or more search results for the search, (ii) data identifying the one or more characters that correspond to the received pixel map, and (iii) data identifying the one or more other characters to the client device that were previously recognized by the search system using the one or more other pixel maps. 2. The method of claim 1 , wherein the pixel map is received before a user of the client device initiates the search. | 0.85396 |
10. The method according to claim 1 , further comprises: generating a tree-structured object that selects and orders at least a portion of the set of messages, wherein the at least the portion of the set of messages are selected based on the one or more key events and one or more significant events and are ordered based on a text schema; and refining the tree-structured object based on domain constraints, wherein the alert validation text is generated based on a realization of the tree-structured object. | 10. The method according to claim 1 , further comprises: generating a tree-structured object that selects and orders at least a portion of the set of messages, wherein the at least the portion of the set of messages are selected based on the one or more key events and one or more significant events and are ordered based on a text schema; and refining the tree-structured object based on domain constraints, wherein the alert validation text is generated based on a realization of the tree-structured object. 11. The method according to claim 10 , further comprises: refining the tree-structured object by converting the one or more messages to one or more phrase specifications by: determining whether to combine one or more messages in the tree structure to produce a complex sentence; selecting one or more words to express one or more concepts in the one or more messages and the relations between them; and determining one or more words to refer to one or more entities in at least one of the one or more messages. | 0.891966 |
1. A speech recognition synthesis based encoding/decoding method comprising the steps of: recognizing character information from an input speech signal; detecting first prosody information from said input speech signal; encoding said character information and said first prosody information to acquire code data; transferring or storing the code data; decoding said transferred or stored code data to said character information and said first prosody information; selecting a synthesis unit codebook from a plurality of synthesis unit codebooks in accordance with one of said first prosody information and a specified type of a synthesized speech, the plurality of synthesis unit codebooks storing second prosody information prepared from speech data of different speakers, the selecting step including computing error between the first prosody information and the second prosody information and selecting from said synthesis unit codebooks a synthesis unit codebook which minimizes the error; and synthesizing a speech signal using said character information and the selected said synthesis unit codebook. | 1. A speech recognition synthesis based encoding/decoding method comprising the steps of: recognizing character information from an input speech signal; detecting first prosody information from said input speech signal; encoding said character information and said first prosody information to acquire code data; transferring or storing the code data; decoding said transferred or stored code data to said character information and said first prosody information; selecting a synthesis unit codebook from a plurality of synthesis unit codebooks in accordance with one of said first prosody information and a specified type of a synthesized speech, the plurality of synthesis unit codebooks storing second prosody information prepared from speech data of different speakers, the selecting step including computing error between the first prosody information and the second prosody information and selecting from said synthesis unit codebooks a synthesis unit codebook which minimizes the error; and synthesizing a speech signal using said character information and the selected said synthesis unit codebook. 6. The method according to claim 1, wherein said transferring/storing step includes the step of transferring or storing select information indicating the specified type of a synthesized speech. | 0.675937 |
19. The method of claim 18 further comprising converting the language text string to the Latin-based representation. | 19. The method of claim 18 further comprising converting the language text string to the Latin-based representation. 21. The method of claim 19 wherein the Latin-based representation comprises a set of Latin characters, wherein a Latin character represents a radical of the language text string. | 0.915544 |
1. A computer-implemented method comprising: decomposing, by at least one processor of a computer system, a search query that includes three or more words into a plurality of candidate phrasifications, including different groupings of words of the search query, each candidate phrasification comprising a disjoint union of component phrases, and each component phrase including at least one word or related word of the search query; scoring, by at least one of the processors of the computer system, at least two of the candidate phrasifications, wherein the candidate phrasifications include one or more component phrases, and wherein the scoring is based on a probability of occurrence of each of the candidate phrasification's component phrases, and is based on the number of component phrases constituting the candidate phrasification, wherein candidate phrasifications having relatively fewer component phrases are weighted higher than candidate phrasifications having relatively more component phrases; selecting, by at least one of the processors of the computer system and based on scores of the candidate phrasifications, a subset of the candidate phrasification; and executing a query of a document indexing, by at least one of the processors of the computer system, using the selected subset of candidate phrasifications, wherein the query comprises the component phrases of each selected phrasification. | 1. A computer-implemented method comprising: decomposing, by at least one processor of a computer system, a search query that includes three or more words into a plurality of candidate phrasifications, including different groupings of words of the search query, each candidate phrasification comprising a disjoint union of component phrases, and each component phrase including at least one word or related word of the search query; scoring, by at least one of the processors of the computer system, at least two of the candidate phrasifications, wherein the candidate phrasifications include one or more component phrases, and wherein the scoring is based on a probability of occurrence of each of the candidate phrasification's component phrases, and is based on the number of component phrases constituting the candidate phrasification, wherein candidate phrasifications having relatively fewer component phrases are weighted higher than candidate phrasifications having relatively more component phrases; selecting, by at least one of the processors of the computer system and based on scores of the candidate phrasifications, a subset of the candidate phrasification; and executing a query of a document indexing, by at least one of the processors of the computer system, using the selected subset of candidate phrasifications, wherein the query comprises the component phrases of each selected phrasification. 19. The method of claim 1 , wherein the phrase tree is rooted by an OR node. | 0.661993 |
66. In an apparatus including a keyboard including a plurality of selectable polysemous symbols, a processor and a memory configured to store a plurality of symbol sequences in association with at least one word, sentence, phoneme, message, letter, morpheme, command and/or phrase in an interactive dictionary database, wherein upon determining that at least one word has been output via a spelling mode, performing a method comprising: determining, via the processor, if the at least one spelled word is included in stored a table of spelled words; storing, in the memory, the at least one spelled word in the table upon determining that the at least one spelled word is not included in the stored table of spelled words; incrementing a frequency count corresponding to the at least one spelled word upon determining that the at least one spelled word is included in the stored table of spelled words; determining, via the processor, upon the frequency count reaching a threshold count, if the interactive dictionary database includes a symbol sequence associated with the stored the at least one spelled word; prompting a user, upon determining that the interactive dictionary database does not include a symbol sequence associated with the stored the at least one spelled word, to input via the keyboard and to store in the memory the at least one spelled word in the interactive dictionary database in association with a symbol sequence, the at least one spelled word and associated symbol sequence being further stored in association with at least one of an active and an inactive status, wherein when an inactive status is assigned to the associated symbol sequence, a corresponding sequence of previously selectable symbols of the keyboard is rendered unselectable; and displaying a message to the user, upon determining that the interactive dictionary database includes a symbol sequence associated with the stored the at least one spelled word, to use the symbol sequence for subsequent output of the at least one spelled word. | 66. In an apparatus including a keyboard including a plurality of selectable polysemous symbols, a processor and a memory configured to store a plurality of symbol sequences in association with at least one word, sentence, phoneme, message, letter, morpheme, command and/or phrase in an interactive dictionary database, wherein upon determining that at least one word has been output via a spelling mode, performing a method comprising: determining, via the processor, if the at least one spelled word is included in stored a table of spelled words; storing, in the memory, the at least one spelled word in the table upon determining that the at least one spelled word is not included in the stored table of spelled words; incrementing a frequency count corresponding to the at least one spelled word upon determining that the at least one spelled word is included in the stored table of spelled words; determining, via the processor, upon the frequency count reaching a threshold count, if the interactive dictionary database includes a symbol sequence associated with the stored the at least one spelled word; prompting a user, upon determining that the interactive dictionary database does not include a symbol sequence associated with the stored the at least one spelled word, to input via the keyboard and to store in the memory the at least one spelled word in the interactive dictionary database in association with a symbol sequence, the at least one spelled word and associated symbol sequence being further stored in association with at least one of an active and an inactive status, wherein when an inactive status is assigned to the associated symbol sequence, a corresponding sequence of previously selectable symbols of the keyboard is rendered unselectable; and displaying a message to the user, upon determining that the interactive dictionary database includes a symbol sequence associated with the stored the at least one spelled word, to use the symbol sequence for subsequent output of the at least one spelled word. 69. The method of claim 66 , wherein the display of the message includes display of the symbol sequence and associated rationale matching the at least one spelled word. | 0.55775 |
1. A method of searching data, comprising: using a searchable index to determine which, if any, data objects from current production data and a set of backup data are responsive to a search query, wherein a data object in the set of backup data corresponds to a version of the production data as the production data existed when a backup operation was performed; in the event that a plurality of data objects is responsive to the search query: determining from the plurality of data objects responsive to the search query a subset of related data objects that are related to each other; determining from the subset of related data objects a first data object that comprises a version of one or more other data objects included in the subset of related data objects; and generating for the search query a search result that includes data that indicates version relationships between the first data object and the one or more other data objects included in the subset of related data objects; in the event no data object is responsive to the search query, generating said search result to indicate that no data object is responsive to the search query; and presenting, via a display at an interface device, the search result. | 1. A method of searching data, comprising: using a searchable index to determine which, if any, data objects from current production data and a set of backup data are responsive to a search query, wherein a data object in the set of backup data corresponds to a version of the production data as the production data existed when a backup operation was performed; in the event that a plurality of data objects is responsive to the search query: determining from the plurality of data objects responsive to the search query a subset of related data objects that are related to each other; determining from the subset of related data objects a first data object that comprises a version of one or more other data objects included in the subset of related data objects; and generating for the search query a search result that includes data that indicates version relationships between the first data object and the one or more other data objects included in the subset of related data objects; in the event no data object is responsive to the search query, generating said search result to indicate that no data object is responsive to the search query; and presenting, via a display at an interface device, the search result. 15. The method as recited in claim 1 , further comprising retrieving a data object associated with the search result, wherein the data object may be viewed, accessed, or used by an application, saved as new data in a production storage, or used to replace or merged with a pre-existing data in the production storage. | 0.593146 |
8. The process of claim 2 , wherein each of the current items for selection is a linguistic object determined according to the first plurality of keyboard inputs in one of a plurality of languages including the first and second languages. | 8. The process of claim 2 , wherein each of the current items for selection is a linguistic object determined according to the first plurality of keyboard inputs in one of a plurality of languages including the first and second languages. 9. The process of claim 8 , wherein one or more of the first plurality of keyboard inputs is interpretable as being corresponding to more than one character in determining the current list of items for selection. | 0.845771 |
1. A system with a processor and a memory for symbol grouping and recognition of a handwritten mathematical expression, the system comprising: a symbol grouping component configured to group input strokes corresponding to a handwritten mathematical expression into symbols based upon intra-group and inter-group information associated with the input strokes; and a symbol recognition component configured to recognize the symbols based upon information associated with the grouped input strokes wherein the intra-group information associated with the input strokes includes a confidence representative of whether the input strokes are a certain symbol provided by the symbol recognition component, and a score representative of whether the input strokes are a valid symbol based upon intra-group spatial information that includes a size difference among the input strokes and an offset measurement among the input strokes, the score being represented by the following: f ( d , δ , σ ) = 1 1 + ( ( d d 0 ) α + ( δ δ 0 ) β + ( σ σ 0 ) γ ) , ( α , β , γ > 1 ) where d represents a distance feature, δ represents a size difference feature, σ represents an offset feature, and d 0 , δ 0 , and σ 0 ; wherein the symbol grouping component is further configured to receive the input strokes, to determine intra-group spatial information among the input strokes, and to determine whether to group the input strokes into a symbol based upon the intra-group spatial; and wherein the components are implemented as computer-executable instructions stored in the memory for execution by the processor. | 1. A system with a processor and a memory for symbol grouping and recognition of a handwritten mathematical expression, the system comprising: a symbol grouping component configured to group input strokes corresponding to a handwritten mathematical expression into symbols based upon intra-group and inter-group information associated with the input strokes; and a symbol recognition component configured to recognize the symbols based upon information associated with the grouped input strokes wherein the intra-group information associated with the input strokes includes a confidence representative of whether the input strokes are a certain symbol provided by the symbol recognition component, and a score representative of whether the input strokes are a valid symbol based upon intra-group spatial information that includes a size difference among the input strokes and an offset measurement among the input strokes, the score being represented by the following: f ( d , δ , σ ) = 1 1 + ( ( d d 0 ) α + ( δ δ 0 ) β + ( σ σ 0 ) γ ) , ( α , β , γ > 1 ) where d represents a distance feature, δ represents a size difference feature, σ represents an offset feature, and d 0 , δ 0 , and σ 0 ; wherein the symbol grouping component is further configured to receive the input strokes, to determine intra-group spatial information among the input strokes, and to determine whether to group the input strokes into a symbol based upon the intra-group spatial; and wherein the components are implemented as computer-executable instructions stored in the memory for execution by the processor. 5. The system of claim 1 , wherein the information associated with the grouped input strokes includes shape and time series information. | 0.534191 |
12. The device according to claim 11, further comprising: means for receiving data input from said agent based upon said agent's interaction with a called/calling party during a call; and, means for using said data to update or create a call record. | 12. The device according to claim 11, further comprising: means for receiving data input from said agent based upon said agent's interaction with a called/calling party during a call; and, means for using said data to update or create a call record. 13. The device according to claim 12, further comprising; means for enabling or disabling subsequent topics, during processing of said first topic, based at least in part upon said data in said call record. | 0.910223 |
25. A search method using an extended keyword pool, the method comprising: generating a purchased keyword set by searching for a keyword having a purchase history through a search advertisement; generating an additional keyword set by extracting a keyword from at least one source; generating a unified search keyword set by searching for a keyword having a number of hits greater than a determined number of hits during a determined period; providing an associated keyword or an extended keyword with respect to a search word, using the keywords included in the purchased keyword set, the additional keyword set, and the unified search keyword set, as a keyword pool; providing the associated keyword or the extended keyword with respect to the search word based on new keyword scores or associated scores of keywords included in the extended keyword pool; increasing the new keyword scores of the keywords included in the unified search keyword set, excluding the keywords included in the purchased keyword set and the additional keyword set; and increasing the associated scores of intersection keywords commonly included in the purchased keyword set and the additional keyword set. | 25. A search method using an extended keyword pool, the method comprising: generating a purchased keyword set by searching for a keyword having a purchase history through a search advertisement; generating an additional keyword set by extracting a keyword from at least one source; generating a unified search keyword set by searching for a keyword having a number of hits greater than a determined number of hits during a determined period; providing an associated keyword or an extended keyword with respect to a search word, using the keywords included in the purchased keyword set, the additional keyword set, and the unified search keyword set, as a keyword pool; providing the associated keyword or the extended keyword with respect to the search word based on new keyword scores or associated scores of keywords included in the extended keyword pool; increasing the new keyword scores of the keywords included in the unified search keyword set, excluding the keywords included in the purchased keyword set and the additional keyword set; and increasing the associated scores of intersection keywords commonly included in the purchased keyword set and the additional keyword set. 26. The method of claim 25 , wherein generating the purchased keyword set comprises: updating the purchased keyword set by adding, to the purchased keyword set, a keyword that shows an increase in the purchase history through the search advertisement of greater than a determined amount, during a desired period; updating the purchased keyword set by removing, from the purchased keyword set, a keyword that does not show an increase in the purchase history through the search advertisement during the desired period, among keywords included in the purchased keyword set. | 0.632089 |
1. A method comprising: executing instructions that cause one or more processors to perform operations of: constructing a text equivalent from an input text, wherein the text equivalent is an alternating sequence of one or more idea distances and one or more ideas; converting the text equivalent by implementing one or more conversion rules, wherein a conversion rule comprising one or more rule specifications; and electronically displaying on a monitor an audit diagram comprising the text equivalent constructed from the input text, and a conversion representation comprising an operator indicator and a result arrow. | 1. A method comprising: executing instructions that cause one or more processors to perform operations of: constructing a text equivalent from an input text, wherein the text equivalent is an alternating sequence of one or more idea distances and one or more ideas; converting the text equivalent by implementing one or more conversion rules, wherein a conversion rule comprising one or more rule specifications; and electronically displaying on a monitor an audit diagram comprising the text equivalent constructed from the input text, and a conversion representation comprising an operator indicator and a result arrow. 8. The method of claim 1 , wherein the result arrow indicates a result of a conversion process. | 0.567549 |
1. A method for manipulating characters displayed on a display, the method comprising: identifying, with a computing system, a selected word that includes at least one character to be modified; receiving a spelling command to modify said selected word; correlating, with the computing system, unique numerical values with corresponding characters of said selected word, wherein each character of said selected word corresponds to a unique numerical value; displaying a list of at least one allowable character modification, on the display associated with the computing system, wherein said list includes a unique numerical value corresponding to each of said at least one allowable character modification; receiving, with the computing system, a selection command and a modification command for said at least one character to be modified, wherein said selection command comprises said unique numerical value corresponding to said selected character to be modified in said selected word; and modifying said selected character responsive to said modification command to generate a modified word. | 1. A method for manipulating characters displayed on a display, the method comprising: identifying, with a computing system, a selected word that includes at least one character to be modified; receiving a spelling command to modify said selected word; correlating, with the computing system, unique numerical values with corresponding characters of said selected word, wherein each character of said selected word corresponds to a unique numerical value; displaying a list of at least one allowable character modification, on the display associated with the computing system, wherein said list includes a unique numerical value corresponding to each of said at least one allowable character modification; receiving, with the computing system, a selection command and a modification command for said at least one character to be modified, wherein said selection command comprises said unique numerical value corresponding to said selected character to be modified in said selected word; and modifying said selected character responsive to said modification command to generate a modified word. 22. The method of claim 1 , wherein the method is implemented through use of at least one of a standalone application module and an integrated application module integrated with at least one of a target software application, a speech recognition software application, or an operating system. | 0.52088 |
1. A computer program product for checking documents using colloquialisms, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for: tracking colloquialisms used in messages by users in a social network, wherein said colloquialisms are words or phrases used in informal online communications, wherein said colloquialisms comprise words or phrases that vary from region to region; identifying relationships between senders and recipients of said messages using said colloquialisms; generating a social graph to depict relations between said users in said social network based on said identified relationships; formulating usage patterns of said colloquialisms among said users of said social graph; generating a rule set based on said social graph; and reviewing a document for spelling and/or grammatical errors and/or for making contextual relevant recommendations using said generated rule set. | 1. A computer program product for checking documents using colloquialisms, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for: tracking colloquialisms used in messages by users in a social network, wherein said colloquialisms are words or phrases used in informal online communications, wherein said colloquialisms comprise words or phrases that vary from region to region; identifying relationships between senders and recipients of said messages using said colloquialisms; generating a social graph to depict relations between said users in said social network based on said identified relationships; formulating usage patterns of said colloquialisms among said users of said social graph; generating a rule set based on said social graph; and reviewing a document for spelling and/or grammatical errors and/or for making contextual relevant recommendations using said generated rule set. 4. The computer program product as recited in claim 1 , wherein the program code further comprises the programming instructions for: generating said rule set based on said social graph and said usage patterns of said colloquialisms among said users of said social graph. | 0.5 |
8. A method comprising: identifying, by a natural language processor, that a computer-readable enterprise data represents terms of a natural human language that match one or more taxonomy terms within a defined taxonomy searchable by the natural language processor; associating, by the natural language processor, a meaning with the enterprise data based on the terms of the natural human language represented by the enterprise data that match the one or more taxonomy terms; generating, by the natural language processor, metadata that represents the meaning associated with the enterprise data; providing the metadata to a data processing machine for generating content based at least in part on the metadata; and wherein said method comprises sending said enterprise data and/or said metadata to one or more of an importer module, an extraction module, a learning module, a classification module, a feedback module, a scoring module, and/or an export module. | 8. A method comprising: identifying, by a natural language processor, that a computer-readable enterprise data represents terms of a natural human language that match one or more taxonomy terms within a defined taxonomy searchable by the natural language processor; associating, by the natural language processor, a meaning with the enterprise data based on the terms of the natural human language represented by the enterprise data that match the one or more taxonomy terms; generating, by the natural language processor, metadata that represents the meaning associated with the enterprise data; providing the metadata to a data processing machine for generating content based at least in part on the metadata; and wherein said method comprises sending said enterprise data and/or said metadata to one or more of an importer module, an extraction module, a learning module, a classification module, a feedback module, a scoring module, and/or an export module. 9. The method of claim 8 , wherein the natural human language processor comprises a domain model development module for developing a domain model comprising the defined taxonomy applicable to the enterprise data. | 0.566002 |
11. The system of claim 10 , wherein the operations further comprise: determine that a category constraint for the first query is the same as a category constraint for the second query; and count the number of search events based on the determining that the category constraint for the first query is the same as the category constraint for the second query. | 11. The system of claim 10 , wherein the operations further comprise: determine that a category constraint for the first query is the same as a category constraint for the second query; and count the number of search events based on the determining that the category constraint for the first query is the same as the category constraint for the second query. 12. The system of claim 11 , wherein the operations further comprise: cause display of an indication that the category constraint for the first query is the same as the category constraint for the second query via a search user interface on the client device. | 0.886624 |
7. A radio communication device for receiving a radiofrequency (RF) signal comprising at least first, second, and third words of at least first, second, and third duplicate messages, respectively, wherein each word including message information and error correction information, and wherein the second and third words are redundant words associated with the first word, the radio communication device comprising: comparing means for comparing each corresponding bit of the first, second and third words to determine, for each corresponding bit, which of first and second bit values is a majority bit value; generating means coupled to the comparing means for generating a fourth word which includes a bit for each corresponding bit included in the first, second, and third words, wherein each bit of the fourth word has a value equivalent to the majority bit value corresponding thereto; error correction circuitry coupled to the generating means for performing error correction on each of the first, second, third, and fourth words utilizing the error correction information: determining mean for determining a number of corrected words include in the first, second, third, and fourth words; and choosing means for selecting message information included in one of the first, second, third and fourth words, said choosing means selecting, if said determining means determines that one word has been corrected by the correcting means, the message information contained in said one corrected word. | 7. A radio communication device for receiving a radiofrequency (RF) signal comprising at least first, second, and third words of at least first, second, and third duplicate messages, respectively, wherein each word including message information and error correction information, and wherein the second and third words are redundant words associated with the first word, the radio communication device comprising: comparing means for comparing each corresponding bit of the first, second and third words to determine, for each corresponding bit, which of first and second bit values is a majority bit value; generating means coupled to the comparing means for generating a fourth word which includes a bit for each corresponding bit included in the first, second, and third words, wherein each bit of the fourth word has a value equivalent to the majority bit value corresponding thereto; error correction circuitry coupled to the generating means for performing error correction on each of the first, second, third, and fourth words utilizing the error correction information: determining mean for determining a number of corrected words include in the first, second, third, and fourth words; and choosing means for selecting message information included in one of the first, second, third and fourth words, said choosing means selecting, if said determining means determines that one word has been corrected by the correcting means, the message information contained in said one corrected word. 8. The radio communication device according to claim 7, further comprising: a receiver for receiving and demodulating the RF signal to recover data included therein; a decoder coupled to the receiver for decoding the data to recover the error correction information and message information included in the first, second, and third words; and a memory coupled to the decoder for storing the first, second, third, and fourth words. | 0.833575 |
10. A computing device comprising: a processor; a storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising: network interface logic executed by the processor for receiving, over a network from a user computer, alphanumeric characters forming a portion of a search query submitted by a user in a search query entry area; search suggestion logic executed by the processor for generating a plurality of search suggestions related to the portion of the search query, wherein the network interface logic transmits to the user computer the plurality of search suggestions for display by the user computer in a first portion of a search suggestion region before the search query is initiated via user input, the search suggestion region displayed differently than a search results area; rich content logic executed by the processor for receiving a selected search suggestion of the plurality of search suggestions, wherein the receiving of the search suggestion further comprises classifying, by the rich content logic, the search suggestion into a category, the classifying of the search suggestion into a category further comprises basing the classifying on a classification technique selected from a group of classification technique types consisting of fixed priority order, query classification confidence level, using search session context of the user, and using a search history profile of the user, and generating rich content related to the selected search suggestion, the rich content logic scraping the network for the rich content, wherein the rich content logic scraping the network for the rich content further comprises the rich content logic scraping the network while the computing device is not in communication with the user computer, wherein the network interface logic transmits to the user computer the rich content for display by the user computer in a second portion of the search suggestion region before the search query is initiated via user input, the rich content comprising text and additional content, the additional content comprising at least one graphic and a web link, the additional content comprising a preview of content present on one or more web pages, the additional content comprising a profile relating to the selected search suggestion and statistics associated with the selected search suggestion, the web pages responsive to the selected search suggestion and prior to any navigation by the user, the second portion of the search suggestion region being separate from the first portion of the search suggestion region. | 10. A computing device comprising: a processor; a storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising: network interface logic executed by the processor for receiving, over a network from a user computer, alphanumeric characters forming a portion of a search query submitted by a user in a search query entry area; search suggestion logic executed by the processor for generating a plurality of search suggestions related to the portion of the search query, wherein the network interface logic transmits to the user computer the plurality of search suggestions for display by the user computer in a first portion of a search suggestion region before the search query is initiated via user input, the search suggestion region displayed differently than a search results area; rich content logic executed by the processor for receiving a selected search suggestion of the plurality of search suggestions, wherein the receiving of the search suggestion further comprises classifying, by the rich content logic, the search suggestion into a category, the classifying of the search suggestion into a category further comprises basing the classifying on a classification technique selected from a group of classification technique types consisting of fixed priority order, query classification confidence level, using search session context of the user, and using a search history profile of the user, and generating rich content related to the selected search suggestion, the rich content logic scraping the network for the rich content, wherein the rich content logic scraping the network for the rich content further comprises the rich content logic scraping the network while the computing device is not in communication with the user computer, wherein the network interface logic transmits to the user computer the rich content for display by the user computer in a second portion of the search suggestion region before the search query is initiated via user input, the rich content comprising text and additional content, the additional content comprising at least one graphic and a web link, the additional content comprising a preview of content present on one or more web pages, the additional content comprising a profile relating to the selected search suggestion and statistics associated with the selected search suggestion, the web pages responsive to the selected search suggestion and prior to any navigation by the user, the second portion of the search suggestion region being separate from the first portion of the search suggestion region. 11. The computing device of claim 10 further comprising an advertisement server transmitting an advertisement as part of the rich content. | 0.505622 |
1. A method for assigning a label to a segment of speech to be recognized, comprising the steps of: providing a hierarchical fast ranking tree comprising a plurality of levels of subsets of prototypes, each prototype in a higher level subset being associated with one or more prototypes in a lower level subset; inputting a feature vector signal representing the segment of speech to be recognized; comparing the features of the vector signal with the features of the prototypes in a first level to find a first ranked list of the closest prototypes to the feature vector signal at that level; comparing the features of the feature vector signal to the prototypes in a second level subset associated with the highest ranking prototypes in the first ranked list of prototypes, to find a second ranked list of the closest prototypes to the feature vector signal in the second level; assigning the label associated with the highest ranking prototype in the lowest level subset to the feature vector signal; and predictive labeling wherein the highest ranking prototype in the lowest level subset is assigned to a second feature vector signal which represents another segment of speech to be recognized if a distance between the second feature vector signal and the first feature vector signal is at least less than a predetermined threshold. | 1. A method for assigning a label to a segment of speech to be recognized, comprising the steps of: providing a hierarchical fast ranking tree comprising a plurality of levels of subsets of prototypes, each prototype in a higher level subset being associated with one or more prototypes in a lower level subset; inputting a feature vector signal representing the segment of speech to be recognized; comparing the features of the vector signal with the features of the prototypes in a first level to find a first ranked list of the closest prototypes to the feature vector signal at that level; comparing the features of the feature vector signal to the prototypes in a second level subset associated with the highest ranking prototypes in the first ranked list of prototypes, to find a second ranked list of the closest prototypes to the feature vector signal in the second level; assigning the label associated with the highest ranking prototype in the lowest level subset to the feature vector signal; and predictive labeling wherein the highest ranking prototype in the lowest level subset is assigned to a second feature vector signal which represents another segment of speech to be recognized if a distance between the second feature vector signal and the first feature vector signal is at least less than a predetermined threshold. 5. The method as claimed in claim 1, wherein a leaf refers to a group of closest prototypes and a rank refers to a list of ordered closest leaves. | 0.696349 |
31. A computer program for creating and editing mark up language forms or documents, the computer program being embodied on a computer-strong medium, the program comprising: a first code segment for receiving and processing user input relating to a form or document to be created; and a second code segment for dynamically generating a word processing user interface by inputting a schema retrieved from a schema repository, wherein the schema defines the form or document, and wherein the user interface is customized to the form or document and is configured to introduce form or document content into data entry fields of the customized user interface based on user input entered in the user interface, and to use color to designate a document node in the form or document content currently selected, wherein when a cursor is positioned after a last character in a node and a right arrow key is depressed, the adjacent node changes color, and the cursor does not move when the adjacent node changes color, and wherein when the cursor is positioned before a first character in a node and a left arrow key is depressed, the adjacent node changes color, and the cursor does not move when the adjacent node changes color. | 31. A computer program for creating and editing mark up language forms or documents, the computer program being embodied on a computer-strong medium, the program comprising: a first code segment for receiving and processing user input relating to a form or document to be created; and a second code segment for dynamically generating a word processing user interface by inputting a schema retrieved from a schema repository, wherein the schema defines the form or document, and wherein the user interface is customized to the form or document and is configured to introduce form or document content into data entry fields of the customized user interface based on user input entered in the user interface, and to use color to designate a document node in the form or document content currently selected, wherein when a cursor is positioned after a last character in a node and a right arrow key is depressed, the adjacent node changes color, and the cursor does not move when the adjacent node changes color, and wherein when the cursor is positioned before a first character in a node and a left arrow key is depressed, the adjacent node changes color, and the cursor does not move when the adjacent node changes color. 37. The computer program of claim 31 , further comprising: an eighth code segment for displaying color when the particular document node is entered or when a mouse is placed over the particular document node. | 0.545048 |
1. A system for context-sensitive monitoring of sensor performance for an arterial flow system, comprising the following computer-executable components: a sensor interface component that obtains sensor data from a plurality of sensors; a context analyzer component that analyzes contextual data received from at least one data source, the contextual data being associated with the sensor data; a sensor analyzer component that identifies which of the sensor data is degraded based at least in part upon analysis of the contextual data; and an output component that provides output sensor data based at least in part upon identification of the degraded sensor data. | 1. A system for context-sensitive monitoring of sensor performance for an arterial flow system, comprising the following computer-executable components: a sensor interface component that obtains sensor data from a plurality of sensors; a context analyzer component that analyzes contextual data received from at least one data source, the contextual data being associated with the sensor data; a sensor analyzer component that identifies which of the sensor data is degraded based at least in part upon analysis of the contextual data; and an output component that provides output sensor data based at least in part upon identification of the degraded sensor data. 7. The system of claim 1 , further comprising: a sensor predictor component that predicts failure of a subset of the plurality of sensors; and a notification component that generates an alert as a function of the predicted failure. | 0.507463 |
1. A computerized search and presentation method for a set of items, comprising: assigning one or more Attributes to each item in the set of items; further assigning to each Attribute, and to no item, a single Kind; creating assignments between Attributes and Kinds, where the assignments assign to each Attribute a single Kind, and to each Kind an arbitrary number of Attributes; assigning to each Kind at least one scheme of transitive implications among the Attributes such that each Kind is associated with several Attributes; determining which Attributes of each Kind are broad Attributes, broad Attributes being Attributes that do not within the set of items imply any other Attribute; presenting to a user a list of Kinds by which the set of items are to be grouped; upon accepting the user's selection of one or more Kinds, listing one or more broad Attributes of that Kind; upon accepting the user's selection of one or more broad Attributes, presenting information about a subset of items having the selected one or more broad Attributes; wherein Kinds are not assigned to items. | 1. A computerized search and presentation method for a set of items, comprising: assigning one or more Attributes to each item in the set of items; further assigning to each Attribute, and to no item, a single Kind; creating assignments between Attributes and Kinds, where the assignments assign to each Attribute a single Kind, and to each Kind an arbitrary number of Attributes; assigning to each Kind at least one scheme of transitive implications among the Attributes such that each Kind is associated with several Attributes; determining which Attributes of each Kind are broad Attributes, broad Attributes being Attributes that do not within the set of items imply any other Attribute; presenting to a user a list of Kinds by which the set of items are to be grouped; upon accepting the user's selection of one or more Kinds, listing one or more broad Attributes of that Kind; upon accepting the user's selection of one or more broad Attributes, presenting information about a subset of items having the selected one or more broad Attributes; wherein Kinds are not assigned to items. 11. The method of claim 1 , wherein graphical means are provided by which the user may specify the presence or absence of a particular Attribute or Kind as conditions constraining what items may belong to the set of items. | 0.60378 |
1. A tool for annotating an event map, comprising: a map generator for generating an event map depicting a schedule of activities for an event including plural sessions; an annotating unit for annotating said event map based on a user input, the annotating of the event map comprising tagging information to a feature of the event map; a view generator for generating a zoomable and pannable view of the schedule of activities depicted by said annotated event map; and a display device for displaying said zoomable and pannable view of the schedule of activities depicted by said annotated event map. | 1. A tool for annotating an event map, comprising: a map generator for generating an event map depicting a schedule of activities for an event including plural sessions; an annotating unit for annotating said event map based on a user input, the annotating of the event map comprising tagging information to a feature of the event map; a view generator for generating a zoomable and pannable view of the schedule of activities depicted by said annotated event map; and a display device for displaying said zoomable and pannable view of the schedule of activities depicted by said annotated event map. 2. The tool of claim 1 , wherein the tagging of information comprises tagging at least one of a comment, a question, a discussion, a text message, an instant message, a text file, an image file, a video file and a widget to the feature of said event map. | 0.688274 |
1. A method of storing descriptive metatag-value pairs for parametized information regarding first and second items having differing classifications, comprising: providing a first electronic interface through which a first human user identifies the first item in a first document to a computer system; prompting the first user to select a first classification for the first item, wherein the first user selects the first classification for the first item; providing the first user with a first set of metatag choices determined at least in part by the first user's selection of the first classification; presenting the first user with: (a) the first set of metatag choices for possible association with the first item, and (b) candidate values for at least one of the metatag choices that allows the first user to define a first metatag-value pair; providing a second electronic interface through which the first user creates a new metatag for the first set of metatag choices which based on an analysis of a second document that includes the second item, is subsequently displayed in the first set of metatag choices to a second human user for the second user to utilize in entering a second metatag-value pair for possible association with the second item in the second document; and storing an association of the first item and the new metatag in a data structure. | 1. A method of storing descriptive metatag-value pairs for parametized information regarding first and second items having differing classifications, comprising: providing a first electronic interface through which a first human user identifies the first item in a first document to a computer system; prompting the first user to select a first classification for the first item, wherein the first user selects the first classification for the first item; providing the first user with a first set of metatag choices determined at least in part by the first user's selection of the first classification; presenting the first user with: (a) the first set of metatag choices for possible association with the first item, and (b) candidate values for at least one of the metatag choices that allows the first user to define a first metatag-value pair; providing a second electronic interface through which the first user creates a new metatag for the first set of metatag choices which based on an analysis of a second document that includes the second item, is subsequently displayed in the first set of metatag choices to a second human user for the second user to utilize in entering a second metatag-value pair for possible association with the second item in the second document; and storing an association of the first item and the new metatag in a data structure. 3. The method of claim 1 , wherein the step of identifying the first item to the system comprises blocking a portion of the item. | 0.513049 |
8. An apparatus as claimed in claim 2 wherein the processor hosts additional applications. | 8. An apparatus as claimed in claim 2 wherein the processor hosts additional applications. 11. An apparatus as claimed in claim 8 wherein an electrical connector is provided for the addition of a new hardware application. | 0.942166 |
27. The system of claim 26 , wherein the computer system for performing the search is a computer system of conducting a two-way search, and wherein a method of conducting a three-way search further comprises: a wish list search module for executing a wish list search, based on one or more input search strings received as input, using search criteria to select and score a set of target documents against the one or more input search strings, each target document given a wish list score representing similarity between the target document and one or more input search strings, the set of target documents with the wish list scores representing a wish list search result set; and a second combining module for combining the secondary combined score and wish list score for respective ones of the target documents, each target document given a primary combined score based on the combining that is a function of the secondary combined score and the wish list score, the set of target documents with the primary combined scores representing a primary result set. | 27. The system of claim 26 , wherein the computer system for performing the search is a computer system of conducting a two-way search, and wherein a method of conducting a three-way search further comprises: a wish list search module for executing a wish list search, based on one or more input search strings received as input, using search criteria to select and score a set of target documents against the one or more input search strings, each target document given a wish list score representing similarity between the target document and one or more input search strings, the set of target documents with the wish list scores representing a wish list search result set; and a second combining module for combining the secondary combined score and wish list score for respective ones of the target documents, each target document given a primary combined score based on the combining that is a function of the secondary combined score and the wish list score, the set of target documents with the primary combined scores representing a primary result set. 30. The system of claim 27 , wherein the primary combining function is the geometric mean of the secondary combined score and wish list score. | 0.791522 |
1. A computer-implemented method for applying a coding standard to a simulatable graphical model in a graphical modeling environment, the method comprising the steps of: providing a coding standard in the graphical modeling environment; applying the coding standard to the simulatable graphical model to detect violations of the coding standard in the simulatable graphical model; displaying violating segments of the simulatable graphical model differently than non-violating segments of the simulatable graphical model; and in response to users' selection of a selected one of violating segments, displaying information on a violation of the coding standard in the selected violating segment. | 1. A computer-implemented method for applying a coding standard to a simulatable graphical model in a graphical modeling environment, the method comprising the steps of: providing a coding standard in the graphical modeling environment; applying the coding standard to the simulatable graphical model to detect violations of the coding standard in the simulatable graphical model; displaying violating segments of the simulatable graphical model differently than non-violating segments of the simulatable graphical model; and in response to users' selection of a selected one of violating segments, displaying information on a violation of the coding standard in the selected violating segment. 15. The method of claim 1 , further comprising: generating code from the simulatable graphical model. | 0.663188 |
9. A system for accessing requested data in a database on a computer readable storage medium using beans, comprising: a database that stores data on a computer readable storage medium; and an application server that includes logic for allowing a client to invoke a single bean select method of a bean query language with a query for requested data from a database, wherein the requested data includes data from multiple fields of the database corresponding to multiple bean types; translating the bean select method of the bean query language into a database language query and forwarding the query to the database in a database language; receiving the results of the query at the database to retrieve the requested data, including data from multiple fields of the database corresponding to multiple bean types; populating a single result set object in the bean query language with the requested data from multiple fields of the database corresponding to multiple bean types into the single result set object, wherein storing the data bypasses the steps of creating separate bean instances for the requested data and invoking individual net methods to retrieve multiple data fields, and wherein the result set object retains the relationships between the data corresponding to the original database schema; and providing access to the requested data in the result set object, wherein the result set object contains data from multiple fields of the database corresponding to multiple bean types. | 9. A system for accessing requested data in a database on a computer readable storage medium using beans, comprising: a database that stores data on a computer readable storage medium; and an application server that includes logic for allowing a client to invoke a single bean select method of a bean query language with a query for requested data from a database, wherein the requested data includes data from multiple fields of the database corresponding to multiple bean types; translating the bean select method of the bean query language into a database language query and forwarding the query to the database in a database language; receiving the results of the query at the database to retrieve the requested data, including data from multiple fields of the database corresponding to multiple bean types; populating a single result set object in the bean query language with the requested data from multiple fields of the database corresponding to multiple bean types into the single result set object, wherein storing the data bypasses the steps of creating separate bean instances for the requested data and invoking individual net methods to retrieve multiple data fields, and wherein the result set object retains the relationships between the data corresponding to the original database schema; and providing access to the requested data in the result set object, wherein the result set object contains data from multiple fields of the database corresponding to multiple bean types. 16. The system of claim 9 , wherein the multiple fields of the database correspond to one of multiple fields from a single bean type, multiple fields from multiple bean types, or a single field from multiple bean types. | 0.558333 |
13. The method of claim 12 , wherein restructuring includes: mapping the movement of the one or more components from a current location to a potential location on a component interface definition meta-structure map; and determining whether the mapped movement of the one or more identified components on the component interface definition meta-structure map resolves the one or more gaps. | 13. The method of claim 12 , wherein restructuring includes: mapping the movement of the one or more components from a current location to a potential location on a component interface definition meta-structure map; and determining whether the mapped movement of the one or more identified components on the component interface definition meta-structure map resolves the one or more gaps. 14. The method of claim 13 , wherein: after it is determined that the mapped movement of the one or more identified components resolves the one or more gaps, outputting the report; and the report includes an organizational structure of the one or more components within the new ecosystem or context ‘B’. | 0.858383 |
23. A device, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises program instructions configured to: maintain a plurality of contact entries, wherein each contact entry comprises contact information for a respective user, wherein some of the contact entries are designated as core contact entries; detect a primary user's current context information, wherein the primary user is different from each user for which a contact entry is maintained; identify one or more context appropriate contact entries from the maintained contact entries dependent on the current context information detected for the primary user; provide to the primary user: the one or more context appropriate contact entries; and the core contact entries, wherein the core contact entries are provided independent of the current context information detected for the primary user; detect a change in the primary user's current context information; and in response to detecting the change in the primary user's current context information: identify one or more different context appropriate contact entries from the maintained contact entries dependent on the changed context information detected for the primary user; and provide to the primary user: the one or more different context appropriate contact entries; and the same core contact entries. | 23. A device, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises program instructions configured to: maintain a plurality of contact entries, wherein each contact entry comprises contact information for a respective user, wherein some of the contact entries are designated as core contact entries; detect a primary user's current context information, wherein the primary user is different from each user for which a contact entry is maintained; identify one or more context appropriate contact entries from the maintained contact entries dependent on the current context information detected for the primary user; provide to the primary user: the one or more context appropriate contact entries; and the core contact entries, wherein the core contact entries are provided independent of the current context information detected for the primary user; detect a change in the primary user's current context information; and in response to detecting the change in the primary user's current context information: identify one or more different context appropriate contact entries from the maintained contact entries dependent on the changed context information detected for the primary user; and provide to the primary user: the one or more different context appropriate contact entries; and the same core contact entries. 30. The device of claim 23 , wherein each contact entry comprises a plurality of types of contact information and wherein in said identifying the program instructions are configured to identify an appropriate type of contact information from each of the context appropriate contact entries based on the current context information. | 0.625666 |
1. A method comprising: scanning, by a client-side module executing on a computing device, a Document Object Model (DOM) of a first web page displayed by a browser on a display of the computing device to determine a location of a primary search query user input area associated with the first web page; determining, by the client-side module, that a search query has been entered by a user into the primary search query user input area; in response to the determining, automatically entering, by the client-side module, the search query entered by the user into the primary search query user input area into a secondary search query user input area associated with a predetermined second web page, the second web page determined by the client-side module based on web browsing history of the user; displaying in a first content area of the browser the result of a search performed by a search tool represented by the first web page on the search query; and displaying in a second content area of the browser the result of a search performed by a search tool represented by the second web page on the search query. | 1. A method comprising: scanning, by a client-side module executing on a computing device, a Document Object Model (DOM) of a first web page displayed by a browser on a display of the computing device to determine a location of a primary search query user input area associated with the first web page; determining, by the client-side module, that a search query has been entered by a user into the primary search query user input area; in response to the determining, automatically entering, by the client-side module, the search query entered by the user into the primary search query user input area into a secondary search query user input area associated with a predetermined second web page, the second web page determined by the client-side module based on web browsing history of the user; displaying in a first content area of the browser the result of a search performed by a search tool represented by the first web page on the search query; and displaying in a second content area of the browser the result of a search performed by a search tool represented by the second web page on the search query. 5. The method of claim 1 wherein the displaying of the result of the search performed by the search tool represented by the first web page further comprises displaying personalized results of the search. | 0.612448 |
8. A non-transitory computer-readable memory storing a plurality of instructions executable by one or more processors, the plurality of instructions comprising: instructions that cause the one or more processors to receive a continuous input data stream related to an application; instructions that cause the one or more processors to generate an input relation from the continuous input data stream; instructions that cause the one or more processors to store the input relation as an external data source in a database of historical data; instructions that cause the one or more processors to receive a continuous query that identifies the input relation and a range value window operator associated with the input relation; instructions that cause the one or more processors to execute the continuous query to generate an output relation, the continuous query executed by applying the range value window operator on an attribute of the input relation to generate the output relation, the attribute comprising a characteristic of an event associated with the input relation; instructions that cause the one or more processors to determine whether the event associated with the input relation occurs within a specified time range defined by the range value window operator; instructions that cause the one or more processors to determine inserting or removing the event with respect to the output relation based at least in part on the determination of whether the event associated with the input relation occurs within the specified time range; and instructions that cause the one or more processors to provide data records of the output relation, the output relation comprising at least the event when the event was inserted based at least in part on being within the specified range defined by the range value window operator. | 8. A non-transitory computer-readable memory storing a plurality of instructions executable by one or more processors, the plurality of instructions comprising: instructions that cause the one or more processors to receive a continuous input data stream related to an application; instructions that cause the one or more processors to generate an input relation from the continuous input data stream; instructions that cause the one or more processors to store the input relation as an external data source in a database of historical data; instructions that cause the one or more processors to receive a continuous query that identifies the input relation and a range value window operator associated with the input relation; instructions that cause the one or more processors to execute the continuous query to generate an output relation, the continuous query executed by applying the range value window operator on an attribute of the input relation to generate the output relation, the attribute comprising a characteristic of an event associated with the input relation; instructions that cause the one or more processors to determine whether the event associated with the input relation occurs within a specified time range defined by the range value window operator; instructions that cause the one or more processors to determine inserting or removing the event with respect to the output relation based at least in part on the determination of whether the event associated with the input relation occurs within the specified time range; and instructions that cause the one or more processors to provide data records of the output relation, the output relation comprising at least the event when the event was inserted based at least in part on being within the specified range defined by the range value window operator. 11. The computer-readable memory of claim 8 , wherein the instructions that cause the one or more processors to execute the continuous query further comprise instructions for applying the range value window operator on a range window of the input relation to generate the output relation. | 0.5 |
15. The method according to claim 14 , further comprising parsing the received speech according to at least one predetermined grammar prior to analyzing. | 15. The method according to claim 14 , further comprising parsing the received speech according to at least one predetermined grammar prior to analyzing. 16. The method according to claim 15 , wherein said analyzing a completeness and unambiguity comprises determining a statistical reliability of a correspondence of the received speech to the at least one predetermined grammar. | 0.903488 |
28. A method for electronic learning support, the method comprising: generating, using one or more processors, a digital specification in a first language from a set of input parameters for one or more of a plurality of digital templates, the digital specification including instructions which when executed by an execution environment of an electronic reading device, cause the electronic reading device to present one or more interactive content presentation objects and one or more interactive assessment objects, the execution environment being one of a plurality of heterogeneous execution environments, each execution environment being specific to one of a plurality of heterogeneous electronic reading devices and having platform-dependent capabilities and user interface elements, and the instructions being such that when executed by each of the heterogeneous execution environments on respective ones of the plurality of heterogeneous electronic reading devices produce a consistent layout within and around the interactive content presentation objects and interactive assessment objects across all of the heterogeneous execution environments on respective ones of the plurality of heterogeneous electronic reading devices; transmitting the digital specification and pre-processed media data of at least one interactive content presentation object to the electronic reading device wherein the at least one interactive content presentation object is presented with a look and feel of a user interface of the electronic reading device to the electronic reading device using a computer processor, and wherein the media data is pre-processed to adjust for the platform-dependent capabilities of the execution environment and to ensure the consistent layout within and around the at least one interactive content presentation object; receiving content interaction data corresponding to the user interactions with the interactive content presentation objects from the execution environment; and sending at least a subset of the content interaction data to at least one other electronic reading device, and receiving assessment data corresponding to user interactions with the interactive assessment objects from the execution environment. | 28. A method for electronic learning support, the method comprising: generating, using one or more processors, a digital specification in a first language from a set of input parameters for one or more of a plurality of digital templates, the digital specification including instructions which when executed by an execution environment of an electronic reading device, cause the electronic reading device to present one or more interactive content presentation objects and one or more interactive assessment objects, the execution environment being one of a plurality of heterogeneous execution environments, each execution environment being specific to one of a plurality of heterogeneous electronic reading devices and having platform-dependent capabilities and user interface elements, and the instructions being such that when executed by each of the heterogeneous execution environments on respective ones of the plurality of heterogeneous electronic reading devices produce a consistent layout within and around the interactive content presentation objects and interactive assessment objects across all of the heterogeneous execution environments on respective ones of the plurality of heterogeneous electronic reading devices; transmitting the digital specification and pre-processed media data of at least one interactive content presentation object to the electronic reading device wherein the at least one interactive content presentation object is presented with a look and feel of a user interface of the electronic reading device to the electronic reading device using a computer processor, and wherein the media data is pre-processed to adjust for the platform-dependent capabilities of the execution environment and to ensure the consistent layout within and around the at least one interactive content presentation object; receiving content interaction data corresponding to the user interactions with the interactive content presentation objects from the execution environment; and sending at least a subset of the content interaction data to at least one other electronic reading device, and receiving assessment data corresponding to user interactions with the interactive assessment objects from the execution environment. 29. The method of claim 28 , wherein receiving assessment data comprises receiving interactive test results associated with the one or more interactive assessment objects. | 0.57063 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.