Filters








7,422 Hits in 3.8 sec

Combinatorial Agency of Threshold Functions [chapter]

Shaili Jain, David C. Parkes
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Our results include a characterization of the transition behavior for the class of threshold functions.  ...  We study the combinatorial agency problem introduced by Babaioff, Feldman and Nisan [5] and resolve some open questions posed in their original paper.  ...  [5] introduce the combinatorial agency problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-24829-0_15">doi:10.1007/978-3-642-24829-0_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xsx7k4by25bt7itsd5dq2j5dsq">fatcat:xsx7k4by25bt7itsd5dq2j5dsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224163719/http://pdfs.semanticscholar.org/6506/9cfe3d18046daa0dbbf125ac84f0ad99c6ea.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/06/65069cfe3d18046daa0dbbf125ac84f0ad99c6ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-24829-0_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 4048 of Mathematical Reviews Vol. , Issue 98F [page]

<span title="">1998</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
From the introduction: “Many problems of resource allocation can be thought of in terms of constrained combinatorial optimization.  ...  The first mechanism makes use of a single set of key escrow agencies moderately trusted by mutually mistrusting domains.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1998-06_98f/page/4048" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1998-06_98f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Feature extraction and classification for rectal bleeding in prostate cancer radiotherapy: A PCA based method

A. Fargeas, A. Kachenoura, O. Acosta, L. Albera, G. Drean, R. De Crevoisier
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fzmybqbfvzewdoqdiknm6tps6q" style="color: black;">IRBM</a> </i> &nbsp;
Acknowledgments This work was supported by Region Bretagne and has received a French government support granted to the CominLabs excellence laboratory and managed by the National Research Agency in the  ...  Fig. 3 3 displays the performance of the classifier as a function of the number, n, of exploited features when using (a) the sequential approach and (b) the combinatory approach.  ...  In the case where we exploited more than one feature, Figure 3 : 3 Accuracy, sensitivity and specificity as function of the number of exploited features using: (a) sequential approach, and (b) combinatory  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.irbm.2013.07.009">doi:10.1016/j.irbm.2013.07.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nf7hzbsdbbh3fmc2vtc5xl7jk4">fatcat:nf7hzbsdbbh3fmc2vtc5xl7jk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922001926/https://hal-univ-rennes1.archives-ouvertes.fr/hal-00956765/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ab/2d/ab2d9701e29a51409d65db968db4db836f75f872.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.irbm.2013.07.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Statistical significance of combinatorial regulations

