Patents by Inventor Peter Meulemans
Peter Meulemans has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20070109366Abstract: An ink jet device with an ink reservoir and a jetting assembly, with an ink supply line being arranged to allow liquid ink to flow through the valve into the ink reservoir in accordance with and supported by gravity acting on the flowing ink, and a purging device adapted to apply a purging pressure to an inner space of the ink reservoir, wherein a passive one-way valve is arranged below a nominal minimal fill level (L) of the ink reservoir for blocking a connection of the ink supply line to the ink reservoir when a pressure within the ink reservoir is high enough but not required to be higher than the purging pressure.Type: ApplicationFiled: November 13, 2006Publication date: May 17, 2007Inventors: Peter Meuleman, Christian Van Zoest
-
Patent number: 7136888Abstract: A logic circuit such as a parallel counter comprises logic for generating output bits as elementary symmetric functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of a binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.Type: GrantFiled: July 27, 2001Date of Patent: November 14, 2006Assignee: Arithmatica LimitedInventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Patent number: 7044325Abstract: This invention relates to a container consisting of a thermoplastic material, with side walls, flat top and bottom panels of which the top panel is provided with at least one fill/drain opening, and with a continuous circumferential carrying and transport rim. For better utilization of pallet space, the container body has an approximately square cross-section with slightly convex lateral surfaces and slightly radiused corners. In order to counteract the inherent tendency of the flat container walls to bulge and buckle, the container body is provided with vertical and/or horizontal reinforcement elements.Type: GrantFiled: May 31, 2001Date of Patent: May 16, 2006Assignee: Mauser-Werke GmbH & Co. KGInventors: Dietmar Przytulla, Wilhelm Peter Meuleman
-
Patent number: 7042246Abstract: Logic circuit generating four binary outputs as four threshold functions of four binary inputs, including: first, second, third, and fourth threshold functions which are respectively high if at least one, two, three and all of the binary inputs are high; first logic having two logic parts that each include NOR and NAND gates, and having two first-level inputs for receiving the binary inputs and two first-level outputs; and second logic having four second-level outputs, four second-level inputs for receiving second-level binary inputs and connected to the four first-level outputs, NAND gate, first gate generating logical OR combinations and NAND combining the logical OR combination with two other second-level binary inputs, a second gate generating logical OR combinations of two pairs of second-level binary inputs and NAND combining the logical OR combinations, and a NOR gate; wherein one of four binary outputs is generated at each of the four outputs.Type: GrantFiled: February 11, 2004Date of Patent: May 9, 2006Assignee: Arithmatica LimitedInventors: Sunil Talwar, Dmitriy Rumynin, Peter Meulemans
-
Patent number: 6971540Abstract: A barrel body with a cross-section surface that approaches the shape of a square with slightly embossed side surfaces and rounded corner areas. The barrel body can be equipped with stiffening elements that run vertically and/or horizontally.Type: GrantFiled: March 15, 2000Date of Patent: December 6, 2005Assignee: Mauser-Werke GmbH & Co. KGInventors: Dietmar Przytulla, Wilhelm Peter Meuleman
-
Patent number: 6938061Abstract: A parallel counter comprises logic for generating output bits as symmetrical functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinatins of each bit of a binary number with each other bit of another binary number is generated having a reduced from in order to reduce the steps required in array reduction.Type: GrantFiled: August 11, 2000Date of Patent: August 30, 2005Assignee: Arithmatica LimitedInventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Patent number: 6883011Abstract: A parallel counter comprises logic for generating output bits as symmetrical functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of a binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.Type: GrantFiled: January 25, 2001Date of Patent: April 19, 2005Assignee: Arithmatica LimitedInventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Publication number: 20050021585Abstract: A logic circuit such as a parallel counter comprises logic for generating output bits as elementary symmetric functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.Type: ApplicationFiled: April 2, 2004Publication date: January 27, 2005Inventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Publication number: 20040223400Abstract: Logic circuit generating four binary outputs as four threshold functions of four binary inputs, including: first, second, third, and fourth threshold functions which are respectively high if at least one, two, three and all of the binary inputs are high; first logic having two logic parts that each include NOR and NAND gates, and having two first-level inputs for receiving the binary inputs and two first-level outputs; and second logic having four second-level outputs, four second-level inputs for receiving second-level binary inputs and connected to the four first-level outputs, NAND gate, first gate generating logical OR combinations and NAND combining the logical OR combination with two other second-level binary inputs, a second gate generating logical OR combinations of two pairs of second-level binary inputs and NAND combining the logical OR combinations, and a NOR gate; wherein one of four binary outputs is generated at each of the four outputs.Type: ApplicationFiled: February 11, 2004Publication date: November 11, 2004Inventors: Sunil Talwar, Dmitriy Rumynin, Peter Meulemans
-
Patent number: 6628215Abstract: A method and apparatus for state assignment of a logic circuit comprises receiving internal state representations for the logic circuit, determining binary code for the internal state representations by successively dividing the states into disjoint sets of ever decreasing size Each disjoint set of a pair is assigned a one bit at each division step. The division can continue for all bits to be encoded, or the division can be halted and exact encoding used for the encoding of the final number of bits.Type: GrantFiled: January 29, 2001Date of Patent: September 30, 2003Assignee: Automatic Parallel Design LimitedInventors: Sunil Talwar, Peter Meulemans
-
Publication number: 20030140077Abstract: A logic circuit for performing modular multiplication of a first multi-bit binary number and a second multi-bit binary number is provided. Combination logic combines the second multi-bit binary value with a group of W bits of the first multi-bit binary value every jth input cycle to generate W multi-bit binary combination values every jth input cycle, where the W bits comprise bits jW to (jW+W−1), W>1, j is the cycle index from 0 to k−1, k=N/W, and N is the number of bits of the first multi-bit binary value. Thus in this way a plurality of multi-bit binary combinations are input every cycle in a parallel manner. Accumulation logic holds a plurality of multi-bit binary values accumulated over previous cycles. Reduction logic generates a W bit value &Lgr; in a current cycle for use in the next cycle. A multi-bit modulus binary value is received and combined with the W bit value &Lgr; generated in a current cycle to generate W multi-bit binary values for use in the next cycle.Type: ApplicationFiled: December 20, 2001Publication date: July 24, 2003Inventors: Oleg Zaboronski, Peter Meulemans
-
Publication number: 20020078110Abstract: A logic circuit such as a parallel counter comprises logic for generating output bits as elementary symmetric functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of a binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.Type: ApplicationFiled: July 27, 2001Publication date: June 20, 2002Inventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Publication number: 20020026465Abstract: A parallel counter comprises logic for generating output bits as symmetrical functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of a binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.Type: ApplicationFiled: January 25, 2001Publication date: February 28, 2002Inventors: Dmitriy Rumynin, Sunil Talwar, Peter Meulemans
-
Publication number: 20010044708Abstract: A method and apparatus for state assignment of a logic circuit comprises receiving internal state representations for the logic circuit, determining binary code for the internal state representations by successively dividing the states into disjoint sets of ever decreasing size Each disjoint set of a pair is assigned a one bit at each division step. The division can continue for all bits to be encoded, or the division can be halted and exact encoding used for the encoding of the final number of bits.Type: ApplicationFiled: January 29, 2001Publication date: November 22, 2001Inventors: Sunil Talwar, Peter Meulemans
-
Publication number: 20010025854Abstract: This invention relates to a container consisting of a thermoplastic material, with side walls, flat top and bottom panels of which the top panel is provided with at least one fill/drain opening, and with a continuous circumferential carrying and transport rim. For better utilization of pallet space, the container body has an approximately square cross-section with slightly convex lateral surfaces and slightly radiused corners. In order to counteract the inherent tendency of the flat container walls to bulge and buckle, the container body is provided with vertical and/or horizontal reinforcement elements.Type: ApplicationFiled: May 31, 2001Publication date: October 4, 2001Inventors: Dietmar Przytulla, Wilhelm Peter Meuleman