EP0992947A2 - Apparatus and method for the storing of data concerning the usage of an end-user device - Google Patents

Abstract

A non-volatile usage-memory (16) stores previous usage data and is connected to a microprocessor (6). The microprocessor is programmed in a storage mode for storing usage data corresponding to previous usage, and enters a communication mode in which data are transmitted from the usage memory to a remote store (31). The data transmission allows a statistical evaluation of the usage data. The microprocessor is programmed to re-initialize the usage memory in order to restore its predefined capacity after data transmission. A method of storing data relating to the usage of a terminal is also claimed.

Description

The invention relates to an arrangement and a method for storage data on the use of a terminal according to the preamble of claim 1 and claim 7. The arrangement and the procedure is especially for users of franking machines suitable.

Franking machines at least provide a postage value for the service to be printed on a print carrier (adhesive tape, letter). Further well-known services are, for example, postage calculations for example to determine the cheapest postage value Carrier or freight forwarder (EP 747 864 A2). On the one hand, it provides each terminal device the service for which it is programmed.

On the other hand, it is known to use a remote terminal Data center (DE 195 49 305 A1) or with a remote Personal computer (DE 195 17 557 A1) to connect to interact with to be able to use the services of the remote facility.

A franking machine is already known from EP 493 948 B1 the type of dispatch as a separate election printing stamp for the franking stamp or integrated with can print and with a plurality on registers in a secure module for storing accounting data is equipped, which is based on the use of the franking machine for franking objects. A first sentence to registers refers to a special first service and an second set of registers refers to a special second Service, the special services being selectable via the input means and the accounting data of the selected service be updated. But there are only certain services recorded for billing. These statements give the carrier insufficient information about customer behavior.

Now some postal authorities / carriers are required or through Discounts favored that the user prints over in the Franking machine saved operational processes, for mail stacks / freight accompanying documents / consignment note or in a time period, i.e. Invoices or statistics or receipts for a successful Reload to top up the credit. The customer behavior it would also be interesting for future mail carriers which new services will be offered for the postal transport, which then must be billed separately. According to EP 285 956 B1 there is one Franking machine with a special operating sequence memory and with a connection for an external printer. From the user is requested from the stored periodic collection of all data select and print only certain ones.

The user does not only have to provide a separate printer for this but possibly also a lot of time for the Find out and reserve the printing of the data.

The applicant's newer franking machines use digital printing units. For example, the franking machines T1000 and JetMail from the applicant Francotyp Postalia AG & Co. have a thermal transfer printer and an inkjet printer for the first time worldwide. In principle, this makes it possible to also print addresses and other information on a filled letter in the area of the franking stamp, which are related to a service. For example, election prints are printed on franking to indicate the type or form of dispatch.
The form of storage can be adapted to the needs of a large number of users of the same franking machine. In some machines, for example, class formation in the form of cost centers is assigned to individual user groups. To print out corresponding reports, even without a separate external printer, DE 42 24 955 A1 proposes a method and arrangement for internal cost center printing. The printouts that can be generated for each cost center contain lists of post use of the franking machine that can be subdivided into selected prints. The saving of the additional printer is advantageous for the users. However, it is unreasonable for users to repeatedly print out lists of data on the use of the franking machine at the request of the mail carrier or data center. Because, of course, franking cannot be carried out while printing lists of the cost center data by means of the print head internal to the franking machine.

FR 2 665 003 B1 describes a device for tracking the Post use of an electronic franking system known that with a central office communicates which electronic messages change. In addition to the bytes, the message format includes Information on identification, register status and credit status as well as a number of additional bytes for the statistical order. The bytes for the statistical order contain a breakdown by Postage values, by weights or by destination of the franked Mail. Part of the statistical order instructions can be modified during communication with the control center. The Modification of an instruction must be done in advance, before an statistical collection is started. Communication takes place via Telephone line or via electronic module, which physically connects to the communication partner must be transported.

EP 717 376 A2 discloses a franking machine with a statistical program known that the transfer of statistical data to the Data center via modem and changing parameters in the Franking machine for statistical data acquisition by downloading of new parameters from the data center to define the Carries out class boundaries. The ways to do one However, statistics are limited to postage value classes.

Due to the variety of services it is not always clear for which of the services the provider capacity will be expanded ought to. In some cases, outdated telecommunications systems do not allow high data throughput. Now was in a not pre-published German patent application 19731304.3-53 proposed in the data center generate selectable link instructions for class formation and in the form of new statistical instruction data for the franking machine transferred to. A new statistics mode is created in the franking machine due to the new statistical instruction data and before the use of functions and services and their statistical recording in the memory of the franking machine. An advantage is the pre-compression of the data by the link and that a transmission of pre-compressed data to the data center the process does not bother you, as it takes little time to transmit them.

The object of the invention is to store data in one Terminal and its communication with a remote data center to be designed in such a way that the type of statistics is subsequently defined can be. The end device is not supposed to keep statistics be blocked. Unaffected by the storage and transfer of Usage data is intended to be used in a service mode Terminal for services are made possible. For a franking device Services should also be statistically recordable, which can be used in interaction with the data center.

The object is achieved with the features of claims 1 and 7.

The invention is based on the availability of inexpensive memories with a very high storage capacity in order to collect usage data of a system. The usage data relate to information about user-selected properties of a system or features of a device, which are suitable for making services at least statistically recordable. The transport of mail or the dispatch of mail pieces by a public or private mail carrier is only one possible type of service offered by a service provider. The device of the shipping system is understood to mean a terminal located remotely from the service provider or a terminal of a franking system located at the customer. Properties of the shipping system or (customer / end) device are to be understood here as meaning specific user inputs and specific automatically made inputs which are connected with the order that a customer places on the service provider. On the one hand, the storage capacity of a usage memory can be used optimally, that is to say less than a known, purely historical storage of usage information, by space-saving storage space management of usage data. On the other hand, when the available storage capacity is fully used, the number of stores can be increased, ie the terminal or device of a franking system can be operated for a longer time before communication with the data center is required.
Shortly before or when the memory of the user memory overflows, the stored data is loaded into a memory of the data center. Based on the improved possibilities of communication with a high baud rate, communication only requires a relatively short period of time to transmit all data from the terminal to the data center. If the data transfer from the user memory to the remote memory of the data center is successful, the originally available memory capacity can be restored by reinitializing, possibly including deleting the user memory. The terminal is in particular a franking machine, a device of a franking and / or mail processing system, a PC franking device or any peripheral device of a system which itself provides a service or permits the use of the service of a third party. A record of individual events of use is created in a corresponding service mode. The usage information preferably identifies the postal use of the franking machine or a franking system. According to the invention, the franking mode comprises a storage mode for the cumulative storage of the current usage information together with the previous usage information. It is provided that a franking machine saves usage information on the one hand during its operation or as a result of your operation in the franking mode on the one hand and on the other hand in a form that reflects the historical sequence of events. Advantageously, however, no finished or pre-compressed statistics have to be stored in the postage meter machine. According to the invention, on-demand statistics are generated in the remote data center about the use of a terminal after loading the data from the user memory into the remote memory that was stored non-volatile in the user memory during use of the terminal.

It is envisaged that a space-saving historical storage method used and a data compression during transmission via modem is carried out. According to the invention, there is a storage waived from such usage data of an event that opposite the previously saved usage data of an earlier one Event are the same. Equality is the way it exists Differences are not detectable. For example, there are certain dates only in a connected scale and do not become a franking machine transfer. Equality in style also exists when existing Differences are not recorded in the parameter memory or one corresponding information is missing. A device may remain one Franking system unused or not connected (for example separate static scale).

According to the invention, information that relates to the already effective or inevitably still effective Obtain properties or characteristics that are suitable for services make statistically recordable, according to qualitative and quantitative Analyzed changes. An event of a qualitative change Property is historically stored in the for such usage data new memory locations are occupied. A quantitative change but only leads to the correction of the data in the occupied storage locations regarding the relevant data of the result of a previous one Analysis. The assignment to the other data remains.

The result of the analysis is in the form of a historical order of Records or in the form of historically listed event code in one Event list saved. This saves space Memory usage for historical storage of usage data regardless of the form of storage, i.e. independent of the information is stored in the form of data in a data record or alternatively, whether storage in the form of event code in a Event list is done.

