501 results about "Single group" patented technology

Allocation process that allows erasure coded data to be stored on any of a plurality of disk drives, in a pool of drives, so that the allocation is not tied to a fixed group of drives. Still further, the encoded data can be generated by any of multiple different erasure coding algorithms, where again storage of the encoded data is not restricted to a single group of drives based on the erasure algorithm being utilized to encode the data. In another embodiment, the encoded data can be “stacked” (aligned) on select drives to reduce the number of head seeks required to access the data. As a result of these improvements, the system can dynamically determine which one of multiple erasure coding algorithms to utilize for a given incoming data block, without being tied to one particular algorithm and one particular group of storage devices as in the prior art.

A system and method for semantic segmentation using hybrid dilated convolution (HDC) are disclosed. A particular embodiment includes: receiving an input image; producing a feature map from the input image; performing a convolution operation on the feature map and producing multiple convolution layers; grouping the multiple convolution layers into a plurality of groups; applying different dilation rates for different convolution layers in a single group of the plurality of groups; and applying a same dilation rate setting across all groups of the plurality of groups.

Novel biologically active compounds of the general formula (I) in which one of X and X′ represents a polymer, and the other represents a hydrogen atom; each Q independently represents a linking group; W represents an electron-withdrawing moiety or a moiety preparable by reduction of an electron-withdrawing moiety; or, if X′ represents a polymer, X-Q-W— together may represent an electron withdrawing group; and in addition, if X represents a polymer, X′ and electron withdrawing group W together with the interjacent atoms may form a ring; each of Z1 and Z2 independently represents a group derived from a biological molecule, each of which is linked to A and B via a nucleophilic moiety; or Z1 and Z2 together represent a single group derived from a biological molecule which is linked to A and B via two nucleophilic moieties; A is a C1-5 alkylene or alkenylene chain; and B is a bond or a C1-4 alkylene or alkenylene chain; are formed by conjugating a suitable polymer to a suitable biologically active molecule via nucleophilic groups in said molecule, preferably via a disulphide bridge.

A method for monitoring traffic in a packet switched network. The packet switched network includes connections grouped in a single group; token buffers for respectively corresponding to the connections, and storing tokens generated at a predetermined token generation rate by the corresponding connection; a shared token pool for being shared among the connections, and storing the generated tokens therein when each token buffer of each connection is over a predetermined maximum size; and counters for respectively corresponding to the connections, and counting tokens stored in the shared token pool by a corresponding connection. The method for monitoring traffic in the packet switched network includes the steps of: a) providing data buffers for respectively corresponding to the connections and storing a packet of a contract-following connection in case of a temporary deficiency of a network resource; b) if a token buffer of a corresponding connection is over a predetermined maximum size and the shared token pool is over its own predetermined maximum size, storing tokens generated during a token generation time in the shared token pool, and controlling a count value of a corresponding counter; c) checking the count value of the corresponding counter, and selectively controlling a permitted buffer size of a data buffer of a corresponding connection upon receiving the checking result of the count value of the corresponding counter; and d) checking a token buffer of a corresponding connection and a shared token pool if a packet reaches the corresponding connection or is present in a data buffer of the corresponding connection, and selectively storing a received packet in a corresponding data buffer according to a count value of a corresponding counter if there is no token in the token buffer of the corresponding connection and the shared token pool.