Abstract: A device for in memory vector-matrix multiplication includes a memory array and in-memory logic. The memory array has at least two sections and stores a multiplier matrix. The memory array also receives and stores an input multiplicand arranged in a vector such that the operands of the vector-matrix multiplication are located on a same column of the memory array. Each of the sections is one of: a volatile memory array, a non-volatile memory array, a destructive memory array and a non-destructive memory array. The in-memory logic computes an output of the vector-matrix multiplication using the stored input vector and the stored multiplier matrix. The memory array is one of the following type of memory array: RAM, DRAM, SRAM, Re-RAM, ZRAM, MRAM and Memristor.

Abstract: A cascading search system includes an associative memory array, a similarity match processor and an exact match processor. The columns of the array store a plurality of multiportion data vectors and have a first section, for a first portion of a vector, a second section for storing a second portion of a vector and a match row. The similarity match processor performs a parallel similarity search of a similarity query in the first sections and stores a match bit indication in the match row of the column. Each match bit indication indicates if its column has a first portion which matches the similarity query. The exact match processor performs an exact search in parallel in the second section of each similarity matched column whose match bit indication indicates a match of its first section and outputs those similarity matched columns whose second portions match the exact query.

Abstract: A system to dynamically calculate a root hash value from a plurality of leaf hash values includes a flat associative memory and a hash parser. The flat associative memory stores a plurality of leaf hash values. The hash parser extracts a compressed number of branch nodes from the plurality of leaf hash values, determines branch node relationships from the plurality of leaf hash values, and saves the compressed number of branch nodes, and the branch node relationships.

Abstract: A unit for accumulating a plurality N of multiplied M bit values includes a receiving unit, a bit-wise multiplier and a bit-wise accumulator. The receiving unit receives a pipeline of multiplicands A and B such that, at each cycle, a new set of multiplicands is received. The bit-wise multiplier bit-wise multiplies bits of a current multiplicand A with bits of a current multiplicand B and to sum and carry between bit-wise multipliers. The bit-wise accumulator accumulates output of the bit-wise multiplier thereby to accumulate the multiplicands during the pipelining process.

Abstract: An associative memory array includes a plurality of associative memory cells arranged in rows and columns where each first cell in a first row and in a first column has access to a content of a second cell in a second row in an adjacent column.

Abstract: A bulk feed tank has a boot unloader through which feed is directed into a supply system having at least one conveyor housing an auger. The boot unloader includes an unloader body formed of front, rear and opposing side panels forming a rectangular receiving portion. An auger mounting plate is mounted to the front panel and mates with the conveyor. A bearing assembly is secured to the rear panel and rotatably mounts the auger such that the auger passes through the receiving portion. A clear access door is attached to at least one of the opposing side panels. A wear plate assembly is attached to an. The wear plate assembly is fastened to the front, rear and side panels under the boot unloader body and can be removed without unfastening the side panels from the front panel and the rear panel or removing the auger from the receiving portion.

Abstract: A ceiling vent assembly incudes a ceiling vent having a pair of opposed end panels and a pair of opposed side panels, which define a frame that is open at its top and bottom. The frame receives two louvers pivotally mounted so as to be movable between open and closed positions. The ceiling vent assembly also includes first and second cables attached to the first and second louvers and a pulley assembly having a pair of vertically-oriented pulleys and a center pulley block having at least one horizontal pulley. The horizontal pulley has two vertically offset cable guides. Control rods pass through aligned rod openings in the end panels and pulley block. The pulley block has cable routing holes adjacent to each of the cable guides.

Abstract: A system for training a neural-network-based floating-point-to-binary feature vector encoder preserves the locality relationships between samples in an input space over to an output space. The system includes a neural network under training and a probability distribution loss function generator. The neural network has floating-point inputs and floating-point pseudo-bipolar outputs. The generator compares an input probability distribution constructed from floating-point cosine similarities of an input space and an output probability distribution constructed from floating-point pseudo-bipolar pseudo-Hamming similarities of an output space. The system includes a proxy vector set generator to take a random sampling of vectors from training data for a proxy set, a sample vector selector to select sample vectors from the training data and a KNN vector set generator to find a set of k nearest neighbors closest to each sample vector from said proxy set for a reference set.

Abstract: A memory cell and processing array that has a plurality of memory are capable of performing logic functions, including an exclusive OR (XOR) or an exclusive NOR (XNOR) logic function. The memory cell may have a read port in which the digital data stored in the storage cell of the memory cell is isolated from the read bit line.

Abstract: A method for an associative memory device includes storing a plurality of pairs of multi-bit operands X and Y in rows of a memory array of the associative memory device, each pair in a different column of the memory array. Cells in a column are connected by a first bit-line providing a value of activated cells and a second bit-line providing an inverse value of the activated cells. The bits of X are stored in first rows and the bits of Y are stored in second rows. The method includes reading an inverse value of a bit stored in each of the second rows using the second bit-line, writing it to third rows and concurrently, on all columns, performing multi-bit add operations between a value of X, an inverse value of Y and a carry-in bit initiated to 1, providing the difference between X and Y in each of the columns.

Abstract: A ceiling vent assembly has a frame that is open at its top and bottom and a pair of louvers pivotably mounted in the frame such that each louver pivots between an open position and a closed position relative to the frame. Each louver has a pivot end, wherein the pivot end is located adjacent to but spaced apart from the pivot end of a second louver of the pair of louvers. The ceiling vent assembly has a sealing mechanism with a flange extending from the pivot end of each louver of the pair of louvers, wherein the flange from the first louver contacts the flange from the second louver in a space between the louvers such that the sealing mechanism reduces the flow of air through the space when the first and second louvers are in either the open or closed positions.