Under an event there is a determination of a future change of state inevitably taking place or already taking place postal data or shipping information in one device understand that by an automatic or by the user Entry or setting is caused. One feature, which is related to the condition of a machine or system a service can change, for example, is a saved one (Special) setting of a franking machine or another Device of a franking system, which affects franking, because there is a comparable characteristic in the impression Characteristic appears or because at least when billing the Service affects a corresponding user input or because the user behavior affects. The saved (special) setting a franking machine or a franking system is also called Called parameters. Such parameters are in a parameter list listed and remain non-volatile until the next change in one Parameter memory saved. That precede the franking Change a parameter that relates to a qualitative property relates, according to the invention, is in the user memory 16 documenting event, which proves a change of state. At The space-saving storage method comes with a large number of such parameters special meaning too. It has been found that at a certain user behavior, is particularly advantageous if the Storage of qualitative and quantitative events Properties as listed specific code is done in an event list. The microprocessor is programmed according to the invention, the Allocation of storage spaces for the data of a data record in the current Organize the process according to the events that occur, where the data of the data set has at least one parameter value and include a number. An associated reference list saves each a specific code for those related to qualitative properties Events, the code being free within a predetermined limit definable dynamic process can be assigned to a property.

Figur 1a,

Blockschaltbild einer Frankiermaschine,

Figur 1b,

Variante mit separaten Benutzungsspeicher und mit OTP in der Steuereinrichtung der Frankiermaschine,

Figur 1c,

Blockschaltbild eines Meters einer Frankiermaschine,

Figur 2,

Gesamtablaufplan für eine Frankiermaschine.

Figur 3a und b,

Speicherformate in erster Variante mit einem Stückzähler und in der zweiten Variante mit mehreren Stückzählern,

Figur 3c-1 bis 3c-5,

Darstellung von Speicherzuständen nach einer dritten Variante mit separat verwaltet Stückzählern,

Figur 3d-1 bis 3d-5,

Darstellung von Speicherzuständen nach einer vierten Variante mit nur einem Stückzähler,

Figur 4,

Flußplan zur Abspeicherung von Benutzungsdaten gemäß Fig.3c,

Figur 5,

Darstellung eines Speicherplatzes der Parameter-Liste,

Figur 6,

Darstellung eines Speicherplatzes der Bezugs-Liste,

Figur 7a,

Suchroutine für Flußplan nach Figur 7b,

Figur 7b,

Flußplan zur Abspeicherung gemäß Fig.3d,

Figur 7c,

Subroutine zum Flußplan gemäß Figur 7b,

Figur 8,

Erweiterung auf eine beliebige Anzahl der Ereignisse,

Figur 9,

Darstellung einer Routine mit Speicher-Neuinitialisierung.

The space-saving historical storage method according to the invention differs from a statistic known per se with the formation of classes in that storage in classes with regard to qualitatively different usage is omitted and the historical sequence of storage of usage data can thus in principle be subsequently determined again. In contrast to a historical storage method known per se, a memory-saving method is used, which also leads to a shortening of transmission times for data transmission. The type of final statistics does not have to be determined in advance, but is defined at the time of the query or later when the on-demand statistics are generated in the data center. The transmitted data can thus advantageously be used retrospectively, possibly also at longer time intervals after a query, in order to generate a desired statistic if required. The on demand statistic has the advantage that a complete change of the statistic is possible for an evaluation at a late point in time.
Advantageous developments of the invention are characterized in the subclaims or are shown in more detail below together with the description of the preferred embodiment of the invention with reference to the figures. Show it:

Figure 1a,

Block diagram of a franking machine,

Figure 1b,

Variant with separate usage memory and with OTP in the control device of the franking machine,

Figure 1c,

Block diagram of a meter of a franking machine,

Figure 2,

Overall schedule for a franking machine.

3a and b,

Storage formats in the first variant with one piece counter and in the second variant with several piece counters,

3c-1 to 3c-5,

Representation of storage states according to a third variant with separately managed piece counters,

Figure 3d-1 to 3d-5,

Representation of storage states according to a fourth variant with only one piece counter,

Figure 4,

Flow chart for storing user data according to Fig.3c,

Figure 5,

Representation of a memory location of the parameter list,

Figure 6,

Representation of a memory location of the reference list,

Figure 7a,

Search routine for flow plan according to FIG. 7b,

Figure 7b,

Flow plan for storage according to Fig.3d,

Figure 7c,

Subroutine to the flow chart according to Figure 7b,

Figure 8,

Extension to any number of events,

Figure 9,

Representation of a routine with memory re-initialization.

FIG. 1a shows a block diagram of the franking machine according to the invention with a printer module 1 for a fully electronically generated Franking picture, with at least one having several actuating elements Input means 2, a display unit 3, the communication with a MODEM 23 producing a data center, further input means 21 or scale 22 which via an input / output control module 4 are coupled to a control device 6 and non-volatile Save 5a, 5b or 9, 10 and 11 for data or programs which include the variable or the constant parts of the franking image.

The German patent application DE 19534530 A1 provides more detailed information on individual functions of the agents. A character memory 9 supplies the necessary print data for the variable parts of the franking image to a volatile working memory 7. The control device 6 has a microprocessor μP which is connected to the input / output control module 4, to the character memory 9, to the volatile working memory 7 and to non-volatile working memories 5a, 5b (with internal usage memory) or (shown in dashed lines) with an additional usage memory 16, with a program memory 11, with the motor of a transport or feed device, possibly with a strip release 12, an encoder (coding disk) 13 and with a calendar - or clocks / date block 8 is connected. The memory module which comprises the non-volatile working memory 5b can be, for example, an EEPROM which is secured against removal by at least one additional measure, for example gluing on the printed circuit board, sealing or potting with epoxy resin. In the non-volatile memory 5a, the current parameters are stored in an area provided for this purpose, which are printed on the mail piece as at least the variable data after franking. This memory area can also be implemented as a separate parameter memory. The parameters listed accordingly in a parameter list and remain non-volatile in the parameter memory until the next change. The usage memory can also be implemented separately or, for example, within the non-volatile memory 5a by providing special memory areas. In the case of a special service provided by another service provider, separate memory areas (not shown) for use data or separate memory modules are provided. The individual memories can be implemented in several physically separate or combined in a few modules in a manner not shown. The required usage information is stored in at least one separate memory area, which includes a large number of memory locations 16-01 to 16-0n. In the exemplary embodiment, the memory module 16 is assigned to the service provider and its memory area to all cost centers. With a large number of memory areas, each memory area can be assigned to a cost center. A number of memory cells per memory location can be addressed by the microprocessor µP in accordance with the number of information units to be stored. The following information, such as number, postage value, date, advertising cliché number, weight, format, shipping information (form, type, destination) and certain errors can be mapped onto the aforementioned information units bits.
The available storage capacity in the user memory is, for example, 20 kbytes. It is optimally used by a space-saving storage management, which nevertheless allows a reconstruction of the order of the usage information for a service. The use of the franking machine in accordance with the franking service for sending mail pieces results in at least certain usage information. The usage information required for the subsequent creation of any statistics in the data center is transmitted to the data center via modem 23. A memory area is selected by a cost center entered by the user in order to store the postage value in a first memory location 16-01 as “first use information” when used for the first time. Additional memory locations for values or numbers are provided as usage information A counter is assigned to usage information, which is incremented if the subsequent use yields similar usage information, but if the subsequent usage results in dissimilar usage, correspondingly different usage information is stored in one of the subsequent storage locations. At least one exists in the second storage location 16-02 Assigned number of memory cells as a counter for storing a subsequent similar use The counter only requires a small number of memory cells in the second memory location 16-02 The storage space saving thus results from the piece count b in an immediately successive, similar use of the franking machine. In one variant, a single counter is assigned to a group of usage information. This is advantageous in the case of a stack of mail pieces, with the same group being able to be assigned to each mail piece. The individual usage information of the group remains unchanged. In another variant, the usage information advantageously consists of at least one code or identifier, which likewise only occupies a small number of memory cells in the memory location.

