Abstract: A video decoder can be configured to determine that a current block in a current picture of the video data is coded in an affine prediction mode; determine one or more control-point motion vectors (CPMVs) for the current block; identify an initial prediction block for the current block in a reference picture using the one or more CPMVs; determine a current template for the current block in the current picture; and determine an initial reference template for the initial prediction block in the reference picture; and perform a motion vector refinement process to determine a modified prediction block based on a comparison of the current template to the initial reference template.

Abstract: A method for exchanging data among several enterprise management systems includes receiving and processing data sent by a first system, and recording a task of writing data to a second system in a database of an electronic device, and setting the recorded task as unfinished task. A list of unfinished tasks is acquired from the database in predetermined time period, and a result of query can be generated by searching or interrogating the second system as to the list of unfinished tasks. When the second system has finished the task, the task for writing data in the second system is set as finished.

Abstract: Techniques for processing video data are described. The techniques include determining a first partition and a second partition for a current block coded in geometric partition mode, determining a first and second prediction block based on a first and second motion vector, blending the first prediction block and the second prediction block based on weights indicative of an amount to scale samples in the first prediction block and the second prediction block to generate a final prediction block, dividing the current block into a plurality of sub-blocks, determining a set of sub-blocks that each include at least one sample that corresponds to a prediction sample in the final prediction block that was generated based on equal weighting of a sample in the first prediction block and a sample in the second prediction block, and storing respective bi-prediction motion vectors for each sub-block in the determined set of sub-blocks.

Abstract: Systems and methods are described for video coding using generalized bi-prediction. In an exemplary embodiment, to code a current block of a video in a bitstream, a first reference block is selected from a first reference picture and a second reference block is selected from a second reference picture. Each reference block is associated with a weight, where the weight may be an arbitrary weight ranging, e.g., between 0 and 1. The current block is predicted using a weighted sum of the reference blocks. The weights may be selected from among a plurality of candidate weights. Candidate weights may be signaled in the bitstream or may be derived implicitly based on a template. Candidate weights may be pruned to avoid out-of-range or substantially duplicate candidate weights. Generalized bi-prediction may additionally be used in frame rate up conversion.

Abstract: An example device includes memory configured to store the video data and one or more processors implemented in circuitry and communicatively coupled to the memory. The one or more processors are configured to determine at least one of a temporal candidate or a history-based candidate and determine at least one non-adjacent candidate, wherein the at least one non-adjacent candidate is from a unit that is not adjacent to a current prediction unit (PU). The one or more processors are configured to determine an advanced motion vector predictor (AMVP) candidate list including the at least one of the temporal candidate or the history-based candidate and the at least one non-adjacent candidate. The at least one non-adjacent candidate is added to the AMVP candidate list after the temporal candidate or before the history-based candidate. The one or more processors are configured to code the current PU based on the AMVP candidate list.

Abstract: A PET hydrolase having improved thermal stability is disclosed. The PET hydrolase has a modified amino acid sequence of SEQ ID NO: 2 or a modified amino acid sequence with at least 80% sequence identity of SEQ ID NO: 2, wherein the modification is a substitution of asparagine at position 248 or a corresponding position with proline.

Abstract: A data-processing device is provided. The data-processing device includes: a flash memory, a computation unit, and a flash-memory controller. The flash-memory controller is electrically connected to the computation unit, and configured to control access to the flash memory. The flash-memory controller allocates a first execute-only memory (XOM) setting and a second XOM setting in a first memory bank and a second memory bank of the flash memory, respectively. The flash-memory controller allocates one or more XOM spaces in the flash memory according to the first XOM setting or the second XOM setting.

Abstract: Disclosed methods include placing a semiconductor wafer containing MRAM devices into a first magnetic field that has a magnitude sufficient to magnetically polarize MRAM bits and has a substantially uniform field strength and direction over the entire area of the wafer. The method further includes placing the wafer in a second magnetic field having an opposite field direction, a substantially uniform field strength and direction over the entire area of the wafer, and magnitude less than a design threshold for MRAM bit magnetization reversal. The method further includes determining a presence of malfunctioning MRAM bits by determining that such malfunctioning MRAM bits have a magnetic polarization that was reversed due to exposure to the second magnetic field. Malfunctioning MRAM bits may further be characterized by electrically reading data bits, or by using a chip probe to read one or more of voltage, current, resistances, etc., of the MRAM devices.

Abstract: A video decoder obtains a first triangle merging index syntax element specifying a first triangle merging candidate index. The first triangle merging candidate index indicates a first triangle merging candidate of a triangular shape-based motion compensation candidate list. The video decoder may determine whether the maximum number of triangle merging candidates is greater than 2. Based on the maximum number of triangle merging candidates not being greater than 2, the video decoder may infer that a second triangle merging candidate index indicates a second triangle merging candidate of the triangular shape-based motion compensation candidate list without obtaining any syntax element specifying the second triangle merging candidate index from the bitstream, the second triangle merging candidate being different from the first triangle merging candidate.

Abstract: The present invention provides a vibration sensor, which comprises a circuit board having an accommodating space. A sensing assembly is disposed in the accommodating space. A recess for magnet sliding is disposed in the sensing assembly. Dispose a magnet in the recess and then dispose a coil layer on an arbitrary side or both sides of the sensing assembly. Furthermore, a lubricating layer is coated on the recess. Alternatively, the recess can be a vacuum structure or a hollow cross-sectional structure for reducing the friction between the recess and the magnet. Alternatively, the coil layer can be coated with a protective layer or multiple layers can be stacked. Without increasing the area of the sensor, the sensing on the variation of magnetic flux can be improved. Accordingly, the vibration sensor according to the present invention can achieve wideband detection of vibrations.

