AU5356099A - Arrangement and procedure for storing data about the use of terminal device - Google Patents

Arrangement and procedure for storing data about the use of terminal device Download PDF

Info

Publication number
AU5356099A
AU5356099A AU53560/99A AU5356099A AU5356099A AU 5356099 A AU5356099 A AU 5356099A AU 53560/99 A AU53560/99 A AU 53560/99A AU 5356099 A AU5356099 A AU 5356099A AU 5356099 A AU5356099 A AU 5356099A
Authority
AU
Australia
Prior art keywords
data
usage
memory
storage
code
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
AU53560/99A
Other versions
AU754215B2 (en
Inventor
Matthias Muller
Frank Reisinger
Olaf Turner
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Francotyp Postalia GmbH
Original Assignee
Francotyp Postalia GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Francotyp Postalia GmbH filed Critical Francotyp Postalia GmbH
Assigned to FRANCOTYP-POSTALIA AG & CO. reassignment FRANCOTYP-POSTALIA AG & CO. Amend patent request/document other than specification (104) Assignors: FRANCOTYP-POSTALIA G.M.B.H.
Publication of AU5356099A publication Critical patent/AU5356099A/en
Application granted granted Critical
Publication of AU754215B2 publication Critical patent/AU754215B2/en
Anticipated expiration legal-status Critical
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00362Calculation or computing within apparatus, e.g. calculation of postage value
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00016Relations between apparatus, e.g. franking machine at customer or apparatus at post office, in a franking system
    • G07B17/0008Communication details outside or between apparatus
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00193Constructional details of apparatus in a franking system
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00016Relations between apparatus, e.g. franking machine at customer or apparatus at post office, in a franking system
    • G07B17/0008Communication details outside or between apparatus
    • G07B2017/00153Communication details outside or between apparatus for sending information
    • G07B2017/00169Communication details outside or between apparatus for sending information from a franking apparatus, e.g. for verifying accounting
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00193Constructional details of apparatus in a franking system
    • G07B2017/00241Modular design
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00193Constructional details of apparatus in a franking system
    • G07B2017/00258Electronic hardware aspects, e.g. type of circuits used
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00362Calculation or computing within apparatus, e.g. calculation of postage value
    • G07B2017/00395Memory organization
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B17/00Franking apparatus
    • G07B17/00185Details internally of apparatus in a franking system, e.g. franking machine at customer or apparatus at post office
    • G07B17/00362Calculation or computing within apparatus, e.g. calculation of postage value
    • G07B2017/00427Special accounting procedures, e.g. storing special information

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Devices For Checking Fares Or Tickets At Control Points (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Computer And Data Communications (AREA)

Description

S F Ref: 481149
AUSTRALIA
PATENTS ACT 1990 COMPLETE SPECIICATION FOR A STANDARD
PATENT
ORIGINAL
S
*5 St. S 5.05
S
Name and Address ,c N^ C o of Applicant: Francot Potalia GmbHII Triftweg 21-26 OFF 16547 Birkenwerder
GERMANY
Actual Inventor(s): Matthias Muller, Frank Reisinger, Olaf Turner Address for Service: Spruson Ferguson, Patent Attorneys Level 33 St Martins Tower, 31 Market Street Sydney, New South Wales, 2000, Australia Invention Title: Arrangement and Procedure for Storing Data About the Use of a Terminal Device The following statement is a full description of this invention, including the best method of performing it known to me/us:- Of 0* S t* 0* ~~ocu~"snl'
P:
i i; B -u: r f C .3 tj V9 5845 Arrangement and Procedure for Storing Data About the Use of a Terminal Device Description The invention relates to an arrangement for storing data relating to a use of a terminal device, consisting at least of memory and a microprocessor and a procedure for storing data relating to a usage of a terminal device. The arrangement and the procedure are suitable particularly for users of franking machines.
Franking machines provide at least the service of printing a franking value on to a print carrier (adhesive strip, letter). Further known services are for example tariff calculation such as for instance for determining the franking value of a most cost-effective carrier respectively transport firm (EP 747 864 A2). On the one hand, each terminal device thus provides that type of service for which it has been programmed. On the other hand, it is known for the terminal devices to be connected to a remote data centre (DE 195 49 305 Al) or with a remote personal computer (DE 195 17 557 Al) in order to be able to utilise, while interacting with the remote facility, the services available at the latter.
Already known from EP 493 948 B1 is a franking machine which can print the transport mode separately from the franking stamp or integrated with it as a selectable imprint, and which is equipped with a multiple of registers, within a secured module, for storing accounting data relating to the use of the franking machine for franking articles. A first set of registers relates to a specific first service type and a second set of registers relates to a specific second service type, with the specific services 20 selectable by way of the input means and with the accounting data of the respective selected service being updated. However, only certain services are captured with a view to accounting use. These account data do not provide sufficient information to the carrier as far as user characteristics are concerned.
Some postal authorities/carriers do however require or encourage by way of discounts that the 25 user provide printouts concerning the operational activities stored in the franking machine for documents/waybills accompanying bulk mailings/freight carriage or within a period of time, ie. prepare accounting data respectively statistics or receipts for any recharge having taken place in order to *"replenish the credit. Predicting customer behaviour would also be interesting for future mail carriers that will offer new services of postal delivery, which then would require separate accounting.
According to EP 285 956 B1 a franking machine is equipped with a special storage facility for tracking operations, and with a connector for an external printer. The user is required to select and print only specific data from the stored capture of all data of a period.
To do this, the user not only has to provide a separate printer but must if necessary also expend considerable time for seeking out and printing the data.
Newer franking machines from the applicant employ digital printing engines. For example the franking machines T1000 respectively JetMail of the applicant Frankotyp Postalia AG Co. achieved a world first by incorporating a thermal transfer printer respectively an inkjet printer. With this it is possible, in principle, to print on to a sealed envelope, in the area of the franking stamp, even C07264 addresses and other information that bear a suitable relationship to a particular service. Thus for instance selectable imprints are printed during franking in order to specify the class or form of mailing.
The type of storage can be adapted to the requirements of a number of users of the one franking machine. Thus in some machines one finds a classification in the form of cost centres that are assigned to individual groups of users. For printing out corresponding reports even without an external printer, DE 42 24 955 Al proposes a procedure and arrangement for an internal printout of cost centres. The printouts, which can be prepared for any cost centre, contain listings, capable of being subdivisible according to selectable imprints, of the postage use of the franking machine. It is advantageous for the user that no additional printer is required. But the users cannot be expected to prepare lists with data about the use of the franking machine again and again upon request by the mail carriers respectively the data centre. For while the lists of cost centre data are being printed out by the internal print head of the franking machine one cannot of course use it for franking mail.
A device for tracking the postage use of an electronic franking system connected to a centre for exchanging electronic messages is known from FR 2 665 003 B1. Apart from the bytes the message format comprises information for identification, the state of the register and the credit level, as well as a number of additional bytes for statistical sequencing. The bytes for statistical sequencing *,.contain a breakdown according franking values, according to weights or according to destinations of the franked mail items. Some of the instructions for the statistical sequencing can be modified during communication with the centre. The modification of an instruction, however, must occur first, before 20 statistical capture is begun. Communications are made by telephone line or by means of an electronic module that must be transported bodily to the communications partner.
A franking machine with a statistical program that carries out the transmission of statistical data to the data centre by means of a modem and which permits altering statistical data capture parameters in the franking machines by way of downloading new parameters for defining class S0* 25 delimiters from the data centre is known from EP 717 376 A2. The possibilities for transacting a statistic are however limited to postage rate classifications.
Due to the multitude of service offerings it is not always clear for which of them the service ,providers ought to expand their capacity. In some cases obsolete telecommunications facilities do not permit high data throughputs. It has now been proposed, in German patent application 19731304.3- 53 which has not been published, to generate selectable logic switching instructions for classification and to transfer them to the franking machine in the form of new statistical instruction data. The creation of a new statistical mode occurs in the franking machine based on the new statistical instruction data, prior to the use of functions and services and their statistical capture in the memory of the franking machine. One advantage is the pre-compression of the data by way of the switching logic; furthermore, the transmission of pre-compressed data to the data centre does not hinder operations, since their transmission does not take much time.
The object of the present invention is to arrange the storage of data in a terminal device and its communication with a remote data centre in such a way as to make it possible to define the nature of the statistics later. The terminal device is not to be blocked by having to keep statistics. Regardless of the storage and transmission of usage data, the use of the terminal device is to be reserved for C07264 services while in a services mode. A franking facility is to be capable also to capture statistics for services that are used during interaction with the data centre.
The task is solved by way of an arrangement for storing data relating to a use of a terminal device, consisting at least of memory and a microprocessor, characterised in that a non-volatile usage memory is connected to the microprocessor for storing previous usage data as well as that the microprocessor is programmed to: enter a storage mode for storing usage data corresponding to a previous use, enter a communications mode, whereby the microprocessor in the communications mode is programmed for data transmission from the usage memory to a remote storage, with the data transmission occurring to undertake a statistical analysis of the usage data at a distance from the terminal device, and re-initialise the usage memory in order to restore the predetermined storage capacity in the usage memory after the data transmission has taken place; and also by a procedure for storing data relating to a usage of a terminal device, characterised by provision of a usage memory having a predetermined available storage capacity, use of a terminal device including capture of current usage data that are associated with at least one item of usage information, with the determination of the current characteristic of a use or change occurring by way of comparing respective current usage data with already stored usage data, and storage of a new dataset containing usage data in the usage memory if these are changed or dissimilar to the dataset stored before, incrementing of a counter and replacement of respective data of a dataset already stored :before with new data that reflect the incremented counter status, if the current usage data are 20 unchanged or equal to the dataset already stored before, data transmission of the usage data from the usage memory to a remote memory and re-initialisation of the usage memory to restore the available predetermined storage capacity in the usage memory.
The invention makes use of the availability of cost-effective memory with a very high storage capacity to collect the usage data of a system. The usage data relate to information on user-selected 25 properties of a system or characteristics of a device that are suitable for capturing at least service statistics. The carriage of mail respectively the transporting of mail items by a public or private mail carrier in this case is only one possible service offering of a service company. The term device of the dispatch system refers to a terminal situated at a distance from the service provider, respectively to the terminal device of a franking system situated on the customer's premises. The term characteristics of the dispatch system respectively of the (customer/terminal) device is here intended to refer to specific user inputs and specific automatically occurring inputs that are related to the order a customer places with the service provider. Advantageously, the storage capacity of a usage memory can be optimally utilised, ie. be provisioned smaller, by way of space-saving memory management, than is the case with a known purely historical storage of usage information. On the other hand, if the available storage capacity is fully utilised, it is possible to boost the number of stored events, that is the terminal respectively device of a franking system can be used for a longer period before there is a need for communicating with the data centre.
Shortly before, or during, an overflow of the usage memory the accumulated data are uploaded to storage at the data centre. Because of the improved communications possibilities, with a high data rate only a relatively short period of time is needed to transmit all of the data from the terminal device C07264 to the data centre. Upon successful data transmission from the usage data memory to the remote storage of the data centre the originally available storage capacity can be restored by re-initialising, including as the case may be the erasing of the usage data memory.
The terminal device is in particular a franking machine, a device of a franking and/or mail processing system, a PC-based franking unit or any peripheral device of a system that itself provides a service respectively which permits the use of the service by a third party. Individual usage events are recorded in a corresponding service mode. The usage information preferably characterise the postal use of the franking machine respectively of a franking system. The franking mode according to the invention comprises a storage mode for the cumulative storage of the current usage data together with the previous usage information. The franking machine is designed to store usage information during its operation or as a result of its operation in the franking mode both economically, on the one hand, and on the other hand in a form that reflects the historical sequence of the events.
Advantageously, however, no complete or pre-compressed statistics need to be stored in the terminal device franking machine. According to the invention, creation of on-demand terminal device usage statistics is carried out in the remote data centre upon uploading those data from the usage data memory into the remote storage which had been stored in non-volatile memory in the usage data memory during the use of the terminal device.
The invention provides for use of a space-saving historical storage process and for data compression via modem during the transmission. According to the invention, storage is skipped for 20 those usage data of an event that are equal to the previously stored usage data of a previous event.
There is an accordance of type if existing differences cannot be captured. For example, certain data are available only in connected scales and are not transmitted to the franking machine. Accordance of type also obtains if existing differences are not held in the parameter memory respectively if a corresponding piece of information is missing. Perhaps a device of a franking system remains unused or is not connected (for example separate, static scales).
According to the invention data that relate to properties or characteristics already effected or of necessity due to become effective and which are suitable for making services statistically accessible are analysed for qualitative and quantitative changes. An event of the qualitative change of a property is stored historically by allocating new storage space for such usage data. A quantitative change, however, only leads to the correction of the data in the allocated storage areas relating to the corresponding data of the result of a previous analysis. In this case the allocation to the other data remains.
The result of the analysis is stored in the form of a historical sequence of datasets or in the form of a historically listed event codes in an event list. Hereby results a space-saving memory utilisation for the historical storage of usage data, regardless of the type of storage, ie. regardless of whether the information is stored as data in a dataset or, alternatively, whether storage takes place as event codes in an event list.
The term event is intended to refer to the determination of a future, necessarily occurring or an already occurred change of state of postal data respectively dispatch information in a device, caused by an automatic or user-originated input or setting. A property that can alter the state of a machine or C07264 system in connection with the performance of a service is, for example, a stored (specific) setting of a franking machine, respectively of another device of a franking system, and which takes effect during franking, because a comparable characteristic feature appears during imprinting, or because at least during the billing of the service a corresponding user input takes effect, respectively because of the effect of the user behaviour. The stored (specific) setting of a franking machine respectively of a franking system is also called a parameter. Such parameters are listed in a parameter listing and remain stored in the non-volatile memory of a parameter memory until the next alteration. According to the invention, the change of a parameter relating to a qualitative property and which precedes the franking operation is an event to be documented in the usage memory 16 and which proves a change of state. With a large number of such parameters, space-saving memory allocation procedures are particularly important. It has been found to be particularly advantageous, with a certain type of user behaviour, for the storage of events concerning qualitative and quantitative properties to be listed as specific codes in an event list. According to the invention, the microprocessor is so programmed as to organise the allocation of memory space for the data of a dataset in the current process in accordance with the occurring events, with the data of the dataset comprising at least one parameter value and one unit number. An associated reference list stores a respective code for events relating to qualitative properties, with the code being capable of being associated with a property by way of a dynamic process that can be freely defined within preset limits.
The space-saving historical storage procedure according to the invention differs from otherwise known statistics with classification in that there is no storage in classes relating to qualitatively diverse usage and thus the historical storage sequence of usage data can in principle be retrieved again later. In contrast to an otherwise known historical storage procedure, a storage space-saving procedure is used which also leads to a reduction in transmission times during data transmission. The nature of the final statistics does not have to be predetermined, but is defined as necessary at the 25 time of inquiry, or later during the creation of on-demand statistics at the data centre. The transmitted data can thus advantageously be used later, if required even after longer periods following an inquiry, so as to enable the creation of a desired statistics when required. The on-demand statistics have the advantage of a complete conversion of the statistics being possible for analysis at a future date.
Advantageous further embodiments of the invention are characterised in the subordinate claims, respectively are shown in more detail in the following description of the preferred embodiment of the invention with reference to the drawings. Shown are in: Fig. la the block diagram of a franking machine, Fig. lb a variant having a separate usage data memory and an OTP in the control device of the franking machine, Fig. 1c block diagram of the meter of a franking machine, Fig. 2 overall flow diagram for a franking machine, Figs. 3a 3b storage formats in the first variant having one item counter and in the second variant with several item counters.
Figs. 3c-1 to 3c-5 representation of memory states according to a third variant having separately administered item counters, C07264 Figs. 3d-1 to 3d-5 representation of memory states according to a fourth variant with only one item counter, Fig. 4 flow diagram for the storage of usage data according to Fig. 3c, Fig. 5 representation of a storage location of the parameter list, Fig. 6 representation of a storage location of the lookup table, Fig. 7a search routine for flow diagram according to Fig. 7b, Fig. 7b flow diagram for storage according to Fig. 3d, Fig. 7c search routine for flow diagram according to Fig. 7b, Fig. 8 expansion to any desired number of events, Fig. 9 representation of a routine comprising re-initialisation of memory.
The figure 1 a shows a block diagram of the franking machine according to the invention having a printing module 1 for the fully electronic creation of a franking image, with at least one input means 2 possessing several actuating elements, a display unit 3, a modem 23 serving for communicating with a data centre, further input means 21 respectively scales 22 that are linked to a control device 6 by way of an input/output controller module 4, as well as non-volatile memories 5a, 5b respectively 9,10 and 11 for data respectively programs, which include the variable respectively the constant portions of the franking image.
In German patent application DE 19534530 Al more detailed descriptions are given regarding the individual functions of the means. A character memory 9 delivers the printing data required for the variable portions of the franking image to a volatile working memory 7. The control module 6 possesses a microprocessor LP which is linked 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 (having internal usage memories) respectively (shown dashed) to an additional usage memory 16, to a program memory 11, to the motor of a transport respectively advancing device having a tape cutter 25 12 as the case may be, an encoder (encoding disk) 13 as well as to a calendar respectively time/date module 8. The memory module comprising the non-volatile working memory 5b may for example consist of an EEPROM that is secured to prevent removal by at least one additional measure, for instance gluing to the circuit board, sealing or encapsulation by means of epoxy resin. In an area provided in the non-volatile memory 5a for this purpose, at least those current parameters are stored which correspond to the variable data imprinted on the postal article after the franking process. This memory area may also be formed as a separate parameter memory area. The corresponding parameters listed in a parameter list remain stored in non-volatile memory until any subsequent alteration. The usage memory may also be implemented separately or for example within the nonvolatile memory 5a by allocating specific memory locations. To cater for a special service provided by a different service provider, separate memory locations or separate memory modules not shown are provided for usage data. The individual memories can be implemented in several physically separate building blocks, or combined in only a few modules in a manner not illustrated here. The required usage data are stored in at least one separate memory area that contains a multiple of storage locations 16-01 to 16-On. In the example of embodiment the memory module 16 is assigned to the service provider, and its storage area with all cost centres. With multiple storage locations each C07264 storage location may be allocated to one cost centre. For each memory area a number of storage locations corresponding to the number of units of information Bits to be stored can be addressed by the microprocessor pP. In the above-mentioned information units Bits the following data can be represented: number of items, postage rate, date, advertising template code, weight, format, dispatch information (form, type, destination) and certain errors.
The available storage capacity of the usage memory is for example 20 kilobytes. It is optimally utilised by space-saving storage allocation, which however still permits reconstructing the sequence of usage data assigned to a service provision. Use of the franking machine corresponding to the service of franking for the dispatch of postal articles results in at least one specific usage information.
The usage data required for the subsequent creation of any desired statistics at the data centre are transmitted by way of Modem 23 to the data centre.
When a user inputs a cost centre, a storage location is selected so that with a first use of "franking" the postage rate is stored as the first usage information in a memory location 16-01. Further memory locations are provided for values or numbers in the way of usage information. A counter is associated with a unit of usage data, and it is incremented when the next use results in a similar usage information. If however the next use results in dissimilar usage, a correspondingly different usage information is stored in one of the subsequent memory locations. The second storage area 16- 02 possesses at least an assigned number of memory locations to serve as counters for storing a subsequent similar usage. The counter requires only a small number of memory locations in the 20 second storage area 16-02. The storage space saving thus results from counting items when there is immediate subsequent similar usage of the franking machine. In a variation, only one counter is associated with a group of usage data. This is advantageous in bulk mailings, when each postal article is associated with this same group. The individual usage data of the group remain unchanged.
In another variant, the usage data advantageously consists of at least one code respectively ID, S 25 which also requires only a small number of storage locations.
Fig lb shows details of the block diagram of another variation of the electronic franking machine having a One-Time Programmable (OTP) processor in the control module. In the form of the embodiment of a franking machine proposed in EP 716 398 A2, a suitable OTP processor is connected to a non-volatile memory for billing and to an ASIC serving as the interface to the base station. Details of this embodiment are given in German patent application DE 19534530 Al entitled "Procedure for securing data and program code of an electronic franking machine" as well as in more detail in German patent application DE 19731304.3-53 entitled "Procedure for reloading statistics mode and for the capture of statistics according to classes of statistics during storing of a dataset".
The block diagram shown in Fig. lb in principle also applies to any other electronic control module to which a printer not shown and modem not shown can be connected. It is provided, according to the invention, for the electronic control module to allocate at least one separate storage area for usage data, which periodically can be transmitted to the data centre via modem.
Alternatively, an electronic franking machine can also be implemented, in a variation not shown here, by means of a personal computer with connected commonly available printer for situations where there is no need for a large throughput of mail in mail processing. Such an arrangement is also called C07264 a PC franking machine. The printer, however, can also be adapted for high-speed mail processing. A mail processing system having a printing machine base station controlled via a personal computer is detailed in the unpublished German patent application DE 19711998.0.
Fig. 1c shows a block diagram of the meter of an electronic franking machine which can be removed from a base station that is also suitable for mixed mail processing. A specific security module 40 forms part of the meter and processes and stores the billing for postage used. The security module 40 is protected by security measures of both physical and software technology.
A read/write memory 16 is connected to a microprocessor 6 of the meter for the non-volatile storage of usage data. This memory possesses a large number of memory locations for storing datasets. The microprocessor 6 is either linked in the usual manner to a volatile working memory RAM 7, which stores the working variables, pixel data, and which forms the stack area for the various tasks, or it is equipped with internal RAM. The microprocessor 6 is connected to a program memory ROM 11, respectively is equipped with internal ROM, by way of which the microprocessor 6 is suitably programmed so that in accordance with usage datasets are created in the non-volatile read/write memory 16. The non-volatile read/write memory consists for example of NV-CMOS RAM or of an EEPROM. The microprocessor 6 is suitably programmed to manage the memory of at least one of the storage areas, with a certain number of similar datasets capable of being stored in the previously mentioned storage area. Also connected to the microprocessor 6 by way of a BUS 44 are an image .•"memory 10, a battery-backed clock/timer module 8, a postal tariff memory 13 as well as input and 20 output means. One input means is the keypad 2. A further input means not shown could be a modem or a smart card read/write unit and could equally serve as output means as the case may be.
Display unit 4 consists, for example, of an LCD display with associated controller, and a further ***output means is a printer, in particular housed in a base unit having an internal print head 1 that does not move during printing and with which at least one franking stamp can be imprinted on a mail item.
Use accounting in the security module 40 can occur as is shown in more detail in European application EP 789 333 A2 (entitled "Franking Machine"). Hardware-based use accounting is fast and secure from manipulation, so that billing errors will not occur. The security module 40 possesses an One-Time Programmable (OTP) processor 50, a reset module 48 for initialisation when power is restored, and an application-specific integrated circuit (ASIC) module 66 having a billing unit 60 as well as a linked CMOS RAM memory 41 backed by the lithium battery 42. The data that are to be billed are transferred to the interface 64 of the ASIC module 66 by way of a BUS 44 in the base unit, and then proceed to the billing unit 60 that processes billing in hardware. Print data are either output by the microprocessor 6 via an interface 64 and print control unit 62 of the ASIC module 66 to the printer memory DR 15 of the printer controller DS 14 of the printer, or are output directly by way of an I/O unit 4. The security module 40 possesses, in otherwise known manner, a secured housing and at least one additional physical security measure that prevent any successful break-in into the security module and searching of its contents. The unpublished German patent application 198 16 572.2 entitled "Arrangement for a security module" describes physical security measures in more detail.
Further physical security measures were described in more detail in the unpublished German patent application 198 16 571.4 entitled "Arrangement for access protection of a security module". The C07264 security module prevents misuse of programs or data stored in the meter, ie. externally from the security module. Suitable security measures can also be derived from the European patent applications EP 660 269 A2 ("Procedure for improving the security of franking machines") and EP 762 227 A2 ("Procedure and arrangement for increasing the protection against manipulation of critical s data") as well as EP 762 338 A2 ("Procedure for safeguarding data and program code of an electronic franking machine".
The microprocessor 6 is preferably disposed within the meter of the franking machine and is linked, by way of an interface internal to the franking machine, to the base unit, in particular to an actuator/sensor controller 17 and to an encoder 13 for determining the transport speed of the postal article, as has already been proposed in principle in EP 716 398 A2. One of the actuators is a letter sensor, which determines when the printing position of a letter or other mail article has been reached, allowing for letter thicknesses of up to 20mm. If the mail article is thicker, a tape dispenser for franking tape not shown can be deployed which is equally linked to the microprocessor 6 by way of the actuator/sensor control unit 17. In addition, the I/O unit 4 is provided with suitable interfaces for modem and/or smart card read/write unit, and with system interfaces for attaching further diverse external devices, for example external scales, an automatic mail transport device, a mail filing device or a personal computer (PC).
Fig. 2 shows an overall flow chart for a franking machine with the steps 417 to 430 according to the invention for a storage mode within a franking mode 400. The process possesses, after a starting 20 operation 101, a system routine 200 with a point s. It is proposed that after switching on the franking machine at step 100 there follows a power-on functional test with subsequent initialisation within a start routine 101. A program code in the inaccessible internal OTP ROM now permits several advantageous start-up safety check-up routines to run, as have been detailed in German patent application DE 19534530 Al entitled "Procedure for protecting data and program code of an 25 electronic franking machine". The terminal device preferably consists of a franking machine with a microprocessor 6 that is programmed to enter, from within a system routine 200, into an input/output routine 209 and into a franking mode (400), with the input operation 209 including prompting steps for entering at least one unit of usage data concerning the franking value, the weight or the dispatch method so that current usage data can be captured by the microprocessor of the franking machine into the non-volatile memory unit Sa. Following input/output routine 209, program execution is continued by branching to a communications mode 300 and with the modified franking mode 400. In the modified franking mode 400 steps 401 to 407 are preferably processed in a known manner as detailed above. There is a difference however in that the OTP processor 50 of the security module carries out these steps, with step 406 being carried out by the hardware accounting unit 60 of the ASIC 66. The accounting data are stored in lithium battery-backed non-volatile RAM 41 of the security module. Then follows a number of steps not shown to create a checksum 415 and its DES encryption 416 into a Message Authentication Code (MAC).
Step 209 for the input/output operation of system properties or device characteristics, the franking mode, has already been comprehensively detailed, together with the statistics mode, in the German patent application DE 19731304.3-53 entitled "Procedure for reloading statistics mode and CO7264 for capture of statistics according to classes of statistics during the storing of a dataset". In keeping with the task objective, instead of the statistics mode of the above-cited German patent application DE 19731304.3-53, a specific storage mode is now employed according to the invention. The latter is equipped with a correspondingly large number of storage locations for the entirety of the usage data, which are required for keeping any desired statistics at the data centre. The statistics are therefore not generated within the franking machine.
The storage mode according to the invention (steps 417 to 430) is called up 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, unlike the billing data, usage data are always stored outside of the security module. Such an arrangement for storing data regarding the use of a terminal device consists at least of memory and a microprocessor, with a non-volatile memory area 16 being formed for a cumulative storage of previous usage data and being connected to the microprocessor 6. The microprocessor 6 is programmed to enter into a storage mode and into a communications mode. In the communications mode the microprocessor 6 is programmed to carry out data transmission from the usage memory 16 to a remote memory 31, with the data transmission occurring in order to carry out a statistical analysis of the usage data remotely from the terminal device. The microprocessor 6 is programmed to restore o the original storage capacity upon completion of the data transmission. The microprocessor 6, in **storage mode, is programmed to: compare current usage data with the cumulatively stored usage data; store a new dataset with usage data in the usage data memory in historical sequence corresponding to the usage, if usage data are different from the usage data in the preceding stored dataset or have been changed; form a counter for usage data; increment the counter and replace corresponding data of an already stored dataset with new 25 data reflecting the incremented counter state if the current usage data are unchanged or equal to the dataset already stored.
A parameter memory 5a is provided for the non-volatile storage of the current usage data. In the usage data memory 16 the current and previous usage data are held in non-volatile memory. In contrast to the treatment of billing data, the usage data may be overwritten or erased by the OTP processor 50 of the security module 40 or by the microprocessor 6 of the meter following transmission to the data centre. It is proposed that the microprocessor is programmed to restore the original storage capacity in the usage memory 16 by way of over-writing or erasing the memory contents within the framework of its re-initialisation.
Fig. 9 shows a routine including re-initialisation of the usage memory 16. Following the communications mode 300 (Fig. 2) point b is reached, and thus the beginning of the abovementioned routine. In inquiry step 211 the program checks whether usage data have been transmitted to the data centre during the communication. It is proposed that following transmission and storage of usage data in the remote memory, it is established in the inquiry step 211 of a system routine 200 of the terminal device that the data have been transmitted, that the usage memory 16 is re-initialised in step 213 and that subsequently a display text is generated in step 215 before program C07264 11 execution branches back to point s (Fig. 2) of the system routine 200. Alternatively, execution could branch from inquiry step 211 to a step 214 for analysis of the communication. Between the points b and d of the flow diagram shown in Fig. 2 there could be further inquiries made before a service mode is reached that includes the storage mode according to the invention. When a usage memory becomes too full there could also be direct branching from the service mode to point g so as to automatically enter into a communications mode II. It is proposed that shortly before or during memory overflow the usage data stored in the usage memory of the terminal device are transmitted to the data centre. It will be further explained below in connection with Fig. 7c how a full-memory state is recognised. In the framework of the re-initialisation 213 the end-of-list code is placed in storage location N 0 (Fig. 9).
The machine can detect that the control variable n N 0 has been set. As part of the reinitialisation the memory contents above the list end code may also be erased. The storage area thus can be written to again, respectively is freed for new usage data and reaches the original status shown in Fig. 3d-1.
Alternatively, the routine can run according to Fig. 9, as the case may be including with the erasure of storage areas as part of the communications mode 300 respectively 350 as has been detailed in the above-mentioned German patent application DE 19731304 Al.
In accordance with Fig. 2 the following steps are executed in storage mode: a parameter comparison in step 417 for instance determines that a new parameter value has been input into the franking machine. In inquiry step 418 it is checked whether a new postage rate has been input into the franking machine, in order to branch to step 424. In step 424 a new line is entered into a list if the new parameter value is a postage rate. Then there is a branch to the next inquiry step, as it is possible that in addition, a further parameter value may have been altered, respectively been entered for the first time. Otherwise, the program branches to the second inquiry step 419 when the first inquiry in step 418 determines that the postage rate has not been changed and has not been entered for the first time. In inquiry step 419 one checks whether a new weight value has been entered into the franking machine, so as to branch to step 425. With this a further inquiry is made in addition to inquiry step 419. The additional branching condition to step 425 is that no new line has been previously entered into the same list. Otherwise, in case a new line has been entered into the same list in step 424, the new weight value is written into the new line already listed, with the weight value representing a range of weights. In step 425 a new line is entered into the same list, if this has not been done already. Referring to the representation in Fig. 3a, the information Wl from the line J 1 is rewritten if a new line has already been entered into the list in the same round. Subsequently the program branches to the third inquiry step 420 via the inquiry steps 418, 419. If the inquiries determine that the values have not changed and have not been entered for the first time because a new line has already been listed in the same list, the third inquiry step 420 is reached. In the third inquiry step 420 one asks whether a new date has been entered into the franking machine, so as to branch to step 426. Here the program executes, in addition to inquiry step 420, a further inquiry. The additional branching condition for step 426 is that no new line has previously been entered into the same list. Otherwise the new date is written into the new line already listed. In step 426 a new line is 007264 written into a list if the new parameter value is the new date. Then the program branches to the next inquiry step 423. Otherwise there is immediate branching to the next inquiry step 423 if the third inquiry in inquiry step 420 determines that the date has not been changed and that it has not been entered for the first time. If on the one hand a parameter change is detected, then the program branches to step 427 in order to store a new line into the list, if this has not been done yet in the same round. On the other hand, it is possible for a multiplicity of subsequent inquiry steps to be executed without a parameter change being detected. In such a case the program branches to step 428 to increment an item counter Z: Z 1. Referring to the illustration in Fig. 3a the counter state is corrected accordingly in the area N1 in the dataset of line J 1, without a new line having to be stored if the usage is similar respectively repeated. In a subsequent step 429 the remaining available storage space in the memory area of the usage memory 16 is checked. If there remains sufficient available storage capacity for storing a following dissimilar usage then there occurs branching to step 431 containing the otherwise known franking print routine. Otherwise, if the list is almost full, there occurs branching to step 430 in order to generate a warning and to close the time delay for storing usage information before there occurs branching to step 431 with the franking print routine. The franking print routine is executed in otherwise known fashion preferably by the microprocessor 6.
Since the microprocessor constantly polls for print request 405, and does it faster than a mail item can be delivered up for franking, execution of inquiry step 349 is assured. Thus one can indirectly ::°°trigger a communications session with data transmission to the data centre and subsequent erasure e 20 of storage areas.
go* a Fig. 3a shows a storage format in a first variant. The microprocessor makes up an item counter Z by means of an information store. Only during a first-time storage of one of the usage records is Z set to a value of 1, and the storage of the dataset from new respectively altered as well as unchanged usage data occurs in a new line J 2. For a repeated storage of unchanged usage data it is sufficient S 25 to write the incremented counter state into the area N1 of the first line J 1, since there is obviously a case of similar usage of the terminal device.
S° Each line J stores data for the following information, such as number Nj, postage rate Pj, *°calendar state Cj (date), advertising image ID Aj, weight value Wj, format Fj, dispatch information Dj (form, type, destination) and, as the case may be, certain captured errors Ej.
The stored lines J 1,2 5 are listed in the memory area in historical sequence. A certain bulk mailing of similarly franked postal articles can be assigned a certain storage location if the mail articles are franked one after the other, so that dissimilarly franked mail items do not occur. A first line J 1 then corresponds to a first batch of similarly franked mail articles, a second line J 2 corresponds to a second batch of similarly treated mail items, a fifth line J 5 thus corresponds to a fifth batch of similarly treated mail items. Thus in each of the stored lines J information about a similar usage has been written. Only if there has been dissimilar usage, ie. if at least one of the pieces of information has been changed, a new line has to be written into the usage memory containing the corresponding new as well as the remaining previous usage data.
Figs. 3a and 3b show two different storing formats for a historical storage of similar or dissimilar usage data corresponding to a consecutive use of a type of service. While in the variation according CO7264 to Fig 3a the storage locations of a stored line are so arranged next to each other respectively after each other that the value for a specific information can be read from the placement of the respective storage locations in the series, in the variant according to Fig. 3b the storage locations are arranged in a group having an ID code, whereby the ID code replaces the placement in a series. The variant according to Fig. 3b allows for placing a group of three within a series of storage locations respectively in one line, which placement advantageously can now be at will. The microprocessor is programmed to search for the current ID code of a parameter, which includes information about the position in the sequence. It then reads the triad of interest, which had been stored in storage locations as a result of a last storage process. In the example detailed, a triad has three storage locations. This does not however preclude a grouping containing a multiplicity of storage locations.
A first triad has the bits Bi, the bits B 12 and the bits B13. The bits B 1 1 of the first storage location 16-01 refer to the value of a parameter. The bits 812 of the second storage location 16-02 refer to the number of mail items with the same parameter value. The bits B 13 of the third storage location 16-03 refer to the ID code for the type of parameter. It is proposed that the portion of the ID code that indicates the timing sequence of the storage of the triads be formed by a counter state capable of being incremented.
The bits B 11 of the first storage location 16-01 of the first triad refer to a first value of the o, parameter of the type postage rate. The bits B21 of the corresponding first storage location of a third triad refer to a second value of the parameter of the type postage rate, with the second value of the 20 parameter having been set later in time. There exists at least a further triad between the first and third .triads. In the example chosen for Fig. 3b there exists a second triad with information concerning the *ID code of an advertising template which has been imprinted on to a mail item in addition to the franking imprint. The ID code again comprises a part for the type of the parameter and a part for storing the series sequence of the storage of the second triad. The usage memory 16 possesses a 25 third storage location 16-03 for each triad in which there is stored an ID code associated with the respective desired piece of usage data. When the memory is accessed with a query, the *microprocessor searches for the current ID code of a parameter and then reads out a triad that is of interest and precedes the immediately following ID code of a parameter. The value or the number of a respective usage information is stored in the appropriately assigned first storage location 16-01, with 30 the number of pieces of similar usage information, respectively, each being stored in the triad's second storage location 16-02 provided therefore. In contrast to the variant shown in Fig. 3a, several item counters must here be separately managed.
Fig. 3c exemplifies a storage format using the example of a list-like depiction of storage states (Figs. 3c-1 to 3c-5) in the course of a historical storage of dissimilar or similar usage data during sequential use corresponding to one service type. The previously cited triad of storage locations is designated as list in the following explanation. The number of lists is derived from the number of usage information types. The latter are, in the example of embodiment, only the postage rate, the weight class and the date, to keep things simple. In fact, however, lists for a much greater number of usage types can be stored. Each list is processed for each franking by the microprocessor during the storage mode executing as part of the franking mode 400 (steps 417 to 430).
C07264 In the beginning each list is still empty. A parameter comparison during step 417 for instance determines that a letter with a postage value DM1.10 is to be franked, that the weight of the letter is within a first weight range GW1 and that the calendar module 8 holds the date 31-08-98. The microprocessor, operating in storage mode (steps 417 to 430), generates the state of the usage memory 16 shown in Fig. 3c-1.
This is followed by a simultaneous use of the franking machine to frank the next letter. The microprocessor in this case merely increments the item counter in the three lists and thus generates, in the storage mode (steps 417 to 430) the state of the usage memory 16 shown in Fig. 3c-2.
Next eight more letters of the same weight range GW1 are franked with the same postage value of DM1.10 and stamped with the same date 31-08-98. There thus results the state of the usage memory 16 shown in Fig. 3c-3. The item counter was merely incremented to Z 10. The first batch therefore comprised 10 similar letters.
Subsequently, during a dissimilar use, two letters of the second weight range GW2 are franked with a second postage rate of DM3.00, but with the same date of 31-08-98. There thus results the state of the usage memory 16 shown in Fig. 3c-4. In the date list only the item counter was incremented to Z 12. In each of the two other lists for postage rate and weight range a new line was written. As is apparent from the list: the franked first batch comprised 10 similar letters and the historically following second franked batch therefore comprised two similar letters.
On the following day, the 1-09-98, a further letter of the first weight range GW1 is franked with S. 20 a first postage value of DM1.10. Thus results the state of the usage memory 16 shown in Fig. .Since the item counter in the first line of the date list stands at Z 12, the date refers to the entries in the first two lines of the lists for postage rate and the weight range, but not to the entry in the last line.
On the other hand it is obvious that a further letter of the first batch was only franked on the following 9 day, for a new line has been entered in the date list that is to be associated with each of the last lines 25 entered in the two lists for postage rate and weight range.
Such data storage is space-saving and yet still allows the data centre later, after retrieving the data, to perform any desired analysis of the data with corresponding association of the data with each other.
Fig. 3d shows a further advantageous storage format using the example of a list-like 30 representation of the storage states (Figs. 3d-1 to 3d-5). It differs from the format according to the first variant in that recording of similar events in a new line is avoided. Instead, only the qualitatively changed respectively dissimilar events are recorded in the sequence of their occurrence. This is done in the form of an event list 500 with an associated reference list 610. Into the event list 500 are entered codes whose relationship to qualitatively changed respectively dissimilar events is derived from the associated reference list 610. One can see from the event list 500 how the process of a historical storage of qualitatively changed respectively dissimilar events (usage information) proceeds. The reference list 610 stores reference entries for the codes for qualitatively changed respectively dissimilar usage data.
C07264 The reference entries use up less space than the entries of the events, since the same reference entry is not written repeatedly if the same usage behaviour is repeated and the same services are thereby accessed.
A preferred embodiment provides for the non-volatile memory 5a to serve as a parameter memory, in which the property type and value of the current usage information are captured as data during the collection of the current usage information by the microprocessor 6 of the franking machine. The usage memory 16 of the arrangement possesses 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 storage mode 417b-430b, by way of which the microprocessor 6 is so programmed that: codes are stored in the reference list 610 and the event list 500, with each code having assigned to it data for describing the type and value of a property stored in the reference list 610; one of the codes is read out for comparison of the current usage data with the cumulatively stored usage data in the event list 500; the associated data are located by reference to the type and are compared with the respective current data taken from the parameter memory 5a as to the types of properties of current usage data, so that when the data called up differ in type, a further respective code is read .from the event list 500 until all those codes of the event list 500 which refer to qualitative 20 properties and which are examined as regards types of properties in relation to respective current usage data have been invoked, with the microprocessor 6 generating a new code if the data differ in type and writing it to the reference list 610 and to the event list 500, in which case the data concerning the type and value of the new property are also assigned the code and stored in the reference list 610, whereas furthermore in the case of accordance of type the 25 microprocessor 6 further checks by reference to the data stored in the reference list (610) the value of the data relating to the value of the respective type for accordance and, in case of inequality, generates a new code for the value of the new property and stores the data concerning the type and the value of the new property assigned to the new code in the reference list 610 and writes the new code as well as an assigned one-item code to the event 30 list 500, which is then closed off by means of an end-of-list code; the microprocessor 6 however, in case of accordance, merely increments an item counter Z and overwrites a corresponding current item code in the event list 500 with the current item code.
While the event list also stores the quantitative events corresponding to the same usage behaviour, it does not do this in a historical manner. The quantitative events are counted and also stored in the form of an alterable code. In the case of consecutive similar usage of the terminal device, the codes are altered to corresponding number of items. For each quantitative event of a service type there exists a unique code in the program memory 11. The microprocessor accesses the predetermined code stored in the program memory 11 and writes it to the list. It alters, during execution of each service, at least one code in the event list 500. For simplicity, the service is C07264 I
I
16 preferably limited to a franking of mail items in the example shown, but it needs not be so limited. A multiplicity of different codes may also be reserved for another service, or may be generated dynamically during processing. Each code occupies a separate line in the list and requires only a relatively small amount of storage space in the usage memory 16. Advantageously, the space required per line in the microprocessor-addressable memory space reduces, with the number of storage locations corresponding to the number of positions occupied by the code after it has been converted to a suitable number system. In practice, one uses of course hexadecimal code transformed into binary code for the machine language. In the simplest case, one byte, ie. 8 8 bits is sufficient per line.
For better understanding, there follows below an explanation of the storage states with reference to codes for one-byte lines transformed into the decimal system. The events explained with reference to Fig. 3d are defined, for instance, by: Code 0 for franking on a first date, incl. time as the case may be; Code 1 for franking with a 1 st standard rate DM1.10 Code 2 for franking with a 2 nd standard rate DM3.00 etc.; Code 3 for a weight range of up to Codes 4 to 239 are reserved for further properties; Code 240 for franking a single mail item; Code 241 for franking two mail items; Code 242 for franking three mail items, etc. up to Code 250 for franking 11 mail items; Codes 251 to 255 reserved for further events and for control purposes.
As is clear from the state of the usage memory 16 shown in Fig. 3d-1, the reference list 610 is still empty at the beginning, and the event list 500 contains in a first line (in the first storage location) 25 only a code 255 signifying the end of the list.
After accounting for the first franking process with the postage rate DM1.10, a first date code, the date and as required the hour or more exact time information, for example, is written to the reference list 610 and stored in a first storage location 611. It now contains "0 Date, Time", ie.
reference code, and the associated description. The microprocessor generates the first reference code. Here the storage location number of the first storage location 611 can be used to form a first reference code 0, for instance by subtracting a constant code from the address code of the storage location. By means of the storage location number of the second storage location 612 the code for standard rate postage is then generated. This latter, plus an associated description of the type and the value, for example "1 Postage Value 110", are then written to the reference list 610.
There thus results the state of the usage memory 16 represented in Fig. 3d-2. The event list 500 contains four lines, namely a first line (first storage location 501) with a first date code 0, a second line (second storage location 502) standard rate code 1 for the postage rate DM1.10, a third line (third storage location 503) with a one-item code 240 and a fourth line (storage location 504) with code 255 for end-of-list.
CO7264 Fig. 3d-3 shows the state of the usage memory 16 after accounting for the 10 th franking with the postage rate DM1.10. The reference list 610 still contains only two lines: "0 Date, Time" and "1 Postage value 110". The event list still only contains four lines with a first date code, a standard rate code 1 for the postage value DM1.10, however with a 10-item code 249 and then again a code 255 for end-of-list.
Fig. 3d-4 shows the state of the usage memory 16 after accounting for two further frankings, but with a second standard postage rate of DM3.00. In the reference list a second line "Postage value 300" has been written after the line "Postage value 110". Departing from the first date code 0 the microprocessor can increment a counter in order to generate a first standard rate code 1 and following this later a second standard rate code 2, which is automatically assigned, in the second line, the description "Postage value 300". The event list now contains six lines: a first date code 0 for the date, a first standard rate code 1 for the postage rate DM1.10, a 10-item code 249, a second standard rate code 1 for the postage rate DM3.00, a two-item code 241 and again a code 255 for end-of-list.
Fig. 3d-5 shows the state of the usage memory 16 after accounting for a further franking, again however with a first standard postage rate value of DM1.10. In addition, scales 22 are connected in this case and yield a weight value of 20g. In the reference list there is recorded after the first line "0 Date" and the second line "1 Postage value 110"- a further third line "2 Postage value 300". In the reference list there is now recorded, after the third line "2 Postage value 300", an extra fourth line 3 Weight value 20". The event list now contains nine lines with a first date code 0, a first standard rate code 1 for the postage rate DM1.10, a 10-item code 249, a second standard rate code 2 for the postage rate DM3.00, a two-item code 241, a first standard rate code 1 for the postage rate DM1.10, a weight code 3, a one-item code 240 and again a code 255 for end-of-list.
Only a certain number of events, which are for example represented by one byte per storage S' 25 location (storage area) need to be defined in the program memory 11 prior to a first-time use. User behaviour in the context of the processing of mixed types of mail is characterised by a reduced collection of similar mail. A 12-item code 251 for the franking of 12 mail items relates to a limit, found in practical experience, which is rarely exceeded by the user. When this limit is exceeded a control code 252 is written, followed immediately by a value code for the number of items from this afore- 30 mentioned limit up. A further control code 253 with immediately following value code permit pushing out further the limit for capture of item numbers. Limits selected according to a suitable numbering system principally also permit other storage space-saving counting methods.
The undefined events are dynamically defined during the operating cycle of the machine. The association of the codes with events is to occur automatically during the operation of the franking machine. The events are entered into the reference list only in the context of the storage mode before the franking process. A detailed description of the event may however be found in the reference list.
The procedure provides for a change of a parameter respectively of a characteristic (property) to be captured as an event in the event list 500. If an event occurs that has already occurred before, an entry must be written only to the event list. The code entered also appears in the reference list 610 at a location pointed to by the pointer drawn in Fig. CO7264 A constant number of bytes, or at least 1 byte, is advantageously reserved for each entry in the event list. The number of different events is preferably limited to 240. Should this number not suffice, however, two bytes are consecutively written in an event list 500*, with the first byte having the code 254 and pointing to a second reference list 620, shown in Fig. 8. If two bytes having the code 254 were to follow consecutively, one points to a third reference list 630, which is not shown merely for lack of space. The number of different events that can be captured may be increased at will following this principle.
A flow chart concerning the storage of usage data in the storage mode (steps 417 to 430) which is processed within the franking mode 400 has been explained with reference to Fig. 2.
However, the procedure according to the invention is not limited to this specific form of embodiment.
The storage of usage data can in principle occur also after completion of the franking routine or immediately after step 405 for determining if there has been a print request. In combination with a variation of the storage organisation the specific execution is also substituted in the storage mode, as is explained in detail with reference to Fig. 4 as well as Figs. 7a, 7b and 7c for two variants.
Fig. 4 shows a flow chart for the storage of usage data according to the storage organisation depicted in Fig. 3c. This is based on a list-like storage of characteristics. The characteristics are predetermined properties of the machine in connection with the franking process, in particular franking parameters and settings or errors. Processing is carried out after determination of the current characteristic or its change, for example by way of a comparison of the parameters, settings or errors 20 stored earlier with the currently stored parameters, settings and errors encountered for each characteristic in the same manner. In a first step 420a it is determined that the job "store characteristic" is to be executed, and execution branches to the first step 421a to read a last characteristic Mm stored in the list. In a subsequent step 422a, the comparison occurs with the current characteristic. If the characteristic is identical to the listed characteristic Mm then only the counter Zm 25 of the listed characteristic is incremented to Mm:=Mm 1 (step 425a). Otherwise a new characteristic Mn is added at the end of the list at step 423a and the associated counter is set to a starting value of Zn: 1 (step 424a).
In Fig. 7b is explained in more detail a flow chart for the storage of usage data that refers to the storage format, explained with reference to Fig. 3d. This is based on the storage of events in an event 30 list 500 in the form of listed specific codes, with an associated reference list 610. One now wishes to add an event to the history as a result of a change in the state of qualitative characteristics. The listlike storage of events in the event list applies to both qualitative as well as quantitative properties, with a pre-programmed code each being assigned to the latter. The reference list 610 belonging to the event list 500 lists only events that refer to qualitative properties and an associated code that is generated by a freely programmable dynamic process within preset limits. For each event there exists at least a dual group of data respectively code in the event list 500. The freely programmable code assigned to one of the qualitative properties is written to a first storage location 501. The preprogrammed code assigned to one of the quantitative properties is written to a second storage location 502. The storage in the event list 500 ends with the end-of-list code that is written to the third storage location 503.
C07264 1 i 19 A number of steps is executed by the microprocessor to store data in the event list 500 or the reference list 610. If within the franking mode (for instance after accounting as per step 416 in Fig. 2) an execution phase is reached where the job "store event" is to be executed, then the parameter list containing a multiplicity of current properties is called in step 417b. A property El of the first type refers, for example, to the set postage rate value, with the index u of the event E lu exemplifying the choice of one discrete value from the diverse values 1 A property E2 of the second type refers, for example, to the set weight range. Although a discrete postage value has been assigned to a weight class in accordance with a postage rate table, there are other dispatch parameters that are included in the postage rate calculation so that one cannot always deduce the weight class from the postage value. The weight range is therefore so finely graduated into weight steps that the actual weight is also captured in the area of a change from one step to the next. A later analysis at the data centre or at the mail carrier can be used, for example, to set the graduation of the postal tariff table differently, corresponding to statistics concerning user behaviour. A property E3 of a third type refers, for example, to the automatically set date for a day, which can be subdivided into discrete time ranges in a similar manner to that described previously. There exist further properties of types i to k that are suitable for making services accessible at least statistically. Equal values may be assigned to the different properties, as the case may be (for example 110 g and 110 x 10 2 DM). They are then differentiated by their type (as with a unit of measure for a physical quantity). The order of the types is .at will. The parameter list is implemented in the non-volatile memory 5a for example. It contains a 20 number of storage locations preset in the program memory for the different parameters (eg.
postage value, weight value, time/date etc.).
The principle of the arrangement of a storage location in the parameter memory is shown in Fig. 5. A first byte serves as ID code "ith TYPE" of a parameter type (postage, weight, date... etc.) and °four additional bytes "ut VALUE" are provided for the concrete value of the parameter. For any type, 25 the discrete parameter can only assume one of the multiplicity of different possible values. Each discrete value therefore has to be regarded as a qualitatively different property.
Fig. 6 shows the principle of the arrangement of a storage location in the usage memory 16 for the reference list 610. A first byte is provided for an associated code "CODE", another byte "TYPE" for characterising a type of parameter (postage, weight, date... etc.) and four more bytes "VALUE" are 30 intended for the concrete value of the parameter.
In accordance with Fig. 7b the parameter list is called in step 417b. A marker P designated MARKERNEWPROPERTY is posted in step 418b as P 0 and the first control variable i, which reflects the number of the parameter to be used, is set to the first parameter, ie. the control variable is now 1.
A first local variable E is given the value of the property to be used (Elu) in step 419b. Since the control variable is 1, it follows that with the local variable E Elu the first property listed in the parameter list is being queried, for instance the postage value having, in this example, the specific value 1 assigned to it. In step 419b a second control variable j 1 is posted and a byte counter is set to the starting value n N bytes, which corresponds to the current line number reached in the event list.
CO7264
I
I
Now there is a branch to point al of a search routine 600, 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. An inquiry step 600a for N 0 occurs first and permits branching effective only immediately following a re-initialisation to point cl in Fig. 7b respectively 7c. In the latter case, the previous value N 0 is incremented by one (step 704). Otherwise, if N 0, then in the following first sub-step 601 of the search routine 600 a storage location is selected by now defining the n th storage location as n N Thus preparation is made to be able to compare in the following step 420b the successively read properties of the already captured property types of the reference list with the property type read from the parameter memory. The second control variable is set to 1 and is subtracted from the byte counter value N. This yields the last line below the end-of-list code, which is addressed and read out. The analysis of the read code occurs in sub-step 601 by way of comparison with the codes that are pre-programmed into the program memory 11.
In sub-step 602 the microprocessor next determines whether a pre-programmed code because of a pre-defined meaning has been stored in the event list at the n th storage location (line for the n th byte). If that is the case, then point a3 is reached and there occurs a branch to sub-step 603, where the second control variablej is incremented by one, before execution then branches back to sub-step 601 in order to decrement the byte counter so that it yields the second-last line below the end-of-list code 255. If it is determined in sub-step 602 that a freely programmable code has been stored (because there was no pre-defined meaning) then point a2 is reached. This code stands for a i 20 qualitative property that can be analysed in the subsequent step 420b.
Each respective second byte for characterising a type of parameter in the storage location of the reference list shown in Fig. 6 contains associated in each case with a code 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 at the n th storage location of the 6:.6 25 event list 500. The characteristic value is intended to correspond to one of the types, for example to the date, weight, postage etc. The reference list 610 contains, for example, the associated characteristic value for the (freely defined) code for this type listed in the event list 500. The second local variable EL, which thus has been set to a characteristic value corresponding to the type stored in the respective second byte of each storage location (line) of the reference list (Fig. now serves 00** 30 as the actual value. The characteristic value of the ith type serves as the desired value for a comparison with the actual value of the second local variable EL in step 420b.
In step 421b one now checks whether the same type has been found. If that is the case, then execution branches to step 422b. In step 422b the search is continued in the reference list 610 for the value, for which four bytes have been reserved at the third storage location of the memory. A value of a current property from the parameter memory to which the first local variable E has been set in step 419b can now be compared in step 422b with the afore-mentioned value that is held in the reference list 610.
If however it is determined in step 421b that the same type was not found, then execution branches to step 423b to check whether all characteristic values of previously captured properties have already been read. This is the case only when the byte counter value is at n 0. For n 0, C07264 S I 21 execution branches to point cl at the start of a subroutine 700. If however not all characteristic values of previously captured properties have yet been read, ie. N O, then execution branches back to point a3 of the search routine 600. The search routine 600 thus serves to prepare for step 420b. In step 420b there occurs, before the comparison, a setting of the second local variable EL, with the latter being set to the corresponding characteristic value from the reference list 610 with the characteristic value being assigned the code being read from the nth storage location in the event list 500. In this way one continues checking each, followed by checking in step 421b whether one of the previously captured properties is equal in type with the current property being read. If that is the case then, though the type is equal, the values may still differ, and execution branches once again to step 422b. In step 422b the reference list 610 is searched for the stored concrete value that equals the value of the variable E. If the check in the subsequent inquiry step 424b shows there is accordance also as far as the value is concerned, there obviously is no need for a new qualitative property to be captured in the event list 500, and execution branches to step 425b in order to increment the first control variable i by one. Control variable i is thus prepared for the next type of property. In the subsequent inquiry step 426b it is determined whether all k types for which current parameter values may have been captured in the parameter memory have been checked. If that is not the case, execution branches back to step 419b. This afore-mentioned branching-back creates a loop so that -:*all current properties can be compared with the properties stored to date.
Now the event list 500 is once again searched for a code from top to bottom by means of the 20 search routine 600, with the code being sought belonging to a type that is being checked, in step 420b, for accordance with the currently interesting property type "i h TYPE" so that then, once the accordance has been determined in step 421b, the current property value from the parameter memory is compared in step 422b with the stored property value from the reference list 610. If however inequality is determined in step 424b execution branches to point c2 for a second entry into 25 the subroutine 700. Now the microprocessor starts the subroutine 700, which is explained in more detail with reference to Fig. 7c.
Fig. 7c shows the subroutine 700 for the flow chart according to Fig. 4b, being at least suitable ofor storing the code for the new property in the event list 500 or to at least issue a warning in case the list is full. In sub-step 701 at point cl at the start of the subroutine 700 there first occurs an inquiry as 30 to the storage allocation number reached corresponding to the freely defined code that was last stored and this is compared with a desired number. If the desired number has not yet been reached, then the reference list 610 is not yet full. Now execution branches to sub-step 702 in order to update the reference list. Otherwise, if the desired number has been reached, a warning "List full" is generated in sub-step 706 and execution branches to point g (Fig. Departing from point 2c for a second entry into the subroutine 700 and departing from sub-step 702, inquiry step 703 is reached in which the reached byte counter N is compared with a corresponding desired value in order to decide whether the event list 500 is full or not yet full. If the event list 500 is full, execution once more branches to point g (Fig. 2) via the sub-step 706. Otherwise, if the event list is not yet full execution branches to sub-step 704. In sub-step 704 a new event is entered into the event list as a code, at the end of the list, and then the byte counter value is incremented N N 1 before branching to sub- C07264 I i 22 step 705. In sub-step 705 the flag MarkerNewProperty is set to p:=l and then point c3 at the exit of the subroutine is reached.
If none of the stored types was equal to a type currently held in the parameter memory, execution branches to point cl at the start of the subroutine 700. But if the value listed in the reference list for an already stored type did not accord with the value currently held in the parameter memory, then execution branches to point c2 at the start of subroutine 700 in order to store the code for the new property in the event list 500, with the flag Marker_NewProperty p being set to the value 1, or otherwise in order to at least issue a warning in case the list is full.
From step 426b of the flow chart shown in Fig. 7b there will then be a branch to step 427b if the loop has been completely processed and thus i k, ie. when all current properties have been compared with the properties stored so far. In step 427b the flag Marker_NewProperty p is tested: it can only possess the values 0 or 1. For p 1 execution branches to step 428b and a one-item code 240 is entered at the end of the event list. The byte counter value is incremented by one N N 1.
In a final step 430b the end-of-list code 255 is written to the end of the event list 500.
Otherwise, for p 1 execution branches from step 427b to step 429b in order to increment by 1 the item code held at the end of the event list. The end of the run is reached from steps 429b or 430b.
It is provided that codes are stored in an event list in lines that refer to usage information, with the number of items being one piece of usage information.
A usage information that refers to a new event is allocated a freely definable code by the 20 microprocessor, with the allocation being stored in a reference list. The reference list in this case may be stored in a second storage area of the usage memory 16 or at reserved storage locations 16-0n+1 in the first storage area.
It is further provided that the codes referring to the number of items are pre-programmed, with 0 °an associated item counter being set to the value of one for each new event, and with a 25 corresponding one-item code being entered into the event list. The pre-programmed codes, which cannot be freely defined and which cannot be taken from the reference list, are held in the program oo°0 a memory 11.
The invention is not limited to one of the preceding forms of embodiment. The storage of usage data can occur in any area of the usage memory and in any suitable form, for example in datasets of variable length. While a cumulative storage method does considerably reduce requirements for storage capacity, it is not however necessary when available free storage capacity is very large. On this basis one can consider a number of further variants within the scope of the claims. Thus one could obviously develop respectively deploy other different embodiments of the invention, which are based on the same basic concept of the invention and which are within the scope of the attached claims.
C07264

Claims (12)

1. Arrangement for storing data relating to a use of a terminal device, consisting at least of memory and a microprocessor, characterised in that a non-volatile usage memory is connected to the microprocessor for storing previous usage data as well as that the microprocessor is programmed to: enter a storage mode for storing usage data corresponding to a previous use, enter a communications mode, whereby the microprocessor in the communications mode is programmed for data transmission from the usage memory to a remote storage, with the data transmission occurring to undertake a statistical analysis of the usage data at a distance from the terminal device, and re- initialise the usage memory in order to restore the predetermined storage capacity in the usage memory after the data transmission has taken place.
2. Arrangement according to claim 1, characterised in that in the storage mode the microprocessor is programmed to: compare current usage data with the usage data already stored, store a new dataset with usage data in the usage memory in historical sequence corresponding to the usage, if these usage data are changed or dissimilar compared to the usage data in the previously stored dataset, form a counter for usage data, as well as increment the counter and replace corresponding data of a previously stored dataset with new data that reflect the incremented counter state if the current usage data are unchanged or equal compared to the already stored dataset.
3. Arrangement according to claim 1, characterised in that the usage memory is arranged *separately from a non-volatile memory for the mail registers and the usage data are stored 20 independently of the billing data.
4. Arrangement according to claim 1 or claim 2, characterised in that the microprocessor is programmed to manage the allocation of storage locations for the data of the dataset in the running process in accordance with the occurring events, with the data of the dataset including at least one parameter value and one item number. 25 5. Arrangement according to any one of claims 1 to 3, characterised in that the terminal device is a franking machine with a microprocessor, which is programmed to enter, within a system *routine, an input/display routine and a franking mode, whereby the input routine, in order for current usage data to be captured by the microprocessor of the franking machine in the non-volatile memory, includes prompting steps for entry of usage information relating to at least the franking value, the 30 weight or the dispatch and whereby the franking mode comprises the storage mode for the cumulative storage of the current usage data together with the preceding usage data.
6. Arrangement according to any one of claims 1 to 5, characterised in that the non-volatile memory is a parameter memory in which the type of property and value of the current usage information are captured as data by the microprocessor of the franking machine during the capture of current usage data, that the usage memory possesses areas for storing of an event list and a reference list, that a program memory is connected with the microprocessor and contains a program for the storage mode by way of which the microprocessor is programmed, that codes are stored in the reference list and the event list whereby data for the description of the type and value of a characteristic associated with each code are stored in the reference list, that one of the codes is read from the event list in order to compare the current usage data with the cumulatively stored usage 007264 0i 01 1 24 data, that the associated data are found by reference to the type and are compared with the respective current data concerning types of property read from the parameter memory, whereat if the data read are dissimilar as to type, a respective further code is read from the event list until all those codes of the event list have been read which relate to qualitative properties and are placed in a relationship with respective current data concerning current usage data, with the microprocessor in case of dissimilarity of the data as far as type is concerned generating a new code and writing it to the reference list and the event list, whereat the data concerning the type and the value of the new property are also associated with the code and written to the reference list and whereat the microprocessor in case of equality of type further tests the value, by reference to the data stored in the reference list for equality with the value of the data referring to the current property and in case of dissimilarity generates a new code for the value of the new property, writes the data concerning the type and value of the new property associated with the new code to the reference list and enters the new code as well as an associated one-piece code into the event list, which is closed off with an end-of-list code, that the microprocessor in case of equality however merely increments a piece counter and overwrites a respective current piece code in the event list with the current piece code.
7. Arrangement for storing data relating to a use of a terminal device, consisting at least of memory and a microprocessor, said arrangement being substantially as hereinbefore described with reference to the accompanying drawings. ,:AC 20 8. Procedure for storing data relating to a usage of a terminal device, characterised by provision of a usage memory having a predetermined available storage capacity, use of a terminal device including capture of current usage data that are associated with at least one item of usage information, with the determination of the current characteristic of a use or change occurring by way of comparing respective current usage data with already stored usage data, and storage of a new S 25 dataset containing usage data in the usage memory if these are changed or dissimilar to the dataset stored before, incrementing of a counter and replacement of respective data of a dataset already stored before with new data that reflect the incremented counter status, if the current usage data are unchanged or equal to the dataset already stored before, data transmission of the usage data from the usage memory to a remote memory and re-initialisation of the usage memory to restore the S 30 available predetermined storage capacity in the usage memory.
9. Procedure according to claim 8, characterised in that the remote storage facility is a storage facility of a remote data centre and that shortly before or during memory overflow the data stored in the usage memory of the terminal device are loaded into the storage of the data centre. Procedure according to claim 8 or claim 9, characterised in that following the transmission to and storage of usage data in the remote storage facility it is determined, in inquiry step of a system routine that the data have been transmitted, that in the step within the framework of the re-initialisation of the usage memory an end-of-list code is placed in a storage location at the start of an event list and subsequently a display text is generated in step before execution branches back to point s of the system routine. C07264
11. Procedure according to claim 8, characterised in that the generation of any desired statistic regarding the usage of a terminal device occurs at the data centre after uploading those usage data from the usage memory into the remote storage which had been stored in non-volatile memory during the use of the terminal device.
12. Procedure according to claim 8, characterised in that a space-saving historical storage procedure is used for the storage in the usage memory, with a line-by-line storage or replacement of data of a dataset occurring during the use of the terminal device with the capture of current data which are associated with at least one item of usage information, as well as that a data compression is carried out by modem during the transmission of data to the data centre.
13. Procedure according to claim 10, characterised in that in step within the framework of the re-initialisation of the usage memory an end-of-list code is placed in a storage location at the start of an event list and the previously stored usage data at the remaining storage locations are erased.
14. Procedure according to claim 10, characterised in that a dataset with usage data in the usage memory consists of at least one code and that a line-by-line storage occurs of codes which reference items of usage information. Procedure according to claim 14, characterised in that an item of usage information is a quantitative property and/or a piece number. Procedure according to claim 15, characterised in that a freely definable code is associated with an item of usage information that refers to a new event, with the association being 20 stored in a reference list, that the codes referring to the number of pieces are pre-programmed, with an associated piece counter being set to a value of 1 and a corresponding one-piece code is entered °C C in the event list.
17. Procedure for storing data relating to a usage of a terminal device, said procedure being substantially as hereinbefore described with reference to the accompanying drawings. 25 Dated 7 October 1999 FRANCOTYP-POSTALIA AG Co. C "eas, Patent Attorneys for the ApplicantlNominated Person SPRUSON FERGUSON C07264
AU53560/99A 1998-10-09 1999-10-08 Arrangement and procedure for storing data about the use of terminal device Expired AU754215B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19847951.4 1998-10-09
DE1998147951 DE19847951A1 (en) 1998-10-09 1998-10-09 Arrangement and method for storing data on the use of a terminal

Publications (2)

Publication Number Publication Date
AU5356099A true AU5356099A (en) 2000-04-13
AU754215B2 AU754215B2 (en) 2002-11-07

Family

ID=7884822

Family Applications (1)

Application Number Title Priority Date Filing Date
AU53560/99A Expired AU754215B2 (en) 1998-10-09 1999-10-08 Arrangement and procedure for storing data about the use of terminal device

Country Status (5)

Country Link
EP (1) EP0992947B1 (en)
CN (1) CN1154936C (en)
AU (1) AU754215B2 (en)
DE (2) DE19847951A1 (en)
NO (1) NO319846B1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2831978B1 (en) * 2001-11-07 2004-08-20 Neopost Ind POSTAL PRODUCT STATISTICAL MONITORING SYSTEM
CN1300698C (en) * 2003-01-17 2007-02-14 华为技术有限公司 Statistical method for covering rate of embedded system
DE102004014427A1 (en) 2004-03-19 2005-10-27 Francotyp-Postalia Ag & Co. Kg A method for server-managed security management of deliverable services and arrangement for providing data after a security management for a franking system
DE102004033598A1 (en) 2004-07-07 2006-02-16 Francotyp-Postalia Gmbh Method for storing and managing data and arrangement for carrying out the method
US9899399B2 (en) * 2015-10-30 2018-02-20 Sandisk Technologies Llc 3D NAND device with five-folded memory stack structure configuration
DE102017208823A1 (en) * 2017-05-24 2018-11-29 Wago Verwaltungsgesellschaft Mbh Initialization of a local bus
CN109840803B (en) * 2019-01-04 2024-08-23 平安科技(深圳)有限公司 Data entry method, user terminal, background server and storage medium

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4442501A (en) * 1981-02-26 1984-04-10 Pitney Bowes Inc. Electronic postage meter with weak memory indication
US4812965A (en) * 1985-08-06 1989-03-14 Pitney Bowes Inc. Remote postage meter insepction system
FR2620249B1 (en) * 1987-03-31 1989-12-01 Smh Alcatel POSTAGE MACHINE WITH PERIODIC TRACK MANAGEMENT
FR2665003B1 (en) 1990-07-18 1995-06-30 Alcatel Satmam POSTAL CONSUMPTION MONITORING DEVICE.
GB2251211B (en) 1990-12-31 1994-08-24 Alcatel Business Systems Franking machine
GB2256396B (en) * 1991-05-29 1995-03-29 Alcatel Business Systems Method of remote diagnostics for franking machines
US5309363A (en) * 1992-03-05 1994-05-03 Frank M. Graves Remotely rechargeable postage meter
US5699258A (en) 1992-04-16 1997-12-16 Francotyp-Postalia Ag & Co Assembly for franking postal matter, and multi-carrier shipping system
DE4224955C2 (en) 1992-07-24 1998-11-26 Francotyp Postalia Gmbh Arrangement and procedure for internal cost center printing
FR2700043B1 (en) * 1992-12-30 1995-02-10 Neopost Ind Franking machine allowing to memorize a history.
US5805711A (en) * 1993-12-21 1998-09-08 Francotyp-Postalia Ag & Co. Method of improving the security of postage meter machines
US5715164A (en) * 1994-12-14 1998-02-03 Ascom Hasler Mailing Systems Ag System and method for communications with postage meters
DE4447404C2 (en) * 1994-12-23 1998-08-20 Francotyp Postalia Gmbh Method for entering data into a balance and arrangement for carrying out the method
DE19517557B4 (en) 1995-05-12 2005-06-16 Sommer Metallbau-Stahlbau Gmbh & Co. Kg Facade wall connection
DE19549305A1 (en) 1995-12-22 1997-07-03 Francotyp Postalia Gmbh Method and arrangement for entering data into a franking machine

Also Published As

Publication number Publication date
EP0992947B1 (en) 2006-06-07
AU754215B2 (en) 2002-11-07
CN1154936C (en) 2004-06-23
EP0992947A3 (en) 2000-12-13
CN1281199A (en) 2001-01-24
DE59913511D1 (en) 2006-07-20
NO319846B1 (en) 2005-09-19
DE19847951A1 (en) 2000-04-20
NO994891L (en) 2000-04-10
NO994891D0 (en) 1999-10-07
EP0992947A2 (en) 2000-04-12

Similar Documents

Publication Publication Date Title
US6298337B1 (en) Methods for automatically entering carrier or cost center information in a mail-shipping system
US6321214B1 (en) Method and arrangement for data processing in a shipping system with a postage meter machine, including automatic selection of the most beneficial carrier
US6226626B1 (en) Method and arrangement for data processing in a mail-processing system with a postage meter machine
DE4447404C2 (en) Method for entering data into a balance and arrangement for carrying out the method
US6282525B1 (en) Method and arrangement for data processing in a mail shipping system having a postage meter machine wherein a carrier-identifying mark is scanned and processed
US7103583B1 (en) Method for data input into a service device and arrangement for the implementation of the method
US5606508A (en) Assembly for franking postal matter
CA2003377C (en) Epm having an improvement in non-volatile storage of accounting data
US6853990B1 (en) Franking and prepayment machine
US20070078795A1 (en) Method of obtaining a franking credit via a telecommunications network
AU754215B2 (en) Arrangement and procedure for storing data about the use of terminal device
US5365044A (en) Postage meter strip printing machine
US4931943A (en) Franking machine providing a periodic historical trail
GB2215668A (en) Postal charge accounting system
US5021963A (en) EPM having an improvement in accounting update security
US6385597B1 (en) Arrangement and method for data exchange between a postage meter machine and clip cards
US6820066B1 (en) Arrangement and method for storing data relating to the usage of a terminal device
US5444631A (en) Franking machine with record storage facility
US6615196B1 (en) Method for data input into a postage computer and arrangement for the implementation of the method
CA2011490C (en) Electronic postage meter having savings-bank accounting
EP1457930A2 (en) Mail item printing station, and mail item handling system and method
US20040181494A1 (en) Apparatus for automatic product code entry into a mail-processing device
US7349855B2 (en) System for statistical follow-up of postal products
US20050125365A1 (en) Apparatus for automatic determination of a product description for display by means of a mail-processing device

Legal Events

Date Code Title Description
TC Change of applicant's name (sec. 104)

Free format text: FRANCOTYP-POSTALIA AG & CO.

FGA Letters patent sealed or granted (standard patent)
MK14 Patent ceased section 143(a) (annual fees not paid) or expired