1b shows details of the block diagram of another variant the electronic franking machine with One Time programmable (OTP-) Processor shown in the control device. In EP 716 398 A2 proposed embodiment of a franking machine is a suitable OTP processor with non-volatile memory for billing and connected with an ASIC as an interface to the base. details this embodiment were in the German patent application DE 19534530 A1 with the title: Procedure for securing data and Program code of an electronic franking machine, as well as closer in German patent application DE 19731304.3-53 with the title: Procedure for reloading statistics mode and for statistical acquisition according to statistical classes when saving a data record. In principle, the block diagram shown in FIG. 1b also applies to one any other electronic control unit to which a not shown Printer and a modem, not shown, can be connected. According to the invention it is provided that the electronic control unit at least one separate storage area for usage data provides, which at intervals by modem to the data center can be transmitted. Alternatively, an electronic postage meter in a variant not shown here also by a Personal computer with connected standard printer can be realized if the throughput of mail in post processing is low may be. Such an arrangement is also called a PC franking device designated. The printer can also be used for high-speed mail processing be interpreted. A mail processing system with a printing machine base station controlled by a personal computer is in the unpublished German patent application DE 19711998.0 explains.

FIG. 1c shows a block diagram of the meter of an electronic franking machine, which can be removed from a base, which is also suitable for mixed mail processing. Part of the meter is a special security module 40, which bills and stores the frankings. The security module 40 is protected by physical and software security measures. For the non-volatile storage of usage data, a read / write memory 16 is connected to a microprocessor 6 of the meter. This memory has memory areas with a larger number of memory cells for data records. The microprocessor 6 is either coupled in the usual way to a volatile RAM 7, which stores the work variables, pixel data and forms the stack area for the various tasks, or is equipped with an internal RAM. The microprocessor 6 is connected to a program memory ROM 11 or is equipped with an internal ROM, with which the microprocessor 6 is programmed accordingly, so that data records are created in the non-volatile read / write memory 16 in accordance with the use. The non-volatile read / write memory 16 is, for example, an NV-CMOS-RAM or an E ² PROM. The microprocessor 6 is programmed accordingly in order to manage at least one of the memory areas, it being possible for a certain number of identical data records to be stored in the aforementioned memory area. A cliché memory 10, a battery-supported clock / date module 8, a postage rate memory 13 and input means and output means are also connected to the microprocessor 6 via a BUS 44. One input means is the keyboard 2. Another input means (not shown) can be a modem or a chip card read / write unit and possibly also functions as an output means. A display unit 4 is, for example, an LCD display with associated controller and a further output means is a printer, in particular in a base with an internal print head 1 which is not moved during printing and with which at least one franking stamp imprint can be printed on a postal item. Billing in the security module 40 can take place, as is explained in more detail in the European application EP 789 333 A2 (with the title: franking machine). Hardware billing is fast and tamper-proof, so that billing errors cannot occur. The security module 40 has an OTP processor (One Time Programmable) 50, a reset module 48 for starting on voltage recovery and a user-specific module 66 (ASIC) with an accounting unit 60 and a connected CMOS module supported by the lithium battery 42. RAM memory 41 on. The data to be billed are transmitted via a bus 44 in the base to the interface 64 of the user-specific component 66 and from there to the billing unit 60, which carries out the billing in terms of hardware. The print data are either transmitted from the microprocessor 6 via an interface 64 and printer monitoring unit 62 of the user-specific module 66 to the print register DR 15 of the print controller DS 14 of the printer or output directly via an I / O unit 4. In a manner known per se, the security module 40 has a secured housing and at least one additional physical security measure, which prevent a successful break-in into the security module and its exploration. Under the title: Arrangement for a security module, physical security measures were described in more detail in the unpublished German patent application 198 16 572.2. Under the title: Arrangement for access protection for security module, further physical security measures were described in more detail in the unpublished German patent application 198 16 571.4. The security module prevents misuse of programs or data stored in the meter, ie externally by the security module. Suitable security measures are also the European patent applications EP 660 269 A2 (method for improving the security of franking machines) and EP 762 227 A2 (method and arrangement for increasing the security against manipulation of critical data) and EP 762 338 A2 (method for securing data and program code an electronic franking machine).
The microprocessor 6 is preferably arranged in the meter of the franking machine and is connected to an internal franking machine interface to the base, in particular to an actuator / sensor control 17 and to an encoder 13 for determining the transport speed of the mail item, as already in principle in the EP 716 398 A2 was proposed. One of the actuators is a letter sensor, which determines when a letter or other mail item has reached the printing position, whereby letter thicknesses of up to 20 mm are possible. In the case of greater thicknesses of the postal matter, it is possible to work with a strip dispenser (not shown) for franking strips, which is also connected to the microprocessor 6 via the actuator / sensor control 17. In addition, the I / O unit 4 is provided with corresponding interfaces for modem and / or chip card read / write unit and with system interfaces for coupling further different external devices, for example an external scale, an automatic mail delivery, a mail storage or a personal computer PC.

FIG. 2 shows an overall flow chart for a franking machine Steps 417 to 430 according to the invention for a storage mode within of a franking mode 400. The sequence points to a start routine 101 a system routine 200 with a point s. It is intended that after switching on the franking machine in step start 100 a function test within a start routine 101 with subsequent Initialization is done. A program code in the unreadable internal OTP-ROM now allows several advantageous start security check routines, as in German patent application DE 19534530 A1 the title: procedure for securing data and program code one electronic franking machine have been set out in more detail. The end device is preferably a franking machine with a microprocessor 6 which is programmed, within a system routine 200 into an input / display routine 209 and to enter a franking mode (400), wherein the input routine 209 for collecting current usage data by the microprocessor of the franking machine in the non-volatile Memory 5a, request steps for entering at least the Franking value, the weight or the shipping information regarding usage includes. The process is done after the input / display routine 209 with a branch to a communication mode 300 and continued with the modified franking mode 400. In the modified Franking mode 400, steps 401 to 407 are preferably in processed in a known manner as explained above. A difference however, is that the OTP processor 50 of the security module 40 processes these steps, step 406 of the Hardware accounting unit 60 of the ASIC's 66 is executed. The Billing data is stored in the Li-battery-backed NV-RAM 41 in the Security module saved. There follow a number - not shown - Steps to create 415 a checksum and its DES encryption 416 to a MAC (Message Authentication Code).

• zum Vergleich aktueller Benutzungsdaten mit den kumulativ abgespeicherten Benutzungsdaten,
• Zur Abspeicherung eines neuen Datensatzes mit Benutzungsdaten im Benutzungsspeicher in historischer Reihenfolge entsprechend der Benutzung, wenn Benutzungsdaten gegenüber den im vorangehend abgespeicherten Datensatz befindlichen Benutzungsdaten verändert oder ungleichartig sind,
• zur Bildung eines Zählers für Benutzungsdaten,
• zur Inkrementierung des Zählers und Ersetzen entsprechender Daten eines bereits abgespeicherten Datensatzes durch neue Daten, welche den inkrementierten Zählerstand wiederspiegeln, wenn die aktuellen Benutzungsdaten gegenüber dem bereits abgespeicherten Datensatz unverändert oder gleich sind.

The step 209 for the input / display routine of properties of a system or features of the device, the franking mode together with a statistical mode is already described in the German patent application DE 19731304.3-53 with the title: Method for statistical mode reloading and statistical recording according to statistical classes at Storage of a data record, explained in detail. According to the task, a special memory mode according to the invention is now used instead of the statistical mode of the above-mentioned German patent application DE 19731304.3-53. The latter is equipped with a correspondingly large number of storage spaces for all of the usage information required to keep any statistics in the data center. The statistics are therefore not created in the franking machine.
The storage mode according to the invention (steps 417 to 430) is called within a franking mode 400 by the OTP processor 50 of the security module 40 or by the separate microprocessor 6 of the meter. However, the usage data is always saved outside the security module, in contrast to the accounting data. Such an arrangement for storing data on the use of a terminal consists at least of a memory and a microprocessor, a non-volatile use memory 16 being formed for the cumulative storage of previous use data, which is connected to the microprocessor 6. The microprocessor 6 is programmed to enter a storage mode and a communication mode. The microprocessor 6 is programmed in the communication mode for data transmission from the user memory 16 to a remote memory 31, the data transmission taking place in order to carry out a statistical evaluation of the user data remotely from the terminal. The microprocessor 6 is programmed to restore the original storage capacity after the data transfer has taken place. The microprocessor 6 is programmed in memory mode:

