COMPOSITE MACHINE AND DISTRIBUTION SERVER

PROBLEM TO BE SOLVED: To provide a composite machine and a distribution server whereby the labor of a user required to search a desired menu among many menus can be saved, without pressing a storage capacity of the composite machine. SOLUTION: A distribution server 200 registers menus performed by r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: KITAJIMA IKUO, OSANAI AKIRA, SAKAMOTO MASAKIYO, MATSUZAWA YUKARI, OZAKI MINORU
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:PROBLEM TO BE SOLVED: To provide a composite machine and a distribution server whereby the labor of a user required to search a desired menu among many menus can be saved, without pressing a storage capacity of the composite machine. SOLUTION: A distribution server 200 registers menus performed by respective composite machines 100-1, 100-2, 100-3 by each composite machine. The distribution server 200 receives acquisition request for a menu image, a model code, and a rearrangement key from the composite machine 100-1. Then the distribution server 200 accesses a composite machine menu registration table, wherein the composite machine 100-1 making the acquisition request is registered and rearranges the orders of the menus in accordance with the rearrangement key. The distribution server 200 transmits a menu image, representing the menus whose orders are rearranged to the composite machine 100-1 which is a request source. The composite machine 100-1 displays the received menu image on an LCD 141 of a panel 111, and the display order of the menus is the order designated by the rearrangement key. COPYRIGHT: (C)2005,JPO&NCIPI