A. Terada, M. Okada-Hatakeyama, K. Tsuda, J. Sese
<span title="2013-07-23">2013</span> <i title="Proceedings of the National Academy of Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nvtuoas5pbdsllkntnhizy4f4q" style="color: black;">Proceedings of the National Academy of Sciences of the United States of America</a> </i> &nbsp;
A recent series of encyclopedia of DNA elements (ENCODE) project papers confirmed the importance of this combinatorial activity (3-6).  ...  LAMP lists significant combinations without any limit, whereas the family-wise error rate is rigorously controlled under the threshold.  ...  This work was made possible by the support of the Minato Discrete Structure Manipulation System Project, Exploratory Research for Advanced Technology, Japan Science and Technology Agency (to A.T. and K.T  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1073/pnas.1302233110">doi:10.1073/pnas.1302233110</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23882073">pmid:23882073</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC3740841/">pmcid:PMC3740841</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hjgsbck26baffia6nwtseorta4">fatcat:hjgsbck26baffia6nwtseorta4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191031101340/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC3740841&amp;blobtype=pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/62/d8/62d8feef05f3bf8e6dfafdad950b307801847351.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1073/pnas.1302233110"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3740841" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Page 9829 of Mathematical Reviews Vol. , Issue 2003m [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
agency to set up a metering scheme with pricing.  ...  ; Wollongong) ; Wang, Huaxiong (5-WLG-SIC; Wollongong) Bounds and constructions for threshold shared generation of authenticators.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-12_2003m/page/9829" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-12_2003m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Feedback-based quantum optimization [article]

Alicia B. Magann, Kenneth M. Rudinger, Matthew D. Grace, Mohan Sarovar
<span title="2021-08-16">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that this procedure results in an estimate of the combinatorial optimization problem solution that improves monotonically with the depth of the quantum circuit.  ...  Quantum computers are expected to offer advantages over classical computers for combinatorial optimization.  ...  The protocol can be terminated when the value of Hp converges or a threshold number of layers is reached.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.08619v2">arXiv:2103.08619v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/go7ygjigbna4jglnj3r3cf3gyy">fatcat:go7ygjigbna4jglnj3r3cf3gyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210829025536/https://arxiv.org/pdf/2103.08619v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/13/e513dd07bbbac78896666791290e7d5898a25a1c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2103.08619v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines [chapter]

Thierry Benoist, Eric Bourreau, Yves Caseau, Benoît Rottembourg
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This benchmark is used to test a framework with four different dynamic strategies that utilize a different combination of the stochastic and combinatorial aspects of the problem.  ...  multiple runs of simulation.  ...  Revenue as a function of the current balance As described in the introduction of this part, we dynamically recompute the r* threshold values to decide if we accept arrivals (hence the p accept ratio is  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45578-7_5">doi:10.1007/3-540-45578-7_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jg4dra4vojedfaideao3uuhx3y">fatcat:jg4dra4vojedfaideao3uuhx3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810210750/http://www.lirmm.fr/~bourreau/SOURCES/Bourreau%20CP01%20Towards.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/94/cf/94cf55448b39ddc8994caed9b46f172c5acdf020.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45578-7_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

How to Make nD Functions Digitally Well-Composed in a Self-dual Way [chapter]

Nicolas Boutry, Thierry Géraud, Laurent Najman
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we extend the notion of "digital well-composedness" to nD sets, integer-valued functions (graylevel images), and interval-valued maps.  ...  (non-local) interpolation method whose result is always a digitally well-composed function.  ...  Acknowledgments This work received funding from the Agence Nationale de la Recherche, contract ANR-2010-BLAN-0205-03 and through "Programme d'Investissements d'Avenir" (LabEx BEZOUT n o ANR-10-LABX-58)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-18720-4_47">doi:10.1007/978-3-319-18720-4_47</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qw4pce24srelhl7io6z7flmzke">fatcat:qw4pce24srelhl7io6z7flmzke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415052836/https://core.ac.uk/download/pdf/48321256.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d0/35/d035be4628f1e5705217c0cc7e2adc778e66390a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-18720-4_47"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

CombiROC: an interactive web tool for selecting accurate marker combinations of omics data

Saveria Mazzara, Riccardo L. Rossi, Renata Grifantini, Simone Donizetti, Sergio Abrignani, Mauro Bombaci
<span title="2017-03-30">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tnqhc2x2aneavcd3gx5h7mswhm" style="color: black;">Scientific Reports</a> </i> &nbsp;
With CombiROC data from different domains, such as proteomics and transcriptomics, can be analyzed using sensitivity/specificity filters: the number of candidate marker panels rising from combinatorial  ...  CombiROC was designed without hard-coded thresholds, allowing a custom fit to each specific data: this dramatically reduces the computational burden and lowers the false negative rates given by fixed thresholds  ...  editing of the manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/srep45477">doi:10.1038/srep45477</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/28358118">pmid:28358118</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC5371980/">pmcid:PMC5371980</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3lkxx6yna5d4xlifm4c2xa3hnu">fatcat:3lkxx6yna5d4xlifm4c2xa3hnu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200313095504/https://www.nature.com/articles/srep45477.pdf?error=cookies_not_supported&amp;code=e169d375-0366-4b12-a9ea-2bceb9fbb04f" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/bc/34bce8dda416942ed08638b8922ca4ff77ac7f3f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/srep45477"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5371980" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

An Agent Based Market Design Methodology for Combinatorial Auctions

Jinho Choi, Gyoo Gun Lim, Kun Chang Lee
<span title="">2010</span> <i title="Journal of Artificial Societies and Social Simulation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/klq2tnwbsbhohor7blhqllaz2y" style="color: black;">Journal of Artificial Societies and Social Simulation</a> </i> &nbsp;
Then we illustrate a design process for the general n-bilateral combinatorial auction market. This study serves as a guideline for practical implementation of combinatorial auction markets design.  ...  Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces.  ...  Acknowledgements This research was supported by WCU(World Class University) program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (Grant  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18564/jasss.1557">doi:10.18564/jasss.1557</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/52gxvrkb5fdyjkwqq2wg67z5iu">fatcat:52gxvrkb5fdyjkwqq2wg67z5iu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810151708/http://jasss.soc.surrey.ac.uk/13/2/2/2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/56/d856f434d0aae4eb2cc7cf3c0fc9c7853025b4a2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18564/jasss.1557"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Combinatorial chemistry in the hunt for medicines

A. Ganesan
<span title="">1998</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/drfdii35rzaibj3aml5uhvr5xm" style="color: black;">Nature</a> </i> &nbsp;
Yet it is the activities of these two agencies that account for most of the growth. The strength of American science and engineering lies in the multiplicity of agency support.  ...  of combinatorial libraries: "At present, all these synthetic molecules are polymers".  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/31570">doi:10.1038/31570</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/9655386">pmid:9655386</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mottdydtrfftnay4plxfaxza4q">fatcat:mottdydtrfftnay4plxfaxza4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429033647/https://www.nature.com/articles/31570.pdf?error=cookies_not_supported&amp;code=cc428248-a234-40aa-a6e7-dcbb7ade2ec4" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/cb/fecba59d3ccf7d167e3c8339d5358b4ecb5f943a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/31570"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> nature.com </button> </a>

Qualification of Operational Amplifier used in Satellite Subsystem using Picosecond Pulsed Laser System

<span title="2020-07-30">2020</span> <i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3sfifsouvjgadp4gfj54u3z2ku" style="color: black;">International journal of recent technology and engineering</a> </i> &nbsp;
Determine the threshold energy of the SET in both wavelength, and compare the laser cross section of 1064 nm beam and 532 nm beam.  ...  The degradation performance of LM324 induced by pulsed laser irradiation with two wavelength (1064nm, 532nm) is determined as a function of laser cross section.  ...  In combinatorial logic, SET is transient pulses generated in a gate that may propagate in a combinatorial circuit path and eventually be latched in the storage cell.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijrte.b3689.079220">doi:10.35940/ijrte.b3689.079220</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vz2x2wfxizdkbmekm56ux6dnd4">fatcat:vz2x2wfxizdkbmekm56ux6dnd4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200812235332/https://www.ijrte.org/wp-content/uploads/papers/v9i2/B3689079220.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijrte.b3689.079220"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

The HEP.TrkX Project: Deep Learning for Particle Tracking

Aristeidis Tsaris, Dustin Anderson, Josh Bendavid, Paolo Calafiura, Giuseppe Cerati, Julien Esseiva, Steven Farrell, Lindsey Gray, Keshav Kapoor, Jim Kowalkowski, Mayur Mudigonda, Prabhat (+5 others)
<span title="">2018</span> <i title="IOP Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wxgp7pobnrfetfizidmpebi4qy" style="color: black;">Journal of Physics, Conference Series</a> </i> &nbsp;
Traditional tracking algorithms, such as the combinatorial Kalman Filter, have been used with great success in HEP experiments for years.  ...  Machine learning algorithms bring a lot of potential to this problem thanks to their capability to model complex non-linear data dependencies, to learn effective representations of high-dimensional data  ...  The plot on the right shows the probability of correctly hit assigned to multi tracks as a function of threshold value.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/1085/4/042023">doi:10.1088/1742-6596/1085/4/042023</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3it4ak6ntrenvlyinc7xmocknu">fatcat:3it4ak6ntrenvlyinc7xmocknu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307071723/https://authors.library.caltech.edu/96191/1/Tsaris_2018_J._Phys.__Conf._Ser._1085_042023.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/69/85/698513b1a5acb9a5bc1bf4bae130a429f8976c8c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/1085/4/042023"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> iop.org </button> </a>

Functional variants in ADH1B and ALDH2 are non-additively associated with all-cause mortality in Japanese population

Saori Sakaue, Masato Akiyama, Makoto Hirata, Koichi Matsuda, Yoshinori Murakami, Michiaki Kubo, Yoichiro Kamatani, Yukinori Okada
<span title="2019-09-26">2019</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pmvuapr27ngvveh4i2dhb3i3ce" style="color: black;">European Journal of Human Genetics</a> </i> &nbsp;
The functional variants involved in alcohol metabolism, the A allele of rs1229984:A > G in ADH1B and the A allele of rs671:G > A in ALDH2, are specifically prevalent among East Asian population.  ...  The favorable effects of these alleles on survival were independent of the habit of alcohol consumption itself.  ...  (Glu504Lys)]) causes the functional deficiency of ALDH2, which slows the metabolism of acetaldehyde [2] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/s41431-019-0518-y">doi:10.1038/s41431-019-0518-y</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/31558841">pmid:31558841</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC7028931/">pmcid:PMC7028931</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/astuq4hvibbkxm24x6t4zkikhi">fatcat:astuq4hvibbkxm24x6t4zkikhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200513001519/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC7028931&amp;blobtype=pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/7f/fa7f5b75e35a881115fcdb79afb69a59ead2f75a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1038/s41431-019-0518-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7028931" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

A new framework for computational protein design through cost function network optimization

Seydou Traoré, David Allouche, Isabelle André, Simon de Givry, George Katsirelos, Thomas Schiex, Sophie Barbe
<span title="2013-07-10">2013</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4r72gbmtcrde5no3fwwogjs3cu" style="color: black;">Computer applications in the biosciences : CABIOS</a> </i> &nbsp;
In this work, we show that a recent combinatorial optimization technique, defined in the field of "Cost Function Networks" (or Weighted Constraint satisfaction, [5]) can push CPD beyond the limit of usual  ...  Keywords Structural biology, combinatorial optimization, computational protein design.  ...  Acknowledgments This work was supported by the "Agence Nationale de la Recherche", references ANR 10-BLA-0214 and ANR-12-MONU-0015-03.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/bioinformatics/btt374">doi:10.1093/bioinformatics/btt374</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23842814">pmid:23842814</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ffko77e3ojfkpdwbmnj4owlqfy">fatcat:ffko77e3ojfkpdwbmnj4owlqfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922074548/http://prodinra.inra.fr/ft?id=DC34A76C-E5EF-480C-90D8-130A0E6FF956" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/c8/f3c8ab0656dc221798ea7703614eadcac606c4d9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/bioinformatics/btt374"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 7,422 results