• to compare current usage data with the cumulatively stored usage data,
• For storing a new data record with usage data in the usage memory in historical order according to usage, if usage data is changed or different from the usage data in the previously saved data record,
• to form a counter for usage data,
• for incrementing the counter and replacing corresponding data of an already stored data record with new data which reflect the incremented counter reading if the current usage data are unchanged or the same as the already stored data record.

A parameter memory 5a is provided for the non-volatile storage of the current usage data. The current and previous usage data are stored in a non-volatile accumulation in the usage memory 16. In contrast to the handling of the accounting data, the usage data may be overwritten or deleted by the OTP processor 50 of the security module 40 or by the microprocessor 6 of the meter after it has been transmitted to the data center. It is envisaged that the microprocessor is programmed to restore the original memory capacity in the user memory 16 by overwriting or deleting the memory content as part of its reinitialization. FIG. 9 shows a routine with reinitialization of the user memory 16. After communication mode 300 (FIG. 2), point b and thus the beginning of the above-mentioned routine is reached. Query step 211 asks whether usage data has been transmitted to the data center during the communication. It is provided that after the transmission and storage of user data in the remote memory it is determined in query step 211 of a system routine 200 of the terminal that the data has been transmitted, that in step 213 the user memory 16 is re-initialized and then in step 215 a display text is generated before branching back to point s (FIG. 2) of the system routine 200. Alternatively, a branch can be made from the query step 211 to a step 214 for evaluating the communication. Between the points b and d of the flow chart shown in FIG. 2, there may be further queries before a service mode is reached which includes the storage mode according to the invention. If a user memory is too full, the service mode can also point directly to point g in order to automatically enter communication mode II. It is provided that the usage data stored in the usage memory of the terminal are transmitted to the data center shortly before or when the memory overflows. In connection with FIG. 7c, this is explained in more detail below how a full memory is recognized. As part of the reinitialization 213, the list end code is set to the storage location N = 0 (FIG. 9). The machine can determine that the run variable n = N = 0 is set. As part of the reinitialization, the memory content above the list end code can also be deleted. The memory area is thereby rewritable or free for new usage data and reaches the original status shown in FIG. 3d-1.
Alternatively, the routine according to FIG. 9 can optionally be carried out including deleting memory areas as part of communication mode 300 or 350 - which have been explained in the above-mentioned German patent application DE 19731304 A1.
According to FIG. 2, the following steps take place in the storage mode: A parameter comparison in step 417 shows, for example, that a new parameter value has been entered in the franking machine. In query step 418, an inquiry is made as to whether a new postage value has been entered in the franking machine in order to branch to step 424. In step 424, a new line is entered in a list if the new parameter value is the postage value. The system then branches to the next query step 419, because a further parameter value could also have been changed or entered for the first time. Otherwise, a branch is made to the second query step 419 if the first query in query step 418 shows that the postage value has not been changed and has not been entered for the first time. In query step 419, an inquiry is made as to whether a new weight value has been entered in the franking machine in order to branch to step 425. In addition to query step 419, a further query is run through. The additional branch condition to step 425 is that no new line has previously been entered in the same list. Otherwise, if a new line was entered in the same list in step 424, then the new weight value is written in step 422 in the new line already listed, whereby. the weight value represents a weight range. In step 425, a new line is entered in the same list if it has not already been done. Referring to the illustration in FIG. 3a, the information W1 from line J = 1 is revised when a new line has already been entered in the list in the same round. The method then branches to the third query step 420 via the query steps 418, 419. If the queries indicate that the values have not been changed and have not been entered for the first time because a new line has already been listed in the same list, then the third query step 420 is reached. In the third query step 420, a query is made as to whether a new date has been entered in the postage meter machine in order to branch to step 426. In addition to the query step 420, a further query is run through. The additional branch condition to step 426 is that no new line has previously been entered in the same list. Otherwise, the new date is entered in the new line already listed. In step 426, a new line is entered in a list if the new parameter value is the new date. The system then branches to the next query step 423. Otherwise, a branch is made to the next query step 423 if the third query in query step 420 shows that the date has not been changed and has not been entered for the first time. If, on the one hand, the change in a parameter is now determined, a branch is made to step 427 in order to store a new line in the list, if this has not yet happened in the same round. On the other hand, a large number of next query steps can be run through without a change in a parameter being ascertained. In such a case, a branch is made to step 428 in order to increment a piece counter Z: = Z + 1. Referring to the illustration in FIG. 3a, the counter reading in area N1 in the data record of line J = 1 is corrected accordingly without a new line having to be saved if the use is made in the same way or is repeated. In a subsequent step 429, the memory space still available in the memory area of the user memory 16 is checked. If the available storage capacity is still sufficient for storage of a next uneven use, then a branch is made to step 431 with the franking imprint routine known per se. On the other hand, if the list is almost full, branch to step 430 to generate a warning and close the time interval for storing usage information before branching to step 431 with the franking imprint routine. The franking imprint routine is preferably carried out by the microprocessor 6 in a manner known per se. Since the microprocessor in the system routine queries the print request 405 constantly and faster than a mail piece to be franked can be delivered, the execution of the query step 349 is assured. In this way, communication with transmission of the data to the data center and subsequent deletion of the memory area can be triggered indirectly.
FIG. 3a shows a storage format in a first variant. The microprocessor forms a piece counter Z by means of a memory. Only when one of the usage data is saved for the first time is Z set to the value 1 and the data record of new or changed and unchanged usage data is stored in a new line J = 2 repeated storage of unchanged usage data is sufficient if the incremented counter reading is entered in the area N1 of the first line J = 1, because there is obviously an identical use of the terminal.
Each line J stores data for the following information, such as number Nj, postage value Pj, calendar status Cj (date), advertising cliché number Aj, weight value Wj, format Fj, shipping information Dj (shape, type, destination) and, if applicable, certain detected errors Ej.
The memory lines J = 1, 2, ..., 5, ... are listed in the memory area in a historical order. A specific storage line can be assigned to a stack of mail pieces of items with the same franking if the items of the stack have been franked in succession, so that items with different stamps do not occur. A first line J = 1 then corresponds to a first stack of item items treated in the same way, a second line J = 2 then corresponds to a second batch of item items treated in the same way, a fifth line J = 5 then corresponds to a fifth stack of item items treated in the same way each of the memory lines J is then stored for similar use. A new line must only be written into the use memory 16 with corresponding new and the other previous use data if the use is different, ie if at least one of the information changes.

Figures 3a and 3b show two different storage formats for historical storage of similar or dissimilar usage information of a successive use according to a type of service. While in the variant according to FIG. 3a the storage locations in a storage line are arranged next to or in succession in a row so that the value for specific information can be read from the placement of each of the storage locations in the row, in the variant according to FIG. 3b the storage locations are arranged in a group which has an identifier, the identifier replacing the placement in a row. The variant according to FIG. 3b allows a group of three to be placed within a row of memory locations or within a line, which can now advantageously be carried out arbitrarily. The microprocessor is programmed to search for the current identifier of a parameter, which includes information about the sequence. It then reads out a group of three of interest that has been stored in memory spaces as a result of a last saving process. In the example explained, a group of three has three storage locations. However, this does not rule out that a grouping comprises a large number of storage locations.
A first group of three has bits B ₁₁ , bits B ₁₂ and bits B ₁₃ . Bits B _{11 of} the first memory location 16-01 relate to the value of a parameter. Bits B _{12 of} the second memory location 16-02 relate to the number of mail pieces with the same value of the parameter. Bits B _{13 of} the third memory location 16-03 relate to the identifier for the type of parameter. It is provided that the part of the identifier that says something about the chronological sequence of the storage of groups of three is formed by an incrementable counter reading.
Bits B _{11 of} the first memory location 16-01 of the first group of three relate to a first value of the parameter of the type postage value. Bits B _{21 of} the corresponding first memory location of a third group of three relate to a second value of the parameter of the postage value type, the second value of the parameter being set historically later. At least one further group of three lies between the first and third group of three. In the example chosen for FIG. 3b, there is a second group of three with information relating to an identification number of the advertising slogan, which was printed on a piece of mail in the first stack in addition to the franking. The identifier again comprises a part for the type of parameter and a part for the chronological sequence of the storage of the second group of three. The user memory 16 has a respective third memory location 16-03 in each group of three, in which an identifier is stored which is associated with the desired usage information. When the memory is queried, the microprocessor searches for the current identifier of a parameter and then reads out a group of three of interest which precedes the next identifier of a parameter. The value or the number of usage information is stored in the correspondingly provided first storage location 16-01, and the number of similar usage information in each case in the designated second storage location 16-02 of the group of three. Compared to the variant shown in FIG. 3a, however, several piece counters must be managed separately.

