Patents by Inventor Daniel Wells
Daniel Wells 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: 20240428883Abstract: There is provided a computer-implemented method of analysing genetic data comprising: receiving a polygenic risk score for a target phenotype or target phenotype combination for a target individual; receiving individual genetic data for the target individual, the individual genetic data informative about an ancestry of the target individual; determining an individual position in an ancestry space using the individual genetic data; and calculating a genetic contribution to a risk for the target individual for the target phenotype or target phenotype combination using the polygenic risk score and the individual position. A corresponding apparatus is also provided.Type: ApplicationFiled: October 5, 2022Publication date: December 26, 2024Applicant: GENOMICS PLCInventors: Michael WEALE, Vincent Yann Marie PLAGNOL, Rachel MOORE, Daniel WELLS, Priyanka SETH, Duncan PALMER
-
Publication number: 20240105280Abstract: Disclosed is a method of analysing genetic data about an organism comprising receiving a plurality of input units. Each input unit comprises information about the association between genetic variants in a region of the genome and phenotypes or phenotype combinations. The method comprises carrying out iterations comprising, for each variant determining for which of the phenotypes or phenotype combinations the variant is causal based on the input units. If the variant is causal for phenotypes or phenotype combinations, a sampled effect size is determined of the variant on the phenotypes or phenotype combinations based on the input units and information about correlations between the variants in the region. For each variant, a prediction effect size is determined variant on the phenotypes or phenotype combinations based on an average across the iterations of the sampled effect sizes or of posterior effect sizes calculated using the sampled effect sizes.Type: ApplicationFiled: November 26, 2021Publication date: March 28, 2024Applicant: GENOMICS PLCInventors: Rachel MOORE, Vincent Yann Marie PLAGNOL, Michael WEALE, Daniel WELLS, Christopher Charles Alan Spencer
-
Publication number: 20240038330Abstract: Disclosed is a method of analysing genetic data about an organism comprising receiving a plurality of input units. Each input unit comprises information about the association between genetic variants in a region of the genome and a target phenotype. One or more iterations are carried out comprising, for each variant, determining whether the variant is causal for the target phenotype. If the variant is causal, a sampled effect size is determined for each input unit based on the input units and correlations between the plurality of genetic variants in the region. The sampled effect size is non-zero for all of the input units. For each variant, a prediction effect size is determined for each input unit based on an average across the iterations of the sampled effect sizes for the input unit or of posterior effect sizes for the input unit calculated using the sampled effect sizes.Type: ApplicationFiled: November 26, 2021Publication date: February 1, 2024Applicant: GENOMICS PLCInventors: Rachel MOORE, Vincent Yann Marie PLAGNOL, Fernando RIVEROS-MCKAY, Michael WEALE, Daniel WELLS, Christopher Charles Alan Spencer
-
Patent number: 10293463Abstract: A CMP pad conditioner for conditioning a polishing pad. Various embodiments of the disclosure include a plurality of elongated protrusions which work a conditioned surface of a polishing pad at a variety of attack angles as the CMP pad conditioner engages the polishing pad. Because of the elongated geometry of the protrusions, the variety of attack angles will tend to flex the conditioned face of the polishing pad in a multifaceted manner. Such multifaceted manipulation of the conditioned face enhances the cut rate of the conditioner assembly and the removal of debris in the pores of the polishing pad that are residual from the CMP process, to better open the pores of the polishing pad and to better maintain the removal rate in the CMP process.Type: GrantFiled: March 20, 2015Date of Patent: May 21, 2019Assignee: Entegris, Inc.Inventors: Andrew Galpin, Daniel Wells
-
Patent number: 9749257Abstract: Methods and apparatus for dynamically deploying software agents are disclosed. For example, a user of an electronic record management system may deploy a plurality of different background processes (e.g., OCR, dedup, etc.) that may each take several hours to complete. Subsequently, the user may decide to change the number of servers dedicated to one or more background process. In addition, the user may decide to deploy additional background processes. Neither of these user actions interrupts any of the background processes.Type: GrantFiled: October 24, 2013Date of Patent: August 29, 2017Assignee: KCURA LLCInventors: Daniel Wells, Kevin McCarty, Christopher Hogan, Konrad Makowski, Justin Smits
-
Publication number: 20170095903Abstract: A CMP pad conditioner for conditioning a polishing pad. Various embodiments of the disclosure include a plurality of elongated protrusions work a conditioned surface of a polishing pad at a variety of attack angles as the CMP pad conditioner engages the polishing pad. Because of the elongated geometry of the protrusions, the variety of attack angles will tend to flex the conditioned face of the polishing pad in a multifaceted manner. We have found that such multifaceted manipulation of the conditioned face enhances the cut rate of the conditioner assembly and the removal of debris in the pores of the polishing pad that are residual from the CMP process, to better open the pores of the polishing pad and to better maintain the removal rate in the CMP process.Type: ApplicationFiled: March 20, 2015Publication date: April 6, 2017Inventors: Andrew GALPIN, Daniel WELLS
-
Publication number: 20160321319Abstract: Methods and apparatus for upgrading a plurality of databases are disclosed. For example, a computer system may receive a first upgrade order associated with a first database. The system then receives a second upgrade order associated with a second database, wherein the first upgrade order is indicative of a first higher upgrade precedence than the second upgrade order. The system then receives a first priority associated with a third database. The system then receives a second priority associated with a fourth database wherein the first priority is indicative of a second higher upgrade precedence than the second priority. The system then upgrades the first database first in time based on the first upgrade order. The system then upgrades the second database second in time based on the second upgrade order. The system then upgrades the third database third in time based on the first priority. The system then upgrades the fourth database fourth in time based on the second priority.Type: ApplicationFiled: June 4, 2015Publication date: November 3, 2016Inventors: Nathanial Joseph Noonen, Margaret Wileen Svec, Christopher Hogan, Daniel Wells
-
Publication number: 20160321306Abstract: Methods and apparatus for upgrading a plurality of databases are disclosed. For example, a computer system may receive a first upgrade order associated with a first database. The system then receives a second upgrade order associated with a second database, wherein the first upgrade order is indicative of a first higher upgrade precedence than the second upgrade order. The system then receives a first priority associated with a third database. The system then receives a second priority associated with a fourth database wherein the first priority is indicative of a second higher upgrade precedence than the second priority. The system then upgrades the first database first in time based on the first upgrade order. The system then upgrades the second database second in time based on the second upgrade order. The system then upgrades the third database third in time based on the first priority. The system then upgrades the fourth database fourth in time based on the second priority.Type: ApplicationFiled: June 4, 2015Publication date: November 3, 2016Inventors: Nathanial Joseph Noonen, Margaret Wileen Svec, Christopher Hogan, Daniel Wells
-
Publication number: 20160321056Abstract: Methods and apparatus for upgrading a plurality of databases are disclosed. For example, a computer system may receive a first upgrade order associated with a first database. The system then receives a second upgrade order associated with a second database, wherein the first upgrade order is indicative of a first higher upgrade precedence than the second upgrade order. The system then receives a first priority associated with a third database. The system then receives a second priority associated with a fourth database wherein the first priority is indicative of a second higher upgrade precedence than the second priority. The system then upgrades the first database first in time based on the first upgrade order. The system then upgrades the second database second in time based on the second upgrade order. The system then upgrades the third database third in time based on the first priority. The system then upgrades the fourth database fourth in time based on the second priority.Type: ApplicationFiled: June 4, 2015Publication date: November 3, 2016Inventors: Nathanial Joseph Noonen, Margaret Wileen Svec, Christopher Hogan, Daniel Wells
-
Publication number: 20150120926Abstract: Methods and apparatus for dynamically deploying software agents are disclosed. For example, a user of an electronic record management system may deploy a plurality of different background processes (e.g., OCR, dedup, etc.) that may each take several hours to complete. Subsequently, the user may decide to change the number of servers dedicated to one or more background process. In addition, the user may decide to deploy additional background processes. Neither of these user actions interrupts any of the background processes.Type: ApplicationFiled: October 24, 2013Publication date: April 30, 2015Applicant: kCura CorporationInventors: Daniel Wells, Kevin McCarty, Christopher Hogan, Konrad Makowski, Justin Smits
-
Publication number: 20070092657Abstract: The present application is directed to a spray booth comprising a first enclosure for applying spray material and a second enclosure for drying spray material. An exhaust system is in fluid connection with the first and second enclosures. A fire suppression system is in fluid connection with at least one component chosen from the first enclosure, the second enclosure and the exhaust system. A processor is in data communication with at least one component chosen from the spray enclosure, the drying enclosure, the exhaust system and the fire suppression system.Type: ApplicationFiled: October 14, 2005Publication date: April 26, 2007Inventors: John Ferguson, Mark Gabriel, Christopher Carter, Kevin Bell, Candace Propp, David Wagner, Daniel Wells
-
Publication number: 20060230310Abstract: A network for a large number of processing elements utilizes a trellis ring architecture to provide an efficient and fault tolerant data routing system. The processing elements (which may be chip-based processors, circuit cards, unit level assemblies, or computing devices) are interconnected together in an endless ring structure. In addition to the ring arrangement, the processing elements are interconnected via primary and additional trellis connections that reduce the average and/or the maximum number of network node hops between two processing elements in the network architecture.Type: ApplicationFiled: April 6, 2005Publication date: October 12, 2006Inventors: Ramin Nobakht, Daniel Wells