Abstract: A method for preparing 3,3?-diaminobenzidine, the method comprising the following steps: subjecting 4,4?-biphenol and N,N-dimethylsulfamoyl chloride to an esterification reaction in a specified solvent at 40-70° C. to obtain 4,4?-biphenyl bis(N,N-dimethylaminosulfonate) as a first intermediate; subjecting the 4,4?-biphenyl bis(N,N-dimethylaminosulfonate) to a chlorination reaction with a chlorinating reagent under acidic conditions to obtain 3,3?-dichloro-4,4?-biphenyl bis(N,N-dimethylaminosulfonate) as a second intermediate; subjecting the second intermediate 3,3?-dichloro-4,4?-biphenyl bis(N,N-dimethylaminosulfonate) to an ammonolysis reaction with anammoniation reagent in the presence of a combined catalyst to obtain a crude product of 3,3?,4,4?-tetraaminobiphenyl, wherein the combined catalyst is a mixture of proline, a cuprous salt and a phase transfer catalyst; and subjecting the crude product of 3,3?,4,4?-tetraaminobiphenyl to a post-treatment to obtain a purified 3,3?,4,4?-tetraaminobiphenyl product.

Abstract: A method for preparing-3,3?-diaminobenzidine, the method comprising the following steps: subjecting 4,4?-biphenol and N,N-dimethylsulfamoyl chloride to an esterification reaction in a specified solvent at 40-70° C. to obtain 4,4?-biphenyl bis(N,N-dimethylaminosulfonate) as a first intermediate; subjecting the 4,4?-biphenyl bis(N,N-dimethylaminosulfonate) to a chlorination reaction with a chlorinating reagent under acidic conditions to obtain 3,3?-dichloro-4,4?-biphenyl bis(N,N-dimethylaminosulfonate) as a second intermediate; subjecting the second intermediate 3,3?-dichloro-4,4?-biphenyl bis(N,N-dimethylaminosulfonate) to an ammonolysis reaction with anammoniation reagent in the presence of a combined catalyst to obtain a crude product of 3,3?,4,4?-tetraaminobiphenyl, wherein the combined catalyst is a mixture of proline, a cuprous salt and a phase transfer catalyst; and subjecting the crude product of 3,3?,4,4?-tetraaminobiphenyl to a post-treatment to obtain a purified 3,3?,4,4?-tetraaminobiphenyl product.

Abstract: An information-seeking dialogue system can be trained using a pipeline process having stages, or components, of passage retrieval (selecting passages relevant to a query from a corpus or knowledge base), re-ranking, and generating a response to the query based on one or more of the re-ranked passages. Each stage, or component, of the pipeline can be individually optimized based on ground truth data.

Abstract: Disclosed are a method and an apparatus for performing an operation of a convolutional layer in a convolutional neural network.

Abstract: Disclosed is a method for convolution calculation in a neural network, comprising: reading an input feature map, depthwise convolution kernels and pointwise convolution kernels from a dynamitic random access memory (DRAM); performing depthwise convolution calculations and pointwise convolution calculations according to the input feature map, the depthwise convolution kernels and the pointwise convolution kernels to obtain output feature values of a first predetermined number p of points on all pointwise convolution output channels; storing the output feature values of a first predetermined number p of points on all pointwise convolution output channels into an on-chip memory, wherein the first predetermined number p is determined according to at least one of available space in the on-chip memory, a number of the depthwise convolution calculation units, and width, height and channel dimensions of the input feature map; and repeating the above operation obtain output feature values of all points on all pointwis

Abstract: A method and an apparatus for adapting feature data in a convolutional neural network. The method includes selecting a plurality of consecutive layers; determining an expected number of subdata blocks and a layout position, width and height of each subdata block in an output feature data of a last layer; determining, for each current layer, a layout position, width, and height of each subdata block of an input feature data for the current layer according to the layout position, width, and height of each subdata block of the output feature data for the current layer; determining an actual position of each subdata block of the input feature data for a first layer in the input feature data for the first layer; and obtaining the expected number of subdata blocks of the input feature data for the first layer according to the actual position, width and height of each subdata block of the input feature data for the first layer.

Abstract: Disclosed are a method and an apparatus for performing convolution operation on folded feature data. The method comprises: reading the folded feature data provided to a convolution layer and an original convolution kernel from a dynamic random access memory (DRAM); pre-processing the folded feature data and the original convolution kernel; storing the pre-processed folded feature data into a static random-access memory (SRAM); folding the pre-processed original convolution kernel in at least one dimension of width or height according to a folding manner of the folded feature data to generate one or more folded convolution kernels corresponding to the original convolution kernel; storing the one or more folded convolution kernels in the SRAM; and reading the pre-processed folded feature data and the one or more folded convolution kernels from the SRAM into a calculation unit for convolving the pre-processed folded feature data with the one or more folded convolution kernels.

Abstract: Disclosed are a method and an apparatus for performing an operation of a convolutional layer in a convolutional neural network. The method includes reading unfolded-feature-data and an original convolution kernel from DRAM, padding the unfolded-feature-data, folding the padded unfolded-feature-data in at least one dimension folded feature data, storing the folded feature data into a SRAM, folding the original convolution kernel in the at least one dimension to generate one or more folded convolution kernels, storing the one or more folded convolution kernels in the SRAM and reading the folded feature data and the one or more folded convolution kernels from the SRAM into a calculation circuit for performing a convolution operation on the folded feature data by using the one or more folded convolution kernels.

