Abstract: There is provided, in accordance with an embodiment of the present invention, a system, platform and method to provide Automatic Inventory, VMI visibility and predictability, and automated Recipe generation and costing in a purchase management system. In one embodiment an automated inventory management system includes a food sales data source associated with a sales processing software; a food waste data source associated with products related to the sales data source; an order management system associated with food merchandise supply processing software; a recipe database including multiple recipes with associated raw material data, designed to extract raw material compositions from items ordered off a food product menu; and an automated inventory system adapted to automatically manage raw material based on sale data and purchase data, and to provide substantially real time inventory data.

Abstract: There is provided, in accordance with an embodiment of the present invention, a system, platform and method to provide shared order management based on a shared order platform used by buyers and suppliers. In some embodiments the order management platform includes an order server in a communications cloud, coupled to an order database; a shared order platform adapted to facilitate usage by one or more authorized buyers and/or suppliers, wherein the shared order platform includes a shared structured document with order related data layers; and a tokenized link with an address linking to the shared order platform, where the tokenized link is adapted to allow entry into the shared order platform via entering a page defined within the tokenized link.

Abstract: There is provided, in accordance with an embodiment of the present invention, a system, platform and method to provide shared order management based on a shared order platform used by buyers and suppliers. In some embodiments the order management platform includes an order server in a communications cloud, coupled to an order database; a shared order platform adapted to facilitate usage by one or more authorized buyers and/or suppliers, wherein the shared order platform includes a shared structured document with order related data layers; and a tokenized link with an address linking to the shared order platform, where the tokenized link is adapted to allow entry into the shared order platform via entering a page defined within the tokenized link.

Abstract: Apparatus and method for performing IEEE-rounded floating-point division utilizing Goldschmidt's algorithm. The use of Newton's method in computing quotients requires two multiplication operations, which must be performed sequentially, and therefore incurs waiting delays and decreases throughput. Goldschmidt's algorithm uses two multiplication operations which are independent and therefore may be performed simultaneously via pipelining. Unfortunately, current error estimates for Goldschmidt's algorithm are imprecise, requiring high-precision multiplication operations for stability, thereby reducing the advantages of the pipelining. A new error analysis provides improved methods for estimating the error in the Goldschmidt algorithm iterations, resulting in reductions in the hardware, improved pipeline organization, reducing the number and length of clock cycles, reducing latency, and increasing throughput.

Abstract: An IEEE floating-point adder (FP-adder) design. The adder accepts normalized numbers, supports all four IEEE rounding modes, and outputs the correctly normalized rounded sum/difference in the format required by the IEEE Standard. The latency of the design for double precision is roughly 24 logic levels, not including delays of latches between pipeline stages. Moreover, the design can be easily partitioned into two stages comprised of twelve logic levels each, and hence, can be used with clock periods that allow for twelve logic levels between latches. The FP-adder design achieves a low latency by combining various optimization techniques, including a non-standard separation into two paths, a simple rounding algorithm, unifying rounding cases for addition and subtraction, sign-magnitude computation of a difference based on one's complement subtraction, compound adders, and fast circuits for approximate counting of leading zeros from borrow-save representation.