Newson
Alasdair Newson, Cesson Sevigne FR
Patent application number | Description | Published |
---|---|---|
20130156398 | METHOD FOR PROCESSING AN AUDIOVISUAL CONTENT AND CORRESPONDING DEVICE - The invention relates to a method for processing an audiovisual content aiming to censure scenes called sensitive scenes, for example scenes comprising sex and/or violence, in the audiovisual content and a device implementing the method. According to the invention, the display of a sensitive scene of the audiovisual content is replaced, during the temporal interval intended for the display of said sensitive segment, by the reproduction of audio-description data of the audio-description signal that is usually intended for blind or visually impaired persons. | 06-20-2013 |
Colin Newson, Victoria AU
Patent application number | Description | Published |
---|---|---|
20100006590 | Liquid Dispensing Applicator with Flexible Valve Member - The invention concerns a liquid dispensing applicator for a volatile liquid. The liquid dispensing applicator includes a cap member for attachment to a hollow bodied container having a reservoir for retaining a liquid. The cap member comprises a sleeve to receive and conduit liquid contained within the reservoir. The applicator further includes a valve member and a dispensing member co-operating with at least the first end of the shaft. The valve member is retained within the sleeve of the cap comprising a substantially flexible shaft having a first end projecting from said sleeve exterior. The valve member is flexibly operable against a bias at said first end to move from a first substantially closed position to a second open position to allow displacement of a quantity of liquid from within the sleeve, onto the dispensing member, for subsequent application. | 01-14-2010 |
Richard John Newson, Hastings NZ
Patent application number | Description | Published |
---|---|---|
20120230866 | CONTAINER TREATMENT - A method of decontaminating a freight container comprising the steps of: a) placing a freight container on a support; b) using an enclosure to substantially enclose the container on the support; and c) applying heat so that hot air moves within the enclosure around at least upright ends, sides and a roof of the container to kill or substantially weaken undesired life forms on or immediately adjacent to the exterior of the container. | 09-13-2012 |
Robert S. Newson, Berkshire GB
Patent application number | Description | Published |
---|---|---|
20100228784 | Methods and Systems for Single Instance Storage of Asset Parts - Methods and systems are disclosed that relate to single instance storage of asset parts utilizing a back reference count associated with each asset part. Entries in a journal associated with the asset parts reflect the intention to increment or decrement an asset part's back reference count. The journal may be used to maintain an accurate and reliable reference count for asset parts replicated across multiple disk drives in a distributed storage system, where the replication is structured to reduce the risk of data loss in the event of a disk drive failure. The journal entries may comprise generation numbers used to maintain a back reference count associated with an asset part and to verify a back reference count associated with an asset part. | 09-09-2010 |
20130151810 | HYBRID HASH TABLES - A hash table system having a first hash table and a second hash table is provided. The first hash table may be in-memory and the second hash table may be on-disk. Inserting an entry to the hash table system comprises inserting the entry into the first hash table, and, when the first hash table reaches a threshold load factor, flushing entries into the second hash table. Flushing the first hash table into the second hash table may comprise sequentially flushing the first hash table segments into corresponding second hash table segments. When looking up a key/value pair corresponding to a selected key in the hash table system, the system checks both the first and second hash tables for values corresponding to the selected key. The first and second hash tables may be divided into hash table segments and collision policies may be implemented within the hash table segments. | 06-13-2013 |
Robert S. Newson, Windsor GB
Patent application number | Description | Published |
---|---|---|
20100215175 | METHODS AND SYSTEMS FOR STRIPE BLIND ENCRYPTION - Methods and systems are disclosed that relate to encrypting data of a data item for storing in a data storage system comprising a plurality of disks having stripes. A blinding factor is constructed based on a stripe blind that is assigned to a stripe with which the data item is associated and a unique identifier associated with the data item. A first logic operation is performed between the blinding factor and an encryption key to create a blinded encryption key for the data item. The data item is decrypted by identifying the stripe blind with the unique identifier and recreating the data item's blinding factor based on the stripe blind and the unique identifier. A second logic operation, which is selected based on the first logic operation, is performed between the blinding factor and the blinded encryption key to recreate the encryption key. | 08-26-2010 |
20100217931 | MANAGING WORKFLOW COMMUNICATION IN A DISTRIBUTED STORAGE SYSTEM - In a data storage system having a plurality of storage nodes storing replicas of stripes, one storage node serves as a primary stripe node for a stripe. Client applications using the data storage system request operations affecting metadata stored in the stripe, and the data storage system creates workflow objects to implement the requested operation. Once the operation is completed, the workflow is acknowledged. A method for establishing a new primary stripe node comprises performing, by a selected storage node, a feasibility determination to determine the feasibility of the selected storage node becoming the new primary stripe node. It is feasible to become a new primary stripe node when doing so does not cause workflows that have been acknowledged, or that will be acknowledged, to result in strays. | 08-26-2010 |
20100217953 | HYBRID HASH TABLES - A hash table system having a first hash table and a second hash table is provided. The first hash table may be in-memory and the second hash table may be on-disk. Inserting an entry to the hash table system comprises inserting the entry into the first hash table, and, when the first hash table reaches a threshold load factor, flushing entries into the second hash table. Flushing the first hash table into the second hash table may comprise sequentially flushing the first hash table segments into corresponding second hash table segments. When looking up a key/value pair corresponding to a selected key in the hash table system, the system checks both the first and second hash tables for values corresponding to the selected key. The first and second hash tables may be divided into hash table segments and collision policies may be implemented within the hash table segments. | 08-26-2010 |
20110202506 | FOLDERING BY STABLE QUERY - Instead of adding resources into a folder by specifying a list of identifiers, client applications add resources to a folder by specifying a search query that matches the resources to be added. The virtual folder is, therefore, a collection of search queries rather than a collection of resource identifiers. This allows the data archive systems to easily store folder information in a database. A client application can then search by specifying the folder as its search criteria to list all content associated with the folder. Additionally, to ensure that the list of results associated with a particular query does not change after the query is added into a folder, the data archive system also captures generation information associated with the particular query (i.e., the iteration of the search indexes at the time the query is received) and stores the generation information with the query as part of the folder. | 08-18-2011 |