Patent US20030159010A1 successfully refreshed from Google Patents.
US20030159010A1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method, device and computer program product for processing information in a memory
Assignee: Anoto AB
•
Filing: 2002-11-13
•
Granted: —
•
Expires: 2022-11-13
Abstract
Abstract A method for freeing memory in a device with limited memory. A plurality of pen strokes is entered into the device, each of which is associated with one of a plurality of pages. The pen strokes are stored in electronic form in the memory. According to the method, memory is freed by all the pen strokes associated with a specific page being deleted. The specific page is determined on the basis of a time at which a pen stroke associated with the page was recorded by the device. A computer program product comprises a computer program for carrying out the method. A device has a data processing unit and a memory and means for carrying out the method.
Inventors
- 👤 Mattias Bryborn
- 👤 Erik Sparre
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 19:04
CPC Classifications
G; G03; G03F; G03F7/00; G03F7/70; G03F7/70691; B; B29; B29C; B29C45/00; B29C45/14; B29C45/14311; B29C45/16; B29C45/1657; G06; G06F; G06F3/00; G06F3/01; G06F3/048; G06F3/0487; G06F3/0488; G06F3/04883; G06V; G06V30/00; G06V30/10; G06V30/14; G06V30/142; G06V30/1423; B29K; B29K2995/00; B29K2995/0037; B29K2995/0087
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
97 words
1 . A method for freeing memory in a device with limited memory, into which device a plurality of pen strokes is entered, each of which pen strokes is associated with one of a plurality of pages and is stored in electronic form in the memory, all the pen strokes associated with a specific page being deleted ( 78 ) when space in the memory is to be freed, characterized in that the specific page is determined on the basis of a time at which a pen stroke associated with the page was recorded by the device.
Claim 2
Dependent Claim
97 words
1 . A method for freeing memory in a device with limited memory, into which device a plurality of pen strokes is entered, each of which pen strokes is associated with one of a plurality of pages and is stored in electronic form in the memory, all the pen strokes associated with a specific page being deleted ( 78 ) when space in the memory is to be freed, characterized in that the specific page is determined on the basis of a time at which a pen stroke associated with the page was recorded by the device.
Claim 3
Dependent Claim
45 words
2 . The method as claimed in claim 1 , characterized in that the specific page is determined on the basis of its most recently recorded pen stroke having been recorded earlier than the most recently recorded pen stroke of any of the other pages.
Claim 4
Dependent Claim
75 words
3 . The method as claimed in claim 1 , characterized in that the specific page is determined by the steps of identifying ( 80 ) page addresses for the pen strokes stored in the memory and the time of the most recently recorded pen stroke associated with the respective pages, and selecting ( 81 ) from the identified pages the specific page as the page which has the oldest most recently recorded pen stroke.
Claim 5
Dependent Claim
137 words
4 . The method as claimed in claim 3 , characterized in that the step of identifying ( 80 ) page addresses for the pen strokes stored in the memory comprises searching ( 70 ′) in the memory for a plurality of page addresses associated with pen strokes, if a page address encountered during the search ( 70 ′) is not stored in a first data structure ( 61 ), storing ( 71 ) this page address and a time associated therewith in a first data structure ( 61 ), and if the page address encountered is already stored in the data structure ( 61 ), updating ( 72 ) the time therein associated with the page address so that the latest time of the page address is stored in the first data structure ( 61 ).
Claim 6
Dependent Claim
35 words
5 . The method as claimed in claim 4 , characterized in that the step of searching ( 70 ′) in the memory is restricted to predetermined page addresses belonging to a first search range.
Claim 7
Dependent Claim
56 words
6 . The method as claimed in claim 5 , characterized in that the step ( 80 ) of identifying page addresses for the pen strokes stored in the memory is repeated for a plurality of further search ranges, which together comprise page addresses for a considerable portion of the pen strokes stored in the memory.
Claim 8
Dependent Claim
66 words
7 . The method as claimed in any one of claims 4 - 6 , characterized in that the step ( 80 ) of identifying page addresses for the pen strokes stored in the memory comprises for each search range going through the first data structure and arranging page addresses and times from the first data structure in a second data structure according to predetermined rules.
Claim 9
Dependent Claim
96 words
8 . The method as claimed in claim 7 , characterized in that the rules comprise the rule that, if the second data structure is full and an encountered page address in the first data structure ( 61 ) has a time that is older than a youngest time in the second data structure ( 62 ), said youngest time in the second data structure ( 62 ) is replaced by said encountered page address, so that the second data structure comprises the page addresses with which the oldest most recently recorded pen strokes are associated.
Claim 10
Dependent Claim
49 words
9 . The method as claimed in claim 7 or 8 , characterized in that the second data structure contains a predetermined number of page addresses and is arranged for extraction of an extreme value, which corresponds to the page address that has the most recently recorded pen stroke.
Claim 11
Dependent Claim
50 words
10 . The method as claimed in any one of claims 7 - 9 , characterized in that the step ( 81 ) of selecting the specific page comprises selecting ( 76 ) from the (continued) (continued claim 10) second data structure the page address that has the oldest time.
Claim 12
Dependent Claim
46 words
11 . The method as claimed in claim 10 , characterized in that a plurality of page addresses and times from the second data structure are arranged in a third data structure, so that this contains the page addresses with which the oldest times are associated.
Claim 13
Dependent Claim
47 words
12 . The method as claimed in claim 11 , characterized in that the page addresses arranged in the third data structure are sorted with regard to their associated times, so that the extreme value consists of the page address with which the oldest time is associated.
Claim 14
Dependent Claim
54 words
13 . The method as claimed in any one of claims 7 - 12 , characterized in that one of the first and the second data structures is one of a symbol table, a sorted list, a search tree, a hash table, a priority queue, a stack, a heap-arranged tree and a binary heap.
Claim 15
Dependent Claim
49 words
14 . The method as claimed in any one of claims 7 - 13 , characterized in that the second data structure ( 62 ) is arranged to produce a sorted list of a plurality of page addresses with which the oldest most recently recorded pen strokes are associated.
Claim 16
Dependent Claim
39 words
15 . The method as claimed in claim 1 , characterized in that the specific page is determined (continued) (continued claim 15) by a pen stroke associated with the specific page having been recorded prior to a predetermined time.
Claim 17
Dependent Claim
30 words
16 . The method as claimed in claim 1 , characterized in that the specific page is determined by a page suggested by the device being confirmed by the user.
Claim 18
Dependent Claim
44 words
17 . The method as claimed in any one of the preceding claims, characterized in that a pen stroke is deleted by a state indicator for the memory space that is to be deleted being changed to indicate that the memory space is available.
Claim 19
Dependent Claim
41 words
18 . A computer program product comprising a computer program for freeing memory in a device with limited memory, characterized in that, when executed, the computer program carries out the method according to any one of claims 1 - 17 .
Claim 20
Dependent Claim
124 words
19 . A device for electronic recording of pen strokes, each of which is associated with a page, which device comprises a data processing unit ( 7 ), that has a memory ( 4 , 5 ) with limited space for storing the pen strokes in electronic form, the data processing unit ( 7 ) being arranged to free space in the memory ( 5 ) by deleting from the memory ( 5 ) all the pen strokes associated with a specific page, characterized in that the data processing unit ( 7 ) is arranged to determine (continued) (continued claim 19) the specific page on the basis of the time at which a pen stroke associated with the page was recorded by the device.
Claim 21
Dependent Claim
32 words
20 . The device as claimed in claim 19 , characterized in that the device has means for carrying out a method according to any one of claims 1 - 17 .
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.