Patent classifications
G06F7/22
Clustering sub-care areas based on noise characteristics
A care area is determined in an image of a semiconductor wafer. The care area is divided into sub-care areas based on the shapes of polygons in a design file associated with the care area. A noise scan of a histogram for the sub-care areas is then performed. The sub-care areas are clustered into groups based on the noise scan of the histogram.
Clustering sub-care areas based on noise characteristics
A care area is determined in an image of a semiconductor wafer. The care area is divided into sub-care areas based on the shapes of polygons in a design file associated with the care area. A noise scan of a histogram for the sub-care areas is then performed. The sub-care areas are clustered into groups based on the noise scan of the histogram.
METHOD FOR HIERARCHICAL CLUSTERING OVER LARGE DATA SETS USING MULTI-OUTPUT MODELING
A method for hierarchical clustering includes receiving a large set of data, training an algorithm to find patterns in the received data that most accurately predict the outcomes, and generating a multi-output model to maximize the cluster quality of a set of features. The data include at least two binary drivers and one binary need, the drivers predict the value of the need, and the data include at least two outcomes.
DEVICE AND METHOD FOR PICKING UP TOP K VALUES
The application discloses a device and a method for picking up top k values from N values. The method comprises: A) controlling a buffer to receive values into a data pool until the number of values in the data pool reaches the predetermined memory size; B) dividing the values in the data pool into a first portion and a second portion based on their comparison to an adjustable threshold value until the number of values in the first portion falls into a predetermined range; C) discarding the values in the second portion and controlling the buffer to continue to receive values into the data pool until the number of values in the data pool reaches the predetermined memory size again or the buffer has received all the N values; D) repeating steps B to C until the buffer has received all the N values; E) dividing the values in the data pool into the first portion and the second portion based on their comparison to the adjustable threshold value, until the number of values in the first portion reaches k; and F) controlling the buffer to output the k values in the first portion as the top k values.
System and method for increasing utilization of dot-product based neural network accelerator
A method of flattening channel data of an input feature map in an inference system includes retrieving pixel values of a channel of a plurality of channels of the input feature map from a memory and storing the pixel values in a buffer, extracting first values of a first region having a first size from among the pixel values stored in the buffer, the first region corresponding to an overlap region of a kernel of the inference system with channel data of the input feature map, rearranging second values corresponding to the overlap region of the kernel from among the first values in the first region, and identifying a first group of consecutive values from among the rearranged second values for supplying to a first dot-product circuit of the inference system.
Method and device of heap sorting based on a memory device
The present application relates to a heap sorting method based on arrangement and apparatus which can improve the heap sorting conducting speed through reducing access (I/O) frequency of the external memory when conducting heap sorting through storing binary data in the basic access unit of the external memory device in reference to the subtree unit.
Method and device of heap sorting based on a memory device
The present application relates to a heap sorting method based on arrangement and apparatus which can improve the heap sorting conducting speed through reducing access (I/O) frequency of the external memory when conducting heap sorting through storing binary data in the basic access unit of the external memory device in reference to the subtree unit.
Machine Learning Computer
A computer comprising a plurality of processing units, each processing unit having an execution unit and access to computer memory which stores code executable by the execution unit and input values of an input vector to be processed by the code, the code, when executed, configured to access the computer memory to obtain multiple pairs of input values of the input vector, determine a maximum or corrected maximum input value of each pair as a maximum result element, determine and store in a computer memory a maximum or corrected maximum result of each pair of maximum result elements as an approximation to the natural log of the sum of the exponents of the input values and access the computer memory to obtain each input value and apply it to the maximum or corrected maximum result to generate each output value of a Softmax output vector.
Machine Learning Computer
A computer comprising a plurality of processing units, each processing unit having an execution unit and access to computer memory which stores code executable by the execution unit and input values of an input vector to be processed by the code, the code, when executed, configured to access the computer memory to obtain multiple pairs of input values of the input vector, determine a maximum or corrected maximum input value of each pair as a maximum result element, determine and store in a computer memory a maximum or corrected maximum result of each pair of maximum result elements as an approximation to the natural log of the sum of the exponents of the input values and access the computer memory to obtain each input value and apply it to the maximum or corrected maximum result to generate each output value of a Softmax output vector.
Windscreen wiper device
A windscreen wiper device comprising an elastic, elongated carrier element, as well as an elongated wiper blade of a flexible material, which can be placed in abutment with a windscreen to be wiped, which wiper blade includes opposing longitudinal groove on its longitudinal sides, in which grooves spaced-apart longitudinal strips of the carrier element are disposed, wherein neighboring ends of said longitudinal strips are interconnected by a respective connection piece, which windscreen wiper device comprises a connecting device for an oscillating arm, wherein said oscillating arm is pivotally connected to said connecting device about a pivot axis near one end, with the interposition of a joint part, wherein said joint part comprises at least one resilient tongue engaging in a correspondingly shaped hole provided in said oscillating arm, and wherein said resilient tongue is rotatable along an hinge axis between an outward position retaining the wiper blade onto the oscillating arm and an inward position releasing the wiper blade form the oscillating arm, characterized in that said resilient tongue is forced in the outward position under the influence of a moment in case a force is exerted on the wiper blade in a direction away from the oscillating arm.