1. A system for generating a determined yield for a blood component collected from donor blood by a blood collection system comprising
a donor monitoring system component programmed to provide predetermined information about the donor blood;
a collection monitoring system component programmed to provide predetermined information about the blood collection system;
a yield determination system component programmed to provide predicted blood component yield information from the predetermined information about the donor blood from the donor monitoring system component and the predetermined information about the blood collection system from the collection monitoring system component;
an off-line yield measurement system component programmed to provide an off-line measured yield value of the blood component;
a calibration factor generated by the system from said off-line measured yield value in relation to said predicted blood component yield information;
a microprocessor programmed to apply said calibration factor to said predicted blood component yield information to generate a predicted yield value.
2. The system of claim 1 wherein said yield determination system component comprises an on-line determination technique.
3. The system of claim 1 comprising
an on-line yield monitoring system component programmed to monitor yield generated by the blood collection system to provide monitor yield information;
a second calibration factor generated by the system from said on-line yield in relation to said off-line yield measurement system component;
the microprocessor programmed to apply said second calibration factor to the monitored blood component yield information to generate a monitored yield value.
4. The system of claim 3 wherein the system is programmed to use the monitored yield value to provide the determined yield.
5. The system of claim 4 wherein the system is programmed to use both the monitored yield value and the predicted yield value to provide the determined yield.
6. The system of claim 3 wherein the on-line yield monitoring system component comprises an optical detector system for the blood component.
7. The system of claim 1 wherein the donor monitoring system component is programmed to provide predetermined information based on donor specific physical data.
8. The system of claim 1 wherein the collection monitoring system component is programmed to provide predetermined information based on the apparatus and flow rates used for blood collection.
9. The system of claim 1 wherein the off-line yield measurement system component is programmed to provide an off-line measured yield value through off-line laboratory testing.
10. The system of claim 1 wherein the predicted yield value is used to provide the determined yield.
11. The system of claim 1 wherein the blood component is platelets.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of saving an interlocking trees data store from memory to permanent storage comprising the steps of:
traversing the interlocking trees data store to access each node
creating a node packet containing all information relevant to the node, and
writing the node packet to permanent storage.
2. The method of claim 1 wherein said saving of an interlocking trees data store from memory to permanent storage further comprises the step of: saving supporting structures to permanent storage.
3. The method of claim 2 wherein the step of saving supporting structures comprises saving any of the following list of structures needed to restore the interlocking trees data store to memory, wherein said list includes:
KStore name,
creation date,
versioncycle of Save program that created the save file,
OS underlying structure information including at least size of fields used information,
sign structure information if not saved below,
elemental root nodes or elemental root node values and pointers to the elemental root nodes’ levels and associated delimiters
meta data including one or more of the following field types:
user defined types,
column descriptions, and
permissions,
kState variables including one or more of the following:
switches,
data streams,
sign structure information for instance special ordering for asCase lists
data sources including one or more of the following:
types,
locations,
affiliated data streams)\u2014for learning new knowledge
security including one or more of the following:
administrator passwords
user passwords,
permissions,
saved query locations, and
triggers, and
XML-related meta data, if any.
4. A method of saving an interlocking trees data store from memory to permanent storage according to claim 2, wherein saving supporting structures comprises the steps of:
determining which informational structures will be saved with the interlocking trees data store, And,
formatting and writing said informational structures to permanent storage
5. A method of saving an interlocking trees data store from memory to permanent storage according to claim 1, wherein creating a node packet containing all information relevant to the node, comprises the steps of:
storing the node’s current load address in the packet
storing the Case and Result pointers, any other additional fields, the asCase list of pointers and the asResult list of pointers in the packet
writing the node packet to permanent storage.
6. The method of claim 5 wherein prior to storing any packets, memory is allocated for each packet to be stored.
7. A method of saving an interlocking trees data store from memory to permanent storage according to claim 1, wherein traversing the interlocking trees data store to access each node comprises the steps of:
traversing the interlocking trees data store to access each node starting from the primary root, using a typical tree traversal along the asCase paths
8. A method of saving an interlocking trees data store from memory to permanent storage according to claim 1, wherein traversing the interlocking trees data store to access each node comprises the steps of:
traversing the interlocking trees data store to access each node beginning from endproduct nodes.
9. The method of claim 8 wherein said traversing beginning from end product nodes begins after obtaining access to all end product nodes from a file of end product node information associated with said interlocking trees datastore.
10. A method of saving an interlocking trees data store from memory to permanent storage according to claim 1, wherein traversing the interlocking trees data store to access each node comprises the steps of:
traversing the interlocking trees data store to access each node from root nodes.
11. The method of claim 10 wherein said traversing beginning from said root nodes begins after obtaining access to all root nodes from a file of root node information associated with said interlocking trees datastore.
12. A method of restoring an interlocking trees data store from permanent storage to memory comprising the steps of:
Allocating memory and reading supporting structures required before the interlocking trees data store is restored, from permanent storage into memory
reading each node packet and allocating memory for nodes\u2014creating a translation table of old memory addresses & new memory addresses for each node
reading each node packet and reconstructing nodes and pointer lists
Allocating memory and reading supporting structures that require address translation using the translation table to be restored, from permanent storage into memory.
13. The method of claim 12 wherein said allocating memory and reading support structures step finds elemental root node packets and data from said elemental root nodes on a first pass, and then the remaining steps of claim 12 are executed.
14. A set of instructions executable on a computing system which when executed configure said system to provide the facility to save and restore a trees based datastore, said set of instructions comprising:
a save set having;
a first set to traverse the interlocking trees data store to access each node to be saved,
a second set to create a node packet containing all information relevant to the node to be saved, and
a third set to write the node to be saved as a packet created by the second set to permanent storage connected to said computing system.
15. A set of instructions executable on a computing system which when executed configure said system to provide the facility to save and restore a trees based datastore, said set of instructions comprising:
a restore set, having;
instructions to reconstruct metadata, and
an address translation table maintenance and using set for establishing an address translation table to convert addresses between addresses in saved packets and addresses in a restored interlocking trees datastore.
16. The set of instructions set forth in claim 15 further comprising:
a save set having;
a first set to traverse the interlocking trees data store to access each node,
a second set to create a node packet containing all information relevant to the node, and
a third set to write the node created by the second set to permanent storage connected to said computing system.
17. A computer system for running an interlocking trees datastore program so that an interlocking trees data store can function in a main memory of said computer system, said computer system having a program for saving said interlocking trees datastore and a program for restoring said interlocking trees datastore wherein addresses of said interlocking trees datastore and said restored interlocking trees datastore are not the same, said program for restoring said interlocking trees datastore having means to establish an address translation table to translate addresses found in node packets created by said save program to new addresses in said restored interlocking trees datastore.
18. A computer system having an interlocking trees datastore in a memory of said computer system and having a saving means for saving said interlocking trees datastore for later restoration, said saving means comprising:
means for locating and saving all relevant header information including metadata relevant to restoring said interlocking trees data store,
means for locating each node in said interlocking trees data store and
means for saving all data about each located node in a packet form.
19. The computer system of claim 18 wherein said means for saving discovers a saved size for said packet form of said all data about each located node.
20. The computer system of claim 19 wherein a total size of a saved interlocking trees datastore saved by said saving means is a function of said saved size for each said packet.
21. The computer system of claim 18 wherein said each packet contains pointer data pointing to addresses of other nodes of said interlocking trees data store that had been linked to the node from which said each packet is constructed in said means for saving.