FIG. 3 c illustrates a storage format using the example of a list-like representation of memory states (FIGS. 3c-1 to 3c-5) in the course of historical storage of dissimilar or same usage information in a successive Use according to a type of service. The aforementioned Group of three memory locations is referred to below as a list. The number of lists results from the number of usage information. The latter are only for the sake of simplicity in the exemplary embodiment the postage value, the weight level and the date. You can actually Lists saved for a much larger number of uses become. The microprocessor in the Storage mode to be processed within the franking mode 400 (Steps 417 to 430).

At the beginning, each list is still empty. A parameter comparison in step 417 results, for example, in a letter with a postage value = 1.10 DM franked that the weight of the letter in a first Weight level GW1 and that the calendar block 8 that Shows the date 31.08.98. The microprocessor generates in memory mode (Steps 417 to 430) the state shown in FIG. 3c-1 in Usage memory 16.

The franking machine is then used in the same way when franking the next letter. The microprocessor increases in In this case, only the piece counter in the three lists and generated in Save mode (steps 417 to 430) that shown in Figure 3c-2 Status in the usage memory 16.

Now another eight letters of the same weight level GW1, with the same postage value of 1.10 DM with the same date 31.08.98 franked. This results in the state shown in FIG. 3c-3 Use memory 16. Only the piece counter was set to Z = 10 elevated. The first batch thus comprised ten letters of the same type.

Subsequently, two letters of the second weight level GW2, with a second postage value of 3.00 DM, but franked with the same date 31.08.98. This results in the 3c-4 state in the use memory 16. In the date list only the piece counter was increased to Z = 12. In both other lists for postage value and weight level were each new Line entered. The list shows: The franked first batch thus comprised ten letters of the same type and the historically following one franked second stack thus included two letters of the same type.

On the following day on September 1st, 1998, a letter of the first weight level GW1, with a first postage value of 1.10 DM, was franked. This results in the state shown in FIG. 3c-5 in the use memory 16. Since the piece counter in the first line of the date list is at Z = 12, the date relates to the entries in the first two lines of the lists for postage value and Weight level, but not on the entry in the last line. On the other hand, it is clear that another letter of the first batch was only franked on the following day, because a new line was entered in the date list, which should be assigned to the last line entered in the two lists for postage value and weight level.
Such data storage is space-saving and nevertheless allows for any evaluation later, after querying the data from the data center, with corresponding assignment of the data to one another.

FIG. 3 d illustrates a further advantageous storage format using the example of a list-like representation of the storage states (FIGS. 3d-1 to 3d-5). The difference to the format according to the first variant according to FIG. 3a is the avoidance of logging the same events in a new line. Rather, only the qualitatively changed or dissimilar events are recorded in the order in which they occur. This takes place in the form of an event list 500 with an associated reference list 610. Codes are entered in the event list 500, the reference to qualitatively changed or different events from the assigned reference list 610. The course of a historical storage of qualitatively changed or dissimilar events (usage information) can be seen from the event list 500. The reference list 610 stores reference entries for the codes for qualitatively changed or dissimilar usage information.
The reference entries require less storage space than the event entries because the same reference entry is not entered repeatedly if the same usage behavior is repeated and the same services are used.

• daß Code in der Bezugs-Liste 610 und der Ereignis-Liste 500 gespeichert werden, wobei jedem Code Daten zur Beschreibung der Art und des Wertes einer Eigenschaft zugeordnet in der Bezugs-Liste 610 gespeichert werden,
• daß einer der Code zum Vergleich der aktuellen Benutzungsdaten mit den kumulativ abgespeicherten Benutzungsdaten der Ereignis-Liste 500 entnommen wird,
• daß die zugeordneten Daten betreff der Art aufgefunden und mit den dem Parameterspeicher 5a entnommenen jeweilig aktuellen Daten zu Eigenschaftsarten aktueller Benutzungsdaten verglichen werden, wobei wenn die aufgerufenen Daten zur Art ungleich sind, ein jeweils weiterer Code der Ereignis-Liste 500 solange entnommen wird, bis alle diejenigen Code der Ereignis-Liste 500 abgefragt worden sind, die sich auf qualitative Eigenschaften beziehen und ins Verhältnis mit jeweilig aktuellen Daten zu Eigenschaftsarten aktueller Benutzungs-daten gesetzt werden, wobei der Mikroprozessor 6 bei Ungleichheit der Daten zur Art einen neuen Code generiert und in die Bezugs-Liste 610 und die Ereignis-Liste 500 einschreibt, wobei auch die Daten zur Art und zum Wert der neuen Eigenschaft dem Code zugeodnet in der Bezugs-Liste 610 gespeichert werden, sowie wobei bei Gleichheit der Art der Mikroprozessor 6 noch den Wert anhand der in der Bezugs-Liste (610) gespeicherten Daten mit den auf den Wert der aktuellen Eigenschaft bezogenen Daten auf Gleichheit überprüft und bei Ungleichheit zum Wert der neuen Eigenschaft einen neuen Code generiert, die Daten zur Art und zum Wert der neuen Eigenschaft dem neuen Code zugeodnet in der Bezugs-Liste 610 speichert und den neuen Code sowie einen zugehörigen Ein-Stück-Code in die Ereignis-Liste 500 aufnimmt, welche mit einem Listen-Ende-Code abgeschlossen wird,
• daß der Mikroprozessor 6 jedoch bei Gleichheit lediglich einen Stückzähler Z inkrementiert und einen entsprechenden aktuellen Stück-Code in der Ereignis-Liste 500 mit dem aktuellen Stück-Code überschreibt.

It is provided in a preferred embodiment that the non-volatile memory 5a is a parameter memory in which the property type and value of the current usage information are recorded as data by the microprocessor 6 of the postage meter machine when current usage data are acquired. The usage memory 16 of the arrangement has areas for storing an event list 500 and a reference list 610. A program memory 11 is connected to the microprocessor 6 and contains a program for the memory mode 417b-430b, whereby the microprocessor 6 is programmed

• that codes are stored in the reference list 610 and the event list 500, with each code data relating to the description of the type and the value of a property being stored in the reference list 610,
• that one of the codes for comparing the current usage data with the cumulatively stored usage data is taken from the event list 500,
• that the assigned data relating to the type are found and compared with the respective current data taken from the parameter memory 5a to property types of current usage data, and if the data called up are not the same, a further code from the event list 500 is taken until all those codes of the event list 500 have been queried which relate to qualitative properties and are set in relation to the respective current data on property types of current usage data, the microprocessor 6 generating a new code in the event of a discrepancy between the data and the type Registers reference list 610 and the event list 500, whereby the data relating to the type and value of the new property are also assigned to the code and stored in the reference list 610, and, if the type is the same, the microprocessor 6 also uses the value based on the in the reference list (610) stored data with the current value len property-related data is checked for equality and, if the value of the new property is not identical, a new code is generated, the data relating to the type and value of the new property are assigned to the new code and stored in the reference list 610 and the new code and an associated input Includes the piece code in the event list 500, which is ended with a list end code,
• that the microprocessor 6, however, in the case of equality, only increments a piece counter Z and overwrites a corresponding current piece code in the event list 500 with the current piece code.

The event list also stores the quantitative events accordingly for the same usage behavior, but not in historically. The quantitative events are counted and also stored in the form of a changeable code. At a consecutive same use of the terminal are the Code changed according to a number of pieces. For every quantitative A unique code exists in the event of a service type Program memory 11. The microprocessor accesses the im Program memory 11 stored predetermined code and writes him in the list. He changes everyone as part of the execution Service at least one code in the event list 500. The In the example shown, service is for the sake of simplicity preferably limited to franking mail pieces, but must don't be limited to that. A variety of different codes can also be reserved for another service or dynamic in the Process are generated. Each code is on a separate line in the List and only requires a small amount per line Storage space in the user memory 16. The each is advantageously reduced Line required space on an addressable by the microprocessor Storage space with a number of memory cells corresponding to the Number of digits of the code converted into a suitable number system. In practice, of course, for the machine language in binary code converted hexadecimal code used. In the simplest case it is a Bytes, i.e. 8. 8 bits, sufficient per line.

