CA2376140A1 - Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples - Google Patents

Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples Download PDF

Info

Publication number
CA2376140A1
CA2376140A1 CA002376140A CA2376140A CA2376140A1 CA 2376140 A1 CA2376140 A1 CA 2376140A1 CA 002376140 A CA002376140 A CA 002376140A CA 2376140 A CA2376140 A CA 2376140A CA 2376140 A1 CA2376140 A1 CA 2376140A1
Authority
CA
Canada
Prior art keywords
samples
characteristic
cells
matrix
computer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA002376140A
Other languages
French (fr)
Inventor
Thomas H. Barrett, Jr.
Corey D. Dehaven
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Monsanto Technology LLC
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of CA2376140A1 publication Critical patent/CA2376140A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0481Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance

Abstract

Data is collected about samples that possess characteristics that change over time and that are contained in an array of containers that are arranged in a container spatial relationship. A matrix of cells is displayed in a cell spatial relationship that corresponds to the container spatial relationship.
User input is accepted into at least one of the cells of the matrix that is displayed, to input at least one value of at least one of the characteristics that change over time for at least one of the samples that correspond to the at least one of the cells in the matrix that is displayed. The matrix user interface can allow a user to enter a large number of data points per minute, compared to conventional systems in which a user may need to swipe a bar code, enter an indicia or enter a row/column position for a sample prior to entering data. Data collection of the characteristics of samples also can be scheduled, by storing past values of the characteristics of the samples that were data collected during at least one past time interval in a database, and also storing rules in a rule base. The rules determine whether a characteristic of a sample is to be data collected and, if so, identify the characteristic which is to be data collected, based on the past values of characteristics of samples. The rules are applied to the past values that are stored in the database, to identify target samples to be data collected, and to identify at least one target characteristic to be data collected for the target samples that are identified.

Description

METHODS, SYSTEMS AND COMPUTER PROGRAM PRODUCTS
FOR DYNAMIC SCHEDULING AND MATRIX COLLECTING
OF DATA ABOUT SAMPLES
Field of the Invention This invention relates to database methods, systems and. computer program products, and more particularly to methods, systems and computer program products that are used for data collection and storage in a database.
Background of the Invention Data collection methods, systems and computer program products are widely used to collect data about a plurality of samples. Data collection methods, systems and computer program products also may be used to schedule times for collection of the data about the plurality of samples. The data that is collected may be stored in a database, and may be processed to attain useful results.
Data collection is widely used, for example, in conducting research with living orgaazisms, such as plants, animals (including human beings), prol~ayotes, fungi, protists, vimses and prions. In conducting such research, a large number of samples may be used, and data about characteristics of the samples may be collected at various times, to measure changes in characteristics of the samples over time.
A specific example of a plant research enviro~unent now will be described.
However, similar environments may be found in research enviroiunents for other organisms.

