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,087,296 | 14 | 18 |
14. A method comprising: accessing a specification identifying a model of a navigable semantic network, the model defining resource nodes and relationships amongst the resource nodes in the navigable semantic network; in accordance with the model, instantiating a portion of the navigable semantic network from a perspective of a given resource node in the navigable semantic network; and providing access to the instantiated portion of the navigable semantic network to enable rendering of the portion of the navigable semantic network on a display screen.
|
14. A method comprising: accessing a specification identifying a model of a navigable semantic network, the model defining resource nodes and relationships amongst the resource nodes in the navigable semantic network; in accordance with the model, instantiating a portion of the navigable semantic network from a perspective of a given resource node in the navigable semantic network; and providing access to the instantiated portion of the navigable semantic network to enable rendering of the portion of the navigable semantic network on a display screen. 18. The method as in claim 14 , wherein accessing the model includes: i) identifying, in the semantic network model, resource node information associated with the given resource node, and ii) based on the resource node information, identifying a group of neighboring resource nodes related to the given resource node, iii) identifying resource node information associated with the group of neighboring resource nodes; and wherein instantiating the portion of the navigable semantic network from the perspective of the given resource node in the navigable semantic network includes generating the instantiated portion of the navigable semantic network in accordance with i) the resource node information associated with the given resource node, and ii) the resource node information associated with the group of neighboring resource nodes.
| 0.5 |
9,514,124 | 1 | 5 |
1. A method of responding to a natural language question from a user, comprising: receiving the natural language question in a computer-readable form, by executing first instructions in a computer system; analyzing the natural language question to find a plurality of key characteristics, by executing second instructions in the computer system; matching a plurality of business processes from at least one business process repository to the key characteristics, by executing third instructions in the computer system; ranking the plurality of matching business processes, by executing fourth instructions in the computer system; and recommending at least one particular business process from the plurality of matching business processes based on said ranking, by executing fifth instructions in the computer system, wherein said recommending includes displaying information regarding said ranking of the matching business processes on a display device of the computer system as part of a user interface.
|
1. A method of responding to a natural language question from a user, comprising: receiving the natural language question in a computer-readable form, by executing first instructions in a computer system; analyzing the natural language question to find a plurality of key characteristics, by executing second instructions in the computer system; matching a plurality of business processes from at least one business process repository to the key characteristics, by executing third instructions in the computer system; ranking the plurality of matching business processes, by executing fourth instructions in the computer system; and recommending at least one particular business process from the plurality of matching business processes based on said ranking, by executing fifth instructions in the computer system, wherein said recommending includes displaying information regarding said ranking of the matching business processes on a display device of the computer system as part of a user interface. 5. The method of claim 1 wherein each business process in the repository is designated as one of three process types including idempotent, non-binding or retrieve-only.
| 0.560209 |
10,157,086 | 11 | 12 |
11. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, the computer-program product including instructions operable to cause a processor to perform operations comprising: receive, at a portal, and from a requesting device via a network, a first request to provide objects to the requesting device to enable the requesting device to generate a visualization of a first directed acyclic graph (DAG) of multiple task routines of a first job flow of a first analysis routine, wherein: the portal is provided on the network to control access to at least one federated area by the requesting device via the network; the at least one federated area is maintained within one or more storage devices to store a plurality of data objects, a plurality of task routines and a plurality of job flow definitions; each task routine of the plurality of task routines comprises comments that specify input and output (I/O) parameters that comprise at least one characteristic of an input to the task routine and at least one characteristic of an output generated during execution of the task routine; the I/O parameters of the comments of a subset of task routines of the plurality of task routines comprises an identifier of at least one data object of the plurality of data objects; each task routine of the multiple task routines comprises executable instructions to perform a task when executed; and each job flow definition specifies multiple tasks of a job flow of an analysis routine to be performed by task routines of the plurality of task routines; retrieve each task routine of the multiple task routines from the at least one federated area; parse the comments of each task routine of the multiple task routines to identify and retrieve the specification of the I/O parameters of the task routine from the comments; for each task routine of the multiple task routines, generate a corresponding macro of multiple macros that comprises an indication of the I/O parameters of the task routine; transmit the multiple macros to the requesting device via the network to enable the requesting device to generate, from the multiple macros, the visualization of the first DAG to include a visual representation of each task routine of the multiple task routines, and to enable the requesting device to visually output the visualization for display, wherein: each representation of a task routine comprises: a task graph object comprising an identifier of the task routine; at least one input data graph object that represents an input to the task routine, that is visually connected to the task graph object in the visualization, and that comprises a visual indication of the at least one characteristic of the input; and at least one output data graph object that represents an output of the task routine, that is visually connected to the task graph object in the visualization, and that comprises an indication of the at least one characteristic of the output; and to generate the visualization, the requesting device is to: compare identifiers of data objects in the I/O parameters specified in the comments among the multiple task routines to identify each dependency between an output of one task routine and an input of another task routine; and for each dependency identified between an output and an input of a pair of task routines of the multiple task routines, visually present a dependency marker that visually links the visual representations of the pair of task routines in the visualization; receive a second request from the requesting device to store a second DAG based on the visualization as edited in response to at least one command, wherein: the second DAG depicts a reuse of a portion of the first job flow depicted in the first DAG to define at least a portion of a second job flow of a second analysis routine derived from the first analysis routine; and at least a subset of task routines to be executed in a performance of the first job flow, as indicated in the first DAG, are to be executed in a performance of the second job flow, as indicated in the second DAG; determine whether each task routine identified in the second DAG is stored within the at least one federated area or is included in the second request; determine whether each task data object identified in the second DAG is stored within the at least one federated area or is included in the second request; and in response to a determination that each task routine identified in the second DAG and each data object identified in the second DAG is stored within the at least one federated area or is included in the second request, store the second DAG as a second job flow definition among the plurality of job flow definitions.
|
11. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, the computer-program product including instructions operable to cause a processor to perform operations comprising: receive, at a portal, and from a requesting device via a network, a first request to provide objects to the requesting device to enable the requesting device to generate a visualization of a first directed acyclic graph (DAG) of multiple task routines of a first job flow of a first analysis routine, wherein: the portal is provided on the network to control access to at least one federated area by the requesting device via the network; the at least one federated area is maintained within one or more storage devices to store a plurality of data objects, a plurality of task routines and a plurality of job flow definitions; each task routine of the plurality of task routines comprises comments that specify input and output (I/O) parameters that comprise at least one characteristic of an input to the task routine and at least one characteristic of an output generated during execution of the task routine; the I/O parameters of the comments of a subset of task routines of the plurality of task routines comprises an identifier of at least one data object of the plurality of data objects; each task routine of the multiple task routines comprises executable instructions to perform a task when executed; and each job flow definition specifies multiple tasks of a job flow of an analysis routine to be performed by task routines of the plurality of task routines; retrieve each task routine of the multiple task routines from the at least one federated area; parse the comments of each task routine of the multiple task routines to identify and retrieve the specification of the I/O parameters of the task routine from the comments; for each task routine of the multiple task routines, generate a corresponding macro of multiple macros that comprises an indication of the I/O parameters of the task routine; transmit the multiple macros to the requesting device via the network to enable the requesting device to generate, from the multiple macros, the visualization of the first DAG to include a visual representation of each task routine of the multiple task routines, and to enable the requesting device to visually output the visualization for display, wherein: each representation of a task routine comprises: a task graph object comprising an identifier of the task routine; at least one input data graph object that represents an input to the task routine, that is visually connected to the task graph object in the visualization, and that comprises a visual indication of the at least one characteristic of the input; and at least one output data graph object that represents an output of the task routine, that is visually connected to the task graph object in the visualization, and that comprises an indication of the at least one characteristic of the output; and to generate the visualization, the requesting device is to: compare identifiers of data objects in the I/O parameters specified in the comments among the multiple task routines to identify each dependency between an output of one task routine and an input of another task routine; and for each dependency identified between an output and an input of a pair of task routines of the multiple task routines, visually present a dependency marker that visually links the visual representations of the pair of task routines in the visualization; receive a second request from the requesting device to store a second DAG based on the visualization as edited in response to at least one command, wherein: the second DAG depicts a reuse of a portion of the first job flow depicted in the first DAG to define at least a portion of a second job flow of a second analysis routine derived from the first analysis routine; and at least a subset of task routines to be executed in a performance of the first job flow, as indicated in the first DAG, are to be executed in a performance of the second job flow, as indicated in the second DAG; determine whether each task routine identified in the second DAG is stored within the at least one federated area or is included in the second request; determine whether each task data object identified in the second DAG is stored within the at least one federated area or is included in the second request; and in response to a determination that each task routine identified in the second DAG and each data object identified in the second DAG is stored within the at least one federated area or is included in the second request, store the second DAG as a second job flow definition among the plurality of job flow definitions. 12. The computer-program product of claim 11 , wherein: to identify the multiple task routines, the first request comprises a job flow identifier of a first job flow definition of the first job flow among the plurality of job flow definitions; the first job flow definition comprises a flow task identifier of multiple flow task identifiers for each task of the multiple tasks; and the processor is caused to perform operations comprising: use the job flow identifier of the first request to retrieve the first job flow definition from among the plurality of job flow definitions; and use the multiple flow task identifiers of the first job flow definition to retrieve the multiple task routines from among the plurality of task routines.
| 0.705976 |
8,495,143 | 1 | 25 |
1. A computer-implemented method comprising: maintaining a user profile for each of a plurality of users of a social networking system, each user profile comprising a set of attributes; selecting a user from the plurality of users; receiving user profile information for at least one user of a set of users in the social networking system who are connected to the selected user in the social networking system; inferring a value of one or more attributes of the user profile for the selected user based on information describing the set of users who are connected to the selected user in the social networking system; comparing a confidence score value for an inferred user profile attribute to a threshold value; storing, responsive to the confidence score being above the threshold value, the inferred value of the user profile attribute with the user profile for the selected user; determining relevant information for the selected user based on the inferred user profile attribute; and sending the relevant information to the selected user.
|
1. A computer-implemented method comprising: maintaining a user profile for each of a plurality of users of a social networking system, each user profile comprising a set of attributes; selecting a user from the plurality of users; receiving user profile information for at least one user of a set of users in the social networking system who are connected to the selected user in the social networking system; inferring a value of one or more attributes of the user profile for the selected user based on information describing the set of users who are connected to the selected user in the social networking system; comparing a confidence score value for an inferred user profile attribute to a threshold value; storing, responsive to the confidence score being above the threshold value, the inferred value of the user profile attribute with the user profile for the selected user; determining relevant information for the selected user based on the inferred user profile attribute; and sending the relevant information to the selected user. 25. The computer-implemented method of claim 1 , wherein the inferred attribute is an age of the selected user and the set of users is determined by performing cluster analysis of users connected to the selected user based on their age values.
| 0.701474 |
7,797,274 | 1 | 4 |
1. A method for providing a collaborative editing model for online content, comprising: receiving user-created online content comprising a first public-facing version of the content; receiving a set of suggested edits to the online content from a plurality of users, where each suggested edit in the set relates to the first public-facing version; providing the set of suggested edits to an authorized editor of the online content, wherein the editor is visually notified of differences between the first public-facing version of the content and the suggested edits and is notified of conflicts existing between two or more suggested edits where a conflict exists if a first suggested edit cannot co-exist with a second suggested edit; receiving input from the editor resolving conflicts and accepting or rejecting suggested edits in the set; modifying the first public-facing version of the content based on the set of suggested edits and the input from the editor to generate a second public-facing version of the content; carrying over suggested edits from the set that were not accepted nor rejected and that are not in conflict with the second public-facing version of the content for future editor input accepting or rejecting the carried over suggested edits in relation to the second public-facing version of the content; providing a marked-up view of the online content showing differences between the first public-facing version of the online content and a previous public-facing version of the online content; receiving comments appended to one or more of the suggested edits; providing the comments to the editor; and recording a reply from the editor to at least one of the comments.
|
1. A method for providing a collaborative editing model for online content, comprising: receiving user-created online content comprising a first public-facing version of the content; receiving a set of suggested edits to the online content from a plurality of users, where each suggested edit in the set relates to the first public-facing version; providing the set of suggested edits to an authorized editor of the online content, wherein the editor is visually notified of differences between the first public-facing version of the content and the suggested edits and is notified of conflicts existing between two or more suggested edits where a conflict exists if a first suggested edit cannot co-exist with a second suggested edit; receiving input from the editor resolving conflicts and accepting or rejecting suggested edits in the set; modifying the first public-facing version of the content based on the set of suggested edits and the input from the editor to generate a second public-facing version of the content; carrying over suggested edits from the set that were not accepted nor rejected and that are not in conflict with the second public-facing version of the content for future editor input accepting or rejecting the carried over suggested edits in relation to the second public-facing version of the content; providing a marked-up view of the online content showing differences between the first public-facing version of the online content and a previous public-facing version of the online content; receiving comments appended to one or more of the suggested edits; providing the comments to the editor; and recording a reply from the editor to at least one of the comments. 4. The method of claim 1 , wherein the authorized editor is a collaborator designated by an author of the user-created online content.
| 0.767361 |
9,552,414 | 1 | 6 |
1. A computer-implemented method comprising: storing a plurality of application indexes, wherein each application index corresponds to one or more application categories of a plurality of application categories, wherein each application index comprises identifiers for a plurality of application representations, and wherein a subset of the application indexes are associated with a partner system; receiving a search query from a computing device associated with the partner system; identifying an application category based on the received search query, the application category indicating a platform executing on the computing device; selecting an index from the plurality of application indexes based on the identified application category and a partner identifier of the partner system; querying the selected index corresponding to the identified application category to identify a first plurality of application representations associated with the identified application category; identifying a second application category based on the received search query; selecting a second index from the plurality of application indexes based on the second identified application category and the partner identifier; querying the second index to identify a second plurality of application representations corresponding to the second application category; generating search results based on a union of the first plurality of application representations and the second plurality of application representations; and providing, for display, the generated search results to the computing device.
|
1. A computer-implemented method comprising: storing a plurality of application indexes, wherein each application index corresponds to one or more application categories of a plurality of application categories, wherein each application index comprises identifiers for a plurality of application representations, and wherein a subset of the application indexes are associated with a partner system; receiving a search query from a computing device associated with the partner system; identifying an application category based on the received search query, the application category indicating a platform executing on the computing device; selecting an index from the plurality of application indexes based on the identified application category and a partner identifier of the partner system; querying the selected index corresponding to the identified application category to identify a first plurality of application representations associated with the identified application category; identifying a second application category based on the received search query; selecting a second index from the plurality of application indexes based on the second identified application category and the partner identifier; querying the second index to identify a second plurality of application representations corresponding to the second application category; generating search results based on a union of the first plurality of application representations and the second plurality of application representations; and providing, for display, the generated search results to the computing device. 6. The method of claim 1 , wherein identifying the application category based on the search query comprises: identifying an association between a platform identifier of the computing device and the application category.
| 0.708777 |
8,392,188 | 1 | 8 |
1. A method for building a phonotactic model for domain independent speech recognition, comprising: recognizing phones from a user's input communication using a current phonotactic model stored in a database; detecting morphemes from the recognized phones; creating, via a new processor, a new phonotactic model using the detected morphemes, the creating the new phonotactic model comprising transforming a prior probability distribution associated with a first domain to a prior probability distribution associated with a second domain; replacing the current phonotactic model with the new phonotactic model in the database; and outputting the detected morphemes for processing.
|
1. A method for building a phonotactic model for domain independent speech recognition, comprising: recognizing phones from a user's input communication using a current phonotactic model stored in a database; detecting morphemes from the recognized phones; creating, via a new processor, a new phonotactic model using the detected morphemes, the creating the new phonotactic model comprising transforming a prior probability distribution associated with a first domain to a prior probability distribution associated with a second domain; replacing the current phonotactic model with the new phonotactic model in the database; and outputting the detected morphemes for processing. 8. The method of claim 1 , wherein the method operates in conjunction with one or more communication networks, the communication networks including a telephone network, the Internet, an intranet, cable TV network, a local area network (LAN), and a wireless communication network.
| 0.545603 |
7,761,436 | 12 | 13 |
12. A computer-implemented method for transmitting a communication to a set of annotating users, comprising: displaying a first keyword that annotates a first set of content from a first set of annotating users; displaying a second keyword that annotates a second set of content from a second set of annotating users, wherein the first set and the second set include a union of content from the annotating users annotated by the first keyword and the second keyword; receiving a request to transmit a communication to the first set of annotating users via selection of a first keyword; receiving a request not to transmit the communication to the union of annotating users via selection of the second keyword; and transmitting the communication to the first set of annotating users exclusive of the union of annotated users.
|
12. A computer-implemented method for transmitting a communication to a set of annotating users, comprising: displaying a first keyword that annotates a first set of content from a first set of annotating users; displaying a second keyword that annotates a second set of content from a second set of annotating users, wherein the first set and the second set include a union of content from the annotating users annotated by the first keyword and the second keyword; receiving a request to transmit a communication to the first set of annotating users via selection of a first keyword; receiving a request not to transmit the communication to the union of annotating users via selection of the second keyword; and transmitting the communication to the first set of annotating users exclusive of the union of annotated users. 13. The method according to claim 12 , further comprising receiving a selection for a communication type for the communication from a set of communication types.
| 0.5 |
9,710,701 | 11 | 17 |
11. An information handling device, comprising: a processor; an input and display device; a memory device that stores instructions executable by the processor to: accept handwriting ink strokes forming a word to be searched; analyze the handwriting ink strokes to produce a list of candidate words corresponding to the word to be searched; search, using a plurality of words from the list of candidate words, existing computer readable text associated with prior handwriting data; said search comprising identifying prior handwriting data having one or more of the list of candidate words associated therewith; and display at least one result based on the searching.
|
11. An information handling device, comprising: a processor; an input and display device; a memory device that stores instructions executable by the processor to: accept handwriting ink strokes forming a word to be searched; analyze the handwriting ink strokes to produce a list of candidate words corresponding to the word to be searched; search, using a plurality of words from the list of candidate words, existing computer readable text associated with prior handwriting data; said search comprising identifying prior handwriting data having one or more of the list of candidate words associated therewith; and display at least one result based on the searching. 17. The information handling device of claim 11 , wherein the instructions are further executable by the processor to: render, using the processor, at least one image based on the handwriting ink strokes; and render, using the processor, at least one image based on the existing handwriting data.
| 0.683761 |
9,799,327 | 3 | 4 |
3. The method of claim 2 , wherein the set of substrings comprises a set of alphabetic letters which is used to write one or more natural languages.
|
3. The method of claim 2 , wherein the set of substrings comprises a set of alphabetic letters which is used to write one or more natural languages. 4. The method of claim 3 , wherein the substrings in the set of substrings further comprise a space character, a comma character, a period character, an apostrophe character, and an unknown character.
| 0.5 |
8,713,078 | 25 | 31 |
25. A computer system for managing video contents, comprising: a personal electronic device including a processor configured to process information; a storage subsystem configured to store information and computer program code; the computer system configured for: generating a custom taxonomy of topics personalized for a user, based on a viewing history of the user, the custom taxonomy of topics including at least one hierarchical level of subtopics from dynamic data sources, wherein generating the custom taxonomy of topics comprises: collecting a plurality of keywords related to a video topic, wherein the keywords are collected from a plurality of dynamic data sources; and utilizing a taxonomy builder for: identifying one or more video sub-topics of the video topic based on a ranking of the keywords collected for the video topic; and building a topic node in the custom taxonomy of topics, wherein the topic node includes a set comprising: a topic identifier for the video topic; a child topic identifier comprising a list of the video sub-topics identified; and a keyword section comprising the keywords collected for the video topic; and categorizing and ranking a plurality of videos by identifying keywords in video metadata associated with the plurality of videos, and using the hierarchical relationship in the customized taxonomy of topics to determine how closely the plurality of videos are related to the first video topic and the video sub-topics by comparing the keywords identified in the video metadata associated with the plurality of videos to the keyword section.
|
25. A computer system for managing video contents, comprising: a personal electronic device including a processor configured to process information; a storage subsystem configured to store information and computer program code; the computer system configured for: generating a custom taxonomy of topics personalized for a user, based on a viewing history of the user, the custom taxonomy of topics including at least one hierarchical level of subtopics from dynamic data sources, wherein generating the custom taxonomy of topics comprises: collecting a plurality of keywords related to a video topic, wherein the keywords are collected from a plurality of dynamic data sources; and utilizing a taxonomy builder for: identifying one or more video sub-topics of the video topic based on a ranking of the keywords collected for the video topic; and building a topic node in the custom taxonomy of topics, wherein the topic node includes a set comprising: a topic identifier for the video topic; a child topic identifier comprising a list of the video sub-topics identified; and a keyword section comprising the keywords collected for the video topic; and categorizing and ranking a plurality of videos by identifying keywords in video metadata associated with the plurality of videos, and using the hierarchical relationship in the customized taxonomy of topics to determine how closely the plurality of videos are related to the first video topic and the video sub-topics by comparing the keywords identified in the video metadata associated with the plurality of videos to the keyword section. 31. The computer system of claim 25 , wherein: said plurality of keywords are collected from a plurality of dynamic data sources including a website providing reference information and a personalized data source associated with use of a personal electronic device, wherein keywords collected from the personalized data source include video metadata information associated with a viewing history of video content accessed by the personal electronic device, and wherein keywords collected from the website include keywords extracted from content available on the website related to first video topic.
| 0.681237 |
7,596,594 | 8 | 12 |
8. A method for performing an action upon an email conversation comprising: grouping a plurality of email messages into a plurality of conversations, where the grouping is performed independent of folders in which the plurality of email messages reside, thereby enabling the plurality of conversations to span multiple folders; receiving an indication from a user to perform an action upon a conversation of the plurality of conversations comprising a subset of the plurality of email messages; and performing the action upon the conversation of the plurality of conversations, wherein the action is applied to all email messages in the subset of the plurality of email messages in the conversation of the plurality of conversations regardless of the folders in which the subset of the plurality of email messages reside, unless the indication from the user includes an instruction that the action should apply only to a smaller subset of email messages in the subset of the plurality of email messages in select folders, in which case the action will apply to only the smaller subset of the email messages of the conversation in the select folders.
|
8. A method for performing an action upon an email conversation comprising: grouping a plurality of email messages into a plurality of conversations, where the grouping is performed independent of folders in which the plurality of email messages reside, thereby enabling the plurality of conversations to span multiple folders; receiving an indication from a user to perform an action upon a conversation of the plurality of conversations comprising a subset of the plurality of email messages; and performing the action upon the conversation of the plurality of conversations, wherein the action is applied to all email messages in the subset of the plurality of email messages in the conversation of the plurality of conversations regardless of the folders in which the subset of the plurality of email messages reside, unless the indication from the user includes an instruction that the action should apply only to a smaller subset of email messages in the subset of the plurality of email messages in select folders, in which case the action will apply to only the smaller subset of the email messages of the conversation in the select folders. 12. The method of claim 8 , wherein performing the action comprises: for all messages in the conversation that are in folders to which the action applies, retrieving message objects associated with the messages; and modifying the message objects associated with the messages to reflect the action.
| 0.745283 |
9,195,632 | 11 | 19 |
11. A computer-implemented method comprising: storing, in a social networking system, a brand page associated with an entity; storing one or more user profiles of users of the social networking system and a set of connections among the users, each user profile including information corresponding to at least one user interest, and wherein one or more of the user profiles includes a connection to the brand page, the information of each user profile including at least one affinity corresponding to the at least one user interest; receiving, from the entity, a plurality of content items for posting to the brand page, at least one of the plurality of content items including an additional content message for accessing one or more additional content items, and another at least one of the plurality of content items including at least one of: information about the entity associated with the brand page, information about a brand of the brand page, and information about a product associated with a brand of the brand page; receiving, from the entity, an association between each content item of the plurality with one or more keywords describing at least one of the brand of the brand page and the information about the product associated with the brand of the brand page, each of the one or more keywords defined by the entity; receiving, at the social networking system, a request to view the brand page from a user having a user profile connected to the brand page stored in the social networking system; accessing the user profile of the social networking system, the user profile associated with the user requesting to view the brand page; selecting, by the social networking system, content items from the plurality of content items, the selecting based on: an affinity of the at least one affinity, the affinity between the at least one user interest and the content items; the one or more keywords associated with each of the plurality of content items, and the information corresponding to the at least one user interest in the user profile associated with the user requesting to view the brand page, wherein at least one of the selected content items includes the additional content message for accessing additional content items; generating, using the selected content items, a personalized representation of the brand page for display in the social networking system to the user requesting to view the brand page, the personalized representation of the brand page containing one or more of the selected content items; and sending the generated personalized representation of the brand page for display to the user requesting to view the brand page.
|
11. A computer-implemented method comprising: storing, in a social networking system, a brand page associated with an entity; storing one or more user profiles of users of the social networking system and a set of connections among the users, each user profile including information corresponding to at least one user interest, and wherein one or more of the user profiles includes a connection to the brand page, the information of each user profile including at least one affinity corresponding to the at least one user interest; receiving, from the entity, a plurality of content items for posting to the brand page, at least one of the plurality of content items including an additional content message for accessing one or more additional content items, and another at least one of the plurality of content items including at least one of: information about the entity associated with the brand page, information about a brand of the brand page, and information about a product associated with a brand of the brand page; receiving, from the entity, an association between each content item of the plurality with one or more keywords describing at least one of the brand of the brand page and the information about the product associated with the brand of the brand page, each of the one or more keywords defined by the entity; receiving, at the social networking system, a request to view the brand page from a user having a user profile connected to the brand page stored in the social networking system; accessing the user profile of the social networking system, the user profile associated with the user requesting to view the brand page; selecting, by the social networking system, content items from the plurality of content items, the selecting based on: an affinity of the at least one affinity, the affinity between the at least one user interest and the content items; the one or more keywords associated with each of the plurality of content items, and the information corresponding to the at least one user interest in the user profile associated with the user requesting to view the brand page, wherein at least one of the selected content items includes the additional content message for accessing additional content items; generating, using the selected content items, a personalized representation of the brand page for display in the social networking system to the user requesting to view the brand page, the personalized representation of the brand page containing one or more of the selected content items; and sending the generated personalized representation of the brand page for display to the user requesting to view the brand page. 19. The computer-implemented method of claim 11 , wherein selecting content items from the plurality of content items comprises: matching a characteristic of the user profile associated with the user requesting to view the brand page with the at least one keyword associated with a content item of the plurality of content items.
| 0.738057 |
9,542,936 | 10 | 12 |
10. A system comprising a computer system comprising a processor, memory, and storage, the system being configured to: receive a text search query, the query comprising one or more query words; generate, for each query word in the query, a set of one or more anchor segments from searching metadata corresponding to a plurality of speech recognition processed audio files, the metadata including representations of one or more words detected in the audio files, wherein, for each detected word, the metadata includes a reference to each audio file in which the word was detected, a temporal location of the detected word in the audio file, and a confidence measure for the word as detected within the audio file, where each anchor segment includes a query word, an identifier for an audio file, and a temporal location of the query word within the audio file, where generating anchor segments includes, for each query word, the computer system: determining if the query word is included in a vocabulary of a learning model for a speech recognizer engine of the computer system; when the query word is in the vocabulary, searching the metadata to identify one or more high confidence anchor segments corresponding to the query word; and when the query word is not in the vocabulary: generating a search list of one or more sub-words of the query word, searching the metadata to identify one or more audio files containing at least one of the one or more sub-words to identify one or more anchor segments corresponding to one or more of the sub-words; post-process the one or more anchor segments, the post-process comprising: expanding the one or more anchor segments; sorting the one or more anchor segments; and merging overlapping ones of the one or more anchor segments; and perform speech recognition on the post-processed one or more expanded anchor segments for instances of at least one of the one or more query words using a constrained grammar.
|
10. A system comprising a computer system comprising a processor, memory, and storage, the system being configured to: receive a text search query, the query comprising one or more query words; generate, for each query word in the query, a set of one or more anchor segments from searching metadata corresponding to a plurality of speech recognition processed audio files, the metadata including representations of one or more words detected in the audio files, wherein, for each detected word, the metadata includes a reference to each audio file in which the word was detected, a temporal location of the detected word in the audio file, and a confidence measure for the word as detected within the audio file, where each anchor segment includes a query word, an identifier for an audio file, and a temporal location of the query word within the audio file, where generating anchor segments includes, for each query word, the computer system: determining if the query word is included in a vocabulary of a learning model for a speech recognizer engine of the computer system; when the query word is in the vocabulary, searching the metadata to identify one or more high confidence anchor segments corresponding to the query word; and when the query word is not in the vocabulary: generating a search list of one or more sub-words of the query word, searching the metadata to identify one or more audio files containing at least one of the one or more sub-words to identify one or more anchor segments corresponding to one or more of the sub-words; post-process the one or more anchor segments, the post-process comprising: expanding the one or more anchor segments; sorting the one or more anchor segments; and merging overlapping ones of the one or more anchor segments; and perform speech recognition on the post-processed one or more expanded anchor segments for instances of at least one of the one or more query words using a constrained grammar. 12. The system of claim 10 , wherein the constrained grammar comprises one or more out-of-vocabulary query words of the query, wherein each of the out-of-vocabulary query words is not in the vocabulary.
| 0.877129 |
9,619,488 | 11 | 16 |
11. A method for operating an image recognition program on a computing device having adaptable image search, the method comprising: executing the image recognition program on a processor of the computing device, the computing device being a user computing device; receiving a query from a user, the query comprising text that is typed or converted from speech; receiving a target image within which a search based on the query is to be performed; ranking a plurality of image recognition models by confidence level for performing the search based on at least a comparison between the query and respective text descriptions of the image recognition models, wherein the image recognition models are stored in non-volatile memory of the computing device; determining whether the confidence level of any of the image recognition models is above a confidence threshold; and upon determining that at least one confidence level of the image recognition models is above the confidence threshold, selecting at least one of the image recognition models whose confidence level is above the confidence threshold; performing the search within the target image for a target region of the target image using at least one selected image recognition model locally on the processor; and returning a search result to the user.
|
11. A method for operating an image recognition program on a computing device having adaptable image search, the method comprising: executing the image recognition program on a processor of the computing device, the computing device being a user computing device; receiving a query from a user, the query comprising text that is typed or converted from speech; receiving a target image within which a search based on the query is to be performed; ranking a plurality of image recognition models by confidence level for performing the search based on at least a comparison between the query and respective text descriptions of the image recognition models, wherein the image recognition models are stored in non-volatile memory of the computing device; determining whether the confidence level of any of the image recognition models is above a confidence threshold; and upon determining that at least one confidence level of the image recognition models is above the confidence threshold, selecting at least one of the image recognition models whose confidence level is above the confidence threshold; performing the search within the target image for a target region of the target image using at least one selected image recognition model locally on the processor; and returning a search result to the user. 16. The method of claim 11 , wherein the computing device is a smartphone or tablet.
| 0.961183 |
7,546,233 | 1 | 4 |
1. A succession Chinese character input method comprising the steps of: (a) inputting a Chinese character, and (b) fetching succession Chinese characters relative to the inputted Chinese character from a database of vocabulary of common succession Chinese characters and/or a database of vocabulary of self-edited succession Chinese characters, (c) and/or displaying fetched succession Chinese characters on a display screen, (d) selecting the desired succession Chinese character from the display screen for input; said database of vocabulary of common succession Chinese characters is prepared by collecting common succession Chinese characters subject to the characteristic that there is a successive relationship between every two concatenate Chinese characters in a Chinese sentence; and said database of vocabulary of self-edited succession Chinese characters is prepared by collecting the inputted succession Chinese character which is automatically stored in the database of vocabulary of self-edited succession Chinese characters for further selection when no succession Chinese character was obtained from the database of vocabulary of common succession Chinese characters after input of one Chinese character.
|
1. A succession Chinese character input method comprising the steps of: (a) inputting a Chinese character, and (b) fetching succession Chinese characters relative to the inputted Chinese character from a database of vocabulary of common succession Chinese characters and/or a database of vocabulary of self-edited succession Chinese characters, (c) and/or displaying fetched succession Chinese characters on a display screen, (d) selecting the desired succession Chinese character from the display screen for input; said database of vocabulary of common succession Chinese characters is prepared by collecting common succession Chinese characters subject to the characteristic that there is a successive relationship between every two concatenate Chinese characters in a Chinese sentence; and said database of vocabulary of self-edited succession Chinese characters is prepared by collecting the inputted succession Chinese character which is automatically stored in the database of vocabulary of self-edited succession Chinese characters for further selection when no succession Chinese character was obtained from the database of vocabulary of common succession Chinese characters after input of one Chinese character. 4. The succession Chinese character input method as claimed in claim 1 , wherein said step (c) of displaying fetched succession Chinese characters is to display fetched succession Chinese characters continuously without space, or to display fetched succession Chinese characters with a space or symbol or number or alphabet put in between each two fetched succession Chinese characters, or to display fetched succession Chinese characters by means of a two-dimensional away and to mark the coordinates of the fetched succession Chinese characters with numbers or symbols or alphabets, or to display fetched succession Chinese characters by means of using symbols or numbers or alphabets to mark the locations of the characters, or to display fetched succession Chinese characters by means of dividing into a plurality of pages if the number of said characters is too large to be displayed once, or to display fetched succession Chinese characters by means of any of a variety of other character string displaying methods.
| 0.5 |
9,703,982 | 7 | 12 |
7. An electronic signature system that comprises: a document repository storing (a) a document comprising a plurality of document terms, (b) instructions for generating a recorded assent to the document terms, and (c) metadata indicating a status of the document with respect to a workflow; a configuration module configured to generate the instructions in response to a request received from a document originator, wherein the instructions define a verbal assent and a gesticulated assent; and an interactivity module configured to receive a recorded assent from a document recipient, wherein the recorded assent comprises an audiovisual recording of the verbal assent and the gesticulated assent, and wherein the interactivity module is further configured to authenticate the recorded assent based at least in part on a voiceprint extracted from the verbal assent.
|
7. An electronic signature system that comprises: a document repository storing (a) a document comprising a plurality of document terms, (b) instructions for generating a recorded assent to the document terms, and (c) metadata indicating a status of the document with respect to a workflow; a configuration module configured to generate the instructions in response to a request received from a document originator, wherein the instructions define a verbal assent and a gesticulated assent; and an interactivity module configured to receive a recorded assent from a document recipient, wherein the recorded assent comprises an audiovisual recording of the verbal assent and the gesticulated assent, and wherein the interactivity module is further configured to authenticate the recorded assent based at least in part on a voiceprint extracted from the verbal assent. 12. The electronic signature system of claim 7 , wherein: the verbal assent comprises a phrase indicating that the document recipient has assented to the document terms; and the interactivity module is further configured to compare the voiceprint extracted from the verbal assent with a voiceprint of an authorized document signer.
| 0.604067 |
7,571,485 | 20 | 21 |
20. A computer system for preventing unauthorized network activity, the computer system comprising: a software portion configured to detect an attempt by a computer to communicate with a remote site over a computer network; a software portion configured to query a database containing descriptions of known legitimate sites for an entry describing the remote site, wherein the database has hierarchical entries according to a schema, and a level of the hierarchy describes data gathered by a class of remote sites; a software portion configured to compare a data gathering profile for the site described by the database entry to a request for data made by the remote site; and a software portion configured to determine whether the remote site is to be treated as suspicious based at least on the results of the comparing step.
|
20. A computer system for preventing unauthorized network activity, the computer system comprising: a software portion configured to detect an attempt by a computer to communicate with a remote site over a computer network; a software portion configured to query a database containing descriptions of known legitimate sites for an entry describing the remote site, wherein the database has hierarchical entries according to a schema, and a level of the hierarchy describes data gathered by a class of remote sites; a software portion configured to compare a data gathering profile for the site described by the database entry to a request for data made by the remote site; and a software portion configured to determine whether the remote site is to be treated as suspicious based at least on the results of the comparing step. 21. The computer system of claim 20 further comprising: a software portion configured to compare the database entry describing the remote site to the remote site itself, to determine whether the remote site conforms to the database description, responsive to locating an entry in the database describing the remote site; a software portion configured to determine that the remote site is legitimate, responsive to determining that the remote site conforms to the database description; and a software portion configured to determine that the remote site is suspicious, responsive to determining that the remote site does not conform to the database description.
| 0.565789 |
9,990,429 | 5 | 8 |
5. A computer-implemented process for graphing social connections among entities' names extracted from general Web pages by creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising: using a computing device to perform: receiving a ranked list of social connections between a social graph owner and additional entities obtained from information blocks extracted from the general Web pages, wherein the ranked list was obtained by using a context measure of a relationship and a distance measure of relationship, wherein the context measure of relationship is based on a keyword of a keyword set being found between the name of the social graph owner and a name of an entity in an information block, and wherein the distance measure of relationship is determined by measuring the distance between the name of the social graph owner and a name of an entity; on a display placing the social graph owner in the center of the 2D graph as a center vertex; for each of the additional entities, placing a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit's radius is, the stronger a social connection between the vertex in the orbit and the center vertex is; clustering the vertices into different clusters according to connectivity between the vertices; placing the vertices in the same cluster closer to each other than to vertices in other clusters; placing clusters of vertices so that clusters of vertices do not overlap each other; and using a force-directed model to improve the uniformity of the 2D layout.
|
5. A computer-implemented process for graphing social connections among entities' names extracted from general Web pages by creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising: using a computing device to perform: receiving a ranked list of social connections between a social graph owner and additional entities obtained from information blocks extracted from the general Web pages, wherein the ranked list was obtained by using a context measure of a relationship and a distance measure of relationship, wherein the context measure of relationship is based on a keyword of a keyword set being found between the name of the social graph owner and a name of an entity in an information block, and wherein the distance measure of relationship is determined by measuring the distance between the name of the social graph owner and a name of an entity; on a display placing the social graph owner in the center of the 2D graph as a center vertex; for each of the additional entities, placing a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit's radius is, the stronger a social connection between the vertex in the orbit and the center vertex is; clustering the vertices into different clusters according to connectivity between the vertices; placing the vertices in the same cluster closer to each other than to vertices in other clusters; placing clusters of vertices so that clusters of vertices do not overlap each other; and using a force-directed model to improve the uniformity of the 2D layout. 8. The computer-implemented process of claim 5 wherein the force directed model further comprises a repulsive force between adjacent orbits and wherein each orbit is either radially or tangentially free or both radially and tangentially free so that the orbit can move according to the repulsive force.
| 0.5 |
8,891,908 | 1 | 10 |
1. An image retrieval method, comprising: learning multiple object category classifiers with a processor offline and generating classifications scores of images as the semantic attributes; and performing vocabulary tree based image retrieval using local features with semantic-aware co-indexing to jointly embed two distinct cues offline for near-duplicate image retrieval; and identifying top similar or dissimilar images using multiple semantic attributes; performing semantic-aware online querying; determining: sim ( q , d ) = . 1 S q S d ∑ v i ∈ T ( x i ) , v j ∈ T ( x j ) w v ( v i , v j ) , w v ( v i , v j ) = . idf 2 ( v ) 1 ( v i = v j ) = log 2 ( M M v ) , where i and j are indices, x is tree node, S is a bag of local descriptions, q a query image, d a database image, T is a vocabulary tree, w is word, idf is an inverse document frequency of node v, M is a total number of database images and M v is a number of images containing at least one descriptor that quantizes to a node v.
|
1. An image retrieval method, comprising: learning multiple object category classifiers with a processor offline and generating classifications scores of images as the semantic attributes; and performing vocabulary tree based image retrieval using local features with semantic-aware co-indexing to jointly embed two distinct cues offline for near-duplicate image retrieval; and identifying top similar or dissimilar images using multiple semantic attributes; performing semantic-aware online querying; determining: sim ( q , d ) = . 1 S q S d ∑ v i ∈ T ( x i ) , v j ∈ T ( x j ) w v ( v i , v j ) , w v ( v i , v j ) = . idf 2 ( v ) 1 ( v i = v j ) = log 2 ( M M v ) , where i and j are indices, x is tree node, S is a bag of local descriptions, q a query image, d a database image, T is a vocabulary tree, w is word, idf is an inverse document frequency of node v, M is a total number of database images and M v is a number of images containing at least one descriptor that quantizes to a node v. 10. The method of claim 1 , comprising applying a Total Variance Distance (TVD) for two images d m and d n , to measure the semantic distance between their partial probability vectors p: TVD ( d m , d n ) = ∑ c = 1 C p c ( d m ) - p c ( d n ) .
| 0.68599 |
8,370,438 | 6 | 10 |
6. An information managing method for a server for storing message information of messages of a user in a storage area and for allowing viewing of the messages in response to instructions of another user, comprising: receiving the messages of the user from a first game device via a network, the messages including only a plurality of predetermined useable items that are stored in a message preparation list and being restricted from including other items different than the plurality of predetermined useable items for limiting content of the messages, each of the messages including multiple ones of the plurality of predetermined usable items that are each independently selected by the user for enabling the content of the messages to be user-defined, each of the plurality of predetermined usable items of the messages being received in a first language; converting each of the plurality of predetermined usable items into a second language different than the first language; receiving the instructions of the another user for viewing the messages of the user; detecting a handle name of the another user in the instructions in response to receiving the instructions; confirming whether the handle name of the another user is stored in a friend list of the user, the friend list storing handle names of users who are allowed to view the messages; and transmitting one of the messages of the user to a second game device of the another user via the network when each of the instructions is received and it is confirmed that the handle name of the another user is stored in the friend list, the one of the messages of the user that is transmitted to the another user including the plurality of predetermined usable items that are converted into the second language, wherein the plurality of predetermined usable items include a plurality of words.
|
6. An information managing method for a server for storing message information of messages of a user in a storage area and for allowing viewing of the messages in response to instructions of another user, comprising: receiving the messages of the user from a first game device via a network, the messages including only a plurality of predetermined useable items that are stored in a message preparation list and being restricted from including other items different than the plurality of predetermined useable items for limiting content of the messages, each of the messages including multiple ones of the plurality of predetermined usable items that are each independently selected by the user for enabling the content of the messages to be user-defined, each of the plurality of predetermined usable items of the messages being received in a first language; converting each of the plurality of predetermined usable items into a second language different than the first language; receiving the instructions of the another user for viewing the messages of the user; detecting a handle name of the another user in the instructions in response to receiving the instructions; confirming whether the handle name of the another user is stored in a friend list of the user, the friend list storing handle names of users who are allowed to view the messages; and transmitting one of the messages of the user to a second game device of the another user via the network when each of the instructions is received and it is confirmed that the handle name of the another user is stored in the friend list, the one of the messages of the user that is transmitted to the another user including the plurality of predetermined usable items that are converted into the second language, wherein the plurality of predetermined usable items include a plurality of words. 10. The method as set forth in claim 6 , further comprising: receiving a designation of the second language for each of the messages from the first game device; and storing each of the messages of the user in the second language after converting the plurality of predetermined usable items of each of the messages into the second language.
| 0.5 |
9,367,606 | 1 | 13 |
1. A method of presenting documents to a user, comprising: a. assigning relevance scores to a plurality of the documents, by a computer programmed to compute relevance scores based on a relevance model using one or more user input events, wherein at least one of the one or more user input events is an active selection of a user input feature about at least one document and is received outside a context of a presentation of search results of a search, the one or more user input events comprising input about the at least one document from at least one user; and b. presenting the documents to the user according to the relevance scores.
|
1. A method of presenting documents to a user, comprising: a. assigning relevance scores to a plurality of the documents, by a computer programmed to compute relevance scores based on a relevance model using one or more user input events, wherein at least one of the one or more user input events is an active selection of a user input feature about at least one document and is received outside a context of a presentation of search results of a search, the one or more user input events comprising input about the at least one document from at least one user; and b. presenting the documents to the user according to the relevance scores. 13. The method of claim 1 , wherein the one or more user input events comprise one of: the relevance of the document to a query, the bias of the user regarding the document, and the relevance of the document to a subject area.
| 0.657576 |
7,937,687 | 1 | 6 |
1. A method comprising: receiving, at a device, selection of a voice extensible markup language (VXML) element for a VXML document, where receiving the selection includes at least one of: receiving selection of at least one field element for the VXML document, receiving selection of at least one field type for the field element, or receiving specification of an application name for the VXML document; receiving, from a user, a user-selected design document at the device; receiving, from the user, selection of a dialog design portion of the user-selected design document at the device; parsing the dialog design portion of the design document with the device into at least one VXML element based on the received selection of the VXML element; and creating the VXML document with the device that includes the parsed VXML element.
|
1. A method comprising: receiving, at a device, selection of a voice extensible markup language (VXML) element for a VXML document, where receiving the selection includes at least one of: receiving selection of at least one field element for the VXML document, receiving selection of at least one field type for the field element, or receiving specification of an application name for the VXML document; receiving, from a user, a user-selected design document at the device; receiving, from the user, selection of a dialog design portion of the user-selected design document at the device; parsing the dialog design portion of the design document with the device into at least one VXML element based on the received selection of the VXML element; and creating the VXML document with the device that includes the parsed VXML element. 6. The method of claim 1 , further comprising: storing the VXML document.
| 0.857977 |
7,565,371 | 17 | 18 |
17. The system of claim 10 , wherein the plurality of files comprise a model of a workflow, each file including a portion of the model wherein the at least on reference relates at least one element of the portion of the model with another element of another portion of the model.
|
17. The system of claim 10 , wherein the plurality of files comprise a model of a workflow, each file including a portion of the model wherein the at least on reference relates at least one element of the portion of the model with another element of another portion of the model. 18. The system of claim 17 , wherein the at least one HTML file comprises an interactive representation of the model.
| 0.5 |
6,154,156 | 16 | 22 |
16. A message processing method of sending and receiving a message composed of one or more elements between different kinds of devices and processing the message, comprising the steps of: holding a parse tree generated from syntax descriptions defining structure of a message sent or received; as message data to be processed is applied, scanning said parse tree to encode and decode a value and outputting encoded and decoded values; processing a preamble field of a message for use in indicating whether an element exists or not in message data sent or received; and processing an index field of a message for use in indicating what number of element is selected in message data whose one of a plurality of elements is selected to be sent or received.
|
16. A message processing method of sending and receiving a message composed of one or more elements between different kinds of devices and processing the message, comprising the steps of: holding a parse tree generated from syntax descriptions defining structure of a message sent or received; as message data to be processed is applied, scanning said parse tree to encode and decode a value and outputting encoded and decoded values; processing a preamble field of a message for use in indicating whether an element exists or not in message data sent or received; and processing an index field of a message for use in indicating what number of element is selected in message data whose one of a plurality of elements is selected to be sent or received. 22. The message processing method as set forth in claim 16, wherein in said preamble processing step, the parse tree is stored in a continuos region on a storage region, and said message decoding step comprises the steps of: when message data is applied, first reading and storing an index field, decoding the contents of the index field to obtain an index value, storing an address of a node being currently scanned in a variable indicative of an address of a node of the parse tree, and scanning a node of the parse tree to be referred to by a sum of said variable and a product of the size of a storage region necessary for holding one node of the parse tree and the index value to decode the element in question.
| 0.822333 |
9,582,554 | 15 | 20 |
15. A computer implemented system, comprising: one or more computer processors; and a non-transitory computer-readable storage medium comprising instructions, that when executed, control the one or more computer processors to be configured for: receiving a table containing a plurality of entries, each entry storing plain text; receiving an entity database containing an entity collection, the entity collection including a plurality of entity tags that belong to a category, wherein an entity tag from the plurality of entity tags is linked with metadata information from an open access database; determining that a set of entries from the plurality of entries belong to the category; matching an entry in the set of entries to the entity tag; linking the entity tag to the entry; searching, by the processor, an available resource other than the open access database to link additional data related to the entry according to the entity tag; selecting the additional data from a canvas overlying the available resource; and enriching, by the processor, the table to include the additional data in a new column.
|
15. A computer implemented system, comprising: one or more computer processors; and a non-transitory computer-readable storage medium comprising instructions, that when executed, control the one or more computer processors to be configured for: receiving a table containing a plurality of entries, each entry storing plain text; receiving an entity database containing an entity collection, the entity collection including a plurality of entity tags that belong to a category, wherein an entity tag from the plurality of entity tags is linked with metadata information from an open access database; determining that a set of entries from the plurality of entries belong to the category; matching an entry in the set of entries to the entity tag; linking the entity tag to the entry; searching, by the processor, an available resource other than the open access database to link additional data related to the entry according to the entity tag; selecting the additional data from a canvas overlying the available resource; and enriching, by the processor, the table to include the additional data in a new column. 20. The computer implemented system of claim 15 , wherein receiving the table comprises: detecting an input representative of selecting an area of a web page; determining that the area of the web page substantially contains the table; and scraping the table from the web page.
| 0.5 |
9,468,848 | 5 | 6 |
5. The method of claim 1 , wherein the first gesture dictionary is associated an identifier, identifier identifying when to implement the first gesture dictionary.
|
5. The method of claim 1 , wherein the first gesture dictionary is associated an identifier, identifier identifying when to implement the first gesture dictionary. 6. The method of claim 5 , wherein the identifier is at least one of an operating system, an application, a user, a feature of a user, a location, a type of application, a hardware configuration, a software configuration, a culture, current user, geography, demography, linguistic, culture, or a style.
| 0.5 |
9,152,883 | 17 | 28 |
17. A system for increasing the accuracy of optical character recognition (OCR) for at least one item, comprising: at least one processor, wherein the at least one processor is configured to perform: obtaining OCR results of OCR scanning from at least one OCR module; creating at least one OCR seed using at least a portion of the OCR results, the at least one OCR seed comprising a plurality of imagelets corresponding to each character identified in the at least a portion of the OCR results, wherein the at least one OCR seed is cleaned by selecting imagelets similar to one another for each character identified in the at least a portion of the OCR results; creating at least one OCR learn set using at least a portion of the OCR seed; comparing the at least one OCR learn set to each imagelet to create at least one mismatch distribution of the at least one OCR learn set compared to each imagelet, the at least one mismatch distribution comprising at least one confidence rating including a confidence score for the imagelet compared to at least one possible character; and applying the OCR learn set and the at least one mismatch distribution to the at least one item to obtain additional OCR results such that only possible characters having a confidence score higher than a threshold are considered when applying the at least one mismatch distribution to obtain the additional OCR results.
|
17. A system for increasing the accuracy of optical character recognition (OCR) for at least one item, comprising: at least one processor, wherein the at least one processor is configured to perform: obtaining OCR results of OCR scanning from at least one OCR module; creating at least one OCR seed using at least a portion of the OCR results, the at least one OCR seed comprising a plurality of imagelets corresponding to each character identified in the at least a portion of the OCR results, wherein the at least one OCR seed is cleaned by selecting imagelets similar to one another for each character identified in the at least a portion of the OCR results; creating at least one OCR learn set using at least a portion of the OCR seed; comparing the at least one OCR learn set to each imagelet to create at least one mismatch distribution of the at least one OCR learn set compared to each imagelet, the at least one mismatch distribution comprising at least one confidence rating including a confidence score for the imagelet compared to at least one possible character; and applying the OCR learn set and the at least one mismatch distribution to the at least one item to obtain additional OCR results such that only possible characters having a confidence score higher than a threshold are considered when applying the at least one mismatch distribution to obtain the additional OCR results. 28. The system of claim 17 , wherein the OCR learn set is created by obtaining information related to the image representation for each character and the variability of the similar imagelets from the image representation for each character in the at least one OCR cleaned seed.
| 0.524055 |
9,436,684 | 1 | 6 |
1. A method for validating documentation for at least one software functionality, comprising: determining, by at least one processor, one or more issues in one or more of a plurality of documentation topics that document at least one software functionality based at least upon applying one or more business rules to the one or more of the plurality of documentation topics, including one or more of: applying the one or more business rules to metadata of the one or more of the plurality of documentation topics to cross-reference the metadata of the one or more of the plurality of documentation topics with a semantic model for the at least one software functionality, applying the one or more business rules to content of the one or more of the plurality of documentation topics to cross-reference the content of the one or more of the plurality of documentation topics with the semantic model for the at least one software functionality, and applying the one or more business rules to metadata of the one or more of the plurality of documentation topics and metadata of one or more related documentation topics to test consistency between the metadata of the one or more of the plurality of documentation topics with the metadata of the one or more related documentation topics; and responsive to determining the one or more issues, inserting, by the at least one processor, one or more entries into an issues report, wherein the one or more entries include information regarding the one or more issues.
|
1. A method for validating documentation for at least one software functionality, comprising: determining, by at least one processor, one or more issues in one or more of a plurality of documentation topics that document at least one software functionality based at least upon applying one or more business rules to the one or more of the plurality of documentation topics, including one or more of: applying the one or more business rules to metadata of the one or more of the plurality of documentation topics to cross-reference the metadata of the one or more of the plurality of documentation topics with a semantic model for the at least one software functionality, applying the one or more business rules to content of the one or more of the plurality of documentation topics to cross-reference the content of the one or more of the plurality of documentation topics with the semantic model for the at least one software functionality, and applying the one or more business rules to metadata of the one or more of the plurality of documentation topics and metadata of one or more related documentation topics to test consistency between the metadata of the one or more of the plurality of documentation topics with the metadata of the one or more related documentation topics; and responsive to determining the one or more issues, inserting, by the at least one processor, one or more entries into an issues report, wherein the one or more entries include information regarding the one or more issues. 6. The method of claim 1 , wherein applying the one or more business rules to metadata of the one or more of the plurality of documentation topics and metadata of one or more related documentation topics further comprises: responsive to determining that the one or more of the plurality of documentation topics is provided by a model developer, determining whether the one or more related documentation topics is provided by an information developer.
| 0.609375 |
7,739,102 | 1 | 4 |
1. A computer storage medium comprising computer executable instructions for performing a computer-implemented method for domain-independent natural language understanding, comprising the steps of: forming pairs of words and/or phrases in independent phrases in a sentence, wherein each word and/or phrase is paired with every other word and/or phrase; determining meanings for the words and/or phrases; assigning a numeric code from the pre-existing class and category structure that uniquely identifies semantic concepts to each meaning; adjusting the numeric codes using a weighting component; storing the adjusted numeric codes that uniquely identify semantic concepts in a computer memory; comparing the adjusted numeric codes that uniquely identify semantic concepts of each word and/or phrase with each adjusted numeric code that uniquely identifies the semantic concept of the other word and/or phrase in the pair; comparing syntactically identical sentences with a potential idiom that changes adjusted numeric codes that uniquely identify semantic concepts depending on the context using an ontology; determining whether a potential idiom is identified and employing appropriate class and category structure to calculate a first adjusted numeric code total, wherein said first adjusted numeric code total corresponds to the best word and/or phrase pairings; determining an overall-adjusted numeric code total based on said first adjusted numeric code total by comparing remaining words in a sentence and before selecting the pairs of adjusted numeric codes that uniquely identify semantic concepts with the best relationships based on numerical comparisons; selecting the pairs of adjusted numeric codes that uniquely indentify semantic concepts with the best relationships based on numerical comparisons; storing the pairs in the computer memory; combining highly-related pairs with other highly-related pairs to form longer groups of adjusted numeric codes that uniquely identify semantic concepts; exchanging adjusted numeric codes that uniquely identify semantic concepts for the longer groups with adjusted numeric codes that uniquely identify semantic concepts having a weaker relationship to determine if the exchanged adjusted numeric codes that uniquely identify semantic concepts provide an overall stronger relationship based on numerical comparisons; forming longer and longer groups until the adjusted numeric codes that uniquely identify semantic concepts are selected in context for all words and phrases in the sentence; and relating the adjusted numeric codes that uniquely identify semantic concepts to words and phrases.
|
1. A computer storage medium comprising computer executable instructions for performing a computer-implemented method for domain-independent natural language understanding, comprising the steps of: forming pairs of words and/or phrases in independent phrases in a sentence, wherein each word and/or phrase is paired with every other word and/or phrase; determining meanings for the words and/or phrases; assigning a numeric code from the pre-existing class and category structure that uniquely identifies semantic concepts to each meaning; adjusting the numeric codes using a weighting component; storing the adjusted numeric codes that uniquely identify semantic concepts in a computer memory; comparing the adjusted numeric codes that uniquely identify semantic concepts of each word and/or phrase with each adjusted numeric code that uniquely identifies the semantic concept of the other word and/or phrase in the pair; comparing syntactically identical sentences with a potential idiom that changes adjusted numeric codes that uniquely identify semantic concepts depending on the context using an ontology; determining whether a potential idiom is identified and employing appropriate class and category structure to calculate a first adjusted numeric code total, wherein said first adjusted numeric code total corresponds to the best word and/or phrase pairings; determining an overall-adjusted numeric code total based on said first adjusted numeric code total by comparing remaining words in a sentence and before selecting the pairs of adjusted numeric codes that uniquely identify semantic concepts with the best relationships based on numerical comparisons; selecting the pairs of adjusted numeric codes that uniquely indentify semantic concepts with the best relationships based on numerical comparisons; storing the pairs in the computer memory; combining highly-related pairs with other highly-related pairs to form longer groups of adjusted numeric codes that uniquely identify semantic concepts; exchanging adjusted numeric codes that uniquely identify semantic concepts for the longer groups with adjusted numeric codes that uniquely identify semantic concepts having a weaker relationship to determine if the exchanged adjusted numeric codes that uniquely identify semantic concepts provide an overall stronger relationship based on numerical comparisons; forming longer and longer groups until the adjusted numeric codes that uniquely identify semantic concepts are selected in context for all words and phrases in the sentence; and relating the adjusted numeric codes that uniquely identify semantic concepts to words and phrases. 4. The method of claim 1 , wherein selecting step includes selecting a same word, with different meanings (expressed as numeric codes that uniquely identify semantic concepts), multiple times, if more than one pair has a strong relationship.
| 0.5 |
9,418,331 | 20 | 21 |
20. The apparatus of claim 12 , wherein the at least one processor configured to provide supervisory bias signals is configured to: provide positive supervisory signals below a firing threshold to create a bias for firing on a desired output layer neuron.
|
20. The apparatus of claim 12 , wherein the at least one processor configured to provide supervisory bias signals is configured to: provide positive supervisory signals below a firing threshold to create a bias for firing on a desired output layer neuron. 21. The apparatus of claim 20 , wherein the at least one processor configured to provide supervisory bias signals is further configured to: provide negative supervisory signals to create a bias for preventing firing on an non-desired output layer neuron.
| 0.5 |
9,135,267 | 1 | 4 |
1. A method of establishing a bridge between two documents on a server, comprising: receiving, at the server, a first document represented by a hierarchical data structure model having a plurality of first nodes; generating, by a processor, a second document represented by a flat data structure model having a plurality of flat data structure elements, the second document being an online collaboratively editable document; and establishing, by the processor, the bridge between the first document and the second document, including: linking the plurality of first nodes to the plurality of flat data structure elements, such that at least a portion of contents of the plurality of first nodes is copied to the plurality of flat data structure elements; and maintaining the bridge, such that an edit to the first document, represented in at least one of the first nodes, is applied to at least one corresponding flat data structure element, thereby applying the edit to the second document.
|
1. A method of establishing a bridge between two documents on a server, comprising: receiving, at the server, a first document represented by a hierarchical data structure model having a plurality of first nodes; generating, by a processor, a second document represented by a flat data structure model having a plurality of flat data structure elements, the second document being an online collaboratively editable document; and establishing, by the processor, the bridge between the first document and the second document, including: linking the plurality of first nodes to the plurality of flat data structure elements, such that at least a portion of contents of the plurality of first nodes is copied to the plurality of flat data structure elements; and maintaining the bridge, such that an edit to the first document, represented in at least one of the first nodes, is applied to at least one corresponding flat data structure element, thereby applying the edit to the second document. 4. The method of claim 1 , wherein maintaining the bridge further comprises applying an edit to the second document, represented in at least one of the flat data structure elements, to at least one corresponding first node, thereby applying the edit to the first document.
| 0.604651 |
9,672,551 | 3 | 4 |
3. The system of claim 1 , wherein generating of the structured description of the entry includes parsing the textual description based on a delimiter included in the textual description received from the client device.
|
3. The system of claim 1 , wherein generating of the structured description of the entry includes parsing the textual description based on a delimiter included in the textual description received from the client device. 4. The system of claim 3 , wherein the parsing of the textual description includes: grouping two or more words included in the textual description of the entry into a group, at least some of the two or more words being adjacent in the textual description; and determining that the group of the two or more words forms a recognizable phrase, wherein the generating of the structured description uses the group of the two or more words as a recognizable phrase.
| 0.5 |
7,979,469 | 11 | 20 |
11. A handheld electronic device comprising: an input apparatus comprising a multiple-axis input device; an output apparatus; and a processor apparatus including a processor and a memory, said memory having a messaging application executable by said processor, said messaging application comprising one or more routines adapted to: receive a command to reply to or forward a message received by said handheld electronic device, said received message being included within a message thread; scan said message thread and identify a plurality of words in said message thread; generate one or more word lists that include said words; display said one or more word lists on said output apparatus; detect an input from the multiple-axis input device as a selection of a selected one of said words from said one or more word lists; and enter said selected one of said words into a new message, said new message being displayed on said output apparatus.
|
11. A handheld electronic device comprising: an input apparatus comprising a multiple-axis input device; an output apparatus; and a processor apparatus including a processor and a memory, said memory having a messaging application executable by said processor, said messaging application comprising one or more routines adapted to: receive a command to reply to or forward a message received by said handheld electronic device, said received message being included within a message thread; scan said message thread and identify a plurality of words in said message thread; generate one or more word lists that include said words; display said one or more word lists on said output apparatus; detect an input from the multiple-axis input device as a selection of a selected one of said words from said one or more word lists; and enter said selected one of said words into a new message, said new message being displayed on said output apparatus. 20. The handheld electronic device according to claim 11 , wherein the input from the multiple-axis input device comprises a scrolling input plus a selection input.
| 0.801932 |
7,657,519 | 8 | 12 |
8. A computer-readable medium having stored thereon computer-executable instructions for performing a method of analyzing a plurality of search sessions to identify intent-based clusters therein, each session comprising at least one received query from a user and a corresponding set of returned search results, each set of search results including or referring to at least one piece of content, each cluster representing a group of similar search sessions that are perceived as representing a common intent of a plurality of different users and that can be mapped to a common set of search results, the method comprising: identifying for each search session each received query thereof, the corresponding set of search results, and whether any particular piece of content of the search results was acceptable to the user as responsive to the corresponding search session; and grouping search sessions into clusters based on the commonality of judgments of a plurality of different users about a search result that is common to the user's respective search sessions, wherein each of said clusters includes search queries and search results, such grouping comprising: constructing a table with a plurality of entries therein, each entry representing a unique pair of sessions such that each session is paired with every other session a single time in the table; judging, for each entry of the table, a strength of commonality of the pair of sessions thereof; reordering the entries in the table according to decreasing strength; and reviewing each entry in the table as reordered to decide based on the judged strength thereof whether to assign each session thereof to an intent-based cluster.
|
8. A computer-readable medium having stored thereon computer-executable instructions for performing a method of analyzing a plurality of search sessions to identify intent-based clusters therein, each session comprising at least one received query from a user and a corresponding set of returned search results, each set of search results including or referring to at least one piece of content, each cluster representing a group of similar search sessions that are perceived as representing a common intent of a plurality of different users and that can be mapped to a common set of search results, the method comprising: identifying for each search session each received query thereof, the corresponding set of search results, and whether any particular piece of content of the search results was acceptable to the user as responsive to the corresponding search session; and grouping search sessions into clusters based on the commonality of judgments of a plurality of different users about a search result that is common to the user's respective search sessions, wherein each of said clusters includes search queries and search results, such grouping comprising: constructing a table with a plurality of entries therein, each entry representing a unique pair of sessions such that each session is paired with every other session a single time in the table; judging, for each entry of the table, a strength of commonality of the pair of sessions thereof; reordering the entries in the table according to decreasing strength; and reviewing each entry in the table as reordered to decide based on the judged strength thereof whether to assign each session thereof to an intent-based cluster. 12. The medium of claim 8 wherein the strength of commonality of the pair of sessions is based at least in part on whether the pair of sessions had the same or a similar query.
| 0.876751 |
9,110,922 | 1 | 4 |
1. A method for associating semantically-related items of a plurality of item types, comprising: (a) embedding, by one or more computers, training items of the plurality of item types in a joint embedding space having more than two dimensions configured in a memory coupled to at least one processor, wherein each of the dimensions is defined by a real-valued axis, wherein each embedded training item corresponds to a respective location in the joint embedding space, wherein said each embedded training item is represented by a respective vector of real numbers corresponding to the respective location, and wherein each of the real numbers of the vector corresponds to a mapping of the respective location to one of the dimensions; (b) learning, by the one or more computers, one or more mappings into the joint embedding space for each of the plurality of item types to create a trained joint embedding space and one or more learned mappings, the learning including: selecting, based on known relationships between the training items, a related pair of the training items that includes a first item and a second item, wherein the first item and the second item are separated by a first distance in the joint embedding space; selecting a third item that is less related to the first item than the second item, but is closer to the first item than the second item in the joint embedding space; and adjusting a mapping function to increase a distance between the first item and the third item relative to a distance between the first item and the second item; and (c) associating, by the one or more computers, one or more of the embedded training items with a first item based upon a distance in the trained joint embedding space from the first item to each said associated embedded training items, wherein each said distance is determined based upon a first vector of real numbers corresponding to the first item and a second vector of real numbers corresponding to a respective one of the associated embedded training items.
|
1. A method for associating semantically-related items of a plurality of item types, comprising: (a) embedding, by one or more computers, training items of the plurality of item types in a joint embedding space having more than two dimensions configured in a memory coupled to at least one processor, wherein each of the dimensions is defined by a real-valued axis, wherein each embedded training item corresponds to a respective location in the joint embedding space, wherein said each embedded training item is represented by a respective vector of real numbers corresponding to the respective location, and wherein each of the real numbers of the vector corresponds to a mapping of the respective location to one of the dimensions; (b) learning, by the one or more computers, one or more mappings into the joint embedding space for each of the plurality of item types to create a trained joint embedding space and one or more learned mappings, the learning including: selecting, based on known relationships between the training items, a related pair of the training items that includes a first item and a second item, wherein the first item and the second item are separated by a first distance in the joint embedding space; selecting a third item that is less related to the first item than the second item, but is closer to the first item than the second item in the joint embedding space; and adjusting a mapping function to increase a distance between the first item and the third item relative to a distance between the first item and the second item; and (c) associating, by the one or more computers, one or more of the embedded training items with a first item based upon a distance in the trained joint embedding space from the first item to each said associated embedded training items, wherein each said distance is determined based upon a first vector of real numbers corresponding to the first item and a second vector of real numbers corresponding to a respective one of the associated embedded training items. 4. The method of claim 1 , wherein the adjusting step (iii) further comprises updating a respective vector of real numbers to include one or more changed location of the third item.
| 0.778729 |
8,267,979 | 1 | 2 |
1. A dynamic spine stabilization device comprising: a bone anchor having a housing and a longitudinal axis; a cavity in the housing coaxial with the longitudinal axis; a post received in the cavity; the post having a retainer at a distal end and a mount at a proximal end; the retainer being secured in a pocket of the cavity of the housing such that the post may be deflected within the housing; a spring positioned in the cavity of the housing between the post and the housing such that deflection of the post causes compression of the spring in a direction parallel to the longitudinal axis; and wherein the spring applies a force upon the post pushing the post towards a position in which the post is coaxial with the longitudinal axis.
|
1. A dynamic spine stabilization device comprising: a bone anchor having a housing and a longitudinal axis; a cavity in the housing coaxial with the longitudinal axis; a post received in the cavity; the post having a retainer at a distal end and a mount at a proximal end; the retainer being secured in a pocket of the cavity of the housing such that the post may be deflected within the housing; a spring positioned in the cavity of the housing between the post and the housing such that deflection of the post causes compression of the spring in a direction parallel to the longitudinal axis; and wherein the spring applies a force upon the post pushing the post towards a position in which the post is coaxial with the longitudinal axis. 2. The device of claim 1 , wherein said spring comprises a plurality of lever arms arranged in a circle.
| 0.873171 |
8,645,383 | 1 | 3 |
1. A method for collecting information and enriching said information, said method comprising: (a) providing a note taking function for allowing a user to create a text note on a user mobile device, wherein said created note is stored; (b) providing an identification function to capture user's interests and needs from a plurality of sources of experience data to which said user is linked, wherein said sources of experience data originate from one or more social networks; (c) providing a template function for defining and downloading onto said user mobile device one or more templates for organizing data capture and visualizing said organized data on said user mobile device and wherein said templates are stored; (d) providing a pre-selection or suggestion function running on said user mobile device for selecting one or more of said stored templates based on said identified user interests and needs and based on said created notes; (e) enriching said created text note with captured experience data obtained from said identification function and based on said pre-selected template; (f) performing a quantitative analysis of said enriched note based on said pre-selected template; and (g) organizing and visualizing said quantified enriched note on said user mobile device based on said pre-selected template.
|
1. A method for collecting information and enriching said information, said method comprising: (a) providing a note taking function for allowing a user to create a text note on a user mobile device, wherein said created note is stored; (b) providing an identification function to capture user's interests and needs from a plurality of sources of experience data to which said user is linked, wherein said sources of experience data originate from one or more social networks; (c) providing a template function for defining and downloading onto said user mobile device one or more templates for organizing data capture and visualizing said organized data on said user mobile device and wherein said templates are stored; (d) providing a pre-selection or suggestion function running on said user mobile device for selecting one or more of said stored templates based on said identified user interests and needs and based on said created notes; (e) enriching said created text note with captured experience data obtained from said identification function and based on said pre-selected template; (f) performing a quantitative analysis of said enriched note based on said pre-selected template; and (g) organizing and visualizing said quantified enriched note on said user mobile device based on said pre-selected template. 3. The method as set forth in claim 1 , wherein said note is communicated over a wireless network.
| 0.840909 |
7,817,630 | 13 | 19 |
13. A communications node comprising: a first dictionary containing string expressions for use in message compression and decompression; a dynamic dictionary that stores expressions for use in the message compression and decompression for exclusive use in the communications node; and a compression/decompression module that receives a message containing individual expressions, the compression/decompression module further determining all matches between the individual expressions of the message and corresponding expressions in the first dictionary, and yet further, among the determined matches of individual expressions, determining different sequences of matches of individual expressions which are contiguous to each other in the message, each of the different matching sequences including one or more contiguous individual expressions and the different sequences which are determined to be contiguous to each other forming at least one new combined expression, and that creates in the dynamic dictionary the at least one new combined expression.
|
13. A communications node comprising: a first dictionary containing string expressions for use in message compression and decompression; a dynamic dictionary that stores expressions for use in the message compression and decompression for exclusive use in the communications node; and a compression/decompression module that receives a message containing individual expressions, the compression/decompression module further determining all matches between the individual expressions of the message and corresponding expressions in the first dictionary, and yet further, among the determined matches of individual expressions, determining different sequences of matches of individual expressions which are contiguous to each other in the message, each of the different matching sequences including one or more contiguous individual expressions and the different sequences which are determined to be contiguous to each other forming at least one new combined expression, and that creates in the dynamic dictionary the at least one new combined expression. 19. The communications node claimed in claim 13 , wherein the communications node is a receiving node, and the compression/decompression module is a decompression module.
| 0.749263 |
8,656,264 | 2 | 7 |
2. A computer-implemented method of determining a context of a term in a web page, the method comprising the following operations performed by one or more processors: identifying the term in a first web page; finding the term in an index of terms; identifying at least one related word associated with the term in the index of terms, the related word being likely to appear with the term in a given context; finding the related word in the first web page; and creating a query for the term, the query including at least the term and the related word; generating a hyperlink associated with the term in the first web page; and providing navigation to a second web page comprising content items derived from search results using the query.
|
2. A computer-implemented method of determining a context of a term in a web page, the method comprising the following operations performed by one or more processors: identifying the term in a first web page; finding the term in an index of terms; identifying at least one related word associated with the term in the index of terms, the related word being likely to appear with the term in a given context; finding the related word in the first web page; and creating a query for the term, the query including at least the term and the related word; generating a hyperlink associated with the term in the first web page; and providing navigation to a second web page comprising content items derived from search results using the query. 7. The method of claim 2 , wherein the at least one related word includes a plurality of related words.
| 0.789796 |
7,584,161 | 12 | 18 |
12. A computer-based method using business process logic to capture, structure and standardize subject matter expertise, processes, tasks and activities into a business process model, the method comprising: providing a graphical user interface via a web browser, including a plurality of objects, the objects being associated with activities and sub-activities; defining a business process via the web browser based on the objects by: updating the graphical user interface in response to a manipulation of at least one object from the plurality of objects, the updating being performed via the web browser; and limiting the manipulation of the at least one object based on a set of predetermined criteria; and displaying the defined business process via the web browser, the defined business process based on the updating and the limiting.
|
12. A computer-based method using business process logic to capture, structure and standardize subject matter expertise, processes, tasks and activities into a business process model, the method comprising: providing a graphical user interface via a web browser, including a plurality of objects, the objects being associated with activities and sub-activities; defining a business process via the web browser based on the objects by: updating the graphical user interface in response to a manipulation of at least one object from the plurality of objects, the updating being performed via the web browser; and limiting the manipulation of the at least one object based on a set of predetermined criteria; and displaying the defined business process via the web browser, the defined business process based on the updating and the limiting. 18. The method of claim 12 , wherein during the manipulation of the at least one object, a user is prompted with suggested names for the at least one object after entry of one character of an object name.
| 0.542601 |
8,041,021 | 25 | 27 |
25. A computer program product comprising computer-executable instructions embodied in a computer-readable medium for performing steps comprising: (a) receiving a signaling message that contains a global title address (GTA); (b) selecting a GTT mode from a plurality of different GTT modes based on an attribute of the received signaling message, wherein at least some of the different GTT modes use different combinations of address parameters associated with received signaling messages to search a GTT database, wherein each of the different GTT modes translates at least a signaling connection control part (SCCP) parameter into at least a message transfer part (MTP) destination point code; and (c) searching the GTT database using a combination of address parameters of the received signaling message specific to the selected GTT mode.
|
25. A computer program product comprising computer-executable instructions embodied in a computer-readable medium for performing steps comprising: (a) receiving a signaling message that contains a global title address (GTA); (b) selecting a GTT mode from a plurality of different GTT modes based on an attribute of the received signaling message, wherein at least some of the different GTT modes use different combinations of address parameters associated with received signaling messages to search a GTT database, wherein each of the different GTT modes translates at least a signaling connection control part (SCCP) parameter into at least a message transfer part (MTP) destination point code; and (c) searching the GTT database using a combination of address parameters of the received signaling message specific to the selected GTT mode. 27. The computer program product of claim 25 wherein receiving a signaling message includes receiving a signaling connection control part (SCCP) message.
| 0.862657 |
9,954,890 | 54 | 55 |
54. The method of claim 47 , wherein the one or more virtual machines are configured based on at least data associated with the PDF document in response to the one or more examined portions of the PDF documents being determined to include the one or more suspicious characteristics.
|
54. The method of claim 47 , wherein the one or more virtual machines are configured based on at least data associated with the PDF document in response to the one or more examined portions of the PDF documents being determined to include the one or more suspicious characteristics. 55. The method of claim 54 , wherein the one or more virtual machines are configured based on one or more specification version numbers of the PDF document.
| 0.5 |
8,949,878 | 44 | 45 |
44. The device of claim 43 , where the learning module includes circuitry configured to store predefined parameters and to permit user-modification of the predefined parameters.
|
44. The device of claim 43 , where the learning module includes circuitry configured to store predefined parameters and to permit user-modification of the predefined parameters. 45. The device of claim 44 , where the device further includes a cursor mechanism to permit user to identify regions, and where the learning module is to permit user modification of the predefined parameters based on regions identified using the cursor mechanism.
| 0.5 |
8,776,094 | 11 | 12 |
11. The one or more computer-readable storage memory of claim 7 , the one or more API modules comprising an object-oriented class, the one or more metadata files configured to describe the object-oriented class in an object-oriented manner.
|
11. The one or more computer-readable storage memory of claim 7 , the one or more API modules comprising an object-oriented class, the one or more metadata files configured to describe the object-oriented class in an object-oriented manner. 12. The one or more computer-readable storage memory of claim 11 , the object-oriented class comprising a file class.
| 0.5 |
9,760,556 | 3 | 6 |
3. The system of claim 1 , wherein the snippets include metadata associated with their respective source electronic documents.
|
3. The system of claim 1 , wherein the snippets include metadata associated with their respective source electronic documents. 6. The system of claim 3 , wherein the metadata included in the snippets includes document numbers associated with the source electronic documents.
| 0.66129 |
6,088,698 | 21 | 39 |
21. A computer-readable medium carrying one or more sequences of one or more instructions for selectively generating a display of a region of an image from a description of the image, the one or more sequences of one or more instructions including instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of: receiving a request from a client for at least part of said image; in response to receiving said request, performing the steps of: (A) determining a field of view of said client relative to said image; (B) selecting a portion of said description based on said field of view; (C) generating a source text based on the portion of said description that was selected based on said field of view; and (D) delivering the source text to the client.
|
21. A computer-readable medium carrying one or more sequences of one or more instructions for selectively generating a display of a region of an image from a description of the image, the one or more sequences of one or more instructions including instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of: receiving a request from a client for at least part of said image; in response to receiving said request, performing the steps of: (A) determining a field of view of said client relative to said image; (B) selecting a portion of said description based on said field of view; (C) generating a source text based on the portion of said description that was selected based on said field of view; and (D) delivering the source text to the client. 39. The computer readable medium recited in claim 21, further comprising the steps of: determining the client's current virtual location in a virtual world represented by the image; identifying nodes of the virtual world that are within a region that is within a field of view of the client; for the identified nodes, generating a VRML file based upon node information about the nodes that is stored in the database; and delivering the VRML file to the client for display at the client.
| 0.5 |
7,827,168 | 17 | 19 |
17. A data processing system, comprising: a query and retrieval application programming interface (API); a master search node coupled to the query and retrieval API, the master search node having a master copy of an index directory associated with a relational database stored in a storage device; and a plurality of slave search nodes coupled to the common search API and the master search node for performing searches, each of the slave search nodes corresponding to a plurality of search sessions, each slave search node maintaining a local copy of the index directory, wherein each of the slave search node is configured to forward, via a first process thread, a full text search query to a local copy of an index by a first slave search node to perform a search of the relational database during a search session, in response to the search query received from a client via the query and retrieval API, return to the client a list of objects retrieved from the relational database that contain at least one search term of the search query, in response to receiving a list of updated data entries of the relational database received from the client through the query and retrieval API, schedule, via a second process thread, an index update event to update the master copy of the index directory of the master search node, wherein the index update event is triggered when the list of updated data entries is committed to the relational database, the index update event causing the master search index to be updated in view of the list of updated data entries, and periodically update the local copy of the index directory by copying index data from the master copy of the index directory of the master search node to the local copy of the search index of the first slave node.
|
17. A data processing system, comprising: a query and retrieval application programming interface (API); a master search node coupled to the query and retrieval API, the master search node having a master copy of an index directory associated with a relational database stored in a storage device; and a plurality of slave search nodes coupled to the common search API and the master search node for performing searches, each of the slave search nodes corresponding to a plurality of search sessions, each slave search node maintaining a local copy of the index directory, wherein each of the slave search node is configured to forward, via a first process thread, a full text search query to a local copy of an index by a first slave search node to perform a search of the relational database during a search session, in response to the search query received from a client via the query and retrieval API, return to the client a list of objects retrieved from the relational database that contain at least one search term of the search query, in response to receiving a list of updated data entries of the relational database received from the client through the query and retrieval API, schedule, via a second process thread, an index update event to update the master copy of the index directory of the master search node, wherein the index update event is triggered when the list of updated data entries is committed to the relational database, the index update event causing the master search index to be updated in view of the list of updated data entries, and periodically update the local copy of the index directory by copying index data from the master copy of the index directory of the master search node to the local copy of the search index of the first slave node. 19. The system of claim 17 , wherein each slave search node pushes the index update event into a message queue provided by a message provider.
| 0.52349 |
7,945,602 | 1 | 4 |
1. A method for storing documents in web server document libraries, wherein each document corresponds to only a particular web server document library, the method comprising: a computing system maintaining access to a plurality of web server document libraries having corresponding document library databases and document library file system folders, the computing system including a memory connected to at least one processor that executes stored instructions for implementing the method; receiving a document for storing in association with a selected web server document library, the selected web server document library including a document library database and a document library file system folder; associating a collective set of properties with only the selected web server document library among the plurality of web server document libraries, such that the collective set of properties are unique to the selected web server document library; receiving property value information for the received document that provides values for at least some of the collective set of properties that are unique to the selected web server document library; writing the property value information to the document library database of the selected web server document library, so that the document library database of the selected web server document library includes an entry that stores the property value information for the received document and that uniquely associates the received document with the selected web server document library; and storing the received document in the document library file system folder of the selected web server document library, wherein the document and any other documents stored in the selected document library file system folder have consistent properties selected from the collective set of properties, and wherein all documents stored in the document library file system folder are specific to only in the selected web server document library of the plurality of plurality of web server document libraries and such that the received document is only stored in one folder of the plurality of web server document libraries.
|
1. A method for storing documents in web server document libraries, wherein each document corresponds to only a particular web server document library, the method comprising: a computing system maintaining access to a plurality of web server document libraries having corresponding document library databases and document library file system folders, the computing system including a memory connected to at least one processor that executes stored instructions for implementing the method; receiving a document for storing in association with a selected web server document library, the selected web server document library including a document library database and a document library file system folder; associating a collective set of properties with only the selected web server document library among the plurality of web server document libraries, such that the collective set of properties are unique to the selected web server document library; receiving property value information for the received document that provides values for at least some of the collective set of properties that are unique to the selected web server document library; writing the property value information to the document library database of the selected web server document library, so that the document library database of the selected web server document library includes an entry that stores the property value information for the received document and that uniquely associates the received document with the selected web server document library; and storing the received document in the document library file system folder of the selected web server document library, wherein the document and any other documents stored in the selected document library file system folder have consistent properties selected from the collective set of properties, and wherein all documents stored in the document library file system folder are specific to only in the selected web server document library of the plurality of plurality of web server document libraries and such that the received document is only stored in one folder of the plurality of web server document libraries. 4. The method of claim 1 , wherein at least some of the set of collective properties are set to one or more default values, the one or more default values being dependent upon the selected web server document library for the document.
| 0.644377 |
9,871,807 | 1 | 10 |
1. A system comprising: at least one processor; a memory; and an intrusion prevention mechanism stored in the memory and including instructions, which are executable by the at least one processor and include an analysis engine configured to tokenize an input stream of data into a plurality of parts including a first one or more parts and a second one or more parts, and select the first one or more parts for analysis, wherein the analysis engine includes one or more protocol parsers, and wherein the one or more protocol parsers analyze the first one or more parts, and a generic decoder configured to operate based on generic application-level protocol analysis language primitives, wherein the generic decoder is configured to assist the one or more protocol parsers of the analysis engine by analyzing the second one or more parts, having a same protocol as the first one or more parts and not analyzed by the analysis engine, for a signature, wherein the analyzing of the second one or more parts includes searching the second one or more parts for a first predetermined pattern, and generate an error signal in response to matching the first predetermined pattern in the second one or more parts, wherein the signature is detected in response to the pattern being matched in the second one or more parts, and wherein the primitives include at least one of a primitive configured for pattern matching, a primitive configured for skipping a first predetermined number of bytes to search for the first predetermined pattern, a primitive configured for specifying a window in which at least one pattern is to be searched, a primitive configured for using a regular expression for pattern matching, or a primitive configured for reading a value and moving within the first one or more parts based on that value.
|
1. A system comprising: at least one processor; a memory; and an intrusion prevention mechanism stored in the memory and including instructions, which are executable by the at least one processor and include an analysis engine configured to tokenize an input stream of data into a plurality of parts including a first one or more parts and a second one or more parts, and select the first one or more parts for analysis, wherein the analysis engine includes one or more protocol parsers, and wherein the one or more protocol parsers analyze the first one or more parts, and a generic decoder configured to operate based on generic application-level protocol analysis language primitives, wherein the generic decoder is configured to assist the one or more protocol parsers of the analysis engine by analyzing the second one or more parts, having a same protocol as the first one or more parts and not analyzed by the analysis engine, for a signature, wherein the analyzing of the second one or more parts includes searching the second one or more parts for a first predetermined pattern, and generate an error signal in response to matching the first predetermined pattern in the second one or more parts, wherein the signature is detected in response to the pattern being matched in the second one or more parts, and wherein the primitives include at least one of a primitive configured for pattern matching, a primitive configured for skipping a first predetermined number of bytes to search for the first predetermined pattern, a primitive configured for specifying a window in which at least one pattern is to be searched, a primitive configured for using a regular expression for pattern matching, or a primitive configured for reading a value and moving within the first one or more parts based on that value. 10. The system of claim 1 , wherein the generic decoder is configured to store variable data.
| 0.943908 |
9,396,186 | 1 | 2 |
1. A computer-aided translation system, comprising: a processor configured to generate a suggestion pool of possible translations for each sentence in a document that comprises one or more sentences to be translated; a translation module configured to provide a best suggestion from the suggestion pool to a user for a sentence being translated and to provide an updated best suggestion from the updated suggestion pool to the user for the sentence being translated after the receipt of a user's translation prefix input; and a pool update module configured to update the suggestion pool based on the user's input of a translation prefix.
|
1. A computer-aided translation system, comprising: a processor configured to generate a suggestion pool of possible translations for each sentence in a document that comprises one or more sentences to be translated; a translation module configured to provide a best suggestion from the suggestion pool to a user for a sentence being translated and to provide an updated best suggestion from the updated suggestion pool to the user for the sentence being translated after the receipt of a user's translation prefix input; and a pool update module configured to update the suggestion pool based on the user's input of a translation prefix. 2. The system of claim 1 , wherein the processor is further configured to use general and customized translation modles to generate the suggestion pool.
| 0.852713 |
9,086,756 | 11 | 12 |
11. A non-transitory computer-readable storage medium having embodied thereon a program that, when executed by a computer, causes it to perform a method of scrolling an electronic document including multiple columns of text, which is displayed on a display screen of the computer, the method comprising: processing user input received via an input device of the computer; detecting an initiating event and pointer movement for a drag operation from the processed user input; scrolling textual content in the document according to the pointer movement of the drag operation; analyzing semantic constructs in the underlying markup language code to identify which of the multiple columns of text is being viewed and scrolled by the user; calculating a border width for the identified column of text, and apply a border of the calculated width on the left and/or right side of the identified column of text; determining whether the scrolling of the textual content caused at least part of the applied left or right side border of the identified column of text to exit a viewport of a display screen of the electronic device; decreasing a horizontal speed of the scrolling of the textual content, which is performed in accordance with the pointer movement, when an edge of the applied left or right side border of the identified column of text exits the viewport; and after the decreasing of the horizontal speed of the scrolling of the textual content, detecting a horizontal component of the scrolling of the textual content as a distance in a horizontal direction; determining whether the distance is within a correction threshold; and performing automatic re-scrolling to offset the horizontal component in response to a determination that the distance is less than the correction threshold, wherein the drag operation is part of a series of one or more drag operations detected by the at least one processor from the processed user input, wherein the method decreases the horizontal speed of the scrolling of the textual content by: determining a total vertical distance and a total horizontal distance scrolled since the initiating event of the first drag operation in the series; and analyzing the total vertical and horizontal distances, and wherein, in decreasing the horizontal speed of the scrolling of the textual content, the method further comprises: calculating a factor by which the horizontal speed of the scrolling of the textual content is to be decreased, such that the factor is calculated as a first preset value when the determined total horizontal distance exceeds the determined total vertical distance, and the factor is calculated as a second preset value when the determined total vertical distance exceeds the total horizontal distance, the second preset value being greater than the first preset value; and while continuing to scroll the textual content, scaling down the horizontal speed of the scrolling according to the pointer movement of the current drag operation by the calculated factor.
|
11. A non-transitory computer-readable storage medium having embodied thereon a program that, when executed by a computer, causes it to perform a method of scrolling an electronic document including multiple columns of text, which is displayed on a display screen of the computer, the method comprising: processing user input received via an input device of the computer; detecting an initiating event and pointer movement for a drag operation from the processed user input; scrolling textual content in the document according to the pointer movement of the drag operation; analyzing semantic constructs in the underlying markup language code to identify which of the multiple columns of text is being viewed and scrolled by the user; calculating a border width for the identified column of text, and apply a border of the calculated width on the left and/or right side of the identified column of text; determining whether the scrolling of the textual content caused at least part of the applied left or right side border of the identified column of text to exit a viewport of a display screen of the electronic device; decreasing a horizontal speed of the scrolling of the textual content, which is performed in accordance with the pointer movement, when an edge of the applied left or right side border of the identified column of text exits the viewport; and after the decreasing of the horizontal speed of the scrolling of the textual content, detecting a horizontal component of the scrolling of the textual content as a distance in a horizontal direction; determining whether the distance is within a correction threshold; and performing automatic re-scrolling to offset the horizontal component in response to a determination that the distance is less than the correction threshold, wherein the drag operation is part of a series of one or more drag operations detected by the at least one processor from the processed user input, wherein the method decreases the horizontal speed of the scrolling of the textual content by: determining a total vertical distance and a total horizontal distance scrolled since the initiating event of the first drag operation in the series; and analyzing the total vertical and horizontal distances, and wherein, in decreasing the horizontal speed of the scrolling of the textual content, the method further comprises: calculating a factor by which the horizontal speed of the scrolling of the textual content is to be decreased, such that the factor is calculated as a first preset value when the determined total horizontal distance exceeds the determined total vertical distance, and the factor is calculated as a second preset value when the determined total vertical distance exceeds the total horizontal distance, the second preset value being greater than the first preset value; and while continuing to scroll the textual content, scaling down the horizontal speed of the scrolling according to the pointer movement of the current drag operation by the calculated factor. 12. The computer-readable storage medium of claim 11 , wherein the method further comprises: detecting a vertical component of the scrolling of the textual content, the vertical component being determined as a distance in a vertical direction, wherein the correction threshold is determined based on the horizontal and vertical components of the scrolling of the textual content.
| 0.5 |
7,552,116 | 12 | 22 |
12. A method for extracting semantic information about a plurality of electronic documents autonomously created by different sources and being accessible via a computer network, comprising: accessing an electronic document via the computer network; generating a set of tokens by a computer, the tokens indicative of document object model (DOM) nodes associated with visual information in a displayed document image of the electronic document; deriving a non-prescribed visual grammar from the set of tokens by the computer, to represent a hidden syntax convention of visual presentation in the displayed document image; and applying said derived visual grammar by the computer to construct multiple parse trees that represent semantic structure of the electronic document and interpret a maximum subset of the set of tokens, wherein said non-prescribed visual grammar is derived from autonomous or heterogeneous Web documents to represent the hidden syntax convention of the visual presentation, and said derived non-prescribed visual grammar is a five tuple <Σ, N, s, Pd, Pf> where Σ is a set of terminal symbols, N is a set of nonterminal symbols, sεN is a start symbol, Pd is a set of production rules that represent visual patterns and Pf is a set of preference rules that represent pattern precedence.
|
12. A method for extracting semantic information about a plurality of electronic documents autonomously created by different sources and being accessible via a computer network, comprising: accessing an electronic document via the computer network; generating a set of tokens by a computer, the tokens indicative of document object model (DOM) nodes associated with visual information in a displayed document image of the electronic document; deriving a non-prescribed visual grammar from the set of tokens by the computer, to represent a hidden syntax convention of visual presentation in the displayed document image; and applying said derived visual grammar by the computer to construct multiple parse trees that represent semantic structure of the electronic document and interpret a maximum subset of the set of tokens, wherein said non-prescribed visual grammar is derived from autonomous or heterogeneous Web documents to represent the hidden syntax convention of the visual presentation, and said derived non-prescribed visual grammar is a five tuple <Σ, N, s, Pd, Pf> where Σ is a set of terminal symbols, N is a set of nonterminal symbols, sεN is a start symbol, Pd is a set of production rules that represent visual patterns and Pf is a set of preference rules that represent pattern precedence. 22. The method of claim 12 , wherein said Web documents are Web query forms.
| 0.90404 |
8,942,963 | 1 | 10 |
1. A system, comprising: a memory configured to store a simulated model comprising a plurality of simulated components, each of the plurality of simulated components arranged in a component hierarchical graph such that a combination of the simulated components forms the simulated model; a processor that executes an inference engine configured to generate one or more redesign recommendations for at least one simulated component of the plurality of simulated components in the simulated model based on redesign recommendation rules and the at least one simulated component in the component hierarchical graph; and a display generator configured to display the redesign recommendations to a first user.
|
1. A system, comprising: a memory configured to store a simulated model comprising a plurality of simulated components, each of the plurality of simulated components arranged in a component hierarchical graph such that a combination of the simulated components forms the simulated model; a processor that executes an inference engine configured to generate one or more redesign recommendations for at least one simulated component of the plurality of simulated components in the simulated model based on redesign recommendation rules and the at least one simulated component in the component hierarchical graph; and a display generator configured to display the redesign recommendations to a first user. 10. The system of claim 1 , wherein: each node of the component hierarchical graph comprises the at least one simulated component of the plurality of simulated components; and the each node of the component hierarchical graph represents a complete simulated model.
| 0.70989 |
8,070,775 | 25 | 30 |
25. A spine implant comprising: an anchor adapted to be inserted into the bone of a patient; an anchor head having a deflection guide cavity, the deflection guide cavity having a deflection guide cavity wall, a central axis, and a deflection guide cavity opening; a deflection rod having a distal end secured within said deflection guide cavity and a proximal end extending out of the deflection guide cavity opening; wherein the spine implant is configured such that said deflection rod is resiliently held in alignment with the central axis of the deflection guide cavity; wherein, with the deflection rod aligned with a central axis of the deflection guide cavity, there exists a gap between the deflection guide cavity wall and the deflection rod at the deflection guide cavity opening which gap diminishes in size towards the distal end of the deflection rod; and wherein the proximal end of the deflection rod can resiliently deflect in response to a load applied to the proximal end of the deflection rod and wherein contact between the deflection rod and the deflection guide cavity wall limits deflection of the deflection rod.
|
25. A spine implant comprising: an anchor adapted to be inserted into the bone of a patient; an anchor head having a deflection guide cavity, the deflection guide cavity having a deflection guide cavity wall, a central axis, and a deflection guide cavity opening; a deflection rod having a distal end secured within said deflection guide cavity and a proximal end extending out of the deflection guide cavity opening; wherein the spine implant is configured such that said deflection rod is resiliently held in alignment with the central axis of the deflection guide cavity; wherein, with the deflection rod aligned with a central axis of the deflection guide cavity, there exists a gap between the deflection guide cavity wall and the deflection rod at the deflection guide cavity opening which gap diminishes in size towards the distal end of the deflection rod; and wherein the proximal end of the deflection rod can resiliently deflect in response to a load applied to the proximal end of the deflection rod and wherein contact between the deflection rod and the deflection guide cavity wall limits deflection of the deflection rod. 30. The implant of claim 25 , where, in the absence of deflection of the deflection rod, the deflection rod and the bone anchor are colinear.
| 0.747312 |
7,639,257 | 19 | 21 |
19. The method of claim 17 , wherein: the reference to the identified glyphlet includes one or more in-band values defined in an encoding standard.
|
19. The method of claim 17 , wherein: the reference to the identified glyphlet includes one or more in-band values defined in an encoding standard. 21. The method of claim 19 , wherein: the one or more in-band values define the identified glyphlet.
| 0.722222 |
10,157,223 | 15 | 18 |
15. A method, comprising: obtaining, by a device, text to be processed to identify a trend associated with a topic included in the text, the text including a plurality of text sections associated with the topic, the plurality of text sections being associated with a plurality of time frames; preparing, by the device, the text for processing, the text being prepared by standardizing the text for processing; determining, by the device, a respective context for the topic in each of the plurality of text sections, the respective context for the topic in each of the plurality of text sections including one or more terms that appear within a threshold distance of the topic; calculating, by the device, a first specificity score, associated with the topic for a first time frame, of the plurality of time frames, based on the respective context for the topic for one or more text sections, of the plurality of text sections, associated with the first time frame, the first specificity score indicating a degree to which text sections associated with the topic include specific information not included in other text sections; calculating, by the device, a second specificity score, associated with the topic for a second time frame, of the plurality of time frames, based on the respective context for the topic for one or more text sections, of the plurality of text sections, associated with the second time frame; calculating, by the device, a first trend score that represents a difference between the first specificity score and the second specificity score; calculating, by the device, a second trend score, the second trend score being associated with another topic; compare the first trend score and the second trend score; automatically identifying, by the device, the trend associated with the topic based on the first specificity score and the second specificity score thereby increasing speed and accuracy of identifying the trend; and providing, by the device, information that identifies the trend associated with the topic to permit an action to be taken based on the trend, the information being provided based on a result of comparing the first trend score and the second trend score.
|
15. A method, comprising: obtaining, by a device, text to be processed to identify a trend associated with a topic included in the text, the text including a plurality of text sections associated with the topic, the plurality of text sections being associated with a plurality of time frames; preparing, by the device, the text for processing, the text being prepared by standardizing the text for processing; determining, by the device, a respective context for the topic in each of the plurality of text sections, the respective context for the topic in each of the plurality of text sections including one or more terms that appear within a threshold distance of the topic; calculating, by the device, a first specificity score, associated with the topic for a first time frame, of the plurality of time frames, based on the respective context for the topic for one or more text sections, of the plurality of text sections, associated with the first time frame, the first specificity score indicating a degree to which text sections associated with the topic include specific information not included in other text sections; calculating, by the device, a second specificity score, associated with the topic for a second time frame, of the plurality of time frames, based on the respective context for the topic for one or more text sections, of the plurality of text sections, associated with the second time frame; calculating, by the device, a first trend score that represents a difference between the first specificity score and the second specificity score; calculating, by the device, a second trend score, the second trend score being associated with another topic; compare the first trend score and the second trend score; automatically identifying, by the device, the trend associated with the topic based on the first specificity score and the second specificity score thereby increasing speed and accuracy of identifying the trend; and providing, by the device, information that identifies the trend associated with the topic to permit an action to be taken based on the trend, the information being provided based on a result of comparing the first trend score and the second trend score. 18. The method of claim 15 , further comprising: determining that a difference between the second specificity score and the first specificity score is within a threshold amount; and where identifying the trend comprises: identifying a persistent trend based on the difference between the second specificity score and the first specificity score being within the threshold amount.
| 0.5 |
9,973,381 | 1 | 5 |
1. A method for creating a linked list for executing a plurality of portions of script on a device, the method comprising: receiving a set of nodes, each node comprising a portion of script defining functionality of the device; coupling the nodes in a nodal structure based on a desired order of execution of the portions of script; determining an execution path through a subset of nodes in the nodal structure based at least in part on one or more input values of defined input properties for one or more of the portions of script; and compiling, by a processor, the subset of nodes into a linked list of operations for execution by the device, the linked list following the determined execution path.
|
1. A method for creating a linked list for executing a plurality of portions of script on a device, the method comprising: receiving a set of nodes, each node comprising a portion of script defining functionality of the device; coupling the nodes in a nodal structure based on a desired order of execution of the portions of script; determining an execution path through a subset of nodes in the nodal structure based at least in part on one or more input values of defined input properties for one or more of the portions of script; and compiling, by a processor, the subset of nodes into a linked list of operations for execution by the device, the linked list following the determined execution path. 5. The method of claim 1 , wherein a portion of script defining functionality of the device sets at least one of: a pre-defined system keyword, a configuration variable, a status variable, and a session variable.
| 0.548936 |
9,264,784 | 9 | 12 |
9. A recommendation system comprising: one or more communication interfaces; one or more memories that store instructions; and one or more processors to execute the instructions to: obtain, via at least one of the one or more communication interfaces, program historical data associated with users that each receive one or more programs via one or more channels of a program delivery network that provides a program service to which the users belong; obtain, via at least one of the one or more communication interfaces, social network data associated with the users from social network sites to which the users belong, wherein the social network data includes a social graph, communication data pertaining to communications between the users via a communication network that provides a communication service to which the users belong, wherein the communication service includes a mobile phone service and a messaging service, and the communication data includes mobile phone calls, and user profile information pertaining to the users; calculate based on the social network data, the communication data, and the user profile information, a social similarity value that indicates a social similarity between one of the users and other users; calculate based on the program historical data, a channel-interest similarity value that indicates a common interest between the one of the users and the other users in relation to the one or more channels used by the users to receive the one or more programs; calculate based on the social similarity value and the channel-interest similarity value, a similarity index value that indicates a similarity between the one of the users and the other users; calculate based on the program historical data a program regularity value, for each program, that indicates a regularity of consumption of each program over a time period; calculate based on the program regularity value, a program weight value, for each program, that indicates a priority value; calculate based on the program historical data, a stay-time, for each channel, that indicates a time period each of the users remained on each channel; calculate based on each program weight value, each stay-time, and each similarity index value, a channel weight for each channel; and select based on each channel weight, one or more channels to recommend to at least one of the users.
|
9. A recommendation system comprising: one or more communication interfaces; one or more memories that store instructions; and one or more processors to execute the instructions to: obtain, via at least one of the one or more communication interfaces, program historical data associated with users that each receive one or more programs via one or more channels of a program delivery network that provides a program service to which the users belong; obtain, via at least one of the one or more communication interfaces, social network data associated with the users from social network sites to which the users belong, wherein the social network data includes a social graph, communication data pertaining to communications between the users via a communication network that provides a communication service to which the users belong, wherein the communication service includes a mobile phone service and a messaging service, and the communication data includes mobile phone calls, and user profile information pertaining to the users; calculate based on the social network data, the communication data, and the user profile information, a social similarity value that indicates a social similarity between one of the users and other users; calculate based on the program historical data, a channel-interest similarity value that indicates a common interest between the one of the users and the other users in relation to the one or more channels used by the users to receive the one or more programs; calculate based on the social similarity value and the channel-interest similarity value, a similarity index value that indicates a similarity between the one of the users and the other users; calculate based on the program historical data a program regularity value, for each program, that indicates a regularity of consumption of each program over a time period; calculate based on the program regularity value, a program weight value, for each program, that indicates a priority value; calculate based on the program historical data, a stay-time, for each channel, that indicates a time period each of the users remained on each channel; calculate based on each program weight value, each stay-time, and each similarity index value, a channel weight for each channel; and select based on each channel weight, one or more channels to recommend to at least one of the users. 12. The recommendation system of claim 9 , wherein when calculating the similarity index value, at least one of the one or more processors to execute the instructions to: multiply the social similarity value with the channel-interest similarity value, and wherein a product of a multiplication is the similarity index value.
| 0.825994 |
8,429,528 | 8 | 10 |
8. A label data procurement and management method comprising the steps of: a step of a user being assigned a password and an authorization level for access to certain features of an internet based label management system; a step of a user logging into an internet accessible label management system, and upon logging in viewing a list of pending actions for said user including edit requests pending, proofs pending, orders pending and links to a work flow screen for each listed task, with authority to perform tasks specified by the administrative function; a step of a user uploading label graphics and label data onto a server accessible to a plurality of users' computers over a network; a step of a searcher searching for an existing label for editing of label data said searcher is authorized to work on by creation of a label copy for editing purposes; a step of said searcher inspecting a display of said label data in said label copy; a step of moving said label copy to a label setup workbench configured to allow the user to define editable fields in a graphic file of said label copy; a step of said searcher creating a proposed precision text edit of said label data, with said proposed edit being shown in a preview which is an accurate representation of the graphic view of the edited label, with a visual marking of the proposed edit showing proposed changes in the label copy; a step of said system advancing said proposed edit and said label data to a first label inspector team comprising at least one label inspector, wherein if said proposed edit is satisfactory to all of said label said first label inspector team apply said proposed edit to said label data and said method continues to the next step, wherein if said proposed edit is not satisfactory to at least one dissenting member of said first label inspector team a dissenting label inspector performs the following steps: i) a step of providing at least one reason said proposed edit is not satisfactory to an edit applier; ii) approving or rejecting said reason said proposed edit is not satisfactory; iii) a step of if said reason is rejected continuing to step iv but if said reason is accepted repeating said steps of creating a proposed precision text edit, and advancing said proposed text edit until said label data is satisfactory; iv) a step of applying said proposed edit to said label data; a step of advancing said label data to a proofing team comprising at least one member to approve or reject said proposed edit, with approved edits shown in a different visual marking; a step of if at least one of said proofing team members disapproves of said label, performing steps xi-xiii: xi) a first step of providing at least one reason said label is not satisfactory; xii) a second step of a proofing team leader approving or rejecting said reason said proposed edit is not satisfactory; xiii) a third step of if said reason is rejected continuing to step h but if said reason is accepted repeating said steps of creating a proposed precision text edit, advancing said proposed edit to a label inspector team, advancing said label data to a proofing team, and said proofing team members approving or rejecting said proposed edit until said label data is satisfactory; and a step of advancing said order to an order cart wherein said label data is saved on a medium for delivery to a printing location.
|
8. A label data procurement and management method comprising the steps of: a step of a user being assigned a password and an authorization level for access to certain features of an internet based label management system; a step of a user logging into an internet accessible label management system, and upon logging in viewing a list of pending actions for said user including edit requests pending, proofs pending, orders pending and links to a work flow screen for each listed task, with authority to perform tasks specified by the administrative function; a step of a user uploading label graphics and label data onto a server accessible to a plurality of users' computers over a network; a step of a searcher searching for an existing label for editing of label data said searcher is authorized to work on by creation of a label copy for editing purposes; a step of said searcher inspecting a display of said label data in said label copy; a step of moving said label copy to a label setup workbench configured to allow the user to define editable fields in a graphic file of said label copy; a step of said searcher creating a proposed precision text edit of said label data, with said proposed edit being shown in a preview which is an accurate representation of the graphic view of the edited label, with a visual marking of the proposed edit showing proposed changes in the label copy; a step of said system advancing said proposed edit and said label data to a first label inspector team comprising at least one label inspector, wherein if said proposed edit is satisfactory to all of said label said first label inspector team apply said proposed edit to said label data and said method continues to the next step, wherein if said proposed edit is not satisfactory to at least one dissenting member of said first label inspector team a dissenting label inspector performs the following steps: i) a step of providing at least one reason said proposed edit is not satisfactory to an edit applier; ii) approving or rejecting said reason said proposed edit is not satisfactory; iii) a step of if said reason is rejected continuing to step iv but if said reason is accepted repeating said steps of creating a proposed precision text edit, and advancing said proposed text edit until said label data is satisfactory; iv) a step of applying said proposed edit to said label data; a step of advancing said label data to a proofing team comprising at least one member to approve or reject said proposed edit, with approved edits shown in a different visual marking; a step of if at least one of said proofing team members disapproves of said label, performing steps xi-xiii: xi) a first step of providing at least one reason said label is not satisfactory; xii) a second step of a proofing team leader approving or rejecting said reason said proposed edit is not satisfactory; xiii) a third step of if said reason is rejected continuing to step h but if said reason is accepted repeating said steps of creating a proposed precision text edit, advancing said proposed edit to a label inspector team, advancing said label data to a proofing team, and said proofing team members approving or rejecting said proposed edit until said label data is satisfactory; and a step of advancing said order to an order cart wherein said label data is saved on a medium for delivery to a printing location. 10. The method of claim 8 wherein said searcher proposes said edits in a first part of an Edit Studio function of said method and said first team of label inspectors analyzes and rejects said proposed edits in a second part of said edit studio function.
| 0.5 |
8,285,721 | 14 | 17 |
14. A computer-implemented method comprising: accessing an item database storing item records, each of the item records including an attribute, an attribute value, and a reference to a product record of a plurality of product records; accessing a product database storing the plurality of product records, the product database being representative of a decision tree having end nodes, each of the end nodes corresponding uniquely to one of the plurality of product records; performing an analysis of the product database based on the item records and on the plurality of product records, the analysis including a determination of a compression ratio based on a first total number of item records and on a second total number of product records, the analysis being performed by a hardware-implemented manager module of a machine; modifying the product database based on the analysis, the modifying being performed by the hardware-implemented manager module of the machine.
|
14. A computer-implemented method comprising: accessing an item database storing item records, each of the item records including an attribute, an attribute value, and a reference to a product record of a plurality of product records; accessing a product database storing the plurality of product records, the product database being representative of a decision tree having end nodes, each of the end nodes corresponding uniquely to one of the plurality of product records; performing an analysis of the product database based on the item records and on the plurality of product records, the analysis including a determination of a compression ratio based on a first total number of item records and on a second total number of product records, the analysis being performed by a hardware-implemented manager module of a machine; modifying the product database based on the analysis, the modifying being performed by the hardware-implemented manager module of the machine. 17. The computer-implemented method of claim 14 , wherein: the modifying of the product database comprises deleting an end node from the decision tree.
| 0.719331 |
9,092,418 | 4 | 5 |
4. The method of claim 1 , further comprising: employing as the modified text entry the text entry having a wild card element in place of each of a first number of terminal characters of the text entry; identifying the particular language object as a proposed spell-check interpretation at least partially on the basis that it corresponds with the text entry having a wild card element in place of each of a first number of terminal characters of the text entry; making a determination that the quantity of proposed spell-check interpretations is fewer than a predetermined threshold; responsive to said making a determination, identifying a number of language objects that correspond with the text entry having a wild card element in place of each of a second number of terminal characters of the text entry, the second number being greater than the first number; and outputting at least some of the number of language objects as additional proposed spell-check interpretations.
|
4. The method of claim 1 , further comprising: employing as the modified text entry the text entry having a wild card element in place of each of a first number of terminal characters of the text entry; identifying the particular language object as a proposed spell-check interpretation at least partially on the basis that it corresponds with the text entry having a wild card element in place of each of a first number of terminal characters of the text entry; making a determination that the quantity of proposed spell-check interpretations is fewer than a predetermined threshold; responsive to said making a determination, identifying a number of language objects that correspond with the text entry having a wild card element in place of each of a second number of terminal characters of the text entry, the second number being greater than the first number; and outputting at least some of the number of language objects as additional proposed spell-check interpretations. 5. The method of claim 4 wherein each language object has associated therewith a frequency object having a frequency value indicative of the relative frequency of the language object in a language, and further comprising outputting the particular language object and the at least some of the number of language objects in order of decreasing frequency value.
| 0.5 |
8,838,079 | 37 | 42 |
37. A method on a mobile device of providing keyword-based services to message recipients, the method comprising: receiving a text message at a mobile device of a user; identifying a plurality of keywords in the received text message, wherein at least some of the plurality of keywords are identified by comparing words in the text message with a keyword inventory that is maintained on the mobile device, and wherein the keyword inventory is described by a search tree comprised of a plurality of nodes representing characters, such that one or more nodes linked together define a keyword; retrieving a market segment of the user, the market segment determined based on observed user activity on the mobile device; selecting a subset of the identified keywords based on user-specific information, including the market segment of the user, stored on the mobile device; displaying the received text message to the user of the mobile device, wherein the text of the displayed message is formatted to distinguish the subset of identified keywords in the text from non-identified keyword text in the displayed message; associating each of the subset of identified keywords with at least one advertisement and at least one contextual service; receiving a selection of an identified keyword in the displayed message by the user; displaying to the user at least one advertisement and at least one contextual service associated with the selected keyword; receiving a selection of a displayed advertisement or contextual service from the user; invoking the selected advertisement or contextual service to request additional information associated with the keyword, wherein invoking the selected advertisement or contextual service comprises transmitting the user-specific information to the selected advertisement or contextual service provided that the user has authorized such transmittal; and receiving information associated with the keyword from the selected advertisement or contextual service and presenting the received information to the user.
|
37. A method on a mobile device of providing keyword-based services to message recipients, the method comprising: receiving a text message at a mobile device of a user; identifying a plurality of keywords in the received text message, wherein at least some of the plurality of keywords are identified by comparing words in the text message with a keyword inventory that is maintained on the mobile device, and wherein the keyword inventory is described by a search tree comprised of a plurality of nodes representing characters, such that one or more nodes linked together define a keyword; retrieving a market segment of the user, the market segment determined based on observed user activity on the mobile device; selecting a subset of the identified keywords based on user-specific information, including the market segment of the user, stored on the mobile device; displaying the received text message to the user of the mobile device, wherein the text of the displayed message is formatted to distinguish the subset of identified keywords in the text from non-identified keyword text in the displayed message; associating each of the subset of identified keywords with at least one advertisement and at least one contextual service; receiving a selection of an identified keyword in the displayed message by the user; displaying to the user at least one advertisement and at least one contextual service associated with the selected keyword; receiving a selection of a displayed advertisement or contextual service from the user; invoking the selected advertisement or contextual service to request additional information associated with the keyword, wherein invoking the selected advertisement or contextual service comprises transmitting the user-specific information to the selected advertisement or contextual service provided that the user has authorized such transmittal; and receiving information associated with the keyword from the selected advertisement or contextual service and presenting the received information to the user. 42. The method of claim 37 , wherein the observed user activity on the mobile device includes phone calls placed by the user on the mobile device, or calendar data reflecting meetings of the user on the mobile device, or location data representing movement of the mobile device, or purchases made by the user on the mobile device, or a record of audio and video media titles that the user has stored on or made accessible via the mobile device.
| 0.5 |
10,009,297 | 1 | 11 |
1. A method of displaying related content on a user interface, the method comprising: analyzing, by one or more processors, an initial electronic document to identify a first mention in the initial electronic document; generating, by one or more processors, a first mention descriptor of the first mention in the initial electronic document according to a context of the initial electronic document; appending, by one or more processors, the first mention descriptor to the initial electronic document; mapping, by one or more processors, the first mention descriptor from the initial electronic document to a disambiguation identifier from a knowledge base that contains a version of the first mention, wherein the disambiguation identifier is an entity within the knowledge base; associating, by one or more processors, the disambiguation identifier with the initial electronic document; locating, by one or more processors, the disambiguation identifier on an entity metadata visualization panel, wherein the disambiguation identifier was appended to the entity metadata visualization panel after mapping the entity metadata visualization panel to the disambiguation identifier from the knowledge base, and wherein the entity metadata visualization panel was mapped to the disambiguation identifier by mapping a second mention descriptor for a second mention in the entity metadata visualization panel to the disambiguation identifier; retrieving, by one or more processors, the entity metadata visualization panel; and displaying, on the user interface, the entity metadata visualization panel as related content that is related to the first mention in the initial electronic document.
|
1. A method of displaying related content on a user interface, the method comprising: analyzing, by one or more processors, an initial electronic document to identify a first mention in the initial electronic document; generating, by one or more processors, a first mention descriptor of the first mention in the initial electronic document according to a context of the initial electronic document; appending, by one or more processors, the first mention descriptor to the initial electronic document; mapping, by one or more processors, the first mention descriptor from the initial electronic document to a disambiguation identifier from a knowledge base that contains a version of the first mention, wherein the disambiguation identifier is an entity within the knowledge base; associating, by one or more processors, the disambiguation identifier with the initial electronic document; locating, by one or more processors, the disambiguation identifier on an entity metadata visualization panel, wherein the disambiguation identifier was appended to the entity metadata visualization panel after mapping the entity metadata visualization panel to the disambiguation identifier from the knowledge base, and wherein the entity metadata visualization panel was mapped to the disambiguation identifier by mapping a second mention descriptor for a second mention in the entity metadata visualization panel to the disambiguation identifier; retrieving, by one or more processors, the entity metadata visualization panel; and displaying, on the user interface, the entity metadata visualization panel as related content that is related to the first mention in the initial electronic document. 11. The method of claim 1 , wherein the initial electronic document is a first type of web log (blog) and the entity metadata visualization panel is a second type of blog, wherein the first type of blog is for a different subject than that of the second type of blog.
| 0.767016 |
8,756,053 | 7 | 9 |
7. The method according to claim 1 , wherein the updating comprises: calculating an optimal value of a link generation parameter, τ.
|
7. The method according to claim 1 , wherein the updating comprises: calculating an optimal value of a link generation parameter, τ. 9. The method of claim 7 , wherein said constructing at least one graph comprises: constructing a first graph representing content similarities between the documents; and constructing a second graph indicating said relationship between the entities associated with the documents, said method further comprising: predicting whether an edge in the constructed first graph will be formed based on an uncovered relationship, predicting whether an edge in the second graph will be formed based on extracted topics, and constructing an entity relationship graph based the first graph and the second graphs.
| 0.5 |
9,671,817 | 6 | 7 |
6. The accumulator-based phase memory of claim 5 , wherein the waveform generator is located on a direct digital synthesis (DDS) device.
|
6. The accumulator-based phase memory of claim 5 , wherein the waveform generator is located on a direct digital synthesis (DDS) device. 7. The accumulator-based phase memory of claim 6 , wherein the divide-by-N clock is located on the DDS device.
| 0.797794 |
8,924,197 | 17 | 29 |
17. A system for converting a natural language query into a one or more logical queries, comprising: a plurality of domain independent specialized tools stored on a non-transitory computer readable storage medium, each of the plurality of specialized tools being adapted to perform a highly specific recognition task, each of the specialized tools operable independently from any of the other specialized tools, and each of the recognition tools being adapted to operate independent of any particular data; one or more knowledge bases stored on a non-transitory computer readable storage medium for use by one or more of the specialized tools to perform its specific recognition task; and an extensible engine, of a processor, which converts the natural language query to one or more logical queries in accordance with one or more of the plurality of specialized tools by causing a general purpose computer to generate a collective recognition judgment in accordance with individual recognition results received from a plurality of the plurality of specialized tools, at least two of the plurality specialized tools performing its highly specific recognition task on a similar portion of natural language query and providing distinct interpretation results, the computer outputting the collective judgment to a non-transitory computer readable storage medium.
|
17. A system for converting a natural language query into a one or more logical queries, comprising: a plurality of domain independent specialized tools stored on a non-transitory computer readable storage medium, each of the plurality of specialized tools being adapted to perform a highly specific recognition task, each of the specialized tools operable independently from any of the other specialized tools, and each of the recognition tools being adapted to operate independent of any particular data; one or more knowledge bases stored on a non-transitory computer readable storage medium for use by one or more of the specialized tools to perform its specific recognition task; and an extensible engine, of a processor, which converts the natural language query to one or more logical queries in accordance with one or more of the plurality of specialized tools by causing a general purpose computer to generate a collective recognition judgment in accordance with individual recognition results received from a plurality of the plurality of specialized tools, at least two of the plurality specialized tools performing its highly specific recognition task on a similar portion of natural language query and providing distinct interpretation results, the computer outputting the collective judgment to a non-transitory computer readable storage medium. 29. The system of claim 17 , wherein the extensible engine has a main processing algorithm that engages portions of the tools and stores all intermediate results inside a plurality of data-structures.
| 0.713467 |
7,849,398 | 12 | 13 |
12. The method of claim 11 , further comprising: for each of a plurality of fields of the form: computing a field exclusion function which is based on the estimated manual entry time and manual correction time, the text length parameter, tagging error rate, optical character recognition error rate, and, optionally, the field relevance parameter, and determining whether to automatically populate the field of the form based on the field exclusion function.
|
12. The method of claim 11 , further comprising: for each of a plurality of fields of the form: computing a field exclusion function which is based on the estimated manual entry time and manual correction time, the text length parameter, tagging error rate, optical character recognition error rate, and, optionally, the field relevance parameter, and determining whether to automatically populate the field of the form based on the field exclusion function. 13. The method of claim 12 , further comprising: for each of a plurality of fields of the form, assigning a relevance parameter to the field and wherein the field exclusion function is based on the assigned relevance parameter of the field.
| 0.817906 |
10,084,805 | 13 | 14 |
13. The computer-implemented method of claim 11 , comprising: obtaining the scenario rules and the data from one or more data system coupled via one or more network connections; and applying the scenario rules to the actions by comparing each indication of an action to each scenario rule to determine whether an entity committed a scenario violation, wherein the scenario rules define activity to detect the targeted behavior.
|
13. The computer-implemented method of claim 11 , comprising: obtaining the scenario rules and the data from one or more data system coupled via one or more network connections; and applying the scenario rules to the actions by comparing each indication of an action to each scenario rule to determine whether an entity committed a scenario violation, wherein the scenario rules define activity to detect the targeted behavior. 14. The computer-implemented method of claim 13 , comprising generating indicators for entities committing scenario violations based on applying the scenario rules, each indicator to indicate an entity committed a scenario violation.
| 0.5 |
7,678,984 | 14 | 17 |
14. A system, comprising: one or more processors; and a memory comprising program instructions executable by the one or more processors to: receive a request to generate a new playlist; and in response to receiving the request: determine an initial ordered sequence of one or more audio files; and generate a new playlist comprising an ordered sequence including an indication of one or more of the audio files from a playlist database, wherein said generating a new playlist comprises applying the initial ordered sequence to an N-gram statistical model of the playlist database; wherein the playlist database comprises a plurality of audio file playlists, wherein each audio file playlist indicates an ordered sequence of audio files; and wherein the N-gram statistical model models ordering sequences of the audio files indicated in the playlists.
|
14. A system, comprising: one or more processors; and a memory comprising program instructions executable by the one or more processors to: receive a request to generate a new playlist; and in response to receiving the request: determine an initial ordered sequence of one or more audio files; and generate a new playlist comprising an ordered sequence including an indication of one or more of the audio files from a playlist database, wherein said generating a new playlist comprises applying the initial ordered sequence to an N-gram statistical model of the playlist database; wherein the playlist database comprises a plurality of audio file playlists, wherein each audio file playlist indicates an ordered sequence of audio files; and wherein the N-gram statistical model models ordering sequences of the audio files indicated in the playlists. 17. The system as recited in claim 14 , wherein the request includes audio file class information for determining an initial ordered sequence of one or more audio files, and wherein, to determine an initial ordered sequence of one or more audio files, wherein the program instructions are further configured to select one or more audio files as the initial ordered sequence according to the class information in the request.
| 0.679758 |
7,958,124 | 7 | 13 |
7. A bundle database management method for generating, storing, and searching bundle data defining an association structure between individual words having relation to each other, the method comprising the steps of: (1) defining, with a processor, a core word, a relevant word connected to the core word, and another relevant word derived from the relevant word regarded as another core word, generating bundle data defining an nth connection relation between the core word and the relevant word as a graph hierarchy structure, and storing the generated bundle data; (2) storing description data in a memory, the description data corresponding to the core word and the relevant word; (3) receiving a search request including a specific search word input by a user; (4) generating, with a processor, a search result page including the bundle data having a search word as its core word and the description data relating to the core word; and (5) transmitting the search result page to a user terminal, wherein the step (4) comprises connecting a first bundle with a second bundle to generate a single nth bundle data; and in the case of connecting the first bundle with the second bundle having, as a core word, a same word as an arbitrary word of the first bundle to generate a connected bundle, the step (4) comprises, while maintaining word association structures of the first and second bundles in the connected bundle, integrating each same word of the first bundle and the second bundle into one word relative to the first bundle, connecting bundle data of the first and second bundles in such a way to add words of the second bundle to the first bundle, and integrating each description data of the first and second bundles into a description data of the integrated word, wherein the step of (4) generating a search result page includes the step of including the bundle data in the search result page, the bundle data being in odd bundles (n=1, 3, 5, . . . ) represented in such a graphic structure that at least one relevant word for each core word are horizontally connects and in even bundles (n=2, 4, 6, . . . ) represented in such a graphic structure that at least one relevant word for each core word are vertically connected.
|
7. A bundle database management method for generating, storing, and searching bundle data defining an association structure between individual words having relation to each other, the method comprising the steps of: (1) defining, with a processor, a core word, a relevant word connected to the core word, and another relevant word derived from the relevant word regarded as another core word, generating bundle data defining an nth connection relation between the core word and the relevant word as a graph hierarchy structure, and storing the generated bundle data; (2) storing description data in a memory, the description data corresponding to the core word and the relevant word; (3) receiving a search request including a specific search word input by a user; (4) generating, with a processor, a search result page including the bundle data having a search word as its core word and the description data relating to the core word; and (5) transmitting the search result page to a user terminal, wherein the step (4) comprises connecting a first bundle with a second bundle to generate a single nth bundle data; and in the case of connecting the first bundle with the second bundle having, as a core word, a same word as an arbitrary word of the first bundle to generate a connected bundle, the step (4) comprises, while maintaining word association structures of the first and second bundles in the connected bundle, integrating each same word of the first bundle and the second bundle into one word relative to the first bundle, connecting bundle data of the first and second bundles in such a way to add words of the second bundle to the first bundle, and integrating each description data of the first and second bundles into a description data of the integrated word, wherein the step of (4) generating a search result page includes the step of including the bundle data in the search result page, the bundle data being in odd bundles (n=1, 3, 5, . . . ) represented in such a graphic structure that at least one relevant word for each core word are horizontally connects and in even bundles (n=2, 4, 6, . . . ) represented in such a graphic structure that at least one relevant word for each core word are vertically connected. 13. The bundle database management method of claim 7 , further comprising the steps of: (6) receiving selection information of a specific word constituting bundle data from the user terminal, the bundle data being represented in a graphic structure at the search result page; and (7) including the description data retrieved by the specific word in the search result page to provide it to the user terminal.
| 0.861753 |
10,149,746 | 1 | 12 |
1. A method for producing a dental shaped body from a blank having a corpus of tooth restoration material by a tool adapted to remove said material, wherein, to detect a position of said corpus inserted in a machining device, contact scanning is performed on said blank by said tool, the method including steps of: providing a machining tool in a first position; detecting at least one geometric structure on said blank, the at least one geometric structure defines information that corresponds to at least one relevant dimension of said blank corpus; and using the information that corresponds to said at least one relevant dimension of said blank corpus to preposition said machining tool to a second position at or close to a first reference surface or a first reference structure for a contacting operation; determining a position of the first reference surface or first reference structure by contact scanning from said second position; and using the determined position as a starting position to detect one or more other geometric structures and/or to perform one or more other contact scanning such that contacting times of the tool during contact scanning and/or machining times of the tool during machining are reduced.
|
1. A method for producing a dental shaped body from a blank having a corpus of tooth restoration material by a tool adapted to remove said material, wherein, to detect a position of said corpus inserted in a machining device, contact scanning is performed on said blank by said tool, the method including steps of: providing a machining tool in a first position; detecting at least one geometric structure on said blank, the at least one geometric structure defines information that corresponds to at least one relevant dimension of said blank corpus; and using the information that corresponds to said at least one relevant dimension of said blank corpus to preposition said machining tool to a second position at or close to a first reference surface or a first reference structure for a contacting operation; determining a position of the first reference surface or first reference structure by contact scanning from said second position; and using the determined position as a starting position to detect one or more other geometric structures and/or to perform one or more other contact scanning such that contacting times of the tool during contact scanning and/or machining times of the tool during machining are reduced. 12. The method as defined in claim 1 , further comprising detecting at least one dimension of said blank corpus by said contacting operation on geometric structure located on said corpus.
| 0.726608 |
8,145,911 | 11 | 13 |
11. A method for electronically executing an electronic document, comprising: receiving, from a single computer, first identification information associated with a first signatory user; receiving, from the single computer, second identification information associated with a second signatory user; receiving, from the single computer, third identification information associated with a notary user; identifying, on a display, at least one unexecuted electronic document that requires execution by the first and second signatory users; receiving a first user command from the single computer identifying the assent of the first signatory user to the execution of the at least one unexecuted electronic document; receiving a second user command from the single computer identifying the assent of the second signatory user to the execution of the at least one unexecuted electronic document; receiving a third user command from the single computer identifying the presence of a notary user with the first signatory user; in response to receiving the first user command and the second user command, electronically executing the at least one unexecuted document by applying official electronic notarization indicia associated with the notary user to the at least one unexecuted document to create at least one electronically executed document, the official electronic notarization indicia certifying the presence of the notary user at the execution of the at least one executed and certified electronic document by the first user and identifying the notary user as a registered and valid notary meeting at least one jurisdictional requirement.
|
11. A method for electronically executing an electronic document, comprising: receiving, from a single computer, first identification information associated with a first signatory user; receiving, from the single computer, second identification information associated with a second signatory user; receiving, from the single computer, third identification information associated with a notary user; identifying, on a display, at least one unexecuted electronic document that requires execution by the first and second signatory users; receiving a first user command from the single computer identifying the assent of the first signatory user to the execution of the at least one unexecuted electronic document; receiving a second user command from the single computer identifying the assent of the second signatory user to the execution of the at least one unexecuted electronic document; receiving a third user command from the single computer identifying the presence of a notary user with the first signatory user; in response to receiving the first user command and the second user command, electronically executing the at least one unexecuted document by applying official electronic notarization indicia associated with the notary user to the at least one unexecuted document to create at least one electronically executed document, the official electronic notarization indicia certifying the presence of the notary user at the execution of the at least one executed and certified electronic document by the first user and identifying the notary user as a registered and valid notary meeting at least one jurisdictional requirement. 13. The method of claim 11 , wherein electronically executing the at least one unexecuted document comprises: applying a first digital certificate associated with the first signatory user to the at least one unexecuted electronic document; and applying a second digital certificate associated with the second signatory user to the at least one unexecuted electronic document.
| 0.61499 |
7,630,878 | 9 | 10 |
9. A method as claimed in claim 8 , further comprising specifying the matrix for dimensional reduction from one of a Linear Discriminant Analysis, a Principal Component Analysis and an Independent Component Analysis.
|
9. A method as claimed in claim 8 , further comprising specifying the matrix for dimensional reduction from one of a Linear Discriminant Analysis, a Principal Component Analysis and an Independent Component Analysis. 10. A method as claimed in claim 9 , wherein the speaker-independent speech recognition is language-dependent.
| 0.5 |
5,574,826 | 29 | 30 |
29. A memory section for an electronic controller which performs inference operations according to rules, each rule comprising at least one preposition and at least one implication, wherein a membership function, defined for a finite number of points of a universe of discourse, appears in the preposition of at least one of the rules, the membership function having a value for each of the finite number of points, which value is indicative of a degree of membership, wherein the memory section has a size defined by a number of nonzero values of the membership functions associated with a selected one of the finite number of points, the selected point having the largest number of nonzero values.
|
29. A memory section for an electronic controller which performs inference operations according to rules, each rule comprising at least one preposition and at least one implication, wherein a membership function, defined for a finite number of points of a universe of discourse, appears in the preposition of at least one of the rules, the membership function having a value for each of the finite number of points, which value is indicative of a degree of membership, wherein the memory section has a size defined by a number of nonzero values of the membership functions associated with a selected one of the finite number of points, the selected point having the largest number of nonzero values. 30. The memory section of claim 29, wherein a length L of a memory word of the memory section is dependent on the largest number of non-zero values.
| 0.5 |
9,619,812 | 9 | 13 |
9. A method of engaging an audience in a conversational advertisement, wherein the method is performed by a computing system having a processor and a memory, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides responses, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interactions with the conversational advertisement orchestrated through the first webpage.
|
9. A method of engaging an audience in a conversational advertisement, wherein the method is performed by a computing system having a processor and a memory, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides responses, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interactions with the conversational advertisement orchestrated through the first webpage. 13. The method of claim 9 , wherein: determining, at the server computer, the response to convey to the audience is based at least in part on a previous response of the audience to one or more conversational advertisements, and conveying, at the server computer, the first message of the conversational advertisement to the client device to be presented to the audience includes conveying, at the server computer, instructions to present the first message in both audio and textual forms on the client device.
| 0.61026 |
9,256,401 | 1 | 7 |
1. In a computing environment, a method of enhancing dynamic code, the method comprising: obtaining one or more first data structures defining constructs in a body of dynamic language source code; from the one or more first data structures, extracting identifier information for one or more of the defined constructs; augmenting knowledge about the constructs, wherein augmenting comprises modeling the results of executing code including symbolic execution, abstraction interpretation, and control and data flow analysis; generating metadata about the body of the dynamic language source code by using at least the identifier information extracted from the one or more first data structures and the augmented knowledge, the generated metadata being represented as an abstract symbol table (AST); traversing the AST and constructing a hierarchical symbol table that expresses scoping of all discovered symbols; performing a subsequent traversal of the AST to accomplish type inferencing and member population; visually enhancing the body of dynamic language source code based on the hierarchical symbol table structure; and wherein visually enhancing the body of dynamic language source code comprises indicating symbol scope by visual artifacts.
|
1. In a computing environment, a method of enhancing dynamic code, the method comprising: obtaining one or more first data structures defining constructs in a body of dynamic language source code; from the one or more first data structures, extracting identifier information for one or more of the defined constructs; augmenting knowledge about the constructs, wherein augmenting comprises modeling the results of executing code including symbolic execution, abstraction interpretation, and control and data flow analysis; generating metadata about the body of the dynamic language source code by using at least the identifier information extracted from the one or more first data structures and the augmented knowledge, the generated metadata being represented as an abstract symbol table (AST); traversing the AST and constructing a hierarchical symbol table that expresses scoping of all discovered symbols; performing a subsequent traversal of the AST to accomplish type inferencing and member population; visually enhancing the body of dynamic language source code based on the hierarchical symbol table structure; and wherein visually enhancing the body of dynamic language source code comprises indicating symbol scope by visual artifacts. 7. The method of claim 1 , wherein visually enhancing the body of dynamic language source code comprises displaying visual artifacts.
| 0.660714 |
8,719,296 | 1 | 7 |
1. A computer-implemented method for extracting data from a data source by one or more computing devices, the method comprising: applying, by at least one of the one or more computing devices, an extractor pattern to a computer-readable data source, wherein the extractor pattern is generated based at least in part on a prior identification of data of interest and wherein the extractor pattern includes one or more regular expressions which are configured to identify additional data of interest in the computer-readable data source; retrieving, by at least one of the one or more computing devices, the additional data of interest from the computer-readable data source using the one or more regular expressions; and storing, by at least one of the one or more computing devices, the additional data of interest in a data storage device.
|
1. A computer-implemented method for extracting data from a data source by one or more computing devices, the method comprising: applying, by at least one of the one or more computing devices, an extractor pattern to a computer-readable data source, wherein the extractor pattern is generated based at least in part on a prior identification of data of interest and wherein the extractor pattern includes one or more regular expressions which are configured to identify additional data of interest in the computer-readable data source; retrieving, by at least one of the one or more computing devices, the additional data of interest from the computer-readable data source using the one or more regular expressions; and storing, by at least one of the one or more computing devices, the additional data of interest in a data storage device. 7. The method of claim 1 , wherein the one or more regular expressions comprise a pre-condition regular expression which specifies a condition which signals the beginning of potential additional data of interest, a portion-of-data regular expression which defines the additional data of interest, and a post-condition regular expression which specifies a condition which signals the end of the potential additional data of interest.
| 0.5 |
8,539,359 | 75 | 76 |
75. The machine system of claim 1 wherein: at least one of the first presentations is presentable by way of a display screen; the presentation format controller is configured to enable the first user to selectively hide or minimize visual presentations of the first presentations presented on the display screen while allowing the first user to later cause the hidden or minimized first presentations to pop out; and the machine system is able to continue to automatically determine what specific sub-portion or specific sub-portions of firstly presented content the first user centers his or her attention upon while the first presentations are hidden or minimized.
|
75. The machine system of claim 1 wherein: at least one of the first presentations is presentable by way of a display screen; the presentation format controller is configured to enable the first user to selectively hide or minimize visual presentations of the first presentations presented on the display screen while allowing the first user to later cause the hidden or minimized first presentations to pop out; and the machine system is able to continue to automatically determine what specific sub-portion or specific sub-portions of firstly presented content the first user centers his or her attention upon while the first presentations are hidden or minimized. 76. The machine system of claim 75 wherein while the first presentations are hidden or minimized in such a way that the first user will not become aware of new invitations and/or suggestions provided thereby, the machine system is configured to temporarily halt generation of new invitations and/or suggestions that the first user will not become aware of.
| 0.5 |
8,266,153 | 8 | 10 |
8. A computer processing system for generating an object relevance display, the system comprising: a computer, including a non-transitory computer readable storage memory and an object ordering processor, wherein the object ordering processor, in response to receiving an object relevance display request comprising a set of objects to display, retrieves a set of stored relevance values associated with the set of objects and sorts the set of objects according to their associated relevance values, wherein a relevance value is calculated based on the number of references to an object wherein calculating each relevance value comprises associating a weight factor with each of a set of metadata sources, calculating a weighted number of references for each of the set of metadata sources by multiplying the number of references determined from a metadata source by the weight factor associated with the metadata source, and calculating the relevance value based on a weighted number of references to the object determined from the set of metadata sources; and a display generator that generates the object relevance display in response to receiving the sorted set of objects, the object relevance display comprising a set of icons representing the sorted set of objects and their associated relevance values.
|
8. A computer processing system for generating an object relevance display, the system comprising: a computer, including a non-transitory computer readable storage memory and an object ordering processor, wherein the object ordering processor, in response to receiving an object relevance display request comprising a set of objects to display, retrieves a set of stored relevance values associated with the set of objects and sorts the set of objects according to their associated relevance values, wherein a relevance value is calculated based on the number of references to an object wherein calculating each relevance value comprises associating a weight factor with each of a set of metadata sources, calculating a weighted number of references for each of the set of metadata sources by multiplying the number of references determined from a metadata source by the weight factor associated with the metadata source, and calculating the relevance value based on a weighted number of references to the object determined from the set of metadata sources; and a display generator that generates the object relevance display in response to receiving the sorted set of objects, the object relevance display comprising a set of icons representing the sorted set of objects and their associated relevance values. 10. The computer processing system of claim 8 wherein the set of icons are graphic icons that indicate magnitudes of the relevance values corresponding to the sorted set of objects.
| 0.698333 |
8,020,145 | 3 | 4 |
3. A method of regulating operation of a computer using computer program instructions conforming to a structure characterized by: (a) an invocation string having (i) a string identifying an operation, (ii) an invocation destination list identifying, for each operand sourced externally to the invocation string, a place from which the operand is sourced, and (iii) an invocation source list identifying a place for a result of the operation; and (b) a definition string associated with the invocation string and having (i) a resolution string defining the operation, (ii) a definition destination list identifying, for each operand sourced external to the definition string, a place from which the operand is sourced, and (iii) a definition source list identifying a place for a result of the operation; Where the method comprises: (1) instantiating an operation of a first invocation string upon completeness of necessary operands identified by a invocation destination list of the first invocation string, where an element in a invocation destination list of a second invocation string identifies an element in a invocation source list of the first invocation string; and (2) resolving the instantiated operation of the first invocation string according to a definition string associated with the first invocation string including a step of coordinating a content flow with an operation of the second invocation string that has a dependency relationship with the instantiated operation of the first invocation string.
|
3. A method of regulating operation of a computer using computer program instructions conforming to a structure characterized by: (a) an invocation string having (i) a string identifying an operation, (ii) an invocation destination list identifying, for each operand sourced externally to the invocation string, a place from which the operand is sourced, and (iii) an invocation source list identifying a place for a result of the operation; and (b) a definition string associated with the invocation string and having (i) a resolution string defining the operation, (ii) a definition destination list identifying, for each operand sourced external to the definition string, a place from which the operand is sourced, and (iii) a definition source list identifying a place for a result of the operation; Where the method comprises: (1) instantiating an operation of a first invocation string upon completeness of necessary operands identified by a invocation destination list of the first invocation string, where an element in a invocation destination list of a second invocation string identifies an element in a invocation source list of the first invocation string; and (2) resolving the instantiated operation of the first invocation string according to a definition string associated with the first invocation string including a step of coordinating a content flow with an operation of the second invocation string that has a dependency relationship with the instantiated operation of the first invocation string. 4. The method of claim 3 where the definition source list has a one-to-one correspondence with the invocation destination list.
| 0.626471 |
8,734,158 | 7 | 12 |
7. A method of teaching a person to do basic math operations comprised of teaching the person to manipulate a plurality of unique geometric shapes; each unique geometric shape having a specific value ranging 1-10, wherein the unique geometric shape having a value of 10 is formed by manipulating any combination of unique geometric shapes that when their specific values are added together equals the value of 10; wherein the plurality of geometric shapes are comprised of physical, written or digitized substrates, and wherein teaching the person to manipulate a plurality of unique geometric shapes is comprised of teaching the person to manipulate small triangles with a value of 1 forming larger unique geometric shapes, each larger unique geometric shape representing a specific value from 2 to 10; wherein a large square having a value of 10 is comprised by manipulating any combination of unique geometric shapes that when their specific values are added together equals the value of 10.
|
7. A method of teaching a person to do basic math operations comprised of teaching the person to manipulate a plurality of unique geometric shapes; each unique geometric shape having a specific value ranging 1-10, wherein the unique geometric shape having a value of 10 is formed by manipulating any combination of unique geometric shapes that when their specific values are added together equals the value of 10; wherein the plurality of geometric shapes are comprised of physical, written or digitized substrates, and wherein teaching the person to manipulate a plurality of unique geometric shapes is comprised of teaching the person to manipulate small triangles with a value of 1 forming larger unique geometric shapes, each larger unique geometric shape representing a specific value from 2 to 10; wherein a large square having a value of 10 is comprised by manipulating any combination of unique geometric shapes that when their specific values are added together equals the value of 10. 12. The method of claim 7 , wherein the basic math operations are performed using percentages.
| 0.763819 |
9,712,578 | 1 | 5 |
1. A computer-implemented method comprising: receiving a plurality of content items posted on pages of a social networking system; determining, by a processor, from the plurality of content items, a subset of content items determined to be high quality content items, the determination of the high quality content items comprising: receiving a user interaction rate associated with each of the plurality of content items posted on the social networking system; responsive to the user interaction rate indicating a positive reaction to the content item, including the content item in the subset as a high quality content item, the user interaction rate indicated as positive reaction when the user interaction rate is higher than or equal to a threshold interaction rate; and responsive to the user interaction rate indicating a negative reaction to the content item, excluding the content item from the subset, the user interaction rate indicated as negative reaction when the user interaction rate is lower than the threshold interaction rate; and for each of the content items of the subset: extracting a first topic from the content item by analyzing terms and phrases of the content item, mapping, by the processor, the extracted first topic to one or more related pages of the social networking system, the one or more related pages include the extracted first topic, and for each of the one or more related pages: identifying a user of the social networking system connected to the related page, and providing the content item in a newsfeed for display to the user.
|
1. A computer-implemented method comprising: receiving a plurality of content items posted on pages of a social networking system; determining, by a processor, from the plurality of content items, a subset of content items determined to be high quality content items, the determination of the high quality content items comprising: receiving a user interaction rate associated with each of the plurality of content items posted on the social networking system; responsive to the user interaction rate indicating a positive reaction to the content item, including the content item in the subset as a high quality content item, the user interaction rate indicated as positive reaction when the user interaction rate is higher than or equal to a threshold interaction rate; and responsive to the user interaction rate indicating a negative reaction to the content item, excluding the content item from the subset, the user interaction rate indicated as negative reaction when the user interaction rate is lower than the threshold interaction rate; and for each of the content items of the subset: extracting a first topic from the content item by analyzing terms and phrases of the content item, mapping, by the processor, the extracted first topic to one or more related pages of the social networking system, the one or more related pages include the extracted first topic, and for each of the one or more related pages: identifying a user of the social networking system connected to the related page, and providing the content item in a newsfeed for display to the user. 5. The method of claim 1 , wherein the determination of the high quality content items further comprises performing a semantic analysis on each of the plurality of content items, the semantic analysis comprises computing a semantic quality score representing a semantic quality for each of the plurality of content items and selecting the subset of content items with semantic quality score above a threshold semantic quality score, the semantic quality score inversely related to a number of subject matter topics in the content item.
| 0.708606 |
9,015,679 | 1 | 7 |
1. A computer-implemented method for generating a database management system (DBMS) internal program language function from a foreign program language function, the method comprising: loading the foreign program language function into a DBMS server; an internal program module unit examining the foreign program language function to determine whether the foreign program language function is annotated for translation; if the foreign program language function is annotated for translation, determining by the internal program module unit if the foreign program language function is translated into a DBMS internal program language function in a database accessible to the DBMS; if the DBMS internal program language function exists, executing the internal program language function by the DBMS server, else the internal program module unit compiling the foreign program language function into an internal program language function; if the foreign program language function is not annotated for translation, executing the foreign program language function; a parsing unit parsing the foreign program language function; generating an abstract syntax tree of the parsed foreign program language function; a type inference unit inferring a type of internal variables of the foreign program language function and output results; a normalizer unit preparing the abstract syntax tree for translation; a serializer unit generating an internal program language program wrapped in a stored procedure; and a deployer unit creating the stored procedure.
|
1. A computer-implemented method for generating a database management system (DBMS) internal program language function from a foreign program language function, the method comprising: loading the foreign program language function into a DBMS server; an internal program module unit examining the foreign program language function to determine whether the foreign program language function is annotated for translation; if the foreign program language function is annotated for translation, determining by the internal program module unit if the foreign program language function is translated into a DBMS internal program language function in a database accessible to the DBMS; if the DBMS internal program language function exists, executing the internal program language function by the DBMS server, else the internal program module unit compiling the foreign program language function into an internal program language function; if the foreign program language function is not annotated for translation, executing the foreign program language function; a parsing unit parsing the foreign program language function; generating an abstract syntax tree of the parsed foreign program language function; a type inference unit inferring a type of internal variables of the foreign program language function and output results; a normalizer unit preparing the abstract syntax tree for translation; a serializer unit generating an internal program language program wrapped in a stored procedure; and a deployer unit creating the stored procedure. 7. The method of claim 1 , wherein the foreign program language function is a business application function.
| 0.823529 |
7,899,836 | 1 | 2 |
1. A computer program product in a non-transitory computer readable storage medium having stored thereto instructions executed by a computer for providing an interface for generating a conditional expression for use with a computer application, comprising: first instructions for generating an initial user interface having a conditional expression component, an entry suggestion list component, and a hint message component, wherein the conditional expression component provides a current context of the conditional expression and includes one or more tokens for the conditional expression, wherein the one or more tokens for the conditional expression includes at least one hyperlink token that is selectable by a user, wherein the entry suggestion list component includes a listing of templates for conditional expressions, wherein at least one template in the listing of templates includes one or more hyperlink tokens that is selectable by a user, and wherein the hint message component includes a hint message identifying an action to be performed, or an input to be provided, by a user in association with the position in the conditional expression; second instructions for receiving user input from a user to the conditional expression component that builds the conditional expression, wherein the user input is one of a selection of a token in the one or more tokens and a modification of a token in the one or more tokens to update the current content of the conditional expression, wherein if the at least one hyperlink token for the conditional expression is selected by the user and if a hyperlink token of the at least one template in the listing of templates is selected by the user to form a selected hyperlink token, the entry suggestion list is updated to include entries for replacement of the selected hyperlink token; third instructions for dynamically updating the entry suggestion list component based on the user input to the conditional expression component responsive to receiving the user input, wherein the updated entry suggestion list component identifies one or more selectable entries for inclusion in the conditional expression at a position in the conditional expression corresponding to the user input, wherein user input is received for each of the one or more tokens to generate the conditional expression, and dynamically updating the hint message by the hint message component to include a message identifying an action to be performed, or an input to be provided, by a user in association with the position in the conditional expression corresponding to the user input; wherein the third instructions for dynamically updating the entry suggestion list component based on the user input to the conditional expression component include: instructions for generating a reference set of data identifying possible entries for a conditional expression; instructions for determining a token type for a selected token in the one or more tokens for the conditional expression; instructions for matching the token type to data types for entries in the reference set of data: and instructions for generating a listing of entries from the reference set of data which have data types that match the token type; and fourth instructions for replacing the one or more tokens for the conditional expression with the at least one selectable entry of the one or more selectable entries from the updated entry suggestion list component responsive to selecting at least one selectable entry of the one or more selectable entries from the updated entry suggestion list component.
|
1. A computer program product in a non-transitory computer readable storage medium having stored thereto instructions executed by a computer for providing an interface for generating a conditional expression for use with a computer application, comprising: first instructions for generating an initial user interface having a conditional expression component, an entry suggestion list component, and a hint message component, wherein the conditional expression component provides a current context of the conditional expression and includes one or more tokens for the conditional expression, wherein the one or more tokens for the conditional expression includes at least one hyperlink token that is selectable by a user, wherein the entry suggestion list component includes a listing of templates for conditional expressions, wherein at least one template in the listing of templates includes one or more hyperlink tokens that is selectable by a user, and wherein the hint message component includes a hint message identifying an action to be performed, or an input to be provided, by a user in association with the position in the conditional expression; second instructions for receiving user input from a user to the conditional expression component that builds the conditional expression, wherein the user input is one of a selection of a token in the one or more tokens and a modification of a token in the one or more tokens to update the current content of the conditional expression, wherein if the at least one hyperlink token for the conditional expression is selected by the user and if a hyperlink token of the at least one template in the listing of templates is selected by the user to form a selected hyperlink token, the entry suggestion list is updated to include entries for replacement of the selected hyperlink token; third instructions for dynamically updating the entry suggestion list component based on the user input to the conditional expression component responsive to receiving the user input, wherein the updated entry suggestion list component identifies one or more selectable entries for inclusion in the conditional expression at a position in the conditional expression corresponding to the user input, wherein user input is received for each of the one or more tokens to generate the conditional expression, and dynamically updating the hint message by the hint message component to include a message identifying an action to be performed, or an input to be provided, by a user in association with the position in the conditional expression corresponding to the user input; wherein the third instructions for dynamically updating the entry suggestion list component based on the user input to the conditional expression component include: instructions for generating a reference set of data identifying possible entries for a conditional expression; instructions for determining a token type for a selected token in the one or more tokens for the conditional expression; instructions for matching the token type to data types for entries in the reference set of data: and instructions for generating a listing of entries from the reference set of data which have data types that match the token type; and fourth instructions for replacing the one or more tokens for the conditional expression with the at least one selectable entry of the one or more selectable entries from the updated entry suggestion list component responsive to selecting at least one selectable entry of the one or more selectable entries from the updated entry suggestion list component. 2. The computer program product of claim 1 , wherein the conditional expression component includes a representation of the conditional expression in a hierarchical tree format.
| 0.5 |
8,069,185 | 1 | 9 |
1. A method of generating a concept dictionary for use in querying an information system comprising: (i) receiving an information search criterion; (ii) deriving from said received search criterion, using a lexical reference source, at least one different search criterion having related meaning to said received search criterion; (iii) identifying a set of information in said information system relevant to said received search criterion and a different set of information in said information system relevant to said at least one derived search criterion; (iv) analyzing the identified sets of information and deriving from similarities and differences therebetween relationships between said received search criterion and said at least one derived search criterion in the context of said information system; and (v) storing, in a concept dictionary, information relating to said received and said at least one derived search criterion and to respective said derived relationships therebetween, for use in querying said information system.
|
1. A method of generating a concept dictionary for use in querying an information system comprising: (i) receiving an information search criterion; (ii) deriving from said received search criterion, using a lexical reference source, at least one different search criterion having related meaning to said received search criterion; (iii) identifying a set of information in said information system relevant to said received search criterion and a different set of information in said information system relevant to said at least one derived search criterion; (iv) analyzing the identified sets of information and deriving from similarities and differences therebetween relationships between said received search criterion and said at least one derived search criterion in the context of said information system; and (v) storing, in a concept dictionary, information relating to said received and said at least one derived search criterion and to respective said derived relationships therebetween, for use in querying said information system. 9. A method as in claim 1 , wherein, at step (iv), deriving relationships between said search criteria comprises performing fuzzy processing of said derived search criteria and respective said identified sets of information to determine a measure of the and/or of one said search criterion over another in the context of said information system.
| 0.777706 |
9,177,019 | 3 | 4 |
3. The computer system of claim 2 , the query optimization means being operable for determining the ordered sequence at consecutive time intervals.
|
3. The computer system of claim 2 , the query optimization means being operable for determining the ordered sequence at consecutive time intervals. 4. The computer system of claim 3 , further comprising load determination means for determining a load parameter of the database, wherein the duration of the time intervals is inversely proportional to the load determined by the load determination means.
| 0.5 |
7,728,826 | 1 | 8 |
1. A mobile display apparatus serving as a client device of an external host apparatus, the mobile display apparatus comprising: a display section including a plurality of scanning lines arranged in a row and a plurality of signal lines arranged in a column and respectively intersecting with the scanning lines; a voice output section; a text code input section arranged to receive an input text code from the external host apparatus; a video signal input section arranged to receive an input video signal from the external host apparatus; a display control section arranged to display in the display section text corresponding to the input text code and including: a scanning line drive circuit defining a display section drive circuit that is arranged to drive the display section by sequentially supplying scanning signals to the scanning lines; and a signal line drive circuit arranged to supply video signals to the signal lines, the signal line drive circuit including a first signal line drive circuit that is arranged to receive the video signal from the video signal input section and a second signal line drive circuit that is arranged to receive a video signal corresponding to the text corresponding to the input text code; and a voice output control section arranged to output voice sounds corresponding to the input text code through the voice output section; wherein the text code input section outputs the input text code to the display control section and the voice output control section to display in the display section the text corresponding to the input text code, and to output the voice sounds corresponding to the input text code through the voice output section; the display control section displays in the display section both an image based on the input video signal supplied to the video signal input section and the text corresponding to the input text code so that the text is superimposed on the image; and the first signal line drive circuit and the second signal line drive circuit share the signal lines.
|
1. A mobile display apparatus serving as a client device of an external host apparatus, the mobile display apparatus comprising: a display section including a plurality of scanning lines arranged in a row and a plurality of signal lines arranged in a column and respectively intersecting with the scanning lines; a voice output section; a text code input section arranged to receive an input text code from the external host apparatus; a video signal input section arranged to receive an input video signal from the external host apparatus; a display control section arranged to display in the display section text corresponding to the input text code and including: a scanning line drive circuit defining a display section drive circuit that is arranged to drive the display section by sequentially supplying scanning signals to the scanning lines; and a signal line drive circuit arranged to supply video signals to the signal lines, the signal line drive circuit including a first signal line drive circuit that is arranged to receive the video signal from the video signal input section and a second signal line drive circuit that is arranged to receive a video signal corresponding to the text corresponding to the input text code; and a voice output control section arranged to output voice sounds corresponding to the input text code through the voice output section; wherein the text code input section outputs the input text code to the display control section and the voice output control section to display in the display section the text corresponding to the input text code, and to output the voice sounds corresponding to the input text code through the voice output section; the display control section displays in the display section both an image based on the input video signal supplied to the video signal input section and the text corresponding to the input text code so that the text is superimposed on the image; and the first signal line drive circuit and the second signal line drive circuit share the signal lines. 8. The mobile display apparatus as set forth in claim 1 , wherein: the display section includes a display element driven by a thin film element; and the text code input section, the video signal input section, the display control section, and the voice output control section are either directly provided on a thin film substrate on which a pixel driving circuit element of the display element is provided, or include active elements provided on another substrate which is bonded to the thin film substrate.
| 0.5 |
5,493,608 | 23 | 24 |
23. An apparatus according to claim 15, wherein said adjusting means further comprises means for determining said subsequent predetermined speaking rate, said determining means comprising: (a) means for increasing said subsequent predetermined speaking rate to a rate higher than said initial predetermined speaking rate, said increasing means comprising: (i) means for adding the numerical value one to the numerical value of said variable response time interval to arrive at a sum; (ii) means for modifying said sum if said sum is a fractional value by increasing the value of said sum to the next highest whole number to obtain a modified sum; (iii) means for dividing a first predetermined fixed number by a divisor selected from a group consisting of said sum and said modified sum to arrive at a numerical value to be added; and (iv) means for adding said numerical value to be added to a numerical value equal to an average number of words per minute spoken by said system at said initial predetermined speaking rate to arrive at a second numerical value; (v) means for setting an average number of words per minute spoken by said system at said subsequent predetermined speaking rate to said second numerical value; and (vi) means for limiting said subsequent predetermined speaking rate to a maximum speaking rate.
|
23. An apparatus according to claim 15, wherein said adjusting means further comprises means for determining said subsequent predetermined speaking rate, said determining means comprising: (a) means for increasing said subsequent predetermined speaking rate to a rate higher than said initial predetermined speaking rate, said increasing means comprising: (i) means for adding the numerical value one to the numerical value of said variable response time interval to arrive at a sum; (ii) means for modifying said sum if said sum is a fractional value by increasing the value of said sum to the next highest whole number to obtain a modified sum; (iii) means for dividing a first predetermined fixed number by a divisor selected from a group consisting of said sum and said modified sum to arrive at a numerical value to be added; and (iv) means for adding said numerical value to be added to a numerical value equal to an average number of words per minute spoken by said system at said initial predetermined speaking rate to arrive at a second numerical value; (v) means for setting an average number of words per minute spoken by said system at said subsequent predetermined speaking rate to said second numerical value; and (vi) means for limiting said subsequent predetermined speaking rate to a maximum speaking rate. 24. An apparatus according to claim 23, further comprising means for decreasing said subsequent predetermined speaking rate to a rate lower than said initial predetermined speaking rate, said decreasing means comprising: (i) means for reducing said initial predetermined speaking rate by a predetermined fixed number of words per minute to arrive at said subsequent predetermined speaking rate; and (ii) means for limiting said subsequent predetermined speaking rate to a minimum speaking rate.
| 0.5 |
7,685,140 | 1 | 2 |
1. A deployed dynamic information system comprising: a) a dynamic integration system including: (i) a persistent dynamic repository of data forming an asymmetric navigational database, and said database including an ontology model, said ontology model having an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models of data, and views which define the content and form of presentation of that data using a computer; and (ii) an integration system having components of shared infrastructure and services of an enterprise architecture that are exposed for use by one or more deployed information systems; (iii) an integration metasystem including: (A) components that describe components of shared infrastructure and services of an enterprise architecture, and (B) a dynamic information system software tool generating artifacts representing information and views that define the presentation of data, said artifacts being provided to said ontology model, and having interfaces to said abstract model framework that permit creation, reading and modification of the contents of said asymmetric navigational database; and b) a dynamic deployed system including: (i) a persistent dynamic data repository storing dynamic artifacts for system deployment, said dynamic artifacts representing information and views that define the presentation of data; (ii) a deployed metasystem having one or more components that describe components of infrastructure and services of a deployed information system architecture; and (iii) a deployed information system.
|
1. A deployed dynamic information system comprising: a) a dynamic integration system including: (i) a persistent dynamic repository of data forming an asymmetric navigational database, and said database including an ontology model, said ontology model having an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models of data, and views which define the content and form of presentation of that data using a computer; and (ii) an integration system having components of shared infrastructure and services of an enterprise architecture that are exposed for use by one or more deployed information systems; (iii) an integration metasystem including: (A) components that describe components of shared infrastructure and services of an enterprise architecture, and (B) a dynamic information system software tool generating artifacts representing information and views that define the presentation of data, said artifacts being provided to said ontology model, and having interfaces to said abstract model framework that permit creation, reading and modification of the contents of said asymmetric navigational database; and b) a dynamic deployed system including: (i) a persistent dynamic data repository storing dynamic artifacts for system deployment, said dynamic artifacts representing information and views that define the presentation of data; (ii) a deployed metasystem having one or more components that describe components of infrastructure and services of a deployed information system architecture; and (iii) a deployed information system. 2. The system of claim 1 , wherein, in said dynamic deployed system: said persistent repository forms an asymmetric navigational database, and said database includes an ontology model, said ontology model having an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models of data, views which define the content and form of presentation of that data using a computer, descriptions of common sharable and inheritable components related to an enterprise, that exist in said dynamic integration system, and definitions of the form and content of common artifacts for use in the enterprise; and said deployed metasystem further includes a dynamic information system tool generating artifacts representing information and views that define the presentation of data, common components related to a deployed information system, definitions of the form and content of common artifacts for use in said deployed information system, dynamically updated information describing said deployed information system; and processes for the creation, maintenance and management of said deployed information system generated by said deployed metasystem.
| 0.5 |
7,809,705 | 5 | 12 |
5. A computer-implemented method for classifying a web page, comprising: accessing, by one or more computing devices, local web page information of and global web graph information about a plurality of authoritative web pages, local web page information of and global web graph information about a plurality of non-authoritative web pages, and local web page information of and global web graph information about the web page, wherein: each authoritative web page of the plurality of authoritative web pages is a web page of known high quality, each non-authoritative web page of the plurality of non-authoritative web pages is a web page of known low quality, the local web page information of the web pages comprises text, clicking, domain, or time stamp information concerning the web pages, and the global web graph information about the web pages comprises hyperlink or co-citation relationships among the web pages; determining, by the one or more computing devices, a quality of the web page using collective inference by applying collective inference for binary classification of the web page using the local web page information of the web page and the global web graph information about the web page, the local web page information of the plurality of authoritative web pages and the global web graph information about the plurality of authoritative web pages, and the local web page information of the plurality of non-authoritative web pages and the global web graph information about the plurality of non-authoritative web pages, comprising finding a minimum value of a regularized convex dual of a logistic regression loss function for a node of a graph; and outputting, by the one or more computing devices, an indication of the quality of the web page.
|
5. A computer-implemented method for classifying a web page, comprising: accessing, by one or more computing devices, local web page information of and global web graph information about a plurality of authoritative web pages, local web page information of and global web graph information about a plurality of non-authoritative web pages, and local web page information of and global web graph information about the web page, wherein: each authoritative web page of the plurality of authoritative web pages is a web page of known high quality, each non-authoritative web page of the plurality of non-authoritative web pages is a web page of known low quality, the local web page information of the web pages comprises text, clicking, domain, or time stamp information concerning the web pages, and the global web graph information about the web pages comprises hyperlink or co-citation relationships among the web pages; determining, by the one or more computing devices, a quality of the web page using collective inference by applying collective inference for binary classification of the web page using the local web page information of the web page and the global web graph information about the web page, the local web page information of the plurality of authoritative web pages and the global web graph information about the plurality of authoritative web pages, and the local web page information of the plurality of non-authoritative web pages and the global web graph information about the plurality of non-authoritative web pages, comprising finding a minimum value of a regularized convex dual of a logistic regression loss function for a node of a graph; and outputting, by the one or more computing devices, an indication of the quality of the web page. 12. A computer-readable non-transitory storage medium having computer-executable instructions for performing the method of claim 5 .
| 0.911051 |
8,731,927 | 7 | 8 |
7. The method of claim 1 further comprising providing the fragments in a tree like structure.
|
7. The method of claim 1 further comprising providing the fragments in a tree like structure. 8. The method of claim 7 further comprising adding the scores for the different fragments building the list of entries on the basis of the tree like structure of the fragments.
| 0.5 |
9,110,883 | 2 | 6 |
2. The clause mapping method of claim 1 wherein the lexicon database comprises end terms SISR semantic lexicons, wherein an end terms SISR semantic lexicon is a lexicon having end term clauses on the mapping side and not having end term clauses on the list side, wherein an end term clause is a clause banned from mapping.
|
2. The clause mapping method of claim 1 wherein the lexicon database comprises end terms SISR semantic lexicons, wherein an end terms SISR semantic lexicon is a lexicon having end term clauses on the mapping side and not having end term clauses on the list side, wherein an end term clause is a clause banned from mapping. 6. The clause mapping method of claim 2 wherein the SISR semantic lexicons further comprises a superlative adjective lexicon.
| 0.503968 |
8,489,628 | 17 | 19 |
17. The method of claim 15 , further comprising suggesting, by at least one processor of the computing system, the phrase extension to the user to use in the query.
|
17. The method of claim 15 , further comprising suggesting, by at least one processor of the computing system, the phrase extension to the user to use in the query. 19. The method of claim 17 , further comprising receiving a selection from the user of the suggested phrase extension to use in the query.
| 0.696035 |
9,253,338 | 8 | 13 |
8. A method for routing a facsimile, comprising: receiving a facsimile in a computer readable format; locating one or more keywords in the facsimile, wherein at least two of the keywords are not adjacent in the facsimile; analyzing the facsimile to determine at least one of a meaning of the facsimile and a context of the facsimile; attempting to initiate a business process based at least in part on analysis; and detecting a problem with the attempt to initiate the business process; generating a notification of the problem; and routing at least a portion of the facsimile comprising text to one or more destinations based at least in part on the analysis.
|
8. A method for routing a facsimile, comprising: receiving a facsimile in a computer readable format; locating one or more keywords in the facsimile, wherein at least two of the keywords are not adjacent in the facsimile; analyzing the facsimile to determine at least one of a meaning of the facsimile and a context of the facsimile; attempting to initiate a business process based at least in part on analysis; and detecting a problem with the attempt to initiate the business process; generating a notification of the problem; and routing at least a portion of the facsimile comprising text to one or more destinations based at least in part on the analysis. 13. The method as recited in claim 8 , further comprising storing the generated notification in a log file.
| 0.778926 |
4,326,710 | 19 | 20 |
19. The game apparatus of claim 18 including means responsive to said second indication for generating an audible error signal.
|
19. The game apparatus of claim 18 including means responsive to said second indication for generating an audible error signal. 20. The game apparatus of claim 19 wherein said means responsive to said second indication for generating an error signal includes means for generating an audibly perceptible phrase.
| 0.5 |
10,163,439 | 8 | 10 |
8. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: during a trigger phrase enrollment process for a speech recognition-enabled electronic device: prompting a user of the speech recognition-enabled electronic device to speak a trigger phrase; receiving a first audio signal corresponding to the user speaking the trigger phrase; selecting a shortest segment among a plurality of segments in the first audio signal that have voice activity, each segment comprising a corresponding sequence of contiguous frames in the first audio signal that have voice activity; determining a length of the shortest segment by counting a number of frames in the sequence of contiguous frames corresponding to the shortest segment; and when the length of the shortest segment in the first audio signal satisfies a threshold value, training a trigger phrase model with the first audio signal corresponding to the user speaking the trigger phrase, the trigger phrase model configured to detect the trigger phrase in a spoken utterance; and after the trigger phrase enrollment process: receiving, while the speech recognition-enabled electronic device is in a sleep mode, a second audio signal including an utterance of the trigger phrase spoken by the user; and detecting, using the trigger phrase model trained during the trigger phrase enrollment process, the utterance of the trigger phrase in the second audio signal, the trigger phrase when detected in the second audio signal causing the speech recognition-enabled electronic device to wake from the sleep mode, the sleep mode comprising a power-saving mode of operation in which one or more parts of the speech recognition-enabled electronic device are in a low-power state or powered off.
|
8. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: during a trigger phrase enrollment process for a speech recognition-enabled electronic device: prompting a user of the speech recognition-enabled electronic device to speak a trigger phrase; receiving a first audio signal corresponding to the user speaking the trigger phrase; selecting a shortest segment among a plurality of segments in the first audio signal that have voice activity, each segment comprising a corresponding sequence of contiguous frames in the first audio signal that have voice activity; determining a length of the shortest segment by counting a number of frames in the sequence of contiguous frames corresponding to the shortest segment; and when the length of the shortest segment in the first audio signal satisfies a threshold value, training a trigger phrase model with the first audio signal corresponding to the user speaking the trigger phrase, the trigger phrase model configured to detect the trigger phrase in a spoken utterance; and after the trigger phrase enrollment process: receiving, while the speech recognition-enabled electronic device is in a sleep mode, a second audio signal including an utterance of the trigger phrase spoken by the user; and detecting, using the trigger phrase model trained during the trigger phrase enrollment process, the utterance of the trigger phrase in the second audio signal, the trigger phrase when detected in the second audio signal causing the speech recognition-enabled electronic device to wake from the sleep mode, the sleep mode comprising a power-saving mode of operation in which one or more parts of the speech recognition-enabled electronic device are in a low-power state or powered off. 10. The system of claim 8 , wherein the operations further comprise, for each frame in the received first audio signal: identifying audio characteristics of the user speaking the trigger phrase and audio characteristics of background noise for the corresponding frame in the received first audio signal; comparing the identified audio characteristics of the user speaking the trigger phrase to predetermined threshold values associated with one or more values for trigger phrase model training; and determining a voice activity detection flag for the corresponding frame in the received first audio signal in response to comparing the identified audio characteristics of the user speaking the trigger phrase to the predetermined threshold values.
| 0.5 |
8,108,385 | 12 | 13 |
12. The method of claim 1 , wherein the context vector received in the request includes weights for a plurality of context terms.
|
12. The method of claim 1 , wherein the context vector received in the request includes weights for a plurality of context terms. 13. The method of claim 12 , further comprising: using the weights to select a particular context term in the plurality of context terms as one of the one or more search keywords.
| 0.5 |
9,449,258 | 20 | 21 |
20. A non-transitory storage medium comprising instructions that when executed by a processor, cause the processor to: store in a memory a first set of trained classifiers and a second set of trained classifiers, wherein the 1 st set specifies values corresponding to a first plurality of attributes usable for identifying objects captured by a first camera, and the 2 nd set differs from the first set and specifies values corresponding to a second plurality of attributes usable for identifying objects captured by a 2 nd camera, wherein the first set of trained classifiers and second set of trained classifiers are trained independently, and wherein the first plurality of attributes and second plurality of attributes have at least one attribute in common; generate, using one or more images captured by the 1 st camera, a reference platoon of n objects, the reference platoon comprising a target object and (n−1) other objects; generate a reference group by running the first set of trained classifiers over the reference platoon, the reference group being indicative of values of attributes classified by the 1 st set of trained classifiers and characterizing the objects in the reference platoon; generate, using one or more images captured by the 2 nd camera, a plurality of candidate platoons, each candidate platoon comprising n objects, wherein the one or more images are captured by the 2 nd camera in a time window corresponding to the time of capturing by the 1 st camera the one or more images used for generating the reference platoon; generate a plurality of candidate groups, each candidate group obtained by running the 2 nd set of trained classifiers over a respective candidate platoon, each candidate group being indicative of values of attributes classified by the 2 nd set of trained classifiers and characterizing the objects in the corresponding candidate platoon; select a candidate platoon corresponding to a candidate group best matching the reference group; identify the target object in the selected candidate platoon in accordance with a position of the target object in the reference platoon.
|
20. A non-transitory storage medium comprising instructions that when executed by a processor, cause the processor to: store in a memory a first set of trained classifiers and a second set of trained classifiers, wherein the 1 st set specifies values corresponding to a first plurality of attributes usable for identifying objects captured by a first camera, and the 2 nd set differs from the first set and specifies values corresponding to a second plurality of attributes usable for identifying objects captured by a 2 nd camera, wherein the first set of trained classifiers and second set of trained classifiers are trained independently, and wherein the first plurality of attributes and second plurality of attributes have at least one attribute in common; generate, using one or more images captured by the 1 st camera, a reference platoon of n objects, the reference platoon comprising a target object and (n−1) other objects; generate a reference group by running the first set of trained classifiers over the reference platoon, the reference group being indicative of values of attributes classified by the 1 st set of trained classifiers and characterizing the objects in the reference platoon; generate, using one or more images captured by the 2 nd camera, a plurality of candidate platoons, each candidate platoon comprising n objects, wherein the one or more images are captured by the 2 nd camera in a time window corresponding to the time of capturing by the 1 st camera the one or more images used for generating the reference platoon; generate a plurality of candidate groups, each candidate group obtained by running the 2 nd set of trained classifiers over a respective candidate platoon, each candidate group being indicative of values of attributes classified by the 2 nd set of trained classifiers and characterizing the objects in the corresponding candidate platoon; select a candidate platoon corresponding to a candidate group best matching the reference group; identify the target object in the selected candidate platoon in accordance with a position of the target object in the reference platoon. 21. The medium of claim 20 , wherein the reference group is a reference sequence, and wherein the candidate groups are candidate sequences.
| 0.5 |
8,073,331 | 1 | 3 |
1. An optical system for communicating optical signals to and from a subscriber unit, comprises: a first set of selected wavelengths; a second set of selected wavelengths offset from the first set of selected wavelengths; a first subsystem configured to transmit to the subscriber unit, the optical signals of one or more wavelengths from the first set of selected wavelengths over an optical fiber; a second subsystem configured to transmit to the subscriber unit the optical signals of one wavelength selected from the second set of selected wavelengths in statistical time division multiplexing over the optical fiber; a third subsystem at the subscriber unit configured to receive the optical signals of the one or more wavelengths from the first set of selected wavelengths and the optical signals of one wavelength from the second set of selected wavelengths over the optical fiber; a fourth subsystem at a head-end configured to receive looped back optical signals of one wavelength from the second set of selected wavelengths from the subscriber unit to the head-end over the optical fiber; a cyclic arrayed waveguide grating router capable of routing more than one wavelength to the subscriber unit; and a phase modulator, an intensity modulator, an amplifier and a looped back configuration within the subscriber unit.
|
1. An optical system for communicating optical signals to and from a subscriber unit, comprises: a first set of selected wavelengths; a second set of selected wavelengths offset from the first set of selected wavelengths; a first subsystem configured to transmit to the subscriber unit, the optical signals of one or more wavelengths from the first set of selected wavelengths over an optical fiber; a second subsystem configured to transmit to the subscriber unit the optical signals of one wavelength selected from the second set of selected wavelengths in statistical time division multiplexing over the optical fiber; a third subsystem at the subscriber unit configured to receive the optical signals of the one or more wavelengths from the first set of selected wavelengths and the optical signals of one wavelength from the second set of selected wavelengths over the optical fiber; a fourth subsystem at a head-end configured to receive looped back optical signals of one wavelength from the second set of selected wavelengths from the subscriber unit to the head-end over the optical fiber; a cyclic arrayed waveguide grating router capable of routing more than one wavelength to the subscriber unit; and a phase modulator, an intensity modulator, an amplifier and a looped back configuration within the subscriber unit. 3. An optical system as in claim 1 , further comprising a wavelength combiner/decombiner for wavelength combining or wavelength decombining of two or more wavelengths.
| 0.690741 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.