• Code 0 für das Frankieren an einem ersten Datum, ggf. mit Stunden,
• Code 1 für das Frankieren mit einem 1.Standardwert 1,10 DM,
• Code 2 für das Frankieren mit einem 2.Standardwert 3,00 DM, usw.
• Code 3 für eine Gewichtsstufe bis 20g,
• Code 4 bis 239 sind reserviert für weitere Eigenschaften,
• Code 240 für eine Frankierung von einem einzigem Poststück,
• Code 241 für ein Frankieren von zwei Poststücken,
• Code 242 für ein Frankieren von drei Poststücken, usw. bis
• Code 250 für ein Frankieren von elf Poststücken,
• Code 251 bis 255 reserviert für weitere Ereignisse und zur Steuerung.

For the sake of better understanding, the following clarification of the memory states is based on codes for one byte lines converted into the decimal number system. The events illustrated with reference to FIG. 3d are defined, for example, by:

• Code 0 for franking on a first date, possibly with hours,
• Code 1 for franking with a 1st standard value of 1.10 DM,
• Code 2 for franking with a second standard value of 3.00 DM, etc.
• Code 3 for a weight level up to 20g,
• Codes 4 to 239 are reserved for further properties,
• Code 240 for franking a single item of mail,
• Code 241 for franking two items of mail,
• Code 242 for franking three items of mail, etc. to
• Code 250 for franking eleven pieces of mail,
• Code 251 to 255 reserved for further events and for control.

As the state shown in FIG. 3d-1 shows in the usage memory 16, the reference list 610 is initially empty and the event list 500 contains only one code 255 for the end of the list in a first line (in the first memory location).
After billing for the first franking with the postage value of 1.10 DM, for example a first date code, the date and possibly the hour or more precise time values are entered in the reference list 610 in a first memory location 611. "0 = date, time", ie reference code and the associated description, are now entered there. The first reference code is generated by the microprocessor. The memory location number of the first memory location 611 can be used to form a first reference code 0, for example by subtracting a constant code from the address code of the memory location. With the help of the memory location number of the second memory location 612, the standard value code for the postage value can be generated. This and an assigned description for the type and the value, for example “1 = postage value 110”, are written into the reference list 610.

The state shown in FIG. 3d-2 thus results in the use memory 16. The event list 500 contains four lines, namely a first line (first memory location 501) with a first date code 0, a second line (second memory location 502) standard value -Code 1 for the postage value 1.10 DM, a third line (third memory location 503) with a one-piece code 240 and a fourth line (fourth memory location 504) with a code 255 for the end of the list.
FIGS. 3d-3 show the state in the user memory 16 after the billing for the tenth franking with the postage value of 1.10 DM. In the reference list 610 there are still only two lines: "0 = date, time" and "1 = Postage value 110 "entered. The event list also contains only four lines with a first date code, a standard value code 1 for the postage value 1.10 DM, but with a ten-piece code 249 and again a code 255 for the end of the list.

Figures 3d-4 shows the state in the use memory 16 after the Billing for a further two frankings, but with a second Standard postage value of 3.00 DM. In the list of orders is after the line "Postage value 110" entered a second line "Postage value 300". Outgoing from the first date code 0 the microprocessor can count increment to a first default code 1 and subsequent later to form a second default code 2, which in the second Line of the description "Postage value 300" is automatically assigned. The Event list now contains six lines with a first date code of 0 for the date, a first standard value code 1 for the postage value 1.10 DM, with a ten-piece code 249, with a second standard value code 1 for the postage value 3.00 DM, with a two-piece code 241 and another code 255 for the end of the list.

FIGS. 3d-5 show the state in the use memory 16 after the Settlement for another franking, but again with one first standard postage value of 1.10 DM. Also this time is also one Scale 22 connected, which provides a weight value of 20 g. In the Related list is "0 = date" after the first line and "1" after the second line = Postage value 110 "continue to enter the third line" 2 = postage value 300 ". After the third line, "2 = postage value 300" remains in the reference list a fourth line "3 = weight value 20" is entered. The event list now contains nine lines with a first date code 0, a first one Standard value code 1 for the postage value 1.10 DM, with a ten-piece code 249, with a second standard value code 2 for the postage value 3.00 DM, with a two-piece code 241, with a first standard value code 1 for the postage value 1.10 DM, with a first weight value code 3, with a one-piece code 240 and again with a code 255 for that End of list.

Only a certain number of events, for example with one byte per storage location (storage location) are reflected, must be in the program memory 11 before starting up for the first time To be defined. The user behavior in mixed mail processing is characterized by a reduced collection of similar mail. Forms a twelve-piece code 251 for franking twelve pieces of mail a limit found by experience, which the user only is rarely exceeded. If this limit is exceeded, a Tax code 252 and immediately afterwards a value code for the Number of pieces registered from this limit. Another Allow control code 253 with immediately following value code the further pushing of the limit for a piece count. Limits chosen according to a suitable number system basically allow other memory-saving counting methods.

The undefined events are during the machine runtime dynamically defined. The assignment of the code to events is said to take place during the runtime of the franking machine take place automatically. The events are only saved in the storage mode before Franking process included in the reference list. In the reference list can a precise description of the event are available.

The method provides that a change in a parameter or characteristic (property) is recorded as an event in the event list 500. If an event occurs that has already taken place earlier, you only need to make an entry in the event list. The code entered is also in the reference list 610 at a point to which the pointer drawn in FIG. 3D-5 points.
A constant number of bytes or at least 1 byte is advantageously reserved per entry in the event list 500. The number of different events is preferably limited to 240. However, if this number is not sufficient, two bytes are written in succession in an event list 500 *, the first byte having the code 254 and referring to a second reference list 620 shown in FIG. 8. If two bytes with the code 254 were to follow one another, reference is made to a third reference list 630, which is only shown for reasons of space. According to this principle, the detectable number of different events can be increased as desired.

A flow chart for storing usage data was shown in FIG in memory mode (steps 417 to 430) explains which is processed within the franking mode 400. The invention However, method is not based on this particular embodiment limited. A storage of usage data can in principle even after the franking printing routine has ended or immediately after step 405 to determine a print request. In connection with a varied storage organization, the special one Process in memory mode substituted, which in a detail based on the Figures 4 and 7a, 7b and 7c is explained for two variants.

FIG. 4 shows a flow chart for storing user data in accordance with the memory organization explained in FIG. 3c. A list-like storage of characteristics is assumed. The features are predetermined properties of the machine in connection with franking, in particular franking parameters and settings or errors. Processing takes place after the current feature has been determined or changed, for example by comparing the parameters, settings and errors already stored with the currently stored parameters, settings and errors that have occurred for each feature in the same way. In a first step 420a it is determined that the JOB "save feature" is to be carried out and the process branches to the first step 421a in order to call up a last feature M _m stored in the list. In a subsequent step 422a, the comparison with the current feature takes place. If the feature is identical to the listed feature M _m , only the counter Z _{m of} the listed feature is incremented to M _m : = M _m + 1 (step 425a). Otherwise, a new feature M _{n is} added at the end of the list in step 423a and the assigned counter is set to a start value Z _n : = 1 (step 424a).

