Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: A video distribution system synchronizes video output streams on multiple encoders without communication therebetween. Each of the encoders is configured to decode a source video content stream into a sequence of uncompressed frames, where each frame in the sequence is marked with an associated presentation time stamp (PTS) clock value. The encoders calculate a number of clock cycles between instantaneous decoder refresh (IDR)-frames. For each frame in the sequence, the encoders calculate a remainder after a division of an associated PTS clock value of a given frame by the number of clock cycles between IDR-frames. The encoders mark each frame in the sequence as an IDR-frame where the corresponding remainder is strictly less than the number of PTS clock cycles per frame and mark a remainder of the frames in the sequence as an internal frame within a group of pictures (GOP) to produce a marked set of video frames.

Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: A video distribution system minimizes bandwidth use between a headend and a remote video distribution center through an origin segmentation server and an edge segmentation server. The origin segmentation server is located at the headend and creates segments and playlists for every video stream originating at the headend. An edge segmentation server is located at the remote video distribution center and receives a request for a playlist of a content stream from CPE. The edge segmentation server joins a multicast group with the content stream and requests the playlist from the origin segmentation server. The edge segmentation server constructs a second playlist with a predetermined final number of segments from the playlist to return to the CPE, generates segments from the content stream received from the headend, identifies and obtains missing segments from the origin segmentation server, and updates the second playlist with the missing segments and segments generated by the edge segmentation server.

Abstract: A video distribution system synchronizes video output streams on multiple encoders without communication therebetween. Each of the encoders is configured to decode a source video content stream into a sequence of uncompressed frames, where each frame in the sequence is marked with an associated presentation time stamp (PTS) clock value. The encoders calculate a number of clock cycles between instantaneous decoder refresh (IDR)-frames. For each frame in the sequence, the encoders calculate a remainder after a division of an associated PTS clock value of a given frame by the number of clock cycles between IDR-frames. The encoders mark each frame in the sequence as an IDR-frame where the corresponding remainder is strictly less than the number of PTS clock cycles per frame and mark a remainder of the frames in the sequence as an internal frame within a group of pictures (GOP) to produce a marked set of video frames.

Abstract: A video distribution system synchronizes video output streams on multiple encoders without communication therebetween. Each of the encoders is configured to decode a source video content stream into a sequence of uncompressed frames, where each frame in the sequence is marked with an associated presentation time stamp (PTS) clock value. The encoders calculate a number of clock cycles between instantaneous decoder refresh (IDR)-frames. For each frame in the sequence, the encoders calculate a remainder after a division of an associated PTS clock value of a given frame by the number of clock cycles between IDR-frames. The encoders mark each frame in the sequence as an IDR-frame where the corresponding remainder is strictly less than the number of PTS clock cycles per frame and mark a remainder of the frames in the sequence as an internal frame within a group of pictures (GOP) to produce a marked set of video frames.

Abstract: A video distribution system minimizes bandwidth use between a headend and a remote video distribution center through an origin segmentation server and an edge segmentation server. The origin segmentation server is located at the headend and creates segments and playlists for every video stream originating at the headend. An edge segmentation server is located at the remote video distribution center and receives a request for a playlist of a content stream from CPE. The edge segmentation server joins a multicast group with the content stream and requests the playlist from the origin segmentation server. The edge segmentation server constructs a second playlist with a predetermined final number of segments from the playlist to return to the CPE, generates segments from the content stream received from the headend, identifies and obtains missing segments from the origin segmentation server, and updates the second playlist with the missing segments and segments generated by the edge segmentation server.

Abstract: A video distribution system synchronizes video output streams on multiple encoders without communication therebetween. Each of the encoders is configured to decode a source video content stream into a sequence of uncompressed frames, where each frame in the sequence is marked with an associated presentation time stamp (PTS) clock value. The encoders calculate a number of clock cycles between instantaneous decoder refresh (IDR)-frames. For each frame in the sequence, the encoders calculate a remainder after a division of an associated PTS clock value of a given frame by the number of clock cycles between IDR-frames. The encoders mark each frame in the sequence as an IDR-frame where the corresponding remainder is strictly less than the number of PTS clock cycles per frame and mark a remainder of the frames in the sequence as an internal frame within a group of pictures (GOP) to produce a marked set of video frames.

Abstract: Multiple segmentation servers are synchronized to provide failover capacity in such a way that should a failover occur, the segment numbers/playlists/encryption keys/decryption keys are identical on each of the segmentation servers. Synchronizing the contents of a segmentation server on one or more backup segmentation servers ensures that the delivery of a content stream is immune to the failure of segmentation servers, provided at least one segmentation server remains fault-free. A caching server may further facilitate the fault tolerance by checking the availability of the individual segmentation servers, collect content segments from one of the segmentation servers, and serve the content segment to clients. The caching server automatically checks a primary segmentation server to ensure it is available (e.g., online), and provides automatic failover to a backup segmentation server should the primary server experience a fault (e.g., go offline).

