Abstract: Packet-processing circuitry including one or more flow caches whose contents are managed using a cache-entry replacement policy that is implemented based on one or more updatable counters maintained for each of the cache entries. In an example embodiment, the implemented policy enables the flow cache to effectively catch and keep elephant flows by giving to the caught elephant flows appropriate preference in terms of the cache dwell time, which can beneficially improve the overall cache-hit ratio and/or packet-processing throughput. Some embodiments can be used to implement an Open Virtual Switch (OVS). Some embodiments are advantageously capable of implementing the cache-entry replacement policy with very limited additional memory allocation.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: The disclosure provides a method of continuous dyeing with reactive dyes in wet conditions, the method including: 1) adding fabric to a mixture of a dye liquor and an alkali through a one-bath-one-step method; 2) immersing the fabric pretreated in 1) in a padding liquor with an air film horizontal pad dyeing machine; 3) preheating the fabric after being treated in 2) at a temperature of 50-90° C.; and 4) rolling and batching the fabric after being treated in 3) at a temperature of 10-70° C. for 2-72 hours.

Abstract: The present disclosure relates to a color temperature adjustment method of a display. The display is a transparent display. The color temperature adjustment method includes: detecting current color temperature data of a background environment right behind the display, obtaining a color temperature compensation coefficient of the display, calculating a target color temperature of the display according to the color temperature data of the background environment and the color temperature compensation coefficient, obtaining a gamma voltage corresponding to the target color temperature, controlling the display to adjust the color temperature of the display to the target color temperature according to the obtained gamma voltage. The present disclosure further relates to a computer readable storage medium. As such, the color temperature of the transparent display may accurately be adjusted, and the user experience may be improved.

Abstract: A method of adjusting brightness of a display panel includes a database creation step: storing attenuation data and a plurality of first brightness gain factors in a database. The attenuation data is performance attenuation data of a functional device of a display panel, and the first brightness gain factors are provided to display brightness of the display panel. A retrieving step: retrieving the attenuation data and the first brightness gain factors from the database. An adjustment step: adjusting the first brightness gain factors according to the attenuation data to obtain a plurality of second brightness gain factors.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child nodes represented by leaf nodes of the binary tree with JVET, wherein coding efficiency is improved by taking advantage of the similarity of coding modes 2 and 66.

Abstract: A method of decoding JVET video includes receiving a bitstream that includes encoded video data that includes encoded video data. From the encoded data, a horizontal predictor and a vertical predictor for a pixel in the current coding block may be interpolated. A coding block size may be identified to determine whether to use equal weight or unequal weights to apply to each of the horizontal and vertical predictors for calculating a final planar prediction value P(x,y) by comparing the coding block size to a coding block size threshold.

Abstract: A method of decoding JVET video includes receiving a bitstream indicating how a coding tree unit was partitioned into coding units, and parsing said bitstream to generate at least one predictor based on an intra prediction mode signaled in the bitstream. The predictor may be generated by interpolating neighboring pixels for each pixel within a coding block. The computation may be more accurate by deriving a value for a bottom right neighboring pixel.

Abstract: A method of decoding JVET video that includes receiving a bitstream indicating how a coding tree unit was partitioned into coding units, and parsing said bitstream to generate at least one predictor based on an intra prediction mode signaled in the bitstream, the intra prediction mode selected from a plurality of intra prediction modes for calculating a prediction pixel P[x,y] at coordinate x,y for the coding unit. A number of intra prediction modes available for coding the coding unit are reduced by replacing two or more non-weighted intra prediction modes by a weighted intra prediction mode.

Abstract: A second level intra prediction mode can be combined with one or more of sixty-seven JVET intra prediction modes during encoding of a coding unit in a video bitstream. Embodiments include making a position dependent intra prediction combination (PDPC) mode available as the second level intra prediction mode. In embodiments, when a PDPC (position dependent intra prediction combination) mode is enabled, the second level intra prediction is combined with one of the 67 selected intra predictor modes. In embodiments, the PDPC mode is only enabled or available for a predetermined subset of intra prediction modes (out of 67 possible modes), in order to reduce encoder complexity and potentially improve coding efficiency. The PDPC mode may be identifies as enabled or available by a list of modes or signaling in the video bitstream.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method for inter-coding video is provided in which transmission bandwidth requirements associated with second motion vectors for bi-directional temporal prediction is reduced. In the method motion vector information for only one of the two motion vectors for bi-directional temporal prediction can be transmitted together with information on how to derive or construct the second motion vector. Thus, rather than sending express information regarding two motion vectors, express information related to only one motion vector along with information related to reconstruction/derivation of the second motion vector is transmitted, thus reducing bandwidth requirements and increasing coding efficiency.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.