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
|
|---|---|---|---|---|---|
9,412,367 | 100 | 101 | 100. Computerized information and display apparatus, comprising: a wireless network interface; processing apparatus in data communication with the network interface; a first display device comprising a substantially flat-screen display device in data communication with the processing apparatus; a second display device also in data communication with the processing apparatus; a data interface in data communication with the processing apparatus and configured to transfer data between the computerized information and display apparatus and a portable electronic device placed in data communication with the data interface; and storage apparatus in data communication with the processing apparatus and comprising at least one computer program, said at least one program being configured to, when executed: obtain digitized speech generated based on speech received from a user, the digitized speech relating to a desired action which the user wishes to perform; and cause, based at least in part on the digitized speech, access of a network entity to cause performance of the desired action; wherein the computerized information and display apparatus is further configured to: receive information obtained via the access of the network entity via the wireless network interface; and provide at least a portion of the received information to the portable electronic device via the data interface; and wherein: at least a portion of the received information can be displayed on each of the first and second display devices. the processing apparatus comprises at least (i) a digital signal processor; (ii) a central processing unit (CPU); (iii) a graphics processor; and (iv) a direct memory access (DMA) function configured to accelerate accesses of said storage apparatus; the first display device comprises a substantially flat-screen capacitive touch screen input and display device in data communication with the processing apparatus; and the second display device comprises a thin-film transistor (TFT) display device in data communication with the processing apparatus; and the first and second display devices are mounted on or at least partly within different surfaces within a land-mobile transport device within which the computerized information and display apparatus is disposed; and further comprising a short-range wireless interface configured to obtain user-specific data from a portable user radio frequency device when the portable user radio frequency device is within sufficient range of the short-range interface, and provide the obtained data to the computerized information apparatus so as to enable one or more functions of the transport device, according to a previously supplied user preference or profile. | 100. Computerized information and display apparatus, comprising: a wireless network interface; processing apparatus in data communication with the network interface; a first display device comprising a substantially flat-screen display device in data communication with the processing apparatus; a second display device also in data communication with the processing apparatus; a data interface in data communication with the processing apparatus and configured to transfer data between the computerized information and display apparatus and a portable electronic device placed in data communication with the data interface; and storage apparatus in data communication with the processing apparatus and comprising at least one computer program, said at least one program being configured to, when executed: obtain digitized speech generated based on speech received from a user, the digitized speech relating to a desired action which the user wishes to perform; and cause, based at least in part on the digitized speech, access of a network entity to cause performance of the desired action; wherein the computerized information and display apparatus is further configured to: receive information obtained via the access of the network entity via the wireless network interface; and provide at least a portion of the received information to the portable electronic device via the data interface; and wherein: at least a portion of the received information can be displayed on each of the first and second display devices. the processing apparatus comprises at least (i) a digital signal processor; (ii) a central processing unit (CPU); (iii) a graphics processor; and (iv) a direct memory access (DMA) function configured to accelerate accesses of said storage apparatus; the first display device comprises a substantially flat-screen capacitive touch screen input and display device in data communication with the processing apparatus; and the second display device comprises a thin-film transistor (TFT) display device in data communication with the processing apparatus; and the first and second display devices are mounted on or at least partly within different surfaces within a land-mobile transport device within which the computerized information and display apparatus is disposed; and further comprising a short-range wireless interface configured to obtain user-specific data from a portable user radio frequency device when the portable user radio frequency device is within sufficient range of the short-range interface, and provide the obtained data to the computerized information apparatus so as to enable one or more functions of the transport device, according to a previously supplied user preference or profile. 101. The computerized information and display apparatus of claim 100 , further comprising video data apparatus in data communication with the processing apparatus and configured to enable video data to be generated and sent to a remote location for viewing thereat while the user is using the computerized information and display apparatus. | 0.5 |
7,609,848 | 8 | 10 | 8. A watermark recovery system comprising: a watermarked document including a watermark with encoded content information; a watermark specification for identifying a specific watermarking technology and identifying a target object in which the watermark is placed; a template specification identifying at least one watermark specification and providing a mapping list indicating a manner in which at least one watermark associated with the at least one watermark specification is merged into a document; a watermark scanning module for scanning the watermarked document to locate a watermark according to the template specification, the watermark scanning module including a repository for storing at least one of the template specification and a watermark specification; and a watermark recovery module for recovering the content information from the located watermark according to a watermark specification identified by the template specification. | 8. A watermark recovery system comprising: a watermarked document including a watermark with encoded content information; a watermark specification for identifying a specific watermarking technology and identifying a target object in which the watermark is placed; a template specification identifying at least one watermark specification and providing a mapping list indicating a manner in which at least one watermark associated with the at least one watermark specification is merged into a document; a watermark scanning module for scanning the watermarked document to locate a watermark according to the template specification, the watermark scanning module including a repository for storing at least one of the template specification and a watermark specification; and a watermark recovery module for recovering the content information from the located watermark according to a watermark specification identified by the template specification. 10. The system of claim 8 , wherein the content information indicates at least one of document type, document-associated application, document authenticity and document source. | 0.5 |
6,094,657 | 5 | 6 | 5. An apparatus for categorizing a plurality of objects which together comprise an object set, wherein a respective categorization value is associated with each object in said set, said apparatus comprising: a request handler for modifying said categorization value of one of said objects or for one of deleting one of said objects or adding a further object to said object set; data storage means for storing a global rating value which is calculated based on each categorization value of all of said objects in said object set; and compound means for recalculating said global rating value responsive to invocation of said request handler, wherein the plurality of objects are Web pages of an Internet environment, wherein each object in said set includes a header which is an HTTP header, said categorization value includes META-tag information, and said modifying means modifies said global rating value by inserting, deleting and updating said META-tag information in said HTTP header; and wherein said META-tag information is represented by a PICS label having said categorization value and a degree value. | 5. An apparatus for categorizing a plurality of objects which together comprise an object set, wherein a respective categorization value is associated with each object in said set, said apparatus comprising: a request handler for modifying said categorization value of one of said objects or for one of deleting one of said objects or adding a further object to said object set; data storage means for storing a global rating value which is calculated based on each categorization value of all of said objects in said object set; and compound means for recalculating said global rating value responsive to invocation of said request handler, wherein the plurality of objects are Web pages of an Internet environment, wherein each object in said set includes a header which is an HTTP header, said categorization value includes META-tag information, and said modifying means modifies said global rating value by inserting, deleting and updating said META-tag information in said HTTP header; and wherein said META-tag information is represented by a PICS label having said categorization value and a degree value. 6. The apparatus for categorizing a plurality of objects as recited in claim 5, wherein said PICS label further includes a time value indicating an age of said META-tag information. | 0.592342 |
8,117,215 | 2 | 3 | 2. The method of claim 1 , wherein said content nodes store content to be accessed by the queries, and wherein indexing the links to said content nodes comprises indexing location identifiers to content in said content nodes. | 2. The method of claim 1 , wherein said content nodes store content to be accessed by the queries, and wherein indexing the links to said content nodes comprises indexing location identifiers to content in said content nodes. 3. The method of claim 2 , wherein the location identifiers comprise website links. | 0.5 |
5,412,714 | 22 | 23 | 22. The method of claim 21 wherein: the step of storing comprises the step of including in each symbol string's definition an indication of a length of the defined symbol string. | 22. The method of claim 21 wherein: the step of storing comprises the step of including in each symbol string's definition an indication of a length of the defined symbol string. 23. The method of claim 22 wherein: the step of including comprises the step of including in a symbol string's definition an indication of a permitted range of length of the defined symbol string. | 0.5 |
8,751,557 | 1 | 11 | 1. A method comprising: concatenating one or more electrical digital signals representing binary expressions of individual ones of characters of a first character expression in a first binary string, said characters of said first character expression representing a first numerical value of a first numerical expression represented by a concatenation of said individual ones of characters of said first character expression, at least one of said individual characters of said first character expression representing a digit value having exactly one of three or more possible unique values, said first numerical value comprising a sum of products, at least one of said products comprising one of said digit values multiplied by a positional value associated with a position of said digit value in the first numerical expression; concatenating one or more electrical digital signals binary expressions of individual ones of characters of a second character expression in a second binary string, said characters of said second character expression representing a second numerical value of a second numerical expression represented by a concatenation of said individual ones of characters of said second character expression, at least one of said individual characters of said second character expression representing a digit value having exactly one of three or more possible unique values, said second numerical value comprising a sum of products, at least one of said products comprising one of said digit values multiplied by a positional value associated with a position of said digit value in the second numerical expression; and determining a relationship between said first and second character expressions based, at least in part, on said first and second binary strings. | 1. A method comprising: concatenating one or more electrical digital signals representing binary expressions of individual ones of characters of a first character expression in a first binary string, said characters of said first character expression representing a first numerical value of a first numerical expression represented by a concatenation of said individual ones of characters of said first character expression, at least one of said individual characters of said first character expression representing a digit value having exactly one of three or more possible unique values, said first numerical value comprising a sum of products, at least one of said products comprising one of said digit values multiplied by a positional value associated with a position of said digit value in the first numerical expression; concatenating one or more electrical digital signals binary expressions of individual ones of characters of a second character expression in a second binary string, said characters of said second character expression representing a second numerical value of a second numerical expression represented by a concatenation of said individual ones of characters of said second character expression, at least one of said individual characters of said second character expression representing a digit value having exactly one of three or more possible unique values, said second numerical value comprising a sum of products, at least one of said products comprising one of said digit values multiplied by a positional value associated with a position of said digit value in the second numerical expression; and determining a relationship between said first and second character expressions based, at least in part, on said first and second binary strings. 11. The method of claim 1 , and further comprising determining said binary expressions of said characters based, at least in part, on an association of characters and binary expressions. | 0.793792 |
8,849,034 | 9 | 17 | 9. A method for triggering a sub-word unit recognition comprising: drawing one or more strokes of a desired sub-word unit using a stylus on a touch screen, wherein one of the drawn one or more strokes is a first head-line stroke and is a last drawn stroke in the drawn one or more strokes of the desired sub-word unit; inputting an associated data of the drawn one or more strokes via the touch screen into a handwriting recognition engine; computing stroke recognition characteristics of each of the drawn one or more strokes with reference to a horizontal reference line, wherein the stroke recognition characteristics are selected from the group comprising aspect ratio and slope; determining a first trigger stroke in the drawn one or more strokes of the desired sub-word unit that can be used to trigger the sub-word unit recognition based as a function of the computed stroke recognition characteristics of each of the multiple drawn strokes, wherein the first trigger stroke is the first head-line stroke which is drawn substantially parallel to the horizontal reference line; and triggering sub-word unit recognition for the drawn one or more strokes by the handwriting recognition engine upon determining the first trigger stroke. | 9. A method for triggering a sub-word unit recognition comprising: drawing one or more strokes of a desired sub-word unit using a stylus on a touch screen, wherein one of the drawn one or more strokes is a first head-line stroke and is a last drawn stroke in the drawn one or more strokes of the desired sub-word unit; inputting an associated data of the drawn one or more strokes via the touch screen into a handwriting recognition engine; computing stroke recognition characteristics of each of the drawn one or more strokes with reference to a horizontal reference line, wherein the stroke recognition characteristics are selected from the group comprising aspect ratio and slope; determining a first trigger stroke in the drawn one or more strokes of the desired sub-word unit that can be used to trigger the sub-word unit recognition based as a function of the computed stroke recognition characteristics of each of the multiple drawn strokes, wherein the first trigger stroke is the first head-line stroke which is drawn substantially parallel to the horizontal reference line; and triggering sub-word unit recognition for the drawn one or more strokes by the handwriting recognition engine upon determining the first trigger stroke. 17. The method of claim 9 , wherein the sub-word unit is selected from the group comprising vowels, consonants, consonant modifiers, vowel modifiers, numerals, and special characters. | 0.900974 |
8,687,210 | 15 | 18 | 15. The method as recited in claim 14 , wherein generating the report is performed in response to a request received from a user, and wherein obtaining at least a portion of the data from the document data structure is performed in response to a request from a report generation module responsible for generating the report from the report design. | 15. The method as recited in claim 14 , wherein generating the report is performed in response to a request received from a user, and wherein obtaining at least a portion of the data from the document data structure is performed in response to a request from a report generation module responsible for generating the report from the report design. 18. The method as recited in claim 15 , wherein the report generation module identifies a subset of the plurality of regions that are pertinent to the report design, wherein the request from the report generation module responsible for generating the report from the report design identifies the subset of the plurality of regions that are pertinent to the design, wherein the data is obtained from the subset of the plurality of regions from the document data structure in response to the request from the report generation module. | 0.5 |
7,991,129 | 33 | 34 | 33. The system of claim 32 , wherein the function includes a voice email service function. | 33. The system of claim 32 , wherein the function includes a voice email service function. 34. The system of claim 33 , wherein the service includes delivering, in the automated voice, information concerning at least one email message having a particular status. | 0.5 |
8,229,402 | 1 | 2 | 1. A method for accessing information in a data file stored in a memory in an electronic device, comprising the steps of: determining a file format for the data file; detecting an attempt to execute the data file in the electronic device; establishing that the electronic device holds no meta descriptor language file adapted to the file format; downloading the meta descriptor language file to a file memory in the electronic device from storage means through a data communication network; accessing the meta descriptor language file adapted to the file format of the data file; parsing the data file by means of a generic parser using said meta descriptor language file; extracting meta data from the data file; presenting information related to the data file from the extracted meta data. | 1. A method for accessing information in a data file stored in a memory in an electronic device, comprising the steps of: determining a file format for the data file; detecting an attempt to execute the data file in the electronic device; establishing that the electronic device holds no meta descriptor language file adapted to the file format; downloading the meta descriptor language file to a file memory in the electronic device from storage means through a data communication network; accessing the meta descriptor language file adapted to the file format of the data file; parsing the data file by means of a generic parser using said meta descriptor language file; extracting meta data from the data file; presenting information related to the data file from the extracted meta data. 2. The method as recited in claim 1 , prior to the step of downloading the meta descriptor language file, comprising the steps of: presenting a selectable option to download the meta descriptor language file to a file memory in the electronic device from storage means through a data communication network; initiating download responsive to detecting a user download command. | 0.5 |
8,704,783 | 10 | 12 | 10. A computer-readable storage medium comprising computer-executable instructions that when executed cause a computing device coupled to a touch screen to perform a method, the method comprising: detecting contact with the touch screen on selected content displayed in the touch screen; detecting the contact moving in a first direction along the selected content in the touch screen; relative to the first direction of contact movement, selecting first additional content displayed in the touch screen by selecting a next word of text, in a first line of text adjacent to the selected content being contacted; detecting the contact moving along the touch screen in a second direction substantially perpendicular to the first line of text that includes the selected first additional content; and responsive to the contact moving along the touch screen in the second direction, selecting second additional content by selecting wrapping text and a final selection word; wherein the wrapping text comprises text from the selected first additional content to a contacted word that the contact moves on in a second line of text; and wherein the final selection word is adjacent to the contacted word that the contact moves on and the final selection word is past the wrapping text in the second line of text. | 10. A computer-readable storage medium comprising computer-executable instructions that when executed cause a computing device coupled to a touch screen to perform a method, the method comprising: detecting contact with the touch screen on selected content displayed in the touch screen; detecting the contact moving in a first direction along the selected content in the touch screen; relative to the first direction of contact movement, selecting first additional content displayed in the touch screen by selecting a next word of text, in a first line of text adjacent to the selected content being contacted; detecting the contact moving along the touch screen in a second direction substantially perpendicular to the first line of text that includes the selected first additional content; and responsive to the contact moving along the touch screen in the second direction, selecting second additional content by selecting wrapping text and a final selection word; wherein the wrapping text comprises text from the selected first additional content to a contacted word that the contact moves on in a second line of text; and wherein the final selection word is adjacent to the contacted word that the contact moves on and the final selection word is past the wrapping text in the second line of text. 12. The computer-readable storage medium comprising computer-executable instructions of claim 10 , the method further comprising: wherein the selecting the first additional content comprises selecting the next word of text as the contact movement approaches the end of a selected word, that comprises the selected content, being contacted. | 0.617381 |
8,332,907 | 8 | 10 | 8. A method comprising: defining a security policy, said security policy defining at least one protected element and a disposition action for a file containing said at least one protected element, said protected element containing sensitive information, and comprising a portion of content of the file; said protected element further comprising at least one of a group composed of a keyword; a file name extension; a link to a protected object, a filename and a metadata element, transferring said security policy to a remote device, said remote device being adapted to: scan a portion of a file system that is not currently subjected to the security policy for said at least one protected element contained in a portion of a file to find a first file, said first file comprising both said at least one protected element and at least one unprotected element, said at least one protected element having been moved by a user of the remote device prior to the scan from a protected region of the file system to an unprotected region of the file system; apply said security policy to said first file; performing the disposition action on the first file; and receive a report from said remote device, said report being based on said scanning and said applying. | 8. A method comprising: defining a security policy, said security policy defining at least one protected element and a disposition action for a file containing said at least one protected element, said protected element containing sensitive information, and comprising a portion of content of the file; said protected element further comprising at least one of a group composed of a keyword; a file name extension; a link to a protected object, a filename and a metadata element, transferring said security policy to a remote device, said remote device being adapted to: scan a portion of a file system that is not currently subjected to the security policy for said at least one protected element contained in a portion of a file to find a first file, said first file comprising both said at least one protected element and at least one unprotected element, said at least one protected element having been moved by a user of the remote device prior to the scan from a protected region of the file system to an unprotected region of the file system; apply said security policy to said first file; performing the disposition action on the first file; and receive a report from said remote device, said report being based on said scanning and said applying. 10. The method of claim 8 , said disposition action comprising at least one of a group composed of: encrypting said file; deleting said file; applying rights management to said file; modifying metadata for said file; and applying security descriptors to said file. | 0.5 |
5,485,372 | 1 | 4 | 1. In a grammar checking system, a system for establishing a correct lexical entry for a word in a sentence to permit unambiguous dictionary lookup of said word by identifying if said word is intrinsically capitalized comprising: pre-processing means for providing a modified training corpus having words that are not proper nouns or intrinsically capitalized words converted to lower case even if they are at the beginning of a sentence; means for generating two versions of said sentence in which said word appears in each version in capitalized and uncapitalized form respectively; means coupled to said modified training corpus for establishing which of said two versions is the more likely; and, means responsive to said two versions for determining by said more likely version of said sentence if said word is an intrinsically capitalized word. | 1. In a grammar checking system, a system for establishing a correct lexical entry for a word in a sentence to permit unambiguous dictionary lookup of said word by identifying if said word is intrinsically capitalized comprising: pre-processing means for providing a modified training corpus having words that are not proper nouns or intrinsically capitalized words converted to lower case even if they are at the beginning of a sentence; means for generating two versions of said sentence in which said word appears in each version in capitalized and uncapitalized form respectively; means coupled to said modified training corpus for establishing which of said two versions is the more likely; and, means responsive to said two versions for determining by said more likely version of said sentence if said word is an intrinsically capitalized word. 4. The system of claim 1, wherein each of said versions has a corresponding parts of speech sequence and wherein said determining means includes means for establishing the probability that each of said versions is correct based on the probability of the parts of speech sequence for each version being correct, means for selecting that version which has the higher parts of speech sequence probability, and means for establishing a lexical entry based on the capitalized or uncapitalized form of the word which exists in the version which has the highest parts of speech sequence probability. | 0.5 |
7,565,613 | 2 | 11 | 2. A computer readable medium storing instructions that, when executed, cause a processor that is a functional component of a computing device to provide a graphical user interface, the graphical user interface comprising: an active document rendered by the processor on an output device that is a functional component of the computing device, wherein the active document is a word processing document created or opened by a user, and wherein the active document is opened within a word processing application that includes tools that enable the user to create and edit the content of the document; a plurality of data display components that are simultaneously displayed, on the output device, with the active document, wherein the display components each contain an indication of data that is automatically selected based on a calculated assumption of contextual relevance to the user that created or opened the active document, and wherein individual items displayed within each display component are listed in a ranked order based on an automatically computed determination of what is most likely to be of interest to the user; and wherein at least one of the data display components is automatically selected, by the processor, based on a particular calculated assumption that links the user that created or opened the active document to a different user, and wherein the particular calculated assumption is determined, by the processor, based on a record of a cut-and-paste operation involving removed of content from a first data source and pasting it into a second data source. | 2. A computer readable medium storing instructions that, when executed, cause a processor that is a functional component of a computing device to provide a graphical user interface, the graphical user interface comprising: an active document rendered by the processor on an output device that is a functional component of the computing device, wherein the active document is a word processing document created or opened by a user, and wherein the active document is opened within a word processing application that includes tools that enable the user to create and edit the content of the document; a plurality of data display components that are simultaneously displayed, on the output device, with the active document, wherein the display components each contain an indication of data that is automatically selected based on a calculated assumption of contextual relevance to the user that created or opened the active document, and wherein individual items displayed within each display component are listed in a ranked order based on an automatically computed determination of what is most likely to be of interest to the user; and wherein at least one of the data display components is automatically selected, by the processor, based on a particular calculated assumption that links the user that created or opened the active document to a different user, and wherein the particular calculated assumption is determined, by the processor, based on a record of a cut-and-paste operation involving removed of content from a first data source and pasting it into a second data source. 11. The user interface of claim 2 , wherein at least one of the data display components contains an indication of data that is relevant to a particular user's role within an organization. | 0.697411 |
7,710,590 | 1 | 5 | 1. A method for generation of a print job ticket comprising: extracting page attribute information from a first electronic document; embedding the page attribute information as an object within the first electronic document; extracting page attribute information from a second electronic document; embedding the page attribute information as an object within the second electronic document; processing the first and second electronic documents to form a print job; automatically reading the objects embedded in the processed documents to retrieve embedded page attribute information; and generating a job ticket for the print job based on the retrieved embedded page attribute information of the first and second electronic documents, including automatically assigning a first page attribute to at least a first page of the print job which includes information from the first document based on the object embedded in the first document and assigning a second page attribute to at least a second page of the print job which includes information from the second document based on the object embedded in the second document. | 1. A method for generation of a print job ticket comprising: extracting page attribute information from a first electronic document; embedding the page attribute information as an object within the first electronic document; extracting page attribute information from a second electronic document; embedding the page attribute information as an object within the second electronic document; processing the first and second electronic documents to form a print job; automatically reading the objects embedded in the processed documents to retrieve embedded page attribute information; and generating a job ticket for the print job based on the retrieved embedded page attribute information of the first and second electronic documents, including automatically assigning a first page attribute to at least a first page of the print job which includes information from the first document based on the object embedded in the first document and assigning a second page attribute to at least a second page of the print job which includes information from the second document based on the object embedded in the second document. 5. The method of claim 1 , wherein for at least one of the documents, the embedding of the page attribute information as an object includes embedding an XML tag in the document. | 0.722571 |
8,311,946 | 33 | 34 | 33. The method of claim 22 , wherein delivering user-requested pages of said specific document further comprises: delivering user-requested text in the form of low resolution images of pages of text suitable for viewing and selecting. | 33. The method of claim 22 , wherein delivering user-requested pages of said specific document further comprises: delivering user-requested text in the form of low resolution images of pages of text suitable for viewing and selecting. 34. The method of claim 33 , wherein delivering the user-selected portion further comprises: delivering user-selected text suitable for performing the standard operation is performed. | 0.564286 |
9,436,927 | 16 | 17 | 16. An optical, magnetic, or semiconductor computer-readable storage medium having instructions stored thereon which, when executed by a processor of a computing system, cause the computing system to perform operations comprising: modeling a document on a server into semantic pieces as a plurality of cells for a construct of the document; identifying at least one cell of interest of the plurality of cells to at least one user of a plurality of users, the at least one cell of interest comprising a portion of the document cached on the server; in response to identifying the at least one cell of interest, sending the cached portion of the at least one cell of interest to a browser associated with the at least one user; associating the at least one cell of interest with the at least one user; storing an association between the at least one cell of interest and the at least one user; obtaining a first revision of interest to the at least one cell of interest; determining, based upon the association between the at least one cell of interest and the at least one user, that the first revision of interest is to be sent to the browser associated with the at least one user; and sending a cached portion of the first revision of interest to the browser associated with the at least one user, whereby the cached portion of the first revision is displayed by the browser along with a first identifier indicating the association between the at least one cell of interest and the at least one user. | 16. An optical, magnetic, or semiconductor computer-readable storage medium having instructions stored thereon which, when executed by a processor of a computing system, cause the computing system to perform operations comprising: modeling a document on a server into semantic pieces as a plurality of cells for a construct of the document; identifying at least one cell of interest of the plurality of cells to at least one user of a plurality of users, the at least one cell of interest comprising a portion of the document cached on the server; in response to identifying the at least one cell of interest, sending the cached portion of the at least one cell of interest to a browser associated with the at least one user; associating the at least one cell of interest with the at least one user; storing an association between the at least one cell of interest and the at least one user; obtaining a first revision of interest to the at least one cell of interest; determining, based upon the association between the at least one cell of interest and the at least one user, that the first revision of interest is to be sent to the browser associated with the at least one user; and sending a cached portion of the first revision of interest to the browser associated with the at least one user, whereby the cached portion of the first revision is displayed by the browser along with a first identifier indicating the association between the at least one cell of interest and the at least one user. 17. The optical, magnetic, or semiconductor computer-readable storage medium of claim 16 , comprising further computer-readable instructions which, when executed by the computing system, cause the computing system to convert the cached portion of the document to or from at least one format associated with a client application. | 0.686424 |
8,463,766 | 1 | 4 | 1. A computer-implemented method comprising: obtaining aggregate document usage information provided by a plurality of users for a first document wherein the document usage information represents interactions of the plurality of users with a same specific position within the first document wherein the document usage information includes an amount of time that the plurality of users spent accessing the position in the document; receiving a query submitted by a user of a computer system; obtaining search results responsive to the query wherein each search result identifies a respective document and wherein at least one of the search results identifies the first document; ordering the search results based on, at least, the document usage information; and after the ordering, providing the search results to the computer system. | 1. A computer-implemented method comprising: obtaining aggregate document usage information provided by a plurality of users for a first document wherein the document usage information represents interactions of the plurality of users with a same specific position within the first document wherein the document usage information includes an amount of time that the plurality of users spent accessing the position in the document; receiving a query submitted by a user of a computer system; obtaining search results responsive to the query wherein each search result identifies a respective document and wherein at least one of the search results identifies the first document; ordering the search results based on, at least, the document usage information; and after the ordering, providing the search results to the computer system. 4. The method of claim 1 wherein the at least one search result that identifies the first document identifies the location in the first document. | 0.692797 |
8,219,569 | 2 | 17 | 2. The method of claim 1 , wherein said first SQL statements, when executed, cause one or more database object types to be created. | 2. The method of claim 1 , wherein said first SQL statements, when executed, cause one or more database object types to be created. 17. A volatile or non-volatile computer-readable storage medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2 . | 0.5 |
9,237,297 | 1 | 4 | 1. A method of reproducing a story at a user terminal, the method comprising the steps of: (A) giving a user access to an electronic copy of a video story, said video story having a plurality of parallel video streams which correspond to a plurality of parallel story timelines to said video story, respectively, wherein each of said parallel video streams includes a respective plurality of video segments which are located in a storage medium, and are in chronological order, said plurality of video segments are represented by a plurality of icons, each along one of a plurality of visual timelines on an on-screen interface, ones of said icons each along a respective one of said plurality of visual timelines which corresponds to a respective one of the parallel video streams; (B) receiving from the user a user requested first selection of a first one of the video segments from one of the parallel video streams; (C) reproducing packets of video data corresponding to the user requested first selection of the first one of the video/story segments to play the user requested first selection at the user terminal; (D) receiving from the user a user requested second selection of a second one of the video segments from another of said parallel video streams, wherein the second one of the video segments is not limited to being chronologically after and chronologically at the same time as the one of the video segments, and wherein each of said parallel video streams corresponds to a respective audio sequence prior to step (A); (E) reproducing packets of video data corresponding to the user requested second one of the video segments to play the user requested second selection at the user terminal, and indicating on the on-screen interface which of the video segments have been reproduced; (F) reproducing packets of video data corresponding to a third one of the video segments from any of the parallel video streams to play the third one of the video story segments at the user terminal; wherein said third one of said video segments is later in chronological time in said video story than said first one and said second one of said video segments, and steps (D) and (E) occur after steps (B) and (C) and before step (F); and wherein said first one of said video segments with its corresponding audio sequence from said one of said parallel video streams and another of said video segments with its corresponding audio sequence from said another of said parallel video streams occur at the same time in said video story and are respectively different in both video and audio content. | 1. A method of reproducing a story at a user terminal, the method comprising the steps of: (A) giving a user access to an electronic copy of a video story, said video story having a plurality of parallel video streams which correspond to a plurality of parallel story timelines to said video story, respectively, wherein each of said parallel video streams includes a respective plurality of video segments which are located in a storage medium, and are in chronological order, said plurality of video segments are represented by a plurality of icons, each along one of a plurality of visual timelines on an on-screen interface, ones of said icons each along a respective one of said plurality of visual timelines which corresponds to a respective one of the parallel video streams; (B) receiving from the user a user requested first selection of a first one of the video segments from one of the parallel video streams; (C) reproducing packets of video data corresponding to the user requested first selection of the first one of the video/story segments to play the user requested first selection at the user terminal; (D) receiving from the user a user requested second selection of a second one of the video segments from another of said parallel video streams, wherein the second one of the video segments is not limited to being chronologically after and chronologically at the same time as the one of the video segments, and wherein each of said parallel video streams corresponds to a respective audio sequence prior to step (A); (E) reproducing packets of video data corresponding to the user requested second one of the video segments to play the user requested second selection at the user terminal, and indicating on the on-screen interface which of the video segments have been reproduced; (F) reproducing packets of video data corresponding to a third one of the video segments from any of the parallel video streams to play the third one of the video story segments at the user terminal; wherein said third one of said video segments is later in chronological time in said video story than said first one and said second one of said video segments, and steps (D) and (E) occur after steps (B) and (C) and before step (F); and wherein said first one of said video segments with its corresponding audio sequence from said one of said parallel video streams and another of said video segments with its corresponding audio sequence from said another of said parallel video streams occur at the same time in said video story and are respectively different in both video and audio content. 4. The method of claim 1 , wherein each of said parallel video streams corresponds to a respective event. | 0.788306 |
7,657,516 | 1 | 14 | 1. A method for processing a relational database query, comprising: generating, using a processor coupled to a multidimensional data source, a relational model of the multidimensional data source using one or more of a schema for the multidimensional data source and metadata for the multidimensional data source, wherein the relational model comprises: a relational-to-multidimensional mapping between a virtual relational table for a relational database application corresponding to the multidimensional data source and the multidimensional data source, and the schema and metadata accessed from the multidimensional data source for the virtual relational table; forming the relational database query from the relational database application against the relational model of the multidimensional data source using a graphical user interface displayed on a display coupled to the processor, wherein the graphical user interface: displays a presentation layer representation of the virtual relational table for the relational database application corresponding to the multidimensional data source, enables pointer-driven selection for query of one or more tables and columns of data stored in the multidimensional data source and represented by the displayed presentation layer representation, and enables selection of a detail filter to apply against the relational model; receiving the relational database query, the received relational database query being drawn against the relational model of the multidimensional data source, wherein the relational database query specifies a detail filter against the relational model having selected predicates; using the relational-to-multidimensional mapping together with relational/multidimensional equivalency logic to construct a multidimensional database query based on the received relational database query, wherein the relational/multidimensional equivalency logic comprises a general mapping between relational queries and structures and multidimensional queries and structures, wherein the constructed multidimensional query specifies, for each of the selected predicates that can be applied against the relational model of the multidimensional data source before a crossjoin operation is performed, applying the selected predicate against the relational model of the multidimensional data source before the crossjoin operation is performed; submitting the constructed multidimensional database query for execution against the modeled multidimensional data source, wherein the multidimensional data source comprises three or more dimensions; and displaying, on the display, a result of the constructed multidimensional database query against the modeled multidimensional data source. | 1. A method for processing a relational database query, comprising: generating, using a processor coupled to a multidimensional data source, a relational model of the multidimensional data source using one or more of a schema for the multidimensional data source and metadata for the multidimensional data source, wherein the relational model comprises: a relational-to-multidimensional mapping between a virtual relational table for a relational database application corresponding to the multidimensional data source and the multidimensional data source, and the schema and metadata accessed from the multidimensional data source for the virtual relational table; forming the relational database query from the relational database application against the relational model of the multidimensional data source using a graphical user interface displayed on a display coupled to the processor, wherein the graphical user interface: displays a presentation layer representation of the virtual relational table for the relational database application corresponding to the multidimensional data source, enables pointer-driven selection for query of one or more tables and columns of data stored in the multidimensional data source and represented by the displayed presentation layer representation, and enables selection of a detail filter to apply against the relational model; receiving the relational database query, the received relational database query being drawn against the relational model of the multidimensional data source, wherein the relational database query specifies a detail filter against the relational model having selected predicates; using the relational-to-multidimensional mapping together with relational/multidimensional equivalency logic to construct a multidimensional database query based on the received relational database query, wherein the relational/multidimensional equivalency logic comprises a general mapping between relational queries and structures and multidimensional queries and structures, wherein the constructed multidimensional query specifies, for each of the selected predicates that can be applied against the relational model of the multidimensional data source before a crossjoin operation is performed, applying the selected predicate against the relational model of the multidimensional data source before the crossjoin operation is performed; submitting the constructed multidimensional database query for execution against the modeled multidimensional data source, wherein the multidimensional data source comprises three or more dimensions; and displaying, on the display, a result of the constructed multidimensional database query against the modeled multidimensional data source. 14. The method of claim 1 , further comprising: determining that the received relational database query is drawn against both the relational model of the multidimensional data source and one or more native relational tables; and constructing a native relational database query based on aspects of the received relational database query drawn against conventional relational tables; and submitting the native relational database query for execution against the conventional relational tables, and wherein the constructed multidimensional database query is based on aspects of the received relational database query drawn against the relational model of the multidimensional data source. | 0.662229 |
7,836,460 | 1 | 2 | 1. A method for operating a Web Services search method in a networked environment, wherein a Service Provider registers Web Services at a Service Broker, and wherein a Service Broker is inquired by a Service Consumer for offering Web Services, and a Service Provider provides an inquired Web Service to the Service Consumer, wherein the Service Broker maintains a service model comprising Web Service description data and wherein the service model is created by the Service Broker according to Web Service data offered by the Service Provider, and wherein the service model is used by the Service Broker to process inquiries issued by the Service Consumer, comprising: retrieving data mining input data relating to description details of the inquired Web Services from respective Service descriptions of the inquired Web Services; performing a data mining function on said data mining input data, wherein a clustering is performed with a distance calculation function including said description details, wherein the distance calculation includes the degree of interaction between said Web Services, and wherein the clustering yields a cluster model comprising a plurality of clusters and a mapping for each Web Service to one of said clusters, wherein Web Services having a similar semantic meaning are collected in a single cluster, yielding a data mining result; adding cluster information according to said data mining result to said service model resulting in an extended service model, thus associating each service with the cluster it is assigned to in the data mining result and storing this extended service model in a database; and offering search response data based on said extended service model in response to Web Services search operations. | 1. A method for operating a Web Services search method in a networked environment, wherein a Service Provider registers Web Services at a Service Broker, and wherein a Service Broker is inquired by a Service Consumer for offering Web Services, and a Service Provider provides an inquired Web Service to the Service Consumer, wherein the Service Broker maintains a service model comprising Web Service description data and wherein the service model is created by the Service Broker according to Web Service data offered by the Service Provider, and wherein the service model is used by the Service Broker to process inquiries issued by the Service Consumer, comprising: retrieving data mining input data relating to description details of the inquired Web Services from respective Service descriptions of the inquired Web Services; performing a data mining function on said data mining input data, wherein a clustering is performed with a distance calculation function including said description details, wherein the distance calculation includes the degree of interaction between said Web Services, and wherein the clustering yields a cluster model comprising a plurality of clusters and a mapping for each Web Service to one of said clusters, wherein Web Services having a similar semantic meaning are collected in a single cluster, yielding a data mining result; adding cluster information according to said data mining result to said service model resulting in an extended service model, thus associating each service with the cluster it is assigned to in the data mining result and storing this extended service model in a database; and offering search response data based on said extended service model in response to Web Services search operations. 2. The method of claim 1 , wherein said Web Services are implemented as Remote Portlets, and wherein said data mining input data is obtained from respective Portlet markup. | 0.601852 |
7,685,209 | 8 | 11 | 8. An annotation method for annotating content comprising: dynamically receiving annotation information from one or more users wherein annotation information includes an annotation rating; determining one or more suggested keywords based on a related annotation rating and used by a user to annotate one or more items of content; performing text recognition on a given item of content to generate recognized text; determining a subject of the given item of content from the recognized text; determining one or more suggested keywords based on the subject of the given item of content; determining one or more suggested keywords used by at least one other user to annotate the given item of content; displaying a set of suggested keywords comprising the one or more suggested keywords used by a user to annotate one or more items of content, the one or more suggested keywords based on the subject of the item of content and the one or more suggested keywords used by at least one other user to annotate the given item of content on an editing interface page configured to receive one or more annotations for the given item of content; receiving a request via the editing interface page to annotate the given item of content with at least one keyword from the set of suggested keywords; displaying the at least one keyword in a set of annotating keywords used to annotate the content, displaying a visible delimiter following the at least one keyword; and associating the at least one keyword with the content to annotate the content. | 8. An annotation method for annotating content comprising: dynamically receiving annotation information from one or more users wherein annotation information includes an annotation rating; determining one or more suggested keywords based on a related annotation rating and used by a user to annotate one or more items of content; performing text recognition on a given item of content to generate recognized text; determining a subject of the given item of content from the recognized text; determining one or more suggested keywords based on the subject of the given item of content; determining one or more suggested keywords used by at least one other user to annotate the given item of content; displaying a set of suggested keywords comprising the one or more suggested keywords used by a user to annotate one or more items of content, the one or more suggested keywords based on the subject of the item of content and the one or more suggested keywords used by at least one other user to annotate the given item of content on an editing interface page configured to receive one or more annotations for the given item of content; receiving a request via the editing interface page to annotate the given item of content with at least one keyword from the set of suggested keywords; displaying the at least one keyword in a set of annotating keywords used to annotate the content, displaying a visible delimiter following the at least one keyword; and associating the at least one keyword with the content to annotate the content. 11. The method of claim 8 , further comprising displaying the at least one keyword disparately than other suggested keywords. | 0.711982 |
8,032,830 | 14 | 15 | 14. The method of claim 1 , wherein if text selection is meaningful for the reference document, a user can perform a text quotation. | 14. The method of claim 1 , wherein if text selection is meaningful for the reference document, a user can perform a text quotation. 15. The method of claim 14 , wherein the text quotation is obtained by selecting a region of text. | 0.5 |
8,174,559 | 20 | 23 | 20. A videoconferencing apparatus, comprising: means for generating compressed video data from a videoconferencing video stream; means for generating a compressed audio data based on a videoconferencing audio stream; means for generating text data based on the videoconferencing audio stream; and means for generating time alignment information indicative of a time of generation of the compressed video, audio, and text data and operable for time aligning the compressed video data, compressed audio data, and the text data. | 20. A videoconferencing apparatus, comprising: means for generating compressed video data from a videoconferencing video stream; means for generating a compressed audio data based on a videoconferencing audio stream; means for generating text data based on the videoconferencing audio stream; and means for generating time alignment information indicative of a time of generation of the compressed video, audio, and text data and operable for time aligning the compressed video data, compressed audio data, and the text data. 23. An apparatus as in claim 20 , further comprising means for adjusting a time of storing the compressed video data, a time of storing the compressed audio data, and a time of storing the text data. | 0.810837 |
9,152,860 | 22 | 28 | 22. A machine-accessible device having instructions stored thereon that are configured when executed to cause a machine to at least: identify graphical objects within a recorded image of a card object by: i) determining pixels that correspond to each graphical object of the image; ii) determining a graphical object type of each of the graphical objects; iii) creating a bounding region for each of the graphical objects; iv) determining an origin of each of the graphical objects; and v) determining a coordinate relative to the origin for each graphical object pixel; determine a statistical probability that features are present within each of the graphical objects, each of the features including at least one pixel having coordinates; and for each graphical object type, combine the statistical probabilities for each of the features of the identified graphical objects of that graphical object type into a classifier data structure. | 22. A machine-accessible device having instructions stored thereon that are configured when executed to cause a machine to at least: identify graphical objects within a recorded image of a card object by: i) determining pixels that correspond to each graphical object of the image; ii) determining a graphical object type of each of the graphical objects; iii) creating a bounding region for each of the graphical objects; iv) determining an origin of each of the graphical objects; and v) determining a coordinate relative to the origin for each graphical object pixel; determine a statistical probability that features are present within each of the graphical objects, each of the features including at least one pixel having coordinates; and for each graphical object type, combine the statistical probabilities for each of the features of the identified graphical objects of that graphical object type into a classifier data structure. 28. The machine-accessible device of claim 22 , further comprising instructions stored thereon that are configured when executed to cause a machine to at determine the graphical object type of each of the graphical objects by determining which features of the identified graphical objects have the greatest probability of being included within a particular graphical object type. | 0.735335 |
8,191,038 | 10 | 14 | 10. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for converting a template written in a templating language, the method comprising: receiving the template in the templating language at a translator; compiling the template with the translator create a function in the host language; merging the function in the host language with a subset of code written in the host language; converting the subset of code written in the host language into a safe subset of code written in the host language, wherein the safe subset of code written in the host language adheres to a pre-determined schema and a pre-determined set of constraints; and translating the safe subset of code written in the host language to a subset of code written in a templated language, wherein the translating comprises: determining that an element within the safe subset of code written in the host language comprises a dynamic value, and wrapping the dynamic value with host language code that allows the dynamic value to be translated to the templated language upon execution of the subset of code written in the templated language. | 10. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for converting a template written in a templating language, the method comprising: receiving the template in the templating language at a translator; compiling the template with the translator create a function in the host language; merging the function in the host language with a subset of code written in the host language; converting the subset of code written in the host language into a safe subset of code written in the host language, wherein the safe subset of code written in the host language adheres to a pre-determined schema and a pre-determined set of constraints; and translating the safe subset of code written in the host language to a subset of code written in a templated language, wherein the translating comprises: determining that an element within the safe subset of code written in the host language comprises a dynamic value, and wrapping the dynamic value with host language code that allows the dynamic value to be translated to the templated language upon execution of the subset of code written in the templated language. 14. The computer-readable storage medium of claim 10 , wherein the method further comprises: ensuring that the template adheres to a pre-determined set of constraints; and ensuring that the subset of code written in the templated language adheres to a pre-determined set of constraints. | 0.77898 |
7,925,012 | 29 | 37 | 29. A non-transitory computer-readable storage medium having instructions stored thereon, which in response to execution by a processor, results in a machine performing the operations of: replacing at least one instance of the data in at least one of the blocks with at least one substitute to provide at least one modified block, wherein the data to be replaced is indicative of a reference to at least a first other instance of the data in at least one of the blocks and the substitute is indicative of a reference to at least a second other instance of the data in at least one of the blocks different than the at least one first one other instance of the data; transmitting a modified compressed digital media, the modified compressed digital media being in conformity with a format of the original compressed digital media and comprising the at least one modified block; and transmitting, by a separate path from the modified compressed digital media, complementary information, wherein the complementary information is suitable for use with the modified compressed digital media to reproduce the original compressed digital media. | 29. A non-transitory computer-readable storage medium having instructions stored thereon, which in response to execution by a processor, results in a machine performing the operations of: replacing at least one instance of the data in at least one of the blocks with at least one substitute to provide at least one modified block, wherein the data to be replaced is indicative of a reference to at least a first other instance of the data in at least one of the blocks and the substitute is indicative of a reference to at least a second other instance of the data in at least one of the blocks different than the at least one first one other instance of the data; transmitting a modified compressed digital media, the modified compressed digital media being in conformity with a format of the original compressed digital media and comprising the at least one modified block; and transmitting, by a separate path from the modified compressed digital media, complementary information, wherein the complementary information is suitable for use with the modified compressed digital media to reproduce the original compressed digital media. 37. The computer-readable medium of claim 29 , wherein the instructions for transmitting a modified compressed digital text include instructions for transmitting a modified compressed digital text that has a size different from the original compressed digital text. | 0.536713 |
6,108,444 | 8 | 10 | 8. A system for recognizing handwritten words by pre-processing a scanned document containing handwriting where features for word localization are extracted from handwritten words contained in said document, said system comprising: i) a feature extraction module which forms connecting component regions of a scanned document image representing said handwritten words of said document; ii) a curve group generation module assembles groups of curves separated by intra-word separation curve segments belonging to said handwritten words within said scanned document image wherein text lines are independent of page orientation; and iii) a memory wherein said handwritten words are indexed based on features for word localization extracted from said handwritten words contained in said document and wherein text segments are grouped from said handwritten words for purposes of indexing said documents based on words queries. | 8. A system for recognizing handwritten words by pre-processing a scanned document containing handwriting where features for word localization are extracted from handwritten words contained in said document, said system comprising: i) a feature extraction module which forms connecting component regions of a scanned document image representing said handwritten words of said document; ii) a curve group generation module assembles groups of curves separated by intra-word separation curve segments belonging to said handwritten words within said scanned document image wherein text lines are independent of page orientation; and iii) a memory wherein said handwritten words are indexed based on features for word localization extracted from said handwritten words contained in said document and wherein text segments are grouped from said handwritten words for purposes of indexing said documents based on words queries. 10. The invention of claim 8 further comprising a memory wherein said handwritten words are indexed based on features for word localization extracted from said handwritten words contained in said document and wherein text segments are grouped from said handwritten words for purposes of indexing said documents based on words queries. | 0.5 |
9,836,994 | 23 | 28 | 23. A method of simulating welding activity, the method comprising: tracking a welding tool manipulated by a user to determine movement and orientation of the welding tool relative to a welding coupon during a simulated welding operation; generating a simulated welding surface for the welding coupon; displaying the simulated welding surface on a display device disposed in a helmet; generating a simulated weld puddle having real-time molten metal fluidity and real-time heat dissipation characteristics on the simulated welding surface during the simulated welding operation; displaying the simulated weld puddle on the display device; generating a simulated weld bead based on the simulated weld puddle; and displaying the simulated weld bead on the display device. | 23. A method of simulating welding activity, the method comprising: tracking a welding tool manipulated by a user to determine movement and orientation of the welding tool relative to a welding coupon during a simulated welding operation; generating a simulated welding surface for the welding coupon; displaying the simulated welding surface on a display device disposed in a helmet; generating a simulated weld puddle having real-time molten metal fluidity and real-time heat dissipation characteristics on the simulated welding surface during the simulated welding operation; displaying the simulated weld puddle on the display device; generating a simulated weld bead based on the simulated weld puddle; and displaying the simulated weld bead on the display device. 28. The method of claim 23 , wherein the welding tool is one of a plurality of welding tools interchangeably associated with a processor based subsystem. | 0.717712 |
8,082,151 | 7 | 8 | 7. A method according to claim 1 , further comprising: associating a semantic tag with the input clause, the semantic tag being an abbreviation associated with the input clause; and identifying an output response clause based on the associated semantic tag. | 7. A method according to claim 1 , further comprising: associating a semantic tag with the input clause, the semantic tag being an abbreviation associated with the input clause; and identifying an output response clause based on the associated semantic tag. 8. A method according to claim 7 , further comprising correlating the semantic tag with the previously received clause. | 0.5 |
9,075,849 | 15 | 20 | 15. A computer-implemented method for identifying and ranking relevant documents from a corpus of citationally-related documents, said computer-implemented method comprising: under control of a computing device configured with specific computer-executable instructions: receiving a first set of identification information identifying one or more input documents from said corpus of citationally-related documents; using said first set of identification information to ascertain, from a computer-accessible index: i) a second set of identification information identifying, for each of said one or more input documents, a selected number of citationally-related output documents, and ii) for each identified pair of citationally-related input document and output document, a first numerical score having a statistical correlation to whether a direct citation exists between each said identified pair of citationally-related documents, said computer-accessible index comprising: i) identification information identifying each potential input document from said corpus of citationally-related documents, ii) identification information identifying, for each said potential input document, a selected number of citationally-related potential output documents from said corpus of citationally-related documents, and iii) said first numerical score pre-calculated for each potential pair of citationally-related potential input document and potential output document and wherein said first numerical score is calculated based at least in part on how many indirect citations exist between each said potential pair of citationally related documents and, for each indirect citation, how many citation links separate each said potential pair of citationally-related documents; calculating, for each of said citationally-related output documents, a second numerical score configured to have a statistical correlation to whether a direct citation exists between any of said one or more input documents and each of said citationally-related output documents, and wherein said second numerical score is calculated based at least in part on said first numerical score; and displaying a search query result comprising a third set of identification information identifying one or more of said citationally-related output documents and wherein said search query results are sorted in accordance with each said corresponding second numerical score. | 15. A computer-implemented method for identifying and ranking relevant documents from a corpus of citationally-related documents, said computer-implemented method comprising: under control of a computing device configured with specific computer-executable instructions: receiving a first set of identification information identifying one or more input documents from said corpus of citationally-related documents; using said first set of identification information to ascertain, from a computer-accessible index: i) a second set of identification information identifying, for each of said one or more input documents, a selected number of citationally-related output documents, and ii) for each identified pair of citationally-related input document and output document, a first numerical score having a statistical correlation to whether a direct citation exists between each said identified pair of citationally-related documents, said computer-accessible index comprising: i) identification information identifying each potential input document from said corpus of citationally-related documents, ii) identification information identifying, for each said potential input document, a selected number of citationally-related potential output documents from said corpus of citationally-related documents, and iii) said first numerical score pre-calculated for each potential pair of citationally-related potential input document and potential output document and wherein said first numerical score is calculated based at least in part on how many indirect citations exist between each said potential pair of citationally related documents and, for each indirect citation, how many citation links separate each said potential pair of citationally-related documents; calculating, for each of said citationally-related output documents, a second numerical score configured to have a statistical correlation to whether a direct citation exists between any of said one or more input documents and each of said citationally-related output documents, and wherein said second numerical score is calculated based at least in part on said first numerical score; and displaying a search query result comprising a third set of identification information identifying one or more of said citationally-related output documents and wherein said search query results are sorted in accordance with each said corresponding second numerical score. 20. The computer-implemented method of claim 15 further comprising visually displaying said search query results in the form of an interactive chart, graph, or map. | 0.758824 |
8,363,918 | 10 | 13 | 10. An apparatus for detecting a plurality of anatomical landmarks in an image comprising: means for detecting a first landmark of the plurality of anatomical landmarks in the image using marginal space learning (MSL); means for estimating locations of remaining landmarks of the plurality of anatomical landmarks in the image based on the detected first landmark using a learned geometric model relating the plurality of anatomical landmarks; and means for detecting each of said remaining landmarks using MSL in a portion of the image constrained based on the estimated location of each of said remaining landmarks. | 10. An apparatus for detecting a plurality of anatomical landmarks in an image comprising: means for detecting a first landmark of the plurality of anatomical landmarks in the image using marginal space learning (MSL); means for estimating locations of remaining landmarks of the plurality of anatomical landmarks in the image based on the detected first landmark using a learned geometric model relating the plurality of anatomical landmarks; and means for detecting each of said remaining landmarks using MSL in a portion of the image constrained based on the estimated location of each of said remaining landmarks. 13. The apparatus of claim 10 , wherein said means for estimating locations of remaining landmarks of the plurality of anatomical landmarks in the image based on the detected first landmark using a learned geometric model relating the plurality of anatomical landmarks comprises: means for transforming a mean shape of the learned geometric model based on a similarity transformation of the detected first landmark. | 0.767897 |
8,797,288 | 11 | 13 | 11. A method for a user interface recognizing the interruption of the execution of a first gesture with the execution of a second gesture, the method comprising: receiving measured information from a user interface sensor, the measured information responsive to user interaction actions made by a user; applying at least one operation to the measured information to produce a sequence of symbols, each symbol produced by the at least one operation responsive to an associated portion of a user interaction actions made by the user; determining from the sequence of symbols that the user's execution of a first gesture has been interrupted; determining from the sequence of symbols that the user's execution of a second gesture has been started and completed before the first gesture has been resumed; and determining from the sequence of symbols that the user's execution of the first gesture has been completed; wherein the first gesture is recognized and the second gesture is recognized. | 11. A method for a user interface recognizing the interruption of the execution of a first gesture with the execution of a second gesture, the method comprising: receiving measured information from a user interface sensor, the measured information responsive to user interaction actions made by a user; applying at least one operation to the measured information to produce a sequence of symbols, each symbol produced by the at least one operation responsive to an associated portion of a user interaction actions made by the user; determining from the sequence of symbols that the user's execution of a first gesture has been interrupted; determining from the sequence of symbols that the user's execution of a second gesture has been started and completed before the first gesture has been resumed; and determining from the sequence of symbols that the user's execution of the first gesture has been completed; wherein the first gesture is recognized and the second gesture is recognized. 13. The method of claim 11 wherein point of the interruption within the trajectory of the first gesture is used to convey semantic content. | 0.742593 |
8,990,074 | 1 | 4 | 1. A method of noise-robust speech classification, comprising: inputting classification parameters to a speech classifier from external components; generating, in the speech classifier, internal classification parameters from at least one of the input classification parameters; setting a Normalized Auto-correlation Coefficient Function threshold, wherein setting the Normalized Auto-correlation Coefficient Function threshold comprises: increasing a first voicing threshold for classifying a current frame as unvoiced when a signal-to-noise ratio (SNR) fails to exceed a first SNR threshold, wherein the first voicing threshold is not adjusted if the SNR is above the first SNR threshold, and increasing an energy threshold for classifying the current frame as unvoiced when the noise estimate exceeds a noise estimate threshold, wherein the energy threshold is not adjusted if the noise estimate is below the noise estimate threshold; and determining a speech mode classification based on a the first voicing threshold and the energy threshold. | 1. A method of noise-robust speech classification, comprising: inputting classification parameters to a speech classifier from external components; generating, in the speech classifier, internal classification parameters from at least one of the input classification parameters; setting a Normalized Auto-correlation Coefficient Function threshold, wherein setting the Normalized Auto-correlation Coefficient Function threshold comprises: increasing a first voicing threshold for classifying a current frame as unvoiced when a signal-to-noise ratio (SNR) fails to exceed a first SNR threshold, wherein the first voicing threshold is not adjusted if the SNR is above the first SNR threshold, and increasing an energy threshold for classifying the current frame as unvoiced when the noise estimate exceeds a noise estimate threshold, wherein the energy threshold is not adjusted if the noise estimate is below the noise estimate threshold; and determining a speech mode classification based on a the first voicing threshold and the energy threshold. 4. The method of claim 1 , wherein the input parameters comprise voice activity information. | 0.870423 |
9,128,988 | 9 | 16 | 9. A system for searching, the system comprising one or more processors and one or more memory devices coupled to the one or more processors, the one or more memory devices storing executable and operational code effective to cause the one or more processors to: receive a query; identify a plurality of documents relevant to the query; identify a plurality of departments associated with the plurality of documents; select one or more selected departments from the plurality of departments according to confidence scores associated with the plurality of departments; add one or more additional departments to the one or more selected departments if the confidence scores of the one or more selected departments do not meet a threshold condition; and transmit a representation of the plurality of documents in accordance with the one or more selected departments; wherein the executable and operational code are further effective to add the one or more additional departments to the one or more selected departments if the confidence scores of the one or more selected departments do not meet a threshold condition by: receiving a plurality of queries from a plurality of users; grouping the plurality of queries into a plurality of query clusters according to a textual similarity of the plurality of queries to one another based on the textual similarity, a similarity of search, and a co-occurrence within a same browsing session; for each cluster of the plurality of query clusters, identifying at least one associated department having search results for the plurality of queries of the each cluster belonging thereto with a higher click-through rate as compared to other departments having search results for the plurality of queries of the each cluster; identifying a selected query cluster of the plurality of query clusters corresponding to the query based on the textual similarity of the plurality of queries of the each cluster to the query; and adding the at least one associated department of the selected query cluster to the one or more selected departments. | 9. A system for searching, the system comprising one or more processors and one or more memory devices coupled to the one or more processors, the one or more memory devices storing executable and operational code effective to cause the one or more processors to: receive a query; identify a plurality of documents relevant to the query; identify a plurality of departments associated with the plurality of documents; select one or more selected departments from the plurality of departments according to confidence scores associated with the plurality of departments; add one or more additional departments to the one or more selected departments if the confidence scores of the one or more selected departments do not meet a threshold condition; and transmit a representation of the plurality of documents in accordance with the one or more selected departments; wherein the executable and operational code are further effective to add the one or more additional departments to the one or more selected departments if the confidence scores of the one or more selected departments do not meet a threshold condition by: receiving a plurality of queries from a plurality of users; grouping the plurality of queries into a plurality of query clusters according to a textual similarity of the plurality of queries to one another based on the textual similarity, a similarity of search, and a co-occurrence within a same browsing session; for each cluster of the plurality of query clusters, identifying at least one associated department having search results for the plurality of queries of the each cluster belonging thereto with a higher click-through rate as compared to other departments having search results for the plurality of queries of the each cluster; identifying a selected query cluster of the plurality of query clusters corresponding to the query based on the textual similarity of the plurality of queries of the each cluster to the query; and adding the at least one associated department of the selected query cluster to the one or more selected departments. 16. The system of claim 9 , wherein the executable and operational code are further effective to cause the one or more processors to transmit the representation of the plurality of documents in accordance with the one or more selected departments by: transmitting data defining an interface presenting those documents of the plurality of documents corresponding to the one or more selected departments and interface elements to invoke display of those documents of the plurality of documents corresponding to a department other than one of the one or more selected departments. | 0.51675 |
7,991,129 | 20 | 21 | 20. The method of claim 17 , wherein the delivery of information by said service includes delivering the selected information in a particular context. | 20. The method of claim 17 , wherein the delivery of information by said service includes delivering the selected information in a particular context. 21. The method of claim 20 , wherein the particular context concerns an urgency of delivering the selected information. | 0.5 |
9,021,379 | 6 | 9 | 6. A non-transitory computer readable storage medium having stored therein instructions executable by one or more processors to cause a computing system to perform functions for determining a word input by a gesture stroke on a virtual keyboard, the functions comprising: receiving data representing the gesture stroke; analyzing the received data to identify a set of dwell points in the gesture stroke; generating a simplified stroke polyline, wherein the simplified stroke polyline comprises vertices corresponding with the set of dwell points; determining an initial-line segment of the simplified stroke polyline, wherein the initial-line segment defines a segment from a landing location of the gesture stroke to a first identified dwell point from the set of dwell points; comparing the simplified stroke polyline with a plurality of predefined polylines each representing a respective word, to determine a closest matching predefined polyline, wherein the comparing comprises (i) adding the initial line-segment to each of the predefined polylines to generate enhanced predefined polylines and (ii) comparing the simplified stroke polyline with the enhanced predefined polylines; and outputting the word represented by the closest matching predefined polyline. | 6. A non-transitory computer readable storage medium having stored therein instructions executable by one or more processors to cause a computing system to perform functions for determining a word input by a gesture stroke on a virtual keyboard, the functions comprising: receiving data representing the gesture stroke; analyzing the received data to identify a set of dwell points in the gesture stroke; generating a simplified stroke polyline, wherein the simplified stroke polyline comprises vertices corresponding with the set of dwell points; determining an initial-line segment of the simplified stroke polyline, wherein the initial-line segment defines a segment from a landing location of the gesture stroke to a first identified dwell point from the set of dwell points; comparing the simplified stroke polyline with a plurality of predefined polylines each representing a respective word, to determine a closest matching predefined polyline, wherein the comparing comprises (i) adding the initial line-segment to each of the predefined polylines to generate enhanced predefined polylines and (ii) comparing the simplified stroke polyline with the enhanced predefined polylines; and outputting the word represented by the closest matching predefined polyline. 9. The non-transitory computer readable storage medium of claim 6 , wherein comparing the simplified stroke polyline with the plurality of predefined polylines to determine the closest matching predefined polyline further comprises: determining a first length of the simplified stroke polyline; for each of the plurality of predefined polylines, determining a corresponding second length; comparing the first length to each of the plurality of second lengths to determine a corresponding length difference; determining corresponding length differences that are greater than a predetermined length difference threshold; and filtering out predefined polylines associated with the determined corresponding length differences that are greater than the predetermined length difference threshold. | 0.59152 |
8,732,758 | 12 | 13 | 12. The method of claim 1 further comprising displaying a program listing corresponding to the recommended program. | 12. The method of claim 1 further comprising displaying a program listing corresponding to the recommended program. 13. The method of claim 12 further comprising displaying the program listing in an overlay over the currently viewed program. | 0.60443 |
7,778,866 | 1 | 5 | 1. A computerized system for developing software programs by conducting competitions using a communications server and a review board subsystem, the system comprising: a communications server for communicating as part of a first competition for a design of a software program a specification for the design of a software program to a first plurality of developers and for receiving from each of a subset of the first plurality of software developers, in response to the communicated specification, respective designs for the software program; a review board subsystem for facilitating a design review process for scoring each of the received designs using an electronic document scorecard and selecting one design from the received designs based at least in part on its score in the design review process; and wherein the communications server is also for communicating the selected design to a second plurality of software developers as part of a second competition for development of the software program designed in the first competition and receiving from each of a subset of the second plurality of software developers, in response to the communicated design, respective software programs; and wherein the review board subsystem is also for facilitating a software review process for scoring each of the received programs using an electronic document scorecard; and selecting one program from the received programs based at least in part on its score in the software review process. | 1. A computerized system for developing software programs by conducting competitions using a communications server and a review board subsystem, the system comprising: a communications server for communicating as part of a first competition for a design of a software program a specification for the design of a software program to a first plurality of developers and for receiving from each of a subset of the first plurality of software developers, in response to the communicated specification, respective designs for the software program; a review board subsystem for facilitating a design review process for scoring each of the received designs using an electronic document scorecard and selecting one design from the received designs based at least in part on its score in the design review process; and wherein the communications server is also for communicating the selected design to a second plurality of software developers as part of a second competition for development of the software program designed in the first competition and receiving from each of a subset of the second plurality of software developers, in response to the communicated design, respective software programs; and wherein the review board subsystem is also for facilitating a software review process for scoring each of the received programs using an electronic document scorecard; and selecting one program from the received programs based at least in part on its score in the software review process. 5. The system of claim 1 wherein the first plurality of developers and second plurality of software developers are geographically distributed. | 0.81016 |
9,666,098 | 1 | 2 | 1. A computer-implemented method comprising: identifying, by a computer, one or more keywords from text of a resource received from a second computer over one or more networks; for each respective keyword parsed from the text, determining, by the computer, a word difficulty score associated with the respective keyword; storing, by the computer, into a keyword store the one or more keywords parsed from the text and each respective word difficulty score; identifying, by the computer, in a set of one or more language skills a particular language skill to exercise based on an ability score in a record of a learner assigned to the particular language skill to exercise; selecting, by the computer, a learning activity of a type of learning activity that exercises the identified language skill in response to identifying the language skill to exercise; generating, by the computer, one or more distractors of one or more types of distractors using the one or more keywords stored in the keyword store, wherein the computer stores into a distractor store configured to store a plurality of distractors at least one distractor of a type of distractor corresponding to the type of learning activity selected to exercise the language skill; selecting, by the computer, from the distractor store a set of one or more distractors, each distractor of the set of the type of distractor corresponding to the type of the learning activity; and generating, by the computer, one or more graphical user interfaces configured to display the selected learning activity at the second computer, wherein the selected learning activity comprises at least one distractor from the selected set of one or more distractors. | 1. A computer-implemented method comprising: identifying, by a computer, one or more keywords from text of a resource received from a second computer over one or more networks; for each respective keyword parsed from the text, determining, by the computer, a word difficulty score associated with the respective keyword; storing, by the computer, into a keyword store the one or more keywords parsed from the text and each respective word difficulty score; identifying, by the computer, in a set of one or more language skills a particular language skill to exercise based on an ability score in a record of a learner assigned to the particular language skill to exercise; selecting, by the computer, a learning activity of a type of learning activity that exercises the identified language skill in response to identifying the language skill to exercise; generating, by the computer, one or more distractors of one or more types of distractors using the one or more keywords stored in the keyword store, wherein the computer stores into a distractor store configured to store a plurality of distractors at least one distractor of a type of distractor corresponding to the type of learning activity selected to exercise the language skill; selecting, by the computer, from the distractor store a set of one or more distractors, each distractor of the set of the type of distractor corresponding to the type of the learning activity; and generating, by the computer, one or more graphical user interfaces configured to display the selected learning activity at the second computer, wherein the selected learning activity comprises at least one distractor from the selected set of one or more distractors. 2. The method according to claim 1 , further comprising receiving, by the computer, one or more inputs associated with the learning activity via the graphical user interface displayed at the second computer. | 0.814183 |
10,133,993 | 1 | 13 | 1. A method comprising: performing operations for reducing computing resources used by an online social network by generating a user interface to structure search results corresponding to a plurality of potential experts in a specific skill and to limit presentation of endorsement data of an expert presented in the search results to an inquirer that is within a threshold degree of connection from the expert the operations comprising: receiving, from a device of the inquirer, a search request for the expert in the specific skill; accessing, from a database in the online social network, profile data of members in the online social network, the profile data including the endorsement data; determining the plurality of potential experts from the members in the online social network based on the profile data; accessing social graph data of the plurality of potential experts, the social graph data including degrees of connections between the inquirer and the plurality of potential experts; calculating, using a processor, a ranking value for each member of the plurality of potential experts based on the accessed profile data and the accessed social graph data; verifying the expert from the plurality of potential experts based on the calculated ranking value for each member of the plurality of potential experts, the calculated ranking value of the expert being higher than a predetermined threshold; and including the profile data for the verified expert in the search results for presentation on a display of the device, based on a determination that a degree of connection between the verified expert and the inquirer is within the threshold degree of connection. | 1. A method comprising: performing operations for reducing computing resources used by an online social network by generating a user interface to structure search results corresponding to a plurality of potential experts in a specific skill and to limit presentation of endorsement data of an expert presented in the search results to an inquirer that is within a threshold degree of connection from the expert the operations comprising: receiving, from a device of the inquirer, a search request for the expert in the specific skill; accessing, from a database in the online social network, profile data of members in the online social network, the profile data including the endorsement data; determining the plurality of potential experts from the members in the online social network based on the profile data; accessing social graph data of the plurality of potential experts, the social graph data including degrees of connections between the inquirer and the plurality of potential experts; calculating, using a processor, a ranking value for each member of the plurality of potential experts based on the accessed profile data and the accessed social graph data; verifying the expert from the plurality of potential experts based on the calculated ranking value for each member of the plurality of potential experts, the calculated ranking value of the expert being higher than a predetermined threshold; and including the profile data for the verified expert in the search results for presentation on a display of the device, based on a determination that a degree of connection between the verified expert and the inquirer is within the threshold degree of connection. 13. The method of claim 1 , wherein the profile data of members is stored in a first database, and the social graph data of the plurality of potential experts is stored in a second database. | 0.734637 |
9,122,540 | 17 | 19 | 17. The computer system of claim 16 , said method further comprising: prior to said generating, parsing, by the one or more processors, each program statement in the first computer program to generate the parsed first computer program. | 17. The computer system of claim 16 , said method further comprising: prior to said generating, parsing, by the one or more processors, each program statement in the first computer program to generate the parsed first computer program. 19. The computer system of claim 17 , wherein said parsing parses the whole first computer program completely without halting said parsing and without throwing any exception even though the first computer program includes the first error, and wherein said translating translates the whole parsed first computer program completely without halting said translating and without throwing any exception even though the parsed first computer program includes the second error. | 0.516461 |
7,707,024 | 14 | 15 | 14. A system for converting a currency value from a source type of currency to a destination type of currency, the system comprising: a recognizer plug-in capable of: receiving a portion of an electronic document as a string of text from an application program, analyzing the string of text to determine whether the string of text includes a currency value, wherein analyzing the string of text to determine whether the string of text includes the currency value comprises utilizing a currency format file to recognize currencies expressions utilizing different decimal and thousands separator symbols, and in response to determining that the string of text includes a currency value, semantically labeling the currency value with schema information identifying the source type of currency, wherein the semantic label is associated with a single currency; an application program for creating and editing the electronic document, the application program capable of displaying the string of text and an indication that the currency value has been semantically labeled, receiving a selection of the currency value, in response to receiving the selection of the currency value, providing a list of actions that may be performed on the currency value to convert the currency value to the destination type of currency, receiving the selection of an action from the list of actions, and providing the selected action and the currency value to an action plug-in; and an action plug-in capable of generating a converted currency value by converting the currency value to the destination type of currency identified by the selected action, and replacing the currency value in the electronic document with the converted currency value. | 14. A system for converting a currency value from a source type of currency to a destination type of currency, the system comprising: a recognizer plug-in capable of: receiving a portion of an electronic document as a string of text from an application program, analyzing the string of text to determine whether the string of text includes a currency value, wherein analyzing the string of text to determine whether the string of text includes the currency value comprises utilizing a currency format file to recognize currencies expressions utilizing different decimal and thousands separator symbols, and in response to determining that the string of text includes a currency value, semantically labeling the currency value with schema information identifying the source type of currency, wherein the semantic label is associated with a single currency; an application program for creating and editing the electronic document, the application program capable of displaying the string of text and an indication that the currency value has been semantically labeled, receiving a selection of the currency value, in response to receiving the selection of the currency value, providing a list of actions that may be performed on the currency value to convert the currency value to the destination type of currency, receiving the selection of an action from the list of actions, and providing the selected action and the currency value to an action plug-in; and an action plug-in capable of generating a converted currency value by converting the currency value to the destination type of currency identified by the selected action, and replacing the currency value in the electronic document with the converted currency value. 15. The system of claim 14 , wherein the list of actions comprises a dropdown menu having one or more menu items corresponding to the list of actions that may be performed on the currency value to convert the currency value to the destination type of currency, and wherein the action plug-in is further operative to: determine a current user interface language setting for the application program; and to generate the menu items of the dropdown menu in a language specified by the current user interface language setting. | 0.5 |
8,010,343 | 1 | 5 | 1. A method for generating grammars for use in an interactive application, the method comprising: providing data records to be used in a grammar database, each data record including one or more fields; prior to identifying, in response to a user-issued query, a set of the data records that satisfy the query and on which disambiguation is to be performed, receiving human input specifying on which of the fields of each of the data records homonym and/or synonym disambiguation is to be performed; applying a disambiguation engine to each data record to generate disambiguated data, wherein the disambiguation engine resolves ambiguities relating to at least one homophone and/or at least one synonym in the data in the specified fields; and based on the disambiguated data, generating one or more grammar files for use in the interactive application. | 1. A method for generating grammars for use in an interactive application, the method comprising: providing data records to be used in a grammar database, each data record including one or more fields; prior to identifying, in response to a user-issued query, a set of the data records that satisfy the query and on which disambiguation is to be performed, receiving human input specifying on which of the fields of each of the data records homonym and/or synonym disambiguation is to be performed; applying a disambiguation engine to each data record to generate disambiguated data, wherein the disambiguation engine resolves ambiguities relating to at least one homophone and/or at least one synonym in the data in the specified fields; and based on the disambiguated data, generating one or more grammar files for use in the interactive application. 5. The method of claim 1 , further comprising calculating grammar generation statistics in order to optimize future grammar file generation. | 0.666667 |
9,047,873 | 1 | 8 | 1. A communication apparatus comprising: a microphone to receive sound when a user speaks and to convert the received sound into a voice signal; a voice activity detection processor to detect spoken words and informative sounds within the voice signal; a voice-to-text processor programmed to convert the spoken words and the informative sounds of the voice signal into a text message, wherein the text message includes text identifying the user as originator of the voice signal; a transmitter configured to transmit the voice signal, the text message, or both the voice signal and text message to other users; a receiver configured to receive one or more voice signals, text messages, or voice signals and text messages from one or more users via a communication network; a protective facemask; and a display device to display, adjacent or integral to the protective facemask, the one or more text messages from the one or more users. | 1. A communication apparatus comprising: a microphone to receive sound when a user speaks and to convert the received sound into a voice signal; a voice activity detection processor to detect spoken words and informative sounds within the voice signal; a voice-to-text processor programmed to convert the spoken words and the informative sounds of the voice signal into a text message, wherein the text message includes text identifying the user as originator of the voice signal; a transmitter configured to transmit the voice signal, the text message, or both the voice signal and text message to other users; a receiver configured to receive one or more voice signals, text messages, or voice signals and text messages from one or more users via a communication network; a protective facemask; and a display device to display, adjacent or integral to the protective facemask, the one or more text messages from the one or more users. 8. The communication apparatus of claim 1 , wherein the transmitter comprises: a power supply to provide power to the transmitter; an electronic oscillator to generate a carrier wave for transmitting the text message; a modulator to modulate a signal characterizing the text message on the carrier wave; a power amplifier to vary an amplitude of the signal that is modulated on the carrier wave; and an impedance matching circuit to match impedances of antennas of the transmitter and the receiver. | 0.693727 |
8,200,485 | 24 | 28 | 24. A system for conducting searches by voice, comprising: a database of items; a query server which searches the database of items according to voice queries from users, the query server coupled to a voice recognition system which interprets the voice queries according to grammars; a first code module which causes a user to be prompted to enter a set of characters of a query such that the user may partially specify the query; and a second code module which causes the user to be prompted to utter the query; wherein the query server is programmed to use the set of characters to select a grammar for use by the voice recognition system to interpret the query as uttered by the user. | 24. A system for conducting searches by voice, comprising: a database of items; a query server which searches the database of items according to voice queries from users, the query server coupled to a voice recognition system which interprets the voice queries according to grammars; a first code module which causes a user to be prompted to enter a set of characters of a query such that the user may partially specify the query; and a second code module which causes the user to be prompted to utter the query; wherein the query server is programmed to use the set of characters to select a grammar for use by the voice recognition system to interpret the query as uttered by the user. 28. The system as defined in claim 24 , wherein the query server is programmed to select the grammar from memory using the set of characters. | 0.734962 |
7,519,822 | 1 | 4 | 1. A method of processing information representing a graph, comprising: serializing each of multiple statements; using a digital processor to independently compute a hash value for each of the multiple statements; and applying a commutative function to each hash value, to obtain an aggregate hash value representing all of the multiple statements. | 1. A method of processing information representing a graph, comprising: serializing each of multiple statements; using a digital processor to independently compute a hash value for each of the multiple statements; and applying a commutative function to each hash value, to obtain an aggregate hash value representing all of the multiple statements. 4. A method according to claim 1 , further comprising adding a new statement to the multiple statements by: identifying a blank node; assigning a label to the identified blank node; and creating the additional statement in a manner that sets forth association of the blank node with the label. | 0.67226 |
8,014,997 | 9 | 10 | 9. The computer program of claim 8 , the method further comprising ranking the results of searches using the enhanced queries to place keyword query terms in order of most used keyword terms to reduce table lookup time. | 9. The computer program of claim 8 , the method further comprising ranking the results of searches using the enhanced queries to place keyword query terms in order of most used keyword terms to reduce table lookup time. 10. The computer system program of claim 9 , identifying domain specific keyword terms in a given query, using domain specific glossary; finding synonyms and related terms for the identified keyword terms, using domain specific thesaurus; finding other statistically close keyword terms; and identifying relevant domain specific categories for that identified keyword terms, using domain specific ontology. | 0.5 |
8,484,377 | 1 | 3 | 1. A method for prepending nonce labels to DNS queries, the method comprising: evaluating, with a processor, whether a log stored in memory contains at least one past entry of a domain name resolution query to a name server for a full domain name that resulted in a positive reply indicating that the full domain name did exist; the processor determining whether the log contains at least one recent entry of the domain name resolution query to the name server for the full domain name that resulted in a negative reply indicating that the full domain name did not exist, if it is determined that the log contains the at least one past entry of the domain name resolution query; the processor determining whether querying the name server with a nonce-less query for the full domain name currently results in the positive reply indicating that the full domain name exists, if it is determined that the log contains the at least one recent entry of the domain name resolution query; the processor determining whether querying the name server with a nonce label prepended query for the full domain name currently results in the positive reply indicating that the full domain name exists, if it is determined that querying the name server with the nonce-less query for the full domain name currently results in the positive reply indicating that the full domain name exists; and the processor flagging the full domain name as inappropriate for nonce label prepending, if it is determined that querying the name server with a nonce label prepended query for the full domain name currently results in the negative reply indicating that the full domain name does not exist. | 1. A method for prepending nonce labels to DNS queries, the method comprising: evaluating, with a processor, whether a log stored in memory contains at least one past entry of a domain name resolution query to a name server for a full domain name that resulted in a positive reply indicating that the full domain name did exist; the processor determining whether the log contains at least one recent entry of the domain name resolution query to the name server for the full domain name that resulted in a negative reply indicating that the full domain name did not exist, if it is determined that the log contains the at least one past entry of the domain name resolution query; the processor determining whether querying the name server with a nonce-less query for the full domain name currently results in the positive reply indicating that the full domain name exists, if it is determined that the log contains the at least one recent entry of the domain name resolution query; the processor determining whether querying the name server with a nonce label prepended query for the full domain name currently results in the positive reply indicating that the full domain name exists, if it is determined that querying the name server with the nonce-less query for the full domain name currently results in the positive reply indicating that the full domain name exists; and the processor flagging the full domain name as inappropriate for nonce label prepending, if it is determined that querying the name server with a nonce label prepended query for the full domain name currently results in the negative reply indicating that the full domain name does not exist. 3. The method of claim 1 , wherein the nonce-less query is allocated to a separate group, if it is determined that querying the name server with the nonce-less query for the full domain name currently results in the reply indicating that the full domain name exists. | 0.5 |
8,055,607 | 19 | 20 | 19. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for problem determination, the method comprising: providing a database accessible by a computer device; providing to said database data representing events and problems patterns received from a computing system resource, said problem determining comprising associating a potential source of problems with received events; configuring received events and potential problems associated with these events as entries into a representative event-problem (EP) matrix; providing a storage device having dictionary entries comprising a weighting factor associated with one or more terms in said EP matrix and representative of the relative importance of said one or more terms; applying a weighting factor to said one or more terms in said EP matrix; and, utilizing a Singular Value Decomposition (SVD) technique on said EP matrix having said weighted terms to construct an event-problem data structure representing an event-problem vector space comprising associative patterns and correlations in the event-problem data structure, wherein the use of weighted terms in said SVD technique enables an accelerated and accurate convergence to a set of specific associated problems for accurate and rapid problem determination. | 19. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for problem determination, the method comprising: providing a database accessible by a computer device; providing to said database data representing events and problems patterns received from a computing system resource, said problem determining comprising associating a potential source of problems with received events; configuring received events and potential problems associated with these events as entries into a representative event-problem (EP) matrix; providing a storage device having dictionary entries comprising a weighting factor associated with one or more terms in said EP matrix and representative of the relative importance of said one or more terms; applying a weighting factor to said one or more terms in said EP matrix; and, utilizing a Singular Value Decomposition (SVD) technique on said EP matrix having said weighted terms to construct an event-problem data structure representing an event-problem vector space comprising associative patterns and correlations in the event-problem data structure, wherein the use of weighted terms in said SVD technique enables an accelerated and accurate convergence to a set of specific associated problems for accurate and rapid problem determination. 20. The program storage device readable by a machine as claimed in claim 19 , further comprising: updating one or more current weighting factor entries to maximize correlation among the events and problems. | 0.5 |
8,225,408 | 16 | 17 | 16. The system of claim 9 wherein the parser rules and analyzer rules include actions to be performed when rules are matched. | 16. The system of claim 9 wherein the parser rules and analyzer rules include actions to be performed when rules are matched. 17. The system of claim 16 further comprising a scripting engine stored on the medium and executed by the computer, operatively coupled to said parser and said analyzer, for implementing the actions to be performed. | 0.5 |
9,471,570 | 15 | 16 | 15. The system of claim 14 , further comprising a user information analyzer configured for obtaining user information associated with the user, the user behavior analyzer further configured for sending a request for updating a search record associated with the user based on the user information, wherein the search record includes one or more stored query suggestions previously selected by the user, and the search record is to be updated to include the more than one query suggestion based on the selection from the user. | 15. The system of claim 14 , further comprising a user information analyzer configured for obtaining user information associated with the user, the user behavior analyzer further configured for sending a request for updating a search record associated with the user based on the user information, wherein the search record includes one or more stored query suggestions previously selected by the user, and the search record is to be updated to include the more than one query suggestion based on the selection from the user. 16. The system of claim 15 , further comprising a search record retriever configured for: obtaining a retrieved query suggestion that is retrieved from the search record; and providing the retrieved query suggestion to the user, wherein the retrieved query suggestion is to be presented together with the first search result to the user. | 0.5 |
8,560,005 | 8 | 10 | 8. The mobile communication terminal of claim 1 , wherein the controller controls, in response to a request for state information input through an input unit, output of an audible signal corresponding to current state information of the mobile communication terminal using a preset speech data. | 8. The mobile communication terminal of claim 1 , wherein the controller controls, in response to a request for state information input through an input unit, output of an audible signal corresponding to current state information of the mobile communication terminal using a preset speech data. 10. The mobile communication terminal of claim 8 , wherein the controller periodically checks preset state report times, and, at each state report time, controls output of an audible signal corresponding to the current state information of the mobile communication terminal using the preset speech data. | 0.5 |
8,806,304 | 1 | 2 | 1. A system comprising: one or more devices to: receive a word, of a block of words within traffic, on which to perform forward error correction, each word of the block of words including respective encoded bits and respective sets of reliability bits for identifying a respective level of reliability of each one of the respective encoded bits, identify, within the word, least reliable positions that correspond to a subset of encoded bits associated with one or more lowest levels of reliability; generate a set of candidate words based on different combinations in which the subset of encoded bits can be inverted; determine a first quantity of errors associated with a first candidate word of the set of candidate words and a second quantity of errors associated with a second candidate word of the set of candidate words, determine whether the first quantity of errors or the second quantity of errors corresponds to an odd value, invert a parity bit, associated with the second candidate word, when the second quantity of errors corresponds to the odd value, determine, based on inverting the parity bit, whether a first bit or a second bit is inverted, the first bit being most reliable among the subset of encoded bits within the first candidate word, and the second bit being most reliable among the subset of encoded bits within the second candidate word, select the first candidate word when the second bit is inverted, and perform forward error correction on the word, using the first candidate word, based on the selection of the first candidate word. | 1. A system comprising: one or more devices to: receive a word, of a block of words within traffic, on which to perform forward error correction, each word of the block of words including respective encoded bits and respective sets of reliability bits for identifying a respective level of reliability of each one of the respective encoded bits, identify, within the word, least reliable positions that correspond to a subset of encoded bits associated with one or more lowest levels of reliability; generate a set of candidate words based on different combinations in which the subset of encoded bits can be inverted; determine a first quantity of errors associated with a first candidate word of the set of candidate words and a second quantity of errors associated with a second candidate word of the set of candidate words, determine whether the first quantity of errors or the second quantity of errors corresponds to an odd value, invert a parity bit, associated with the second candidate word, when the second quantity of errors corresponds to the odd value, determine, based on inverting the parity bit, whether a first bit or a second bit is inverted, the first bit being most reliable among the subset of encoded bits within the first candidate word, and the second bit being most reliable among the subset of encoded bits within the second candidate word, select the first candidate word when the second bit is inverted, and perform forward error correction on the word, using the first candidate word, based on the selection of the first candidate word. 2. The system of claim 1 , where, when determining the first quantity of errors and the second quantity of errors, the one or more devices are further to: decode the first candidate word to identify the first quantity of errors associated with the first candidate word, and decode the second candidate word to identify the second quantity of errors associated with the second candidate word. | 0.8122 |
8,413,055 | 1 | 5 | 1. A computing system configured to facilitate enhanced instant messaging, the computing system comprising a processor and a memory, wherein the computing system includes a messaging module and a widget player module that, when executed by the processor, are configured to facilitate: creation of text for an instant message; selection of at least one widget from a plurality of customizable widgets; personalization of the at least one widget selected; embedding of the at least one widget within the instant message; rendering, by the processor in the computing system, the instant message containing the embedded at least one widget, the at least one widget being minimized and represented as a first icon using a minimized mode of the widget player module, the first icon displaying real-time retrieved and rendered information; and sending, by the processor in the computing system, the instant message to a remote computer, the remote computer comprising a widget adapter that enables a full view of the minimized at least one widget represented as the first icon in the instant message, the full view comprising additional information not shown in the first icon, the additional information comprising a reply request from the remote computer and an option for sending the reply to the computing system, wherein the reply is within a customized widget embedded in a return instant message, wherein the customized widget is represented as a second icon in the return instant message, the return instant message comprising text in response to the instant message, the first icon and the second icon, the second icon displaying the reply. | 1. A computing system configured to facilitate enhanced instant messaging, the computing system comprising a processor and a memory, wherein the computing system includes a messaging module and a widget player module that, when executed by the processor, are configured to facilitate: creation of text for an instant message; selection of at least one widget from a plurality of customizable widgets; personalization of the at least one widget selected; embedding of the at least one widget within the instant message; rendering, by the processor in the computing system, the instant message containing the embedded at least one widget, the at least one widget being minimized and represented as a first icon using a minimized mode of the widget player module, the first icon displaying real-time retrieved and rendered information; and sending, by the processor in the computing system, the instant message to a remote computer, the remote computer comprising a widget adapter that enables a full view of the minimized at least one widget represented as the first icon in the instant message, the full view comprising additional information not shown in the first icon, the additional information comprising a reply request from the remote computer and an option for sending the reply to the computing system, wherein the reply is within a customized widget embedded in a return instant message, wherein the customized widget is represented as a second icon in the return instant message, the return instant message comprising text in response to the instant message, the first icon and the second icon, the second icon displaying the reply. 5. The messaging module of claim 1 wherein at least one widget selected from a plurality of customizable widgets is stored in a widget container. | 0.888117 |
7,904,424 | 7 | 8 | 7. The method according to claim 1 , wherein the event is editing document data as a target. | 7. The method according to claim 1 , wherein the event is editing document data as a target. 8. The method according to claim 7 , further comprising updating, depending on editing details of document data, each piece of document data that is younger or older in a direct line from the document data. | 0.716253 |
8,027,945 | 20 | 26 | 20. A computer system, comprising: means for representing at least one user goal with respect to a domain; means for representing at least one task for a software component, which task can be accomplished in the domain independent of stated user goals; means for establishing an association between at least one linguistic or pragmatic item and the user goal, the at least one linguistic or pragmatic item having an association with the at least one task; means for inferring, using the associations, that the software component is appropriate for achieving the at least one user goal, using the associations; and means for distributing the representation of the user goal, the representation of the task, the associations, an inference, or a performance of the task through execution of the software component among processing resources of the computer system. | 20. A computer system, comprising: means for representing at least one user goal with respect to a domain; means for representing at least one task for a software component, which task can be accomplished in the domain independent of stated user goals; means for establishing an association between at least one linguistic or pragmatic item and the user goal, the at least one linguistic or pragmatic item having an association with the at least one task; means for inferring, using the associations, that the software component is appropriate for achieving the at least one user goal, using the associations; and means for distributing the representation of the user goal, the representation of the task, the associations, an inference, or a performance of the task through execution of the software component among processing resources of the computer system. 26. The system of claim 20 , further comprising means for modeling domains by combining models which represent sub-domains, wherein the linguistic or pragmatic items and the tasks associated with the domains are composed by collecting items and tasks from corresponding sub-domains. | 0.811497 |
8,364,694 | 5 | 10 | 5. A method for searching for digital media information available from an online media store, said method comprising: receiving a search hints request from a client application operating on a client device, the search hints request including at least a character string including at least one character; determining a set of search hints based on the character string, wherein said determining of the set of search hints obtains the matching search hints from a hints data structure and wherein the set of search hints correspond to digital media assets available in an online media repository and at least sales popularity data; obtaining a location of the client device; eliminating from the set of search hints those of the search hints in the set of search hints that are associated with a location other than the location of the client device; obtaining a media popularity indication for each of a plurality of the search hints in the set of search hints; and sending a portion of the search hints in the set of search hints to the client application on the client device, the portion of the search hints sent to the client application being less than all the search hints in the set of search hints. | 5. A method for searching for digital media information available from an online media store, said method comprising: receiving a search hints request from a client application operating on a client device, the search hints request including at least a character string including at least one character; determining a set of search hints based on the character string, wherein said determining of the set of search hints obtains the matching search hints from a hints data structure and wherein the set of search hints correspond to digital media assets available in an online media repository and at least sales popularity data; obtaining a location of the client device; eliminating from the set of search hints those of the search hints in the set of search hints that are associated with a location other than the location of the client device; obtaining a media popularity indication for each of a plurality of the search hints in the set of search hints; and sending a portion of the search hints in the set of search hints to the client application on the client device, the portion of the search hints sent to the client application being less than all the search hints in the set of search hints. 10. The method of claim 5 , wherein said method further comprises: prior to said sending, ordering the search hints in the set of search hints based on the media popularity indications. | 0.878289 |
9,972,306 | 4 | 6 | 4. The method of claim 1 , wherein step (b) further comprises: obtaining a total likelihood score α r for each of the plurality of speech audio files. | 4. The method of claim 1 , wherein step (b) further comprises: obtaining a total likelihood score α r for each of the plurality of speech audio files. 6. The method of claim 4 , further comprising using the mathematical equation β r = α r f r to determine the average frame likelihood score of an audio file, wherein β r is the average frame likelihood score, α r is a total likelihood score of the audio file, and f r is a number of feature frames of the audio file. | 0.536657 |
8,666,040 | 17 | 18 | 17. A computer usable storage device having stored therein a computer usable program code for analyzing speech application performance, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform: determining a call path for each of a plurality of calls from a log of an interactive voice response system comprising a speech application, wherein each call path is defined by an ordered set of dialog nodes of the speech application; determining a number of occurrences of at least one selected type of event for the dialog nodes of the plurality of call paths; and indicating at least one call path from the plurality of call paths according, at least in part, to the number of occurrences of the selected type of event within the at least one indicated call path, wherein the computer usable storage device is not a transitory, propagating signal per se. | 17. A computer usable storage device having stored therein a computer usable program code for analyzing speech application performance, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform: determining a call path for each of a plurality of calls from a log of an interactive voice response system comprising a speech application, wherein each call path is defined by an ordered set of dialog nodes of the speech application; determining a number of occurrences of at least one selected type of event for the dialog nodes of the plurality of call paths; and indicating at least one call path from the plurality of call paths according, at least in part, to the number of occurrences of the selected type of event within the at least one indicated call path, wherein the computer usable storage device is not a transitory, propagating signal per se. 18. The computer usable storage device of claim 17 , wherein the indicating includes selecting at least one call path from the plurality of call paths according to a number of occurrences of the at least one type of event for a particular dialog node. | 0.5 |
9,785,855 | 16 | 20 | 16. The non-transitory computer-readable of claim 15 wherein said neural network comprises a CNN (Convolutional Neural Network). | 16. The non-transitory computer-readable of claim 15 wherein said neural network comprises a CNN (Convolutional Neural Network). 20. The non-transitory computer-readable of claim 16 wherein said code further includes code to adapt said neural network to perform tasks increasingly similar to license plate recognition in a target set as a part of training said neural network and wherein said iteratively learn and adapt said neural network further comprises iteratively learning and adapting said neural network by fine tuning said neural network wherein said fine tuning said neural network comprises utilizing a cascade of coarse-to-fine adaptations so as to iteratively learn and adapt said neural network, wherein said coarse-to-fine manner includes said cascade of coarse-to-fine adaptations and wherein said fine tuning further includes utilizing all available samples from a target domain even if said all available samples are derived from different scenarios, and wherein said neural network is subsequently fine-tuned again with respect to only a target subdomain that is desired to be recognized. | 0.5 |
8,626,911 | 6 | 7 | 6. The method of claim 1 , wherein the estimated probability that the advertisements are of interest to the user is determined according to information regarding the user. | 6. The method of claim 1 , wherein the estimated probability that the advertisements are of interest to the user is determined according to information regarding the user. 7. The method of claim 6 , wherein the information regarding the user is maintained remotely from the computer running the browser. | 0.5 |
8,713,015 | 13 | 17 | 13. The method of claim 11 , further comprising inserting the one or more standard group operators into the referencing computer program at one of a compile time or a run time. | 13. The method of claim 11 , further comprising inserting the one or more standard group operators into the referencing computer program at one of a compile time or a run time. 17. The method of claim 13 , further comprising: passing intermediate results to an accumulation function in memory to provide a desired result and avoid group construction. | 0.5 |
8,924,898 | 11 | 20 | 11. A method of designing instruction extensions to supplement an existing processor instruction set architecture (ISA), the method comprising: receiving an instruction extension description for a new instruction from a user to supplement the existing processor ISA, the received instruction extension description excluding a description for the existing instruction set of the existing processor; and modifying, by a processor build software, a plurality of existing software tools to support the new instruction based on the received instruction extension description—, wherein the code for modifying includes code for modifying an existing assembler, wherein the existing assembler encoding and decoding is grouped in a separate software library which is generated automatically using information in the ISA description. | 11. A method of designing instruction extensions to supplement an existing processor instruction set architecture (ISA), the method comprising: receiving an instruction extension description for a new instruction from a user to supplement the existing processor ISA, the received instruction extension description excluding a description for the existing instruction set of the existing processor; and modifying, by a processor build software, a plurality of existing software tools to support the new instruction based on the received instruction extension description—, wherein the code for modifying includes code for modifying an existing assembler, wherein the existing assembler encoding and decoding is grouped in a separate software library which is generated automatically using information in the ISA description. 20. The method of claim 11 , wherein the step of modifying includes modifying an existing debugger. | 0.75495 |
6,094,506 | 17 | 23 | 17. A method in a computer system for generating a probability table for use in identifying patterns, the method comprising: receiving a plurality of sample patterns; determining for each sample pattern an associated set of characteristics based on that sample pattern; for each possible pair of sample patterns, comparing the pair of sample patterns to generate a set of comparison values based on the characteristics associated with the pair of sample patterns; and for each possible comparison value, generating a total count of the comparison value in the generated sets of comparison values; generating a match count of the comparison value in the sets of comparison values that are generated from pairs of matching sample patterns; calculating a probability value based on the generated match count and the generated total count; and storing the calculated probability value in the probability table so that the stored probability value can be retrieved using the comparison value, so that the stored probability values can be used to recognize handwritten characters. | 17. A method in a computer system for generating a probability table for use in identifying patterns, the method comprising: receiving a plurality of sample patterns; determining for each sample pattern an associated set of characteristics based on that sample pattern; for each possible pair of sample patterns, comparing the pair of sample patterns to generate a set of comparison values based on the characteristics associated with the pair of sample patterns; and for each possible comparison value, generating a total count of the comparison value in the generated sets of comparison values; generating a match count of the comparison value in the sets of comparison values that are generated from pairs of matching sample patterns; calculating a probability value based on the generated match count and the generated total count; and storing the calculated probability value in the probability table so that the stored probability value can be retrieved using the comparison value, so that the stored probability values can be used to recognize handwritten characters. 23. The method of claim 17 wherein a characteristic of a sample pattern represents a pair of coordinates describing a starting point and an ending point of a stroke of the sample pattern. | 0.5 |
9,386,139 | 17 | 19 | 17. A method of claim 16 , further comprising: causing, at least in part, a suggestion of one of the descriptors on the user equipment via monitoring one or more user actions and matching one or more of the monitored user actions against one or more user actions predetermined as associated with one or more of the descriptors, prior to the user selecting the one of the descriptors, wherein the options include accessing services, applications, or content available to the user equipment. | 17. A method of claim 16 , further comprising: causing, at least in part, a suggestion of one of the descriptors on the user equipment via monitoring one or more user actions and matching one or more of the monitored user actions against one or more user actions predetermined as associated with one or more of the descriptors, prior to the user selecting the one of the descriptors, wherein the options include accessing services, applications, or content available to the user equipment. 19. A method of claim 17 , wherein the services, applications, content, or a combination thereof include games, media content, personal information management applications, messaging applications, social networking applications, location-aware applications, or a combination thereof, and wherein the services, applications, content, or a combination thereof include presentation of visual media content in addition to the descriptors and the options. | 0.5 |
7,840,442 | 1 | 2 | 1. A method comprising: gathering, by at least one processor, click information associated with a member of a search result set having a plurality of members, the search result set produced in response to a search; determining, by the at least one processor, relative responsiveness of the member, compared with the other members of the search result set, based on the click information and on a position of the member in an ordering for display of the search result set; generating, by the at least one processor, a score for association with the member that reflects the relative responsiveness of the member to the search; and using, by the at least one processor, the score to affect a response to a subsequent search. | 1. A method comprising: gathering, by at least one processor, click information associated with a member of a search result set having a plurality of members, the search result set produced in response to a search; determining, by the at least one processor, relative responsiveness of the member, compared with the other members of the search result set, based on the click information and on a position of the member in an ordering for display of the search result set; generating, by the at least one processor, a score for association with the member that reflects the relative responsiveness of the member to the search; and using, by the at least one processor, the score to affect a response to a subsequent search. 2. The method of claim 1 , wherein said score is applied, by the at least one processor, to affect placement of said member within the ordering of said search result set. | 0.706897 |
9,373,323 | 8 | 9 | 8. A system comprising: a processor configured to perform speech recognition; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: at a turn in a dialog between a user and a spoken dialog system: nominating a set of dialog actions and a set of contextual features, wherein the processor uses a partially observable Markov decision process in parallel with a conventional dialog state to perform the nominating; and generating an audible response in the dialog based on the set of contextual features, via a machine learning algorithm, from the set of dialog actions. | 8. A system comprising: a processor configured to perform speech recognition; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: at a turn in a dialog between a user and a spoken dialog system: nominating a set of dialog actions and a set of contextual features, wherein the processor uses a partially observable Markov decision process in parallel with a conventional dialog state to perform the nominating; and generating an audible response in the dialog based on the set of contextual features, via a machine learning algorithm, from the set of dialog actions. 9. The system of claim 8 , the computer-readable storage medium having additional instructions stored which, when executed by the processor, cause the processor to perform operations comprising augmenting the machine learning algorithm using reinforcement learning. | 0.640921 |
8,788,270 | 33 | 35 | 33. The method according to claim 32 , further comprising reducing the n−1 dimensions to p dimensions, where p<n−1. | 33. The method according to claim 32 , further comprising reducing the n−1 dimensions to p dimensions, where p<n−1. 35. The method according to claim 33 , wherein a pattern recognition algorithm is used to reduce the n−1 dimensions to p dimensions. | 0.5 |
7,849,144 | 10 | 12 | 10. The system of claim 9 , wherein the presence resource is configured for detecting a presence of each of the sending party and the destination party for transfer of instant messages in response to a corresponding registration with the presence resource, the presence resource configured for determining the language preference for the destination party in response to detecting the corresponding presence. | 10. The system of claim 9 , wherein the presence resource is configured for detecting a presence of each of the sending party and the destination party for transfer of instant messages in response to a corresponding registration with the presence resource, the presence resource configured for determining the language preference for the destination party in response to detecting the corresponding presence. 12. The system of claim 10 , wherein the messaging resource is configured for receiving a Session Initiation Protocol (SIP) message that includes the instant message. | 0.677043 |
7,685,119 | 1 | 9 | 1. A method for augmenting a user query, comprising: receiving the user query; obtaining a first popularity ranking associated with the user query, where the user query comprises a geographic component; associating the geographic component of the user query with a first geographic locality; identifying a plurality of neighboring geographic localities comprising geographic localities in proximity to the first geographic locality, where one of the plurality of neighboring localities is a first neighboring geographic localities identified based on the first popularity ranking; ranking, using a processor, the plurality of neighboring localities based on the first popularity ranking, where ranking the plurality of neighboring geographic localities comprises weighting each geographic locality of the plurality of neighboring geographic localities based on the first popularity ranking; generating, using the processor, an augmented query by augmenting the user query based on the first popularity ranking, the first neighboring geographic locality identified based on the first popularity ranking, and the ranking of the plurality of neighboring geographic localities, where the augmenting of the user query comprises expanding the user query to include the weighted geographic localities of the plurality of neighboring geographic localities; and providing the augmented query to a search engine. | 1. A method for augmenting a user query, comprising: receiving the user query; obtaining a first popularity ranking associated with the user query, where the user query comprises a geographic component; associating the geographic component of the user query with a first geographic locality; identifying a plurality of neighboring geographic localities comprising geographic localities in proximity to the first geographic locality, where one of the plurality of neighboring localities is a first neighboring geographic localities identified based on the first popularity ranking; ranking, using a processor, the plurality of neighboring localities based on the first popularity ranking, where ranking the plurality of neighboring geographic localities comprises weighting each geographic locality of the plurality of neighboring geographic localities based on the first popularity ranking; generating, using the processor, an augmented query by augmenting the user query based on the first popularity ranking, the first neighboring geographic locality identified based on the first popularity ranking, and the ranking of the plurality of neighboring geographic localities, where the augmenting of the user query comprises expanding the user query to include the weighted geographic localities of the plurality of neighboring geographic localities; and providing the augmented query to a search engine. 9. The method of claim 1 , further comprising: monitoring user behavior; and augmenting the first popularity ranking based on the user behavior. | 0.803815 |
7,757,204 | 21 | 22 | 21. A system comprising: one or more computers; and a computer program, the computer program, when executed, performing the following steps: selecting, on at least one computer, a plurality of patterns in a visual modeling environment and establishing connections between the plurality of patterns to create a design time graphical representation of one or more user interfaces of an end-user application, wherein each pattern performs one or more user interface tasks and different patterns performing different user interface tasks have different graphical representations, and wherein at least a first pattern of the plurality of patterns has a visual representation in the end-user application and at least a second pattern of the plurality of patterns does not have a visual representation in the end-user application, and wherein the plurality of patterns in the visual modeling environment further comprise syntax rules governing how the patterns can be composed and semantic rules governing how the patterns will be interpreted to generate the runtime version of the end-user application; configuring the plurality of patterns to specify application specific properties of each pattern to produce configuration data, the configuration data defining the behavior of the one or more user interfaces in the end-user application, wherein configuring the second pattern not having a visual representation in the end-user application comprises specifying a back-end system and data to be used by the second pattern; storing the configuration data in a repository; receiving user input defining an extension to at least one pattern, wherein a first pattern in the plurality of patterns has a property that indicates whether or not the first pattern is extendable, and querying the first pattern to determine whether the first pattern is extendable; and generating a runtime version of the end-user application using the configuration data. | 21. A system comprising: one or more computers; and a computer program, the computer program, when executed, performing the following steps: selecting, on at least one computer, a plurality of patterns in a visual modeling environment and establishing connections between the plurality of patterns to create a design time graphical representation of one or more user interfaces of an end-user application, wherein each pattern performs one or more user interface tasks and different patterns performing different user interface tasks have different graphical representations, and wherein at least a first pattern of the plurality of patterns has a visual representation in the end-user application and at least a second pattern of the plurality of patterns does not have a visual representation in the end-user application, and wherein the plurality of patterns in the visual modeling environment further comprise syntax rules governing how the patterns can be composed and semantic rules governing how the patterns will be interpreted to generate the runtime version of the end-user application; configuring the plurality of patterns to specify application specific properties of each pattern to produce configuration data, the configuration data defining the behavior of the one or more user interfaces in the end-user application, wherein configuring the second pattern not having a visual representation in the end-user application comprises specifying a back-end system and data to be used by the second pattern; storing the configuration data in a repository; receiving user input defining an extension to at least one pattern, wherein a first pattern in the plurality of patterns has a property that indicates whether or not the first pattern is extendable, and querying the first pattern to determine whether the first pattern is extendable; and generating a runtime version of the end-user application using the configuration data. 22. The system of claim 21 wherein the configuration data specifies a particular service to use to access data from the back-end system to be used by the second pattern. | 0.704545 |
8,504,489 | 22 | 23 | 22. The computer program product of claim 19 , wherein the second set of codes is further configured to cause the computer to perform probability analysis to determine the one or more second documents associated with the case are similar to or the same as the first document. | 22. The computer program product of claim 19 , wherein the second set of codes is further configured to cause the computer to perform probability analysis to determine the one or more second documents associated with the case are similar to or the same as the first document. 23. The computer program product of claim 22 , wherein the second set of codes is further configured to cause the computer to perform at least one of clustering technique analysis, machine learning or Bayesian technique analysis to determine that the one or more second documents associated with the case are at least similar to or same as the first document. | 0.5 |
7,788,652 | 17 | 18 | 17. A computer-readable medium storing a software program thereon, the program comprising computer executable instructions for implementing a method for representing type information for a typed intermediate language using a class hierarchy for representing different type classifications, the method comprising: defining a programming class of the class hierarchy as ‘PrimType’, wherein the programming class represents primitive type information for the typed intermediate language; associating a size with instances of the ‘PrimType’ class, wherein the size is settable to represent an actual size of instances of the ‘PrimType’ class, settable to represent a symbolic size of instances of the ‘PrimType’ class, and settable to represent an unknown size of instances of the ‘PrimType’ class, and wherein the actual size and the symbolic size are defined as a number of bits; and associating a kind of type with instances of the ‘PrimType’ class; wherein the class ‘PrimType’ represents a plurality of types comprising at least an unknown type, wherein the unknown type can represent any type, wherein the unknown type represents a lack of all type information, wherein a compiler drops type information during compilation by changing a known type to the unknown type, in the typed intermediate language, during a stage of lowering, wherein the unknown type is set independently of the size, and wherein the ‘PrimType’ class supports an unknown type with an unknown size. | 17. A computer-readable medium storing a software program thereon, the program comprising computer executable instructions for implementing a method for representing type information for a typed intermediate language using a class hierarchy for representing different type classifications, the method comprising: defining a programming class of the class hierarchy as ‘PrimType’, wherein the programming class represents primitive type information for the typed intermediate language; associating a size with instances of the ‘PrimType’ class, wherein the size is settable to represent an actual size of instances of the ‘PrimType’ class, settable to represent a symbolic size of instances of the ‘PrimType’ class, and settable to represent an unknown size of instances of the ‘PrimType’ class, and wherein the actual size and the symbolic size are defined as a number of bits; and associating a kind of type with instances of the ‘PrimType’ class; wherein the class ‘PrimType’ represents a plurality of types comprising at least an unknown type, wherein the unknown type can represent any type, wherein the unknown type represents a lack of all type information, wherein a compiler drops type information during compilation by changing a known type to the unknown type, in the typed intermediate language, during a stage of lowering, wherein the unknown type is set independently of the size, and wherein the ‘PrimType’ class supports an unknown type with an unknown size. 18. The computer-readable medium of claim 17 wherein the size represents a size of a machine representation of a value. | 0.674863 |
9,484,036 | 10 | 12 | 10. An apparatus of a speaker verification system for preventing malicious attacks on protected resources, comprising: at least one processor; and at least one memory storing computer code instructions thereon, the at least one processor and the at least one memory, with the computer code instructions, being configured to cause the apparatus to: extract a plurality of speech features from multiple segments of a speech signal, the speech signal being a synthetic speech signal generated by transforming voice or text with voice characteristics of a user, the speech signal enabling access to protected resources by a requestor; analyze the plurality of speech features to determine whether the plurality of speech features exhibit periodic variation behavior, the analyzing comparing the plurality of speech features at edges of speech frames with the plurality of speech features in middles of the speech frames, wherein, to perform the analyzing, the at least one processor and the at least one memory, with the computer code instructions, are further configured to cause the apparatus to: generate a representation of variability of the plurality of speech features; and perform a periodicity analysis of the generated representation of variability to determine that the generated representation of variability exhibits periodic variation behavior; and deny the requestor access to the protected resources based on a determination that the speech signal is a synthetic speech signal based on the exhibited periodic variation behavior. | 10. An apparatus of a speaker verification system for preventing malicious attacks on protected resources, comprising: at least one processor; and at least one memory storing computer code instructions thereon, the at least one processor and the at least one memory, with the computer code instructions, being configured to cause the apparatus to: extract a plurality of speech features from multiple segments of a speech signal, the speech signal being a synthetic speech signal generated by transforming voice or text with voice characteristics of a user, the speech signal enabling access to protected resources by a requestor; analyze the plurality of speech features to determine whether the plurality of speech features exhibit periodic variation behavior, the analyzing comparing the plurality of speech features at edges of speech frames with the plurality of speech features in middles of the speech frames, wherein, to perform the analyzing, the at least one processor and the at least one memory, with the computer code instructions, are further configured to cause the apparatus to: generate a representation of variability of the plurality of speech features; and perform a periodicity analysis of the generated representation of variability to determine that the generated representation of variability exhibits periodic variation behavior; and deny the requestor access to the protected resources based on a determination that the speech signal is a synthetic speech signal based on the exhibited periodic variation behavior. 12. An apparatus according to claim 10 , wherein in extracting the plurality of speech features, the at least one processor and the at least one memory, with the computer code instructions, are configured to cause the apparatus to determine a pitch cycle length or shape associated with the speech signal. | 0.631643 |
9,087,044 | 6 | 9 | 6. A system for identifying generic terms, the system comprising one or more processors and one or more memory devices storing executable and operational data effective to cause the one or more processors to: evaluate word usage in an article for a string in reference corpus articles of a reference corpus by generating for the string a corpus vector having a list of co-occurring corpus words that occur in the reference corpus articles that also include the string and calculating a corpus ratio for each co-occurring corpus word as a number of times the each co-occurring corpus word occurs in the reference corpus articles containing the string divided by a number of times the co-occurring corpus word occurs in the reference corpus articles, the corpus vector including the list of co-occurring corpus words and the corpus ratio for the each co-occurring corpus words; evaluate word usage in current social media documents containing the string by generating for the string a social media vector having a list of co-occurring social media words that occur in social media documents that also include the string and calculating a social media ratio for each co-occurring social media word as a number of times the each co-occurring social media word occurs in the current social media documents containing the string divided by a number of times the co-occurring social media word occurs in the current social media documents, the social media vector including the list of co-occurring social media words and the social media ratio for the each co-occurring social media words; cause a generic score for the string to indicate greater generic-ness for a greater difference between the corpus vector and the social media vector; and store the generic score for the string. | 6. A system for identifying generic terms, the system comprising one or more processors and one or more memory devices storing executable and operational data effective to cause the one or more processors to: evaluate word usage in an article for a string in reference corpus articles of a reference corpus by generating for the string a corpus vector having a list of co-occurring corpus words that occur in the reference corpus articles that also include the string and calculating a corpus ratio for each co-occurring corpus word as a number of times the each co-occurring corpus word occurs in the reference corpus articles containing the string divided by a number of times the co-occurring corpus word occurs in the reference corpus articles, the corpus vector including the list of co-occurring corpus words and the corpus ratio for the each co-occurring corpus words; evaluate word usage in current social media documents containing the string by generating for the string a social media vector having a list of co-occurring social media words that occur in social media documents that also include the string and calculating a social media ratio for each co-occurring social media word as a number of times the each co-occurring social media word occurs in the current social media documents containing the string divided by a number of times the co-occurring social media word occurs in the current social media documents, the social media vector including the list of co-occurring social media words and the social media ratio for the each co-occurring social media words; cause a generic score for the string to indicate greater generic-ness for a greater difference between the corpus vector and the social media vector; and store the generic score for the string. 9. The system of claim 6 , wherein the executable and operational data are further effective to cause the one or more processors to: evaluate frequency of inclusion of the string in links in the current social media documents with respect to number of occurrences of the string in the current social media documents; and cause the generic score to indicate greater generic-ness the smaller the ratio of inclusion of the string in links in the current social media documents divided by the number of occurrences of the string in the current social media documents. | 0.5 |
8,832,150 | 1 | 6 | 1. A method comprising: obtaining, using one or more processors associated with one or more server devices, access privileges for a user of a document based on information associated with the user and access rights associated with the document; obtaining, using one or more processors associated with the one or more server devices, display right information relating to display rights granted by a source of the document for content of the document; determining, using one or more processors associated with the one or more server devices and based on the obtained access privileges for the user of the document and the obtained display right information, one or more first portions of the document to be readable by the user and one or more second portions of the document to be unreadable by the user; formatting, using one or more processors associated with the one or more server devices, based on the obtained access privileges and display right information, the document for display, where formatting the document further comprises: processing the one or more first portions of the document determined to be readable by the user; and processing the one or more second portions of the document determined to be unreadable by the user; and providing, for display and using one or more processors associated with the one or more server devices, the processed one or more readable first portions and a representation of content associated with the processed one or more unreadable second portions. | 1. A method comprising: obtaining, using one or more processors associated with one or more server devices, access privileges for a user of a document based on information associated with the user and access rights associated with the document; obtaining, using one or more processors associated with the one or more server devices, display right information relating to display rights granted by a source of the document for content of the document; determining, using one or more processors associated with the one or more server devices and based on the obtained access privileges for the user of the document and the obtained display right information, one or more first portions of the document to be readable by the user and one or more second portions of the document to be unreadable by the user; formatting, using one or more processors associated with the one or more server devices, based on the obtained access privileges and display right information, the document for display, where formatting the document further comprises: processing the one or more first portions of the document determined to be readable by the user; and processing the one or more second portions of the document determined to be unreadable by the user; and providing, for display and using one or more processors associated with the one or more server devices, the processed one or more readable first portions and a representation of content associated with the processed one or more unreadable second portions. 6. The method of claim 1 , where the one or more second portions of the document are one of blurred or blocked responsive to the display right information. | 0.818501 |
9,230,214 | 1 | 2 | 1. A method for facilitating use of an auto-completion system, comprising: receiving an input text string from a user; determining a set of potential replacement text strings, wherein each potential replacement text string in the set can replace the input text string, wherein determining the set of potential replacement text strings for the input text string involves: retrieving, from a database, prior financial transactions conducted with a set of businesses by the user; analyzing the retrieved prior financial transactions; and identifying, from the set of businesses, the set of potential replacement text strings, wherein each potential replacement text string in the set of potential replacement text strings is further based on establishing a level of lexicographic match of the potential replacement text string with the first text string; calculating, by computer, a commercial intent score for each potential replacement text string in the set, wherein the commercial intent score for each potential replacement text string in the set is based on calculating at least one of: a normalized value Category(u,b) of the category of the business b for the user u; a normalized value Size(u,b) of the size of the business b for the user u; and a normalized value Distance(u,b) of the distance of the business b for the user u; selecting a replacement text string from the set of potential replacement text strings based on the computed commercial intent score for each text string in the set; and displaying the replacement text string in place of the input text string to the user. | 1. A method for facilitating use of an auto-completion system, comprising: receiving an input text string from a user; determining a set of potential replacement text strings, wherein each potential replacement text string in the set can replace the input text string, wherein determining the set of potential replacement text strings for the input text string involves: retrieving, from a database, prior financial transactions conducted with a set of businesses by the user; analyzing the retrieved prior financial transactions; and identifying, from the set of businesses, the set of potential replacement text strings, wherein each potential replacement text string in the set of potential replacement text strings is further based on establishing a level of lexicographic match of the potential replacement text string with the first text string; calculating, by computer, a commercial intent score for each potential replacement text string in the set, wherein the commercial intent score for each potential replacement text string in the set is based on calculating at least one of: a normalized value Category(u,b) of the category of the business b for the user u; a normalized value Size(u,b) of the size of the business b for the user u; and a normalized value Distance(u,b) of the distance of the business b for the user u; selecting a replacement text string from the set of potential replacement text strings based on the computed commercial intent score for each text string in the set; and displaying the replacement text string in place of the input text string to the user. 2. The method of claim 1 , wherein the input text string comprises a customer or vendor registration name entered by the user. | 0.898223 |
9,514,407 | 11 | 12 | 11. A system constructed and arranged to generate knowledge-based authentication (KBA) questions, the system comprising: a network interface; memory; and a controller including controlling circuitry coupled to the memory, the controlling circuitry being constructed and arranged to: obtain, from a user device, an activity log of a user, the activity log including pointers to a set of external fact sources; derive external facts from each external fact source of the set of external fact sources; and generate a set of KBA questions from the external facts, wherein the activity log of the user includes-a web browsing history of the user, wherein the pointers to the set of external fact sources include a list of addresses, within the web browsing history, of websites corresponding to the respective addresses and previously visited by the user, the set of external fact sources including the websites addressed by the list of addresses, wherein controlling circuitry constructed and arranged to derive the set of external facts is further constructed and arranged to access, over a network, each of the websites addressed by the list of addresses and acquiring the external facts from the websites, and wherein the KBA questions are generated by a KBA server from content of websites distinct from the user device, pointed to by the web browsing history on the user device, and visited by the KBA server connecting to the websites over the network. | 11. A system constructed and arranged to generate knowledge-based authentication (KBA) questions, the system comprising: a network interface; memory; and a controller including controlling circuitry coupled to the memory, the controlling circuitry being constructed and arranged to: obtain, from a user device, an activity log of a user, the activity log including pointers to a set of external fact sources; derive external facts from each external fact source of the set of external fact sources; and generate a set of KBA questions from the external facts, wherein the activity log of the user includes-a web browsing history of the user, wherein the pointers to the set of external fact sources include a list of addresses, within the web browsing history, of websites corresponding to the respective addresses and previously visited by the user, the set of external fact sources including the websites addressed by the list of addresses, wherein controlling circuitry constructed and arranged to derive the set of external facts is further constructed and arranged to access, over a network, each of the websites addressed by the list of addresses and acquiring the external facts from the websites, and wherein the KBA questions are generated by a KBA server from content of websites distinct from the user device, pointed to by the web browsing history on the user device, and visited by the KBA server connecting to the websites over the network. 12. A system as in claim 11 , wherein each address of the list of addresses includes metadata indicating a time at which the user visited the website to which the address corresponds; wherein the controlling circuitry constructed and arranged to acquire the web browsing history is further constructed and arranged to: for each address of the list of addresses of the web browsing history: select the address when the metadata indicates that the user visited the website to which the address corresponds later than a threshold time, and not select the address when the metadata indicates that the user visited the website to which the address corresponds earlier than the threshold time. | 0.5 |
8,949,231 | 1 | 16 | 1. A user-interface method of selecting and presenting a collection of content items in which the presentation is ordered at least in part based on analyzing activity associated with content items having descriptive terms that describe the content items and promoting the presentation ranking of content items associated with descriptive terms that have an increased level of current activity, the method comprising: providing access to a set of content items, each content item having at least one associated descriptive term to describe the content item; receiving input entered by users for identifying desired content items; in response to the input entered by the users, presenting corresponding subsets of content items to the users; receiving actions from the users selecting content items from the corresponding subsets; analyzing the selection actions received from the users to detect an increased level of current activity relative to a normal level of activity associated with the content items selected by the users; selecting and ordering a collection of content items from the provided set of content items based on promoting the ranking of content items associated with descriptive terms that are associated with content items that have the increased level of current activity relative to the normal activity level; and presenting the collection of content items to at least one user. | 1. A user-interface method of selecting and presenting a collection of content items in which the presentation is ordered at least in part based on analyzing activity associated with content items having descriptive terms that describe the content items and promoting the presentation ranking of content items associated with descriptive terms that have an increased level of current activity, the method comprising: providing access to a set of content items, each content item having at least one associated descriptive term to describe the content item; receiving input entered by users for identifying desired content items; in response to the input entered by the users, presenting corresponding subsets of content items to the users; receiving actions from the users selecting content items from the corresponding subsets; analyzing the selection actions received from the users to detect an increased level of current activity relative to a normal level of activity associated with the content items selected by the users; selecting and ordering a collection of content items from the provided set of content items based on promoting the ranking of content items associated with descriptive terms that are associated with content items that have the increased level of current activity relative to the normal activity level; and presenting the collection of content items to at least one user. 16. The method of claim 1 , wherein at least one of receiving input, presenting the subsets of content items, receiving actions from the users, analyzing the descriptive terms, and selecting and ordering the collection of content items is performed on a server system remote from the at least one user. | 0.712928 |
8,358,290 | 13 | 19 | 13. The device according to claim 1 , wherein said at least one other page from said first document or from the second document comprises a plurality of thumbnails displayed with the current page. | 13. The device according to claim 1 , wherein said at least one other page from said first document or from the second document comprises a plurality of thumbnails displayed with the current page. 19. The device according to claim 13 , wherein a size of the thumbnails decrease as a duration of time since having being previously displayed increases. | 0.671674 |
5,434,777 | 1 | 2 | 1. A method for deducing meaning from a natural language input comprising the steps of: (a) receiving an ordered string of separate word objects of a selected language, where each of said word objects includes at least one alphanumeric character and is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; (b) selecting a word window having a length that is initially at least two and that is no greater than said length of said ordered string; (c) successively moving said word window along said ordered string, analyzing the meaning of the substring of word objects that fall within said word window, and removing said substring from said ordered string if said substring has a recognized meaning, until all substrings of said ordered string that fit within said window have been analyzed; (d) reducing said word window length; and, (e) repeating steps (c) and (d) until only an unrecognized residual of word objects of said ordered string remains. | 1. A method for deducing meaning from a natural language input comprising the steps of: (a) receiving an ordered string of separate word objects of a selected language, where each of said word objects includes at least one alphanumeric character and is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; (b) selecting a word window having a length that is initially at least two and that is no greater than said length of said ordered string; (c) successively moving said word window along said ordered string, analyzing the meaning of the substring of word objects that fall within said word window, and removing said substring from said ordered string if said substring has a recognized meaning, until all substrings of said ordered string that fit within said window have been analyzed; (d) reducing said word window length; and, (e) repeating steps (c) and (d) until only an unrecognized residual of word objects of said ordered string remains. 2. A method as recited in claim 1 wherein said step of receiving an ordered string of word objects includes receiving said ordered string from strokes entered by a stylus on a display screen of a pen-based computer. | 0.634354 |
9,805,089 | 11 | 16 | 11. A computer implemented method for identifying retail locations likely to sell a particular product, comprising: receiving a query from a remote computing device with a computing system, the query identifying a particular product; connecting with a database associated with the computing system, the database including retail location information representing a plurality of retail locations, retail category information for at least some of the plurality of the retail locations, and product information representing a plurality of products, the product information including natural language representations of at least some of the products, each of the natural language representations comprising one or more natural language words representing the corresponding product, the database further including a plurality of mappings between the products and retail categories represented in the retail category information, the database further including product ontology information representing hierarchies of product categories, and retail category ontology information representing hierarchies of retail categories; using the computing system to identify in the database a subset of the retail locations in a particular geographic area likely to provide the particular product in response to a query identifying the particular product by making one or more inferences that each of the subset of the retail locations is characterized by a corresponding one of a plurality of different probabilities of being a supplier of the particular product, the probability corresponding to each of the subset of the retail locations being represented in the database by a corresponding relationship between one of the retail categories to which the retail location belongs and one of the product categories in which the particular product is included, a first retail location of the subset of the retail locations being inferred to be a probable supplier of the particular product, and a second retail location of the subset of the retail locations being inferred to be a possible supplier of the particular product, the one or more inferences being made with reference to the particular product and the mappings between the products and the retail categories, and by extending the mappings using the product ontology information and the retail category ontology information to identify one or more relationships not explicitly represented in the database; and transmitting a response to the query to the remote computing device communicating the identified subset of the retail locations, including communicating the first retail location as a probable supplier of the particular product and communicating the second retail location as a possible supplier of the particular product. | 11. A computer implemented method for identifying retail locations likely to sell a particular product, comprising: receiving a query from a remote computing device with a computing system, the query identifying a particular product; connecting with a database associated with the computing system, the database including retail location information representing a plurality of retail locations, retail category information for at least some of the plurality of the retail locations, and product information representing a plurality of products, the product information including natural language representations of at least some of the products, each of the natural language representations comprising one or more natural language words representing the corresponding product, the database further including a plurality of mappings between the products and retail categories represented in the retail category information, the database further including product ontology information representing hierarchies of product categories, and retail category ontology information representing hierarchies of retail categories; using the computing system to identify in the database a subset of the retail locations in a particular geographic area likely to provide the particular product in response to a query identifying the particular product by making one or more inferences that each of the subset of the retail locations is characterized by a corresponding one of a plurality of different probabilities of being a supplier of the particular product, the probability corresponding to each of the subset of the retail locations being represented in the database by a corresponding relationship between one of the retail categories to which the retail location belongs and one of the product categories in which the particular product is included, a first retail location of the subset of the retail locations being inferred to be a probable supplier of the particular product, and a second retail location of the subset of the retail locations being inferred to be a possible supplier of the particular product, the one or more inferences being made with reference to the particular product and the mappings between the products and the retail categories, and by extending the mappings using the product ontology information and the retail category ontology information to identify one or more relationships not explicitly represented in the database; and transmitting a response to the query to the remote computing device communicating the identified subset of the retail locations, including communicating the first retail location as a probable supplier of the particular product and communicating the second retail location as a possible supplier of the particular product. 16. The computer implemented method of claim 11 wherein the database further includes business hours information identifying business hours for specific ones of the retail locations, the method further comprising identifying the subset of the retail locations with reference to the business hours information. | 0.734536 |
9,237,291 | 18 | 19 | 18. The computer readable medium of claim 17 , wherein the multiple external content sources comprise a plurality of an email server, an instant messaging service, a data service other than a Web site, a blogging service, a social media site, and a Web site other than the foregoing multiple external content sources. | 18. The computer readable medium of claim 17 , wherein the multiple external content sources comprise a plurality of an email server, an instant messaging service, a data service other than a Web site, a blogging service, a social media site, and a Web site other than the foregoing multiple external content sources. 19. The computer readable medium of claim 18 , wherein the multiple external content sources provide programming formation comprising, for each program, airtime, program name, program channel, and program description. | 0.5 |
7,502,787 | 26 | 27 | 26. The software of claim 25 , wherein: the database comprises: a first table comprising rows each corresponding to a keyword and each comprising an identifier uniquely identifying the keyword and a name for the keyword, each keyword corresponding to one or more items; and a second table comprising rows each corresponding to an item and each comprising a name for the item, a description for the item, and the identifier for the keyword corresponding to the item; the user-specified alphanumeric string comprises at least some of a keyword; and the software is operable to: search the keyword names in the first table for alphanumeric strings matching the user-specified alphanumeric string to determine one or more keyword identifiers corresponding to the one or more matching alphanumeric strings; and in response to determining the one or more keyword identifiers, search the fourth table for the one or more determined keyword identifiers to determine the item names and item descriptions for the matching items, the determined item names and item descriptions being provided for display. | 26. The software of claim 25 , wherein: the database comprises: a first table comprising rows each corresponding to a keyword and each comprising an identifier uniquely identifying the keyword and a name for the keyword, each keyword corresponding to one or more items; and a second table comprising rows each corresponding to an item and each comprising a name for the item, a description for the item, and the identifier for the keyword corresponding to the item; the user-specified alphanumeric string comprises at least some of a keyword; and the software is operable to: search the keyword names in the first table for alphanumeric strings matching the user-specified alphanumeric string to determine one or more keyword identifiers corresponding to the one or more matching alphanumeric strings; and in response to determining the one or more keyword identifiers, search the fourth table for the one or more determined keyword identifiers to determine the item names and item descriptions for the matching items, the determined item names and item descriptions being provided for display. 27. The software of claim 26 , wherein: each row of the second table comprises an identifier uniquely identifying the corresponding item; the database further comprises: a third table comprising rows each corresponding to an attribute of one or more items and each comprising an identifier uniquely identifying the attribute and a name of the attribute; and a fourth table comprising rows each corresponding to an attribute value of an attribute of an item and each comprising the attribute value, the identifier for the attribute, and the identifier for the item; and the software is operable to: search the fourth table for all instances of the item identifier for the particular matching item to determine the attribute identifiers and attribute values for attributes of the particular matching item; and in response to determining the attribute identifiers, search the third table for the determined attribute identifiers to determine the attribute names for the attributes of the particular matching item, the determined attribute names and attribute values being provided for display. | 0.5 |
9,830,912 | 7 | 8 | 7. The speak and touch auto correction interface of claim 1 , wherein the multimodal module further identifies a best choice along with a plurality of alternative best choices. | 7. The speak and touch auto correction interface of claim 1 , wherein the multimodal module further identifies a best choice along with a plurality of alternative best choices. 8. The speak and touch auto correction interface of claim 7 , wherein the multimodal module further determines a recognition score calculated using an acoustic score and a multimodal language model score for the best choice and the plurality of alternative best choices. | 0.5 |
8,650,647 | 1 | 3 | 1. A computer-implemented method of providing computer security, comprising: receiving, by one or more computer processors, from a plurality of clients, data describing client hygiene scores for the clients and describing a plurality of web sites visited by the clients, the client hygiene score for a client calculated responsive to an amount of malicious software detected at the client based on a scan of the client; determining, by one or more computer processors, a secondary hygiene score for a web site of the plurality of web sites visited by the clients based at least in part on client hygiene scores of clients that visited the web site; identifying, by one or more computer processors, a file hosted by the web site; and calculating and storing, by one or more computer processors, a reputation score for the file responsive to the secondary hygiene score of the web site that hosts the file. | 1. A computer-implemented method of providing computer security, comprising: receiving, by one or more computer processors, from a plurality of clients, data describing client hygiene scores for the clients and describing a plurality of web sites visited by the clients, the client hygiene score for a client calculated responsive to an amount of malicious software detected at the client based on a scan of the client; determining, by one or more computer processors, a secondary hygiene score for a web site of the plurality of web sites visited by the clients based at least in part on client hygiene scores of clients that visited the web site; identifying, by one or more computer processors, a file hosted by the web site; and calculating and storing, by one or more computer processors, a reputation score for the file responsive to the secondary hygiene score of the web site that hosts the file. 3. The computer-implemented method of claim 1 , wherein determining the secondary hygiene score for the web site comprises: determining, by one or more computer processors, whether the web site was predominantly visited by clients with good client hygiene scores; and responsive to determining that the web site was predominantly visited by clients with good client hygiene scores, assigning, by one or more computer processors, a secondary hygiene score indicating good hygiene to the web site. | 0.682692 |
7,809,705 | 16 | 17 | 16. The computer system of claim 15 further comprising: means for accessing local web page information of and global web graph information about a plurality of second web pages, wherein each second web page of the plurality of second web pages is a web page of known second quality; wherein determining the quality of the web page using collective inference is further based on the local web page information of the plurality of second web pages and the global web graph information about the plurality of second web pages. | 16. The computer system of claim 15 further comprising: means for accessing local web page information of and global web graph information about a plurality of second web pages, wherein each second web page of the plurality of second web pages is a web page of known second quality; wherein determining the quality of the web page using collective inference is further based on the local web page information of the plurality of second web pages and the global web graph information about the plurality of second web pages. 17. The computer system of claim 16 further comprising: means for receiving the local web page information of and the global web graph information about the plurality of first web pages; and means for receiving the local web page information of and the global web graph information about the plurality of second web pages. | 0.5 |
8,260,062 | 1 | 7 | 1. A computer-implemented method for generating genre models used to identify genres of a document, comprising: on a computer system having one or more processors executing one or more programs stored on memory of the computer system: for each document image in a set of document images that are associated with one or more genres, segmenting the document image into a plurality of tiles, wherein the tiles in the plurality of tiles are sized so that document page features are identifiable; and computing features of the document image and the plurality of tiles; and training at least one genre classifier to classify document images as being associated with one or more genres based on the features of the document images in the set of document images, the features of the plurality of tiles of the set of documents images, and the one or more genres associated with each document image in the set of documents images, wherein training the at least one genre classifier to classify document images as being associated with a respective genre in the one or more genres includes: training a first genre classifier corresponding to the respective genre based on the features of a first subset of the set of document images and the features of the plurality of tiles associated with the first subset of the set of document images; tuning parameters of the first genre classifier using a second subset of the set of document images, wherein the first subset and the second subset of the set of document images are mutually-exclusive sets of document images; training a second genre classifier corresponding to the respective genre based on the features of a second subset of the set of document images and the features of the plurality of tiles associated with the second subset of the set of document images; and tuning parameters of the second genre classifier using the first subset of the set of document images. | 1. A computer-implemented method for generating genre models used to identify genres of a document, comprising: on a computer system having one or more processors executing one or more programs stored on memory of the computer system: for each document image in a set of document images that are associated with one or more genres, segmenting the document image into a plurality of tiles, wherein the tiles in the plurality of tiles are sized so that document page features are identifiable; and computing features of the document image and the plurality of tiles; and training at least one genre classifier to classify document images as being associated with one or more genres based on the features of the document images in the set of document images, the features of the plurality of tiles of the set of documents images, and the one or more genres associated with each document image in the set of documents images, wherein training the at least one genre classifier to classify document images as being associated with a respective genre in the one or more genres includes: training a first genre classifier corresponding to the respective genre based on the features of a first subset of the set of document images and the features of the plurality of tiles associated with the first subset of the set of document images; tuning parameters of the first genre classifier using a second subset of the set of document images, wherein the first subset and the second subset of the set of document images are mutually-exclusive sets of document images; training a second genre classifier corresponding to the respective genre based on the features of a second subset of the set of document images and the features of the plurality of tiles associated with the second subset of the set of document images; and tuning parameters of the second genre classifier using the first subset of the set of document images. 7. The computer-implemented method of claim 1 , wherein the plurality of tiles are arranged in a predetermined order. | 0.814873 |
9,773,156 | 8 | 13 | 8. A system comprising a computing device and at least one program module that together are configured for performed actions comprising: determining, by the computing device for each image in a set of images, facial recognition data that, for each face detected by the computing device in the each image, comprises a face identifier that uniquely identifies the each face, a set of facial feature descriptors, a face score that is based on an open/closed state of the each face's eyes and mouth and that indicates an overall quality of the face, and a face signature that, across the images in the set, uniquely identifies an entity that the each face represents; and grouping, by the computing device based at least on the face signatures and the face scores, images of the set into one or more groups, where each group comprises one or more images that each show a detected face that represents a same entity as that represented by any other detected face shown in any image in the each group. | 8. A system comprising a computing device and at least one program module that together are configured for performed actions comprising: determining, by the computing device for each image in a set of images, facial recognition data that, for each face detected by the computing device in the each image, comprises a face identifier that uniquely identifies the each face, a set of facial feature descriptors, a face score that is based on an open/closed state of the each face's eyes and mouth and that indicates an overall quality of the face, and a face signature that, across the images in the set, uniquely identifies an entity that the each face represents; and grouping, by the computing device based at least on the face signatures and the face scores, images of the set into one or more groups, where each group comprises one or more images that each show a detected face that represents a same entity as that represented by any other detected face shown in any image in the each group. 13. The system of claim 8 , the actions further comprising ranking the groups according to a number of entities of the groups. | 0.631579 |
8,239,375 | 1 | 12 | 1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. | 1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. 12. The method of claim 1 further comprising displaying as the representation of a plurality of components a plurality of check boxes corresponding to the different applications; accepting input from at least two of the check boxes; and conducting the search based upon the at least one search criteria and the input from at least two of the check boxes. | 0.718153 |
7,895,137 | 1 | 10 | 1. A method of transforming data into computer executable rules for mining and constructing situation categories that are applied to information technology resource messages or events comprising: receiving computer readable data by a computer processing device from at least one of: a raw log and a catalog, where the received data is at least one of: initial seed data and knowledge data, to derive the computer executable rules for mining and constructing situation categories; transforming the received data into a predetermined standard format if the received data is not already in the predetermined standard format; parsing the predetermined standard formatted data; performing an outer, iterative loop until at least one predetermined stopping criterion is met, comprising: utilizing a keyword rule classifier by the computer processing device to automatically pre-classify at least a portion of the parsed data; performing an inner iterative loop within the outer iterative loop, comprising: selecting a subset of the parsed data for expert review; using at least one of keyword rules, features, and classifications to find, within data available to the computer processing device, a corresponding previously labeled subset of data that has similar semantics to semantics of the selected subset of data; labeling the selected subset of data with the label associated with the corresponding previously labeled subset of data; and repeating the inner iterative loop if another subset of data is to be processed; storing each labeled subset of data on a data storage device; generating new computer executable rules for mining and constructing situation categories from the stored labeled subsets of data; transforming keyword list classifiers using the stored labeled subsets of data; and repeating the outer iterative loop if the predetermined stopping criterion is not met. | 1. A method of transforming data into computer executable rules for mining and constructing situation categories that are applied to information technology resource messages or events comprising: receiving computer readable data by a computer processing device from at least one of: a raw log and a catalog, where the received data is at least one of: initial seed data and knowledge data, to derive the computer executable rules for mining and constructing situation categories; transforming the received data into a predetermined standard format if the received data is not already in the predetermined standard format; parsing the predetermined standard formatted data; performing an outer, iterative loop until at least one predetermined stopping criterion is met, comprising: utilizing a keyword rule classifier by the computer processing device to automatically pre-classify at least a portion of the parsed data; performing an inner iterative loop within the outer iterative loop, comprising: selecting a subset of the parsed data for expert review; using at least one of keyword rules, features, and classifications to find, within data available to the computer processing device, a corresponding previously labeled subset of data that has similar semantics to semantics of the selected subset of data; labeling the selected subset of data with the label associated with the corresponding previously labeled subset of data; and repeating the inner iterative loop if another subset of data is to be processed; storing each labeled subset of data on a data storage device; generating new computer executable rules for mining and constructing situation categories from the stored labeled subsets of data; transforming keyword list classifiers using the stored labeled subsets of data; and repeating the outer iterative loop if the predetermined stopping criterion is not met. 10. The method of claim 1 , wherein generating new computer executable rules comprises implementing a computer executable classification algorithm to generate candidate rules and a heuristic filter to remove selected ones of the candidate rules judged to be bad candidate rules. | 0.888622 |
7,590,604 | 1 | 2 | 1. A custom electronic learning system, comprising: at least one computing device including: a system for converting a knowledge object stored in at least one electronic file in the at least one computing device into a set of knowledge atoms stored in a tree structure in the at least one computing device, each knowledge atom representing an elementary piece of information that is contained in the knowledge object; and a system for generating an electronic learning object stored in at least one electronic file for presentation to a user based on a set of user characteristics for the user and the set of knowledge atoms, each user characteristic comprising information associated with the user that affects at least one of: a format or a display of the custom electronic learning object for the user. | 1. A custom electronic learning system, comprising: at least one computing device including: a system for converting a knowledge object stored in at least one electronic file in the at least one computing device into a set of knowledge atoms stored in a tree structure in the at least one computing device, each knowledge atom representing an elementary piece of information that is contained in the knowledge object; and a system for generating an electronic learning object stored in at least one electronic file for presentation to a user based on a set of user characteristics for the user and the set of knowledge atoms, each user characteristic comprising information associated with the user that affects at least one of: a format or a display of the custom electronic learning object for the user. 2. The system of claim 1 , the knowledge object comprising at least one of: a word processing document, a web page, a spreadsheet, a presentation, an e-mail, a chart, an image, an audio file, or a video. | 0.5 |
8,560,806 | 11 | 18 | 11. A system comprising: a memory; and a processor including: an interface to perform a transaction to fetch information from the memory; and memory management logic to translate an untranslated address to a memory address, including: a storage location to store a first address of an initial data structure for a first walk through a first set of translation stages; a plurality of translation stages comprising the first set of translation stages and a second set of translation stages, the first set of translation stages reserved for a first context, the second set of translation stages reserved for a second context, each translation stage of the plurality of translation stages including translation logic and a data structure, the translation logic to find a particular entry of a plurality of entries in the data structure based on a corresponding portion of the untranslated address, each entry of the plurality of entries in the data structure to store a transition indicator to indicate a context switch from the first context to the second context; and determination logic to: determine, during the first walk through the first set of translation stages, whether the particular entry of the plurality of entries in the data structure is a transition entry for the context switch from the first context to the second context based at least in part on the transition indicator of the particular entry; and in response to a determination that the particular entry is a transition entry, initiate a second walk through the second set of translation stages to cause the context switch from the first context to the second context. | 11. A system comprising: a memory; and a processor including: an interface to perform a transaction to fetch information from the memory; and memory management logic to translate an untranslated address to a memory address, including: a storage location to store a first address of an initial data structure for a first walk through a first set of translation stages; a plurality of translation stages comprising the first set of translation stages and a second set of translation stages, the first set of translation stages reserved for a first context, the second set of translation stages reserved for a second context, each translation stage of the plurality of translation stages including translation logic and a data structure, the translation logic to find a particular entry of a plurality of entries in the data structure based on a corresponding portion of the untranslated address, each entry of the plurality of entries in the data structure to store a transition indicator to indicate a context switch from the first context to the second context; and determination logic to: determine, during the first walk through the first set of translation stages, whether the particular entry of the plurality of entries in the data structure is a transition entry for the context switch from the first context to the second context based at least in part on the transition indicator of the particular entry; and in response to a determination that the particular entry is a transition entry, initiate a second walk through the second set of translation stages to cause the context switch from the first context to the second context. 18. The system of claim 11 , wherein the transition entry is to enable an instruction of the first context to reference the second context. | 0.82625 |
9,087,132 | 32 | 34 | 32. The method of tying a geospatial location to a PIDF-LO file according to claim 18 , further comprising: tagging descriptive information relating to said location aware XML content in a <presence . . . > section of said PIDF-LO file. | 32. The method of tying a geospatial location to a PIDF-LO file according to claim 18 , further comprising: tagging descriptive information relating to said location aware XML content in a <presence . . . > section of said PIDF-LO file. 34. The method of tying a geospatial location to a PIDF-LO file according to claim 32 , wherein: said tagged descriptive information includes at least one of: “weather”, “century”, “season”, and “year” tags. | 0.551948 |
8,650,188 | 12 | 13 | 12. The method of claim 5 , wherein the retargeting set is associated with temporal expiration data defining a time period during which retargeted identifiers remain in the retargeting set. | 12. The method of claim 5 , wherein the retargeting set is associated with temporal expiration data defining a time period during which retargeted identifiers remain in the retargeting set. 13. The method of claim 12 , further comprising: removing a retargeted identifier from a retargeting set based on the temporal expiration data. | 0.5 |
9,367,585 | 3 | 11 | 3. The data storage and query method, as recited in claim 1 , wherein each MiniTable has a limited size which is usually no larger than 64M, for being wholly placed into a data block of a Hadoop distributed file system; any two disparate MiniTables are forbidden to inter-table operations of a relational database which comprise join, so as to eliminate a necessity of jointly locking the several tables; the Key is not only the identifier of the MiniTable, but also an identification of a storage position in the distributed file system of the MiniTable. | 3. The data storage and query method, as recited in claim 1 , wherein each MiniTable has a limited size which is usually no larger than 64M, for being wholly placed into a data block of a Hadoop distributed file system; any two disparate MiniTables are forbidden to inter-table operations of a relational database which comprise join, so as to eliminate a necessity of jointly locking the several tables; the Key is not only the identifier of the MiniTable, but also an identification of a storage position in the distributed file system of the MiniTable. 11. The data storage and query method, as recited in claim 3 , wherein the Key server has three kernel data structures of: (1) a B+ tree, for storing corresponding relations between the Keys and address codes; (2) an address translating table, for storing corresponding relations between the address codes and IP addresses, and between the address codes and the port numbers; and (3) a MiniTable server monitoring table, for storing for storing loading conditions of the MiniTable servers corresponding to each address code; wherein when the Key server receives a primitive request, the Key server checks whether the primitive request is a valid Query primitive; if yes, the Key server queries an address code corresponding to a Key in the B+ tree; if no existing Key, the Key server returns information of no existing Key; if the Key exists, the Key server queries an IP address and a port number corresponding to the address code in the address translating table; if no existing IP address and no existing port number, the Key server returns to error; if the IP address and the port number exist, the Key server transfers the request to the MiniTable server corresponding to the IP address and the port number; if the request is not a valid Query primitive, the Key server checks whether the request is a valid Create primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; if the designated Key exists, the Key server returns information that the designated Key has existed; if no existing designated Key, the Key server allocates an address code according to a dispatch algorithm and the MiniTable server monitoring table, updates the MiniTable server monitoring table, queries an IP address and a port number corresponding to the address code and transfers the request to the corresponding MiniTable server; if the request is not a valid Create primitive, the Key server checks whether the request is a valid Delete primitive; if yes, the Key server queries whether a designated Key exists in the B+ tree; If no existing designated Key, the Key server returns information of no existing designated Key; if the designated Key exists, the Key server queries an IP address and a port number corresponding to an address code in the address translating table, deletes the corresponding Key in the B+ tree, updates the MiniTable server monitoring table, queries the IP address and the port number and transfers the request to the corresponding MiniTable server. | 0.5 |
7,818,658 | 27 | 30 | 27. A system for editing a multimedia presentation that includes a sequence of visual displays, the multimedia presentation being defined by a presentation script such as a presentation script including instructions that include identification of a plurality of content assets, identification of one or more visual displays in which the identified content assets are to be included, one or more modifications of the content assets to be performed prior to inclusion of the identified contents asset in the one or more visual displays, instructions for positioning the modified content assets in the one or more visual displays, and layering instructions for determining, for a portion of the visual display that includes plurality of modified content assets, the forward and backward relation of the plurality of modified assets to each other in the visual display, the system comprising: a processor configured to implement a user interface for editing a content asset for a multimedia presentation, comprising: a bounding box around a display of the content asset, the bounding box including asset editing buttons that cause modifications to a presentation script to accomplish asset editing functions associated with the asset editing buttons. | 27. A system for editing a multimedia presentation that includes a sequence of visual displays, the multimedia presentation being defined by a presentation script such as a presentation script including instructions that include identification of a plurality of content assets, identification of one or more visual displays in which the identified content assets are to be included, one or more modifications of the content assets to be performed prior to inclusion of the identified contents asset in the one or more visual displays, instructions for positioning the modified content assets in the one or more visual displays, and layering instructions for determining, for a portion of the visual display that includes plurality of modified content assets, the forward and backward relation of the plurality of modified assets to each other in the visual display, the system comprising: a processor configured to implement a user interface for editing a content asset for a multimedia presentation, comprising: a bounding box around a display of the content asset, the bounding box including asset editing buttons that cause modifications to a presentation script to accomplish asset editing functions associated with the asset editing buttons. 30. The system of claim 27 , wherein the asset editing buttons include a resizing button. | 0.800448 |
8,838,457 | 1 | 7 | 1. A method of allowing a user to control a mobile communication facility comprising: receiving speech and information currently displayed in a mobile communication facility from a user using a mobile communication facility resident capture facility, wherein the speech presented by the user includes a command and a subject and wherein the speech and information was transmitted from the mobile communication facility to a speech recognition facility; utilizing, by the speech recognition facility, (i) contextual information not provided in the speech and (ii) at least one statistical language model to recognize the command and a subject from the speech presented by the user, wherein the contextual information includes usage history of the mobile communication facility, information from a user's favorites list, information about the user's address book or contact list, email content, or information currently displayed in by the mobile communication facility; determining, by the speech recognition facility, at least one application to invoke on the mobile communication facility to perform an operation on the mobile communication facility based on the contextual information, the command, and the subject of the speech, wherein the operation includes an action defined by the command using parameters based on the subject; and causing the mobile communication facility to automatically perform the operation on the mobile communication facility using the determined at least one application. | 1. A method of allowing a user to control a mobile communication facility comprising: receiving speech and information currently displayed in a mobile communication facility from a user using a mobile communication facility resident capture facility, wherein the speech presented by the user includes a command and a subject and wherein the speech and information was transmitted from the mobile communication facility to a speech recognition facility; utilizing, by the speech recognition facility, (i) contextual information not provided in the speech and (ii) at least one statistical language model to recognize the command and a subject from the speech presented by the user, wherein the contextual information includes usage history of the mobile communication facility, information from a user's favorites list, information about the user's address book or contact list, email content, or information currently displayed in by the mobile communication facility; determining, by the speech recognition facility, at least one application to invoke on the mobile communication facility to perform an operation on the mobile communication facility based on the contextual information, the command, and the subject of the speech, wherein the operation includes an action defined by the command using parameters based on the subject; and causing the mobile communication facility to automatically perform the operation on the mobile communication facility using the determined at least one application. 7. The method of claim 1 wherein the mobile communication facility presents a series of screens allowing the user to plot a route to a desired destination. | 0.753968 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.