Hutchison, GB
Christopher Hutchison, Durham GB
Patent application number | Description | Published |
---|---|---|
20100297618 | METHODS FOR DETERMINING A PROGNOSIS OF COLORECTAL CANCER - The invention provides methods for determining a prognosis of colorectal cancer in an individual comprising determining an A-type lamin status of an individual and using the A-type lamin status to determine the prognosis of the colorectal cancer, and more particularly for predicting outcomes of colorectal cancer in the individual such as the survival or mortality of the individual or the likelihood of recurrence of the colorectal cancer. Kits for use in carrying out these methods are also provided. | 11-25-2010 |
Colin Hutchison, Birmingham GB
Patent application number | Description | Published |
---|---|---|
20100084339 | High cut-off hemodialysis membranes for the treatment of chronic hemodialysis patients - The present invention relates to high cut-off hemodialysis membranes for the treatment of chronic hemodialysis (CHD) patients, with the potential to improve long-term survival of these patients by reducing the risk of cardiovascular disease, through down-regulation of monocyte activation in the blood. Monocytes are the major circulating blood cells involved in the progression of cardiovascular disease. High cut-off hemodialysis in chronic dialysis patients results in a sustained decrease in expression of monocyte cell-surface proteins that direct the movement of these cells from the blood to the walls of blood vessels, where they promote the progression of arterial disease (atherosclerosis) that leads to cardiovascular disease (CVD); heart disease, strokes and peripheral vascular disease. | 04-08-2010 |
David Hutchison, Lancaster GB
Patent application number | Description | Published |
---|---|---|
20150304198 | COMPUTER NETWORKS - A method and apparatus for identifying similar and coordinated communications between computers connected by a network are described. Communications between a plurality of pairs of computers are monitored to obtain respective flow metrics for a first and second pair of computers. The flow metric represents at least one property of the data flow between the pair of computers. Representations of the evolution of the data flows between the pairs of computers are updated using the flow metrics. The representations of the evolution of the data flows are compared to determine the similarity of the data flows between the pairs of computers. The first pair of computers and the second pair of computers are identified as exhibiting similar and coordinated communication if their data flows are determined to be similar. | 10-22-2015 |
Gordon D. Hutchison, Winchester GB
Patent application number | Description | Published |
---|---|---|
20100115218 | MAINTAINING STORAGE DEVICE BACKUP CONSISTENCY - A method, system, and computer program product are provided for maintaining a storage device backup consistency group. The method comprises receiving a first I/O command for a first storage device, receiving a second I/O command for a second storage device, identifying a transaction comprising both the first I/O command and the second I/O command, accessing a storage device backup consistency group for the first storage device, determining whether a backup for the second storage device is a member of the storage device backup consistency group, and performing a predefined corrective action if a backup for the second storage device is not a member of the storage device backup consistency group. The predefined corrective action may comprise detecting or creating a backup for the second storage device and then adding the detected or created backup to the storage device backup consistency group, invalidating the second I/O command, and/or issuing a warning. | 05-06-2010 |
Gordon D. Hutchison, Hursley GB
Patent application number | Description | Published |
---|---|---|
20140365819 | REBUILDING DATA OF A STORAGE SYSTEM - Proposed are concepts for rebuilding data in a data storage system. Embodiments rebuild data in order of priority as defined by a rebuild policy. Data rebuilding may therefore be undertaken so that important data is rebuilt before less important data for example. For instance, according to one embodiment, a method of rebuilding data in a data storage system includes: determining data to be rebuilt; identifying a plurality of data blocks, each data block comprising data to be rebuilt having a common characteristic; assigning a priority to each of the plurality of data blocks in accordance with a rebuild policy representing a priority to be assigned to a data block based on the common characteristic of its data; and rebuilding the data of each the plurality of data blocks in order of their assigned priority. | 12-11-2014 |
Gordon D. Hutchison, Hampshire GB
Patent application number | Description | Published |
---|---|---|
20110219192 | PERFORMING A DATA WRITE ON A STORAGE DEVICE - A method of performing a data write on a storage device comprises instructing a device driver for the device to perform a write to the storage device, registering the device driver as a transaction participant with a transaction co-ordinator, executing a flashcopy of the storage device, performing the write on the storage device, and performing a two-phase commit between device driver and transaction co-ordinator. Preferably, the method comprises receiving an instruction to perform a rollback, and reversing the data write according to the flashcopy. In a further refinement, a method of scheduling a flashcopy of a storage device comprises receiving an instruction to perform a flashcopy, ascertaining the current transaction in relation to the device, registering the device driver for the device as a transaction participant in the current transaction with a transaction co-ordinator, receiving a transaction complete indication from the co-ordinator, and executing the flashcopy for the device. | 09-08-2011 |
20120278559 | PERFORMING A DATA WRITE ON A STORAGE DEVICE - A method of performing a data write on a storage device comprises instructing a device driver for the device to perform a write to the storage device, registering the device driver as a transaction participant with a transaction co-ordinator, executing a flashcopy of the storage device, performing the write on the storage device, and performing a two-phase commit between device driver and transaction co-ordinator. Preferably, the method comprises receiving an instruction to perform a rollback, and reversing the data write according to the flashcopy. In a further refinement, a method of scheduling a flashcopy of a storage device comprises receiving an instruction to perform a flashcopy, ascertaining the current transaction in relation to the device, registering the device driver for the device as a transaction participant in the current transaction with a transaction co-ordinator, receiving a transaction complete indication from the co-ordinator, and executing the flashcopy for the device. | 11-01-2012 |
20150033069 | PERFORMING A DATA WRITE ON A STORAGE DEVICE - A method of performing a data write on a storage device comprises instructing a device driver for the device to perform a write to the storage device, registering the device driver as a transaction participant with a transaction co-ordinator, executing a flashcopy of the storage device, performing the write on the storage device, and performing a two-phase commit between device driver and transaction co-ordinator. Preferably, the method comprises receiving an instruction to perform a rollback, and reversing the data write according to the flashcopy. In a further refinement, a method of scheduling a flashcopy of a storage device comprises receiving an instruction to perform a flashcopy, ascertaining the current transaction in relation to the device, registering the device driver for the device as a transaction participant in the current transaction with a transaction co-ordinator, receiving a transaction complete indication from the co-ordinator, and executing the flashcopy for the device. | 01-29-2015 |
Gordon D. Hutchison, Hants GB
Patent application number | Description | Published |
---|---|---|
20160085459 | MANAGING STORAGE DEVICES HAVING A LIFETIME OF A FINITE NUMBER OF OPERATIONS - Disclosed are methods and systems of managing a plurality of storage devices having a lifetime of a finite number of operations. An average number of storage devices reaching said lifetime of a finite number of operations per first unit time is calculated. For each one of the plurality of storage devices an estimated date when a finite number of operations will be reached is calculated. For each date, a variable related to the number of storage devices reaching said finite number of operations within a predetermined period of said date is set. For one or more variables having a value larger than a value calculated using the date and said average number of storage devices reaching said lifetime within the predetermined period of said first unit of time, an action is carried out to reduce the number of storage devices reaching said lifetime per first unit of time. | 03-24-2016 |
Gordon Douglas Hutchison, Hants GB
Patent application number | Description | Published |
---|---|---|
20090013248 | METHOD AND SYSTEM FOR CODE EDITING - A method and system for code editing using copy and paste operations are provided. The method includes copying a section of text ( | 01-08-2009 |
20120291010 | DETERMINATION OF A SET OF CANDIDATE CODE INSERTIONS FOR INSERTION IN PROGRAM CODE - A code assistance feature provides a user with a set of suggested program code insertions at a given point in the program code being edited. For example, in response to a user command, the feature identifies syntactically correct possible insertions derived from a search for insertions of a compatible type. The feature identifies members in the set of possible code insertions that can be expanded via a field dereference or subroutine call to provide further possible code insertions for selection by the user. | 11-15-2012 |
Gordon Douglas Hutchison, Hampshire GB
Patent application number | Description | Published |
---|---|---|
20100017786 | CODE ASSIST FOR MULTIPLE STATEMENT PATTERNS - A process and system for assisting a user to write new lines of code of a computer program based on code examples. A first line in each code sample matching a specified anchor line. A loop having a custom line branch and a code assist branch is executed. The custom line branch generates a new line for the computer program via a custom line provided by the user. The code assist branch generates a new line for the computer program via code assist. The code assist determines a set of assist lines from the code samples, selects from the assist lines set of preferred lines sequenced in an order of preference, presents the set of preferred lines to the user, receives a preferred line selected by the user after the user edits the selected line to fit the user's context, and stores the preferred line as a new line. | 01-21-2010 |
20100017790 | CODE ASSIST FOR MULTIPLE STATEMENT PATTERNS INCLUDING AUTOMATED TRANSLATION OF CODE EXAMPLES TO A USER CONTEXT - A process and system for assisting a user to write new lines of code of a computer program based on code examples. A first line in each code sample matching a specified anchor line. A loop having a custom line branch and a code assist branch is executed. The custom line branch generates a new line for the computer program via a custom line provided by the user. The code assist branch generates a new line for the computer program via code assist. The code assist determines a set of assist lines from the code samples, translates the assist lines to a user context in each code example, selects from the assist lines set of preferred lines sequenced in an order of preference, presents the set of preferred lines to the user, receives a preferred line selected by the user, and stores the preferred line as a new line. | 01-21-2010 |
20100122050 | VIRTUAL STORAGE MIGRATION TECHNIQUE TO MINIMIZE SPINNING DISKS - A method, and system for employing the method, for virtual data storage migration providing a plurality of data storage devices communicating with at least one computer system. A plurality of data being managed by the computer system and an archive data storage device is selected from the plurality of data storage devices. Specified data is selected for archiving in the archive data storage device when the archive data meets a specified archive criteria. After the archived specified data is accessed in the archive data storage device at a predetermined frequency, the archive data is migrated to an active data storage device in a powered up state. The archive data storage device is then powering down. | 05-13-2010 |
Hutch Hutchison, Churt Surrey GB
Patent application number | Description | Published |
---|---|---|
20100127605 | CASING WALL FOR AN APPARATUS - A casing wall for an apparatus, the casing wall comprising including a chassis and casing wall elements integrated into the chassis, the casing wall elements each including a surface exposed to a user, the chassis defining a continuum between the integrated casing wall elements to provide structural rigidity to the casing wall. | 05-27-2010 |
Hutch Hutchison, Churt GB
Patent application number | Description | Published |
---|---|---|
20100158302 | Headset - A headset with an elongated housing is provided with an in ear speaker that is suspended from the elongated housing so that it may assume a stowed position in which the in ear speaker is substantially in line with the elongated housing and may assume a deployed position in which the in ear speaker is disposed sidewards from said elongated housing. The in ear speaker may be suspended from the elongated housing by an arm, such as a simple arm or a parallel arm mechanism. | 06-24-2010 |
Hutch Hutchison, Surrey GB
Patent application number | Description | Published |
---|---|---|
20100149761 | Apparatus and method for use in assembly of a portable apparatus - An apparatus including: a first interconnector portion configured to fasten to a side part of a first housing portion of a portable apparatus, and a second interconnector portion rigidly connected to the first interconnector portion and configured to fasten to a second housing portion of the portable apparatus. | 06-17-2010 |
20120236518 | Apparatus and method for use in assembly of a portable apparatus - An apparatus comprising: a first interconnector portion configured to fasten to a side part of a first housing portion of a portable apparatus, and a second interconnector portion rigidly connected to the first interconnector portion and configured to fasten to a second housing portion of the portable apparatus. | 09-20-2012 |
Neil D. Hutchison, Stirlingshire GB
Patent application number | Description | Published |
---|---|---|
20090067241 | DATA PROTECTION FOR WRITE ABORT - A portion of a nonvolatile memory array that is likely to contain, partially programmed data may be identified from a high sensitivity read, by applying stricter than usual ECC requirements, or using pointers to programmed sectors. The last programmed data may be treated as likely to be partially programmed data. Data in the identified portion may be copied to another location, or left where it is with an indicator to prohibit further programming to the same cells. To avoid compromising previously stored data during subsequent programming, previously stored data may be backed up. Backing up may be done selectively, for example, only for nonsequential data, or only when the previously stored data contains an earlier version of data being programmed. If a backup copy already exists, another backup copy is not created. Sequential commands are treated as a single command if received within a predetermined time period. | 03-12-2009 |
20090070521 | WRITE ABORT AND ERASE ABORT HANDLING - A portion of a nonvolatile memory array that is likely to contain, partially programmed data may be identified from a high sensitivity read, by applying stricter than usual ECC requirements, or using pointers to programmed sectors. The last programmed data may be treated as likely to be partially programmed data. Data in the identified portion may be copied to another location, or left where it is with an indicator to prohibit further programming to the same cells. To avoid compromising previously stored data during subsequent programming, previously stored data may be backed up. Backing up may be done selectively, for example, only for nonsequential data, or only when the previously stored data contains an earlier version of data being programmed. If a backup copy already exists, another backup copy is not created. Sequential commands are treated as a single command if received within a predetermined time period. | 03-12-2009 |
Neil D. Hutchison, Larbert GB
Patent application number | Description | Published |
---|---|---|
20110161559 | PHYSICAL COMPRESSION OF DATA WITH FLAT OR SYSTEMATIC PATTERN - Systems and methods are disclosed to improve the performance of a memory system by freeing up physical memory areas that correspond to logical block address ranges that have repeated data patterns. A controller detects data patterns in incoming data. When a data pattern is detected, the data is not written to non-volatile storage area. Rather, the logical block address range of the data is marked in a data structure as having pattern data. The pattern may also be recorded in the data structure as a pattern descriptor. Because the data having the data pattern is not written to the non-volatile storage area, the freed up corresponding physical memory area may be utilized by the memory system for other purposes, thereby improving the overall performance and endurance of the memory system. | 06-30-2011 |
20110161560 | ERASE COMMAND CACHING TO IMPROVE ERASE PERFORMANCE ON FLASH MEMORY - Systems and methods are disclosed to reduce the number of partial logical groups that are erased by writing erase patterns to memory in a non-volatile memory system. When a non-aligned erase command is received, the logical addresses of data associated with the erase command may be marked as erased. If the logical group corresponds to the size of a physical metablock, the controller may also issue a physical erase command for complete logical groups within the erase command. For those parts of the erase command that encompass only partial logical groups, the ranges of the logical block addresses marked for erasure are stored. As subsequent erase commands are received the address ranges of the erase commands are added to the previously stored address ranges. When a set of erase commands spans an entire logical group, the logical group is marked for physical erasure in its entirety. | 06-30-2011 |
Neil David Hutchison, Larbert GB
Patent application number | Description | Published |
---|---|---|
20110149650 | Data Transfer Flows for On-Chip Folding - A memory system and methods of its operation are presented. The memory system includes a volatile buffer memory and a non-volatile memory circuit, where the non-volatile memory circuit has a first section, where data is stored in a binary format, and a second section, where data is stored in a multi-state format. When writing data to the non-volatile memory, the data is received from a host, stored in the buffer memory, transferred from the buffer memory to into read/write registers of the non-volatile memory circuit, and then written from the read/write registers to the first section of the non-volatile memory circuit using a binary write operation. Portions of the data and then subsequently folded from the first section of the non-volatile memory to the second section of the non-volatile memory, where a folding operation includes reading the portions of the data from multiple locations in the first section into the read/write registers and performing a multi-state programming operation of the potions of the data from the read/write registers into a location the second section of the non-volatile memory. The multi-state programming operations include a first phase and a second phase and one or more of the binary write operations are performed between the phases of the multi-state programming operations. | 06-23-2011 |
Nicholas William Hutchison, Chippenham Wiltshire GB
Patent application number | Description | Published |
---|---|---|
20120172881 | Ligament Balancer and Drill Guide - A ligament balancer for a knee is disclosed that includes a first guide portion having a first guide hole extending there through, and a second guide portion having a second guide hole extending there through, the first and second guide portions being moveable with respect to each other along a movement axis, the balancer being adapted such that, in use, the movement axis is substantially parallel to the anterior/posterior axis of a distal femoral surface. Also disclosed is a kit of parts that includes the ligament balancer and a drill guide for a knee, the drill guide includes first and second connected arms, each arm comprising at least two guide openings extending there through, the guide openings being spaced longitudinally along each arm, longitudinal axes of the first and second arms intersecting at a predetermined angle. Also disclosed is a method of attaching a cutting block to a distal femoral surface as part of a knee replacement procedure. | 07-05-2012 |
20160074053 | LIGAMENT BALANCER AND DRILL GUIDE - A ligament balancer for a knee is disclosed that includes a first guide portion having a first guide hole extending there through, and a second guide portion having a second guide hole extending there through, the first and second guide portions being moveable with respect to each other along a movement axis, the balancer being adapted such that, in use, the movement axis is substantially parallel to the anterior/posterior axis of a distal femoral surface. Also disclosed is a kit of parts that includes the ligament balancer and a drill guide for a knee, the drill guide includes first and second connected arms, each arm comprising at least two guide openings extending there through, the guide openings being spaced longitudinally along each arm, longitudinal axes of the first and second arms intersecting at a predetermined angle. Also disclosed is a method of attaching a cutting block to a distal femoral surface as part of a knee replacement procedure. | 03-17-2016 |
Peter Hutchison, Cambridge GB
Patent application number | Description | Published |
---|---|---|
20110054873 | SYSTEM AND METHOD FOR CREATION OF FUNCTION-BASED MECHATRONIC OBJECTS - A system, method, and computer readable medium. A method includes receiving requirements for a mechatronics object and receiving functions for the mechatronics object. The method includes assigning the functions to respective ones of components and operations and linking the requirements to respective ones of the functions. The method includes storing the mechatronics object, including the linked requirements and functions. | 03-03-2011 |
20140092088 | PROVIDING A THREE-DIMENSIONAL VIEW THAT INCLUDES A PLURALITY OF SYSTEMS ENGINEERING MODELS - A three-dimensional view that includes a plurality of systems engineering models may be provided. A first systems engineering model and a second systems engineering model of the plurality of systems engineering models may be received. The three-dimensional view that includes the first systems engineering model and the second systems engineering model may be generated. The first systems engineering model may be projected onto a first plane of a three-dimensional coordinate system. The second systems engineering model may be projected onto a second plane of the three-dimensional coordinate system. The second plane is different than the first plane. The three-dimensional view may be displayed. | 04-03-2014 |
20150025854 | SYNCHRONIZATION AND AUTOMATIC CODE GENERATION OF 3D AND 1D MODELS USING FUNCTIONAL MODELING - Methods for product data management and corresponding systems and computer-readable mediums. A method includes receiving and parsing a functional model to produce a functional model graph, and receiving and parsing a three-dimensional (3D) model that corresponds to the functional model to produce a 3D model graph. The method includes identifying a plurality of one-dimensional (1D) candidate components corresponding to the functional model graph and the 3D model graph. The method includes creating a 1D graph corresponding to the 1D candidate components, parameterizing the 1D components in the 1D graph, and generating a 1D model from the parameterized 1D components. | 01-22-2015 |