Abstract: A method for in memory computation of a neural network, the neural network having weights arranged in a matrix, includes previously storing the matrix in an associated memory device, receiving an input arranged in a vector and storing it in the memory device, and in-memory, computing an output of the network using the input and the weights.

Abstract: A fan assembly for use in a sidewall of an animal house. The fan assembly includes an impeller, a motive force configured to rotate the impeller about a fan assembly axis, and a butterfly shutter. A shutter operation mechanism moves the butterfly doors of the shutter between the closed position and the open position in synchrony with an operating speed of the impeller. The shutter operating mechanism includes pushrods connected to the butterfly doors, and a linkage between the impeller and the second pushrods. The linkage includes at least one weight configured to rotate with the impeller about the fan assembly axis, wherein rotation of the at least one weight causes the linkage to exert a force on the pushrods to push the butterfly doors toward the open position when the impeller is rotating.

Abstract: A method for an associative memory device includes storing a plurality of pairs of N-bit numbers A and B to be added together in columns of a memory array of the associative memory device, each pair in a column, each bit in a row of the column, and dividing each N-bit number A and B into groups containing M bits each, having group carry-out predictions for every group except a first group, the group carry-out predictions calculated for any possible group carry-in value, and, once the carry-out value for a first group is calculated, selecting the next group carry out value from the group carry-out predictions. The method also includes repeating the ripple selecting group carry-out values, until all group carry out values have been selected.

Abstract: A ceiling vent assembly has a frame and a pair of louvers pivotably mounted in the frame such that each of the louvers pivots between an open position and a closed position. Each of the louvers has a pivot end, wherein the pivot end of a first louver of the pair of louvers is located adjacent to but spaced apart from the pivot end of a second louver of the pair of louvers. The ceiling vent has a sealing mechanism positioned in the space between the first and second louvers so as to press on the pivot ends of the first and second louvers such that the sealing mechanism reduces the flow of air through the space. When the first and second louvers pivot between the open and closed positions, the pivot end of the first and second louvers slide relative the sealing mechanism.

Abstract: A method for the decontamination of water containing one or more PFAS, having the steps of generating colloidal gas aphrons (CGAs) by mixing a gas, water, and one or more surfactants together with high shear forces, introducing the CGAs and a PFAS-containing water in an enclosed space where the CGAs move upwards through the water due to their inherent buoyancy, allowing the plurality of CGAs to extract PFAS from the water, and separating the PFAS-containing CGAs from the surface of the water in the enclosed space for further treatment or disposal, leaving the water with lower PFAS concentrations in the vessel. The aphrons may be anionic or cationic and created by mixing speeds or surfactant concentration, and treatment may be with gas bubbles to remove PFAS from water gas bubbles or destruction of PFAS by plasma reactor or deployed in situ through wells into geologic ground formations.

Abstract: A method to determine an extreme value of a plurality of data candidates includes storing each data candidate of a plurality of data candidates in a separate column of an associative memory, initializing a row of marker bits by setting each marker bit to a value of 1, computing a subsequent row of marker bits by performing in parallel a Boolean AND operation between a previous row of marker bits and a row of bits of the data candidates, starting with the row of most significant bits of the data candidates, performing a Boolean OR operation between the marker bits in the subsequent row of marker bits to generate a subsequent RSP value, identifying the extreme value from among the plurality of data candidates when there is only one marker bit having a value of 1 in the subsequent row of marker bits coinciding with when said subsequent RSP value is a 1, and if the identifying is false, repeating the computing on a row of next most significant bits, performing and identifying until the identifying is true.

Abstract: A system for measuring similarity between a binary query vector and a plurality of binary candidate vectors includes a storage unit and a processor. The storage unit stores the binary query vector and the plurality of candidate vectors, and the processor performs Tanimoto calculations in terms of Hamming distances. The processor includes a Tanimoto to Hamming threshold converter, a Hamming measurer, and a Hamming comparator. The Tanimoto to Hamming threshold converter converts a Tanimoto threshold into a Hamming threshold. The Hamming measurer measures the Hamming distances between the candidate vectors and the query vector. The Hamming comparator selects candidate vectors whose Hamming distance from the query vector is less than or equal to the Hamming threshold.

Abstract: A non-destructive memory array implements a full adder. The array includes a column connected by a bit line and a full adder unit. The column stores a first bit in a first row of the bit line, a second bit in a second row of the bit line, and an inverse of a carry-in bit in a third row of the bit line. The full adder unit stores, in the second and third rows of the bit line, a sum bit and a carry out bit output, respectively, of adding the first bit, the second bit and the carry-in bit. The full adder unit does not overwrite any of the bits when a full adder table indicates that the sum bit and the carry out bit are equivalent to the second bit and the carry-in bit.

Abstract: A system for performing cascading search includes an associative memory array, a controller, a similarity search processor and an exact match processor. The associative memory array stores a plurality of multiportion data vectors stored in at least one column of the associative memory array. Each vector has a first portion and a second portion which are aligned to each other in the column. The controller controls the associative memory array to perform a similarity search of a similarity query on the first portion and an exact search of an exact query on the second portion. The similarity match processor generates a match row including match bit indications aligned with each similarity matched column. The match row indicates which columns have first portions which match to the similarity query. The exact match processor outputs exact match columns from among the similarity matched columns which have second portions which match the exact query.