Abstract: Various embodiments of methods and systems for buffering a video stream to smooth out the variable bit rate in an MPEG 2 transport stream to a capped bit rate, while not causing packet loss on the network, and allowing the streams to pass through a bit rate constrained IP network are disclosed. One method includes conditioning a variable bit rate video content stream such that the frames are packed back to back into a constant bit rate stream such that filler packets are not required to approximate a constant bit rate. The packed video content stream, having a constant bit rate due to portions of the frames being packed into a given transmission segment, may be transmitted across a channel in a constant bit rate network.

Abstract: A machine for laundry has a drum shaft rotatably mounted by a bearing for driving a laundry drum and having a device for determining loading-relevant characteristic variables or an unbalance of the laundry drum or of the drum shaft. The device for determining loading-relevant characteristic variables or an unbalance includes a magnetic field sensor that senses a magnetized region on the drum shaft or the laundry drum.

Abstract: The present invention provides a method to compress digital moving pictures or video signals based on an overcomplete basis transform using a modified Matching Pursuit algorithm. More particularly, this invention focuses on the efficient coding of the motion residual image, which is generated by the process of motion estimation and compensation. A residual energy segmentation algorithm (RESA) can be used to obtain an initial estimate of the shape and position of high-energy regions in the residual image. A progressive elimination algorithm (PEA) can be used to reduce the number of matching evaluations in the matching pursuits process. RESA and PEA can speed up the encoder by many times for finding the matched basis from the pre-specified overcomplete basis dictionary. Three parameters of the matched pattern form an atom, which defines the index into the dictionary and the position of the selected basis, as well as the inner product between the chosen basis pattern and the residual signal.

Abstract: A washing machine includes a liquor container suspended for oscillating in a housing. A washing drum is rotatable within the liquor container. A material-elastic collar is connected for establishing a liquid tight seal on the edge of a front-side loading opening of the liquor container, connecting with a housing-side loading opening, and with a door mounted for sealing the housing-side loading opening. A filling element is located on the door and has a curved outward portion in the shape of a truncated cone. The filling element has a surface area with at least one recess commencing close to a largest diameter of the cone portion, and forms a rising surface of sickle shape in the direction of the interior of the drum and toward a smallest diameter of the cone on the surface area thereof.

Abstract: A machine for laundry has a drum shaft rotatably mounted by a bearing for driving a laundry drum and having a device for determining loading-relevant characteristic variables or an unbalance of the laundry drum or of the drum shaft. The device for determining loading-relevant characteristic variables or an unbalance includes a magnetic field sensor that senses a magnetized region on the drum shaft or the laundry drum.

Abstract: A washing machine includes a liquor container suspended for oscillating in a housing. A washing drum is rotatable within the liquor container. A material-elastic collar is connected for establishing a liquid tight seal on the edge of a front-side loading opening of the liquor container, connecting with a housing-side loading opening, and with a door mounted for sealing the housing-side loading opening. A filling element is located on the door and has a curved outward portion in the shape of a truncated cone. The filling element has a surface area with at least one recess commencing close to a largest diameter of the cone portion, and forms a rising surface of sickle shape in the direction of the interior of the drum and toward a smallest diameter of the cone on the surface area thereof.

Abstract: The present invention provides a method to compress digital moving pictures or video signals based on an overcomplete basis transform using a modified Matching Pursuit algorithm. More particularly, this invention focuses on the efficient coding of the motion residual image, which is generated by the process of motion estimation and compensation. A residual energy segmentation algorithm (RESA) can be used to obtain an initial estimate of the shape and position of high-energy regions in the residual image. A progressive elimination algorithm (PEA) can be used to reduce the number of matching evaluations in the matching pursuits process. RESA and PEA can speed up the encoder by many times for finding the matched basis from the pre-specified overcomplete basis dictionary. Three parameters of the matched pattern form an atom, which defines the index into the dictionary and the position of the selected basis, as well as the inner product between the chosen basis pattern and the residual signal.

Abstract: The present invention provides IP-centric, multi-channel, time-shifted and real-time telecommunications services to a plurality of system users. The system can capture both digital and analog multi-channel feeds and, through a cross-connect layer, can convert the signals to a digital format and subsequently send them to an encoder to be compressed. The encoding process can use a firmware upgradeable software developed to decrease data bitrates while retaining quality of the information at a desired level. The encoded, compressed signals may either be stored on a data-on-demand server for later viewing services, such as television/video-on-demand or audio-on-demand, or may be streamed directly to system users using a Media Streaming Subsystem (MSS). The MSS can be responsive to a system user request and operative to forward a selected stream of compressed digital data to the system user via a gateway means.