In a plant research environment, studies may be made as to gene fimction in plants, plant growth and maintenance, mutant generation and/or phenomic measurements over a large number of samples, by measuring characteristics of the samples that change over time. A large number of samples, up to hundreds of thousands or more samples, may undergo testing simultaneously. Plants may be studied as they grow in various media, such as in soil or other plates, in very large volumes and at locations that may be spread over different facilities.
It may be difficult to effectively collect data about these samples. In particular, it may be difficult to collect this data in a time-critical matter. Since plant research may measure growing systems that are evolving over time, it may be important to make these measurements at predetermined time intervals.
Moreover, because the data is being collected for living organisms, it may be difficult to determine in advance what characteristics are to be measured at what particular time.
Finally, many characteristics may need to be recorded, such as color, shape or other attributes of plants. Although some of these measurements may be automated, many of these measurements may need to be done by visual observation and recording, which may be time-consuming and en or-prone.
Figure 1 illustrates a conventional growth flat of samples, here plants. As shown, the growth flat includes a plurality of samples that are contained in an array of containers, here pots, that are arranged in a container spatial relationship, here four rows of eight columns. The plants possess characteristics that change over time. Data is collected at various points in time, concerning various characteristics of the plants.
As shown in Figure 1, each plant may be identified by a bar code or other indicium that is associated with the. corresponding container. Often, data is collected by looking down at the flat and determining a characteristic, such as whether a plant has started to produce buds, flowers, leaves, the color of leaves, the number of leaves, etc.
It will be understood that many other types of containers, such as nutrient plates, may be used in plant research. Moreover, in other organism research, other containers, such as test tubes, petri dishes and the like may be used.
However, these research efforts all may be characterized as including a plurality of samples that possess characteristics that change over time, the samples being contained in an array of containers that are arranged in a container spatial relationship.
Large numbers of arrays of containers may be stored in a hierarchical organization that includes, for example, buildings, rooms in a building, racks in a room, shelves in a rack, shelf positions in a shelf, flats in a shelf position, and pots in an auray in a flat. Thus, each flat may be identified uniquely by its unique position in the hierarchy. This hierarchy may be used to store data in a database system, such as an SQL*GT database system, marketed by Perkin-Elmer hic. In such a system, the building, room, rack, shelf and position may be modeled as locations, and may be referenced hierarchically to one another. The flat may be modeled as a two-dimensional container, which also may be referred to as a "plate" in the SQL*GT
system. The pots may be modeled as samples. It will be understood, however, that many other database systems may be used to store data about a plurality of samples that are contained in an array of containers, and that possess characteristics that change over time.
Accordingly, although the data that has been collected can be efficiently stored in a database, there still may be a need for methods, systems and computer program products that can allow efficient data collection and efficient scheduling of data collection.
Summary of the Invention Methods, systems and computer program products according to embodiments of the invention collect data about a plurality of samples that possess characteristics that change over time and that are contained in an array of containers that are arranged in a container spatial relationship. A matrix of cells is displayed in a cell spatial relationship that corresponds to the container spatial relationship.
User input is accepted into at least one of the cells of the matrix that is displayed, to input at least one value of at least one of the characteristics that change over time for at least one of the samples that correspond to the at least one of the cells in the matrix that is displayed. According to other embodiments, the at least one value of the at least one of the characteristics that change over time for the at least one of the specimens is stored in a database.
These embodiments of the invention can stem from a realization that data can be collected more efficiently by representing the array of containers as a similar matrix of cells on a display, so that visual observation or other data that is collected can be rapidly entered into the displayed matrix at the corresponding position. Thus, an individual sample need not be identified using a bar code or other indicia, or by identifying its row/column location in the array. The matrix user interface can allow a user to enter a large number of data points per minute, compared to conventional systems in which a user may need to swipe a bar code, enter an indicia or enter a row/column position for a sample prior to entering data.
According to other embodiments of the invention, prior to displaying the matrix of cells, user selection of an array of containers from a plurality of arrays of containers is accepted. In other embodiments, user selection of a characteristic from the characteristics that change over time also'is accepted. The matrix of cells that is displayed includes data entry parameters for the characteristic that was selected.
Thus, the matrix can be "data aware", and can display the data entry parameters for the characteristic that was selected. For example, a Yes/No selection, a data entry box for a value and/or a pull-down menu of selection options may be displayed for each cell of the matrix, depending 11p011 the characteristic that was selected for data collection. Moreover, user instnictions also may be displayed for obtaining the value of the characteristic that was selected.
According to other embodiments of the invention, user input into the cells of the matrix may be accepted by accepting user input of a default value of the characteristic for the cells of the matrix that is displayed, and accepting user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value. According to other embodiments, the default value for the cells of the matrix is stored in the database, except that the at least one value that is different from the default value is stored in the database for the cells that have a different value. These embodiments of the invention may stem from a realization that in data collection for an array of samples, it is often the case that most of the samples in an an ay all have the same value for a given characteristic; and only a few of the samples have a value that is different. For example, for a physical observation on a seedling color, two of the seedlings may be observed to be red, whereas all of the remaining seedlings may be observed to be green. By using these embodiments of the present invention, the two red seedling values can be entered rapidly and all of the remaining seedlings can have the default value, which is green in this case.
Efficient data entry may be obtained.
According to other embodiments of the invention, poor to the storing in the database, a user input may be accepted into at least one of the cells of the matrix that is displayed, of at least one coiTected value of at least one of the characteristics that change over time, for at least one of the samples. Accordingly, data may be corrected before it is committed to the database. In other embodiments, the data may be corrected after it is stored.
The above-described embodiments that display a matrix of cells and accept user input into the cells of the matrix may be used repeatedly to collect data for a plurality of matrices of cells that correspond to a ph~rality of arrays of containers.
Moreover, the displaying and accepting may be repeatedly performed to collect data for a plurality of characteristics that change over time. Moreover, the displaying and accepting may be repeatedly performed to collect data over a plurality of sequential time intervals. Accordingly, data collection may be performed efficiently.
It also may be desirable to provide efficient scheduling of data collection.
In particular, one purpose of collecting data about the plurality of samples may be to fmd changes in various samples that occur over time as a result of mutations, environmental factors and/or other factors. By definition, the time that these changes occur may be unlmown. Thus, in order to capture the changes as they occur, it rnay be necessary to collect data about all of the characteristics for all of the samples at all points in time.
In sharp contrast, embodiments of the invention can schedule data collection of characteristics of a plurality of samples, by storing past values of the characteristics of the samples that were data collected during at least one past time interval in a database, and also storing a plurality of rules in a rule base. The plurality of roles determine whether a characteristic of a sample is to be data collected and, if so, identify the characteristic which is to be data collected, based on the values of characteristics of samples. The plurality of rules is applied to the plurality of past values that are stored in the database, to identify target samples to be data collected fiom the plurality of samples, and to identify at least one target characteristic to be data collected for the target samples that are identified. User instructions are generated to collect data for the at least one tar get characteristic to be data collected in the target samples to be data collected. Accordingly, dynamic scheduling may be provided that can identify target samples to be data collected and target characteristics to be data collected in the identified samples based on past values of data that were collected. Data collection may be scheduled efficiently, and the amount of unnecessary data that is collected can be reduced and preferably can be minimized.
According to other embodiments of the invention, in response to the user instmctions that are generated, user input may be accepted of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected. The at least one target value of the at least one target characteristic to be data collected then may be stored in the database. The above-described applying the n ales to the past values, generating user instnictions, accepting user input and storing in the database may be repeatedly performed in sequence during a plurality of time intervals, to thereby obtain dynamic scheduling of data collection.
In one embodiment, the piles may include a vile that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples that have a value of the characteristic during a past time interval. Other piles can begin or terminate data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
Other rules can begin or terminate data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval. Yet other rules can begin or terminate data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time internal. Accordingly, population-based decisions may be used to determine, for example, when a growth stage occurs, so that minor variants in a given sample can be canceled out or averaged by the population.
Other roles, ranging from simple to complex, may be provided.
It will be understood that matrix collecting and dynamic scheduling embodiments of the present invention may be used separately to allow efficient data collection. However, matrix collecting and dynamic scheduling may be used together in embodiments of the invention that provide dynamic scheduling and use matrix collecting to allow efficient data collection of data that is scheduled by dynamic scheduling. In these embodiments, dynamic scheduling can allow only those characteristics for those samples that may be determinative to be collected and can allow the determinative characteristics and samples to be collected efficiently using matrix collecting.
Brief Description of the Drawings Figure 1 illustrates a conventional growth flat of plants.
Figure 2 is a block diagram of systems according to embodiments of the invention that can practice methods and/or include computer program products according to embodiments of the invention for matrix data collection and dynamic scheduling of data collection.
Figure 3 is a flowchart of operations for matrix data collection according to embodizxzents of the present invention.
Figure 4 is a flowchart of operations for matrix data collection according to other embodiments of the present invention.
Figure 5 is a flowchart of operations for accepting user input into a matrix according to embodiments of the present invention.
Figures 6-18 illustrate user interfaces that may be used for matrix data collection according to embodiments of the present invention.
Figure 19 is a block diagrarrz of matrix data collection according to other embodiments of the present invention.
Figures 20-26 illustrate additional user interfaces that may be used with matrix data collection according to embodiments of the present invention.
Figure 27 is a representation of a conventional data collection plan.
Figure 28 is a flowchart of operations that are performed for dynamic scheduling according to embodiments of the present invention.
Figure 29 illustrates application of dynamic scheduling according to eznbodiments of the present invention to the conventional data collection plan of Figure 27.
Figures 30-32 illustrate other applications of dynamic scheduling according to embodiments of the present invention.
Figure 33 illustrates an example of rules that are based on percentages for dynamic scheduling according to embodiments of the present invention.
Figures 34A and 348, which when placed together as shown form Figvme 34, is a flowchart illustrating dynamic scheduling according to other embodiments of the present invention.
Detailed Description of Preferred Embodi~ne~tts The present invention now is described more fully hereinafter with reference to the accompanying drawings, in which prefez-red embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be constnied as limited to the embodiments set forth herein.
Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those slcilled in the art.
Lilie numbers refer to like elements throughout the description of the drawings.
As also will be appreciated by one of skill in the art, the present invention may be embodied as methods, data processing systems, and/or computer program products. Accordingly, the present invention may talce the form of an entirely hardware embodiment, an entirely software embodiment conning on general propose hardware or an embodiment combining software and hardware aspects.
Furthermore, the present invention may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium. Any suitable computer readable medium may be utilized including hard disks, CD-ROMs, optical storage devices and/or magnetic storage devices.
Computer program code for carrying out operations of the present invention may be written in an object oriented programming language such as JAVA, Smalltalk or C++. The computer program code for carrying out operations of the present invention may also be written in a conventional procedural programming language, such as "C". Microsoft Active Server Pages (ASP) technology and Java Server Pages (JSP) technology may be utilized. Software embodiments of the present invention do not depend on implementation with a particular programming language.
The program code may execute entirely on one or more Web servers and/or application servers, or it may execute partly on one or more Web servers and/or application servers and partly on a remote computer (i.e., a user's Web client), or as a proxy server at an intermediate point in a network. In the latter scenario, the remote computer may be connected to the Web server through a LAN or a WAN (e.g., an intranet), or the connection may be made through the Internet (e.g., via an Internet Service Provider).
The present invention is described below with reference to bloclc diagram and flowchart illustrations of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks, can be implemented by computer program instructions. These computer program instnictions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instn.ictions, which execute via the processor of the computer or other progr ammable data processing apparatus, create strwctures for implementing the functions specified in the block diagram and/or flowchart block or blocks.
These computer program instnictions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instructions which implement the function specified in the block diagram and/or flowchart block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process or method such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the block diagram and/or flowchart block or blocks.
Some embodiments of the present invention may be practiced on a single data collection computer that can include matrix data collection and/or dynamic scheduling, as well as a database for storing the data and/or a rule base for storing rules. However, because other embodiments of the present invention may involve the use of multiple data collection terminals and storing of a large number of values/rules for a large number of samples, embodiments of the present invention may be implemented on a client-server system, wherein at least one client data collection terminal and at least one server computer are connected to one another.
Referring now to Figure 2, systems according to embodiments of the invention, that can practice methods and/or include computer program products according to embodiments of the invention, are schematically illustrated. As shown, a server system 200 and at least one data collection terminal 270 are comiected using a wire connection 282, a wireless comzection 284 and/or a network comlection 286 using a network 288, such as a local area network, wide area network and/or the Internet. The data collection terminals 270 may comprise laptop computers, personal computers or workstations, wireless terminals, personal digital assistants and/or custom data collection terminals, and may include a display, a user input interface such as a keyboard and/or a pointing device such as a mouse, and also may include one or more sensors or transducers for obtaining measurements of characteristics of samples. The data collection terminals 270 may be connected to the server continuously, intermittently when collecting data and/or intemnittently to download a schedule of data to be collected and to upload data collection results.
Still referring to Figure 2, the server 200 may be embodied in one or more personal, application and/or enterprise computers. The server 200 also can include an 5 input/output subsystem 260 that interfaces the server 200 and the data collection terminals 270.
Still referring to Figure 2, a database 2S0 can store the data that is collected and/or a data collection schedule in a mamzer that will be described in detail below.
As is known to those of slcill in the art, a database is a collection of data that can be 10 organized in tables and/or other conventional forms of organization. The database 2S0 may include a database manager and/or database server 230 that facilitates accessing, managing and updating data within the various tables of the database 250.
Exemplary types of databases 2S0 that can be used according to embodiments of the present invention include relational databases, distributed databases (databases that are disbursed or replicated among different points in a network), and object oriented databases. Relational, distributed and object oriented databases are well understood by those having shill in the art and need not be described further herein.
The database server 230 operates as a "middleman" server between other components of the server 200 and the database 250. The database server 230 generally includes program code and logic for retrieving data from the database 2S0 in response to external requests. Commercial database servers that may be utilized as a database server 230 in the server 200 include Microsoft's SQL server, IBM's DB2°
universal database server, and Oracle's SQL server nmning the SQL*LIMSTM
application marketed by Perlcin-Elmer Inc.
Still referring to Figure 2, the server 200 also contains a matrix data collector 210 that causes a matrix of cells to be displayed and accepts user input into at least one of the cells of the matrix, according to embodiments of the present invention. It will be understood that the matrix data collector 210 may be included in the data collection terminals 270 in other embodiments of the invention. Moreover, the matrix data collector 210 may be divided into a server poution in the server 200, and a client portion in the data collection teaminals 270.
Still referring to Figure 2, the server Z00 also includes a dynamic scheduler 220 that applies a plurality of rules in a mle set 240 to a plurality of values of characteristics that have been data collected and that have been stored in the database 250, to identify target samples to be data collected and to identify at least one target characteristic to be data collected for the target samples that are identified. The n Me set 240 may be stored in a mle base that is part of and/or separate from, the database 250. It also will be understood that although the dynamic scheduler 220 is shown as part of server Z00, it may also be embodied in the data collection teuminals 270 or may be embodied as a server portion in the server 200 and a client portion in the data collection terminals 270.
Finally, it will be understood that embodiments of the present invention may include the matrix data collector 210 without including the dynamic scheduler and the vile set 240. Such embodiments can collect data using a displayed matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship of the samples, without dynamically scheduling the data collection based on application of rules to values that are stored in a database. Moreover, other embodiments may include the dynamic scheduler 220 and the rule set 240, without including the matrix data collector 210. In these embodiments, scheduling of data collection may be performed dynamically by applying piles to values that are stored in the database 250, without using the matrix user interface for data collection.
Referring now to Figure 3, operations for matrix data collection according to embodiments of the invention, now will be described. It will be understood that these operations may be performed by the matrix data collector 210 of Figure 2.
Referring to Figure 3, these operations may be performed to collect data about a plurality of samples that are contained in an an ay of containers that are arranged in a container spatial relationship, such as the container spatial relationship of Figure 1, and that possess characteristics that change over time. At Bloclc 3I0, a matrix of cells is displayed in a cell spatial relationship that corresponds to the container spatial relationship. Figure 6 is an example of a matrix of cells in a cell spatial relationship that corresponds to the container relationship. As shown in Figure 6, an aiTay of four rows and eight columns of cells is displayed that corresponds to the an ay of four rows and eight columns of containers of Figure 1.
Referring again to Figure 3, at Bloclc 320, user input is accepted into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the characteristics that change over time, for at least one of the samples that corresponds to the at least one of the cells of the matrix that is displayed.
Thus, for example, referring again to Figure 6, each cell accepts a Yes/No user input as to whether the flower buds can be seen in the sample that is contained in the container of the array of containers at a position that corresponds to the position of the cell in the matrix. It will be understood, however, that although a Yes/No selection is illustrated, data entry boxes also may be used to obtain entry of alphanumeric data. Pull-down menus and/or other conventional means also may be used to allow selection from a plurality of choices. Moreover, user selection may be allowed to provide measuring of data using a transducer or other measuring device that is attached to, or is separate from, the data collection terminal 270 of Figure 2.
Matrix data collection according to embodiments of the present invention can allow massive amounts of physical observations and/or measurements to be entered into a database efficiently. By recognizing that the samples are arranged in arrays of containers and providing a user interface matrix that is consistent with this arrangement, efficient data collection may be obtained. A much greater data volume may be allowed, because the cost of data entry may be predominated by labor costs of data collection. The cost of the storage facility, soil and seeds may be relatively low.
By increasing and preferably maximizing the number of observations/measurements a user can enter, in a short period of time, the overall cost of the experimentation can be reduced.
Matrix data collection allows a graphical view of each sample that is in a container to be shown. It can graphically illustrate the array of containers and each sample in its position in the array. Rapid container-based database entry thereby may be obtained. In one example, a user can enter approximately fifty data points per minute. The graphical user interface is data aware, and it shows what type of data is desired for entry, such as Yes/No, text, numeric and/or a choice list.
Referring now to Figure 4, other embodiments of matrix data collection will be described. These operations may be performed by the matrix data collector 210 of Figure 2. As shown in Figure 4, at Bloclc 410, a user selection of an array of containers from the plurality of arrays of containers is accepted. Figure 7 illustrates a user interface that allows a user to select a container flat ID at the upper left. The container flat ID may be selected by scanning a bar code, by typing in a number and/or by performing a search through a hierarchy of flats.
Returning to Figure 4, at Block 420, a user selection of a characteristic from the characteristics that change over time, is accepted. The characteristics may be accepted in two stages. For example, as shown in Figure 8, a data collection operation to be performed on an array of containers is selected from a list of operations. The operations include a listing of days in the life of a sample.
As shown in Figure 8, some of the operations include an asterisk to the left, to indicate that all of the samples for that operation already have been data collected. Thus, the user can determine the due date and select the operation that is desired to be measured. Then, at Figure 9, a characteristic to be measured, also referred to herein as a "component", is selected from a list of characteristics or components.
Then, refernng back to Figure 4, user instructions for the data collection may be displayed at Block 430, and the matrix may be displayed at Bloclc 440. As was already described, Figure 6 illustrates an example of a matrix that is displayed. Under the heading "Component", the user instniction also is displayed. For example, "Can flower buds be seen?" is displayed.
Referring again to Block 450 of Figure 4, user input into the matrix then is accepted. For example, as was described above, user input may be accepted by allowing the user to click on Yes/No for each of the cells in the matrix of Figure 6.
As was described above, the matrix preferably is data aware. In other words, since the characteristic to be measured has been selected, the matrix can display the proper choice of text, numeric or selection parameters that need to be entered. Thus, for example, in Figure 6, a Yes/No selection of data entry parameters is displayed.
Figure 10 provides an example of a numeric input for lateral roots per seedling. In Figure 10, the status area at the bottom of the display also shows what the measurement units are for this particular component, because they COllld either be text or numeric. Thus, in Figure 10, a message is displayed to tell the user that this parameter is an item count. Figure 11 illustrates the use of a pull-down menu as a choice list for root color. Figure 12 is another example of a Yes/No parameter input.
RefeiTing now to Figure 5, additional details of accepting user input according to embodiments of the present invention will be described. These operations may correspond to Bloclc 450 of Figure 4. These embodiments allow the input of default values.
In particular, these embodiments stem from a realization that much of the data entry by container can be entered by exception. For example, if a plate is filled with seedlings, it may be clearly visible that one of the seedlings is red, whereas the rest of them are green. By allowing default values, this data can be entered efficiently.
Thus, a default value, such as green, can be applied. Then, the default can be oven~idden for the seedlings that are observed to be red. Alternatively, the non-default value, such as red, can be applied. Then, the default can be applied to all seedlings to which the non-default value has not been applied Refen-ing now to Figure 5, at Bloclc 510, a user input of the default value of the at least one of the characteristics for the cells in the matrix that is displayed, is accepted. Figure 13 illustrates the setting of a default value. In Figure 13, the characteristic is the observation of flower buds. Upon observation, it can be seen whether or not more samples have flowers buds. Upon observation that most of the plants do not have flower buds, the default value of No can be set in Figure 13.
Figure 14 illustrates that all of the cells of the matrix can been set to the default value of No. Then, referring to Figure 5, at Block 520, user input is accepted into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value. Thus, non-default values can be entered on an exception basis.
Finally, at Block 530, validation also may be provided to accept user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
It will be understood that validation may be performed in conjunction with or independent of the setting of default values.
Referring now to Figure 15, in one example, by double-clicking on one of the cells, a change result screen may be presented. The old value is presented, and a user input for a new value may be accepted. Figure 16 illustrates the input of a new value.
A change reason also may be input at Figure 17. Once the change is accepted, an asterisk may be provided to the right of the sample identification in the matrix, and the result is changed in the matrix, as shown in Figure 18. The change then may be committed to the database.
Referring now to Figure 19, a fimctional block diagram of other embodiments of a matrix data collector, for example a matrix data collector 210 of Figure 2, will be described. Figure 19 illustrates a relationship between the matrix 1910 and other components of an SQLrLIMS system marketed by Perlcin-Ehner hZC. As shown in Figure 19, the matrix 1910 interacts with LIMS tables 1920, which may be included in an Oracle database, and which may correspond to the database 250 of Figure 2, using For example an ADOT~~ connection, marlceted by Microsoft, Inc., to directly connect the matrix 1910 to the LIMS tables 1920. This connection may be used to send data 1912 to the matrix from the LIMS table 1920 in a read-only mode, so that the data in the LIMS tables is not corrupted. The matrix 1910 queries the tables, for example using an SQL query 1914, and returns the data 1912, displaying the peutinent 5 data to the user. The matrix 1910 also can write ARET~' (Perkin-Elmer, Inc.) files to a shared directory 1930 on a file system. The LIMS processes then can pick up the files from the shared directory 1930, and insert ARE files 1932 using an LIMS run-time module 1940, which can be a UNIX file. To make new records in the LIMS tables 1920, changed results can perform other database processes. It also will be 10 understood that ARE files need not be used to write data to the database.
Rather, data can be written directly into the database, and/or another text file format can be used.
Embodiments of the invention that were illustrated in Figure 19 can be used to monitor the status of the ARE files 1932. ARE can return status messages if there are problems with the upload. For example, Figure 20 illustrates a situation where a 15 container ID has been entered, an operation has been selected, a component has been selected, the data has been entered for that component for each sample and a commit button has been pressed to go to the database 1920. In Figure 21, at the bottom left, in the upload status area, the traffic light has been tamed from green (bottom light) to yellow (middle light), meaning that the ARE data 1932 is being processed. The name of the file also is shown. Then, in Figure 22, once ARE has completed processing the file, the traffic light turns to green (bottom light) again, meaning the file was uploaded successfully.
In contrast, Figure 23 illustrates the detection of en ors that come back from ARE. W one case, there may be a complete error with the file. For example, something may be malfimctioning and an upload was not performed. A red "X" may be presented, so that the user can determine that an error has occurred. When the user sees the "X", the user can double-click on the control, and it will bring up a log file that was generated, that came back from ARE. An example is illustrated in Figure 24.
In Figure 24, the component required an alpha and a numeric, whereas a numeric and an alpha was entered. Alternatively, as shown in Figiue 25, the data may be uploaded to the LIMS tables 1920, but there may be a problem with the data. W this case, a yellow caution symbol "!" was provided, and the user can click on the caution symbol and see the cause of the results, for example as shown in Figure 26.

A detailed description of dynamic scheduling according to embodiments of the present invention now will be provided. However, prior to describing dynamic scheduling, a description of the desirability of dynamic scheduling in phenotypic analysis of plants will be provided.
As is well known to those having shill in the art, phenotypic analysis refers to characterizing a living system by its physical characteristics. In phenotypic analysis of plants, r epeated observations are made on living plants. For example, the observations may include the color of leaves, root length, number of leaves, and the appearance of buds, seeds and root hair. These observations are made repetitively over time.
Moreover, destmctive testing also may be performed at various points in time.
Thus, a plant may meet a certain growth stage in its life cycle, at which point destnictive testing may be performed to determine, for example, the dry weight of the leaves or the number of seeds in its leaf. This destmctive testing is only performed once, because the plant is killed.
Finally, phenotypic measurements of plants also may be interested in growth stage determination. More specifically, plants generally follow a predictable Iife cycle of seed, sprout, root breaks through the soil, bud development, bud opening, etc.
The occurrence of these points may be important in determining unusual growth patterns, so that certain measurements may be made based on these growth stages.
Finally, population-based decisions may need to be performed to try to determine when a growth stage occurs, so that minor variants in a given plant can be canceled Ollt or averaged out by the population.
Figure 27 is a simplified representation of a data collection plan that might be applied to a plant. As shown, a particular data collection A is started at Day 2, and collected daily through Day 8. The data collection A may be a test data collection such as color or texture. Other tests start and stop at predictable times.
Moreover, there may be a battery of extensive tests that are desired at certain points in the growth stage, for example as represented by tests E, F and G at Day 3, and by tests H
and I at Day 7.
Static data collection as described in Figure 27 may be acceptable if only stable wild-type plants were being data collected. However, phenotypic studies in plants typically study unpredictable mutations in plants, to determine how these mutations change the phenotype. Accordingly, the data collection plan may be dynamically adjusted based on the growth pattern of particular mutant plants.
For example, refernng back to Figure 27, it may be desirable to extend the test C
past Day 4, and it may have been desirable to perform the test D earlier, due to the appearance of an earlier characteristic. Finally, it also may have been desirable to perform the block of tests at Day 3 and Day 7 earlier or later, depending on the characteristics that were observed.
Referring now to Figure 28, operations that may be performed for dynamic scheduling according to embodiments of the invention now will be described.
These operations may be performed by the dynamic scheduler 220 of Figure 2. These operations may be used to schedule data collection of characteristics of a plurality of samples, wherein values of the characteristics change over time.
Referring now to Figure 28, at Bloclc 2810, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval is stored in a database, such as the database 250 of Figure 2. At Block 2820, a plurality of n ales, such as the rile set 240 of Figi.~re 2, are generated and stored, for example, in a rile base. The piles determine whether a characteristic of a sample is to be data collected and, if so, identify the characteristic which is to be data collected, based on values of characteristics of samples. It will be understood by those having skill in the art that the operations of Bloclcs 2810 and 2820 may be reversed in sequence and/or may overlap.
Still referring to Figure 28, at Block 2830, the plurality of roles are applied to the plurality of past values that are stored in the role base, to identify target samples to be data collected from the plurality of samples, and to identify at least one target characteristic to be data collected for the target samples that are identified. Then, at Block 2840, user instnictions are generated to collected data for the at least one target characteristic to be data collected in the target samples to be data collected. The user instructions may be in the form of a matrix, as was described in detail above.
However, other forms of user instructions that do not employ a matrix also may be generated.
Still referring to Figure 28, at Block 2850, user input of at least one value of the at least one target characteristic to be data collected is accepted. The user input may use a matrix as described above, or may use other user input techniques.
At Block 2860, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected is stored in the database.

Finally, at Block 2870, if additional characteristics are to be measured, then the applying, generating, accepting and storing at Blocks 2830-2860 are repeatedly performed during a plurality of time intervals.
Accordingly, dynamic scheduling according to embodiments of the present invention can take the data that has been obtained and apply rules to the data, to thereby derive unique data requirements that respond to the data that was obtained.
Dynamic scheduling can provide a variable identification of a target characteristic which is to be data collected. This variable identification of a target characteristic which is to be data collected also is referred to herein as a "variable components list".
Instead of a static measurement plan that always aslcs the same question, dynamic scheduling can change a target characteristic list from sample to sample, in any particular data collecting operation.
Figure 29 schematically illustrates an application of dynamic scheduling to the data of Figure 27. In Figure 29, the characteristic C is data collected for at least one additional day, Day 5. The characteristic D is data collected earlier, at least at Day 4.
The characteristics E, F and G are data collected earlier, and the characteristics H and I are data collected later. These changes may be generated based on the application of the stored rules to the past values that were obtained.
Figure 30 illustrates a particular example of extinguishing data collection of a characteristic. In particular, some types of data collection do not apply to a plant past a certain point. For example, a characteristic may be, "Has a plant developed buds?".
The result is No on Day 3, No on Day 4, No on Day 5 and Yes on Day 6. There is then no need to data collect that characteristic for that particular plant on Day 7 or Day 8, as that would be unnecessary data collection.
Figure 31 illustrates another example of dynamic scheduling, wherein a data collection of a target characteristic is started. There are some characteristics that cannot logically occur before other characteristics occl~r. For example, if the characteristic is how many flowers are on a bud, then the bud will have to be open first. There is no point in data collecting these characteristics until it is logical for these characteristics to be relevant. Thus, in Figure 31, characteristic S is data collected for the first time on Day 6, when it has been determined that a particular characteristic is sensible to be data collected, based on the characteristic implied by the value of A.

Figure 32 illustrates starting an independent method based on the past value of the characteristic that was stored earlier. In particular, it may be desirable to perform rather complex data collection where a "spur" data collection may begin based on occurrence of an event. For example, once a plant has budded, it may be desirable to S perform a number of data collections of characteristics that are now on their own pathway and independent of the core data collection that is being made on the plant.
Thus, as shown in Figure 32, on Day 3, a critical growth stage was determined for characteristic A, and starts independent data collections E, F, G, H and I
based on the data collection at Day 3.
Since large numbers of samples generally are being measured, the rules may be based on a percentage of the samples having a past value of a characteristic during a past time internal. For example, a vile may be included that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of that characteristic or of another characteristic during a past time 1 S internal. Alternatively, data collection of the characteristic may begin or terminate based on a percentage of the samples failing to have that characteristic or another characteristic during a past time interval. Moreover, all of the samples need not be included in the percentage determination. For example, the sample may be contained in an array of samples, such as a flat. The rules can include a pile that begins or tern~inates data collection of a characteristic based on a percentage of the samples in the array that contains the sample in question, either including or failing to include that characteristic or another characteristic during a past time interval.
Figure 33 graphically illustrates an example of piles that are based on percentages. In Figure 33, the characteristics are referred to as "components". As 2S shown in Figure 33, on Day l, three components are tested. The results are entered into the database once the task is complete. The n Mes shown in Figure 33 then are applied to data that was entered as a result of the taslc. As shown in Figure 33, one mle is when SO% of the samples for a component 1 are greater than or equal to n, then component S is activated and component 1 is deactivated. The second mle is that when SO% of the samples of component 2 equal a value, then component 2 is deactivated. The third pile is when 75% of the samples for component S, is greater than a particular value, then some components are activated and others are deactivated.

As shown in Figure 33, on Day 1 there are three components, and their values are evaluated. On Day 2, there is a new component list that the user will data collect as a result of dynamic scheduling. Similar operations are performed at the end of Day 2 relative to components 2, 3, 4 and 5, so that on Day 3, components 2, 3, 4 and 5 are 5 again data collected. Similarly, on Day 4, components 2, 3, 4 and 5 are data collected, and on Day 5, components 6, 7 and 8 are data collected based on application of the rules to the newly entered data.
Other embodiments of dynamic scheduling according to the present invention now will be described. These embodiments of dynamic scheduling may include using 10 a rule set that includes the fields that are shown in Table 1. Table 1 consists of 4 rows and 20 columns, and spans 8 pages.

-E

Q , l .

. a a a a i O T

O

.

' V~

D .

~ N N

I t J O ~ O

O ~ O
. I O

. ~ r' T

W

O O O

I _ ~-O O . O

. r T Y

O

O O

T T

t . r1 T

I

~ .

I

\
/I

U .

U

D

r o to N N

U

Z

u~

Z

a w I

U o o so U o D o .

.

. I o .
o o O
I

Z T ~- _ 1 a r T' ~ ~ N

I

O
Oi .

D I O O

of O

IIo .

U I ' o o o; o U r- .
T.

. y I

J~

~

> z W _O O
JI

w ~ Z a.
' ' Q
i w z , w .

Z

a ~ -w x' ~l . -.

w z i z -z z w ~I .

. , wi of y~ - ~-I z -z I

i z w z z z W

_ .

' ~ ~ ~

. N

y C~ C~

J J

.. ~

~ ' .

~

D , ~

~

n a W W

U

J

J J

~ 0 .

.
D

E- ~l . m .

~ a Q

~ I I
I _ _ , _, "
, , , L L L

II II II
I I I

~ _~ _~

W ~

Z Z

_ _~ ~ , I
L

I
i _~I
~I

_ ~

~

n C ._C O ~ O

? >

,l I
a~ ~

_rt r .r. ~O -O, X r,. :D n X ~ ~ .~ X
- ~ L ~
' cn a L .. I ~ :o I ~I ~ I c>3 ~ 'o ., > ~ I
fin -o o 'gi ~
I

-a ~ -~ ~
. - L
n I W cn crs O
~ n .
H
~ I uJ ~cn L N . ~
;= a~ ~ C~ ~' ~ E m ~ (~ .'~ I= - '~ -a U ~ U - Lu u~ ~

pJ UI~z~ ~
COn ;_ ~-I x-001 ~~.

' V) '~ (~ ~ ~ '~- B
i~I O L LI -I LLI N
m '~ (~ ~ T L1. .~.~., U~
N ~

~ U ~ vi ~ U
n y Q n ~
~

a U n _ a ~ ~
II -n tI
>--z _ z_ a ~ ~
~ -~ a~ - ~ ~ -~-' ~
>- L
..

_ I- N -a ~ I I= ., p ~ II O -h- N ;a Q I II I II II II O
~I

_ Cn Q ~ C I6 Cn N II 11 O
_ ~ L 'O O
C O > ~
n ~ ~, ~ O L

_ ~ ' ~'I - ~ a~
I ~ '~ ~

>

~ ~ ~ _v_~ m .p - ~ ~ ~ o .; ~ ~I ~ ,cn ~I I N c>3 ~ ~ ~ ~ I
~ ' ~ ~ ~ ~.
~ a ' J~ I c~ ~ I c~ ~
~ ~ ~I
I ~ s=
- ~ ~ tn ~ ~ ~ Q i=
>_ ~ O
~ ~
~ O

~ X N X
~n O . .
N L ~ .,.J
O ~ O .
~ ~ ~ ca O
m Cno c~ .
V ~ U cn ~ U ~ ~ U O O , ~? cn U O' ~? t4 ~ U
C U '~ ~
~

I~ ~ ~ L L L L. ~ ~ V~ L L L L L L L
L L ~
~

z z z z aJ~=zzzzz J~=zzzzz aQQ
~,, aaaaa a aaaa u,,~ a a a J~=
u,,~~

~~ ~
.

>L

o - _ _o L

O ~ O

O

O ~ ..
~ O

_ _ O

_ t- _L I
~ 'Q /~ X
~

I ._r? L
N ~
L
I

N
- _ ~
O

_ _ ~ L I
I u ' Ia E- L

. N .
y II ~
v, ~ ~
~ ~ ~

I Q
v~ ~I~Q~ J-o W II
~ ~I~a~.J-' ~
~

O ~ ~ ~
N ~ ~ = ~ O
~ ~

n ~ U cn U N N n u~
II ~ I
U

z_ ~ n a ~_ z ~ n it ~
~ ~ c ~

C~ !- a~ '~ Q t II I- _a~ ~ y o u! a ~ I ~
~
.
I
~
~

;n Q-I . ( o ~
' I
~
~
~ .
. ~
I
.

~ CTS fl- ~
~ fn fn o ~ I =

l? - , ~ I
o l ~
a ~

U c o,~
n ~. v .N ,-~
E ~ ;_ tB L ~ O
cn U~ u?~n.v~~ UcL

I I- II) L L L CI) ~ W I/) S_ L L V) a i ~=QQaQ.~ ~~=zzzz y I I ~~-~QQQav - ~

