text:
Invention maintains duplicate files in safe places. A SCAN computer program creates a TOKEN Table of an earlier file. The TOKEN Table reflects the indices of successive segments of the file and the exclusive-or (XR) and Cyclic redundancy check (CRC) products of the characters in each segment. An updated file is compared to the earlier file by comparing the XR and CRC products of segments in the updated file to the XR and CRC products in the TOKEN Table. On detecting matching products for identical segments, the next segments are compared. On mismatch, the segment (window) for the updated file is bumped one character and new XR and CRC products generated and compared. The indices of the TOKEN Table and the offsets from the start of the file of the first characters of the updated file matching segments are set forth in a Match Table. Next the updated file is scrolled through for the non-matching information determined by acting on the indices and offsets of the Match Table to form the TRANSITION Table which is the Match Table and the updated file non-matching information. The TRANSITION Table contains the delta information which may be sent to another location having a copy of the earlier file thereat: the whole updated file need not be sent there. A reconstruction program at the location looks at the TRANSITION Table to determine where to get the characters for the copy of the updated file it is creating.
1. A combination comprising a storage device, a file stored in said storage device, and a token table stored in said storage device, said token table comprising first and second different hashing mathematical representations for each of a plurality of fixed equal length character segments of said file.
2. A combination according to
3. A combination according to
4. A combination according to
5. A combination as claimed in
6. A combination according to
7. A combination according to
8. A computer apparatus comprising a storage device, a file stored in said storage device, means for generating a token table having a signature of said file and storing said token table in said storage device, said means for generating and storing said token table comprising means for generating first and second different hashing mathematical representations for each of a plurality of fixed equal length character segments of said file.
9. An apparatus according to
10. An apparatus according to
11. An apparatus according to
12. An apparatus according to
13. An apparatus according to
14. A method for generating a file signature, in a computer having a memory with a file therein and data processing means for producing a signature of said file, said method comprising generating and maintaining a record of first and second different hashing mathematical representations for each of a plurality of fixed equal length character segments of said file.
15. A method according to
16. A method according to
17. A method according to
18. A method according to
19. A method according to
20. The method of
21. A method according to
22. A method according to
23. A combination comprising a memory, a signature and a first data file stored in said memory, said signature indicating a difference between said first data file and a second data file with respect to one another, said first and second data files each having successive segments of an equal number of characters and having a reference point at the same character position in both of said first and second data files, said signature comprising a plurality of offsets for said second data file, each offset representing the distance from said reference point in said second data file of a respective segment of said successive segments in said second data file, which is identical to one of said segments in said first data file, the distance from said reference point being the distance of a fixed character position within each respective segment from said reference point.
24. A combination according to
25. A combination according to
26. A computer apparatus having a memory with first and second files stored therein, said files each having successive segments of characters, comprising data processing means for generating first and second different hashing mathematical representations for each of a plurality of fixed equal length character segments of said files, means for comparing said hashing mathematical representations of said segments of said files to identify identical character sequences of said files, means for generating a file signature of portions of said files that are different, and means for generating offsets indicating a displacement, from a reference point, of character segments in said second file which are identical to character segments in said first file.
27. An apparatus according to
28. An apparatus according to
29. A method of creating, from a first file having fixed length segments of characters and a difference file signature both stored in a computer having a memory and data processing means, a copy of a second file having fixed length segments of characters, said difference file signature indicating similarities and differences between said first file and said second file, an original of said second file having been created before the creation of said difference file signature, said method comprising generating a mathematical representation for each of said segments of the first file to uniquely identify each respective segment, and generating a mathematical representation for each of said segments of the second file to identify each respective segment in the second file, and creating in said difference file signature a record of representations of segments in the original of said second file that are identical to representations of segments in the first file and of the location or offsets of identical segments in the second file, and also storing in the record information which is different in the second file, the offset of said information which is different in said second file being derived from the offsets of identical segments in both said first and second files.
30. A method according to
31. A method according to
32. A method according to
33. A method according to
34. A method according to
35. A method for creating a second window segment token from a base window segment token, said method comprising creating a base window segment in a computer memory by reading a segment of a file in a computer memory, said segment in said file being of the same size as said base window segment, calculating an exclusive-or signature that is an exclusive-or representation of the characters of said base window segment of the file to create a base window segment token, creating said second window segment which comprises all characters of said base window segment except the first character of said base window segment and comprises the next character in said file after said segment in said file which was read to form the base window segment by reading said next character in said file, and creating a second window segment token for said second window segment by adjusting the base window segment token to reflect the deletion of the first character of said base window segment and the addition of said next character in said file in forming the second window segment.
36. A storage device having a first file and a signature stored in said storage device, said signature representing differences of said first file with respect to a second file, said signature comprising offsets indicating a displacement of identical fixed length segments in said second file from the location of said segments in the first file.
37. A storage device according to
38. A method of periodically maintaining, in a computer having a read/write storage device and data processing means, an archival record of a first version of a file and periodic changes to the first version of the file, the file being at least periodically updated in the read/write storage device, comprising periodically generating, using the data processing means, exclusive-or mathematical representations and order sensitive hash products of fixed length segments of the file, and creating a record in the read/write storage device of those representations and hash products that are identical to representations and hash products of segments in the file at the end of previous periods of said periodical updating, said record further comprising segments in the original version of the file that are different from said segments at the end of said previous periods of said periodical updating.
39. A method according to
40. A method according to
41. A method according to
42. A method according to
43. A method for producing a copy of a second file that is an updated version of an original file in a storage device, comprising producing a token set from each of the original file and an updated version of said original file, comparing the token sets of the original file and said updated version of said original file to identify the offsets of character segments in the updated version of said original file which are identical to character segments in said original file, thereby also identifying information in said updated version of said original file which is unmatched in said original file, each token set comprising first and second different mathematical representations of each segment of said original file and of each segment of said updated version of said original file.
44. The method of
45. The method of
46. The method of
47. A method for producing a first file representative of differences between second and third files, comprising generating first and second hash tables from successive equal length segments of each of said second and third files by generating successive first and second different mathematical representations of equal length segments of said second and third files, respectively, wherein a segment is a set of successive characters, comparing said first and second hash tables, with respect to said second and third files, to identify segments of said second and third files that match one another, and producing said first file by listing segments of said second and third files that match one another.
48. The method of
49. The method of
50. The method of
51. The method of
52. A method for producing a token table from a computer data file in a memory media, the method comprising, for each of a plurality of fixed length segments in the data file, the steps of:
(a) generating a first hashing representation for the segment;
(b) generating a second hashing representation for the segment; and
(c) concatenating said first and second hashing representations into a segment representation.
53. The method of
(d) reading a respective fixed length segment of said data file into said memory media before generating said first hashing representation; and
(e) recording said segment representation in said memory media; and repeating steps (a)-(e) for each of said plurality of fixed length segments until all of said segments in said data file have been read and the token table contains one segment representation for each segment in said data file.
54. The method of
55. The method of
56. The method of
57. The method of
(a) calculating the exclusive-or product of each character in the segment;
(b) dividing the segment into equal length subsets;
(c) generating an exclusive-or product for at least one of said subsets of the segment; and
(d) concatenating the exclusive-or product for at least one of said subsets with the exclusive-or product of each character in the segment to form said exclusive-or representation.
58. The method of
59. A method for producing a token table from a computer data file in a memory media, the method comprising, for each of a plurality of fixed length segments in the data file, the steps of:
(a) generating a first hashing representation for the segment using a first algorithm; and
(b) generating a second hashing representation for the segment using a different algorithm from said first algorithm,
said first and second hashing representations together comprising a segment representation for each segment.
60. A token table in a memory medium comprising first and second different hashing representations of each of at least two nonoverlapping, fixed equal length segments in a file in said computer.
61. The token table of
62. The token table of
63. The method of
calculating a second exclusive-or signature for a segment in the second file;
after calculating said first exclusive-or signature for said base window segment and said second exclusive-or signature for said segment in the second file, comparing said first and second exclusive-or signatures;
if said first and second exclusive-or signatures match, calculating a first non-exclusive-or hashing representation of said base window segment and calculating a second non-exclusive-or hashing representation of the segment in the second file to verify whether both said base window segment and the segment in the second file match; and
creating said second window segment from said base window segment and creating said second window segment token from said base window segment token only if said first and second exclusive-or signatures do not match and said first and second non-exclusive-or hashing representations do not match.
64. A method for storing different versions of a computer file having a plurality of fixed length segments in a first memory media associated with a data processor, comprising the steps of:
(1) generating a token table in said first memory media, said token table comprising two hashing representations for each of said plurality of fixed length segments of a first version of said computer file,
(2) generating a record of differences between the first version of said computer file and a second version of said computer file using said token table, and
(3) storing said record in a second memory media.
65. The method of
66. A method according to
67. A method according to
68. A method according to
69. A method according to
70. An apparatus according to
71. A method according to
72. A method according to
73. The method of
74. The method of
75. A method for producing a token table from a computer data file in a memory media, the method comprising, for each of a plurality of fixed length segments in the data file, the steps of:
(a) generating a first hashing representation for the segment;
(b) generating a second hashing representation for the segment; and
(c) associating the first representation with the second representation in the token table.
76. The method of
77. The combination according to
78. The combination according to
79. The method of
80. The method of
This application is a continuation of application Ser. No. 08/039,702, filed Mar. 30, 1993, now U.S. Pat. No. 5,479,654, which is a continuation of application Ser. No. 07/515,164, filed Apr. 26, 1990, now abandoned.
1. Field of the Invention
This invention relates to techniques for representing file differences useful in computer file protect systems and other systems, and more particularly to file transfer techniques useful in an electronic data backup system wherein only changes in a file are periodically sent to the backup system and in other systems.
2. Discussion of Prior Information
It is well known to off-load computers at the end of a work day to secure the data file against computer failure. It is also known to transmit the file to an off-site location for additional file security.
What is not known is the generation of a set of representations of the changes in a file, and the periodic relocation of that set of representations and its use to update the previous version of the file.
Accordingly it is an object of the invention to generate a set of representations of the changes made in a computer file during a period of time.
Another object of the invention is to generate a set of representatives of the changes made in a computer file which can be used to update an earlier version of the file, or to create a previous version of an updated file.
Still another object of the invention is to generate and to use such a set of representations in a cost and time effective manner.
The objects of the invention are achieved through computer programs designed to run on a micro- and mini-computers. A first or SCAN program is designed to create a TOKEN Table (or file signature) of mathematical representations of segments of the file as it exists at the start of a period (earlier file (EF)). The TOKEN Table reflects the indices (ordinal numbers) for all of the segments in the earlier file, and the exclusive-or (XR) and cyclic redundancy check (CRC) products of the set of characters for each segment. Actually, two CRC products are generated for each segment; a sixteen bit one and a thirty-two bit one. The three products, XR and two CRC, are generated for speed in comparisons: the XR product is first compared because it is the fastest comparison; then the slower sixteen bit CRC one if necessary; and finally the still slower thirty-two bit CRC if necessary.
A second program is used at the end of the period to create a MATCH Table setting forth the location of segments in the current file that are identical to those in the earlier file. The MATCH Table lists the indices of all of the segments in the earlier file and the file offsets of the first character of the corresponding identical segment in the updated file. The second program calculates the mathematical representations of the first segment (window) in the updated, revised or current file, first calculating only the XR product and comparing it to the XR product for the first earlier-file segment in the TOKEN Table and noting whether a match exists. If so, it then calculates the sixteen bit CRC product and compares it to the sixteen bit early file CRC product and notes whether a match exists; if so, it finally calculates the more time consuming but more reliable thirty-two bit CRC product and compares it to the thirty-two early file CRC product and notes whether a match exists; and if so, makes an index and offset entry in the MATCH Table for the identical segments; the offset entry being the ordinal number of the first character in the current file segment string of characters. (The earlier file segments are numbered (indexed) sequentially.). If a segment match is obtained, the second program calculates one or more mathematical representations for the next segment in the current file, and compares them to the products associated with the next index in the TOKEN Table and representing the second segment of the earlier file. However, if a mismatch obtained, the window (which retains segment size) is bumped along one character, new product(s) calculated for the window characters and comparison(s) again made with the same representations of the earlier file segments in the TOKEN Table. This continues until a match obtains at which time the index for the earlier file segment and the offset of the first character in the nonmatching current file window (segment) are recorded in the MATCH Table. The process then continues as above to the end of the current file. Only the XR product is calculated in the event of an XR product mismatch; the sixteen bit and the thirty-two bit CRC products being generated respectively only in the event of earlier matches of the XR and sixteen bit CRC products.
A third program creates a TRANSITION Table that reflects what's in the current file that's not in the earlier table, and where. It scrolls through the list of indices and offsets in the MATCH Table, to see if each offset number differs from the previous one by the segment size. When such an offset differs from the previous one by more than the segment size, it adds the segment size to the first offset to determine the file ordinal number of the first character in the matching information, subtracts one from the second offset to determine the last character, goes to the current file and lifts therefrom that set of characters beginning with that ordinal number and stopping with the character preceding the extra-spaced offset, and adds them to the MATCH Table to create with the index a TRANSITION Table.
Thus creation of the Transition Table involves assuring that every character in current file is accounted for in the TRANSITION Table. The MATCH Table provides all of the information necessary for this accounting. Each entry in the beginning column represents a match in the early file of segment characters to the current file characters at location beginning. The matching segment in the early file is located at that offset, which is equal to the index times the segment size in early file.
Essentially the same process is followed for a deletion. The second program, if no match obtained for an earlier file segment by the end of the updated file (or over a predetermined number of segments as conditioned by the character of the file), would have proceeded to endeavor to match the next index mathematical representations in the TOKEN Table with a current file segment, with no offset entry having been made in the MATCH Table for the index of the segment that was unmatched. On proceeding with the index and representations of the next earlier-file segment, the window of the current file would be bumped along, and the index and offset number entered in the MATCH Table when the match of the mathematical representations occurred. The third program on scrolling through the MATCH Table offsets, notes the missing offset, notes the preceding offset, adds the segment size to the previous offset and copies from that number forward the reduced characters if any in the current file before the next offset, into the TRANSITION Table and in association with the index number of the unmatched segment.
The TRANSITION Table is used to update a copy of the earlier file. Typically, a fourth program and the earlier version of the file are on an off-site location and the TRANSITION Table representations are electronically transmitted thereto. The fourth program will examine the indexes and offsets of the TRANSITION Table, copying segments from the earlier file where the succeeding offset just differs by the segment size, into what is to be a duplicate version of the updated file, making additions where the offset numbers differ from the preceding ones by more than the segment size with the information provided in the TRANSITION Table, and substitutions from the TRANSITION Table where the offset numbers are missing.
As observed earlier, the TOKEN Table mathematical representations of file segments may be the products of exclusive-oring of the characters in successive earlier file segments and of generating two cyclic redundancy check (CRC) products for each earlier file segment. Corresponding XR products are most quickly generated, but do not detect character order differentiating; a sixteen bit CRC will catch most of these transpositions; a relatively slowly generated thirty-two bit CRC product will detect essentially all of them.
As observed earlier the MATCH Table is generated by the second program generating mathematical representations of the segment sized windows of the current file, and comparing the representations of a window with an index's associated mathematical representations in the TOKEN Table. As long as matches obtain, successive window sized segments of the current file are addressed and a MATCH Table listing reflecting the early file segment index and the current segment first character offset is generated. Normally three mathematical representations of each segment obtain—an exclusive-or (XR) one and sixteen bit and thirty-two bit cyclic redundancy check (CRC) ones. In the interests of speed, the XR products are compared first, and if a mismatch occurs in them, it is clear that the segments are unmatched. However, even if the XR products match, the segments may not match because the XR operation is not sensitive to the transposition of characters. Accordingly, it is also necessary on XR match, to compare the sixteen bit CRC product. On sixteen bit CRC match, it is desirable to do a thirty-two bit CRC match for most applications to achieve practically one hundred percent certainty. The generation of the CRC product is a relatively slow process and is avoided where possible as on XR mismatch. However, the great benefit of avoiding CRC calculations occurs in operations subsequent to segment mismatch.
As observed earlier, upon detection of a mismatch, a segment sized window representing only a one character displacement of the window in the current file is operated upon to determine its mathematical representations and compare them with the representations of the just compared TOKEN Table representations, then on mismatch upon successor windows until a match obtains or the end of file is reached. By generating first the quickly generated exclusive-or (XR) products, and only on match generating the more slowly generated CRC products, a significant amount of time can be saved.
Applicant has further discovered that even the exclusive-oring process can be expedited on a one-character shift of the window under consideration. Thus the new XR product need not involve the exclusive-oring of each of the characters of the new window: rather only the exiting character and the entering character need be exclusive-ored with the existing XR product of the just tested segment. The second exclusive-oring of the exiting character amounts to a subtraction of it from the segment product.
Another feature of the invention is that the amount of updating material that must be transmitted to the off-site is minimal; normally being less than five percent (5%) of the current file.
An advantage of the invention is that it provides an easy way to secure a user's data from fire, theft and tampering.
Another advantage is that is provides an inexpensive disaster recovery insurance.
A further advantage is that it eliminates the tedious chore of computer backup, and allows the user's office time to be dedicated more fully to the productivity and profitability of his or her business.
Yet another advantage of the invention is that programs embodying the invention can be incorporated in larger programs for handling large model files which are immune to character insertions and deletions and grow in size to accommodate new records. Thus under certain circumstances, it is possible to skip creation of MATCH and TRANSITION Tables by windowing techniques.
These and other objects, features, and advantages of the invention will become apparent from a reading of the following specification when considered with the appended drawings wherein:
FIG. 1 is a diagram of a system according to the invention;
FIG. 2 is a representation of the contents of a user's earlier file;
FIG. 3 is a representation of the contents of the user's updated file;
FIG. 4 sets forth a TOKEN Table which consists of the indices and the exclusive-or (XR) and cyclic redundancy check (CRC) products of successive segments of the earlier program;
FIG. 5 sets forth a MATCH Table reflecting a comparison of the TOKEN Table contents with the identical segments of the current program;
FIG. 6 sets forth a TRANSITION Table reflecting the differences in the two files of FIGS. 2 and 3;
FIG. 7 is a flow chart setting forth the method of the first or TOKEN Table generating program;
FIG. 8 is a flow chart setting forth the method of the second or MATCH Table generating program;
FIG. 8A is a somewhat more detailed flow chart of the method shown in FIG. 8;
FIG. 9 is a flow chart setting forth the method of the third or TRANSITION Table generating program;
FIG. 9A shows an obvious variation of the method shown in FIG. 8A;
FIG. 10 is a flow chart setting forth the method of the fourth or reconstruction program;
FIG. 11 sets forth a MATCH Table having an alternate format to that of FIG. 5;
FIG. 12 sets forth a TRANSITION Table having an alternate (IBE) format; and
FIG. 13 sets forth a TRANSITION Table heaving another (IBC) format.
FIG. 14 is a flow chart of the program for creating the MATCH Table for large model files.
FIG. 15 is a flow chart of the steps for generating the TRANSITION Table for large model files without creating the intermediate MATCH Table.
The system concept of the invention is shown in FIG. 1. A user maintaining a data file 10 (FIGS. 1 and 2) such as "This is a test file." in a memory generally indicated by the number 12 of a computer 14, would at the start of the workday, activate a first program 16 (FIG. 7) also in the computer memory to partition the earlier file into five characters segments, generate XR and CRC products for each segment, and list each segment by its index (ordinal number) and its products in a TOKEN Table 18 (FIGS. 1 and 4) in the memory 12 and that he might care to store for the workday on a disk drive (not shown) to maximize available memory space. During the day, the user would update, as by inserting the word "radical", the file 10 so that it reads "This is a radical test file." (FIG. 3), using a conventional data base program 20 also in the memory. At the end of the workday, the user would activate a second program 22 (FIG. 8), then located in the memory 12, to create in the memory 12 a MATCH Table 24 (FIGS. 1 and 5) consisting of indices from the TOKEN Table and the offsets of the first characters of segments (windows) of the updated file that result from the matching of the exclusive-or (XR) and cyclic redundancy check (CRC) products of updated file segments with the products associated with the indices.
The third program 28 in the memory 12 (FIG. 9) works in conjunction with the MATCH Table (or "difference signature") to develop the TRANSITION Table (or "difference signature") which succinctly defines what is or is not in the current file that was not or was in the earlier file. It does this by scrolling through the offsets in the MATCH Table. It looks at the offsets for successive indices, checking to see if it differs from the previous offset by the segment size. When it doesn't, it copies the current file material between the end of the last segment and the start of the segment with the greater than segment size offset, into the TRANSITION Table, there to be associated with the index of the greater than segment size offset.
It results that the TRANSITION Table reflects the changes obtaining in the current program over the earlier file.
The TRANSITION Table is then electronically sent, using conventional modems and communication programs, to the off-site computer 30 over telephone wire 32. Computer 30 has a memory generally indicated by the number 34 which receives the TRANSITION Table in section 36. The earlier file would normally already be resident in section 38 of the memory 34, representing the file as it was updated at the end of the previous day. The fourth program (FIG. 10) creates a duplicate of the current file by inserting or deleting information according to the dictates of the TRANSITION Table in memory section 36 and the contents of the earlier file in memory section 38. As long as the offsets for successive indices differ by the segment size, the program copies the segments for the indices from the earlier file into the memory section 40. When an addition is indicated as at index 2 because the offset figure (18) is larger than the normal segment size (5) over the previous offset figure (5), the fourth program looks for the additional information (here "radical") in the related area of the TRANSITION Table and inserts it in the duplicate file, after the tenth character (number 9). The fourth program then continues reviewing the TRANSITION Table and copying from the earlier file until another non-segment-size-distant offset (here none) is detected.
The TOKEN Table 18 (FIGS. 1 and 4) is created by the first program 16 (FIG. 7) first partitioning the earlier file into fixed sized segments (here five characters) and then generating a mathematical representation for each segment by first creating an exclusive-or (XR) hash product of the characters of each earlier file segment, and then creating a cyclic redundancy check (CRC) product of the characters of each of the segments. Characters of a segment are normally represented by bytes of eight binary bits each, which bytes are exclusive-ored in turn, the first two being exclusived-ored and then that product with the byte of the next character, and so on until the last character (here the fifth) has been exclusive-ored, and the product (exclusive-or hash) stored in the TOKEN Table 18 with the associated index.
Mathematical operations other than exclusive-oring, such as checksum may be employed, but exclusive-oring is the fastest.
Since the exclusive-oring operation is not character order definitive, a second mathematical operation (here cyclic redundancy check (CRC)) is performed by the first program on each segment and recorded in the TOKEN Table with the associated index. There are many polynomials for generating CRCs: applicant incorporates in the first program the thirty-two bit ANSI X. 3.66 CRC Checksum files that appear in FIPS PUB 71 and in FED-STD-1003, to generate the CRC entry for each index in the TOKEN Table (FIG. 4).
As CRC calculations for CRC products are very slow compared to those for XR products, it may be desirable to increase the reliability of the XR product(s). Reliability may be increased by generating intermediate XR products, such as the XR product of half of the characters in a segment. Thus given a series of arbitrarily assigned binary terms for the various characters as indicated below, with segment size equal eight, quarter and half products may be generated respectively and are shown in the right hand columns, the underlining in the more leftward columns indicating where the products are taken:
The segment "This_is_" may be divided into one or more equal sized parts (excepting perhaps the last to accommodate an odd segment size). In this example four separate terms are used. (Each subterm, during nonmatching window operations, may be adjusted by x-oring out the exiting character and x-oring in the incoming character.)
The quarter terms may be combined in any order or fashion. The following expressions are equivalent:
Therefore the XR product Term may be expanded to include more information than the XR segment carries without sacrificing the runtime speed advantage of the XR window technique.
The following expressions represent combinational variations of the above rules which, in the context of this invention may be used to provide additional effeciency benefits:
Whereas the Regular XR (segment) product term is the XR sum of C[0-7]=Q[0-3]=H[0-1], subterms (Q and H . . . ) may be introduced to add precision (quality) to the XR test.
The quality of the XR test is important. The runtime efficency of the engine depends upon 1) the quality of the XR test; a more precise XR test solution will cause less frequent fallback to the more expensive CRC tests; and 2) the efficiency with which the XR tests can be implemented as related to standard processor architecture.
Currently supported processor environments favor a two term XR test:
Using just a standard XR test (8 bits), a false compare with random data permits a CRC hit (1:[2 to 8th=256]) times. By including a single subterm (HO) this ratio is increased to (1:[65636=2 to 16th]), thereby saving considerable CPU resources. Given more robust computer processing units, more subterms may be included to further enhance performance and reliability.
If sufficient terms are included, the reliability of the XR product or test may be enhanced sufficiently such that the stringent requirements for the CRC tests may be relaxed and the minimum reliability requirements achieved in a more time effective manner.
The flow chart of FIG. 7 details the operation of the first program. Characters are read from the earlier file EF and when the fifth character is encountered, an index counter is incremented, the XR and CRC products calculated, the index counter contents and products stored in the TOKEN Table, and the character counter reset.
Once the TOKEN Table has been created, the file 10 is opened for updating. In the example of this application, the earlier file "This is a test file" (FIG. 2) is updated, using conventional data base program in memory section 42, with the word radical followed by a space to read "This is a radical test file." (FIG. 3), and this is assumed to be its status at the end of the workday.
The second program 22 (FIG. 2) is actuated to begin the creation of the MATCH Table (FIG. 5) at day's end. It generates mathematical representations of similarly sized segments (windows) of the updated program and compares them to those of the earlier program in the TOKEN Table. Thus, the first segment of the five characters in the updated file would have its exclusive-or and CRC products compared to those in the TOKEN Table of the first segment of the earlier file, and if found equal as they should be in the examples since the identical characters and order obtain in each, the index "0" indicating the first earlier file segment and the offset "0" indicating that the first character in the identical segment in the updated file is the first character in the updated file, are recorded in the MATCH Table. In the examples, the second segments should be found equal, too, and the index "1" and offset "5" recorded. On the third segment, a mismatch of the exclusive-or, and if not, the CRC products should obtain as the segments being compared have the characters "test" and "radic", respectively. Accordingly, the second program increments as the next updated-file segment to be mathematically treated (that is, advances or bumps the updated-file window of consideration, here five characters), one character forward and here involving the updated-file characters "adica". When compared to the mathematical representations of the number 2 segment of the earlier file, a mismatch should again be detected. The program then repeats the operation on succeeding segment windows spaced one character until a match obtains, here involving the third file segment containing the characters "test". The index "2" and the offset "18" are recorded in the MATCH Table The representations of the next segments, of the updated file would match those in the TOKEN Table for the index "3" and hence the index "3" and offset "23" would be entered in the MATCH Table and a suitable end of the file signal noted to end further segment search.
The flow chart of FIG. 8 details the operation of the second program. The program looks at the first segment (window) of the updated file, calculates the XR product, compares it to the XR product for the first index in the TOKEN Table, and if no match obtains, bumps the window to repeat the process. If an XR match obtains, it calculates the CRC product and compares it to the CRC product for the index in the TOKEN Table. If a match obtains, the index and the file offset of the first character in the updated file are recorded in the MATCH Table and the window of consideration for the second file shifted one full segment.
FIG. 8A is a somewhat more detailed flow chart of the operation of the second program.
As an example of a file deletion, consider that the only change to the earlier file involved deletion of the word "a". The updated file would now read: "This is test file.". When the second program is actuated to generate the MATCH Table, it would find that the mathematical products for the first segments match and proceed as above. However, it would find that those of the second segments ("is a" and "is te") do not match. Nor would it find a match on bumping the segment window through the rest the updated file, thus no offset of the updated file ordinal number of the first character of an identical segment would be recorded in the MATCH Table, only the index "1" would be recorded. Then the program would return to look for matches of the third earlier file segment in the updated file. Of course here matches would obtain on the segments "test", and the index "2" and the offset "8" duly recorded in the MATCH Table. On scrolling through the MATCH Table, the third program would note that the offset "8" for the updated program segment matching the third segment in the earlier program was less than a full segment size (5) from the previous one, and thereupon copy the current-file information after the last matching segment and before the matching segment, into the TRANSITION Table. The fourth program, in creating an updated version of the original program, too would notice the nearness of the offsets and use that as its clue to substitute the TRANSITION Table information for that in the earlier file segment.
A flow chart detailing the operation of the third program is set forth in FIG. 9. The MATCH Table is read for index and offset information, the offset number compared with zero or that of the previous index, and if the difference is the segment size, advances to read the next index in the MATCH Table. If the difference was other than the segment size, it scrolls through the updated file to copy information since the preceding segment into the TRANSITION Table.
As an obvious variation, the second program can create the TRANSITION Table directly without the need for the third program by copying, when a mismatch between the mathematical representation for the segment in the earlier file EF and the mathematical representation for the segment window for the updated file is obtained, the character which has been bumped out of the window directly into the MATCH Table, thereby directly generating the TRANSITION Table. This is shown in the flow chart of FIG. 9A.
A flow chart detailing the operation of the fourth program is set forth in FIG. 10. TRANSITION Table indices and their offset numbers are read and offset numbers checked for zero or for segment-size differences from the previous index. If it is the case, the index segment is copied from the earlier file into what is to be the second copy of the updated file. If it is not the case, information is copied from the TRANSITION file into what is to be the second copy.
An alternate format for the MATCH Table is set forth in FIG. 11. The format visualizes not listing individually successive identical segments, but rather merely indicating their number with the index for the first of such segments. Thus, with respect to the files of FIGS. 2 and 3, the second and fourth segments of the current file would not be listed; rather the indexes for the first and third segments would have associated with them under the column "Extent" the numeral "2" to indicate that two successive segments were identical in each case. This format has the advantage of being even more concise. It in effect maintains the segment count information as the index. It is more compact for large files, where an addition may contain nine or more bytes. Hence it requires less computer memory to support it.
Alternative embodiments of the TRANSITION Table may be employed. Thus, the TRANSITION Table may include other information, such as the segment size and supervisory error detection codes, and program version information.
Thus the TRANSITION Table may be written in any one of several base formats:
The IB format sets forth the index (ordinal number) of the successive identical segments and the offsets of their beginning characters. The IBC format sets forth the index of the first offset of a set of identical segments and the number (count) of such identical segments in the set. The IBE format sets forth the end character of each set of identical segments instead of the count. IBE format facilitates carrying end-of-file (EOF) information with it.
The IE format has been used exclusively for discussion in this document to avoid confusion.
The other formats, IBC and ABE are advantageous because they require less space than the IB format.
It will be evident that applicant has provided a method, means, and articles (signatures) for readily changing a secure file to reflect changes made in a copy of it elsewhere during an operating period such as a day. Applicant first creates a signature of the file the TOKEN Table; the signature is the index and a mathematical representation of each of the successive equal-sized segments of the file. Then the file is updated to reflect the transaction occurring during the course of the day. At the end of the day, the mathematical representations of successive window segments of the updated file are compared with those of the earlier file in the TOKEN Table, with the window segment for the updated file being bumped one character until either a match or end of file signal is detected where upon the next earlier file segment index is compared for A Match Table is created indicating the indexes (ordinal numbers) of the earlier file segments and the offsets (file character ordinal numbers) of the first characters of the identical updated-file segments. Next the updated file is scrolled through, and the non-matching information is copied from it, using the index numbers and offset numbers of the MATCH Table as a guide, into the TRANSITION Table. The TRANSITION Table may now be shipped to where a copy of the earlier file is, to update it according to the TRANSITION Table, by the fourth program.
As observed earlier, the programs of the invention can be incorporated in larger programs for handling large model files.
Certain files are immune to character insertions and deletions, these are large model files (LMF's). Nearly all commercial data bases create large model files. Large model files follow the following rules:
1) The file must be immune to character skewing. Data bas applications, which use records and fields obey this convention. Any change or update to a field or record will have no effect upon the location (offset) of any other record in the file.
2) If the file needs to grow in size to accomodate new records, additional records are appended to the end of the file. This format permits recycling of early file space as long as the character skewing rule is not violated.
A small model file (SMF) is any file which does not obey large model file (LMF) rules.
Thus under certain circumstances, it is possible to skip the windowing portion of this algorithm, thereby saving time and computer resources.
As a large model file example, consider an:
EF "This is a test file.", and a
CF "This is a test file. mom"
Large model file rule 1 is met: The file modification (change i to would not cause the bytes associated with any other file character to be effected. Each matching character is at the same byte offset in early file and current file. No character showing occurred.
Large model file rule 2 also is met: The additional infomation (mom) appeared at the end of the file.
For the purpose of this example, if more than 50% of a file matches under large model file rules, the small model file logic is to be omitted.
Considering further the above large model file,
It can be seen that the first, third and fourth five-character match, and the second and fifth don't. Thus the statistics are that three segments match, therefore more than 50% current file was matched by early file.
The MATCH Table Would be:
A flow chart of the program for creating the MATCH Table for large model files is provided in FIG. 14.
Therefore the TRANSITION Table should read:
As with small model files, the TRANSITION Table can be generated without having to generate the intermediate MATCH Table by recording segments which do not match directly into the MATCH Table. FIG. 15 is a flow chart of the steps for generating the TRANSITION Table for large model files without creating the intermediate MATCH Table.
This method of pretest, yields substantial runtime reductions on large model files. The windowing technique cannot yield superior results on files which follow large model file rules, it is therefor unnecessary to attempt to resolve such a large model file using the small model file windowing technique.
The larger program employs a two pass technique to efficiently process both large model files and small model files, it is unnecessary to employ the small model files windowing technique.
The first pass assumes that the file is a large model file. Each corresponding file segment from the TOKEN Table is compared to the corresponding current file segment. Comparison statistics are maintained. If more than a user specified percentage of the file matches using large model file rules, (or large model files rules were given at runtime) the small model file resolution logic is shipped, thereby saving considerable computer resources and time.
If the first pass comparison yields sufficiently poor results, or small model file rules were invoked at runtime, the small model file logic is invoked and the file is processed normally.
In addition to the above another computer back-up application, the invention lends itself to other applications. One such application is a media distribution application. A data vendor may maintain a large data base, say of sales tax rates for various cities and states, which is periodically updated. A mail order business may be a user of such a data base in order to charge the correct sales tax on each of its various order fulfillments. The data base maintainer would initially send the mail order business the complete data base. He would also generate a TOKEN Table of the data base as it then existed, using the first program. Upon updating his data base, he would develop a MATCH Table and a TRANSITION Table, using the second and third programs, and he would transmit the TRANSITION Table to the user. The user would update his data base, using the fourth program. The process would be repeated for subsequent updates.
In another application, the invention is used to harmonize files being independently updated at two different locations. Each location would generate a TRANSITION Table to reflect its changes, using the second and third programs, and send the Transition Table to the other location. The receiving location would then use the fourth program with the other's TRANSITION Table to update its file with the other locations changes.
In an archive maintenance application, a data base is continuously modified, say daily, and it is desired to maintain a complete daily archive. Initially, the data base as it exists at the start, would be copied onto the storage media and a TOKEN Table developed using the first program. At the end of the first day, a TRANSITION Table would be developed, using the second and third programs and copied onto the storage media having the original data base; also a new TOKEN Table would be created. At the end of the second day, a new TRANSITION Table would be developed and copied onto the storage media; also a new TOKEN Table. By continuing this daily process, a complete archive can be maintained on significantly less media than would normally be required, and the data base can be restored, using the fourth program, as it existed on any given day.
Another application involves a WORM Work File Maintenance System. (A WORM is a Write Only Read Many storage device.) Such a system may include a Server having a computer and a normal read/write/erase disk drive (DASD) and a WORM, Several other computers are connected to the computer server through a high speed network. At the end of the first day, all data from the other computers is copied onto the DASD. At the end of the second day, the data on the other computers is compared to the data on the DASD to generate the TRANSITION Table which is copied on the WORM. The data from the other computers is copied onto the DASD, either directly or by updating, to replace that of the previous day. On the third day, the process of the second day is repeated, except for the new TRANSITION Table being added to the TRANSITION Table already on the WORM. The fourth and further days essentially involve repeats of the third day. The data as it existed on a given day can be reconstructed by working backwards from the current data on the DASD and the TRANSITION Tables on the WORM. Thus all history is maintained, and no additional supporting backup is required for the discrete and physically separate computers.
The invention also is useful in word processing applications. Instead of full copies of the updated versions, only TRANSITION Table need be maintained. The initial version of a document is stored as is on a backup device. A TRANSITION Table is developed for the first updated version and stored on the backup device too. A TRANSITION Table is developed for the next updated version, reflecting the differences between it and the previous updated version, and it too is added to the back-up-device. The backup device thus holds the original version of the document and TRANSITION Tables reflecting subsequent documents in a minimum of storage space, and any version of the document can be recreated.
From a consideration of the above, it is evident that it is not a requirement of the invention that the early file be retained. This invention was adopted to facilitate the description of the invention. Kindly consider the below application which reverses the role of early file and current file, allowing the early file to be created from the current file and the TRANSITION Table.
In a word processor application, it is the intent of the user to maintain a logical path back to every revision of a work, while retaining only the current file and the TRANSITION Table.
Assume that the author is working on the fifth generation of the work and has the fourth saved locally. The author generates a TOKEN Table for 5(5.h) and compares it to 4. The TRANSITION Table created is in a "reverse" sense. Restated, the fifth generation plug the TRANSITION Table equals the fourth generation. The author can recover the fourth generation of the document by applying the T54 file to the current file (CF) to recover early file (EF). The earlier fourth 4 can now be erased.
In this example, the invention does not require the present availability of the early file.
A printout listing of the computer program embodying the invention follows. It consists of the Terac.exe modules in object code in hexadecimal representation and the Terac Supervisory lynx.ksh module in UNIX Script representation, and the caret.exe modules in object code in hexadecimal representation.
While there has been disclosed preferred embodiments of the invention, it will be appreciated that other embodiments embodying principles of the invention can be created boy those skilled in the art without departing from the spirit or wording of the appended claims.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Buy online front row tickets for all Concert, Theater and Sporting events, and tickets to all sold out major events.
Sport, Concert and Theater tickets are hot and Frontrow.com has tickets to all your favorite events, including the Miami Heat Games, College Football and Super Bowl. We can get you "In the door" or the best seats to all games and events. Talk to one of our specialists or order online 24/7. Frontrow.com has a solid reputation of 22 years in the business selling tickets. Front row can get you tickets for all the, Playoffs and all NBA Games.
Poncho Sanchez Latin Jazz Band is always a great hit with every crowd. We stock all Poncho Sanchez Latin Jazz Band tickets to every Poncho Sanchez Latin Jazz Band show! Frontrow.com is your souce for premium Poncho Sanchez Latin Jazz Band tickets. Let us put you right up front and see Poncho Sanchez Latin Jazz Band like you've never seen before, up close and personal. Order online or call toll free at 800-881-7691 and speak to a frontrow concert experts.
BUY - SELL Poncho Sanchez Latin Jazz Band Tickets
Sell Your Poncho Sanchez Latin Jazz Band Tickets
Frontrow.com provides the ervice of finding and obtaining tickets to events worldwide. We are a private company not affiliated with any venue, stadium, promoter, theater or box office, the MLB, NBA, NFL, NCAA, NHL,NBA or any of their teams. Trademark, trade names, and copyrights, used in this web site are only for descriptive purposes. We Do not act with the permission or on behalf of any of above mentioned organizations.. We provide Poncho Sanchez Latin Jazz Band tickets through a range of sources and contacts. Prices for Poncho Sanchez Latin Jazz Band tickets are often higher than the ticket's face value, reflecting costs of finding and aquiring premium Poncho Sanchez Latin Jazz Band Tickets.
About us
Front Row is a quality ticket broker for all concerts, theater, and sporting events. Front Row sells the finest Poncho Sanchez Latin Jazz Band packages and tickets. If tickets you are searching for are not available, please check back as we always update and list new tickets in our huge inventory. Poncho Sanchez Latin Jazz Band schedules are on our web site. Just click to see our real-time online concert, sport and theater tickets.
Frontrowcom has the largest inventory of Poncho Sanchez Latin Jazz Band Tickets on the secondary ticket market. Call today for up to the latest information on ticket availability and prices since we constantly purchase new event tickets. If you want to go to a special Poncho Sanchez Latin Jazz Band event; we are your ticket broker for sold out Tickets. Front Row welcomes corporate accounts seeking premium tickets for entertaining clients.
Front Row has been a ticket broker for over two decades. Our mission statement is to give our clients the best service, lowest prices and reliability. When searching for Poncho Sanchez Latin Jazz Band Tickets or other events, Call Frontrow.com where our professional team can offer you the ultimate Poncho Sanchez Latin Jazz Band Tickets experience.
Front Row.com is for all of your other ticketing needs. Frontrow.com sells tickets to all concert tours nationwide. Not only do we sell Poncho Sanchez Latin Jazz Band tickets but we also buy Poncho Sanchez Latin Jazz Band tickets, NFL tickets, NCAA tickets, NHL tickets, NBA, MLB, all golf tickets, tennis, title fight tickets, concerts, family show tickets, and theater tickets including Broadway and Las Vegas shows. Call Frontrow.com today for Poncho Sanchez Latin Jazz Band Tickets ; and all of your entertainment needs! Frontrow.com strives to provide our patrons the utmost quality service and competitive pricing. If any event isn't listed; please phone us for any hard to find or special requests.
PURCHASING AND AVAILABILITY OF Poncho Sanchez Latin Jazz Band Tickets
Click the above link for Poncho Sanchez Latin Jazz Band info and front row tickets to events across the country and globe. You can buy tickets for Poncho Sanchez Latin Jazz Band on our web site by selecting your specific venue and time. When searching for Poncho Sanchez Latin Jazz Band tickets that are unavailable or sold-out from other sources, contact Frontrowcom, your source of front row tickets. If you don't see tickets on our frontrow web site or don't want to order online, don't hesitate to call us toll free at 800-881-ROW-1. We are ticket pro's and offer data about buying tickets, schedules and venue maps. Frontrow.com offers an vast inventory of theater, concert, sport event tickets with constant updates. At Frontrow.com; our goal is offering the largest selection of Poncho Sanchez Latin Jazz Band tickets on the secondary market. Use "Click Here" links to check future events, schedules and seating charts. Our Poncho Sanchez Latin Jazz Band inventory has up to the hour accuracy. However, if tickets you want are not available, please contact us and our staff will guide you through available options in the same or similar category to your original ticket choice.
Ticket delivery
All tickets are sent via Federal Express. Once you locate Poncho Sanchez Latin Jazz Band tickets you want to buy, they can be purchased online via our secure encrypted server. If you prefer more personal service, call us today and speak to any of our ticket brokers. Poncho Sanchez Latin Jazz Band tickets are usually sent within 6-24 hours. Your shipping address must match the billing address of your credit card. If you wish to ship to an alternate address; we require ID. Please contact one of our ticket experts to provide you with excellent service.
Ticket refund policy
All Poncho Sanchez Latin Jazz Band sales and all other event tickets are final.
Poncho Sanchez returns to Steamers
Poncho Sanchez and his Latin jazz band have become regulars at Steamers Jazz Club and Cafe in Fullerton. The Grammy Award winning musician, associated with several genres of jazz, returns to the club's stage on Sunday. He made his first appearance ...
EUR on the Scene: Poncho Sanchez Heats Up LACMA's Latin Sounds Concert ...
Salseros and lovers of the Latin Sounds of Salsa and Latin jazz were thrilled to kick-off the Summer season with a fiery set of Latin jazz and Salsa served up generously by Poncho Sanchez and His Latin Jazz Band. This opening concert was held on ...
Jazz St. Louis' upcoming season books Gregory Porter, Dee Dee Bridgewater ...
Dave Holland, Kevin Eubanks, Eric Harland: PRISM, Oct. 21-24, $35. • Poncho Sanchez & His Latin Jazz Band, Nov. 4-7, $40. • Omaha Diner featuring Charlie Hunter, Bobby Previte, Skerik, Eric Brown, Nov. 18-21, $35. • Sean Jones live CD recording, Dec.
and more »
Times of San Diego
Latin Jazz Greats Arturo Sandoval, Poncho Sanchez Play Here
Times of San Diego
Sanchez and his Latin Jazz Band open the evening, bringing their fiery stew of straight-ahead jazz, gritty soul music combined with infectious melodies and rhythms from a variety of Latin American and South American sources. Sandoval takes to the stage ...
Conga King Sanchez takes Latin jazz in various directions
Poncho Sanchez and his band know how to stay out of the traps that niches create. The conga king led his octet Friday evening through two shows at the Manchester Craftsmen's Guild that were clear displays of how to accomplish that end. To be sure ...
Check out Frontrow.com for all your tickets needs. We've got great sources for any event ranging from concert tickets to World Series tickets, Book of Mormon tickets, and Las Vegas show tickets. And don't forget the chance to score big on Broadway tickets and once in a lifetime events like the National Final Rodeo, the 2016 Super Bowl or the Daytona 500. Our inventory covers all types of entertainment and special events. With the biggest selection of concerts, sports, and theater tickets around, you can't go wrong with tickets from Frontrow.com.

subset: commoncrawl


text:
YIELD: Makes 4 to 6 appetizer servings
For dipping sauce:
Combine all ingredients except mayonnaise in processor. Blend well. Transfer to bowl. Stir in mayonnaise. (Can be prepared 1 day ahead. Cover and refrigerate. Whisk before serving.)
For calamari:
Pour oil to depth of 3 inches in heavy large pot. Heat to 350°F. Whisk next 4 ingredients in large bowl to blend. Pour buttermilk into another large bowl. Add calamari to buttermilk. Working in batches, remove calamari; dredge in flour mixture. Fry until just crisp, about 2 minutes. Using slotted spoon, transfer to paper-towel-lined plate to drain. Serve warm with sauce.
*Available in the Asian foods section of many supermarkets.
**A blend of ground anise, cinnamon, star anise, cloves and ginger available in the spice section of most supermarkets.


text:
Owned Licenses not installed
I am wondering how others manage licenses that are purchased for a user - but then the user does not want it installed so you have an extra license to use for someone else - do you use the stockroom feature in Altiris so you know you have a license next time someone requests one? Also when you enter a license purchase do you tie it to a machine and/or user? What process do you follow when a user leaves and it frees up a licenses their department purchased for them
Comments 1 Comment • Jump to latest comment
Asset Management Solution of IT management Suite support software licensing functionality. Software License is tracked based on per computer. Currently, there is no support to user based license tracking
Manually you can edit the software License, associate purchase, add borrowed /Donated count , non-inventoried count.
Asset Management Suite user guide will give more details about Software Licensing and tracking Compliance.
Please let me know if this resolution solves your query.


text:
Dr. Luke Sues Kesha's Mom, Pebe Sebert
It looks like the Kesha/Dr. Luke drama is getting even messier.
It looks like the Kesha/Dr. Luke drama is getting even messier.
In the continued back-and-forth lawsuit between Kesha and Dr. Luke, it appears as though Kesha refuted claims of sexual assault from Dr. Luke during an unrelated lawsuit three years ago.
Kesha is suing her music producer Dr. Luke, claiming that he sexually, physically and verbally assaulted her over the past 10 years.
You've heard of twerking. Check out the cowboy version.
Kesha is like a breath of fresh air in Hollywood. Earlier this year she was admitted to rehab, and not only is she not bothering to deny it, but in a gesture of complete sincerity, she's also opening up to the public on what led her to that point and why she decided to seek help.


text:
Supreme Court Upholds Controversial Part Of AZ Immigration Law
The Supreme Court on Thursday upheld the most controversial element of Arizona's immigration law, allowing the state to require police officers to enforce immigration laws. Three other provisions of the law have been struck down.
Undocumented Youth In Detroit Test Obama Immigration Order
President Obama's executive order that stays the deportation of some young undocumented immigrants is being put to the test at Immigration and Customs Enforcement in Detroit.
Opinion: Romney's Nixonian Secret Plans
Mitt Romney has provided no details, not even a hint, of what his immigration plan is. Either this is a lousy sales job, which is bad, or he has no idea there's a difference between running Bain Capital and running the nation, which is worse.
Opinion: Race Baiting Obama's Hecklers Is Wrong
People who claim that Obama is being heckled and disrespected more than any other president tend to have a short memory.
Opinion: Romney Can't Even Lead From Behind
The guy who passed health care reform in Massachusetts and vowed to repeal the Affordable Care Act can't take a policy position on Obama's executive order on immigration enforcement?
Rally In Detroit To Stop Deportation Of Undocumented Resident
A rally outside the Immigration office in Detroit calling for an end to the deportation proceedings against local construction business owner Gustavo Vargas-Mendez, who's been in Michigan for 24 years.
6 Illegal Immigrants Arrested After Calling Ambulance For Ride
Michigan authorities say they arrested six illegal immigrants from Mexico at a construction site after one called 911 to request an ambulance for a ride.
Colleges: International Students Key to Michigan's Economic Growth
DETROIT — Fast-paced economic growth in the health care, computer and engineering sectors, coupled with a shortage of domestic students graduating with degrees in the high-demand science, technology, engineering and math fields, has created a […]
Congresswoman Calls For Crackdown On Visa Abusers
Michigan Congresswoman Candice Miller says the government needs to take a closer look at U.S. visitors who overstay their visas, becoming illegal aliens.
Snyder Says Special Green Card Could Help Create Jobs
Testifying in front of a U.S. House Committee, Gov. Rick Snyder said he feels there should be opportunities in our country for immigrants with advanced degrees.


text:
2011 Year in Review -- Connecting with agriculture by experiencing agriculture
More than 11,000 nonfarmers experienced Ohio agriculture through numerous county Farm Bureau-led Grow and Know events in 2011.
Reporters, please visit our news room located in the Media and Publications section of this site.
More than 11,000 nonfarmers experienced Ohio agriculture through numerous county Farm Bureau-led Grow and Know events in 2011.
2011 marked the fifth anniversary of OFBFs weekly public affairs radio program, 'Town Hall Ohio.'
The grants improve communities and make connections.
Farmers were represented in discussions with the super committee, Sens. Brown and Portman, Reps Gibbs and Schmidt, USDA and U.S. Dept. of Labor.
As consumers increasingly turn to the Internet for information about food production, Ohio Farm Bureau continued to increase and develop its online presence and that of its members in 2011.
OFBF weighed in on three Ohio Supreme Court cases, which came out favorably for farmers this year.
Ohio Farm Bureau built relationships with Bob Evans Farms, Longaberger and Velvet Ice Cream.
Ohio Farm Bureaus Center for Food and Animal Issues continued to provide assistance to those dealing with animals care and cruelty complaints through its Animal Agriculture 101 training in 2011.
By interacting with journalists we can assure that agricultures views are portrayed prominently and accurately, giving the public a better understanding of the issues important to farmers.
The Young Agricultural Professionals and AgriPOWER programs continue to offer leadership development opportunities.


text:
Apologies, but no results were found for the requested archive.
Not Found
Extra: News for Students
Select Category
Tooltip of categories
Submit Your Student Voice
RSS Content
Tooltip of RSS content 3
- Five things your class needs to know about U.S.-Iranian relations
By Gabby Shacknai Iran's nuclear program has been a point of international attention since it…International IssuesIrannuclear weaponsPolitics
- Trans fat no more: FDA gives food industry three years
The Food and Drug Administration (FDA) has ordered the elimination of all trans fats from the food supply within the next three years, a long-awaited move that is expected to save thousands of lives per year. Continue readingfoodHealthTrans fats
- Rikers Island announces reforms following death of former inmate
The reforms were spurred in part by the death of Kalief Browder, a former Rikers inmate who was accused of stealing a backpack at age 16. Continue readingcriminal justiceJailReformRikers Island
- Breaking down the SCOTUS decision on marriage equality for your class
Background of Obergefell v. Hodges In the case Obergefell v. Hodges, plaintiff James Obergefell argued that…LGBTLGBTQmarriage equalitySCOTUSSupreme Court
- Charleston mayor: "We are still a work in progress in America"
The racially-motivated shooting of nine people at a historically black church in Charleston, SC, has spurred discussion and debate about the state of racism in America. Continue readingCharlestonraceSocial Issuessocial studiessouth carolina


text:
Gear Question
Shawn Locke
It looks like the fuel line overlaps the...
It looks like the fuel line overlaps the burner. Is this actually correct and doesn't it cause problems or risk?
Phil Maher
Hi Shawn,
That's normal and completely safe. Nothing to worry about at all. It's called a generator tube. What it does is allow the fuel to be preheated and vaporized prior to being expelled from the jet. When a liquid fuel is vaporized, it burns more cleanly and efficiently. Primus has been making stoves since the 1800s...longer than anybody.
shawn,its supposed to be like that.all fuels have a gaseous threshold for a given pressure relative to temperature.the distance between molecules determines the physical state of the substance ie solid,liquid,gas.they are all different.most people dont realize there are different formulations of canister gasses available for your stove.i ndont want to get into it here but i can tell you.the proportions of the gasses and the operating temperatures determine how long you can operate for a given ambient temperature whatever
shawn i forgot to tell you,the component fuels with the lowest boiling points tend to burn off first in lower ambients so if youre operating in low temps the percentage of your lowest temp fuel will gas off first then sequentially each remainding fuel with increasing boiling points.out
View More Details on Primus EtaPackLite Stove


text:
Schedule Online
Save Time
We're proud to support the communities we serve. Connect with us at events across the region this summer.
We have medically-accurate and age-appropriate programs, including Teen Council and Promotores de Salud.
Print and complete the appropriate health forms and bring them to your next visit!
Save Time
Learn More - PrEP 101


text:
More about this preview.

Change DPI Base size is 150
Explore Our fabrics
Optional Filters
I'm going to use this fabric to make...
I'm looking for a fabric that is...
Receive our weekly email with news about contests, giveaways and prodution releases.
Email Address
No Thanks
© 2008-2015 Spoonflower Inc


text:
E-Mail Address:
Forgot your password?
Log in
Not a member? Register now!
Common Conditions
Related Tools
Find & Review Drugs
Popular Topics
Advice & Support
During the
perimenopausal and
postmenopausal years, heavy alcohol
use can affect your long-term health. Limit your alcohol
intake to 1 drink per day. For a woman, 7 standard
drinks a week or more than 3 drinks in a day is considered heavy alcohol
use.1 Drinking too much alcohol:
CitationsNational Institute on Alcohol Abuse and Alcoholism
(2005). Helping Patients Who Drink Too Much: A Clinician's Guide (NIH Publication No. 07-3769). Washington, DC:
National Institutes of Health. Also available online:
Last Revised:
May 4, 2010
Healthwise Staff
Medical Review:
Kathleen Romito, MD - Family Medicine & Carla J. Herman, MD, MPH - Geriatric Medicine
This information does not replace the advice of a doctor. Healthwise disclaims any warranty or liability for your use of this information. Your use of this information means that you agree to the Terms of Use.
How this information was developed to help you make better health decisions
To learn more visit Healthwise.org
© 1995-2013 Healthwise, Incorporated. Healthwise, Healthwise for every health decision, and the Healthwise logo are trademarks of Healthwise, Incorporated.
This Site and third parties who place advertisements on this Site may collect and use information about
your visits to this Site and other websites in order to provide advertisements about goods and services of
interest to you. If you would like to obtain more information about these advertising practices and to make
choices about online behavioral advertising, please click here.


text:
Lordship of Bowland
The Lordship of Bowland is an historic feudal barony associated with the Forest of Bowland. It was once thought lost and was only recently rediscovered.[1] It disappeared in 1885 when the estates of the Towneleys, one of Lancashire's great aristocratic families, were broken up following the death of the last male heir. For much of the twentieth century, experts thought that the Lordship belonged to the Crown. In 1938, the Duchy of Lancaster had acquired some 6,000 acres (2,400 ha) of the Forest of Bowland, now known as the Whitewell Estate, near Clitheroe, and it was believed that the Lordship had been acquired with it.
It was discovered in 2008 that the 1938 sale, while it included mineral, sporting and forestry rights, specifically excluded the Lordship of Bowland itself. It accordingly descended to a Towneley family trust. In 2008, Charles Towneley Strachey, 4th Baron O'Hagan auctioned the title.[2][3]The new Lord of Bowland was later revealed to be a Cambridge University don who specialises in the history of Lancashire, its place names and dialects and has ancestral links to the Forest.[4][5][6][7]
The ancient origins of the Lordship lie in the Forest and Liberty of Bowland thought to have been created by William Rufus sometime after Domesday and was part of lands granted to his vassal Roger de Poitou, possibly to reward Poitou for his role in defeating the army of Scots king Malcolm III in 1091-2. The Forest and Liberty of Bowland, along with the grant of the adjacent fee of Blackburnshire and holdings in Hornby and Amounderness, came to form the basis of what became known as the Honor of Clitheroe. Ownership of the forest followed the same descent as the Honour, passing with the rest of the de Lacy lands.[8][9] to the Earldom of Lancaster. After 1351, it was administered as part of the Duchy of Lancaster, from 1399, a possession of the Crown.
Territorially, the Lordship of Bowland covered an area of almost 300 square miles (800 km2) on the historic borders of Lancashire and Yorkshire. It comprised a Royal Forest and a Liberty of ten manors spanning eight townships and four parishes. The manors within the Liberty were Slaidburn (Newton-in-Bowland, West Bradford, Grindleton), Knowlmere, Waddington, Easington, Bashall, Mitton, Withgill (Crook), Leagram, Hammerton and Dunnow (Battersby).[1] Harrop was included within the Forest.
In 1661, the manors contained within the former Honor of Clitheroe, including the Forest and Liberty of Bowland, were granted by the Crown to General George Monck as part of the creation of the Dukedom of Albermarle. Monck had been a key figure in the restoration of Charles II.[10] The Lordship of Bowland then descended through the Montagu and Buccleuch and Towneley families.
- ^ a b Forest of Bowland official website
- ^ "Lord of Bowland title sold at auction". Lancashire Telegraph. 31 October 2009.
- ^ "Lordship snapped up". Lancashire Evening Post. 1 November 2009.
- ^ "Buyer of aristocratic title revealed". Lancashire Evening Post. 10 November 2009.
- ^ "New Lord of Bowland is don at top university". Lancashire Telegraph. 13 November 2009.
- ^ "Keeping up traditions of beautiful Bowland". Lancashire Evening Post. 22 April 2010.
- ^ "Lord of the Fells, Guardian of History" (PDF). Rural Life. November 2014.
- ^ Clitheroe Historic Town Assessment Report Lancashire County Council
- ^ William Farrer, The court rolls of the honor of Clitheroe in the county of Lancaster (1897)
- ^ Thomas Dunham Whitaker, "An History of the Original Parish of Whalley and Honor of Clitheroe" (Routledge & Sons: Manchester 1872)


text:
Upload Photo
NYC large-soda ban: 10 other peeves Mike Bloomberg might want to target
With the soda ban going into effect on March 12, here's Newsday Westchester's list of 10 other peeves he might want to target.
26 weird laws on Long Island Peek into Long Island's most lavish homes LI people on the move! Promotions, new jobs Puppies from Southampton Animal Shelter 26 surprising relics from WWII Photos: 97 celebrities remember life on Long Island Long Island and New York City's top photos 18 things only Long Islanders would understand 58 signs you're from Suffolk LI notable deaths Notable Long Island celebs Recent LI fires


text:
Healing History Academy participants graduate
Don't be surprised if you run into someone around town wearing a lapel pin that says, "Racial Healing Ambassador." The pin bearer is one of 25 graduates of the Healing History Academy, a project of the University of Louisville's Anne Braden Institute for Social Justice Research (ABI) in partnership with the Louisville Metro Department of Health & Wellness Center for Health Equity.
HHA brought together Louisvillians of diverse ages, backgrounds and neighborhoods to learn about local and U.S. racial histories of the 20th century and their impact on current social inequalities.
Many of them already were professionally well-placed to make a difference in local nonprofit organizations, the school system and religious communities, said Cate Fosl, ABI director.
Participants took the knowledge they gained into their respective neighborhoods through community-based projects — including a performance on slavery and racial injustice, a teen movie and discussion club, book discussion groups and guided civil rights tours of Louisville.
Louisville Mayor Greg Fischer hosted a graduation ceremony for participants on Aug. 27 and each one now serves as a Racial Healing Ambassador for Louisville Metro.
"In our group meetings and in their follow-up projects, each of the people in HHA has shown themselves to be very proactive in identifying and speaking or acting against structural racism," Fosl said.
"We can see how meaningful the relationships are that they have built among one another. They have acted on the program's philosophy — the same one that propelled the civil rights movement of the 1960s — that said 'each one, teach one.' We feel confident they will continue to spread what they have learned and to act to end racism once and for all in our institutions, in our language and in our personal relationships," she said.
The Healing History Academy was made possible by a two-year racial healing grant from the W.K. Kellogg Foundation.
ABI, however, has curriculum materials and videos that it can loan to faculty or community groups that want to stage their own discussions. To inquire, call 852-6142.


text:
Pork Chops With Creamy Mustard Sauce
|Salad oil
|2 Tablespoon
|1 Medium, shredded
|1 Small, minced
|Dry white wine
|2 Tablespoon
|Prepared mustard
|2 Tablespoon
|3⁄4 Teaspoon
|1⁄4 Teaspoon
|Thyme leaves
|1⁄4 Teaspoon
|1 Cup (16 tbs)
|1⁄2 Cup (8 tbs)
|All purpose flour
|2 Teaspoon
|Chopped parsley
|1 Tablespoon
1. In 12-inch skillet over medium-high heat, in hot salad oil, cook pork chops until well browned on both sides; remove pork chops from skillet as they brown.
2. In drippings remaining in skillet over medium heat, cook shredded carrot and minced onion until vegetables are tender, stirring mixture occasionally. Stir in wine, mustard, salt, pepper, thyme, and 1 cup water. Return pork chops to skillet; over high heat, heat to boiling. Reduce heat to low; cover and simmer 30 minutes or until pork chops are fork-tender, turning once.
3. Skim fat from liquid in skillet. In cup, stir milk and flour until blended. Gradually stir flour mixture into simmering liquid in skillet. Cook over medium heat, stirring constantly, until sauce thickens slightly. Arrange pork chops with sauce on warm platter. Sprinkle with chopped parsley.


text:
Important information regarding cookies and www.localenterprise.ie
By using this website, you consent to the use of cookies in accordance with the LEO Cookie Policy.
Get in Touch
Map Location
044 9338945
...Let's talk business
Gannon Eco wins Innovation Award at National Enterprise Awards, presented by Minister for Jobs, Enterprise and Innovation, Mr. Richard Bruton T.D.
Congratulations Gannon Eco
Dean Gammell, The Group System, Westmeath who won the Best Established Business Category in National Final 2014 says "Entering the IBYE Competition was the best business decision I have made to date. Not only was I supported with expert advice & guidance but it also allowed me to grow the business even faster through the Investment that I received. IBYE is an opportunity not to be missed by any young entrepreneur"
Vouchers can be used for - IT consultation; Development or upgrade of an e-commerce website; Implementing Online payments or booking systems; Purchase of Internet related software; Purchase of online advertising; Developing an app (or multiplatform webpages);
More Information..
Tech Entrepreneur from Westmeath Wins 'Best Established Business' at Ireland's Best Young Entrepreneur National Final
Dean - you did your County proud!!
Find Us
SMEs Online Guide to funding supports is now available
Click Here
The 2012 Action Plan for Jobs committed to delivering an enhanced, expanded and more integrated support service for micro and small business. As part of these reforms, new Local Enterprise Offices (LEOs) have been created within Local Authorities and the 35 existing County & City Enterprise Boards have been dissolved.
Local Enterprise Office Westmeath will build on the significant achievements of the Westmeath County Enterprise Board to date and will offer an expanded range of supports for your small business.
The Local Enterprise Office Westmeath serves as a 'first stop shop', providing entrepreneurs in Westmeath with advice on starting and growing a small business, high-quality business training and financial support.
Westmeath Business Wins Innovation Award at Ireland's National Enterprise Awards...
Gannon Eco wins Innovation Award at National Enterprise Awards, presented by Minister for Jobs, Enterprise and Innovation, Mr. Richard Bruton T.D.
June 2015 - Networking Opportunities & Business Events...
See details of five upcoming business events in Westmeath in June including the Midlands Industrial Expo and business networking events...
Midlands Industrial Expo –June 18th - Mullingar Park Hotel...
June 18th Mullingar - Midlands Industrial Expo - Serving Life Sciences & Engineering - A Unique Opportunity to meet Industry Decision Makers...
Westmeath Company Makes 'Final Eight' at National Enterprise Awards...
Kilbeggan based Gannon Eco make final eight of the Local Enterprise Office National Enterprise Awards Competition ...
We are looking for Ireland's best young entrepreneurs – IBYE Competition 2015 is launched...
Invitation to Tender for Irelands Best Young Entrepreneur (IBYE) Bootcamp...
Launch of SURE — StartUp Refund For Entrepreneurs!
Chaos to Control - Upcoming Women in Business Event...
Chaos to Control – Maximise Your Productivity – Ciara Conlon - June 30th, Athlone
Local Enterprise Office - Powerin Up Your Business Prospects...
Successful networking a recent Women in Business Event
Midlands Industrial Expo 2015
Women in Business May Networking Event...
May 7th Guest Speaker Caitlin O Connor
Nominations are now open for the Midlands Gateway Chamber's Best in Business Awards 2015...
RTÉ Ones 'The Taste of Success' is back and we are now looking for YOUR amazing food product ideas....
How to Access Public Sector Tenders/How to Write a Winning Tender...
Westmeath County Council's Business Incentive Scheme Launch...
County Wide Business Incentive Scheme to Encourage the Use of Vacant Commercial Premises
RSS Feed
See All News
Newsletter Archive
Find out more about Financial Assistance offered by the LEO...
Find out about upcoming events and training...
Download Information on Starting and Growing Your Business...
Are You Westmeath's Best Young Entrepreneur...
This page lists all LEO Client Opportunities....
SMEs Online Guide to funding supports is now available...
Start or Grow your Business
Training & Events
Financial Supports
Student Enterprise
Enterprise Development
Áras an ChontaeMount Street, Mullingar, Co. Westmeath Map Location


text:
Our company is buying some HP Procurve managed gigabit switches to replace some of our core switches. However, we aren't able to upgrade all of our switches from 100Mb to Gigabit switches. I think I know the answer but I'm not exactly sure. If we plug those 100Mb switches (or even a 100Mb device) into those Gigabit switches, will the performance of the entire switch drop to 100Mb or will just that one port work at 100Mb?
Take the 2-minute tour ×
Server Fault is a question and answer site for system and network administrators. It's 100% free, no registration required.
Just that port.
If you can avoid cascading switches, I'd strongly encourage it. The downsides are easily exampled with two people on the same cascaded switch copying a large file to a fileserver. Having a single user under normal usage being able to cause usage issues for multiple other users is obviously bad.
Implications are even worse with servers.


text:
Weston A. Price Foundation President Sally Fallon Morell offers a welcome message and overview of the foundation's principles.
I need a copy of the weston price dentition book to heal my teeth.please help me.u can reach me on +233273938919.am in ghana.
Pleas i need the weston A.price but i dont have money to but it.please give me one for free to help me heal my teeth.am in a shame situation now.please help me.
I just learned about The Weston A. Price Foundation this year at a country store in WI. I bought the "Nourishing Traditions" cookbook for my birthday in May. I just love reading it and am successfully making kombucha! I never even tasted it before this year. Thank you for helping me eat learn healthier ways to prepare food.
I am trying the Natural Yeast Bread on page 492 of the revised second edition. It says to save out one cup of starter for a new batch. What do I do with the one cup? Do I not need grape pulp for future batches?
Thank you!
LorRae Crubaugh
Soy de Colombia Suramerica. Me gustan los temas de salud.Para asi aprender mas de lo poco que se igualmente transmitircelos a mis amigos;familiares ETC,me podrian enviar mediante este medio de correo electronico algun material en formato PDF. Me gusta mucho leer y quisiera saber mas del fundador valga rebundancia del Dr. Weston A Price. de antemano los quiero felicitar a todos los miembros de esa dintinguida Fundacion y que el todo poderoso siempre los bendiga.
Cordial Saludo.
Atentamente :
Crlos Jacinto Salas Rojas
You guys are amazing!!!!!!! Thank you so much for giving people the information that they need to know!!!!!!!!!!
I am looking forward to becoming more nutritionally educated!
I am wondering why Sally Fallon Morell doesn't have any new video? I have seen all of her videoes several times and enjoyed them all. I like to see some new videoes on different subjects. Please work on it Sally. Thanks. John
Hello – I am hoping for a rebuttal to this recently published study:
Thank you
Is coconut oil inflammatory? I have a underactive thyroid and had rT3 and total T3 blood test done showing the conversion isn't happening. Was wondering if inflammation and digestion were the cause. Read that saturated fats cause inflammation. I use a lot of coconut oil. Tired of not being well and can't lose weight even with lche eating. Can you help?
Shocking email with weblink citing Harvard research linking even one egg a day to higher risk of diabetes 2. One study found that eating just a single egg a week increased the odds of diabetes by 76%. Two eggs a week doubled the odds, and an egg a day tripled the odds:
- It seems the jury is still out concerning the relationship of eating eggs to diabetes 2:
Data suggest that high levels of egg consumption (daily) are associated with an increased risk of type 2 diabetes in men and women. Confirmation of these findings in other populations is warranted.
– Eating eggs doesn't seem to up diabetes risk: http://www.reuters.com/article/2010/06/16/us-eggs-diabetes-idUSTRE65F6PH20100616
– There's good news and bad news about eggs: http://www.theglobeandmail.com/life/health-and-fitness/health/theres-good-news-and-bad-news-about-eggs/article12502116/
I'm enjoying Sally's books and making broth. I'd like to start adding chicken feet, heads to chicken stock pot, but my farmer says feet need to be skinned. Do you agree? She says her husband tried skinning them with a blow torch, but he doesn't recommend it.
© 2015 The Weston A. Price Foundation for Wise Traditions in Food, Farming, and the Healing Arts.


text:
In his weekly column last Wednesday, PN Publisher's former employer, (m)ad man Jerry Della Femina, reminded loyal readers about his birthday on July 22.
"I'm having a birthday next Monday," he wrote in Jerry's Ink as co-publisher of the The Independent, a regional weekly newspaper based in East Hampton, New York. "I don't like birthdays. But I guess they're necessary because it's God's way of telling you you're still alive."
The man of many memorable words went on with a witty rant about age, happiness in general with smart technology, and the specific way he is happiest celebrating his birthday. He wrote he will "find the biggest glass in the house, fill it to the top with McCallan Scotch and take it to bed, where I will ponder tomorrow, which, as the cliché goes, is naturally going to be the first day of the rest of my life."
What he failed to communicate when he wrote his column was the possibility that the royal baby could arrive on his birthday.
During the night, many of us Americans awakened to news flashes that the affectionately watched "Great Kate Wait" is coming to an end. The Duchess had gone into labor and shortly after 6AM in Paddington, she was admitted to St Mary's Hospital, accompanied by Prince William. Followers in Britain and the around the world have joined crowds in London outside Buckingham Palace and at the hospital to wait for the historic announcement from the Duchess of Cambridge and her husband.
Folks can find the news about the future king online.
Back in Naperville, I wonder if this creative man— known as the "Madman of Madison Avenue" in the early days of his boutique advertising agency, a name now often credited as being the inspiration for the popular award-winning television series, Mad Men—will address the shared birthday in his next column.
Coincidentally , in June, my Daily Herald column featured a photo of a Della Femina birthday cake, one of many special-occasion cakes I had baked for the wonderful folks at Della Femina, Travisano & Partners when I worked there in the 1970s.
Harry and Mary rhyme with Jerry
Today I'm imagining Kate and William could name a baby boy Harry, rhyming with Jerry. Or they could name a baby girl Mary.
One thing I know for certain. Whatever name Kate and William choose, their child will be named after Jerry Della Femina.
As my now 90-year-old dad used to jest to all of us youngsters, girl or boy, "Yes, you were named after Thomas Jefferson—because you weren't named before him."
Here's to a healthy and happy baby in Great Britain and to all newborns welcomed to the world on this day.
And with much appreciation, here are best wishes for another bunch of birthdays to Jerry Della Femina, a man of caring ways and thoughtful inspiration for many creative types that goes way beyond Mad Men.
—Stephanie Penick
Editor's Note: While royalties are on our mind… To further locally connect with the New York agency behind many ad campaigns, one of Della Femina, Travisano's most memorable campaigns comes with a jingle that everyone seems to know. Not only featured in commercials and in movies, the jingle has been making its rounds on the Wrigley Field organ this season. "Meow Meow Meow Meow… Meow Meow Meow Meow… Meow Meow Meow Meow… Meow Meow Meow!"
Royal baby boy is born!
At 2:33PM CT on July 22, a news release stated that an 8-pound, 6-ounce baby boy had been born at 4:24PM London time, four hours earlier after eight hours of labor. Proud parents are the Duchess of Cambridge and Prince William. News reports suggested the child will use Cambridge as his last name, but a first name was not announced at the time of birth.
George continues to be the top pick by the odds makers for the royal baby boy's first name. We're still pulling for Harry.


text:
nForce2 with MDK10.0
OK I have:
Epox 8RDA mobo(nForce2)
AMD Athlon XP 2000+
nVidia gForce4 MX 440
rest of it is irelevant for the probelm....
So i got a MDK Linux 10.0 official(4 cd) and i start the installation and it goes to partitioning stage and freezes but HDD seemes to be working constantly and sometimes it gets past this stage butt freezes while copying files and you know there is no pattern by which it blocks it just blocks randomly in the middle of copying files or on the partitioning stage so wat do i do?
And yeah i tried gentoo too but he freezes at the same stages...and to mention that konppix live works perfectly(i hate live editions)....so HELP PLEASE
Re: nForce2 with MDK10.0
I don't know about your problem but there are newer editions of MDK available (10.1 or LE2005). You can give them a try.
Mo X
|All times are GMT -5. The time now is 12:12 AM.
Powered by vBulletin® Version 3.7.1
Copyright ©2000 - 2015, Jelsoft Enterprises Ltd.
Copyright ©1998 - 2014, nV News.