Abstract: Disclosed are a method and an apparatus for adapting parameters of a neural network. The method includes selecting one or more dimensions for a weight parameter of each of at least one layer of the neural network, determining a dimension value and a corresponding target value in each dimension of the weight parameter, and padding the weight parameter in a case where the dimension value in at least one dimension of the weight parameter is less than the corresponding target value, the dimension value in each dimension of the weight parameter after the padding being equal to the corresponding target value.

Abstract: Disclosed is an apparatus for performing a convolution operation in a convolutional neural network. The apparatus may comprise a selector for selecting one or more nonzero elements of a weight parameter, a selector for selecting a data item(s) corresponding to selected nonzero elements in input feature data, and a calculator unit for performing an operation. The apparatus may realize the convolution operation in a sparsified convolutional neural network efficiently through the hardware.

Abstract: A method for data management is provided. The method comprises: storing the plurality of items in a contiguous space within the memory, executing an instruction containing an address and a size that together identify the contiguous space to transmit the plurality of items from the main memory to a random-access memory (RAM) on a chip, and the chip includes a computing unit comprising a plurality of multipliers; and instructing the computing unit on the chip to: retrieve multiple of the plurality of items from the RAM; and perform a plurality of parallel operations using the plurality of multipliers with the multiple items to yield output data.

Abstract: A method for data management is provided. The method comprises: storing the plurality of items in a contiguous space within the memory, executing an instruction containing an address and a size that together identify the contiguous space to transmit the plurality of items from the main memory to a random-access memory (RAM) on a chip, and the chip includes a computing unit comprising a plurality of multipliers; and instructing the computing unit on the chip to: retrieve multiple of the plurality of items from the RAM; and perform a plurality of parallel operations using the plurality of multipliers with the multiple items to yield output data.

Abstract: Disclosed are a method and an apparatus for accessing tensor data. The method may include determining a first row address in a first memory where one or more first data items to be accessed in a logical structure of the tensor data are stored at the first row address, copying data items at the first row address in the first memory to a first buffer row of a first buffer, moving each first data item in the first buffer row of the first buffer to a corresponding location at least in a first buffer row of a second buffer, and storing data items in the first buffer row of the second buffer into corresponding target locations in the second memory.

Abstract: Disclosed are a method and an apparatus for accessing tensor data. The method may include determining a first row address in a first memory where one or more first data items to be accessed in a logical structure of the tensor data are stored at the first row address, copying data items at the first row address in the first memory to a first buffer row of a first buffer, moving each first data item in the first buffer row of the first buffer to a corresponding location at least in a first buffer row of a second buffer, and storing data items in the first buffer row of the second buffer into corresponding target locations in the second memory.

Abstract: A method for data management is provided. The method comprises: storing the plurality of items in a contiguous space within the memory, executing an instruction containing an address and a size that together identify the contiguous space to transmit the plurality of items from the main memory to a random-access memory (RAM) on a chip, and the chip includes a computing unit comprising a plurality of multipliers; and instructing the computing unit on the chip to: retrieve multiple of the plurality of items from the RAM; and perform a plurality of parallel operations using the plurality of multipliers with the multiple items to yield output data.

Abstract: Systems and methods of data processing are provided. The method comprises receiving an input data to be processed by a series of operations, identifying a first operation from the series of operations, selecting at least one second operation from the series of operations to be grouped with the first operation based at least in part on an amount of an input data and an output data of the grouped operations and the capacity of the memory unit, and processing a portion of the input data of the grouped operations. An efficiency of the series of data operation can be improved by ensuring the input data and output data of any data operation are both stored in the memory unit.

Abstract: Disclosed is a method for convolution calculation in a neural network, comprising: reading an input feature map, depthwise convolution kernels and pointwise convolution kernels from a dynamitic random access memory (DRAM); performing depthwise convolution calculations and pointwise convolution calculations according to the input feature map, the depthwise convolution kernels and the pointwise convolution kernels to obtain output feature values of a first predetermined number p of points on all pointwise convolution output channels; storing the output feature values of a first predetermined number p of points on all pointwise convolution output channels into an on-chip memory, wherein the first predetermined number p is determined according to at least one of available space in the on-chip memory, a number of the depthwise convolution calculation units, and width, height and channel dimensions of the input feature map; and repeating the above operation obtain output feature values of all points on all pointwis

Abstract: Disclosed is a method for convolution calculation in a neural network, comprising: reading an input feature map, depthwise convolution kernels and pointwise convolution kernels from a dynamic random access memory (DRAM); performing depthwise convolution calculations and pointwise convolution calculations by depthwise convolution calculation units and pointwise convolution calculation units, according to the input feature map, the depthwise convolution kernels and the pointwise convolution kernels to obtain output feature values of a first predetermined number p of points on all pointwise convolution output channels; storing the output feature values of a first predetermined number p of points on all pointwise convolution output channels into an on-chip memory; and repeating above operation to obtain output feature values of all points on all point wise convolution output channels. Therefore, the storage space for storing intermediate results may be reduced.

Abstract: A method for data management is provided. The method comprises: storing the plurality of items in a contiguous space within the memory, executing an instruction containing an address and a size that together identify the contiguous space to transmit the plurality of items from the main memory to a random-access memory (RAM) on a chip, and the chip includes a computing unit comprising a plurality of multipliers; and instructing the computing unit on the chip to: retrieve multiple of the plurality of items from the RAM; and perform a plurality of parallel operations using the plurality of multipliers with the multiple items to yield output data.