FIG. 7b illustrates a flow chart for storing usage data, which relates to the storage format - explained with reference to FIG. 3d. It is assumed that events are stored in an event list 500 as a specific code with associated reference list 610. An event should now be added to the history as a result of a change in the status of qualitative properties. The list-like storage of events in the event list affects both qualitative and quantitative properties, the latter being assigned a permanently programmed code. The reference list 610 belonging to the event list 500 only contains events which relate to qualitative properties and an assigned code which is generated in a dynamic process which is freely programmable within predetermined limits. At least one group of data or code exists in the event list 500 for each event. The freely programmable code assigned to one of the qualitative properties is entered in a first memory location 501. The permanently programmable code assigned to one of the quantitative properties is entered in a second memory location 502. The storage in the event list 500 ends with the end of list code stored in the third memory location 503.
The microprocessor processes a number of steps to store data in the event list 500 or reference list 610. If a phase in the sequence is reached within the franking mode (for example after billing according to step 416 in FIG. 2) that the JOB "save event" is to be carried out, then the parameter list is called up in a step 417b, in which a large number of current properties are included. A property E1 of the first type relates, for example, to the set postage value, the index u of the event E1u illustrating the selection of one of 1, ... u, .., w different discrete values. A property E2 of the second type relates, for example, to the set weight level. According to a postage rate table, a discrete postage value is assigned to a weight level, but other shipping parameters are also included in the postage value calculation, so that the postage value cannot always be used to infer the weight level. The weight range is therefore so finely divided into weight levels that the specific weight in the area of a change from one level to the next is also recorded. A later evaluation in the data center or at the mail carrier can be used, for example, to determine the level in the postage rate table differently based on statistics on user behavior. A property E3 of the third type relates, for example, to the automatically set date for a day, which can be subdivided into discrete time stages, as described previously. There are further properties of i-th to k-th type, which are suitable for making services at least statistically recordable. The different properties may be assigned the same values (for example 110 g and 110.10 ^-2 DM). They are then distinguished by their type (corresponding to a unit of measure for a physical quantity). The order of the species is arbitrary. The parameter list is implemented, for example, in the non-volatile memory 5a. It contains a pre-programmed number of storage locations in the program memory for the different parameters (e.g. postage value, weight value, time of day / date, ... etc.).
The basic design of a memory location of the parameter memory is shown in FIG. A first byte is provided for the identification "i-th ART" of a parameter type (postage, weight, date, .. etc.) and another four bytes "lower value" for the concrete value of the parameter The discrete parameter value can only assume one of the large number of different possible values, and each discrete value is to be regarded as a qualitatively different property.

The basic design of a storage space in FIG Usage memory 16 for the reference list 610 shown. A first one Byte is "CODE" for an assigned code, another byte is "ART" for the identification of a parameter type (postage, weight, date, .. etc.) and another four bytes "VALUE" are for the concrete value of the Parameters provided.

According to FIG. 7b, the parameter list is called in step 417b. A flag P designated by the name MERKER_NEUE_EIGENSCHAFT is set to P: = 0 in step 418b and the first run variable i , which represents the number of the parameter to be processed, is set to the first parameter, ie now the run variable i : = 1.

A first local variable E receives the value of the property to be processed ( E _iu ) in step 419b. Since the run variable is i : = 1, the local variable E = E _1u is therefore used to _query the first property listed in the parameter list, eg postage value, to which the specific value 1 is assigned in this example. In step 419b, a second run variable j : = 1 is set and a byte counter is set to the initial value n: = N bytes, which corresponds to the number of lines currently reached in the event list.
Now a search routine 600 is branched to point a1, which searches the event list 500 for certain freely defined codes. A simplified search routine 600 is explained in more detail with reference to FIG. 7a. A query step 600a for N = 0 precedes this, which enables a branch to point c1 in FIGS. 7b and 7c, which is effective only after a reinitialization. In the latter case, the previous value N = 0 is increased by one (step 704). Otherwise, if N ≠ 0, then a memory location is selected in the first sub-step 601 of the search routine 600, by defining the nth memory location to n: = N - j. In this way, a preparation is made in order to be able to compare the successively called properties of the already recorded property types of the reference list with the property type called from the parameter memory in the following step 420b. The second run variable is set to j : = 1 and is subtracted from the byte counter value N. This results in the last line under the end of the list code, which is addressed and read out. The evaluation of the read code is carried out in sub-step 601 by comparison with the codes which are stored in the program memory 11 in a permanently defined manner.
The microprocessor now determines in sub-step 602 whether in the event list there has been a permanently programmed code in the nth memory location (line for the nth byte) because of the predefined meaning. If this is the case, point a3 is reached and a branch is made to sub-step 603, where the second run variable j is incremented by one, before branching back to sub-step 601 in order to reduce the byte counter value n, thus reducing the penultimate line under the end of list code 255 results. If it is determined in sub-step 602 that a freely programmed code (due to the fact that it has not been predefined) has been stored, then point a2 is reached. This code designates a qualitative property which can be evaluated in the subsequent step 420b.

The respective second byte for the identification of a parameter type in the memory location of the reference list shown in FIG. 6 contains - assigned to a code in each case - a characteristic value for a qualitative property "type". A second local variable EL is set to this characteristic value, which corresponds to the qualitative property of the event code listed in the event list 500 on the nth memory location. The characteristic value should correspond to one of the types, for example the date, weight, postage, ..., etc. The reference list 610 contains, for example, the assigned characteristic value for this type for the (freely defined) code listed in the event list 500. The second local variable EL, which was therefore set to a characteristic value corresponding to the type, which contains one in each second byte Each memory location (line) of the reference list is saved (Fig. 6), now serves as the actual value. The characteristic value of the i-th type serves as a setpoint for a comparison with the actual value of the second local variable EL in step 420b.

In step 421b it is now checked whether the same species has been found. If this is the case, the process branches to step 422b. In step 422b, the search in the reference list 610 is continued for the value for which 4 bytes in the memory location in the third place are reserved. A value of a current property from the parameter memory, to which the first local variable E was set in step 419b, can now be compared in step 422b with the aforementioned value, which is recorded in the reference list 610.

If, however, it is determined in step 421b that the same type has not been found, a branch is made to step 423b in order to check whether all the characteristic values of properties previously recorded have already been called up. This is only the case with a byte counter value of n = 0. If n = 0, a branch is made to point c1 at the start of a subroutine 700. If, however, not all the characteristic values of properties previously recorded have already been called up once, ie n ≠ 0, then the search routine 600 branches back to point a3. The search routine 600 thus serves to prepare for step 420b. In step 420b, the second local variable EL is set before the comparison , the latter being set to the corresponding characteristic value from the reference list 610, the characteristic value being assigned to the code which is in the nth memory location in the event list 500 is read. In this way, a check is carried out individually and then in step 421b whether one of the properties previously recorded matches the current property called up in the way. If this is the case, the values can still differ in the same way and the process branches back to step 422b. In step 422b, the reference list 610 searches for the stored concrete value which corresponds to the value of the variable E. If the check in the following query step 424b shows that there is also agreement regarding the value, then of course no new qualitative property needs to be recorded in the event list 500 and the process branches to step 425b in order to increment the first run variable i by one. The run variable i is thus set up in the next property type. In the subsequent query step 426b, it is determined whether all k types for which current parameter values can be recorded in the parameter memory have already been checked. If this is not the case, the process branches back to step 419b. This aforementioned branching-back provides for a loop in order to be able to compare all current properties with the properties previously stored.

Event list 500 is now removed from search routine 600 searched for a code from top to bottom, the searched one Code belongs to a type that, in step 420b, matches the property type "i-th ART" currently of interest is checked to if the match is determined in step 421b, in Step 422b the current property value from the parameter memory with the stored property value from the reference list 610 to compare. However, if inequality is determined in step 424b, the Point c2 branches for a second entry into subroutine 700. Now The microprocessor starts the subroutine 700, which is based on FIG. 7c is explained in more detail.

7c shows the subroutine 700 for the flow chart according to FIG. 4b, which is at least suitable to include the code for the new property in the event list 500 to save or at least one warning submit if the list is full. In sub-step 701 at point c1 at The beginning of the subroutine 700 is first the memory location number reached according to the last saved freely defined code queried and compared with a target number. Becomes the target number has not yet been reached, then the reference list 610 is not yet complete. Now the method branches to sub-step 702 in order to supplement the reference list. Otherwise, if the target number has been reached, in step 706 generates a "list full" warning and branches to point g (FIG. 2). Starting from point c2 for a second entry into subroutine 700 and starting from sub-step 702, query step 703 is reached, in which the byte counter value N reached with a corresponding one Setpoint is compared to decide whether the event list 500 is full is or is not yet full. If the event list 500 is full, is over again Branch 706 branches to point g (FIG. 2). Otherwise, if the Event list 500 is not yet full, the process branches to sub-step 704. In sub-step 704, a new event is entered as code in the event list added at the end of the list and then incremented the byte counter value N: = N + 1 before branching to sub-step 705. In sub-step 705 the flag_new_property p: = 1 is set and then the point c3 reached at the output of the subroutine.