,_ ~ I

.

a~
L
L

I

_4-~

L

Z

I

n L

.i.., ;O L I Q. (B

a. ~ I W .Cn N E- .

~ .C/) ~
o Ll.l ~
Q
I
z Q O

m ~
~
.
J

"''' ill N O

~ ~
N

U .~ ~ II ~n II

ZNn ~~-~j-- ~

f- ~ .- Q -1 n I

.'_'I.o ~ ~ L
O ~ ~

I
O _ ~I
E

tn~..QX
O.

I

-y o J~=zzzzz QQQQ

I
' i L
I L

L

I

I

p .

L

_ ~ a ~

_O L
I L1 (p _ CL.~ ~I ~ ~~

a O J
I

V7 .
E Q -Q
~ LL!

L
cn p ~

U ~ ~ - a u, n z_~n J I- N 'B

Q
.

~~
~,~~
>

~ v~ ~
E y p o .
.n 'U- ~ v? c~ ti L
CO L L L

p J ~ = z z z z ~~~QQQa D ~ . m ~.r~

m a ~

z U

u~

D_ The fields are defined as shown in Table 2:
Table 2 Field Function Comments Dcc id Unique record identifier.NUMBER{10) Relates to NOT

pgi dcc detail. NULL

Parent dcc Specifies that a specificNUMBER(10) Id dcc id must have occurred before the current one is evaluated.

Sequence The order in which NUMBER(3) rules are evaluated NOT NULL

Dec VersionVersion of the set NUMBER{3) of rules. NOT NULL

Status Can be CURRENT or VARCHAR2(10) MODIFIED, NOT

specifies which is NULL
the current set of rules that will be applied to new data.

Study id Study in which to NUMBER(10) do the evaluation NOT
on.

NULL

Result planResult plan to use NUMBER(10) id when creating NOT

components. NULL

Condition Rule identifier. ThisVARCI-lAR2(20) will be inserted NOT
as a parameter either on NULL
the sample or the submission when the rule evaluates to true.

Action Can be A for activateVARCHAR2( or R for reject. I ) Exit when Stop evaluating any VARCI-IAR2(1 true more rules if the ) current rule is true.

Hide-parameterHide the created parameterVARCI-IAR2(I
from the user ) if the cttment rule is true.

Run once Only evaluate the VARCHAR2(1 rule until it is ) true.

Maxtash Maximum sequence of NUMBER(3) sequence the task allowed b efore a rule is forced to be true.

Scope levelCan be SAMPLE or SUBMISSION.VARCI-IAR2(10) D etermines whether or not to base the evaluation on a population or each sample individually.

Method Limits the rule evaluationVARCHAR2(100) only to those tasks with the same methods as the calling task.

Start sql SQL statement to countVARCI-IAR2(2000) the number of samples that pass criteria. For SAMPLE

level, the result is either 1 or 0.

Start-scopeSQL statement to countVARCHAR2(2000) sql the number of samples for the criteria that is being evaluated in Start s 1.

Stop~sql Same as Start sql VARCI-IAR2(2000) but will stop the activation of new components when evaluated to true.

Stop scope SQL statement to countVARCHAR2(2000) sql the number of samples for the criteria that is being evaluated in Sto sql.

Percentage The percentage of NUMBER(3) required the population required to activate the creation of components.

Only applies to those being evaluated at the submission level.

Figures 34A and 34B, which when placed together as shown form Figure 34, is a flowchart of operations that may be performed for dynamic scheduling according to embodiments of the present invention, using the rule set of Table 1.
Refe;Ting now to Figure 34, if a task condition is valid at Bloclc 3402, a test is made at Blocl{ 3404 as to whether there are any rules remaining. More particularly, the rules are applied sequentially to the data values that are stored in the database, until no more rules remain, at Block 3404. At Bloclc 3406, a test is made as to whether the rule already has been applied. If yes, a test is made at Block 3408 as to whether the n Me is to be run only once and, if so, at Bloclc 3410, the next ntle is obtained. If the vile is not to be mn only once at Block 3408, but a stop condition exists at Bloclc 3416, then the 5 values are retrieved and evaluated for the mle at Block 3422.
Referring again to Bloclc 3406, if the vile has not yet been evaluated, then a test is made at Block 3414 as to whether a parent rule is used. If yes, then a test is made at Block 3418 as to whether the parent rule already has been applied. If not, then the parent mle is obtained at Block 3442. If yes, then at BIocIc 3422, the values 10 are retrieved from the database and evaluated at Block 3422.
At Bloclc 3424, a test is made as to whether the number of samples that has passed the start criteria is greater than 0. If not, then the next vile is obtained at Block 3442. If yes, a test is made at Block 3426 as to whether the past percentage is greater than the past percentage required by the vile. If yes, then a test is made at Block 3428 15 as to whether the number of samples that has passed stop criteria is greater than 0. If yes, then at Bloclc 3432, a test is made as to whether a past percentage is required, and if yes, the next rule is obtained at Bloclc 3442.
If the results of the tests at Blocks 3416, 3428 or 3432 is no, then at Block 3434, the new results are inserted and at Block 3436, it is recorded that the vile has 20 been applied. The next nMe is obtained at Bloclc 3410, and operations continue until there are no rules remaining at Bloclc 3404. Table 3 illustrates operations that may be used to insert the new results (Block 3434).
Table 3 Field Function Structure Dcc id Related to pgi NUMBER(10) NOT
dcc NULL

Due daysNumber of due NUMBER(3) NOT
days before NULL
the task on the new component is due. Can be-1 to create the component on the next due task or it can be < -900 to make the task due a certain number of days From the sow date.

Com orientCom orient to VARCI-IAR2(40) create.

OperationThe operation VARCI-IAR2(40) to create the component on.

Method The method to VARCI-IAR2(40) create the component on.

Sample The sample type VARCI-IARZ(100) type to limit the creation of new components to.

Table 4 is a listing of modules that can be used to embody the operations of Figure 34.
Table 4 Procedure/FunctionFunction ParametersReturns Name Create result Creates an empty Task ID Success - result. 0 Component Failure-1 Name Result Problem Plan ID 100003 -New Sequence100013 New Due Date Create_schedule Does the full evaluationTask ID None of a submission. Optional Mode Schedule sample Same as create scheduleTask ID None by_sample for one sam 1e only.

Process componentsProcesses all of DCC ID Success the components 0 to activate for a ruleSubmissionFailure-I
on the sample or ID

within the submission.Sample ID

Sequence Action Evaluate_conditionEvaluates the rule DCC ID Failure-I
and determines whether or not it SubmissionPassed 0 has passed. ID

Sample Stop Condition ID is Task ID true 2 Sequence Did not pass 1 Make result'statusMakes a status requestResult Success request t the status ID 0 monitor. Result Failure-1 Version Create-parameterCreates a parameterID Success on the sample or 0 on the submission. Class Failure-1 Prompt Response Hide Reject sample Rejects all future Sample None tasks for a sample.ID

S equence Write to debug Writes a message Status None to the debug table.

M essage Table 5 provides a detailed example of an implementation of Rule 1000000634 of Table 1. This n.Ile tests to see if the previous tl'Iree data collections exhibited less than a 20% increase in stem length.
Table 5 Field Settin STATUS CURRENT

ID

ACTION A

EXIT WHEN TRUE N

HIDE PARAMETER N

RUN ONCE Y

SCOPE LEVEL SIiBMISSION

METHOD ARf\BIDOP 97 SOIL CORE/ARABIDOP 97 SOIL GROWTH
STAGES/

START SQL select count(s.sample id) from nais_results r3, naffs tasks t3, naffs samples s where r3.submission id = aubmission_id and r3.component ='Stem length (base to top unopened buds)' and r3.tas1<_id = t3.task_id and t3.sequence = aequence and r3.sample id = s.sample id and s.sample type ='ORANGE CONTROL' and not Exists(select * from naffs parameters where prompt='NO SEED OR DEATH' and id =

s.sample id) and r3.result version = (SELECT Max(result,version) FROM naffs results WHERE result id =

r3.result id) and exists(select'x' from nai_results r2, nai_tasks t2 where r2.component='Stem length (base to top unopened buds)' and r2.task_id = t2.task_id and t2.sequence = aequence - 2 and t3.sample id = t2.sample id and r2.result version = (SELECT Max(result version) FROM nais_results WHERE

result id = r2.result id) and nvl(r3.number value, O) < 1.2 'fi nvl(r2.numbet_value, 0) and exists(select'x' from nai_results r1, nai_tasks t1 where r1 .component ='Stem length (base to top unopened buds)' and rl.task_id=tl.task_id and tl.sequence = aequence - 4 and tl.sample id = t2.sample id and rl.result version = (SELECT Max(result version) FROM naffs results WHERE

result id = rl.result-id) and nvl(r2.number value, 0) < 1.2 * nvl(rl.number value, 0))) START SCOPE select count(s.sample id) SQL

