Phippen
Nicholas Phippen, Inverness GB
Patent application number | Description | Published |
---|---|---|
20090208734 | TEST STRIPS, METHODS, AND SYSTEM OF MANUFACTURING TEST STRIP LOTS HAVING A PREDETERMINED CALIBRATION CHARACTERISTIC - Various embodiments of a technique in which test strip lots can be prepared without requiring a user to input any calibration information before performing a test measurement with a test strip from the test strip lots. In a first aspect, a method of manufacturing a plurality of test strips by adjusting amount of mediators and working electrode area is described. In another aspect, a method of preparing a reagent ink by adjusting the density of the reagent ink to substantially match a target density is described. In a further aspect, a method using a high numerical Shores Hardness squeegee in conjunction with high pressure is provided. In a further aspect, a method of performing an analyte measurement with a test meter, the test meter being configured to not receive a calibration input, and where the test strip manufactured to any one of the methods or techniques described and illustrated herein. | 08-20-2009 |
20120261258 | TEST STRIPS, METHODS, AND SYSTEM OF MANUFACTURING TEST STRIP LOTS HAVING A PREDETERMINED CALIBRATION CHARACTERISTIC - Various embodiments of a technique in which test strip lots can be prepared without requiring a user to input any calibration information before performing a test measurement with a test strip from the test strip lots. In a first aspect, a method of manufacturing a plurality of test strips by adjusting amount of mediators and working electrode area is described. In another aspect, a method of preparing a reagent ink by adjusting the density of the reagent ink to substantially match a target density is described. In a further aspect, a method using a high numerical Shores Hardness squeegee in conjunction with high pressure is provided. In a further aspect, a method of performing an analyte measurement with a test meter, the test meter being configured to not receive a calibration input, and where the test strip manufactured to any one of the methods or techniques described and illustrated herein. | 10-18-2012 |
Nicholas I. Phippen, Buckinghamshire GB
Patent application number | Description | Published |
---|---|---|
20090102355 | DISPLAY ELEMENT - The invention provides an element for a colour electroluminescent display for displaying multicoloured information, each element comprising at least two sub elements. One sub element comprises an electroluminescent material and a fluorescent material and a further sub element comprises the electroluminescent material and a filter material to select a portion of the electroluminescent emission. | 04-23-2009 |
Nick Phippen, Inverness GB
Patent application number | Description | Published |
---|---|---|
20120043204 | ENZYMATIC REAGENT INKS FOR USE IN TEST STRIPS HAVING A PREDETERMINED CALIBRATION CODE - The invention provides an enzyme ink useful in test strips that provides a test strip bias, at the low and high glucose ends, falling within a desired target range. The ink of the invention permits an improved method for the production of single calibration code strip lots with good yields. | 02-23-2012 |
Robert W. Phippen, Romsey GB
Patent application number | Description | Published |
---|---|---|
20090164593 | DERIVING OVERLAY INFORMATION FROM A USER INPUT FOR A BASE MESSAGE SCHEMA ASSOCIATED WITH A NODE IN A MESSAGE FLOW - There is disclosed a method, apparatus and computer program for deriving overlay information from a user input for a base message schema associated with a node in a message flow. The base message schema is presented to the user and has at least one variable portion. A user selection of a variable portion of the base schema is received. The user is then provided with possible overlay schema information for the selected variable portion. A user selection of the schema to be overlaid on the selected variable portion is received. The selected overlay schema is associated with the base schema. | 06-25-2009 |
20120151027 | POLICY DRIVEN DYNAMIC COMPOSITION OF SERVICE DATAFLOWS - An information processing system receives a request from a client. A first set of dataflows that enforces at least one set of policies is retrieved in response to receiving the request. Each dataflow in the first set of dataflows is a software component that processes a set of messages sent from the client to a service. A dataflow execution plan is generated that include the first set of dataflows. At least one dataflow in the first set of dataflows is determined to be associated with a dataflow policy. At least a second set of dataflows associated with the dataflow policy is retrieved in response to the determining. At the at least second set of dataflows is inserted into the dataflow execution plan preceding the at least one dataflow. | 06-14-2012 |
20130007248 | POLICY DRIVEN DYNAMIC COMPOSITION OF SERVICE DATAFLOWS - An information processing system receives a request from a client. A first set of dataflows that enforces at least one set of policies is retrieved in response to receiving the request. Each dataflow in the first set of dataflows is a software component that processes a set of messages sent from the client to a service. A dataflow execution plan is generated that include the first set of dataflows. At least one dataflow in the first set of dataflows is determined to be associated with a dataflow policy. At least a second set of dataflows associated with the dataflow policy is retrieved in response to the determining. At the at least second set of dataflows is inserted into the dataflow execution plan preceding the at least one dataflow. | 01-03-2013 |
Robert W. Phippen, Hampshire GB
Patent application number | Description | Published |
---|---|---|
20100115251 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZING RUNTIME BRANCH SELECTION IN A FLOW PROCESS - A method, system, and computer program product for optimizing runtime branch selection in a flow process are provided. The method includes gathering performance metrics of flow branch behavior for executed flows in a runtime system over time and using aggregated performance metrics for the behavior to determine an optimal ordering of branches for a currently running flow. The optimal ordering is determined by identifying one or more branch points in the flow, generating ordering permutations for at least a portion of the branches in the branch point for the flow to identify any permutations that have not been executed, gathering metrics for permutation(s) of the branch point in the flow, comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior, and identifying optimal branch ordering for the permutation(s) based upon the comparison. The method also includes executing the flow according to the optimal branch ordering. | 05-06-2010 |
Robert William Phippen, Romsey GB
Patent application number | Description | Published |
---|---|---|
20090125638 | MESSAGE TRANSFORMATION SELECTION TOOL - A message transformation selection tool and method for use in a distributed message processing system running applications on subsystems using incompatible message formats, selects the most appropriate output message format for a given input message format. Firstly, the tool determines compatibility of each field of the input message format with fields of all possible output message formats. Next, it statistically analyses the values of message fields in messages stored in message logs for each of the subsystems. On the basis of this analysis, the tool selects the best fit output message into which to transform a given input message. | 05-14-2009 |
Robert William Phippen, Winchester GB
Patent application number | Description | Published |
---|---|---|
20100061382 | METHOD, APPARATUS AND COMPUTER PROGRAM FOR PROCESSING A MESSAGE USING A MESSAGE PROCESSING NODE - There is disclosed a method, apparatus and computer program product for processing a message using a message processing node. A message is received at the message processing node and at least one parameter value is extracted from the message. An attempt is made to select a node from a library of pre-configured nodes by using the at least one parameter value and the message is processed using the selected node. In attempting to select a node, an attempt is made to locate a pre-configured node that is appropriate for the message received and responsive to being unable to locate such a pre-configured node, a new node is configured using any parameter values extracted from the message. | 03-11-2010 |