User interface for entry of step changes

• US 20070203907A1
• Filed: 02/02/2007
• Published: 08/30/2007
• Est. Priority Date: 02/03/2006
• Status: Abandoned Application

• Current Assignee: Polyglot Acquisition Company, Inc.
• Original Assignee: Polyglot Systems, Inc. (The Hearst Corporation)
• Inventors: Lee, Chung-Suk
• Application Number:
  US11/701,575
• Publication Number:
  US 20070203907A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 3/04847 Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
• CPC Class Codes: G16H 20/10 relating to drugs or medications, e.g. for ensuring correct administration to patients
• CPC Class Codes: G16H 40/20 for the management or administration of healthcare resources or facilities, e.g. managing hospital staff or surgery rooms
• CPC Class Codes: G16H 40/63 for local operation

Abstract

A user interface for capturing user input for a non-uniform pattern of N quantities associated with a set of N time periods. The user interface allows the capture of the N quantities without the need to input N separate values. One implementation allows the user to input a sequence of step changes. Other implementations allow the user to select a pattern and provide a few parameters so that a non-uniform pattern of step changes is created by the system. Some implementations may allow subsequent adjustment of the created pattern. One use of this user interface is to capture medication instructions to either ramp up the dose of a medication or to taper down a dose of medication. These instructions may be communicated electronically to other systems, stored, or printed. This abstract is provided as an aid in locating patents of relevance to a particular topic and not as an outer bound on the scope of the claims.

Claims

1. A method of producing a non-uniform pattern of N quantities associated with a set of N time periods and communicating the set of N quantities associated with the N time periods, the method comprising:

receiving a first value for a quantity associated with a first time period;

receiving a second value for a quantity associated with a second time period, the second value not equal to the first value and the second time period different than the first time period; and

associating a third quantity with a third time period without receiving a third value for the quantity to be associated with the third time period such that the pattern of N quantities associated with the set of N time periods is communicated without receiving a set of N separate input values with N quantities for the set of N time periods.

2. The method of claim 1 wherein the duration of the first time period equals the duration of the second time period but the second time period is subsequent to the first time period.

3. The method of claim 1 wherein the second time period is before a Nth time period and the method includes receiving an Nth value associated with the Nth time period.

4. The method of claim 1 wherein the Nth value is none.

5. The method of claim 1 wherein the quantities associated for each time period between an earlier time period that received a value for the quantity associated with that earlier time period and a later time period that received a value for the quantity associated with the later time period is set to be the value for the quantity associated with the earlier time value.

6. The method of claim 1 wherein the quantity associated with a time period between an earlier time period that received a value for the quantity to be associated with that earlier time period and a later time period that received a value for the quantity to be associated with that later time period is set to be a quantity between the value for the earlier time period and the value for the later time period.

7. The method of claim 1 wherein the non-uniform pattern of N quantities associated with N time periods is a set of N medication doses for a set of N time periods.

8. The method of claim 7 wherein the time periods are days.

9. The method of claim 7 wherein the time periods have durations that are less than 24 hours.

10. The method of claim 1 wherein the quantities correspond to number of pills.

11. The method of claim 10 wherein the quantities include a portion of a pill for a pill that may be broken.

12. The method of claim 1 wherein the quantities correspond to quantities of a liquid.

13. The method of claim 1 wherein the non-uniform pattern of N quantities associated with the set of N time periods is displayed and may be altered by adjusting any individual value associated with a particular time period.

14. The method of claim 1 wherein the method includes receiving a pattern type.

15. The method of claim 1 wherein the steps of receiving a first value for a quantity associated with a first time period;

and

receiving a second value for a quantity associated with a second time period, the second value not equal to the first value and the second time period different than the first time period is accomplished by receiving a first value for a quantity associated with the first time period, a final value and information sufficient to determine the earliest time period associated with a quantity equal to the final value.

16. The method of claim 15 wherein the received information includes a minimum change increment to be used to calculate changes in quantities for time periods between the first time period and the earliest time period associated with the quantity equal to the final value.

17. The method of claim 1 wherein the non-uniform pattern of N quantities associated with the set of N time periods is communicated electronically to storage associated with a patient to receive medication doses according to the non-uniform pattern.

18. The method of claim 1 wherein the non-uniform pattern of N quantities associated with the set of N time periods is communicated by printing.

19. A computer system comprising:

at least one input means for receiving input from an end user;

at least one output device for communicating a non-uniform pattern of N quantities for a set of N time periods;

the computer system having access to a set of computer instructions for producing a non-uniform pattern of N quantities associated with a set of N time periods and communicating the non-uniform pattern of N quantities associated with the set of N time periods,

the instructions adapted for;

receiving a first value for a quantity associated with a first time period;

receiving a second value for a quantity associated with a second time period, the second value not equal to the first value and the second time period different than the first time period; and

associating a third quantity for a third time period without receiving a third value for a quantity for the third time period such that the non-uniform pattern of N quantities for the set of N time periods may be communicated without receiving a set of N separate input values for the N quantities for the set of N time periods.

20. The computer system of claim 19 wherein at least one output device for communicating the non-uniform pattern of N quantities for the set of N time periods includes a printer.

21. The computer system of claim 19 wherein at least one output device for communicating the non-uniform pattern of N quantities for a set of N time periods includes a communication device for conveying an electronic representation of the non-uniform pattern of N quantities for the set of N time periods.

22. Machine readable media containing software for producing a non-uniform pattern of N quantities associated with a set of N time periods and communicating the set of N quantities associated with the set of N time periods,

the software adapted for:

receiving a first value associated with a quantity for a first time period;

receiving a second value associated with quantity for a second time period, the second value not equal to the first value and the second time period different than the first time period; and

associating a third quantity with a third time period without receiving a third value for a quantity for the third time period such that the non-uniform pattern of N quantities for the set of N time periods may be communicated without receiving a set of N separate input values for the N quantities for the set of N time periods.