patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
8,300,023 | 28 | 32 | 28. A computing device coupled to a touch sensitive surface, comprising: means for receiving a series of coordinates of a series of user touches on the touch sensitive surface; means for correlating a plurality of keys with the received series of coordinates; means for determining an average of received coordinates correlated with each of the plurality of keys, wherein the means for determining the average of received coordinates correlated with each of the plurality of keys comprises: means for calculating a variability of key-strike locations for each of the plurality of keys; means for determining when the calculated variability of key-strike locations for each of the plurality of keys has plateaued; and means for calculating an average of coordinate key strike locations for each of the plurality of keys once the variability of key strike locations has plateaued; means for saving the calculated average coordinates for each of the plurality of keys in keypad layout data; and means for generating an image of a virtual keypad using the keypad layout data. | 28. A computing device coupled to a touch sensitive surface, comprising: means for receiving a series of coordinates of a series of user touches on the touch sensitive surface; means for correlating a plurality of keys with the received series of coordinates; means for determining an average of received coordinates correlated with each of the plurality of keys, wherein the means for determining the average of received coordinates correlated with each of the plurality of keys comprises: means for calculating a variability of key-strike locations for each of the plurality of keys; means for determining when the calculated variability of key-strike locations for each of the plurality of keys has plateaued; and means for calculating an average of coordinate key strike locations for each of the plurality of keys once the variability of key strike locations has plateaued; means for saving the calculated average coordinates for each of the plurality of keys in keypad layout data; and means for generating an image of a virtual keypad using the keypad layout data. 32. The computing device of claim 28 , wherein means for generating an image of the virtual keypad using the keypad layout data comprises: means for generating images of keys in the virtual keypad in locations based upon the average coordinates of each of the plurality of keys stored in the keypad layout data. | 0.685223 |
8,555,151 | 1 | 2 | 1. A system comprising: a central processing unit for processing a presentation of visual content and audio content using: a Voice Browser configured to audibly present voice content from a document retrieved from a computer communications network and to identify a reference in the document that specifies visual content for visual presentation; and a Visual Browser configured to visually present the visual content, wherein the Voice Browser is configured to provide the identified reference to the Visual Browser, and the Visual Browser is configured to retrieve the visual content specified by the identified reference for visual presentation. | 1. A system comprising: a central processing unit for processing a presentation of visual content and audio content using: a Voice Browser configured to audibly present voice content from a document retrieved from a computer communications network and to identify a reference in the document that specifies visual content for visual presentation; and a Visual Browser configured to visually present the visual content, wherein the Voice Browser is configured to provide the identified reference to the Visual Browser, and the Visual Browser is configured to retrieve the visual content specified by the identified reference for visual presentation. 2. The system of claim 1 , wherein the Voice Browser audibly presents the voice content substantially concurrently with the Visual Browser visual presentation of the visual content. | 0.5 |
9,785,712 | 15 | 16 | 15. A computer-readable storage device storing computer-executable instructions that, when executed by one or more computer systems, configure the one or more computer systems to perform operations comprising: presenting an interface for a search engine; receiving a search string from a user; searching a first data set using a first search index based at least in part on a search query that includes the search string; obtaining first search results including a subset of the first data set based at least in part on said searching the first data set using the first search index; identifying a second search index from among a plurality of predetermined indices based at least in part on the first search results; searching the first search results using the second search index; obtaining second search results from among the subset of the first data set based at least in part on the second search index; ranking at least a part of the second search results with respect to each other based at least in part on a ranking algorithm of the second search index; modifying the second search index based at least in part on the ranked part of the second search results and data that is obtained independent of the second search results; and transmitting the second search results to the user. | 15. A computer-readable storage device storing computer-executable instructions that, when executed by one or more computer systems, configure the one or more computer systems to perform operations comprising: presenting an interface for a search engine; receiving a search string from a user; searching a first data set using a first search index based at least in part on a search query that includes the search string; obtaining first search results including a subset of the first data set based at least in part on said searching the first data set using the first search index; identifying a second search index from among a plurality of predetermined indices based at least in part on the first search results; searching the first search results using the second search index; obtaining second search results from among the subset of the first data set based at least in part on the second search index; ranking at least a part of the second search results with respect to each other based at least in part on a ranking algorithm of the second search index; modifying the second search index based at least in part on the ranked part of the second search results and data that is obtained independent of the second search results; and transmitting the second search results to the user. 16. The computer-readable storage device of claim 15 , further comprising instructions for modifying the second search index based at least in part on the second search results. | 0.658301 |
8,640,030 | 16 | 20 | 16. The method of claim 1 , further comprising: causing display of a user interface with one or more controls to enable a user to perform predetermined operations associated with the tag. | 16. The method of claim 1 , further comprising: causing display of a user interface with one or more controls to enable a user to perform predetermined operations associated with the tag. 20. The method of claim 16 , wherein the predetermined operations comprise: enabling a user to attach field information to the tag. | 0.763538 |
9,980,753 | 30 | 45 | 30. A bone anchor assembly for securing an elongate rod to a bone, the bone anchor assembly comprising: a receiver having a vertical axis, a lower body defining an internal cavity communicating with a bottom surface of the receiver through a bottom opening, and a first pair of upright arms extending upwardly from the lower body to define a first channel opening onto a top thereof for receiving the elongate rod, the first channel having a transverse axis perpendicular to the vertical axis and communicating with the internal cavity to define a through bore centered around the vertical axis, the upright arms having interior surfaces with a discontinuous guide and advancement structure formed therein, the receiver having opposed recesses with downwardly-facing top surfaces located entirely below the discontinuous guide and advancement structure; a bone attachment structure having a body and an upper head portion with a substantially spherical surface above a hemisphere thereof, the body extending through the receiver bottom opening and pivotal with respect to the receiver; and an insert having a body with a second pair of upright arms centered around a vertically-extending midsection of the body and forming a second channel therebetween, the second channel being alignable with the receiver transverse axis to receive the elongate rod, the insert upright arms having uppermost portions protruding laterally at the vertically-extending midsection of the insert body and terminating at uppermost top surfaces, the insert body further including a central through-and-through tool receiving opening and oppositely-directed opposed radial extensions in the direction of the receiver transverse axis to inhibit rotation between the receiver and the insert, wherein top surfaces of the insert opposed radial extensions extend radially outward so as to be underneath a most bottom surface of the elongate rod, and wherein the uppermost top surfaces of the upright arms are snapped under and engaging the downwardly-facing top surfaces of the receiver opposed recesses to prevent upward movement of the insert when the insert is fully disposed within the receiver first channel, so as to prevent the insert from moving back up within the receiver prior to the insert being further pushed down within the receiver into a locked orientation by a closure. | 30. A bone anchor assembly for securing an elongate rod to a bone, the bone anchor assembly comprising: a receiver having a vertical axis, a lower body defining an internal cavity communicating with a bottom surface of the receiver through a bottom opening, and a first pair of upright arms extending upwardly from the lower body to define a first channel opening onto a top thereof for receiving the elongate rod, the first channel having a transverse axis perpendicular to the vertical axis and communicating with the internal cavity to define a through bore centered around the vertical axis, the upright arms having interior surfaces with a discontinuous guide and advancement structure formed therein, the receiver having opposed recesses with downwardly-facing top surfaces located entirely below the discontinuous guide and advancement structure; a bone attachment structure having a body and an upper head portion with a substantially spherical surface above a hemisphere thereof, the body extending through the receiver bottom opening and pivotal with respect to the receiver; and an insert having a body with a second pair of upright arms centered around a vertically-extending midsection of the body and forming a second channel therebetween, the second channel being alignable with the receiver transverse axis to receive the elongate rod, the insert upright arms having uppermost portions protruding laterally at the vertically-extending midsection of the insert body and terminating at uppermost top surfaces, the insert body further including a central through-and-through tool receiving opening and oppositely-directed opposed radial extensions in the direction of the receiver transverse axis to inhibit rotation between the receiver and the insert, wherein top surfaces of the insert opposed radial extensions extend radially outward so as to be underneath a most bottom surface of the elongate rod, and wherein the uppermost top surfaces of the upright arms are snapped under and engaging the downwardly-facing top surfaces of the receiver opposed recesses to prevent upward movement of the insert when the insert is fully disposed within the receiver first channel, so as to prevent the insert from moving back up within the receiver prior to the insert being further pushed down within the receiver into a locked orientation by a closure. 45. The bone anchor assembly of claim 30 , wherein the insert body and upright arms together form a saddle surface that defines a lower limit of the insert second channel, and wherein the top surfaces of the opposed radial extensions extend the saddle surface in the direction of the transverse axis so as to be underneath the most bottom surface of the portion of the elongate rod positioned within the insert second channel. | 0.571429 |
8,290,953 | 15 | 19 | 15. A computer program product comprising a computer readable storage medium including computer readable program code, where the computer readable program code when executed on a computer causes the computer to: identify rule attributes for each of a plurality of prioritized naming rules, where a combination of the rule attributes represents a plurality of identifiers that uniquely identify resources via one or more of the plurality of prioritized naming rules; determine a naming context that makes the combination of the rule attributes for each of the plurality of prioritized naming rules unique; correlate, via a configuration management database (CMDB), resource names for a plurality of resources generated by a plurality of management products within a single management domain based upon the plurality of prioritized naming rules comprising causing the computer to correlate the resource names for the plurality of resources using the determined naming context and the identified rule attributes for each of the plurality of prioritized naming rules; determine whether each of the plurality of resources has more than one valid name within the single management domain based upon the correlated resource names for the plurality of resources; and select, for each resource determined to have more than one valid name within the single management domain, one of the valid names as a master name for the resource using the plurality of prioritized naming rules. | 15. A computer program product comprising a computer readable storage medium including computer readable program code, where the computer readable program code when executed on a computer causes the computer to: identify rule attributes for each of a plurality of prioritized naming rules, where a combination of the rule attributes represents a plurality of identifiers that uniquely identify resources via one or more of the plurality of prioritized naming rules; determine a naming context that makes the combination of the rule attributes for each of the plurality of prioritized naming rules unique; correlate, via a configuration management database (CMDB), resource names for a plurality of resources generated by a plurality of management products within a single management domain based upon the plurality of prioritized naming rules comprising causing the computer to correlate the resource names for the plurality of resources using the determined naming context and the identified rule attributes for each of the plurality of prioritized naming rules; determine whether each of the plurality of resources has more than one valid name within the single management domain based upon the correlated resource names for the plurality of resources; and select, for each resource determined to have more than one valid name within the single management domain, one of the valid names as a master name for the resource using the plurality of prioritized naming rules. 19. The computer program product of claim 15 , where the plurality of prioritized naming rules comprises prioritized naming rules for software resources and prioritized naming rules for hardware resources, and where: the rule attributes for each of the prioritized naming rules for software resources comprise at least one of an operating system (OS) type, an OS version, a host name of a computer system in which software is running, total memory used by the software, and total physically attached storage that is available to the software; and the rule attributes for each of the prioritized naming rules for hardware resources comprise at least one of a dedicated role of a hardware resource, a processor family used by the hardware resource, a manufacturer of the hardware resource, a model of the hardware resource, a machine type, and a serial number. | 0.5 |
9,177,053 | 1 | 5 | 1. A method programmed in a non-transitory memory of a first device, the first device comprising: receiving, at the first device, broadcast information; converting at least a portion of the broadcast information into searchable information; automatically performing a first fact check for factual accuracy of the broadcast information using the first device, the first fact check including comparing the searchable information with information from one or more first sources; automatically performing a second fact check for factual accuracy of the broadcast information in parallel with the first fact check, the second fact check including comparing the searchable information with information from one or more second sources; wherein automatically performing the first fact check results in generating a first result of the first fact check; wherein automatically performing the second fact check results in generating a second result of the second fact check; causing to be displayed, on a second device, an indication of the first result of the first fact check and the second result of the second fact check. | 1. A method programmed in a non-transitory memory of a first device, the first device comprising: receiving, at the first device, broadcast information; converting at least a portion of the broadcast information into searchable information; automatically performing a first fact check for factual accuracy of the broadcast information using the first device, the first fact check including comparing the searchable information with information from one or more first sources; automatically performing a second fact check for factual accuracy of the broadcast information in parallel with the first fact check, the second fact check including comparing the searchable information with information from one or more second sources; wherein automatically performing the first fact check results in generating a first result of the first fact check; wherein automatically performing the second fact check results in generating a second result of the second fact check; causing to be displayed, on a second device, an indication of the first result of the first fact check and the second result of the second fact check. 5. The method of claim 1 wherein the one or more first sources are the same as the one or more second sources. | 0.924863 |
8,739,055 | 1 | 6 | 1. A method of correcting typographical errors displayed on a touch-sensitive display of a portable computing device, the method comprising: identifying a typographical error within text displayed on the display, the typographical error comprising an error within a word displayed on the display; upon identifying the typographical error, highlighting on the display the typographical error; detecting a gesture-based touch input selecting a cursor key from a virtual keyboard displayed on the display and displaying a cursor in response to the gesture-based touch input; detecting a change in a location of the gesture-based touch input, and in response, moving a location of an image of the cursor displayed on the display in correspondence with the gesture-based touch input; detecting a release of the gesture-based touch input; if the release of the gesture-based touch input is detected within a predefined region associated with a location of the typographical error, displaying on the display the cursor next to the typographical error; and responsive to the cursor being displayed next to the typographical error, replacing the typographical error with replacement text input from the virtual keyboard. | 1. A method of correcting typographical errors displayed on a touch-sensitive display of a portable computing device, the method comprising: identifying a typographical error within text displayed on the display, the typographical error comprising an error within a word displayed on the display; upon identifying the typographical error, highlighting on the display the typographical error; detecting a gesture-based touch input selecting a cursor key from a virtual keyboard displayed on the display and displaying a cursor in response to the gesture-based touch input; detecting a change in a location of the gesture-based touch input, and in response, moving a location of an image of the cursor displayed on the display in correspondence with the gesture-based touch input; detecting a release of the gesture-based touch input; if the release of the gesture-based touch input is detected within a predefined region associated with a location of the typographical error, displaying on the display the cursor next to the typographical error; and responsive to the cursor being displayed next to the typographical error, replacing the typographical error with replacement text input from the virtual keyboard. 6. The method of claim 1 , further comprising, if the release of the gesture-based touch input is detected outside of the predefined region associated with the location of the typographical error, removing the image of the cursor from the display. | 0.5 |
8,824,879 | 20 | 24 | 20. A system comprising: (a) a camera that is operable to take and store pictures, and that includes: (i) a lens, (ii) an image sensor, (iii) at least one microphone, (iv) a voice recognizer, and (v) a camera controller, (b) the camera controller including a control program having instructions to control and respond to the voice recognizer, (c) wherein the voice recognizer is coupled to the microphone and the camera controller, and is configured to receive and process sounds into recognized words; (d) the camera further configured to maintain and store a plurality of recognizable words having different plain meanings and commonly associated with a first camera command, the recognition of any of which will cause the camera to perform the first camera command; (e) wherein the voice recognizer is operable to receive a first and a second human sound spoken by the same person, and to recognize: (i) the first human sound as a first word from among the plurality that is used by the control program to perform a first camera command, and (ii) the second human sound as a second word from among the plurality that is different from the first word and is used by the control program to perform the first camera command. | 20. A system comprising: (a) a camera that is operable to take and store pictures, and that includes: (i) a lens, (ii) an image sensor, (iii) at least one microphone, (iv) a voice recognizer, and (v) a camera controller, (b) the camera controller including a control program having instructions to control and respond to the voice recognizer, (c) wherein the voice recognizer is coupled to the microphone and the camera controller, and is configured to receive and process sounds into recognized words; (d) the camera further configured to maintain and store a plurality of recognizable words having different plain meanings and commonly associated with a first camera command, the recognition of any of which will cause the camera to perform the first camera command; (e) wherein the voice recognizer is operable to receive a first and a second human sound spoken by the same person, and to recognize: (i) the first human sound as a first word from among the plurality that is used by the control program to perform a first camera command, and (ii) the second human sound as a second word from among the plurality that is different from the first word and is used by the control program to perform the first camera command. 24. The system of claim 20 wherein the voice recognizer is configured to receive and process a third human sound to be recognized as a third word that is different from the first and second words and is used by the control program to perform a second camera command. | 0.5 |
7,668,802 | 1 | 10 | 1. A method of enforcing application-layer policies to application layer formatted documents, each policy defining a rule and an action, comprising: distinctly storing simple policies and complex policies applicable to the application layer formatted documents in a simple policies data structure, wherein said simple policies data structure stores XPath queries that do not use wildcard β*β and descendent β//β expressions, and, respectively, a complex policies data structure, wherein said complex policies data structure stores XPath queries that use wildcard β*β and descendent β//β expressions; parsing a document received as streaming application layer data in a hierarchical structure, for enabling evaluation of an object in the document, wherein the document is an Extensible Markup Language (XML) document and the object is a result of evaluation of an XPath expression; simultaneously querying the simple and complex policies data structures to identify all policies corresponding to the object; discontinuing the query for the object in the simple and complex policies data structures once all of the simple and complex policies that match the object are identified; and executing the actions defined by the simple and complex policies corresponding to the object. | 1. A method of enforcing application-layer policies to application layer formatted documents, each policy defining a rule and an action, comprising: distinctly storing simple policies and complex policies applicable to the application layer formatted documents in a simple policies data structure, wherein said simple policies data structure stores XPath queries that do not use wildcard β*β and descendent β//β expressions, and, respectively, a complex policies data structure, wherein said complex policies data structure stores XPath queries that use wildcard β*β and descendent β//β expressions; parsing a document received as streaming application layer data in a hierarchical structure, for enabling evaluation of an object in the document, wherein the document is an Extensible Markup Language (XML) document and the object is a result of evaluation of an XPath expression; simultaneously querying the simple and complex policies data structures to identify all policies corresponding to the object; discontinuing the query for the object in the simple and complex policies data structures once all of the simple and complex policies that match the object are identified; and executing the actions defined by the simple and complex policies corresponding to the object. 10. The method of claim 1 , wherein prefixes of overlapping queries are only stored once in the simple policies data structure. | 0.842822 |
8,407,162 | 21 | 28 | 21. A method for network management implemented in or in association with a network node, comprising the steps of: modelling network domain and behaviour models using formal ontologies comprising inference capabilities to provide a formal ontology model domain and behavior description; adding, in an annotating step, semantic information to the formal domain and behaviour ontology model; and elaborating an algorithm adapted to generate and update a probabilistic causal graph structure using said formal ontology model and said inference capabilities. | 21. A method for network management implemented in or in association with a network node, comprising the steps of: modelling network domain and behaviour models using formal ontologies comprising inference capabilities to provide a formal ontology model domain and behavior description; adding, in an annotating step, semantic information to the formal domain and behaviour ontology model; and elaborating an algorithm adapted to generate and update a probabilistic causal graph structure using said formal ontology model and said inference capabilities. 28. A method according to claim 21 , wherein the modelling step comprises: using a modelling language supporting formal ontologies based on Description Logic, Frame Logic or Description Logic and Frame Logic to provide the formal ontologies. | 0.723624 |
7,523,102 | 1 | 3 | 1. A system for searching for content identified using text and symbols of a complex language associated with multiple written forms, the system comprising: a computer-readable storage medium having stored thereon an asset repository associated with multiple searchable assets; a computer-readable storage medium having stored thereon a vocabulary knowledge base for storing vocabulary information associated with the complex language, wherein the vocabulary knowledge base stores information related to multiple semantic concepts that are usable to identify assets within the asset repository, wherein the vocabulary knowledge base is generated or updated by a repeatable method comprising: assigning an identifier to a semantic concept; identifying a main written form for the semantic concept, wherein the main written form is based on at least one of the multiple written forms; for at least one of the multiple written forms associated with the complex language, associating at least one synonymous written form with the semantic concept, wherein the synonymous written form is at least partially distinct from the main written form; and storing the identifier, the main written form, and the at least one synonymous written form in a data storage component associated with the system; and a computing system having a processor to execute a search engine for receiving and executing queries for the searchable assets, wherein the execution is based, at least in part, on the contents of the vocabulary knowledge base. | 1. A system for searching for content identified using text and symbols of a complex language associated with multiple written forms, the system comprising: a computer-readable storage medium having stored thereon an asset repository associated with multiple searchable assets; a computer-readable storage medium having stored thereon a vocabulary knowledge base for storing vocabulary information associated with the complex language, wherein the vocabulary knowledge base stores information related to multiple semantic concepts that are usable to identify assets within the asset repository, wherein the vocabulary knowledge base is generated or updated by a repeatable method comprising: assigning an identifier to a semantic concept; identifying a main written form for the semantic concept, wherein the main written form is based on at least one of the multiple written forms; for at least one of the multiple written forms associated with the complex language, associating at least one synonymous written form with the semantic concept, wherein the synonymous written form is at least partially distinct from the main written form; and storing the identifier, the main written form, and the at least one synonymous written form in a data storage component associated with the system; and a computing system having a processor to execute a search engine for receiving and executing queries for the searchable assets, wherein the execution is based, at least in part, on the contents of the vocabulary knowledge base. 3. The system of claim 1 wherein the asset repository stores data associated with images. | 0.865559 |
9,639,600 | 1 | 8 | 1. A non-transitory computer readable medium comprising computer executable instructions stored thereon to cause one or more processing units to: obtain a first plurality of messages for a first user, wherein the first plurality of messages comprises: one or more messages in each of a first plurality of formats; and one or more messages sent or received via each of a first plurality of protocols; create one or more associations between one or more of the first plurality of messages, wherein the instructions to create one or more associations between one or more of the first plurality of messages comprise instructions to: perform a semantic analysis on the first plurality of messages; and create one or more clusters of messages from the first plurality of messages based, at least in part, on the semantic analysis, wherein a cluster of messages comprises two or more messages that are associated together; receive a query from the first user requesting at least one message from the first plurality of messages; generate one or more index search terms based, at least in part, on the received query; and generate a result set of messages in response to the generated one or more index search terms, wherein the result set is based, at least in part, on one or more index search parameters for one or more of the generated one or more index search terms, and wherein at least one of the one or more index search parameters is determined individually for the first user. | 1. A non-transitory computer readable medium comprising computer executable instructions stored thereon to cause one or more processing units to: obtain a first plurality of messages for a first user, wherein the first plurality of messages comprises: one or more messages in each of a first plurality of formats; and one or more messages sent or received via each of a first plurality of protocols; create one or more associations between one or more of the first plurality of messages, wherein the instructions to create one or more associations between one or more of the first plurality of messages comprise instructions to: perform a semantic analysis on the first plurality of messages; and create one or more clusters of messages from the first plurality of messages based, at least in part, on the semantic analysis, wherein a cluster of messages comprises two or more messages that are associated together; receive a query from the first user requesting at least one message from the first plurality of messages; generate one or more index search terms based, at least in part, on the received query; and generate a result set of messages in response to the generated one or more index search terms, wherein the result set is based, at least in part, on one or more index search parameters for one or more of the generated one or more index search terms, and wherein at least one of the one or more index search parameters is determined individually for the first user. 8. The non-transitory computer readable medium of claim 1 , further comprising instructions stored thereon to cause the one or more processing units to adjust at least one of the one or more index search parameters at a regular or semi-regular time interval. | 0.598131 |
9,299,342 | 9 | 11 | 9. A system comprising: at least one processor; and a memory operatively connected with the processor storing instructions, that when executed on the processor, cause the processor to execute operations that comprise: receiving a spoken query from a user, creating an adapted language model to process the spoken query, wherein the adapted language model is created by expanding a set of previous queries of the user by interpolating previous queries of a plurality of other users that share at least one common characteristic with the previous queries of the user, wherein the common characteristic is data for a selected uniform resource locator that is included in the previous queries of the user and included in the previous queries of the plurality of other users, and processing data associated with the spoken query by applying the adapted language model to generate a recognition result for the spoken query. | 9. A system comprising: at least one processor; and a memory operatively connected with the processor storing instructions, that when executed on the processor, cause the processor to execute operations that comprise: receiving a spoken query from a user, creating an adapted language model to process the spoken query, wherein the adapted language model is created by expanding a set of previous queries of the user by interpolating previous queries of a plurality of other users that share at least one common characteristic with the previous queries of the user, wherein the common characteristic is data for a selected uniform resource locator that is included in the previous queries of the user and included in the previous queries of the plurality of other users, and processing data associated with the spoken query by applying the adapted language model to generate a recognition result for the spoken query. 11. The system of claim 9 , wherein the operations further comprising generating a personalized language model for the user based on the adapted language model, and applying the personalized language model to process a subsequent query of the user. | 0.881226 |
8,959,021 | 6 | 7 | 6. A computer-implemented method comprising: receiving, by a computing device comprising one or more processors, a first request to generate a first audio representation of a first text; determining, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generating the first audio representation using the local text-to-speech module; receiving a second request to generate a second audio representation of a second text; determining, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; sending the second text to the remote text-to-speech system; and receiving the second audio representation from the remote text-to-speech system. | 6. A computer-implemented method comprising: receiving, by a computing device comprising one or more processors, a first request to generate a first audio representation of a first text; determining, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generating the first audio representation using the local text-to-speech module; receiving a second request to generate a second audio representation of a second text; determining, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; sending the second text to the remote text-to-speech system; and receiving the second audio representation from the remote text-to-speech system. 7. The computer-implemented method of claim 6 , wherein the first characteristic comprises one of: an absence of a network connection; a latency of an available network connection; a presence of voice data on the computing device; a computing capability of the computing device; or a type of application requesting the audio representation. | 0.526462 |
8,990,233 | 1 | 3 | 1. A method for implementing a context aware service application, comprising a context aware service platform having at least a processor executing program codes of the context aware service application stored in a non-transitory computer readable memory to perform functions, comprising: receiving a first context request from a context aware client, wherein the first context request carries description information corresponding to requested context information; and matching a released context source by using the description information, and if matching succeeds, acquiring context information provided by at least one matched context source, and sending acquired context information to the context aware client, wherein the acquiring of context information provided by the at least one matched context source, comprising: filtering a collection of matched context sources according to a preset preference policy, and delivering, to the context aware client, information about the collection of matched context sources acquired by filtering the collection of matched context sources; and if a first selective context request from the context aware client is received, and the first selective context request carries information about a context source selected by the context aware client from the collection of context sources, acquiring context information provided by the context source selected by the context aware client. | 1. A method for implementing a context aware service application, comprising a context aware service platform having at least a processor executing program codes of the context aware service application stored in a non-transitory computer readable memory to perform functions, comprising: receiving a first context request from a context aware client, wherein the first context request carries description information corresponding to requested context information; and matching a released context source by using the description information, and if matching succeeds, acquiring context information provided by at least one matched context source, and sending acquired context information to the context aware client, wherein the acquiring of context information provided by the at least one matched context source, comprising: filtering a collection of matched context sources according to a preset preference policy, and delivering, to the context aware client, information about the collection of matched context sources acquired by filtering the collection of matched context sources; and if a first selective context request from the context aware client is received, and the first selective context request carries information about a context source selected by the context aware client from the collection of context sources, acquiring context information provided by the context source selected by the context aware client. 3. The method according to claim 1 , wherein if matching the released context sources by using the description information fails, the method further comprises: obtaining a keyword through association and inference by using the description information; and matching released context sources by using the keyword, and if matching succeeds, acquiring context information provided by at least one matched context source, and sending acquired context information to the context aware client. | 0.648336 |
8,077,975 | 8 | 9 | 8. The method according to claim 7 , wherein the lookup table comprises a second word that also identifies the candidate spoken mathematical symbol. | 8. The method according to claim 7 , wherein the lookup table comprises a second word that also identifies the candidate spoken mathematical symbol. 9. The method according to claim 8 , the candidate spoken word comprising the word βplus,β the second word comprising the word βadd,β and the candidate spoken mathematical symbol comprising the symbol β+.β | 0.5 |
9,542,473 | 15 | 19 | 15. A search system for providing access to one or more tag collections comprising: one or more processors; and one or more computer storage media storing computer-useable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: providing, by the search system, a first search result to a first user in response to a search query submitted by the first user to the search system; providing a first tag to the first user as a suggested tag for the first search result based on the first search result being tagged with the first tag in a personal tag collection of a second user, the personal tag collection being of tagged search results that are searchable in the search system by the second user and any subset of users of the search system specified by the second user in a privacy setting of the personal tag collection; based on identifying the first user tagging the first search result with the first tag, organizing the first search result into a first public tag collection associated with the first tag, the first public tag collection comprising a plurality of search results that are tagged with the first tag by a plurality of users and are publicly searchable by the users in the search system; receiving a tag search from a third user, the tag search specifying the first tag; in response to the receiving of the tag search, searching, by the search system, the first public tag collection; and providing, by the search system, to the third user in response to the tag search the first search result from the first public tag collection. | 15. A search system for providing access to one or more tag collections comprising: one or more processors; and one or more computer storage media storing computer-useable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: providing, by the search system, a first search result to a first user in response to a search query submitted by the first user to the search system; providing a first tag to the first user as a suggested tag for the first search result based on the first search result being tagged with the first tag in a personal tag collection of a second user, the personal tag collection being of tagged search results that are searchable in the search system by the second user and any subset of users of the search system specified by the second user in a privacy setting of the personal tag collection; based on identifying the first user tagging the first search result with the first tag, organizing the first search result into a first public tag collection associated with the first tag, the first public tag collection comprising a plurality of search results that are tagged with the first tag by a plurality of users and are publicly searchable by the users in the search system; receiving a tag search from a third user, the tag search specifying the first tag; in response to the receiving of the tag search, searching, by the search system, the first public tag collection; and providing, by the search system, to the third user in response to the tag search the first search result from the first public tag collection. 19. The system of claim 15 , wherein the operations further comprise: receiving, by the search system, the tag search as a temporal tag search; and identifying a time span associated with the temporal tag search for the searching, the searching being for one or more tagged search results corresponding to the time span. | 0.747634 |
8,572,021 | 1 | 7 | 1. A method comprising: receiving a plurality of medical documents, the plurality of medical documents including a first set of medical documents in a first format and a second set of medical documents in a second format, wherein the first format is an image-based format and the second format is in a structured data format, and wherein the structured data format is in a non-image text data organized by fields and respective values; determining a schema, the schema including a plurality of categories determined based on an expected structural content in the first set of medical documents or second set of medical documents; determining indices from the plurality of categories to be used for tagging the first set of medical documents and the second set of medical documents when converted into the image-based format based on a review of an organizing principle to which a common set of descriptors can be identified to tag and organize images of the first set of medical documents and the second set of medical documents; converting the non-image text data of the second set of medical documents into images in the image-based format based on the determined indices, wherein the second format is removed in the conversion and content included in each image is determined based on the determined indices applying to the fields and respective values; indexing images of the first medical documents and the images of the second medical documents in the image-based format by associating the determined indices based on the schema with content determined from the first and second medical documents; and storing the images of the first set of medical documents and the images of the second set of medical documents in the image-based format with the indices to allow searching of both the first set of medical documents and the second set of medical documents together based on a search query. | 1. A method comprising: receiving a plurality of medical documents, the plurality of medical documents including a first set of medical documents in a first format and a second set of medical documents in a second format, wherein the first format is an image-based format and the second format is in a structured data format, and wherein the structured data format is in a non-image text data organized by fields and respective values; determining a schema, the schema including a plurality of categories determined based on an expected structural content in the first set of medical documents or second set of medical documents; determining indices from the plurality of categories to be used for tagging the first set of medical documents and the second set of medical documents when converted into the image-based format based on a review of an organizing principle to which a common set of descriptors can be identified to tag and organize images of the first set of medical documents and the second set of medical documents; converting the non-image text data of the second set of medical documents into images in the image-based format based on the determined indices, wherein the second format is removed in the conversion and content included in each image is determined based on the determined indices applying to the fields and respective values; indexing images of the first medical documents and the images of the second medical documents in the image-based format by associating the determined indices based on the schema with content determined from the first and second medical documents; and storing the images of the first set of medical documents and the images of the second set of medical documents in the image-based format with the indices to allow searching of both the first set of medical documents and the second set of medical documents together based on a search query. 7. The method of claim 1 , wherein the plurality of medical documents are received from different medical providers. | 0.861905 |
9,147,220 | 15 | 17 | 15. One non-transitory, machine-readable media having machine-readable instructions thereon for managing user profiles stored in association with business information for user-selected businesses and for identifying additional businesses at least partially based on social graph information and affinity group information, which instructions, when executed by one or more processing devices, causes the one or more instructions to: aggregate, via one or more network interfaces of a server system, social graph information, user preference information relating to the business information, and affinity group information from one or more remote data sources; identify a first user having a first user profile stored in one or more databases of the server system, the first user profile associated with a first set of business information for a first set of businesses previously selected by the first user for saving in association with the first user profile; determine a location corresponding to the first user; search for one or more additional businesses relevant to the location, to identify at least one of the one or more additional businesses to the first user with an option to add the at least one of the one or more additional businesses to the first set of businesses previously selected by the first user, the searching comprising: processing the social graph information relating to a set of users to identify information about one or more networks of social relationships between two or more users of the set of users, the one or more networks of social relationships being associated with one or more social networking websites, wherein the set of users comprises the first user; processing the user preference information relating to a second set of businesses, the user preference information indicating that, for one or more businesses of the second set of businesses, one or more users of the set of users have indicated one or more preferences for the one or more businesses of the second set of businesses; process the affinity group information to identify whether the one or more users of the set of users correspond to one or more affinity groups; and selecting the at least one of the one or more additional businesses based at least in part on the location, the processing the social graph information, the processing the user preference information, and the processing the affinity group information; transmit, via the one or more network interfaces, to an end-user device an indication of the at least one of the one or more additional businesses, causing a user-selectable option to add the at least one of the one or more additional businesses to the first set of businesses previously selected by the first user; and responsive to a selection of the user-selectable option, save additional business information corresponding to the at least one of the one or more additional businesses in association with the first user profile in the one or more databases. | 15. One non-transitory, machine-readable media having machine-readable instructions thereon for managing user profiles stored in association with business information for user-selected businesses and for identifying additional businesses at least partially based on social graph information and affinity group information, which instructions, when executed by one or more processing devices, causes the one or more instructions to: aggregate, via one or more network interfaces of a server system, social graph information, user preference information relating to the business information, and affinity group information from one or more remote data sources; identify a first user having a first user profile stored in one or more databases of the server system, the first user profile associated with a first set of business information for a first set of businesses previously selected by the first user for saving in association with the first user profile; determine a location corresponding to the first user; search for one or more additional businesses relevant to the location, to identify at least one of the one or more additional businesses to the first user with an option to add the at least one of the one or more additional businesses to the first set of businesses previously selected by the first user, the searching comprising: processing the social graph information relating to a set of users to identify information about one or more networks of social relationships between two or more users of the set of users, the one or more networks of social relationships being associated with one or more social networking websites, wherein the set of users comprises the first user; processing the user preference information relating to a second set of businesses, the user preference information indicating that, for one or more businesses of the second set of businesses, one or more users of the set of users have indicated one or more preferences for the one or more businesses of the second set of businesses; process the affinity group information to identify whether the one or more users of the set of users correspond to one or more affinity groups; and selecting the at least one of the one or more additional businesses based at least in part on the location, the processing the social graph information, the processing the user preference information, and the processing the affinity group information; transmit, via the one or more network interfaces, to an end-user device an indication of the at least one of the one or more additional businesses, causing a user-selectable option to add the at least one of the one or more additional businesses to the first set of businesses previously selected by the first user; and responsive to a selection of the user-selectable option, save additional business information corresponding to the at least one of the one or more additional businesses in association with the first user profile in the one or more databases. 17. The one or more non-transitory, machine-readable media for managing user profiles stored in association with business information for user-selected businesses and for identifying additional businesses at least partially based on social graph information and affinity group information of claim 15 , wherein the aggregating the social graph information, the user preference information relating to the business information, and the affinity group information from one or more remote data sources comprises: processing transmissions from user devices, the transmissions indicative of user selections of businesses via browser-enabled options facilitated by browser plug-ins. | 0.610599 |
8,953,773 | 1 | 2 | 1. A method, comprising: analyzing, via a work assignment engine, a work item for work assignment information, wherein the work item represents a contact received at a contact center; determining, via the work assignment engine, whether the work assignment information includes customer information for assigning the work item to a resource of the contact center other than an interactive voice response (IVR) resource; determining, via the work assignment engine, a first IVR resource of a plurality of IVR resources that is capable of obtaining a first portion of the customer information when the work assignment information does not include the customer information; and assigning, via the work assignment engine, the work item to the first IVR resource when it is determined that the work assignment information does not include the customer information, wherein the first IVR resource is configured to execute a first IVR function configured to obtain the first portion of the customer information, wherein the first IVR function represents an individual IVR function that is separate and apart from an IVR unit and other IVR functions, and wherein the first IVR resource is configured to automatically return the work item to the work assignment engine after executing the first IVR function. | 1. A method, comprising: analyzing, via a work assignment engine, a work item for work assignment information, wherein the work item represents a contact received at a contact center; determining, via the work assignment engine, whether the work assignment information includes customer information for assigning the work item to a resource of the contact center other than an interactive voice response (IVR) resource; determining, via the work assignment engine, a first IVR resource of a plurality of IVR resources that is capable of obtaining a first portion of the customer information when the work assignment information does not include the customer information; and assigning, via the work assignment engine, the work item to the first IVR resource when it is determined that the work assignment information does not include the customer information, wherein the first IVR resource is configured to execute a first IVR function configured to obtain the first portion of the customer information, wherein the first IVR function represents an individual IVR function that is separate and apart from an IVR unit and other IVR functions, and wherein the first IVR resource is configured to automatically return the work item to the work assignment engine after executing the first IVR function. 2. The method of claim 1 , wherein each determination is made by applying an IVR script in the work assignment engine. | 0.81388 |
8,700,547 | 14 | 20 | 14. A method of clustering data, comprising the steps of: (a) providing a data matrix representing a set of objects, the set comprising at least three different types of objects, each object having an associated feature matrix and an associated relation matrix, representing respective relations with other objects of the at least three different types; (b) collectively factorizing the data matrix, feature matrices and relation matrices, to discover hidden structures of the set of objects based on both feature information and relation information; (c) generating a symmetric matrix comprising a set of weights, which maximizes an objective function of the data matrix, feature matrices and relation matrices; and (d) deriving a set of cluster indicator matrices based on the collective factorization, to achieve adaptive dimensionality reduction for each of the different types of object, wherein the symmetric matrix is a function of at least: the data matrix, representing respective relations between distinct objects as members of a plurality of sets to be clustered into disjoint clusters; at least one feature matrix denoting feature values for an associated object; a plurality of tentative cluster characterization matrices; and a set of weights for different types of relations and features. | 14. A method of clustering data, comprising the steps of: (a) providing a data matrix representing a set of objects, the set comprising at least three different types of objects, each object having an associated feature matrix and an associated relation matrix, representing respective relations with other objects of the at least three different types; (b) collectively factorizing the data matrix, feature matrices and relation matrices, to discover hidden structures of the set of objects based on both feature information and relation information; (c) generating a symmetric matrix comprising a set of weights, which maximizes an objective function of the data matrix, feature matrices and relation matrices; and (d) deriving a set of cluster indicator matrices based on the collective factorization, to achieve adaptive dimensionality reduction for each of the different types of object, wherein the symmetric matrix is a function of at least: the data matrix, representing respective relations between distinct objects as members of a plurality of sets to be clustered into disjoint clusters; at least one feature matrix denoting feature values for an associated object; a plurality of tentative cluster characterization matrices; and a set of weights for different types of relations and features. 20. The method according to claim 14 , wherein at least one type of object comprises advertisements having a variable sponsorship fee in dependence on another object which is co-clustered based on the cluster indicator matrices. | 0.895317 |
6,012,030 | 13 | 23 | 13. A method for dynamic adjustment of audio prompts in response to a users interaction modality in a communications system having a multimodal interface comprising a speech interface for accessing a speech recognizer and another interface, the method comprising: after prompting a user for input and capturing input, generating an input identifier associated with the user input modality, determining the mode of user input modality and selecting a corresponding one of a foreground state and a background state of the speech interface. | 13. A method for dynamic adjustment of audio prompts in response to a users interaction modality in a communications system having a multimodal interface comprising a speech interface for accessing a speech recognizer and another interface, the method comprising: after prompting a user for input and capturing input, generating an input identifier associated with the user input modality, determining the mode of user input modality and selecting a corresponding one of a foreground state and a background state of the speech interface. 23. A method according to claim 13 wherein when the user selected a non-speech input/output mechanism, switching the speech interface to the background state. | 0.731293 |
4,697,209 | 67 | 68 | 67. The improvement recited in claim 66 wherein the color signal change determining means includes means for comparing a function of the color signal with the average of the color signal and determining the time intervals when the function of the color signal exceeds the average of the color signal and the time intervals when the function of the color signal is less than the average of the color signal to extract the feature string. | 67. The improvement recited in claim 66 wherein the color signal change determining means includes means for comparing a function of the color signal with the average of the color signal and determining the time intervals when the function of the color signal exceeds the average of the color signal and the time intervals when the function of the color signal is less than the average of the color signal to extract the feature string. 68. The improvement recited in claim 67 wherein the function of the color signal and the average of the color signal is determined for only a single line of the frame. | 0.5 |
7,844,642 | 16 | 24 | 16. A memory data structure comprising: an element table wherein said element table is configured to store a plurality of element records corresponding to a plurality of elements of a markup document so that a relational database includes a plurality of element records, and further wherein each element record includes an assigned element ID field and an element data set field; and an attribute table wherein said attribute table is configured to store a plurality of attribute records corresponding to a plurality of attributes of said markup document so that said relational database includes a plurality of attribute records, and further wherein each attribute data record includes an element ID field and an attribute data set wherein said element table and said attribute table include content of said markup document and further wherein a new markup document having a same content as said markup document can be constructed by retrieving said element data set in each of said plurality of element records stored in said element table of said relational database and by retrieving said attribute data set in each of said plurality of attribute records stored in said attribute table of said relational database. | 16. A memory data structure comprising: an element table wherein said element table is configured to store a plurality of element records corresponding to a plurality of elements of a markup document so that a relational database includes a plurality of element records, and further wherein each element record includes an assigned element ID field and an element data set field; and an attribute table wherein said attribute table is configured to store a plurality of attribute records corresponding to a plurality of attributes of said markup document so that said relational database includes a plurality of attribute records, and further wherein each attribute data record includes an element ID field and an attribute data set wherein said element table and said attribute table include content of said markup document and further wherein a new markup document having a same content as said markup document can be constructed by retrieving said element data set in each of said plurality of element records stored in said element table of said relational database and by retrieving said attribute data set in each of said plurality of attribute records stored in said attribute table of said relational database. 24. The data structure of claim 16 wherein said attribute data set contains an attribute name ID. | 0.58547 |
8,979,904 | 6 | 8 | 6. The improvement of claim 5 wherein the sleeve is a first sleeve and further comprising a second sleeve for attachment to a second bone anchor, the second sleeve having a third through bore, the spacer engaging both the first and second sleeves, the tensioned cord slidingly received within the first, second and third through bores, the cord being in one of a fixed and slidable relation with respect to the first and second sleeves. | 6. The improvement of claim 5 wherein the sleeve is a first sleeve and further comprising a second sleeve for attachment to a second bone anchor, the second sleeve having a third through bore, the spacer engaging both the first and second sleeves, the tensioned cord slidingly received within the first, second and third through bores, the cord being in one of a fixed and slidable relation with respect to the first and second sleeves. 8. The improvement of claim 6 , wherein one of the sleeves has an aperture formed therein sized and shaped to receive a portion of a closure top, the closure top portion being fixed against the cord. | 0.5 |
8,818,717 | 14 | 15 | 14. A method for increasing route accuracies, the method comprising: receiving a first GPS waypoint and a first position accuracy prediction (PAP) parameter, wherein the first PAP parameter comprises a first quality parameter set having a first weight value, a first confidence value for the first GPS waypoint, and a first error distance for the first GPS waypoint; reading, with a computer processor, corpus route data from a computer readable medium, the corpus route data comprising a corpus GPS waypoint and an associated corpus PAP parameter, wherein the corpus PAP parameter comprises a second quality parameter set having a second weight value, a second confidence value for the corpus GPS waypoint, and a second error distance for the corpus GPS waypoint; calculating a weight average based on a ratio of the first weight value of the first quality parameter set and the second weight value of the second quality parameter set; computationally extending the first error distance from the PAP parameter of the first GPS waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus GPS waypoint to provide a second probability distribution circle; and computationally generating a vector line between the first GPS waypoint and the corpus GPS waypoint; determining, with the computer processor, an updated GPS waypoint along the vector line between the first GPS waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average; replacing the corpus GPS waypoint with the updated GPS waypoint; adding the first weight value and the second weight value to attain a summed weight value; and replacing the second weight value in the second quality parameter set with the summed weight value. | 14. A method for increasing route accuracies, the method comprising: receiving a first GPS waypoint and a first position accuracy prediction (PAP) parameter, wherein the first PAP parameter comprises a first quality parameter set having a first weight value, a first confidence value for the first GPS waypoint, and a first error distance for the first GPS waypoint; reading, with a computer processor, corpus route data from a computer readable medium, the corpus route data comprising a corpus GPS waypoint and an associated corpus PAP parameter, wherein the corpus PAP parameter comprises a second quality parameter set having a second weight value, a second confidence value for the corpus GPS waypoint, and a second error distance for the corpus GPS waypoint; calculating a weight average based on a ratio of the first weight value of the first quality parameter set and the second weight value of the second quality parameter set; computationally extending the first error distance from the PAP parameter of the first GPS waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus GPS waypoint to provide a second probability distribution circle; and computationally generating a vector line between the first GPS waypoint and the corpus GPS waypoint; determining, with the computer processor, an updated GPS waypoint along the vector line between the first GPS waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average; replacing the corpus GPS waypoint with the updated GPS waypoint; adding the first weight value and the second weight value to attain a summed weight value; and replacing the second weight value in the second quality parameter set with the summed weight value. 15. The method of claim 14 , and further comprising: comparing the first confidence value of the first quality parameter set to the second confidence value of the second quality parameter set; and comparing the first error distance of the first quality parameter set to the first error distance of the second quality parameter set. | 0.583123 |
4,214,125 | 93 | 94 | 93. The method of claim 92 wherein said step of adjusting includes the step of adjusting said phase angles so that the inverse transformation of the amplitudes and adjusted phases contains a minimum amount of power in said preselected portions. | 93. The method of claim 92 wherein said step of adjusting includes the step of adjusting said phase angles so that the inverse transformation of the amplitudes and adjusted phases contains a minimum amount of power in said preselected portions. 94. The combination of claim 93 wherein said step (c) of processing includes the step of delta modulating said equivalent signals and wherein said step of adjusting includes the step of adjusting said phase angles so that the inverse transformation of the amplitudes and adjusted phases is such that the difference between amplitudes of successive digitizations thereof are consistent with possible values obtainable from said step of delta modulating. | 0.5 |
6,055,551 | 1 | 2 | 1. A method of using a computer network for developing a document, comprising the steps of: pre-loading a preliminary list of topics that need to be included in the document, into a computer network for display during a group meeting; selecting members of a group for participation in a facilitated, automated group meeting; reaching consensus on a working list of topics; inputting to provide the working list in the system; for each topic on the working list, in a group meeting, performing the steps of: inputting commands into a facilitator workstation to use team display means to display the topic simultaneously to a plurality of members of the group; simultaneously inputting text for the topic and comments about the text into multiple member workstations; simultaneously displaying the text and a plurality of the comments entered at other workstations at a plurality of member workstations; reaching consensus on the contents of the text for the topic; and editing to create verified text for the topic; said step of simultaneously inputting comments about the text into multiple member workstations comprises the step of simultaneously inputting comments regarding compliance with a Process Safety Management standard into multiple member workstations, and wherein said step of simultaneously displaying a plurality of the comments entered comprises the step of simultaneously displaying a plurality of the comments about compliance with the Process Safety Management standard. | 1. A method of using a computer network for developing a document, comprising the steps of: pre-loading a preliminary list of topics that need to be included in the document, into a computer network for display during a group meeting; selecting members of a group for participation in a facilitated, automated group meeting; reaching consensus on a working list of topics; inputting to provide the working list in the system; for each topic on the working list, in a group meeting, performing the steps of: inputting commands into a facilitator workstation to use team display means to display the topic simultaneously to a plurality of members of the group; simultaneously inputting text for the topic and comments about the text into multiple member workstations; simultaneously displaying the text and a plurality of the comments entered at other workstations at a plurality of member workstations; reaching consensus on the contents of the text for the topic; and editing to create verified text for the topic; said step of simultaneously inputting comments about the text into multiple member workstations comprises the step of simultaneously inputting comments regarding compliance with a Process Safety Management standard into multiple member workstations, and wherein said step of simultaneously displaying a plurality of the comments entered comprises the step of simultaneously displaying a plurality of the comments about compliance with the Process Safety Management standard. 2. The method of claim 1, further comprising the step of reaching consensus on compliance with the Process Safety Management standard. | 0.839713 |
8,166,465 | 16 | 22 | 16. A system for assembling a stream processing application, comprising: a memory device for storing a program; a processor in communication with the memory device, the processor operative with the program to: receive and compile a plurality of data source descriptions, wherein each of the data source descriptions includes a graph pattern that semantically describes an output of a data source; receive and compile a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an input of a component and a graph pattern that semantically describes an output of the component; receive and compile a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; assemble a stream processing graph in response to the stream processing request, wherein the stream processing graph is assembled by using the plurality of data source descriptions and the plurality of component descriptions and includes at least one of the data sources or at least one of the components that satisfies the desired processing outcome; and output the stream processing graph. | 16. A system for assembling a stream processing application, comprising: a memory device for storing a program; a processor in communication with the memory device, the processor operative with the program to: receive and compile a plurality of data source descriptions, wherein each of the data source descriptions includes a graph pattern that semantically describes an output of a data source; receive and compile a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an input of a component and a graph pattern that semantically describes an output of the component; receive and compile a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; assemble a stream processing graph in response to the stream processing request, wherein the stream processing graph is assembled by using the plurality of data source descriptions and the plurality of component descriptions and includes at least one of the data sources or at least one of the components that satisfies the desired processing outcome; and output the stream processing graph. 22. The system of claim 16 , wherein the graph pattern that semantically describes the input of the component and the graph pattern that semantically describes the output of the component are represented in an ontology description language. | 0.744136 |
7,739,602 | 74 | 75 | 74. The method of claim 56 , wherein said address card is incorporated into said publisher's address book from which said selected subscribers' e-mail addresses are extracted, and wherein said address book comprises a virtual button, by selecting a screen name from said address book and then clicking said virtual button, said publisher is prompted to a screen of an editable address card where said publisher completes the contact information of a new contact associated with said selected screen name. | 74. The method of claim 56 , wherein said address card is incorporated into said publisher's address book from which said selected subscribers' e-mail addresses are extracted, and wherein said address book comprises a virtual button, by selecting a screen name from said address book and then clicking said virtual button, said publisher is prompted to a screen of an editable address card where said publisher completes the contact information of a new contact associated with said selected screen name. 75. The method of claim 74 , wherein when said publisher publishes to a recipient not in said publisher's address book, said recipient's e-mail address is automatically added into said publisher's address book. | 0.70339 |
9,037,452 | 19 | 23 | 19. A non-transitory computer readable storage medium readable by a computerized device, said non-transitory computer readable storage medium storing instructions executable by said computerized device to perform a method comprising: method comprising: automatically collecting training data from manually created semantic relations; automatically extracting rules from said training data to produce extracted rules, said extracting rules comprising automatically removing noisy data from said semantic relations by filtering out ones of rules that do not occur in said training data; automatically characterizing existing semantic relations in said training data based on co-occurrence of said extracted rules in said existing semantic relations; automatically constructing semantic relation topics based on said characterizing of said existing semantic relations; and grouping instances of said training data into said semantic relation topics to detect new semantic relations. | 19. A non-transitory computer readable storage medium readable by a computerized device, said non-transitory computer readable storage medium storing instructions executable by said computerized device to perform a method comprising: method comprising: automatically collecting training data from manually created semantic relations; automatically extracting rules from said training data to produce extracted rules, said extracting rules comprising automatically removing noisy data from said semantic relations by filtering out ones of rules that do not occur in said training data; automatically characterizing existing semantic relations in said training data based on co-occurrence of said extracted rules in said existing semantic relations; automatically constructing semantic relation topics based on said characterizing of said existing semantic relations; and grouping instances of said training data into said semantic relation topics to detect new semantic relations. 23. The non-transitory computer readable storage medium according to claim 19 , said automatically removing noisy data comprising: automatically extracting popular argument types and keywords for each semantic relation, said popular argument types and keywords occurring above a previously established occurrence level in said training data; automatically combining said popular argument types and keywords to create initial rules; and filtering out ones of said initial rules that do not occur in said training data to produce said extracted rules. | 0.5 |
9,130,952 | 18 | 19 | 18. The system of claim 17 , wherein the peer manager is configured to maintain a plurality of communications channels via a corresponding one of local MDS peer instances for exchanging metadata with a plurality of remote peers, respectively. | 18. The system of claim 17 , wherein the peer manager is configured to maintain a plurality of communications channels via a corresponding one of local MDS peer instances for exchanging metadata with a plurality of remote peers, respectively. 19. The system of claim 18 , wherein the peer manager is configured to: receive a first signal from the first remote peer indicating that the first communications channel is no longer needed; and in response to the first signal, destroy the first local MDS peer instance to shut down the first communications channel. | 0.5 |
7,890,471 | 6 | 8 | 6. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method of generating a virtual suffix tree (ViST) structure for searching XML documents, comprising the steps of: receiving one or more XML documents; converting the one or more XML documents into respective structure-encoded sequences; generating the ViST structure comprising: generating a D-Ancestor index of node pairs in the respective structure-encoded sequences; generating an S-Ancestor index of labels in one or more suffix trees corresponding to respective ones of the structure-encoded sequences; and generating a doc-ID index encoding the D-Ancestor index and the S-Ancestor index for each node of the structure-encoded sequences, wherein the encoding of the doc-ID index contains an answer to a query matching a non-contiguous subsequence in the doc-ID index; updating the ViST structure, the updating comprising: receiving a new XML document; transforming the new XML document into a respective structure-encoded sequence; inserting each element of the sequence into the D-Ancestor index to update relationships among nodes of the D-Ancestor index wherein the insertion of at least one of the elements results in the creation of a new node; assigning a new label to the new node based on an estimated number of different elements following the element corresponding to the new node and an occurrence probability of each of the elements following the element corresponding to the new node; and inserting the new label into the S-Ancestor index. | 6. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method of generating a virtual suffix tree (ViST) structure for searching XML documents, comprising the steps of: receiving one or more XML documents; converting the one or more XML documents into respective structure-encoded sequences; generating the ViST structure comprising: generating a D-Ancestor index of node pairs in the respective structure-encoded sequences; generating an S-Ancestor index of labels in one or more suffix trees corresponding to respective ones of the structure-encoded sequences; and generating a doc-ID index encoding the D-Ancestor index and the S-Ancestor index for each node of the structure-encoded sequences, wherein the encoding of the doc-ID index contains an answer to a query matching a non-contiguous subsequence in the doc-ID index; updating the ViST structure, the updating comprising: receiving a new XML document; transforming the new XML document into a respective structure-encoded sequence; inserting each element of the sequence into the D-Ancestor index to update relationships among nodes of the D-Ancestor index wherein the insertion of at least one of the elements results in the creation of a new node; assigning a new label to the new node based on an estimated number of different elements following the element corresponding to the new node and an occurrence probability of each of the elements following the element corresponding to the new node; and inserting the new label into the S-Ancestor index. 8. The machine-readable medium of claim 6 , wherein generating the S-Ancestor index comprises generating an S-Ancestor B+Tree, wherein the S-Ancestor B+Tree indexes one or more keys, wherein each of the one or more keys is a pair [begin-ID,end-ID]. | 0.654596 |
7,680,821 | 8 | 9 | 8. A computer implemented method of processing a query to a database in a computer system, wherein the database comprises a table of data and an index correlated to both the query and to the table, the method comprising the following steps: receiving the database query; determining whether data responsive to the query has low distinct cardinality; responsive to determining that the data responsive to the query has low distinct cardinality, accessing the index to determine if the table contains a first data entry satisfying a query predicate; and responsive to determining that the fist data entry satisfies the query and prior to determining that a second data entry satisfies the query, scanning substantially the entire table to retrieve substantially all data values satisfying the query. | 8. A computer implemented method of processing a query to a database in a computer system, wherein the database comprises a table of data and an index correlated to both the query and to the table, the method comprising the following steps: receiving the database query; determining whether data responsive to the query has low distinct cardinality; responsive to determining that the data responsive to the query has low distinct cardinality, accessing the index to determine if the table contains a first data entry satisfying a query predicate; and responsive to determining that the fist data entry satisfies the query and prior to determining that a second data entry satisfies the query, scanning substantially the entire table to retrieve substantially all data values satisfying the query. 9. The method as claimed in claim 8 , further comprising the step of generating a query execution plan. | 0.704023 |
8,032,550 | 16 | 18 | 16. A computer-implemented method, comprising: calculating, by a computer system, a sequence of hash values using a plurality of hash functions for a keyword in a document to be indexed; and using, by the computer system, the sequence of hash values as keys to index a plurality of search indices that are stored across a plurality of storage locations to facilitate a search of the document using the keyword, with each search index providing a reference to a storage location of the next search index in the chain. | 16. A computer-implemented method, comprising: calculating, by a computer system, a sequence of hash values using a plurality of hash functions for a keyword in a document to be indexed; and using, by the computer system, the sequence of hash values as keys to index a plurality of search indices that are stored across a plurality of storage locations to facilitate a search of the document using the keyword, with each search index providing a reference to a storage location of the next search index in the chain. 18. The method of claim 16 , wherein each search index is indexed by a corresponding hash value in the sequence, the last hash value pointing to an entry of the last search index that provides a reference to the identifiers of documents that contain the keyword. | 0.5 |
7,974,984 | 4 | 9 | 4. A computer implemented method for managing taxonomies comprising: retrieving a first taxonomy comprising at least one first category and one or more second taxonomies, at least one second category being associated with at least one of the one or more second taxonomies; analyzing a set of content profiles for content of the first taxonomy using evidence terms from content items; generating, using a computer processor, a category profile for the at least one first category of the first taxonomy based at least in part on the analysis of the set of content profiles for content of the first taxonomy; and creating a new taxonomy by merging the first taxonomy with the second taxonomy based on a comparison of a first category profile of the at least one first category with a second category profile of the at least one second category, wherein the comparing comprises applying a comparator function that identifies a match when a comparison between category profiles is above a threshold value, wherein the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise a controlled vocabulary organized hierarchically to represent relationships between terms in the controlled vocabulary, and wherein categories of the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise at least one labeled vocabulary term, wherein the creation of the new taxonomy comprises a taxonomy workflow process including review and approval of a plurality of tasks in a specified order. | 4. A computer implemented method for managing taxonomies comprising: retrieving a first taxonomy comprising at least one first category and one or more second taxonomies, at least one second category being associated with at least one of the one or more second taxonomies; analyzing a set of content profiles for content of the first taxonomy using evidence terms from content items; generating, using a computer processor, a category profile for the at least one first category of the first taxonomy based at least in part on the analysis of the set of content profiles for content of the first taxonomy; and creating a new taxonomy by merging the first taxonomy with the second taxonomy based on a comparison of a first category profile of the at least one first category with a second category profile of the at least one second category, wherein the comparing comprises applying a comparator function that identifies a match when a comparison between category profiles is above a threshold value, wherein the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise a controlled vocabulary organized hierarchically to represent relationships between terms in the controlled vocabulary, and wherein categories of the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise at least one labeled vocabulary term, wherein the creation of the new taxonomy comprises a taxonomy workflow process including review and approval of a plurality of tasks in a specified order. 9. The method of claim 4 , further comprising creating a category list comprising the at least one first category and the at least one second category. | 0.725455 |
8,510,321 | 1 | 12 | 1. An apparatus for accessing and managing a relational database, said apparatus comprising: a processor; an arrangement for querying a relational database; and an arrangement for accessing semantically relevant query results from the relational database, said accessing arrangement configured to: access at least one ontology; extract domain knowledge from at least one ontology; and employ the domain knowledge in obtaining the semantically relevant query results from the relational database; wherein said semantically relevant query results comprise direct results obtained directly from relational database tables, inferred results inferred utilizing information explicitly listed in the relational database and the at least one ontology, and related results obtained utilizing data in the relational database tables and one or more definitions of similarity of concepts and individuals based on the at least one ontology; and wherein said accessing arrangement acts to: apply a query generalization strategy, the query generalization strategy comprising applying strategies to an original query to obtain a generalized level of queries comprising one or more general queries and repeatedly applying the strategies to the generalized level of queries until a prespecified number of results is obtained; and rank results obtained through the query generalization strategy based on a number generalizations performed. | 1. An apparatus for accessing and managing a relational database, said apparatus comprising: a processor; an arrangement for querying a relational database; and an arrangement for accessing semantically relevant query results from the relational database, said accessing arrangement configured to: access at least one ontology; extract domain knowledge from at least one ontology; and employ the domain knowledge in obtaining the semantically relevant query results from the relational database; wherein said semantically relevant query results comprise direct results obtained directly from relational database tables, inferred results inferred utilizing information explicitly listed in the relational database and the at least one ontology, and related results obtained utilizing data in the relational database tables and one or more definitions of similarity of concepts and individuals based on the at least one ontology; and wherein said accessing arrangement acts to: apply a query generalization strategy, the query generalization strategy comprising applying strategies to an original query to obtain a generalized level of queries comprising one or more general queries and repeatedly applying the strategies to the generalized level of queries until a prespecified number of results is obtained; and rank results obtained through the query generalization strategy based on a number generalizations performed. 12. The apparatus according to claim 1 , wherein said accessing arrangement acts to apply the query generalization strategy to modify the original query semantically with more general queries to obtain broader results. | 0.706989 |
10,002,325 | 1 | 2 | 1. A method of modifying a computer-readable elemental data structure of a knowledge representation system, the method comprising: applying, using at least one processor executing stored program instructions, one or more rules of analysis to deconstruct a knowledge representation into one or more elemental components; adding, using at least one processor executing stored program instructions, data associated with the one or more elemental components to an elemental data structure, the elemental data structure storing data representing concepts and concept relationships; inferring, using at least one processor executing stored program instructions, candidate data associated with the elemental data structure, wherein the inferring comprises detecting language in reference data, wherein the language corresponds to a predetermined linguistic pattern expressing a relationship between at least a first concept and a second concept in natural language; modifying the elemental data structure to combine the candidate data and the data associated with the one or more elemental components, wherein the modifying comprises adding, to the elemental data structure, the first concept, the second concept, and/or the relationship between the first and second concepts expressed by the linguistic pattern detected in the reference data, wherein the reference data is obtained from a source other than the knowledge representation wherein the detected linguistic pattern expresses in natural language that the second concept subsumes the first concept; wherein detecting the language corresponding to the predetermined linguistic pattern comprises detecting in the reference data a first label associated with the first concept, followed by a subsumptive expression, followed by a second label associated with the second concept, wherein the linguistic pattern including the subsumptive expression expresses in natural language that the second concept subsumes the first concept; wherein the subsumptive expression comprises at least one of one or more predetermined words or one or more predetermined symbols; wherein detecting the predetermined linguistic pattern in the reference data comprises detecting in the reference data the first label associated with the first concept and the second label associated with the second concept, wherein a proximity of the first label to the second label is within a threshold proximity; wherein the one or more elemental components are encoded as one or more computer-readable data structures storing data associated with the one or more elemental components, and wherein the reference data is encoded as one or more computer-readable data structures storing data associated with reference communication. | 1. A method of modifying a computer-readable elemental data structure of a knowledge representation system, the method comprising: applying, using at least one processor executing stored program instructions, one or more rules of analysis to deconstruct a knowledge representation into one or more elemental components; adding, using at least one processor executing stored program instructions, data associated with the one or more elemental components to an elemental data structure, the elemental data structure storing data representing concepts and concept relationships; inferring, using at least one processor executing stored program instructions, candidate data associated with the elemental data structure, wherein the inferring comprises detecting language in reference data, wherein the language corresponds to a predetermined linguistic pattern expressing a relationship between at least a first concept and a second concept in natural language; modifying the elemental data structure to combine the candidate data and the data associated with the one or more elemental components, wherein the modifying comprises adding, to the elemental data structure, the first concept, the second concept, and/or the relationship between the first and second concepts expressed by the linguistic pattern detected in the reference data, wherein the reference data is obtained from a source other than the knowledge representation wherein the detected linguistic pattern expresses in natural language that the second concept subsumes the first concept; wherein detecting the language corresponding to the predetermined linguistic pattern comprises detecting in the reference data a first label associated with the first concept, followed by a subsumptive expression, followed by a second label associated with the second concept, wherein the linguistic pattern including the subsumptive expression expresses in natural language that the second concept subsumes the first concept; wherein the subsumptive expression comprises at least one of one or more predetermined words or one or more predetermined symbols; wherein detecting the predetermined linguistic pattern in the reference data comprises detecting in the reference data the first label associated with the first concept and the second label associated with the second concept, wherein a proximity of the first label to the second label is within a threshold proximity; wherein the one or more elemental components are encoded as one or more computer-readable data structures storing data associated with the one or more elemental components, and wherein the reference data is encoded as one or more computer-readable data structures storing data associated with reference communication. 2. The method of claim 1 , wherein the subsumptive expression comprises at least one of βis aβ, βis anβ, βis a field ofβ, or βis a type ofβ. | 0.904632 |
7,730,008 | 12 | 13 | 12. The database analysis system of claim 10 , wherein the first query has a second parameter that corresponds to the object in a second set, wherein the suggestion engine is further configured to: analyze a number of search result elements, for each candidate value of the second parameter, to determine a value of the second parameter corresponding to the result of the first query having the baseline number of search results in the object in the second set, and determine (iii) at least one child of the object in the second set, wherein the number of search result elements for the candidate value of the second parameter of the object in the second set is less than the baseline number, and (iv) at least one parent of the second object in the second set, wherein the number of search result elements for the candidate value of the second parameter of the object in the second set is more than the baseline number, and wherein the recommendation to change the first query further includes at least one child of the object in the second set and at least one parent of the object in the second set. | 12. The database analysis system of claim 10 , wherein the first query has a second parameter that corresponds to the object in a second set, wherein the suggestion engine is further configured to: analyze a number of search result elements, for each candidate value of the second parameter, to determine a value of the second parameter corresponding to the result of the first query having the baseline number of search results in the object in the second set, and determine (iii) at least one child of the object in the second set, wherein the number of search result elements for the candidate value of the second parameter of the object in the second set is less than the baseline number, and (iv) at least one parent of the second object in the second set, wherein the number of search result elements for the candidate value of the second parameter of the object in the second set is more than the baseline number, and wherein the recommendation to change the first query further includes at least one child of the object in the second set and at least one parent of the object in the second set. 13. The database analysis system of claim 12 , further comprising a query builder configured to convert the first query into a form that differentiates the parameter that corresponds to the object in the set from the second parameter of the object in the second set. | 0.5 |
8,122,371 | 14 | 15 | 14. A computer-implemented method according to claim 4 , further comprising: providing for display to the user a plurality of items; and providing an ability for the user to sort or filter the displayed plurality of items based on at least one criterion or response for the item. | 14. A computer-implemented method according to claim 4 , further comprising: providing for display to the user a plurality of items; and providing an ability for the user to sort or filter the displayed plurality of items based on at least one criterion or response for the item. 15. A computer-implemented method according to claim 14 , further comprising: providing an ability for the user to sort or filter the displayed plurality of items based on a detected bias of the user. | 0.5 |
7,870,206 | 13 | 16 | 13. A user interface for use in making non-shared linked documents in email messages accessible to recipients, comprising: a user input for enabling a sender to compose an email message, wherein upon initiation of sending of the email message by the sender, the MIME of the email is automatically parsed through to detect URL tags indicating that a linked document is contained within the email message, and, upon detection of a URL tag, a prefix of the URL tag is checked to determine if the linked document is accessible to a recipient; and a display for providing the sender with the capability for selecting at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message, the display further provides the sender with the capability for selecting an option of sending a Notes Universal ID of a linked Notes email with a MIME id of the Notes email if the sender was originally a recipient of the linked Notes email that is being sent. | 13. A user interface for use in making non-shared linked documents in email messages accessible to recipients, comprising: a user input for enabling a sender to compose an email message, wherein upon initiation of sending of the email message by the sender, the MIME of the email is automatically parsed through to detect URL tags indicating that a linked document is contained within the email message, and, upon detection of a URL tag, a prefix of the URL tag is checked to determine if the linked document is accessible to a recipient; and a display for providing the sender with the capability for selecting at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message, the display further provides the sender with the capability for selecting an option of sending a Notes Universal ID of a linked Notes email with a MIME id of the Notes email if the sender was originally a recipient of the linked Notes email that is being sent. 16. The user interface of claim 13 , wherein the user defines the prefixes of URLs for non-shared documents. | 0.789063 |
7,644,047 | 8 | 9 | 8. An information processing apparatus for use in an information processing apparatus, for use in an information system, for identifying information sets associated with a predetermined information category, the apparatus comprising: generating means for generating, in the form of a matrix, a set of probabilities indicative of the semantic similarity of words selected from a sample set of one or more documents representative of the predetermined information category; calculating means arranged to calculate, for each information set, a vector of values representing the relative frequency of occurrence, in the information set, of words represented in a matrix generated by the generating means; and clustering means arranged to determine a measure of mutual similarity between pairs of information sets, using the respectively calculated vectors and the generated matrix, and to use the determined measures in a clustering algorithm to select one or more information sets to associate with the predetermined information category, wherein said generating means are arranged, in use: (i) for each word selected from said sample set: (a) to identify, in documents of said sample set, word sequences comprising the word and a predetermined number of other words; (b) to calculate a relative frequency of occurrence for each distinct word sequence among word sequences containing the word; and (c) to generate a fuzzy set comprising, for groups of word sequences containing the word, corresponding fuzzy membership values calculated from the relative frequencies determined at step (b); and (ii) to calculate, for each pair of words of said plurality of words, using respective fuzzy sets generated at step (i), a probability that the first word of the pair is semantically suitable as a replacement for the second word of the pair. | 8. An information processing apparatus for use in an information processing apparatus, for use in an information system, for identifying information sets associated with a predetermined information category, the apparatus comprising: generating means for generating, in the form of a matrix, a set of probabilities indicative of the semantic similarity of words selected from a sample set of one or more documents representative of the predetermined information category; calculating means arranged to calculate, for each information set, a vector of values representing the relative frequency of occurrence, in the information set, of words represented in a matrix generated by the generating means; and clustering means arranged to determine a measure of mutual similarity between pairs of information sets, using the respectively calculated vectors and the generated matrix, and to use the determined measures in a clustering algorithm to select one or more information sets to associate with the predetermined information category, wherein said generating means are arranged, in use: (i) for each word selected from said sample set: (a) to identify, in documents of said sample set, word sequences comprising the word and a predetermined number of other words; (b) to calculate a relative frequency of occurrence for each distinct word sequence among word sequences containing the word; and (c) to generate a fuzzy set comprising, for groups of word sequences containing the word, corresponding fuzzy membership values calculated from the relative frequencies determined at step (b); and (ii) to calculate, for each pair of words of said plurality of words, using respective fuzzy sets generated at step (i), a probability that the first word of the pair is semantically suitable as a replacement for the second word of the pair. 9. An information processing apparatus according to claim 8 , wherein the clustering algorithm is a hierarchic agglomerative clustering algorithm. | 0.5 |
9,235,634 | 1 | 3 | 1. A method of generating annotation tags for classifying media, said method performed by a signal processing apparatus comprising a processor and a memory, and said method comprising: receiving media to be classified, said media received in electronic form; retrieving an annotation ontology tree associated with a respective media class and comprising a set of hierarchical descriptors for labeling objects or things with increasing specificity; representing the media within a selected representation domain by applying a corresponding signal transform to the media to obtain a transformed media comprising features characteristic of the media in the selected representation domain, wherein the selected representation domain is non-human perceivable; comparing the features of the transformed media to explanatory representation data that, within the selected representation domain, represents bottom-level descriptors in the hierarchical set of descriptors of the annotation ontology tree; generating a set of annotation tags from one or more of the hierarchical descriptors in the annotation ontology tree that correspond to any of the explanatory representation data that, based on the comparing, are identified as matching the features of the transformed media; and applying one or more of the annotation tags to the media and thereby classifying the media according to the applied tags. | 1. A method of generating annotation tags for classifying media, said method performed by a signal processing apparatus comprising a processor and a memory, and said method comprising: receiving media to be classified, said media received in electronic form; retrieving an annotation ontology tree associated with a respective media class and comprising a set of hierarchical descriptors for labeling objects or things with increasing specificity; representing the media within a selected representation domain by applying a corresponding signal transform to the media to obtain a transformed media comprising features characteristic of the media in the selected representation domain, wherein the selected representation domain is non-human perceivable; comparing the features of the transformed media to explanatory representation data that, within the selected representation domain, represents bottom-level descriptors in the hierarchical set of descriptors of the annotation ontology tree; generating a set of annotation tags from one or more of the hierarchical descriptors in the annotation ontology tree that correspond to any of the explanatory representation data that, based on the comparing, are identified as matching the features of the transformed media; and applying one or more of the annotation tags to the media and thereby classifying the media according to the applied tags. 3. The method according to claim 1 , wherein applying the one or more annotation tags is dependent on user input. | 0.81891 |
4,689,743 | 24 | 41 | 24. An apparatus as claimed in claim 22 wherein: the number ofcode components in a character code defines a length number; said set defines standard sub-sets ccording to the length numbers of the standard characters, the members of a standard sub-set each having the same length number, each standard sub-set representing a different length number and each standard sub-set being ordered according to said complexity numbers; and, said boundary setting means is operable to specify said portion of said set according to the length and complexity numbers of the incoming character. | 24. An apparatus as claimed in claim 22 wherein: the number ofcode components in a character code defines a length number; said set defines standard sub-sets ccording to the length numbers of the standard characters, the members of a standard sub-set each having the same length number, each standard sub-set representing a different length number and each standard sub-set being ordered according to said complexity numbers; and, said boundary setting means is operable to specify said portion of said set according to the length and complexity numbers of the incoming character. 41. An apparatus as claimed in claim 24 wherein said boundary setting means is operable to specify said portion of said set according to the length and complexity numbers and a pre-determined operator expertise index, whereby said portion is relatively large for inexpert operators and relatively small for expert operators. | 0.695489 |
8,545,538 | 1 | 8 | 1. A method of vertebral stabilization, comprising: affixing a first portion of a first bone fastener to a first vertebral bone; coupling a second portion of the first bone fastener to a first portion of an interconnecting member, the interconnecting member further comprising at least a second portion configured to be at least partially contained within a first housing; affixing a first portion of a bone fixation member to a second vertebral bone, the bone fixation member having a second portion configured to be at least partially contained within a second housing; seating the first housing and the second portion of the interconnecting member contained therein within a first socket of an outer housing member; seating the second housing and the second portion of the bone fixation member contained therein within a second socket of the outer housing member; and transitioning a locking member from a first to a second state, the second state immobilizing each of the first housing and the second housing relative to the outer housing; wherein each of the second portion of the interconnecting member and the second portion of the bone fixation member remain movable relative to the outer housing member when the locking feature is in both the first and the second state. | 1. A method of vertebral stabilization, comprising: affixing a first portion of a first bone fastener to a first vertebral bone; coupling a second portion of the first bone fastener to a first portion of an interconnecting member, the interconnecting member further comprising at least a second portion configured to be at least partially contained within a first housing; affixing a first portion of a bone fixation member to a second vertebral bone, the bone fixation member having a second portion configured to be at least partially contained within a second housing; seating the first housing and the second portion of the interconnecting member contained therein within a first socket of an outer housing member; seating the second housing and the second portion of the bone fixation member contained therein within a second socket of the outer housing member; and transitioning a locking member from a first to a second state, the second state immobilizing each of the first housing and the second housing relative to the outer housing; wherein each of the second portion of the interconnecting member and the second portion of the bone fixation member remain movable relative to the outer housing member when the locking feature is in both the first and the second state. 8. A method as in claim 1 , wherein the second portion of the interconnecting member comprises a spherical end segment. | 0.823442 |
9,412,367 | 34 | 35 | 34. The computerized information and display apparatus of claim 33 , wherein the performance of the desired action includes identification a plurality of approximate but non-exact matches for a user query that is at least part of the speech received from the user. | 34. The computerized information and display apparatus of claim 33 , wherein the performance of the desired action includes identification a plurality of approximate but non-exact matches for a user query that is at least part of the speech received from the user. 35. The computerized information and display apparatus of claim 34 , wherein the at least portion of the received information comprises a map image or map graphic of a geographic region, the map image or map graphic which is viewable on both a display of the portable electronic device and the display device of the host system; and wherein the at least portion of the received information further comprises directions to an organization or entity. | 0.5 |
9,152,702 | 22 | 23 | 22. The system of claim 13 , wherein the search provider is operative to: receive one or more facets selected by a user from the selected number of facets; refine the search result set based on the one or more facets selected by the user. | 22. The system of claim 13 , wherein the search provider is operative to: receive one or more facets selected by a user from the selected number of facets; refine the search result set based on the one or more facets selected by the user. 23. The system of claim 22 , wherein the refining the search result set comprises aggregating the facets selected by the user, and refining the search result set based on the aggregated facets. | 0.5 |
7,944,579 | 1 | 9 | 1. A multi-function machine of the type having the capability of scanning, copying and electronically transmitting documents, the machine comprising: a scanning assembly; a printing assembly; a counting and reporting module configured to generate a summary report corresponding to at least one batch of documents comprising a document set scanned by the scanning assembly, said counting and reporting module further configured to dispatch the summary report to at least one of a printing assembly, a storage device, or a network device; wherein the counting and reporting module is configured to: enable a user to select whether to count the number of documents in the document set and/or whether to count the number of images in the document set; receive at least one input and determining whether the user selected to count the number of documents in the document set and/or whether the user selected to count the number of images in the document set; count the number of documents in the document set scanned during the document scanning procedure if the user selected to count the number of documents in the document set; and count the number of images in the document set scanned during the document scanning procedure if the user selected to count the number of images in the document set; at least one processor configured to sense the completion of a batch scanning procedure by the scanning assembly. | 1. A multi-function machine of the type having the capability of scanning, copying and electronically transmitting documents, the machine comprising: a scanning assembly; a printing assembly; a counting and reporting module configured to generate a summary report corresponding to at least one batch of documents comprising a document set scanned by the scanning assembly, said counting and reporting module further configured to dispatch the summary report to at least one of a printing assembly, a storage device, or a network device; wherein the counting and reporting module is configured to: enable a user to select whether to count the number of documents in the document set and/or whether to count the number of images in the document set; receive at least one input and determining whether the user selected to count the number of documents in the document set and/or whether the user selected to count the number of images in the document set; count the number of documents in the document set scanned during the document scanning procedure if the user selected to count the number of documents in the document set; and count the number of images in the document set scanned during the document scanning procedure if the user selected to count the number of images in the document set; at least one processor configured to sense the completion of a batch scanning procedure by the scanning assembly. 9. The multi-function machine according to claim 1 , wherein at least one of the scanned documents is depicted in thumbnail form in the summary report. | 0.824009 |
8,538,957 | 18 | 19 | 18. The system of claim 17 , wherein calculating the similarity score for a candidate translation comprises: generating feature scores for pairs of visual media search results, wherein each pair includes a respective visual media search result from the first group of visual media search results and a respective visual media search result from the second group of visual media search results, and wherein each feature score estimates visual similarity between a pair's respective visual media search results from a plurality of features of the respective visual media search results; and generating the similarity score from the feature scores. | 18. The system of claim 17 , wherein calculating the similarity score for a candidate translation comprises: generating feature scores for pairs of visual media search results, wherein each pair includes a respective visual media search result from the first group of visual media search results and a respective visual media search result from the second group of visual media search results, and wherein each feature score estimates visual similarity between a pair's respective visual media search results from a plurality of features of the respective visual media search results; and generating the similarity score from the feature scores. 19. The system of claim 18 , wherein generating the similarity score from the feature scores includes averaging a number of top feature scores. | 0.798023 |
8,832,543 | 13 | 14 | 13. The computer system of claim 12 , wherein the processing unit is further configured to: display a recovery user interface comprising a selectable action for pasting the document element at the paste point with formatting of the source document; and paste the document element at the paste point with the formatting of the source document in response to receiving the selected action from the recovery user interface. | 13. The computer system of claim 12 , wherein the processing unit is further configured to: display a recovery user interface comprising a selectable action for pasting the document element at the paste point with formatting of the source document; and paste the document element at the paste point with the formatting of the source document in response to receiving the selected action from the recovery user interface. 14. The computer system of claim 13 , wherein the processing unit is further configured to paste the document element at the paste point with formatting of the source table when the document element and the target table do not have the same number of columns. | 0.700924 |
7,577,901 | 16 | 17 | 16. A machine-readable medium providing instructions which, when executed by a set of one or more processors, cause said set of one or more processors to perform the following: reproducing a paper document via a document reproduction system; creating a multimedia annotation for the paper document during the reproduction, wherein the multimedia annotation is an audio sound that is input by a user via a microphone of the document reproduction system; creating a first multimedia document by combining the paper document and the multimedia annotation, wherein the first multimedia document includes a first bar code that encodes the audio sound therein; processing the first multimedia document; decoding the multimedia annotation from the first bar code; extracting the audio sound; and playing the audio sound via a multimedia player. | 16. A machine-readable medium providing instructions which, when executed by a set of one or more processors, cause said set of one or more processors to perform the following: reproducing a paper document via a document reproduction system; creating a multimedia annotation for the paper document during the reproduction, wherein the multimedia annotation is an audio sound that is input by a user via a microphone of the document reproduction system; creating a first multimedia document by combining the paper document and the multimedia annotation, wherein the first multimedia document includes a first bar code that encodes the audio sound therein; processing the first multimedia document; decoding the multimedia annotation from the first bar code; extracting the audio sound; and playing the audio sound via a multimedia player. 17. The machine-readable medium of claim 16 , wherein a location indicator associated with the multimedia annotation is placed on the first multimedia document, wherein the location indicator indicates where the multimedia annotation can be retrieved and played. | 0.796584 |
6,122,614 | 22 | 24 | 22. The invention according to claim 1 wherein said audio player is implemented by a general purpose computer. | 22. The invention according to claim 1 wherein said audio player is implemented by a general purpose computer. 24. The invention according to claim 22 wherein said general purpose computer implementing said audio player is remotely located, said general purpose computer further including means for receiving said voice dictation file and transmitting said transcribed text via the Internet. | 0.5 |
8,065,315 | 12 | 15 | 12. A search middleware for providing solutions for software incidents, the search middleware comprising: a search interface configured to receive a solution search request from at least one consumer search user interface (UI), the solution search request referencing a software incident of a software application and including context data collected about the software application at the time of the software incident; a solution source manager configured to receive the solution search request and select at least two solution repositories from among a plurality of solution repositories, and based on the consumer search UI, and further configured to determine corresponding communication techniques for communicating with the at least two solution repositories; an attribute manager configured to determine attribute values based on the context data, the attribute values selected from a plurality of attributes and attribute values that are maintained in common for the plurality of solution repositories by the attribute manager; a search dispatcher configured to dispatch the search request to the at least two solution repositories, including the attribute values and using the corresponding communications techniques; at least one index associated with the at least two solution repositories and configured to index documents within the at least two solution repositories based on the attributes and attribute values; a repository search interface associated with each of the at least two solution repositories and configured to translate the search request for input to a native interface for a search of the at least two solution repositories using the at least one index to retrieve solution documents; and a search compiler configured to receive the solution documents and compile the documents into a solution search result for providing to the at least one consumer search UI including an identification of a source solution repository of each solution document in the solution search result. | 12. A search middleware for providing solutions for software incidents, the search middleware comprising: a search interface configured to receive a solution search request from at least one consumer search user interface (UI), the solution search request referencing a software incident of a software application and including context data collected about the software application at the time of the software incident; a solution source manager configured to receive the solution search request and select at least two solution repositories from among a plurality of solution repositories, and based on the consumer search UI, and further configured to determine corresponding communication techniques for communicating with the at least two solution repositories; an attribute manager configured to determine attribute values based on the context data, the attribute values selected from a plurality of attributes and attribute values that are maintained in common for the plurality of solution repositories by the attribute manager; a search dispatcher configured to dispatch the search request to the at least two solution repositories, including the attribute values and using the corresponding communications techniques; at least one index associated with the at least two solution repositories and configured to index documents within the at least two solution repositories based on the attributes and attribute values; a repository search interface associated with each of the at least two solution repositories and configured to translate the search request for input to a native interface for a search of the at least two solution repositories using the at least one index to retrieve solution documents; and a search compiler configured to receive the solution documents and compile the documents into a solution search result for providing to the at least one consumer search UI including an identification of a source solution repository of each solution document in the solution search result. 15. The system of claim 12 wherein the attributes include documents attributes characterizing at least some of the documents in the plurality of solution repositories. | 0.687266 |
8,250,602 | 5 | 6 | 5. The set-top box of claim 1 , wherein the content criteria of the supplemental programming database comprise searchable keywords. | 5. The set-top box of claim 1 , wherein the content criteria of the supplemental programming database comprise searchable keywords. 6. The set-top box of claim 5 , wherein the receiver includes a filter to separate text from the primary programming, and wherein the processor agent includes a keyword search engine to search for keywords from the content criteria of the supplemental programming database within the text from the primary programming. | 0.533724 |
9,081,769 | 2 | 3 | 2. A computer-implemented method comprising: storing, in a translation repository and by a computing device having one or more processors, translation data representing changes to translations during a time interval between a first time and a second time, the translation data identifying text messages in a first language, respective identifiers for each of the text messages, and corresponding translations of a plurality of the text messages into a second language; including, by the computing device, one or more of the respective identifiers in a source code project; building, by the computing device, the source code project into a reference application in the second language, comprising: replacing the identifier of each text message in the source code project with a translation of the text message in the second language made at the second time, and for a text message whose translation has changed during the time interval, inserting the identifier of the text message whose translation has changed as hidden information associated with the translation of the text message, wherein the identifier for a text message whose translation has not changed during the time window is not inserted as hidden information associated with the translation of the text message in the reference application; and rendering, by the computing device, the reference application for presentation to a user for translation checking, including highlighting the text messages that have an associated hidden identifier. | 2. A computer-implemented method comprising: storing, in a translation repository and by a computing device having one or more processors, translation data representing changes to translations during a time interval between a first time and a second time, the translation data identifying text messages in a first language, respective identifiers for each of the text messages, and corresponding translations of a plurality of the text messages into a second language; including, by the computing device, one or more of the respective identifiers in a source code project; building, by the computing device, the source code project into a reference application in the second language, comprising: replacing the identifier of each text message in the source code project with a translation of the text message in the second language made at the second time, and for a text message whose translation has changed during the time interval, inserting the identifier of the text message whose translation has changed as hidden information associated with the translation of the text message, wherein the identifier for a text message whose translation has not changed during the time window is not inserted as hidden information associated with the translation of the text message in the reference application; and rendering, by the computing device, the reference application for presentation to a user for translation checking, including highlighting the text messages that have an associated hidden identifier. 3. The method of claim 2 , wherein the translation data is represented as a list. | 0.911765 |
9,047,623 | 1 | 7 | 1. A system for determining recommendation data, comprising: one or more processors configured to: extract a first set of keywords from a set of user action logs that occurred prior to a predetermined time point; extract a second set of keywords from a set of user action logs that occurred subsequent to the predetermined time point; merge at least a portion of the first set of keywords and at least a portion of the second set of keywords to obtain a third set of keywords; match at least one keyword in the third set of keywords with a database of data that can potentially be recommended to a user; and in the event that a piece of data in the database is determined to match at least one keyword from the third set of keywords, determine that the piece of data is to be recommended to the user; and one or more memories coupled to the one or more processors and configured to provide the one or more processors with instructions. | 1. A system for determining recommendation data, comprising: one or more processors configured to: extract a first set of keywords from a set of user action logs that occurred prior to a predetermined time point; extract a second set of keywords from a set of user action logs that occurred subsequent to the predetermined time point; merge at least a portion of the first set of keywords and at least a portion of the second set of keywords to obtain a third set of keywords; match at least one keyword in the third set of keywords with a database of data that can potentially be recommended to a user; and in the event that a piece of data in the database is determined to match at least one keyword from the third set of keywords, determine that the piece of data is to be recommended to the user; and one or more memories coupled to the one or more processors and configured to provide the one or more processors with instructions. 7. The system of claim 1 , wherein to extract the second set of keywords further includes: extracting a predetermined number of central words from the set of action logs that occurred subsequent to the predetermined time point and assigning each central word to a priority level of level one; matching each central word against words in a product wordlist and assigning each central word that matches a word in the product wordlist a priority level of level two; matching each of those central words that matched a word in the product wordlist against bid words included in a bid wordlist and assigning each central word that matched a word in the product wordlist and also matches a word from the bid wordlist the priority level of level three; ranking the central words based at least in part on their respective priority levels; and determining that a predetermined number of central words associated with the highest priority level to be the second set of keywords. | 0.5 |
10,079,843 | 12 | 13 | 12. The method as set forth in claim 1 , wherein said at least one policy is applied for the purpose of detecting when a network interface on said network becomes inoperable. | 12. The method as set forth in claim 1 , wherein said at least one policy is applied for the purpose of detecting when a network interface on said network becomes inoperable. 13. The method as set forth in claim 12 , wherein said at least one policy includes the steps of: establishing a threshold time period during which the absence of an interface identifier in the incoming network metadata signifies said network interface's inoperable state, said established threshold time period being variable depending on the time and geographic criteria; monitoring network metadata related to said network interface; generating an alert message in a timely manner to inform of an inoperable state of said network interface if network metadata related to said network interface fails to be detected for a period in excess of said threshold time period. | 0.5 |
9,678,993 | 10 | 16 | 10. A method comprising: receiving, for an input media file, an input annotation; identifying, in a second database, (1) a set of co-occurring annotations that occur for media files associated with the input annotation, and (2) a count associated with each co-occurring annotation from the set of annotations indicating for how many media files in a first database the co-occurring annotation occurs with the input annotation, wherein the second database comprises records, each record in the comprising the count indicating the number of media files from the first database associated with the annotation and the respective co-occurring annotation; identifying, in a first database, media files similar to the input media file by retrieving media files associated with annotations, from the set of co-occurring annotations, having an associated count meeting a predefined criterion indicating a minimum number of media files in the first database for which the co-occurring annotation occurs with the input annotation; and selecting annotations associated with the similar media files that have the associated count meeting the predefined criterion to present as a list of recommended annotations for the input media file. | 10. A method comprising: receiving, for an input media file, an input annotation; identifying, in a second database, (1) a set of co-occurring annotations that occur for media files associated with the input annotation, and (2) a count associated with each co-occurring annotation from the set of annotations indicating for how many media files in a first database the co-occurring annotation occurs with the input annotation, wherein the second database comprises records, each record in the comprising the count indicating the number of media files from the first database associated with the annotation and the respective co-occurring annotation; identifying, in a first database, media files similar to the input media file by retrieving media files associated with annotations, from the set of co-occurring annotations, having an associated count meeting a predefined criterion indicating a minimum number of media files in the first database for which the co-occurring annotation occurs with the input annotation; and selecting annotations associated with the similar media files that have the associated count meeting the predefined criterion to present as a list of recommended annotations for the input media file. 16. The method of claim 10 , wherein the method further comprises maintaining in a transaction history title information and behavioral data associated with the similar media file files. | 0.5 |
9,208,788 | 1 | 5 | 1. A method of responding to a query at a dialog system, the method comprising: by the dialog system, returning a response to the query by an interaction device, the response identifying the dialog system as a signed dialog system in an event the response includes a representation of an embedded steganographic signature, otherwise the response identifying the dialog system as an unsigned dialog system or a dialog system without the embedded steganographic signature. | 1. A method of responding to a query at a dialog system, the method comprising: by the dialog system, returning a response to the query by an interaction device, the response identifying the dialog system as a signed dialog system in an event the response includes a representation of an embedded steganographic signature, otherwise the response identifying the dialog system as an unsigned dialog system or a dialog system without the embedded steganographic signature. 5. The method of claim 1 , further comprising indicating, in the response, an identifier unique to a distribution of the dialog system. | 0.684579 |
9,123,332 | 14 | 16 | 14. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform: transcribing via a processor a plurality of spoken utterances occurring during a call; assigning each of the plurality of spoken utterances with a corresponding set of classifications; determining a confidence rating associated with each of the plurality of spoken utterances and the assigned set of classifications; and performing at least one of reclassifying the plurality of spoken utterances with new classifications based on at least one additional classification operation, and adding the assigned classifications and the corresponding plurality of spoken utterances to a training data set. | 14. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform: transcribing via a processor a plurality of spoken utterances occurring during a call; assigning each of the plurality of spoken utterances with a corresponding set of classifications; determining a confidence rating associated with each of the plurality of spoken utterances and the assigned set of classifications; and performing at least one of reclassifying the plurality of spoken utterances with new classifications based on at least one additional classification operation, and adding the assigned classifications and the corresponding plurality of spoken utterances to a training data set. 16. The non-transitory computer readable storage medium of claim 14 , wherein the transcribed spoken utterances comprises at least one of rejected spoken utterances, low confidence rated spoken utterances and disconfirmed spoken utterances. | 0.874346 |
7,660,740 | 1 | 5 | 1. A method to facilitate network-based commerce, the method including: generating a map file storing a first plurality of records, the first plurality of records respectively storing summarizing information for a first plurality of offerings, the first plurality of offerings including a second plurality of offerings, the first plurality of records including a second plurality of records, the second plurality of records respectively storing summarizing information for the second plurality of offerings, the second plurality of records grouped to facilitate a reduction in processing to retrieve the second plurality of records, the generating being performed by a server machine of a network-based commerce facility; receiving a request from a user; determining a site that the user accesses, the site being one of multiple sites operated by the network-based commerce facility; retrieving a category list available for the site and retrieving the second plurality of records from the map file, the second plurality of records associated with the second plurality of offerings, the retrieving responsive to receiving the request, the category list identifying categories of the second plurality of offerings available via the site that the user accesses; and communicating the category list to the user, the category list including offering categories including the second plurality of offerings including a first offering available for sale via the network-based commerce facility in a location including a particular region, the first offering including a listing currency and a native currency that is associated with the particular region. | 1. A method to facilitate network-based commerce, the method including: generating a map file storing a first plurality of records, the first plurality of records respectively storing summarizing information for a first plurality of offerings, the first plurality of offerings including a second plurality of offerings, the first plurality of records including a second plurality of records, the second plurality of records respectively storing summarizing information for the second plurality of offerings, the second plurality of records grouped to facilitate a reduction in processing to retrieve the second plurality of records, the generating being performed by a server machine of a network-based commerce facility; receiving a request from a user; determining a site that the user accesses, the site being one of multiple sites operated by the network-based commerce facility; retrieving a category list available for the site and retrieving the second plurality of records from the map file, the second plurality of records associated with the second plurality of offerings, the retrieving responsive to receiving the request, the category list identifying categories of the second plurality of offerings available via the site that the user accesses; and communicating the category list to the user, the category list including offering categories including the second plurality of offerings including a first offering available for sale via the network-based commerce facility in a location including a particular region, the first offering including a listing currency and a native currency that is associated with the particular region. 5. The method of claim 1 wherein the communicating the category list to the user includes generating the offering categories to be displayed in a particular order. | 0.864393 |
10,055,495 | 24 | 26 | 24. The system according to claim 23 , further comprising a gaze filter module configured to determine the gaze search parameters based on information that has been presented and gaze data signals, the gaze search parameters comprising links between the gaze search parameters and presented information that satisfies gaze filter criteria for the respective gaze search parameter. | 24. The system according to claim 23 , further comprising a gaze filter module configured to determine the gaze search parameters based on information that has been presented and gaze data signals, the gaze search parameters comprising links between the gaze search parameters and presented information that satisfies gaze filter criteria for the respective gaze search parameter. 26. The system for searching information using a computer device according to claim 24 , wherein the gaze filter module is configured to create, maintain and update a gaze search index based on gaze data signals and information of data that has been presented on the information presentation area using the gaze filter criteria. | 0.534091 |
6,023,760 | 5 | 6 | 5. The method of claim 2 wherein the second substring includes a second marking element at a start of the copy of the first substring. | 5. The method of claim 2 wherein the second substring includes a second marking element at a start of the copy of the first substring. 6. The method of claim 5 wherein the second substring further includes a third marking element at an end of the copy of the first substring and wherein the first substring is one of a set of regular expressions, the second marking element including a prefix symbol, and the third marking element including a suffix symbol. | 0.5 |
10,115,215 | 18 | 30 | 18. A system comprising: a computing device comprising: a memory configured to store instructions; and a processor to execute the instructions to perform operations comprising: attaining data representing features of a font capable of representing one or more glyphs; and determining a rating for pairing the font and at least one other font using a machine learning system and the data representing the features of the font, wherein at least one of the features or at least one category of a set of categories is identified to represent the font by the machine learning system using the features of the font, and wherein the machine learning system produces a vector of numerical values, each numerical value represents one of the features or one of the categories in the set of categories. | 18. A system comprising: a computing device comprising: a memory configured to store instructions; and a processor to execute the instructions to perform operations comprising: attaining data representing features of a font capable of representing one or more glyphs; and determining a rating for pairing the font and at least one other font using a machine learning system and the data representing the features of the font, wherein at least one of the features or at least one category of a set of categories is identified to represent the font by the machine learning system using the features of the font, and wherein the machine learning system produces a vector of numerical values, each numerical value represents one of the features or one of the categories in the set of categories. 30. The system of claim 18 , wherein determining the rating for pairing the font and the at least one other font uses a ruling provided by the machine learning system. | 0.548649 |
7,949,651 | 7 | 8 | 7. The method of claim 5 , further comprising determining whether greater than a second threshold value of listings were selected that satisfy the second search term. | 7. The method of claim 5 , further comprising determining whether greater than a second threshold value of listings were selected that satisfy the second search term. 8. The method of claim 7 , wherein if less than the second threshold value of listings were selected, than provide the selected listings to a user. | 0.54908 |
8,959,103 | 10 | 16 | 10. A computer-implemented method comprising: accessing query log data that identifies, for an initial search query that includes a sequence of query terms: two or more particular query terms that are included in a particular order in the sequence of query terms of the initial search query, search results that were generated using the initial search query, a ranking of the search results, and a particular search result selected by the user; determining, using the query log data, that a search result that is ranked above the particular search result includes the two or more particular query terms in a different order than the particular order in which the two or more particular query terms are ordered in the sequence of query terms of the initial search query; in response to determining that the search result that is ranked above the particular search result includes the two or more particular query terms in the different order, adjusting a skip count for a query term reordering rule associated with the two or more particular query terms; and determining, based at least on the adjusted click count, whether to revise a search query using the query term reordering rule. | 10. A computer-implemented method comprising: accessing query log data that identifies, for an initial search query that includes a sequence of query terms: two or more particular query terms that are included in a particular order in the sequence of query terms of the initial search query, search results that were generated using the initial search query, a ranking of the search results, and a particular search result selected by the user; determining, using the query log data, that a search result that is ranked above the particular search result includes the two or more particular query terms in a different order than the particular order in which the two or more particular query terms are ordered in the sequence of query terms of the initial search query; in response to determining that the search result that is ranked above the particular search result includes the two or more particular query terms in the different order, adjusting a skip count for a query term reordering rule associated with the two or more particular query terms; and determining, based at least on the adjusted click count, whether to revise a search query using the query term reordering rule. 16. The method of claim 10 , wherein the query term reordering rule comprises a query term revision rule for revising search queries by reordering the two or more particular query terms from the particular order in which the two or more particular query terms are ordered in the sequence of query terms of the initial search query to the different order. | 0.5 |
7,779,015 | 24 | 26 | 24. The system of claim 16 , wherein: the system comprises at least one logging component, the logging component periodically logging the cached values, the cached values being logged in an instance of a data structure such that each entry contains at least information identifying a context data item, an effective time, and a value produced for the context data item having the effective time; and each context data item is named following a plain-language, hierarchical, and taxonomic attribute nomenclature. | 24. The system of claim 16 , wherein: the system comprises at least one logging component, the logging component periodically logging the cached values, the cached values being logged in an instance of a data structure such that each entry contains at least information identifying a context data item, an effective time, and a value produced for the context data item having the effective time; and each context data item is named following a plain-language, hierarchical, and taxonomic attribute nomenclature. 26. The system of claim 24 wherein each entry further identifies the time at which the entry was stored. | 0.664516 |
8,010,574 | 14 | 15 | 14. The method of claim 13 , wherein each segment of said multiple segment polyline comprises a best fit line having end point coordinates and a slope. | 14. The method of claim 13 , wherein each segment of said multiple segment polyline comprises a best fit line having end point coordinates and a slope. 15. The method of claim 14 , wherein said indexing information for said compact representation of said semantic object comprises said endpoint coordinates and said slope of said multiple segment polyline for said semantic object. | 0.5 |
8,760,726 | 2 | 5 | 2. The method of claim 1 , additionally comprising after step (d), the steps of: d1. identifying thin lines in said digital image; d2. for each said identified thin lines, determining the line width; and d3. using a lookup table to determine a percentage of polymer pixels reduction for said identified line width, wherein said creating a raster image file additionally comprises stochastically removing said determined percentage of pixels from the overlay area concurrent with each said identified thin lines. | 2. The method of claim 1 , additionally comprising after step (d), the steps of: d1. identifying thin lines in said digital image; d2. for each said identified thin lines, determining the line width; and d3. using a lookup table to determine a percentage of polymer pixels reduction for said identified line width, wherein said creating a raster image file additionally comprises stochastically removing said determined percentage of pixels from the overlay area concurrent with each said identified thin lines. 5. The method of claim 2 , additionally comprising the step of curing said printed polymer overlayer. | 0.739691 |
7,634,359 | 5 | 6 | 5. A computerized system for building a system of test components, which are usable to perform an orderable healthcare procedure, the system comprising one or more programmed computers for performing a method, the system comprising: a receiving component for receiving the orderable healthcare procedure input by a user, wherein the orderable healthcare procedure includes a diagnostic screening that is usable to detect an existence of a particular molecular entity in a sample; an associating component for associating the orderable healthcare procedure with a discrete ontology concept, (1) wherein the orderable healthcare procedure is associated with said discrete ontology concept in response to selection of a navigational concept that includes a category of molecular entities and that is a parent concept of said discrete ontology concept; and (2) wherein the discrete ontology concept includes a uniquely identified molecular entity, a traversing component for traversing an ontology of the discrete ontology concept to identify test components related to the discrete ontology concept, (1) wherein the ontology comprises horizontal defining biological relationships associating the discrete ontology concept with the test components, and (2) wherein the test components are usable to detect the existence of the particular molecular entity in the sample; and a displaying component for displaying identified test components related to the discrete ontology concept. | 5. A computerized system for building a system of test components, which are usable to perform an orderable healthcare procedure, the system comprising one or more programmed computers for performing a method, the system comprising: a receiving component for receiving the orderable healthcare procedure input by a user, wherein the orderable healthcare procedure includes a diagnostic screening that is usable to detect an existence of a particular molecular entity in a sample; an associating component for associating the orderable healthcare procedure with a discrete ontology concept, (1) wherein the orderable healthcare procedure is associated with said discrete ontology concept in response to selection of a navigational concept that includes a category of molecular entities and that is a parent concept of said discrete ontology concept; and (2) wherein the discrete ontology concept includes a uniquely identified molecular entity, a traversing component for traversing an ontology of the discrete ontology concept to identify test components related to the discrete ontology concept, (1) wherein the ontology comprises horizontal defining biological relationships associating the discrete ontology concept with the test components, and (2) wherein the test components are usable to detect the existence of the particular molecular entity in the sample; and a displaying component for displaying identified test components related to the discrete ontology concept. 6. The system of claim 5 , further comprising: a second receiving component for receiving selection of the test components. | 0.5 |
9,940,367 | 13 | 15 | 13. A system, comprising: a data processing apparatus; and a memory storage system in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: receiving a query determined to be a question query that seeks an answer response and data identifying resources determined to be responsive to the query and ordered according to a ranking, the query having query terms; for each resource in a top-ranked subset of the resources: receiving candidate answer passages, each candidate answer passage selected from passage units from content of the resource and being eligible to be provided as an answer passage with search results that identify the resources determined to be responsive to the query and being separate and distinct from the search results; determining, for each candidate answer passage, a query term match score that is a measure of similarity of the query terms to the candidate answer passage; determining, for each candidate answer passage, an answer term match score that is a measure of similarity of answer terms to the candidate answer passage; determining, for each candidate answer passage, a query dependent score based on the query term match score and the answer term match score; and generating an answer score that is a measure of answer quality for the answer response for the candidate answer passage based on the query dependent score. | 13. A system, comprising: a data processing apparatus; and a memory storage system in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: receiving a query determined to be a question query that seeks an answer response and data identifying resources determined to be responsive to the query and ordered according to a ranking, the query having query terms; for each resource in a top-ranked subset of the resources: receiving candidate answer passages, each candidate answer passage selected from passage units from content of the resource and being eligible to be provided as an answer passage with search results that identify the resources determined to be responsive to the query and being separate and distinct from the search results; determining, for each candidate answer passage, a query term match score that is a measure of similarity of the query terms to the candidate answer passage; determining, for each candidate answer passage, an answer term match score that is a measure of similarity of answer terms to the candidate answer passage; determining, for each candidate answer passage, a query dependent score based on the query term match score and the answer term match score; and generating an answer score that is a measure of answer quality for the answer response for the candidate answer passage based on the query dependent score. 15. The system of claim 13 , wherein determining an answer term match score that is a measure of similarity of answer terms to the candidate answer passage comprises: generating a list of terms from terms included in the top-ranked subset of resources; and for each term in the list of terms, generating a term weight for the term. | 0.690654 |
9,684,640 | 10 | 15 | 10. A system comprising: a processor, a tangible, non-transitory memory configured to communicate with the processor, the tangible, non-transitory memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising: creating, by the processor, a linkage data structure corresponding to a second programming language different from a markup language, wherein the linkage data structure includes a field for each tag in a set of tags associated with the markup language, wherein the set of tags is retrieved by parsing a document; generating, by the processor, program code in the second programming language based on the set of tags, wherein the generating comprises: creating a procedure division statement in the second programming language; wherein the procedure division statement is capable of accepting a document written in the markup language, wherein the document is variable length, and wherein the procedure division statement is capable of returning a fixed format data structure corresponding to the linkage data structure, creating a second programming language section to contain the program code in the second programming language; and producing, by the procedure division statement and the second programming language section, the program code in the second programming language, wherein the program code is configured to extract, from the document written in the markup language, the set of tags associated with the markup language and at least one attribute associated with each tag; forming, by the processor, an application programming interface (API) that includes the linkage data structure and the program code; and using, by the processor, the application programming interface (API) to pass content from one or more documents written in the markup language to a program element of a program written in the second programming language. | 10. A system comprising: a processor, a tangible, non-transitory memory configured to communicate with the processor, the tangible, non-transitory memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising: creating, by the processor, a linkage data structure corresponding to a second programming language different from a markup language, wherein the linkage data structure includes a field for each tag in a set of tags associated with the markup language, wherein the set of tags is retrieved by parsing a document; generating, by the processor, program code in the second programming language based on the set of tags, wherein the generating comprises: creating a procedure division statement in the second programming language; wherein the procedure division statement is capable of accepting a document written in the markup language, wherein the document is variable length, and wherein the procedure division statement is capable of returning a fixed format data structure corresponding to the linkage data structure, creating a second programming language section to contain the program code in the second programming language; and producing, by the procedure division statement and the second programming language section, the program code in the second programming language, wherein the program code is configured to extract, from the document written in the markup language, the set of tags associated with the markup language and at least one attribute associated with each tag; forming, by the processor, an application programming interface (API) that includes the linkage data structure and the program code; and using, by the processor, the application programming interface (API) to pass content from one or more documents written in the markup language to a program element of a program written in the second programming language. 15. The system of claim 10 , wherein the markup language is XML and further comprising: creating an XML parse statement; and generating program code for XML tags participating in arrays. | 0.617284 |
7,792,776 | 1 | 15 | 1. A computer implemented method for inferring a probability of a first inference, wherein the probability of the first inference comprises an identification of a dangerous individual, wherein the dangerous individual comprises any individual, individuals, or group of individuals that are disturbed, distressed, or mentally ill and that have a likely predisposition to violent behavior, according to a likely determination of a professional of ordinary skill in the art of mental health, assuming that the professional had possession of at least one fact that would be relevant to the professional in making the determination, wherein likely comprises more probable than not, wherein relevant comprises relevance according to accepted standards of those of ordinary skill in the art of mental health, and wherein the computer implemented method comprises: receiving a query at a database regarding a fact, wherein the first inference is absent from the database, wherein the database comprises a plurality of divergent data, wherein the plurality of divergent data includes a plurality of cohort data, wherein each datum of the plurality of divergent data in the database is conformed to the dimensions of the database, wherein each datum of the plurality of divergent data has associated metadata and an associated key, wherein the associated metadata comprises data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum; establishing the fact as a frame of reference for the query; applying a first set of rules to the query, wherein the first set of rules are determined for the query according to a second set of rules, wherein the frame of reference serves as an anchor for generating associations among the plurality of cohort data and is used to determine rules for limiting the plurality of divergent data that is searched, wherein the first set of rules determine how the plurality of divergent data are to be compared to the fact, and wherein the first set of rules determine a search space for the query; executing the query to create the first inference and the probability of the first inference, wherein the probability of the first inference is determined from comparing the plurality of divergent data according to the first set of rules; performing security filtering based on at least one of a significant level of the probability of the first inference, a probability of the first inference exceeding a pre-selected value, and a security level possessed by a user; storing the probability of the first inference; presenting the probability of the first inference to the user based on whether the user is authorized to receive a set of medical information under the standards of one of a law and an institutional review board; and presenting the probability of the first inference to the user even if the user is not authorized to receive the set of medical information under standards of one of the law and the institutional review board, but only responsive to a) restricting the user from accessing the medical information and b) a probability of the first inference exceeding a pre-defined value. | 1. A computer implemented method for inferring a probability of a first inference, wherein the probability of the first inference comprises an identification of a dangerous individual, wherein the dangerous individual comprises any individual, individuals, or group of individuals that are disturbed, distressed, or mentally ill and that have a likely predisposition to violent behavior, according to a likely determination of a professional of ordinary skill in the art of mental health, assuming that the professional had possession of at least one fact that would be relevant to the professional in making the determination, wherein likely comprises more probable than not, wherein relevant comprises relevance according to accepted standards of those of ordinary skill in the art of mental health, and wherein the computer implemented method comprises: receiving a query at a database regarding a fact, wherein the first inference is absent from the database, wherein the database comprises a plurality of divergent data, wherein the plurality of divergent data includes a plurality of cohort data, wherein each datum of the plurality of divergent data in the database is conformed to the dimensions of the database, wherein each datum of the plurality of divergent data has associated metadata and an associated key, wherein the associated metadata comprises data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum; establishing the fact as a frame of reference for the query; applying a first set of rules to the query, wherein the first set of rules are determined for the query according to a second set of rules, wherein the frame of reference serves as an anchor for generating associations among the plurality of cohort data and is used to determine rules for limiting the plurality of divergent data that is searched, wherein the first set of rules determine how the plurality of divergent data are to be compared to the fact, and wherein the first set of rules determine a search space for the query; executing the query to create the first inference and the probability of the first inference, wherein the probability of the first inference is determined from comparing the plurality of divergent data according to the first set of rules; performing security filtering based on at least one of a significant level of the probability of the first inference, a probability of the first inference exceeding a pre-selected value, and a security level possessed by a user; storing the probability of the first inference; presenting the probability of the first inference to the user based on whether the user is authorized to receive a set of medical information under the standards of one of a law and an institutional review board; and presenting the probability of the first inference to the user even if the user is not authorized to receive the set of medical information under standards of one of the law and the institutional review board, but only responsive to a) restricting the user from accessing the medical information and b) a probability of the first inference exceeding a pre-defined value. 15. The computer implemented method of claim 1 wherein the probability of the first inference relates to a set of medical information regarding the dangerous individual and wherein the method further comprises: presenting the probability of the first inference to the user without presenting, to the user, the set of medical information. | 0.699643 |
10,127,927 | 14 | 18 | 14. A system, comprising: a processor module; a memory coupled to the processor, wherein the memory contains executable instructions configured to implement a method, the method comprising: receiving one or more speech samples; generating a set of training data by extracting one or more acoustic features from every frame of the one or more speech samples; and generating a model from the set of training data, wherein the model identifies emotion or speaking style dependent information in the set of training data, wherein the model includes the application of a Probabilistic Linear Discriminant Analysis (PLDA) to identify an emotion related subspace. | 14. A system, comprising: a processor module; a memory coupled to the processor, wherein the memory contains executable instructions configured to implement a method, the method comprising: receiving one or more speech samples; generating a set of training data by extracting one or more acoustic features from every frame of the one or more speech samples; and generating a model from the set of training data, wherein the model identifies emotion or speaking style dependent information in the set of training data, wherein the model includes the application of a Probabilistic Linear Discriminant Analysis (PLDA) to identify an emotion related subspace. 18. The system of claim 14 , wherein the one or more speech samples are captured by a microphone. | 0.912138 |
8,875,098 | 16 | 17 | 16. The computer program product of claim 11 , wherein managing execution of each of the executable components comprises initiating execution of one or more of the executable components asynchronously. | 16. The computer program product of claim 11 , wherein managing execution of each of the executable components comprises initiating execution of one or more of the executable components asynchronously. 17. The computer program product of claim 16 , wherein managing execution of each of the executable components comprises identifying one or more executable components that are not dependent on any other executable component for input based on information in the application definition and initiating execution of the identified executable component(s). | 0.5 |
8,010,456 | 21 | 22 | 21. The machine readable storage of claim 20 , wherein said comparing step further comprises the step of checking for idleness through said usage data for each one of said provisioned collaborative contexts. | 21. The machine readable storage of claim 20 , wherein said comparing step further comprises the step of checking for idleness through said usage data for each one of said provisioned collaborative contexts. 22. The machine readable storage of claim 21 , wherein said remediating step comprises the step of removing each idle one of said provisioned collaborative contexts. | 0.5 |
9,563,695 | 1 | 2 | 1. An electronic magazine system, comprising: a processor; and a non-transitory computer readable medium storing instructions, the instructions when executed by the processor cause the processor to: accept, as input, content items; establish correspondences between individual ones of the content items and individual ones of a plurality of available topics; generate a plurality of profile topics responsive to automatically determined interests of a user; select magazine items from the content items responsive to correspondence between the available topics and the profile topics; assign scores to the profile topics, each of the scores assigned to a corresponding topic of the profile topics, each of the scores assigned based on a number of times that the user has consumed content items corresponding to one of the profile topics over a time period; periodically update the scores by decaying the scores using a pre-defined decay function to produce updated scores; compare the updated scores to determine a stale topic from the profile topics, the stale topic having a lower score than other topics from the profile topics; and remove the stale topic from the profile topics. | 1. An electronic magazine system, comprising: a processor; and a non-transitory computer readable medium storing instructions, the instructions when executed by the processor cause the processor to: accept, as input, content items; establish correspondences between individual ones of the content items and individual ones of a plurality of available topics; generate a plurality of profile topics responsive to automatically determined interests of a user; select magazine items from the content items responsive to correspondence between the available topics and the profile topics; assign scores to the profile topics, each of the scores assigned to a corresponding topic of the profile topics, each of the scores assigned based on a number of times that the user has consumed content items corresponding to one of the profile topics over a time period; periodically update the scores by decaying the scores using a pre-defined decay function to produce updated scores; compare the updated scores to determine a stale topic from the profile topics, the stale topic having a lower score than other topics from the profile topics; and remove the stale topic from the profile topics. 2. The system of claim 1 , wherein the instructions when executed by the processor further cause the processor to manage how many of the content items are identified as corresponding to each of the plurality of available topics. | 0.733021 |
7,809,574 | 30 | 35 | 30. A computerized method of performing word recognition comprising: receiving a word input signal containing non-textual user input representing a sequence of one or more words; receiving a sequence of one or more filter input signal, each containing non-textual user input representing a sequence of one or more characters; responding to the one or more filter input signals by producing a filter, representing one or more possible character sequences, each having one or more characters, found to have the best probability of corresponding to the filter input signal; performing word recognition upon said word input signal, to generating a list of best scoring word recognition candidates, each of which is selected to start with a one of the one or more character sequences represented by the filter; producing user-perceivable output representing: said list of best scoring word recognition candidates; and an indication of the character sequence represented by said filter that corresponds to the initial characters of one of the listed best scoring recognition candidates; providing a user interface that enables a user to select one of the word recognition candidates from said list and/or to select a filter character from said indication of a character sequence represented by the filter; responding to selection of one of the word recognition candidates from the choice list by treating the selected candidate as the one or more words that correspond to the word input signal; responding to selection of a filter character by providing a user perceivable output of a choice list of other characters selected as having the best probability of corresponding to the selected character's position in the filter; enabling a user to choose one of the characters in the character choice list; responding to a choice of a character in the character choice list by: limiting the one or more possible character sequences represented by the filter to ones having the chosen character in the selected filter character's position; and repeated said generation of a user-perceivable list of word recognition candidates using the filter as limited by the chosen character. | 30. A computerized method of performing word recognition comprising: receiving a word input signal containing non-textual user input representing a sequence of one or more words; receiving a sequence of one or more filter input signal, each containing non-textual user input representing a sequence of one or more characters; responding to the one or more filter input signals by producing a filter, representing one or more possible character sequences, each having one or more characters, found to have the best probability of corresponding to the filter input signal; performing word recognition upon said word input signal, to generating a list of best scoring word recognition candidates, each of which is selected to start with a one of the one or more character sequences represented by the filter; producing user-perceivable output representing: said list of best scoring word recognition candidates; and an indication of the character sequence represented by said filter that corresponds to the initial characters of one of the listed best scoring recognition candidates; providing a user interface that enables a user to select one of the word recognition candidates from said list and/or to select a filter character from said indication of a character sequence represented by the filter; responding to selection of one of the word recognition candidates from the choice list by treating the selected candidate as the one or more words that correspond to the word input signal; responding to selection of a filter character by providing a user perceivable output of a choice list of other characters selected as having the best probability of corresponding to the selected character's position in the filter; enabling a user to choose one of the characters in the character choice list; responding to a choice of a character in the character choice list by: limiting the one or more possible character sequences represented by the filter to ones having the chosen character in the selected filter character's position; and repeated said generation of a user-perceivable list of word recognition candidates using the filter as limited by the chosen character. 35. A method as in claim 30 wherein: the filter input signals correspond to a sequence of one or more utterances each of a sequence of one or more letter indications; and the responding to the filter input signals includes performing speech recognition upon the sequence of one or more utterances to produce a filter representing one or more sequences of characters corresponding to the characters recognized from said utterances. | 0.661417 |
9,514,741 | 2 | 4 | 2. The method according to claim 1 , further comprising: extracting audio features from the speech corpus; and depersonalizing the audio features. | 2. The method according to claim 1 , further comprising: extracting audio features from the speech corpus; and depersonalizing the audio features. 4. The method according to claim 2 , wherein depersonalizing the audio features includes applying vocal tract length normalization (VTLN) to the audio features. | 0.609756 |
8,521,478 | 5 | 6 | 5. A method for delineating rigid bodies in a computer-aided design (CAD) model, the method comprising: analyzing the CAD model to identify one or more rigid bodies based on the number of relative degrees of freedom between any two geometric bodies included in the CAD model, wherein each identified rigid body includes one or more geometric bodies that have no degrees of freedom relative to any of the other geometric bodies included in the rigid body; receiving an instruction to process a first identified rigid body; creating a graphic style table that includes a listing of available graphic styles to apply to the one or more identified rigid bodies in the CAD model; selecting a first graphic style by analyzing assembly data associated with the first identified rigid body to determine whether at least one geometric body of the first identified rigid body is associated with a user-defined grounded state or a user-defined style override; if at least one geometric body of the first identified rigid body is associated with the user-defined grounded state or the user-defined style override, then selecting the first graphic style based on the assembly data, or if no geometric bodies of the first identified rigid body are associated with the user-defined grounded state or the user-defined style override, then selecting the first graphic style from the graphic style table; and applying the first graphic style to each of the one or more geometric bodies included in the first identified rigid body. | 5. A method for delineating rigid bodies in a computer-aided design (CAD) model, the method comprising: analyzing the CAD model to identify one or more rigid bodies based on the number of relative degrees of freedom between any two geometric bodies included in the CAD model, wherein each identified rigid body includes one or more geometric bodies that have no degrees of freedom relative to any of the other geometric bodies included in the rigid body; receiving an instruction to process a first identified rigid body; creating a graphic style table that includes a listing of available graphic styles to apply to the one or more identified rigid bodies in the CAD model; selecting a first graphic style by analyzing assembly data associated with the first identified rigid body to determine whether at least one geometric body of the first identified rigid body is associated with a user-defined grounded state or a user-defined style override; if at least one geometric body of the first identified rigid body is associated with the user-defined grounded state or the user-defined style override, then selecting the first graphic style based on the assembly data, or if no geometric bodies of the first identified rigid body are associated with the user-defined grounded state or the user-defined style override, then selecting the first graphic style from the graphic style table; and applying the first graphic style to each of the one or more geometric bodies included in the first identified rigid body. 6. The method of claim 5 , further comprising: selecting a second graphic style; checking the selection of the second graphic style for errors; and applying the second graphic style to each of the one or more geometric bodies included in a second identified rigid body. | 0.5 |
9,870,768 | 5 | 8 | 5. A computer automated subject estimation method in a convolution neural network comprising: performing, on an input of a word-string vector sequence corresponding to dialog text transcribed from a dialog, topic-dependent convolution process including a convolution operation dependent on a topic by using a processor; performing, on the input, topic-independent convolution process including a convolution operation not dependent on the topic by using the processor; performing pooling process on outputs of (i) the topic-dependent convolution process and (ii) the topic-independent convolution process by using processor; and performing full connection process on outputs of the pooling process and estimating a subject label of the dialog by using the processor. | 5. A computer automated subject estimation method in a convolution neural network comprising: performing, on an input of a word-string vector sequence corresponding to dialog text transcribed from a dialog, topic-dependent convolution process including a convolution operation dependent on a topic by using a processor; performing, on the input, topic-independent convolution process including a convolution operation not dependent on the topic by using the processor; performing pooling process on outputs of (i) the topic-dependent convolution process and (ii) the topic-independent convolution process by using processor; and performing full connection process on outputs of the pooling process and estimating a subject label of the dialog by using the processor. 8. The computer automated subject estimation method according to claim 5 , further comprising: inputting the word-string vector sequence corresponding to the dialog text, wherein the dialog text is text transcribed from a dialog in a time series, and the word-string vector sequence is obtained by calculating vectors of words in a word string included in the dialog text by using a predetermined method. | 0.830395 |
9,436,382 | 4 | 5 | 4. A method as described in claim 1 , further comprising determining a portion of the image that corresponds to the natural language input and the performance of the image editing operation involves the determined portion. | 4. A method as described in claim 1 , further comprising determining a portion of the image that corresponds to the natural language input and the performance of the image editing operation involves the determined portion. 5. A method as described in claim 4 , wherein the natural language input involves a name and the determining is performed to define at least part of a boundary of at least a portion of the image that is associated with the name. | 0.5 |
8,366,745 | 48 | 49 | 48. In a medical implant assembly having first and second bone attachment structures cooperating with a longitudinal connecting member, the improvement wherein the longitudinal connecting member comprises: a) an anchor member portion passing through and secured directly to the first bone attachment structure, the anchor member portion having a first width and having a core extension of reduced second width, the core extension extending from the anchor member portion along a substantially central axis of the longitudinal connecting member, the first and second widths being measured perpendicular to the central axis; b) a first elastic outer spacer, the core extension being received in the spacer, the spacer being positioned between the two bone attachment structures; c) a second elastic outer spacer, the core extension being received in the second spacer, the second spacer being more compressible than the first spacer, both the first and second spacers being pre-compressed in a resting assembly state when connected to the bone attachment structures; the second elastic outer spacer being located relative to the core extension so as to not be between the first and second bone attachment structures; and d) a substantially inelastic sleeve, the core extension being received through the sleeve and in slidable relationship therewith, the sleeve passing through and secured in the second bone attachment structure, the sleeve being disposed between the first and second pre-compressed spacers, the pre-compressed spacers exerting axial forces on the sleeve. | 48. In a medical implant assembly having first and second bone attachment structures cooperating with a longitudinal connecting member, the improvement wherein the longitudinal connecting member comprises: a) an anchor member portion passing through and secured directly to the first bone attachment structure, the anchor member portion having a first width and having a core extension of reduced second width, the core extension extending from the anchor member portion along a substantially central axis of the longitudinal connecting member, the first and second widths being measured perpendicular to the central axis; b) a first elastic outer spacer, the core extension being received in the spacer, the spacer being positioned between the two bone attachment structures; c) a second elastic outer spacer, the core extension being received in the second spacer, the second spacer being more compressible than the first spacer, both the first and second spacers being pre-compressed in a resting assembly state when connected to the bone attachment structures; the second elastic outer spacer being located relative to the core extension so as to not be between the first and second bone attachment structures; and d) a substantially inelastic sleeve, the core extension being received through the sleeve and in slidable relationship therewith, the sleeve passing through and secured in the second bone attachment structure, the sleeve being disposed between the first and second pre-compressed spacers, the pre-compressed spacers exerting axial forces on the sleeve. 49. The improvement according to claim 48 , wherein the sleeve includes a cup shaped end surface. | 0.5 |
9,436,729 | 2 | 3 | 2. The information retrieval system evaluation method according to claim 1 , wherein the evaluation indicator of the information retrieval system is computed according to the following formula, by an evaluation electronic device: F = ( Ξ² 2 + 1 ) β’ PR Ξ² 2 β’ P + R wherein, F is the evaluation indicator, R is an arithmetic mean value of recall rates corresponding to all evaluation keywords, P is an arithmetic mean value of correctness percentages corresponding to all evaluation keywords, and Ξ² is a pre-determined weight coefficient. | 2. The information retrieval system evaluation method according to claim 1 , wherein the evaluation indicator of the information retrieval system is computed according to the following formula, by an evaluation electronic device: F = ( Ξ² 2 + 1 ) β’ PR Ξ² 2 β’ P + R wherein, F is the evaluation indicator, R is an arithmetic mean value of recall rates corresponding to all evaluation keywords, P is an arithmetic mean value of correctness percentages corresponding to all evaluation keywords, and Ξ² is a pre-determined weight coefficient. 3. The information retrieval system evaluation method according to claim 2 , wherein the arithmetic mean value of the recall rates is computed according to the following formula, by an evaluation electronic device: R = 1 n β’ β k = 1 n β’ β’ R k , R k = HitScore k TotalScore k wherein, n is the number of keywords in the evaluation keyword set, R k is a recall rate of a Kth evaluation keyword, HitScore k is the sum of all the related object parameters in an evaluation retrieval result corresponding to a Kth evaluation keyword, and TotalScore k is the sum of all the related object parameters in a sample retrieval result corresponding to a Kth evaluation keyword, wherein a related object parameter corresponding to the Kth evaluation keyword is computed according to the number of times that a user performs operation on a related object corresponding to the Kth evaluation keyword and an arrangement position of a related object corresponding to the Kth evaluation keyword in its each corresponding sample retrieval sub-result. | 0.5 |
7,818,319 | 18 | 20 | 18. A system for facilitating display of advertising information to end users of a computerized data network, the computerized data network including a first server system, a second server system, and at least a first client system including, the data network further including, the system comprising: at least one processor; at least one network interface; memory; a plurality of software and hardware components including a first browser component and a first contextual analysis component; the system being operable to: receive, at the first browser component, web page content relating to a first web page; identify at least one first valid element of the first web page content suitable for contextual text search analysis, wherein the first valid element includes a first portion of the first web page content; extract text from the first identified valid element; provide the extracted text to the first contextual analysis component; perform, using at least one processor associated with the first contextual analysis component, contextual text search analysis on the extracted text, wherein the contextual text search analysis includes identifying a plurality of keywords in the extracted text; generate scoring information for at least one category based on the plurality of keywords identified in the extracted text; select at least a first text string that includes at least one of the plurality keywords, wherein the first text string corresponds to a first specific portion of text from the first web page to be displayed by the first browser component; automatically transform the first specific portion of text from the first web page into a link to at least one URL associated with at least one advertising system; and cause the first browser to display the link to the URL as part of the first web page. | 18. A system for facilitating display of advertising information to end users of a computerized data network, the computerized data network including a first server system, a second server system, and at least a first client system including, the data network further including, the system comprising: at least one processor; at least one network interface; memory; a plurality of software and hardware components including a first browser component and a first contextual analysis component; the system being operable to: receive, at the first browser component, web page content relating to a first web page; identify at least one first valid element of the first web page content suitable for contextual text search analysis, wherein the first valid element includes a first portion of the first web page content; extract text from the first identified valid element; provide the extracted text to the first contextual analysis component; perform, using at least one processor associated with the first contextual analysis component, contextual text search analysis on the extracted text, wherein the contextual text search analysis includes identifying a plurality of keywords in the extracted text; generate scoring information for at least one category based on the plurality of keywords identified in the extracted text; select at least a first text string that includes at least one of the plurality keywords, wherein the first text string corresponds to a first specific portion of text from the first web page to be displayed by the first browser component; automatically transform the first specific portion of text from the first web page into a link to at least one URL associated with at least one advertising system; and cause the first browser to display the link to the URL as part of the first web page. 20. The system of claim 18 being further operable to: determine that the at least one first text string matches a first category associated with a first identified advertising campaign; select, using information relating to the first identified advertising campaign, advertising content to be displayed by the first browser component; and cause the first client system to automatically display a first pop-up window or layer which includes the selected advertising content, wherein at least a portion of the displayed advertising content is different from the first specific portion of text. | 0.554299 |
10,084,745 | 16 | 20 | 16. An electronic device comprising: one or more network interfaces configured to connect the electronic device to a fabric of smart devices; a processor; memory comprising instructions executable by the processor to configure the electronic device to: transmit a request to a publisher device within a fabric of smart devices from the electronic device as a subscriber device, the publisher device including at least one sensor, the request being configured to cause the publisher device to establish a subscription to data related to a state or the at least one sensor of the publisher device; encode a data management action into a message for transmission to the publisher device, the encoded message including a profile identifier that causes a data management entity of the publisher device to perform the data management action, the profile identifier identifying a data management profile, and the encoded message including a command tag that encodes the data management action to be performed; transmit the encoded message to the publisher device, the transmission of the encoded message being effective to cause the publisher device to: send the data related to the state or the at least one sensor of the publisher device to the electronic device upon an event; or send the data related to the state or the at least one sensor of the publisher device that is stored locally on the publisher device to the electronic device; receive the data related to the state or the at least one sensor of the publisher device; and based upon the reception of the data, perform a control action based on the data related to the state or the at least one sensor of the publisher device. | 16. An electronic device comprising: one or more network interfaces configured to connect the electronic device to a fabric of smart devices; a processor; memory comprising instructions executable by the processor to configure the electronic device to: transmit a request to a publisher device within a fabric of smart devices from the electronic device as a subscriber device, the publisher device including at least one sensor, the request being configured to cause the publisher device to establish a subscription to data related to a state or the at least one sensor of the publisher device; encode a data management action into a message for transmission to the publisher device, the encoded message including a profile identifier that causes a data management entity of the publisher device to perform the data management action, the profile identifier identifying a data management profile, and the encoded message including a command tag that encodes the data management action to be performed; transmit the encoded message to the publisher device, the transmission of the encoded message being effective to cause the publisher device to: send the data related to the state or the at least one sensor of the publisher device to the electronic device upon an event; or send the data related to the state or the at least one sensor of the publisher device that is stored locally on the publisher device to the electronic device; receive the data related to the state or the at least one sensor of the publisher device; and based upon the reception of the data, perform a control action based on the data related to the state or the at least one sensor of the publisher device. 20. The electronic device of claim 16 , wherein the processor is configured to: establish a connection to an indirect connection device, wherein the indirect connection device does not directly communicate to the publisher device, wherein sending the transmitted message comprises receiving the transmitted message from the indirect connection device; and send received data designating the indirect connection device as a destination to the indirect connection device. | 0.5 |
9,460,083 | 1 | 4 | 1. A method, comprising: in real time, using a processor of a computer, while monitoring separate communications between pairs of users, wherein each of the pairs of users has a first user and a second user, generating a cumulative sentiment score representing a sentiment of the first user from each of the pairs of users during a period of time and an instantaneous sentiment score representing a sentiment of the first user from each of the pairs of users at a current time; displaying, in real time, an interactive dashboard with a visual representation for each of the pairs of users having a circular gauge representing the cumulative sentiment score and a bar graph representing the instantaneous sentiment score; in response to selection of one of the circular gauges by a manager, displaying options to enable reviewing a communication, listening to an on-going communication, and joining the on-going communication; and in response to selection of one of the options, enabling that option for the manager for the communications between the pair of users associated with the selected circular gauge. | 1. A method, comprising: in real time, using a processor of a computer, while monitoring separate communications between pairs of users, wherein each of the pairs of users has a first user and a second user, generating a cumulative sentiment score representing a sentiment of the first user from each of the pairs of users during a period of time and an instantaneous sentiment score representing a sentiment of the first user from each of the pairs of users at a current time; displaying, in real time, an interactive dashboard with a visual representation for each of the pairs of users having a circular gauge representing the cumulative sentiment score and a bar graph representing the instantaneous sentiment score; in response to selection of one of the circular gauges by a manager, displaying options to enable reviewing a communication, listening to an on-going communication, and joining the on-going communication; and in response to selection of one of the options, enabling that option for the manager for the communications between the pair of users associated with the selected circular gauge. 4. The method of claim 1 , further comprising: in response to receiving selection for reviewing the communication, displaying a report in which particular phrases representing the sentiment are highlighted. | 0.825127 |
7,565,647 | 32 | 34 | 32. A data processing system comprising: a computer readable memory having a data structure stored therein, said data structure comprising: a parser for parsing a specification of a computing application for a mobile information device by using a descriptor element factory, said specification being written in an extended markup language and comprising tags of said markup language that correspond to functions of said application to create a descriptor object model comprising objects that implement said functions, wherein the parsing comprises reading different ones of said tags with different readers registered in a factory to be instantiated, and said parser for outputting a plurality of objects according to the descriptor object model, said objects including a project descriptor object; a code generator accepting outputs of said parser that (i) accesses a generation object model according to a specification of a project descriptor object and (ii) dynamically produces source code based on said descriptor object model and said generation object model by using a generation object factory that produces generation objects, said generation objects being operable to generate class files of said source code; and a compiler accepting said source code for compilation into object code, said compiler comprising a generator a verification module for preverifying classes of the class files of said source code; and a packer for packaging said object code into an archive file said packer being configured to include application descriptor information in a manifest of said archive file, said archive file being adapted to be downloaded to and run by the mobile information device. | 32. A data processing system comprising: a computer readable memory having a data structure stored therein, said data structure comprising: a parser for parsing a specification of a computing application for a mobile information device by using a descriptor element factory, said specification being written in an extended markup language and comprising tags of said markup language that correspond to functions of said application to create a descriptor object model comprising objects that implement said functions, wherein the parsing comprises reading different ones of said tags with different readers registered in a factory to be instantiated, and said parser for outputting a plurality of objects according to the descriptor object model, said objects including a project descriptor object; a code generator accepting outputs of said parser that (i) accesses a generation object model according to a specification of a project descriptor object and (ii) dynamically produces source code based on said descriptor object model and said generation object model by using a generation object factory that produces generation objects, said generation objects being operable to generate class files of said source code; and a compiler accepting said source code for compilation into object code, said compiler comprising a generator a verification module for preverifying classes of the class files of said source code; and a packer for packaging said object code into an archive file said packer being configured to include application descriptor information in a manifest of said archive file, said archive file being adapted to be downloaded to and run by the mobile information device. 34. The data processing system according to claim 32 , wherein said data structure is activated responsively to a command line directive. | 0.870998 |
8,014,557 | 1 | 11 | 1. A method of encoding hidden auxiliary data in a text document comprising: using an electronic processor for: forming a message; spreading the message over a carrier signal to yield a spread spectrum message; modifying distances of existing spaces between words to encode a machine-detectable interword modification in the document based on elements of the spread spectrum message, wherein interword modifications are controlled to form a machine-detectable message in the text document. | 1. A method of encoding hidden auxiliary data in a text document comprising: using an electronic processor for: forming a message; spreading the message over a carrier signal to yield a spread spectrum message; modifying distances of existing spaces between words to encode a machine-detectable interword modification in the document based on elements of the spread spectrum message, wherein interword modifications are controlled to form a machine-detectable message in the text document. 11. An electronic device programmed to perform the method of claim 1 . | 0.821429 |
7,797,151 | 1 | 2 | 1. A translation method, comprising: compiling, by a developer using a computer system, a set of files including non-localizable files and localizable files into a set of install files, the localizable files including string data from at least one source in a first human language for translation into a target human language, the non-localizable files lacking data requiring translation from the first human language into the target human language, the install files for installation onto a computer, the non-localizable files including a computer-executable binary file; extracting, by a foreign country vendor using a translation tool executed by a computer remote from the computer system, the string data and exporting the extracted string data to a formatted file, the foreign country vendor being located in a country different from the developer; executing the translation tool independently of whether any of the non-localizable files are executed; receiving, at the remote computer, a translated formatted file that includes translated string data, the translated string data corresponding to the extracted string data that has been at least partially translated from the first human language into a target human language; importing, by the remote computer, the translated string data into the localizable files to produce translated localizable files and replacing the localizable files with translated localizable files that includes the imported translated string data; and packaging the translated localizable files together with the non-localizable files into a set of target install files without requiring recompilation from source code to computer-executable code of any of the non-localizable files including the binary file. | 1. A translation method, comprising: compiling, by a developer using a computer system, a set of files including non-localizable files and localizable files into a set of install files, the localizable files including string data from at least one source in a first human language for translation into a target human language, the non-localizable files lacking data requiring translation from the first human language into the target human language, the install files for installation onto a computer, the non-localizable files including a computer-executable binary file; extracting, by a foreign country vendor using a translation tool executed by a computer remote from the computer system, the string data and exporting the extracted string data to a formatted file, the foreign country vendor being located in a country different from the developer; executing the translation tool independently of whether any of the non-localizable files are executed; receiving, at the remote computer, a translated formatted file that includes translated string data, the translated string data corresponding to the extracted string data that has been at least partially translated from the first human language into a target human language; importing, by the remote computer, the translated string data into the localizable files to produce translated localizable files and replacing the localizable files with translated localizable files that includes the imported translated string data; and packaging the translated localizable files together with the non-localizable files into a set of target install files without requiring recompilation from source code to computer-executable code of any of the non-localizable files including the binary file. 2. The method of claim 1 wherein the set of files is a power monitoring software product. | 0.876389 |
8,761,988 | 9 | 10 | 9. A method for controlling an engine in a powertrain system including a multi-mode transmission, the method comprising: executing a search to determine a preferred engine operating point in response to an output torque request, said search comprising: for each of a plurality of candidate engine speeds within an input speed range and each of a plurality of candidate torque normalization ratios: employing the candidate torque normalization ratio to determine a candidate engine torque from a normalized torque search space, and determining a candidate power cost associated with operating the powertrain system at the candidate engine torque; determining a preferred engine speed comprising the candidate engine speed corresponding to the one of the candidate engine torques associated with a minimum of the candidate power costs; and controlling engine operation responsive to the preferred engine speed at the candidate engine torque associated with the minimum candidate power cost; wherein the candidate torque normalization ratios for the candidate engine speed include a normalized engine torque equal to 0.0 corresponding to a minimum permissible engine torque for the candidate engine speed and a normalized engine torque equal to 1.0 corresponding to a maximum permissible engine torque for the candidate engine speed. | 9. A method for controlling an engine in a powertrain system including a multi-mode transmission, the method comprising: executing a search to determine a preferred engine operating point in response to an output torque request, said search comprising: for each of a plurality of candidate engine speeds within an input speed range and each of a plurality of candidate torque normalization ratios: employing the candidate torque normalization ratio to determine a candidate engine torque from a normalized torque search space, and determining a candidate power cost associated with operating the powertrain system at the candidate engine torque; determining a preferred engine speed comprising the candidate engine speed corresponding to the one of the candidate engine torques associated with a minimum of the candidate power costs; and controlling engine operation responsive to the preferred engine speed at the candidate engine torque associated with the minimum candidate power cost; wherein the candidate torque normalization ratios for the candidate engine speed include a normalized engine torque equal to 0.0 corresponding to a minimum permissible engine torque for the candidate engine speed and a normalized engine torque equal to 1.0 corresponding to a maximum permissible engine torque for the candidate engine speed. 10. The method of claim 9 , wherein employing the candidate torque normalization ratio to determine the candidate engine torque from the normalized torque search space comprises: determining the minimum and maximum permissible engine torques subject to constraints at the candidate engine speed, and employing the candidate torque normalization ratio to determine the candidate engine torque based upon said minimum and maximum permissible engine torques. | 0.5 |
7,735,144 | 25 | 26 | 25. A system comprising a computer readable storage device storing a computer program, a display device, and one or more processors operable to interact with the display device and to execute the computer program and perform operations comprising: reading an electronic document, the electronic document comprising content rules, an existing signed state, and existing content items; authenticating the electronic document one or more times, each authenticating comprising: classifying the existing content items of the electronic document into existing invariant content items and existing modifiable content items, according to the content rules; receiving one or more user actions for one or more of the existing one or more content items; determining whether the one or more user actions are permitted by the content rules; reclassifying one or more existing modifiable content items into new invariant content items in response to the one or more user actions; generating an object digest for an aggregation of the existing invariant content items and the new invariant content items by digesting the existing invariant content items and the new invariant content items, wherein the aggregation includes a simple content item, a semi-complex content item and a complex content item, the object digest is generated according to their complexity and generating the object digest includes ignoring one or more existing modifiable content items in the electronic document that are not reclassified into new invariant content items; generating a saved state of the electronic document; and adding a new signed state to the electronic document, the new signed state comprising the object digest, the saved state, and an electronic signature. | 25. A system comprising a computer readable storage device storing a computer program, a display device, and one or more processors operable to interact with the display device and to execute the computer program and perform operations comprising: reading an electronic document, the electronic document comprising content rules, an existing signed state, and existing content items; authenticating the electronic document one or more times, each authenticating comprising: classifying the existing content items of the electronic document into existing invariant content items and existing modifiable content items, according to the content rules; receiving one or more user actions for one or more of the existing one or more content items; determining whether the one or more user actions are permitted by the content rules; reclassifying one or more existing modifiable content items into new invariant content items in response to the one or more user actions; generating an object digest for an aggregation of the existing invariant content items and the new invariant content items by digesting the existing invariant content items and the new invariant content items, wherein the aggregation includes a simple content item, a semi-complex content item and a complex content item, the object digest is generated according to their complexity and generating the object digest includes ignoring one or more existing modifiable content items in the electronic document that are not reclassified into new invariant content items; generating a saved state of the electronic document; and adding a new signed state to the electronic document, the new signed state comprising the object digest, the saved state, and an electronic signature. 26. The system of claim 25 , wherein the digesting is recursive on layers of content items in the electronic document. | 0.916784 |
8,280,101 | 10 | 14 | 10. A method of authenticating an identification document, the identification document comprising: an image including steganographically encoded first machine-readable information including a first plural-bit message, a background including steganographically encoded second machine-readable information including a second plural-bit message, and semantic information including authentication information carried on or in the identification document, the method comprising: determining, using a processor, the first plural-bit message based on the first machine-readable information; determining the second plural-bit message based on the second machine-readable information; determining the authentication information from the semantic information carried on or in the identification document; decrypting the first plural-bit message or the authentication information; and determining whether the identification document is authentic based at least in part on the first plural-bit message, the second plural-bit message, and the authentication information, wherein the second plural-bit message comprises information from the first plural-bit message and the authentication information. | 10. A method of authenticating an identification document, the identification document comprising: an image including steganographically encoded first machine-readable information including a first plural-bit message, a background including steganographically encoded second machine-readable information including a second plural-bit message, and semantic information including authentication information carried on or in the identification document, the method comprising: determining, using a processor, the first plural-bit message based on the first machine-readable information; determining the second plural-bit message based on the second machine-readable information; determining the authentication information from the semantic information carried on or in the identification document; decrypting the first plural-bit message or the authentication information; and determining whether the identification document is authentic based at least in part on the first plural-bit message, the second plural-bit message, and the authentication information, wherein the second plural-bit message comprises information from the first plural-bit message and the authentication information. 14. The method of claim 10 , wherein the first reader and the second reader are configured to process optical scan data. | 0.724771 |
9,208,143 | 3 | 4 | 3. The electronic dictionary device of claim 2 , further comprising a character input module which inputs a search character; wherein the processor further implements an entry word list display process of creating an entry word list based on the dictionary data when the character input module has input a search character and displaying the entry word list on the second display screen, and wherein the common word list display process displays a list of common words on the first display screen when the entry word list display process displays an entry word list on the second display screen. | 3. The electronic dictionary device of claim 2 , further comprising a character input module which inputs a search character; wherein the processor further implements an entry word list display process of creating an entry word list based on the dictionary data when the character input module has input a search character and displaying the entry word list on the second display screen, and wherein the common word list display process displays a list of common words on the first display screen when the entry word list display process displays an entry word list on the second display screen. 4. The electronic dictionary device of claim 3 , wherein the processor, in the common word list display process: specifies, one by one, entry words in the entry word list displayed by the entry word list display process, starting with a first word, and determines whether the specified entry word prefix-matches a next entry word; and regards the specified word as a common word when the processor has determined that the specified entry word prefix-matches the next entry word, and enters the specified word. | 0.5 |
9,319,372 | 1 | 11 | 1. A method comprising: retrieving, at a computer device, multiple messages from a social networking service, the messages containing multiple trending topics; for each respective trending topic of the trending topics, determining by the computer device interarrival times of k messages of the messages, based on time stamps of the k messages, wherein the k messages are last k messages by the time point that contain the respective trending topic, and k is a predetermined number; for each respective trending topic of the trending topics, determining by the computer device a trending speed and a trending acceleration of the respective trending topic at a time point, wherein the trending speed of the respective trending topic at the time point is determined based on the interarrival times of the k messages by v n = k β i = n - k + 1 n β’ b n Β· ( 24 Β· 60 ) wherein v n is the trending speed at n th time point among the time stamps of the messages b n is the interarrival time of the message at n th time point among the time stamps of the messages; and presenting, by the computer device, a treemap including multiple shapes; wherein each respective shape of the shapes is associated with a corresponding trending topic of the trending topics, an area of the respective shape indicates a trending speed of the corresponding trending topic at the time point, and a property of the respective shape indicates a trending acceleration of the corresponding trending topic at the time point. | 1. A method comprising: retrieving, at a computer device, multiple messages from a social networking service, the messages containing multiple trending topics; for each respective trending topic of the trending topics, determining by the computer device interarrival times of k messages of the messages, based on time stamps of the k messages, wherein the k messages are last k messages by the time point that contain the respective trending topic, and k is a predetermined number; for each respective trending topic of the trending topics, determining by the computer device a trending speed and a trending acceleration of the respective trending topic at a time point, wherein the trending speed of the respective trending topic at the time point is determined based on the interarrival times of the k messages by v n = k β i = n - k + 1 n β’ b n Β· ( 24 Β· 60 ) wherein v n is the trending speed at n th time point among the time stamps of the messages b n is the interarrival time of the message at n th time point among the time stamps of the messages; and presenting, by the computer device, a treemap including multiple shapes; wherein each respective shape of the shapes is associated with a corresponding trending topic of the trending topics, an area of the respective shape indicates a trending speed of the corresponding trending topic at the time point, and a property of the respective shape indicates a trending acceleration of the corresponding trending topic at the time point. 11. The method of claim 1 , wherein at least one trending topic of the trending topics is a topic cluster including multiple related trending topics. | 0.919285 |
5,560,009 | 13 | 14 | 13. The method of claim 10, wherein the step of merging comprises the steps of: (a) reading said translator and compiler debug information; (b) generating first and second debug data structures from said translator and compiler debug information; (c) generating a merged lookup table from said first and second debug data structures, wherein said merged lookup table comprises said final debug information; and (d) storing said object code and said final debug information in an object code file, wherein said object code file includes an object code file header. | 13. The method of claim 10, wherein the step of merging comprises the steps of: (a) reading said translator and compiler debug information; (b) generating first and second debug data structures from said translator and compiler debug information; (c) generating a merged lookup table from said first and second debug data structures, wherein said merged lookup table comprises said final debug information; and (d) storing said object code and said final debug information in an object code file, wherein said object code file includes an object code file header. 14. The method of claim 13, wherein said step for generating a merged lookup table comprises the steps of: generating first and second lookup tables from said first and second debug data structures; (b) matching said first and second lookup tables so that entries in said first lookup table have corresponding entries in said second lookup table; (c) copying portions of said compiler debug information from said second lookup table to said first lookup table; (d) marking entries in said first lookup table for deletion; and (e) deleting said entries marked for deletion in said first lookup table; wherein said first lookup table comprises said merged lookup table. | 0.5 |
7,506,250 | 5 | 6 | 5. The method of claim 1 further comprising physically associating the identification tag with the first paper document by attaching the identification tag to the first paper document, embedding the identification tag in the first paper document, or attaching an object to the first paper document wherein the identification tag is attached to the object. | 5. The method of claim 1 further comprising physically associating the identification tag with the first paper document by attaching the identification tag to the first paper document, embedding the identification tag in the first paper document, or attaching an object to the first paper document wherein the identification tag is attached to the object. 6. The method of claim 5 further comprising: reading the identification code from the identification tag physically associated with the first paper document; determining a matching identification code from the memory that matches the identification code; determining, from the memory, electronic document information associated with the matching identification code; and performing an operation using the electronic document information associated with the matching identification code. | 0.5 |
9,570,066 | 14 | 15 | 14. The method of claim 13 , wherein the obtaining step includes: (a1) receiving, at an automatic speech recognition system, audio from the sender; (a2) pre-processing the received audio to generate acoustic feature vectors; (a3) decoding the generated acoustic feature vectors to produce a plurality of speech hypotheses; (a4) post-processing the speech hypotheses to identify speech in the audio from the sender and to create a transcript of the identified speech; and (a5) storing the identified speech. | 14. The method of claim 13 , wherein the obtaining step includes: (a1) receiving, at an automatic speech recognition system, audio from the sender; (a2) pre-processing the received audio to generate acoustic feature vectors; (a3) decoding the generated acoustic feature vectors to produce a plurality of speech hypotheses; (a4) post-processing the speech hypotheses to identify speech in the audio from the sender and to create a transcript of the identified speech; and (a5) storing the identified speech. 15. The method of claim 14 , wherein the modifying of the text-to-speech model in step (c) comprises: estimating a model transformation; and applying the model transformation to the TTS model selected in step (b) to produce an adapted TTS model, wherein the processing step (e) includes using the adapted TTS model to produce the synthesized speech. | 0.5 |
9,444,773 | 10 | 13 | 10. A method comprising based on information in one or more documents, automatically inferring, by one or more computers, abilities of users associated with the documents to perform language translations, the abilities including language capabilities and non-language capabilities; maintaining a database of the abilities of the respective users; receiving, by at least one of the computers, an indication of a language translation to be performed for a user; in response to the indication of the language translation to be performed for the user, querying, by at least one of the computers, the database to identify one or more candidate users to perform the language translation; and determining, by the database, the one or more candidate users to perform the language translation using the language capabilities and non-language capabilities of the one or more candidate users. | 10. A method comprising based on information in one or more documents, automatically inferring, by one or more computers, abilities of users associated with the documents to perform language translations, the abilities including language capabilities and non-language capabilities; maintaining a database of the abilities of the respective users; receiving, by at least one of the computers, an indication of a language translation to be performed for a user; in response to the indication of the language translation to be performed for the user, querying, by at least one of the computers, the database to identify one or more candidate users to perform the language translation; and determining, by the database, the one or more candidate users to perform the language translation using the language capabilities and non-language capabilities of the one or more candidate users. 13. The method of claim 10 , wherein automatically inferring language capabilities and non-language capabilities of users associated with the documents comprises automatically inferring, for each of the users, a proficiency in a technical skill. | 0.814112 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.