f rom nais_results r3, nais_tasks t3, nais_samples s where r3.submission_id = aubmission_id and r3.component='Stem length (base to top unopened buds)' and r3.task_id = t3.task_id and t3.sequence = aequence and r3.sample id = s.sample id and s.sample type ='ORANGE CONTROL' and not Exists(select * from naffs-parameters where prompt ='NO SEED OR DEATH' and id =

s.sample id) and r3.result-version = (SELECT Max(result version) FROM naffs results WHERE result id =

r3.result id) and exists(select'x' from nai results r2, nai_tasks t2 where r2.component ='Stem length (base to top unopened buds)' and r2.task_id = t2.task_id and t2.sequence = aequence - 2 and t3.sample id = t2.sample id and r2.result version = (SELECT Max(result version) FROM naffs results WHERE

result id = r2.result id) and nvl(r3.number_value, 0) < 1.2 * nvl(r2.numbet_value, 0) and exists(select'x' from nai_results r1, nai_tasks t1 where rl.component='Stem length (base to top unopened buds)' and rl.task_id = tl.task_id and tl.sequence= aequence-4 and tl.sample id = t2.sample id and rl.result version = (SELECT Max(result version) PROM naffs results WHERE

result_id=rl.result id) and nvl(r2.number value, Oj < 1.2 '' nvl(rl.number value, 0))) STOP SQL Null STOP SCOPE Null SQL

PERCENTAGE_ 100 REQUIRED

Table 6 provides a detailed example of an implementation of Rule 1000000605 of Table 1. This Imle tests to see if 50% of the population has answered "Yes" to the characteristic "Can flower buds be seen?".

Table 6 Field Setting STATUS CURRENT

STUDY_ID 100010269 ACTION A

EXIT WHEN TRUE N

FADE PARAMETER N

RUN_ONCE Y

SCOPE LEVEL SUBMISSION

STAGES/

START SQL SELECT Count(DISTINCT s.sample id) F ROM naffs samples s, nais_results r WHERE r.sample id = s.sample id AND s.sample_type ='ORANGE' AND r.submission_id = submission id -AND r.text_value='Y' AND r.component ='Can flower buds be seen?' AND r.result version = (SELECT Max(result version) FROM naffs results WHERE

result_id = r.result id) AND Not Exists(select * from nais~parameters where prompt ='NO SEED OR DEATH' and id = s.sam 1e id) START SCOPE SQL SELECT Count(DISTINCT s.sample idj F ROM naffs samples s, naffs, results r WHERE r.sample_id = s.sample id AND s.sample type ='ORANGE' AND r.submission id = aubmission_id AND r.component ='Can flower buds be seen?' AND r.result version = (SELECT Max(result version) FROM naffs results WHERE

result id = r.result_id) AND Not Exists(select * from nail-parameters where prompt ='NO SEED OR DEATH' and id = s.sample id) STOP SQL Null STOP SCOPE SQL Null Accordingly, dynamic scheduling can reduce and preferably minimize the collection of irrelevant characteristics and can also anticipate the need to collect new characteristics. The user need not make a determination as to irrelevance and/or the need for new characteristics, but rather can merely talce the measurements that are instnicted by the dynamic scheduling.
As was described above, dynamic scheduling may be particularly useful when used in conjunction with matrix data collection according to embodiments of the present invention, because the matrix can filter out characteristics. The matrix can be used to filter out characteristics so the user need not see characteristics that the user does not need to data collect. Moreover, on a given day, the user may enter vahles for paL-ticular characteristics that may trigger new data collection on the same day, so that new characteustics may be activated on the same day rather than waiting until the next day. By activating characteristics when a task has been completed, a task can be reactivated. When the user sees that the task is reactivated, for example by seeing that the asterisk has disappeared for the characteristic, then the user can lalow that more data should be collected.
In the drawings and specification, there have been disclosed typical preferred embodiments of the invention and, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation, the scope of the invention being set forth in the following claims.

Claims (108)

What is Claimed is:
1. A method of collecting data about a plurality of samples that possess characteristics that change over time, the samples being contained in an array of containers that are arranged in a container spatial relationship, the method comprising:
displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and accepting user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
2. A method according to Claim 1 wherein the accepting is followed by:
storing in a database, the at least one value of the at least one of the characteristics that change over time for the at least one of the samples.
3. A method according to Claim 1 wherein the array of containers includes a plurality of rows and columns of containers in a container spatial relationship and wherein the matrix of cells includes a corresponding plurality of rows and columns of cells in a cell spatial relationship that corresponds to the container spatial relationship.
4. A method according to Claim 1 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the displaying is preceded by:
accepting user selection of an array of containers from the plurality of arrays of containers.
5. A method according to Claim 1 wherein the displaying is preceded by:
accepting user selection of a characteristic from the characteristics that change over time; and wherein the displaying comprises displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the characteristic that was selected.
6. A method according to Claim 5 wherein the data entry parameters comprise at least one of a yes/no selection, a data entry box and a pull down menu of selection options.
7. A method according to Claim 5 wherein the accepting user selection of a characteristic is followed by displaying user instructions for obtaining a value of the characteristic that was selected.
8. A method according to Claim 1:
wherein the accepting user input comprises accepting user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and accepting user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
9. A method according to Claim 2:
wherein the accepting user input comprises accepting user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and accepting user input into at least one of the cells of the matrix that is displayed of at least one value that is different from the default value; and wherein the storing comprises stoning in the database, the default value for the cells of the matrix except for the at least one of the cells in which the at least one value that is different from the default value was accepted, and storing in the database, the at least one value for the at least one of the cells.
10. A method according to Claim 2 wherein the following is performed between the accepting and the storing:
accepting user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
11. A method according to Claim 1 wherein the displaying and accepting are repeatedly performed to collect data for a plurality of matrices of cells that correspond to a plurality of arrays of containers.
12. A method according to Claim 1 wherein the displaying and accepting are repeatedly performed to collect data for a plurality of the characteristics that change over time.
13. A method according to Claim 1 wherein the displaying and accepting are repeatedly performed to collect data over a plurality of sequential time intervals.
14. A method according to Claim 1 wherein the displaying is preceded by:
storing in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
storing in a rule base, a plurality of roles that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
applying the plurality of rules to the plurality of past values that are stored in the role base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and wherein the displaying comprises displaying the matrix of cells for the at least one target characteristic to be data collected in the target samples to be data collected.
15. A method according to Claim 14 wherein the displaying is followed by:
accepting user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and storing in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
16. A method according to Claim 15 wherein the applying, displaying, accepting and storing the at least one value are repeatedly performed in sequence during a plurality of time intervals.
17. A method according to Claim 14 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time interval.
18. A method according to Claim 14 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
19. A method according to Claim 14 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
20. A method according to Claim 14 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
21. A method of scheduling data collection of characteristics of a plurality of samples, wherein values of the characteristics change over time, the method comprising:
storing in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
storing in a rule base, a plurality of rules that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
applying the plurality of rules to the plurality of past values that are stored in the rule base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and generating user instructions to collect data for the at least one target characteristic to be data collected in the target samples to be data collected.
22. A method according to Claim 21 wherein the generating is followed by:
accepting user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and storing in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
23. A method according to Claim 22 wherein the applying, generating, accepting and storing the at least one value are repeatedly performed in sequence during a plurality of time intervals.
24. A method according to Claim 21 wherein the plurality of roles include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time interval.
25. A method according to Claim 21 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
26. A method according to Claim 21 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
27. A method according to Claim 21 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
28. A method according to Claim 21 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of roles include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of the characteristic during a past time interval.
29. A method according to Claim 21 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of a second characteristic during a past time interval.
30. A method according to Claim 21 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have the characteristic during a past time interval.
31. A method according to Claim 21 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have a second characteristic during a past time interval.
32. A method according to Claim 21 wherein the plurality of samples are contained in an array of containers that are arranged in a container spatial relationship, and wherein the generating comprises:
displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and accepting user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the target characteristic to be data collected for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
33. A method according to Claim 32 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the displaying is preceded by:
accepting user selection of an array of containers from the plurality of arrays of containers.
34. A method according to Claim 32 wherein the displaying is preceded by:
accepting user selection of a target characteristic from the characteristics that change over time; and wherein the displaying comprises displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the target characteristic that was selected.
35. A method according to Claim 32:
wherein the accepting user input comprises accepting user input of a default value of the at least one of the target characteristics for the cells of the matrix that is displayed, and accepting user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
36. A method according to Claim 32 wherein the following is performed between the accepting and the storing:
accepting user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the target characteristics for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
37. A system for collecting data about a plurality of samples that possess characteristics that change over time, the samples being contained in an array of containers that are arranged in a container spatial relationship, the system comprising:
means for displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
38. A system according to Claim 37 further comprising:
means for storing in a database, the at least one value of the at least one of the characteristics that change over time for the at least one of the samples.
39. A system according to Claim 37 wherein the array of containers includes a plurality of rows and columns of containers in a container spatial relationship and wherein the matrix of cells includes a corresponding plurality of rows and columns of cells in a cell spatial relationship that corresponds to the container spatial relationship.
40. A system according to Claim 37 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the system further comprises:
means for accepting user selection of an array of containers from the plurality of arrays of containers.
41. A system according to Claim 37 further comprising:
means for accepting user selection of a characteristic from the characteristics that change over time; and wherein the means for displaying comprises means for displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the characteristic that was selected.
42. A system according to Claim 41 wherein the data entry parameters comprise at least one of a yes/no selection, a data entry box and a pull down menu of selection options.
43. A system according to Claim 41 further comprising means for displaying user instructions for obtaining a value of the characteristic that was selected.
44. A system according to Claim 37:
wherein the means for accepting user input comprises means for accepting user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
45. A system according to Claim 38:
wherein the means for accepting user input comprises means for accepting user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and means for accepting user input into at least one of the cells of the matrix that is displayed of at least one value that is different from the default value; and wherein the means for storing comprises means for storing in the database, the default value for the cells of the matrix except for the at least one of the cells in which the at least one value that is different from the default value was accepted, and means for storing in the database, the at least one value for the at least one of the cells.
46. A system according to Claim 38 further comprising:
means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
47. A system according to Claim 37 wherein the means for displaying and the means for accepting are repeatedly activated to collect data for a plurality of matrices of cells that correspond to a plurality of arrays of containers.
48. A system according to Claim 37 wherein the means for displaying and the means for accepting are repeatedly activated to collect data for a plurality of the characteristics that change over time.
49. A system according to Claim 37 wherein the means for displaying and the means for accepting are repeatedly activated to collect data over a plurality of sequential time intervals.
50. A system according to Claim 39 further comprising:
means for storing in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
means for storing in a rule base, a plurality of rules that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
means for applying the plurality of rules to the plurality of past values that are stored in the rule base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and wherein the means for displaying comprises means for displaying the matrix of cells for the at least one target characteristic to be data collected in the target samples to be data collected.
51. A system according to Claim 50 further comprising:
means for accepting user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and means for storing in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
52. A system according to Claim 51 wherein the means for applying, the means for displaying, the means for accepting and the means for storing the at least one value are repeatedly activated in sequence during a plurality of time intervals.
53. A system according to Claim 50 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time interval.
54. A system according to Claim 50 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
55. A system according to Claim 50 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
56. A system according to Claim 50 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
57. A system for scheduling data collection of characteristics of a plurality of samples, wherein values of the characteristics change over time, the system comprising:
means for storing in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
means for storing in a rule base, a plurality of rules that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
means for applying the plurality of rules to the plurality of past values that are stored in the rule base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and means for generating user instructions to collect data for the at least one target characteristic to be data collected in the target samples to be data collected.
58. A system according to Claim 57 further comprising:

means for accepting user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and means for storing in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
59. A system according to Claim 58 wherein the means for applying, the means for generating, the means for accepting and the means for storing the at least one value are repeatedly activated in sequence during a plurality of time intervals.
60. A system according to Claim 57 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time interval.
61. A system according to Claim 57 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
62. A system according to Claim 57 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
63. A system according to Claim 57 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
64. A system according to Claim 57 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of the characteristic during a past time interval.
65. A system according to Claim 57 wherein the plurality of samples axe contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of a second characteristic during a past time interval.
66. A system according to Claim 57 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have the characteristic during a past time interval.
67. A system according to Claim 57 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have a second characteristic during a past time interval.
68. A system according to Claim 57 wherein the plurality of samples are contained in an array of containers that are arranged in a container spatial relationship, and wherein the means for generating comprises:
means for displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the target characteristic to be data collected for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
69. A system according to Claim 68 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the system further comprises:
means for accepting user selection of an array of containers from the plurality of arrays of containers.
70. A system according to Claim 68 further comprising:
means for accepting user selection of a target characteristic from the characteristics that change over time; and wherein the means for displaying comprises means for displaying a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the target characteristic that was selected.
71. A system according to Claim 68:
wherein the means for accepting user input comprises means for accepting user input of a default value of the at least one of the target characteristics for the cells of the matrix that is displayed, and means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
72. A system according to Claim 68 further comprising:
means for accepting user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the target characteristics for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
73. A computer program product that collects data about a plurality of samples that possess characteristics that change over time, the samples being contained in an array of containers that are arranged in a container spatial relationship, the computer program product comprising a computer usable storage medium having computer-readable program code embodied in the medium, the computer-readable program code comprising:
computer-readable program code that is configured to display a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
74. A computer program product according to Claim 73 further comprising:
computer-readable program code that is configured to store in a database, the at least one value of the at least one of the characteristics that change over time for the at least one of the samples.
75. A computer program product according to Claim 73 wherein the array of containers includes a plurality of rows and columns of containers in a container spatial relationship and wherein the matrix of cells includes a corresponding plurality of rows and columns of cells in a cell spatial relationship that corresponds to the container spatial relationship.
76. A computer program product according to Claim 73 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the computer program product further comprises:
computer-readable program code that is configured to accept user selection of an array of containers from the plurality of arrays of containers.
77. A computer program product according to Claim 73 further comprising:
computer-readable program code that is configured to accept user selection of a characteristic from the characteristics that change over time; and wherein the computer-readable program code that is configured to display comprises computer-readable program code that is configured to display a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the characteristic that was selected.
78. A computer program product according to Claim 77 wherein the data entry parameters comprise at least one of a yes/no selection, a data entry box and a pull down menu of selection options.
79. A computer program product according to Claim 77 further comprising:

computer-readable program code that is configured to display user instructions for obtaining a value of the characteristic that was selected.
80. A computer program according to Claim 73:
wherein the computer-readable program code that is configured to accept user input comprises computer-readable program code that is configured to accept user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
81. A computer program product according to Claim 74:
wherein the computer-readable program code that is configured to accept user input comprises computer-readable program code that is configured to accept user input of a default value of the at least one of the characteristics for the cells of the matrix that is displayed, and computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed of at least one value that is different from the default value; and wherein the computer-readable program code that is configured to store comprises computer-readable program code that is configured to store in the database, the default value for the cells of the matrix except for the at least one of the cells in which the at least one value that is different from the default value was accepted, and computer-readable program code that is configured to store in the database, the at least one value for the at least one of the cells.
82. A computer program product according to Claim 74 further comprising:
computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the characteristics that change over time for at least one of the samples that corresponds to the at least one of the cells in the matrix that is displayed.
83. A computer program product according to Claim 73 wherein the computer-readable program code that is configured to display and computer-readable program code that is configured to accept are repeatedly activated to collect data for a plurality of matrices of cells that correspond to a plurality of arrays of containers.
84. A computer program product according to Claim 73 wherein the computer-readable program code that is configured to display and the computer-readable program code that is configured to accept are repeatedly activated to collect data for a plurality of the characteristics that change over time.
85. A computer program product according to Claim 73 wherein the computer-readable program code that is configured to display and the computer-readable program code that is configured to accept are repeatedly activated to collect data over a plurality of sequential time intervals.
86. A computer program product according to Claim 73 further comprising:
computer-readable program code that is configured to store in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
computer-readable program code that is configured to store in a rule base, a plurality of rules that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
computer-readable program code that is configured to apply the plurality of rules to the plurality of past values that are stored in the rule base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and wherein the computer-readable program code that is configured to display comprises computer-readable program code that is configured to display the matrix of cells for the at least one target characteristic to be data collected in the target samples to be data collected.
87. A computer program product according to Claim 86 further comprising:

computer-readable program code that is configured to accept user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and computer-readable program code that is configured to store in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
88. A computer program product according to Claim 87 wherein the computer-readable program code that is configured to apply, the computer-readable program code that is configured to display, the computer-readable program code that is configured to accept and the computer-readable program code that is configured to store the at least one value are repeatedly activated in sequence during a plurality of time intervals.
89. A computer program product according to Claim 86 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time interval.
90. A computer program product according to Claim 86 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
91. A computer program product according to Claim 86 wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
92. A computer program product according to Claim 86 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
93. A computer program product that schedules data collection of characteristics of a plurality of samples, wherein values of the characteristics change over time, the computer program product comprising a computer usable storage medium having computer-readable program code embodied in the medium, the computer-readable program code comprising:
computer-readable program code that is configured to store in a database, a plurality of past values of the characteristics of the plurality of samples that were data collected during at least one past time interval;
computer-readable program code that is configured to store in a rule base, a plurality of rules that determine whether a characteristic of a sample is to be data collected and, if so, that identify the characteristic which is to be data collected, based on values of characteristics of samples;
computer-readable program code that is configured to apply the plurality of rules to the plurality of past values that are stored in the rule base to identify target samples to be data collected from the plurality of samples and to identify at least one target characteristic to be data collected for the target samples that are identified; and computer-readable program code that is configured to generate user instructions to collect data for the at least one target characteristic to be data collected in the target samples to be data collected.
94. A computer program product according to Claim 93 further comprising:
computer-readable program code that is configured to accept user input of at least one value of the at least one target characteristic to be data collected in the target samples to be data collected; and computer-readable program code that is configured to store in the database, the at least one target value of the at least one target characteristic to be data collected in the target samples to be data collected.
95. A computer program product according to Claim 94 wherein the computer-readable program code that is configured to apply, the computer-readable program code that is configured to generate, the computer-readable program code that is configured to accept and the computer-readable program code that is configured to store the at least one value are repeatedly activated in sequence during a plurality of time intervals.
96. A computer program product according to Claim 93 wherein the plurality of rules include a vile that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples having a value of the characteristic during a past time internal.
97. A computer program product according to Claim 93 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples having a value of a second characteristic during a past time interval.
98. A computer program product according to Claim 93 wherein the plurality of piles include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples failing to have the characteristic during a past time interval.
99. A computer program product according to Claim 93 wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples failing to have a second characteristic during a past time interval.
100. A computer program product according to Claim 93 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a vile that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of the characteristic during a past time interval.
101. A computer program product according to Claim 93 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample having a value of a second characteristic daring a past time interval.
102. A computer program product according to Claim 93 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have the characteristic during a past time interval.
103. A computer program product according to Claim 93 wherein the plurality of samples are contained in a plurality of arrays of samples, and wherein the plurality of rules include a rule that begins or terminates data collection of a first characteristic in a sample based on a percentage of the samples in the array that includes the sample failing to have a second characteristic during a past time interval.
104. A computer program product according to Claim 93 wherein the plurality of samples are contained in an array of containers that are arranged in a container spatial relationship, and wherein the computer-readable program code that is configured to generate comprises:
computer-readable program code that is configured to display a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship; and computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one value of at least one of the target characteristic to be data collected for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
105. A computer program product according to Claim 104 wherein the plurality of samples are contained in a plurality of arrays of containers and wherein the computer program product further comprises:
computer-readable program code that is configured to accept user selection of an array of containers from the plurality of arrays of containers.
106. A computer program product according to Claim 104 further comprising:
computer-readable program code that is configured to accept user selection of a target characteristic from the characteristics that change over time; and wherein the computer-readable program code that is configured to display comprises computer-readable program code that is configured to display a matrix of cells in a cell spatial relationship that corresponds to the container spatial relationship and that includes data entry parameters for the target characteristic that was selected.
107. A computer program product according to Claim 104:
wherein the computer-readable program code that is configured to accept user input comprises computer-readable program code that is configured to accept user input of a default value of the at least one of the target characteristics for the cells of the matrix that is displayed, and computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one value that is different from the default value.
108. A computer program product according to Claim 104 further comprising:
computer-readable program code that is configured to accept user input into at least one of the cells of the matrix that is displayed, of at least one corrected value of at least one of the target characteristics for at least one of the target samples to be data collected that corresponds to the at least one of the cells in the matrix that is displayed.
CA002376140A 2000-03-28 2001-03-27 Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples Abandoned CA2376140A1 (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US19270600P 2000-03-28 2000-03-28
US19249600P 2000-03-28 2000-03-28
US60/192,496 2000-03-28
US60/192,706 2000-03-28
PCT/US2001/009726 WO2001073672A2 (en) 2000-03-28 2001-03-27 Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples

Publications (1)

Publication Number Publication Date
CA2376140A1 true CA2376140A1 (en) 2001-10-04

Family

ID=26888125

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002376140A Abandoned CA2376140A1 (en) 2000-03-28 2001-03-27 Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples

Country Status (5)

Country Link
US (1) US7356417B2 (en)
EP (1) EP1309912A2 (en)
AU (1) AU2001249480A1 (en)
CA (1) CA2376140A1 (en)
WO (1) WO2001073672A2 (en)

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001078652A2 (en) 2000-04-14 2001-10-25 Metabolon, Inc. Methods for drug discovery, disease treatment, and diagnosis using metabolomics
US7329489B2 (en) 2000-04-14 2008-02-12 Matabolon, Inc. Methods for drug discovery, disease treatment, and diagnosis using metabolomics
US7519695B2 (en) 2000-05-26 2009-04-14 Ipass Inc. Service quality monitoring process
US7240112B2 (en) * 2000-05-26 2007-07-03 Ipass Inc. Service quality monitoring process
WO2002010932A1 (en) * 2000-08-02 2002-02-07 Ipass, Inc. A method and system to customize and update a network connection application for distribution to mulitple end users
US7174512B2 (en) * 2000-12-01 2007-02-06 Thomson Licensing S.A. Portal for a communications system
US20030188160A1 (en) * 2001-08-02 2003-10-02 Singam Sunder Method and system to securely update files via a network
US7761606B2 (en) * 2001-08-02 2010-07-20 Ipass Inc. Method and system to secure a connection application for distribution to multiple end-users
JP2004310728A (en) * 2002-09-24 2004-11-04 Ricoh Co Ltd Management mediating device, image forming apparatus, management mediating program and recording medium with management mediating program recorded
US20050055371A1 (en) * 2003-06-05 2005-03-10 Singam Sunder Method and system to manage a network connection application
US20060026499A1 (en) * 2004-07-28 2006-02-02 Corey Weddle Calendar based graphical user interface for manipulation of spatial operations and information
US7117118B2 (en) * 2004-08-04 2006-10-03 International Business Machines Corporation Efficient accumulation of performance statistics in a multi-port network
US7949475B2 (en) 2005-08-08 2011-05-24 Metabolon Inc. System and method for analyzing metabolomic data
CA2618123C (en) * 2005-08-08 2013-04-02 Metabolon Inc. A system, method, and computer program product using a database in a computing system to compile and compare metabolomic data obtained from a plurality of samples
WO2008033575A2 (en) 2006-09-15 2008-03-20 Metabolon, Inc. Methods of identifying biochemical pathways
US7809747B2 (en) * 2006-10-23 2010-10-05 Donald Martin Monro Fuzzy database matching
US9846739B2 (en) 2006-10-23 2017-12-19 Fotonation Limited Fast database matching
US20080097992A1 (en) * 2006-10-23 2008-04-24 Donald Martin Monro Fast database matching
US20110153392A1 (en) * 2009-12-22 2011-06-23 Pallad Steven T Systems and methods for scheduling a periodic collection of environmental samples
US10169308B1 (en) 2010-03-19 2019-01-01 Google Llc Method and system for creating an online store
US8577094B2 (en) 2010-04-09 2013-11-05 Donald Martin Monro Image template masking
CA2752594C (en) * 2011-06-30 2018-12-04 Xinxin Shan Networked intelligent plant growth system
JP6341212B2 (en) * 2013-11-25 2018-06-13 日本電気株式会社 Information collection system, server device, edge device, control method, and program
USD738900S1 (en) * 2014-03-19 2015-09-15 Wargaming.Net Llp Display screen with animated graphical user interface
CN113269417B (en) * 2021-05-12 2023-08-22 中国人民解放军总医院 Intelligent dispatching method and device for biological sample collection personnel

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5367619A (en) * 1990-04-27 1994-11-22 Eaton Corporation Electronic data entry system employing an expert system to facilitate generation of electronic data forms with complex interrelationships between fields and subforms
US6037939A (en) * 1995-09-27 2000-03-14 Sharp Kabushiki Kaisha Method for enabling interactive manipulation of data retained in computer system, and a computer system for implementing the method
GB9810574D0 (en) * 1998-05-18 1998-07-15 Thermo Bio Analysis Corp Apparatus and method for monitoring and controlling laboratory information and/or instruments

Also Published As

Publication number Publication date
EP1309912A2 (en) 2003-05-14
AU2001249480A1 (en) 2001-10-08
US20010056485A1 (en) 2001-12-27
WO2001073672A3 (en) 2003-03-13
WO2001073672A2 (en) 2001-10-04
US7356417B2 (en) 2008-04-08

Similar Documents

Publication Publication Date Title
CA2376140A1 (en) Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples
Rafferty et al. Phenological overlap of interacting species in a changing climate: an assessment of available approaches
Greig-Smith Quantitative plant ecology
Kempton et al. Statistical methods for plant variety evaluation
US5963733A (en) Method and system for simulating forest management
CN103380439A (en) Farm work assistance method and farm work assistance device
Chen et al. Graph-based optimization algorithm and software on kidney exchanges
Schipmann et al. Impact of cultivation and collection on the conservation of medicinal plants: global trends and issues
Cocu et al. Spatial autocorrelation as a tool for identifying the geographical patterns of aphid annual abundance
CN105303277A (en) Germplasm resource management method and system
Kleijnen The role of statistical methodology in simulation
Namkoong A gene conservation plan for loblolly pine
Islam ShellAg: Expert system shell for agricultural crops
Acock et al. The rationale for adopting a modular generic structure for crop simulators
Fogelström et al. Phenotypic but not genotypic selection for earlier flowering in a perennial herb
Vico et al. Business Intelligence in Agriculture–A Practical Approach
Knight et al. FLYPAST: an information management system for the Rothamsted Aphid Database to aid pest control research and advice
US8612160B2 (en) Identifying biological response pathways
Naranjo et al. A simulation model of northern corn rootworm, Diabrotica barberi Smith and Lawrence (Coleoptera: Chrysomelidae), population dynamics and oviposition: significance of host plant phenology
Stafne et al. A relational database for agronomic and genealogical sugarcane data: An adaptable prototype
Abdala‐Roberts et al. Ecological and evolutionary consequences of tri‐trophic interactions: Spatial variation and effects of plant density
Maxwell The population dynamics and growth of salmonberry (Rubus spectabilis) and thimbleberry (Rubus parviflorus)
Hidayati et al. Climate smart actions “Saung Iklim” for smallholder farmers in Subang district, West Java, Indonesia
KR100479927B1 (en) Method for management of scallop fishing ground
El Bizri Understanding wild meat consumption, trade and sustainability in the Amazon

Legal Events

Date Code Title Description
EEER Examination request
FZDE Discontinued
FZDE Discontinued

Effective date: 20110113