Fast and scalable architectures and methods adaptable to available resources, that (1) compute 2-D convolutions using 1-D convolutions, (2) provide fast transposition and accumulation of results for computing fast cross-correlations or 2-D convolutions, and (3) provide parallel computations using pipelined 1-D convolvers. Additionally, fast and scalable architectures and methods that compute 2-D linear convolutions using Discrete Periodic Radon Transforms (DPRTs) including the use of scalable DPRT, Fast DPRT, and fast 1-D convolutions.

The present disclosure provides a method, apparatus, medium, and electronic device for evaluating environmental noise of device. The method comprises obtaining original image data to be displayed; determining at least part of the original image data to be displayed as source data; obtaining comparison data according to the source data; obtaining a difference value according to the comparison data and the source data; and evaluating environmental noise of device according to the difference value.

A traffic flow forecasting method based on Deep graph Gaussian processes includes: S1, with respect to the dynamics existing in a spatial dependency, using an attention kernel function to describe a dynamic dependency among vertices on a topological graph, and using the attention kernel function as a covariance function in an Aggregation Gaussian process to extract dynamic spatial features; S2, obtaining a Temporal convolutional Gaussian process from weights at different times and a convolution function that obeys the Gaussian processes, and obtaining temporal features in traffic data by combining the Aggregation Gaussian process; S3, constructing a Deep graph Gaussian process method integrating a Gaussian process and a depth structure from the Aggregation Gaussian process, the Temporal convolutional Gaussian process and a Gaussian process with a linear kernel function, inputting a data sample to be forecasted into the Deep graph Gaussian process method to obtain a forecasted result.

Techniques are described for cognitive defined network management (CDNM) that seek to perform real-time collection and analysis of raw network data from across a disaggregated wireless network and to dynamically orchestrate network management functions substantially in real time, accordingly. For example, a multi-modal artificial intelligence (AI) engine is trained to normalize the heterogeneous raw network data into homogeneous so-called “golden record data.” A repository of historical golden records can be maintained for generating data models for use in training AI network management applications. An orchestrator can operate to directing execution of pre-developed network management workflows based on results obtained from querying the trained AI network management applications with newly received (real-time) golden records.

Provided are an integrated circuit chip apparatus and a related product, the integrated circuit chip apparatus being used for executing a multiplication operation, a convolution operation or a training operation of a neural network. The present technical solution has the advantages of a small amount of calculation and low power consumption.

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.

Disclosed is a convolution operator system for performing a convolution operation concurrently on an image. An input router receives image data. A controller allocates image data to a set of computing blocks based on the size of the image data and number of available computing blocks. Each computing block produces a convolution output corresponding to each row of the image. The controller allocates a plurality of group having one or more computing blocks to generate a set of convolution output. Further, a pipeline adder aggregates the set of convolution output to produce an aggregated convolution output. An output router transmits either the convolution output or the aggregated convolution output for performing subsequent convolution operation to generate a convolution result for the image data.

An advisor distribution system may include an advisor management system, which may include various software modules. The advisor management system may allow for a balanced distribution of a plurality of advisors operating a plurality of advisor computing devices into multiple groups based on value of a Mahalanobis Distance between each covariate of the plurality of advisors operating the plurality of advisor computing devices.

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 pointwise convolution output channels. Therefore, the storage space for storing intermediate results may be reduced.

A method with dynamic convolution includes: determining kernel adaptation weights corresponding to weight matrices in a category set represented by a plurality of predetermined discrete values; determining a unified kernel based on the weight matrices and the kernel adaptation weights corresponding to the weight matrices; and performing a convolution operation based on the unified kernel.