Patents by Inventor Kevin J. Bowers
Kevin J. Bowers 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).
-
Patent number: 11973659Abstract: A system for decoding a transmission include a client device configured to receives a superposition via one or more communication links. The superposition may correspond to a transmission encoded into a plurality of fragments. The system may determine a coefficient for each fragment contained in the superposition and initialize a decoding process. The decoding process may facilitate determining a value of each fragment based on the identified coefficient of each fragment in the superposition. Advantageously, the system, through use of a the one or more communication links, may be configured to decode the transmission to derive information transmitted from a data source quickly and reliably.Type: GrantFiled: September 29, 2022Date of Patent: April 30, 2024Assignee: Jump Algorithms, LLCInventors: Kevin J. Bowers, Nicholas E. Bridge
-
Publication number: 20240097990Abstract: A system for decoding a transmission include a client device configured to receives a superposition via one or more communication links. The superposition may correspond to a transmission encoded into a plurality of fragments. The system may determine a coefficient for each fragment contained in the superposition and initialize a decoding process. The decoding process may facilitate determining a value of each fragment based on the identified coefficient of each fragment in the superposition. Advantageously, the system, through use of a the one or more communication links, may be configured to decode the transmission to derive information transmitted from a data source quickly and reliably.Type: ApplicationFiled: September 29, 2022Publication date: March 21, 2024Applicant: Jump Algorithms, LLCInventors: Kevin J. Bowers, Nicholas E. Bridge
-
Patent number: 11496370Abstract: A system for transmitting information may include a server that generates pseudo-random superpositions, each superposition including multiple packet fragments encoded using a Galois field. The system may transmit the superpositions across a plurality of communication links, which form a single logical path, to a client device. Communication links may include a combination of diverse communication channels, and more preferably one or more low latency (but low bandwidth) communication links and one or more high bandwidth (but high latency) communication links. Advantageously, the use of a plurality of communication links may facilitate transmitting information quickly and reliably.Type: GrantFiled: February 2, 2021Date of Patent: November 8, 2022Assignee: Jump Algorithms, LLCInventors: Kevin J. Bowers, Nicholas E. Bridge
-
Patent number: 10958530Abstract: A system for transmitting information over a network may include a server that generates random superpositions each including multiple packet fragments encoded using a Galois field and transmits them over multiple communication links to a client device. The packet fragments may be a plurality of fixed-size vectors that define the information to be transmitted. The server also may select a subset of the fixed-size vectors based on heuristics and generate a coefficient for each of the selected vectors. The coefficients may include any natural number. The superposition may be a sum of the selected fixed-size vectors multiplied by their associated coefficients. The server may repeat the process until the client acknowledges receipt of the information or another condition is met. The client device may then decode the received superposition, such as by solving the set of linear equations represented by the received superpositions. Other implementations also are described.Type: GrantFiled: August 29, 2019Date of Patent: March 23, 2021Assignee: Jump Algorithms, LLCInventors: Kevin J. Bowers, Nicholas E. Bridge
-
Patent number: 10824422Abstract: A method for performing computations associated with bodies located in a computation region includes, for each subset of multiple subsets of the computations, performing the computations in that subset of computations, including accepting data of bodies located in each of a plurality of import regions associated with the subset of the computations, the import regions being parts of the computation region; for each combination of a predetermined plurality of combinations of multiple of the import regions, performing computations associated with sets of bodies, wherein for each of the sets of bodies, at least one body of the set is located in each import region of the combination.Type: GrantFiled: December 19, 2011Date of Patent: November 3, 2020Assignee: D.E. Shaw Research, LLCInventors: Kevin J. Bowers, Ron Dror, David Shaw
-
Patent number: 8918305Abstract: Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion.Type: GrantFiled: March 21, 2008Date of Patent: December 23, 2014Assignee: D.E. Shaw Research, LLCInventor: Kevin J. Bowers
-
Publication number: 20120116737Abstract: A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume.Type: ApplicationFiled: December 19, 2011Publication date: May 10, 2012Applicant: D.E. Shaw Research LLCInventors: Kevin J. Bowers, Ron O. Dror, David E. Shaw, Martin M. Deneroff, Richard H. Larson, John K. Salmon
-
Patent number: 8160852Abstract: Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion.Type: GrantFiled: May 7, 2010Date of Patent: April 17, 2012Assignee: D. E. Shaw Research LLCInventor: Kevin J. Bowers
-
Patent number: 8126956Abstract: A computer-implemented method for determining computational units for computing interactions among sets of bodies located in a computation region includes, for each computation associated with one of the sets of bodies, determining, according to an assignment rule that provides a mapping from a location of each of the bodies to a determined computation unit from the plurality of computation units, a computation unit from a plurality of computation units for performing the computation.Type: GrantFiled: October 19, 2007Date of Patent: February 28, 2012Assignee: D.E. Shaw Research LLCInventors: Kevin J. Bowers, Ron O Dror, David E. Shaw
-
Patent number: 8015238Abstract: A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume.Type: GrantFiled: October 19, 2007Date of Patent: September 6, 2011Assignee: D. E. Shaw Research LLCInventors: Kevin J. Bowers, Ron O Dror, David E. Shaw, Martin Deneroff
-
Publication number: 20100280806Abstract: Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion.Type: ApplicationFiled: May 7, 2010Publication date: November 4, 2010Applicant: D.E. Shaw Research, LLCInventor: Kevin J. Bowers
-
Patent number: 7809535Abstract: A method for dynamics simulation involves maintaining quantities according to a floating point binary format quantized to a first precision lower than the precision supported by the floating point format. For example, although an IEEE floating point number can represent numbers with a precision of one part in 2^24, the quantities are quantized to a lower precision, such as one part in 2^22. Operations are applied to sets of the quantities by quantizing the intermediate results of the operations to the lower precision than the precision supported by the floating point format.Type: GrantFiled: October 1, 2007Date of Patent: October 5, 2010Assignee: D. E. Shaw Research, LLCInventor: Kevin J. Bowers
-
Patent number: 7769571Abstract: An improved constraint approach reduces the energy drift rate to acceptable levels. In an embodiment of this approach, massively parallel constrained velocity Verlet NVE (constant particle number, constant volume, constant energy) MD simulations can be run using single precision arithmetic with very low energy drift (e.g., ˜1 Kelvin per microsecond simulated time) using large timesteps (e.g., 2.5 fs) for typical systems and MD force fields.Type: GrantFiled: October 1, 2007Date of Patent: August 3, 2010Assignee: D. E. Shaw Research, LLCInventor: Kevin J. Bowers
-
Publication number: 20080243452Abstract: A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume.Type: ApplicationFiled: October 19, 2007Publication date: October 2, 2008Inventors: Kevin J. Bowers, Ron Dror, David Shaw, Martin Deneroff
-
Publication number: 20080234990Abstract: Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion.Type: ApplicationFiled: March 21, 2008Publication date: September 25, 2008Applicant: D.E.Shaw Research, LLCInventor: Kevin J. Bowers