Patents by Inventor Gerald Arnold
Gerald Arnold 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: 20240090532Abstract: The present disclosure provides, inter alia, a method for making a solid fermented product useful for animal feed comprising the steps of adding a source of calcium to a fermented liquid comprising ammonium lactate.Type: ApplicationFiled: November 21, 2023Publication date: March 21, 2024Inventors: Tony ARNOLD, Michael DE VETH, Aaron HANKE, Gerald POPPY, Brant WINDHAM
-
Patent number: 9280331Abstract: A request handler may receive a request for a make operation for generating executable code from a plurality of source files and associated dependences there between, the source files and associated dependences having been previously utilized to generate a previous version of the executable code. A hash comparator may then determine, for a selected source file, that a current hash value corresponding to current content of the selected source file is different from a previous hash value corresponding to previous content of the selected source file during the previous utilization, whereupon the hash comparator may proceed to initiate execution of the make operation using the current content of the selected source file, based on the difference between the current hash value and the previous hash value.Type: GrantFiled: May 9, 2014Date of Patent: March 8, 2016Assignee: SAP SEInventors: Gerald Arnold, Henrik Hempelmann
-
Publication number: 20150324178Abstract: A request handler may receive a request for a make operation for generating executable code from a plurality of source files and associated dependences there between, the source files and associated dependences having been previously utilized to generate a previous version of the executable code. A hash comparator may then determine, for a selected source file, that a current hash value corresponding to current content of the selected source file is different from a previous hash value corresponding to previous content of the selected source file during the previous utilization, whereupon the hash comparator may proceed to initiate execution of the make operation using the current content of the selected source file, based on the difference between the current hash value and the previous hash value.Type: ApplicationFiled: May 9, 2014Publication date: November 12, 2015Inventors: Gerald Arnold, Henrik Hempelmann
-
Patent number: 8924867Abstract: A system may include reception of a request from a Web browser identifying source code and a computing platform, creation of a build environment corresponding to the identified computing platform, executing a build based on the source code, using the second build environment, to create build output, and transmission, to the Web browser, of a Web page including the build output.Type: GrantFiled: November 10, 2010Date of Patent: December 30, 2014Assignee: SAP SEInventor: Gerald Arnold
-
Publication number: 20120117491Abstract: A system may include reception of a request from a Web browser identifying source code and a computing platform, creation of a build environment corresponding to the identified computing platform, executing a build based on the source code, using the second build environment, to create build output, and transmission, to the Web browser, of a Web page including the build output.Type: ApplicationFiled: November 10, 2010Publication date: May 10, 2012Inventor: Gerald Arnold
-
Patent number: 6954633Abstract: The SMS messages of a mobile telephone are used to call up information which is unconnected in time and location with the mobile telephone. To specify the desired information and to define the brief commands the user of the mobile telephone uses data-processing equipment with data lines to the information provider, e.g. Internet connection, by means of which he can deposit query profiles with the information provider. In addition, the query profiles can be produced using a speech computer. The user can call up the dormant query profiles by means of simple brief commands and obtain the required information. The desired information will be reproduced either visually or acoustically via the mobile telephone. The advantages of both communication media are therefore combined with one another in an ideal manner, where the hardware of the mobile telephone and/or its method of operation remain unchanged.Type: GrantFiled: October 20, 1998Date of Patent: October 11, 2005Assignee: International Business Machines CorporationInventors: Jorg Metternich, Gerald Arnold, Michael Ehrmantraut, Stefan Akerblom
-
Patent number: 6785278Abstract: Methods systems and computer program products are provided for hashing address values that exhibit banding in a plurality of regions of an address space defined by at least two segments of the address values, by performing at least one of a translation and a rotation of the at least two segments to thereby map the at least two segments from the plurality of regions to one of the plurality of regions.Type: GrantFiled: December 10, 1998Date of Patent: August 31, 2004Assignee: International Business Machines CorporationInventors: Jean Louis Calvignac, Marco C. Heddes, Clark Debs Jeffries, Ross Boyd Leavens, Gerald Arnold Marin, Piyush Chunilal Patel, Atef Omar Zaghloul
-
Patent number: 6633585Abstract: A method and system within a telecommunications network for allocating available bandwidth among a plurality of sessions that share a common data link. First, a repeating unit time interval is designated for conducting the plurality of sessions. Next, the input flow rate from the source node of each of the sessions into the common data link is monitored. Thereafter, a target flow rate is computed and assigned to each of the sessions. The sum of the target flow rates is equal to the available bandwidth of the common data link. Finally, for each of the sessions in which the monitored input flow rate exceeds the assigned target flow rate, the source node is dynamically paused during each repeating unit time interval, such that the monitored input flow rate conforms to the assigned target flow rate for each of the sessions.Type: GrantFiled: August 13, 1999Date of Patent: October 14, 2003Assignee: International Business Machines CorporationInventors: Anoop Ghanwani, Metin Aydemir, Clark Debs Jeffries, Gerald Arnold Marin, Norman Clark Strole, Ken Van Vu
-
Patent number: 6185187Abstract: A data transfer flow control system includes a plurality of nodes or switches in a network, which are interconnected by transmission links. Resource management cells are transmitted along with data cells in information transfer sessions. As the amount of session traffic at any node increases, the level of occupancy of the buffers for that node correspondingly increases to temporarily store overflow data. At every network node, a “fair share” cell rate is determined for each output transmission link. Whenever the current cell rate (CCR) of any session exceeds the fair share cell rate for the output link at a node, the buffer occupancy threshold values for setting congestion indication fields in the resource management cells are adjusted downwardly such that a lower threshold buffer occupancy will effect a traffic congestion setting for that session.Type: GrantFiled: December 10, 1997Date of Patent: February 6, 2001Assignee: International Business Machines CorporationInventors: Anoop Ghanwani, Gerald Arnold Marin, Ken Van Vu
-
Patent number: 6035333Abstract: A bin packing algorithm is employed to schedule computer network activities, such as pause times required for operation of an Ethernet network which implements existing IEEE 802.3x standards. In such a network, any node in the network can control the flow of traffic from upstream stations in order to avoid congestion at the flow-controlling node. Upon sensing congestion, the flow-controlling node determines how long each upstream node contributing to the congestion should pause transmission over the next control interval. In accordance with the invention, the pause times are scheduled or staggered by using the bin packing algorithm to sort the sources into one or more bins. One required bin property is that there is no overlap in pause times for the sources within a particular bin. Another required bin property is that the sum of the pause times within a bin can be no greater than the length of the control interval.Type: GrantFiled: November 24, 1997Date of Patent: March 7, 2000Assignee: International Business Machines CorporationInventors: Clark Debs Jeffries, Anoop Ghanwani, Gerald Arnold Marin, Ken Van Vu
-
Patent number: 5995570Abstract: An apparatus and method allow two or more members of a network, connected in multipoint-multipoint manner, to synchronize their local service clocks. Overall synchronization is achieved as soon as every member within the network transports its own timing information to other members of the group, plus the maximum propagation delay between the group members, and accordingly minimizes the possibility of overruns and underruns at each node end. Such synchronization is implemented when all members of a network synchronize their internal clocks to a lowest clock frequency within the network.Type: GrantFiled: June 27, 1997Date of Patent: November 30, 1999Assignee: International Business Machines CorporationInventors: Raif O. Onvural, Gerald Arnold Marin
-
Patent number: 5936940Abstract: An enhanced adaptive rate-based congestion control system for packet transmission networks uses the absolute rather than the relative network queuing delay measure of congestion in the network. Other features of the congestion control system include test transmissions only after a predetermined minimum time, after the receipt of an acknowledgment from the previous test, or transmission of a minimum data burst, whichever takes longest. The congestion control system also provides a small reduction in rate at low rates and a large reduction in rates at high rates. A logarithmic rate control function provides this capability. Rate damping is provided by changing all of the values in a rate look-up tables in response to excessive rate variations. Finally, the fair share of the available bandwidth is used as the starting point for rates at start-up or when a predefined rate damping region is exited.Type: GrantFiled: August 22, 1996Date of Patent: August 10, 1999Assignee: International Business Machines CorporationInventors: Gerald Arnold Marin, Lap T. Huynh, Ken Van Vu, Raif O. Onvural, Levent Gun, Bouchung Lin
-
Patent number: 5909443Abstract: An explicit rate algorithm is disclosed for use in an end-to-end closed loop flow control algorithm for an ATM network which carries at least constant bit rate (CBR) traffic, variable bit rate (VBR) traffic and adjustable bit rate (ABR) traffic. The algorithm determines how much additional bandwidth is available for ABR traffic on an output link from a node and produces an explicit rate variable that can be forwarded to a source for the ABR traffic. Both the maximum and minimum bandwidths already reserved for all connections on the output link are determined. A single reserved bandwidth value is chosen within the range defined by the maximum and minimum reserved bandwidth values. The current utilization of the ABR input buffer for the node is also determined. The explicit rate variable is generated as a function of the link capacity, the reserved bandwidth value and the current utilization of the ABR input buffer.Type: GrantFiled: January 3, 1997Date of Patent: June 1, 1999Assignee: International Business Machines CorporationInventors: Aline Fichou, Serge Fdida, Claude Galand, Gerald Arnold Marin, Raif O. Onvural, Ken Van Vu