None of the saved types was the same as one currently in Parameter memory recorded type, then becomes point c1 at the beginning of Subroutine 700 branches. But was the value listed in the reference list to an already saved type unlike the one currently in the Parameter memory recorded value, then becomes point c2 at the beginning of Subroutine 700 branches to the code for the new property in the Save event list 500, with the flag new property p is set to the value 1 or otherwise at least one Give a warning if the list is full.

From step 426b of the flow chart shown in FIG. 7b, a branch is made to step 427b when the loop has been processed and is therefore i> k, ie all current properties have been compared with the properties previously stored. In step 427b the flag_new_property p is evaluated, which can only have the values 0 and 1. If p = 1, a branch is made to step 428b and a 1-piece code 240 is entered at the end of the event list. The byte counter value is incremented by one: N: = N + 1. In a last step 430b, the list end code 255 is set at the end of the event list 500.
Otherwise, at p ≠ 1, a branch is made from step 427b to step 429b in order to increment the piece code at the end of the event list by 1. Starting from steps 429b or 430b, the end of the sequence is reached.

It is envisaged that a line-like storage of codes in an event list takes place, which relates to usage information where usage information is the number of pieces.

Usage information related to a new event assigned a freely definable code by the microprocessor, the Assignment is stored in a related list. The reference list can thereby in a second memory area of the user memory 16 or on reserved memory locations 16-0n + 1 in the first memory area get saved.

It is also provided that the codes related to the number of pieces are firmly defined, with an assigned one for each new event Quantity counter is set to a value one and in the event list a corresponding one-piece code is entered. The celebration defined code, which are not freely definable and not the reference list can be removed are stored in the program memory 11.

The invention is not in any of the present embodiments limited. The storage of usage data can be at any Location of the user memory and in any suitable form take place, for example in data records of variable length. A cumulative Saving significantly reduces the storage space requirement, it is however, with a very large free storage capacity available necessary. On this basis, a number of other variants are available in the Conceivable within the scope of the claims. Obviously, so can others Embodiments of the invention are developed or used by the same basic idea of the invention, starting from the enclosed claims are included.

Claims (15)

Arrangement for storing data on the use of a terminal, at least consisting of a memory and a microprocessor, characterized in that a non-volatile user memory (16) is connected to the microprocessor (6) for storing previous user data, and in that the microprocessor programs is entering a storage mode for storing usage data corresponding to a previous usage, to enter a communication mode, the microprocessor (6) being programmed in the communication mode for data transmission from the user memory (16) to a remote memory (31), the data transmission taking place in order to carry out a statistical evaluation of the user data from the terminal, and for reinitializing the usage memory (16) in order to restore the predetermined storage capacity in the usage memory (16) after the data transfer has taken place. Arrangement according to claim 1, characterized in that the microprocessor (6) is programmed in the memory mode: for comparison of current usage data with the usage data already stored, To store a new data record with usage data in the usage memory in historical order according to usage, if these usage data are changed or different from the usage data in the previously saved data record, to form a counter for usage data, as well for incrementing the counter and replacing corresponding data of an already stored data record with new data which reflect the incremented counter reading if the current usage data are unchanged or the same as the already stored data record. Arrangement according to claim 1, characterized in that the usage memory (16) is arranged separately from a non-volatile memory (5a, 41) for the postal register and usage data are stored independently of accounting data. Arrangement according to claims 1 and 2, characterized in that the microprocessor is programmed to organize the allocation of storage locations for the data of the data set in the current process in accordance with the events occurring, the data of the data set including at least one parameter value and a number of pieces. Arrangement according to claims 1 to 3, characterized in that the terminal is a franking machine with a microprocessor (6) which is programmed, within a system routine (200) into an input / display routine (209) and into a franking mode ( 400), the input routine (209) for recording current usage data by the microprocessor of the franking machine in the non-volatile memory (5a), requesting steps for entering current usage information relating at least to the franking value, weight or shipping, and wherein the franking mode (400 ) the storage mode (417 - 430, 417a - 430a or 417 - 430b) for the cumulative storage of the current usage information together with the previous usage information. Arrangement according to claims 1 to 5, characterized in that the non-volatile memory (5a) is a parameter memory in which the microprocessor (6) of the franking machine records the type and value of the current usage information as data when current usage data is acquired it can be detected that the usage memory (16) has areas for storing an event list (500) and a reference list (610), that a program memory (11) is connected to the microprocessor (6) and a program for the storage mode (417-430), whereby the microprocessor (6) is programmed, stores code in the related list (610) and event list (500), each code data describing the type and value of a property assigned in the reference list (610) that one of the codes for comparing the current usage data with the cumulatively stored usage data of the event list is stored (500) that the assigned data relating to the type is found and compared with the respective current data taken from the parameter memory (5a) on the types of properties of current usage data, with another code of the event being used if the data called up are different. List (500) is removed until all those codes from the event list (500) that relate to qualitative properties and are related to the respective current data relating to property types of current usage data have been queried, the microprocessor (6) if the data on the type are not identical, a new code is generated and written into the reference list (610) and the event list (500), the data relating to the type and value of the new property also being assigned to the code in the reference list ( 610) are stored, and the microprocessor (6), if the type is the same, also uses the value stored in the reference list (610) Data with the data relating to the value of the current property is checked for equality and, if the value of the new property is not equal, a new code is generated, the data for the type and value of the new property are assigned to the new code in the reference list (610) stores and the new code and an associated one-piece code in the event list (500), which is completed with an end-of-list code, but the microprocessor (6) increments only one piece counter (Z) if they are identical and overwrites a corresponding current piece code in the event list (500) with the current piece code. Method for storing data on the use of a terminal, characterized by Providing a usage memory (16) with predetermined available storage capacity, Use of a terminal with acquisition of current usage data which is assigned to at least one usage information, the current feature of usage or a change being determined by comparing corresponding current usage data with usage data which has already been stored, and Storage of a new data record with usage data in the usage memory (16) if these are changed or different from the previously saved data record, Incrementing a counter and replacing the corresponding data of a previously saved data record with new data which reflect the incremented counter reading if the current usage data is unchanged or the same as the already stored data record, Data transfer of the usage data from the usage memory (16) to a remote memory and Reinitialization of the usage memory (16) to restore the available predetermined storage capacity in the usage memory (16). Method according to claim 7, characterized in that the remote memory is a memory (31) of a remote data center and that shortly before or when the memory overflows, the user data stored in the user memory (16) of the terminal is loaded into the memory (31) of the data center become. Method according to claims 7 to 8, characterized in that after the transmission and storage of user data in the remote memory in the query step (211) of a system routine (200) it is determined that the data have been transmitted, that in step (213) in As part of the reinitialization of the user memory (16), a list end code is set to a memory location at the beginning of an event list and a display text is then generated in step (215) before branching back to point s of the system routine (200). Method according to Claim 7, characterized in that any statistics on the use of a terminal are generated in the data center after the user data from the user memory (16) has been loaded into the remote memory (31) and which were used during the use of the terminal in the Usage memory has been saved in a non-volatile manner. Method according to Claim 7, characterized in that a space-saving historical storage method is used for the storage in the user memory, line-type storage or replacement of data of a data record taking place during the use of a terminal with acquisition of current data which are associated with at least one usage information , and that data compression is carried out by modem when the data is transmitted to the data center. Method according to claim 9, characterized in that in step (213), as part of the reinitialization of the user memory (16), a list end code is set to a memory location at the beginning of an event list and the previously stored user data in the remaining memory locations are deleted. Method according to claim 9, characterized in that a data record with usage data in the usage memory consists of at least one code and that a line-like storage of codes takes place which relate to usage information . Method according to claim 13, characterized in that usage information is a quantitative property and / or a quantity. Method according to Claim 14, characterized in that a freely definable code is assigned to usage information relating to a new event, the assignment being stored in a reference list such that the codes relating to the number of items are fixedly defined, with each new event an assigned piece counter is set to a value one and a corresponding one-piece code is entered in the event list.

Images