Abstract: An example device for decoding video data includes a memory configured to store video data; and one or more processors configured to: decode data representing an initial motion vector for a current block of the video data, the initial motion vector having integer-motion vector difference (MVD) precision; determine a search range around a reference area identified by the initial motion vector in a reference picture; perform a template matching search process in the search range to identify a best matching region; determine error values for neighboring pixels to the best matching region; use the error values for the neighboring pixels to perform a model-based fractional-pixel motion vector refinement to derive motion vector difference values; apply at least one of the motion vector difference values to the initial motion vector to determine a refined motion vector for the current block; and decode the current block using the refined motion vector.

Abstract: A video decoder can be configured to determine, for a block of video data encoded in a geometric partition mode, an angle for the block for the geometric partition mode; determine a separation line displacement relative to a center of the block for the geometric partition mode; partition the block into first and second partitions based on the angle and the separation line displacement; determine first predictive samples for the block using a motion vector for the first partition and second predictive samples for the block using a motion vector for the second partition; determine a power-of-2 number based on the angle for the block; determine weighting values based on the power-of-2 number; perform a blending operation on the first predictive samples and the second predictive samples based on the weighting values to determine a prediction block for the block.

Abstract: A video decoder may be configured to determine a motion vector and a motion vector precision for a current block; identify a current block template within the current picture; search within a search area for a final reference block template that corresponds to the current block template, wherein to search within the search area, the one or more processors are further configured to: identify an initial reference block template based on the motion vector, search other reference block templates around the initial reference block template using a step size that is set to an initial step size, and iteratively reduce the step size from the initial step size until the step size is set to a final step size that equals the motion vector precision; determine a prediction block for the current block based on the final reference block template.

Abstract: Example devices and techniques for multi-pass decoder-side motion vector refinement (DMVR) are disclosed. An example device includes memory configured to store video data and one or more processors coupled to the memory. The one or more processors are configured to apply a multi-pass DMVR to a motion vector for a block of the video data to determine at least one refined motion vector and decode the block based on the at least one refined motion vector. The multi-pass DMVR includes a block-based first pass, a sub-block-based second pass, and a sub-block-based third pass.

Abstract: A method of decoding video data includes determining that bi-directional optical flow (BDOF) is enabled for a block of the video data; dividing the block into a plurality of sub-blocks based on the determination that BDOF is enabled for the block, determining, for each sub-block of one or more sub-blocks of the plurality of sub-blocks, respective distortion values, determining that one of per-pixel BDOF is performed or BDOF is bypassed for each sub-block of the one or more sub-blocks of the plurality of sub-blocks based on the respective distortion values, determining prediction samples for each sub-block of the one or more sub-blocks based on the determination of per-pixel BDOF being performed or BDOF being bypassed, and reconstructing the block based on the prediction samples.

Abstract: Systems and methods are described for video coding using generalized bi-prediction. In an exemplary embodiment, to code a current block of a video in a bitstream, a first reference block is selected from a first reference picture and a second reference block is selected from a second reference picture. Each reference block is associated with a weight, where the weight may be an arbitrary weight ranging, e.g., between 0 and 1. The current block is predicted using a weighted sum of the reference blocks. The weights may be selected from among a plurality of candidate weights. Candidate weights may be signaled in the bitstream or may be derived implicitly based on a template. Candidate weights may be pruned to avoid out-of-range or substantially duplicate candidate weights. Generalized bi-prediction may additionally be used in frame rate up conversion.

Abstract: A method of encoding and decoding video data, including coding a first syntax element that specifies a value used to derive a maximum number of intra block copy merging candidates, deriving the maximum number of intra block copy merging candidates based on the value of the first sytnax element, and coding a first block of video data using intra block copy mode according to the maximum number of intra block copy merging candidates.

Abstract: A method of decoding video data may comprise decoding data from an encoded bitstream to generate motion vectors and performing a decoder-side motion vector refinement (DMVR) process on one or more of the motion vectors. Performing the DMVR process may include determining one or more characteristics of current video block being decoded and determining a search area for the DMVR process for the current video block based on the determined one or more characteristics of the current video block.

Abstract: Techniques are described for history-based candidate list operations in video coding for determining motion information for a current block. In one example, a device for decoding video data includes a memory configured to store a history-based candidate list and a video decoder. The video decoder is configured to construct the history-based candidate list by storing, in the memory, motion information of reconstructed blocks into the history-based candidate list as candidates of the history-based candidate list, identify a subset of candidates of the history-based candidate list, generate a candidate list based on the identified subset of candidates of the history-based candidate list, and reconstruct a current block based on the generated candidate list.

Abstract: An example device for decoding video data includes a memory configured to store the video data and one or more processors implemented in circuitry and coupled to the memory. The one or more processors are configured to determine a first distance index associated with a first geometric partition mode (GEO) angle for a first prediction unit (PU) of the video data to be 4. The one or more processors are configured to determine a first displacement value based on the first distance index, the first displacement value being indicative of a distance from a center of the first PU to a GEO split. The one or more processors are configured to decode the first PU based on the first GEO angle and the first displacement value. The first displacement value is half of a displacement value associated with a distance index of 2.