10733001

Distinguishing Portions of Output from Multiple Hosts

PublishedAugust 4, 2020
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
5 claims

Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.

Claim 1

Original Legal Text

1. A method comprising: receiving a command, the processing of the command generating a character string; issuing to each computer in a set of computers the command for independent processing of the command by each computer; receiving, from the set of computers, a set of character strings responsive to the command; assigning a similarity score to each character string, the similarity score representing a relative similarity of the character strings in the set of character strings, each similarity score being determined by: comparing a scoring character string to each other character string in the set of character strings, wherein the scoring character string and the other character string are generated responsive to the command; and incrementing in a uniform manner the similarity score for the scoring character string for each other character string that is different than the scoring character string; generating a first display of the first command and identifiers of the set of computers, the display including the assigned similarity scores of each character string received from the set of computers; and generating a second display by overlaying each character string in the set of character strings.

Plain English Translation

This method describes receiving a command and distributing it to a group of computers for independent processing, each computer generating a character string as output. It then collects these output strings. For each string, a similarity score is calculated by comparing it against every other string in the group; the score increments for each instance where it differs from another string. This score effectively quantifies how distinct or dissimilar a character string is relative to the others. Finally, two displays are generated: a first display showing the original command, identifiers for each computer, and their respective character string similarity scores, and a second display visually overlaying all the generated character strings.

Claim 2

Original Legal Text

2. The method of claim 1 , wherein at least a computer of the set of computers is a virtual machine.

Plain English Translation

This method describes receiving a command and distributing it to a group of computers, where at least one of these computers is a virtual machine, for independent processing. Each computer generates a character string as output, which are then collected. For each string, a similarity score is calculated by comparing it against every other string in the group; the score increments for each instance where it differs from another string. This score effectively quantifies how distinct or dissimilar a character string is relative to the others. Finally, two displays are generated: a first display showing the original command, identifiers for each computer, and their respective character string similarity scores, and a second display visually overlaying all the generated character strings.

Claim 3

Original Legal Text

3. The method of claim 1 , further comprising: inputting the command as a text string through an overall view area; and feeding the text string to each computer in the set of computers.

Plain English Translation

This method describes receiving a command by inputting it as a text string through an overall view area, and then feeding this text string to a group of computers for independent processing. Each computer generates a character string as output, which are then collected. For each string, a similarity score is calculated by comparing it against every other string in the group; the score increments for each instance where it differs from another string. This score effectively quantifies how distinct or dissimilar a character string is relative to the others. Finally, two displays are generated: a first display showing the original command, identifiers for each computer, and their respective character string similarity scores, and a second display visually overlaying all the generated character strings.

Claim 4

Original Legal Text

4. The method of claim 1 , wherein: inputting the command as a text string through a single view area from among a plurality of single view areas; and feeding the text string through the single view area to a corresponding computer of the set of computers having the pre-defined output portion displayed in the single view area.

Plain English Translation

This method describes receiving a command by inputting it as a text string through a specific single view area chosen from multiple available view areas. This text string command is then fed through that same single view area to a corresponding computer in a group of computers, which has its pre-defined output portion displayed in that specific single view area. Each computer then independently processes the command and generates a character string as output, which are then collected. For each string, a similarity score is calculated by comparing it against every other string in the group; the score increments for each instance where it differs from another string. This score effectively quantifies how distinct or dissimilar a character string is relative to the others. Finally, two displays are generated: a first display showing the original command, identifiers for each computer, and their respective character string similarity scores, and a second display visually overlaying all the generated character strings.

Claim 5

Original Legal Text

5. The method of claim 1 , further comprising: emphasizing the overlaid character strings if the similarity score assigned to one character string is different from the similarity score assigned to each other character string.

Plain English Translation

This method describes receiving a command and distributing it to a group of computers for independent processing, each computer generating a character string as output. It then collects these output strings. For each string, a similarity score is calculated by comparing it against every other string in the group; the score increments for each instance where it differs from another string. This score effectively quantifies how distinct or dissimilar a character string is relative to the others. Finally, two displays are generated: a first display showing the original command, identifiers for each computer, and their respective character string similarity scores, and a second display visually overlaying all the generated character strings. Furthermore, if the calculated similarity score for one character string differs from the similarity scores of the other character strings, those overlaid character strings are visually emphasized.

Patent Metadata

Filing Date

Unknown

Publication Date

August 4, 2020

Inventors

Ryoji Kurosawa
Xiangning Liu
Koichi Nishitani
Fumihiko Terui

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, FAQs, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “DISTINGUISHING PORTIONS OF OUTPUT FROM MULTIPLE HOSTS” (10733001). https://patentable.app/patents/10733001

© 2026 Nomic Interactive Technology LLC. Machine-readable context available at /api/llm-context/10733001. See llms.txt for full attribution policy.