Abstract: A fault detection method for a rotating machine based on sparse time synchronous averaging is disclosed, and the method includes: collecting a vibration signal and a rotating frequency or rotating frequency pulse signal of the rotating machine and performing analog-to-digital conversion to obtain the vibration signal and rotating speed information by a sensor; according to the type and number of detection components in the rotating machine, constructing a component-aware comb vector g based on the vibration signal and rotating speed information, wherein the type includes the gear, rotor and bearing; constructing a quasi-time synchronous average vector w based on the component-aware comb vector g; constructing a sparse time synchronous averaging model F by using the quasi-time synchronous average vector w; solving the sparse time synchronous averaging model F with an optimization solution algorithm to obtain a sparse spectrum and a reconstruction time signal.

Abstract: A method for preparing a high viscosity index poly-?-olefin subjects ?-olefin to a polymerization reaction in the presence of a metallocene catalyst to obtain a poly-?-olefin. The polymerization reaction is carried out in the absence of a solvent, and the metallocene catalyst is formed of, or is formed by interaction between, a metallocene compound and an activator.

Abstract: A method for data stripping, allocation and reconstruction in an active drive storage system including a plurality of active object storage devices, each of the plurality of active object storage devices including one or more storage devices and a controller is provided. The method includes the controller of the identified one of the plurality of active object storage devices segmenting the received data into a plurality of data chunks and generating one or more parity chunks in response to the plurality of data chunks. The method further includes the controller of the identified one of the plurality of active object storage devices reorganizing the plurality of data chunks and the one or more parity chunks in response to a number of the plurality of data chunks and a number of the one or more of the plurality of active object storage devices into which the received data is to be stored.

Abstract: A method for defining an erasure code for system having a predetermined number of data disks is disclosed. The method includes selecting step, constructing step, determining step and repeating step. The selecting step includes selecting a predetermined acceptable number of failures for the system. The constructing step includes constructing a first Tanner graph for two failures acceptable system having predetermined number of data disks. The determining step includes determining erasure code from the first Tanner graph. The repeating step includes repeating the constructing step and the determining step by increasing the acceptable number of failures by one and constructing another Tanner graph in response to the increased acceptable number of failures by increasing number of parity nodes until the predetermined number of failures for the system is reached.

Abstract: A method for data stripping, allocation and reconstruction in an active drive storage system including a plurality of active object storage devices, each of the plurality of active object storage devices including one or more storage devices and a controller is provided. The method includes the controller of the identified one of the plurality of active object storage devices segmenting the received data into a plurality of data chunks and generating one or more parity chunks in response to the plurality of data chunks. The method further includes the controller of the identified one of the plurality of active object storage devices reorganizing the plurality of data chunks and the one or more parity chunks in response to a number of the plurality of data chunks and a number of the one or more of the plurality of active object storage devices into which the received data is to be stored.

Abstract: A method for defining an erasure code for system having a predetermined number of data disks is disclosed. The method includes selecting step, constructing step, determining step and repeating step. The selecting step includes selecting a predetermined acceptable number of failures for the system. The constructing step includes constructing a first Tanner graph for two failures acceptable system having predetermined number of data disks. The determining step includes determining erasure code from the first Tanner graph. The repeating step includes repeating the constructing step and the determining step by increasing the acceptable number of failures by one and constructing another Tanner graph in response to the increased acceptable number of failures by increasing number of parity nodes until the predetermined number of failures for the system is reached.