scholarly journals Fully Automated Screening of a Combinatorial Library to Avoid False Positives: Application to Tetanus Toxoid Ligand Identification

ACS Omega ◽  
2021 ◽  
Author(s):  
María C. Martínez Ceron ◽  
Lucía Ávila ◽  
Silvana L. Giudicessi ◽  
Juan M. Minoia ◽  
Matías Fingermann ◽  
...  
1995 ◽  
Vol 13 (7) ◽  
pp. 683-685 ◽  
Author(s):  
Alois B. Lang ◽  
Monique Vogel ◽  
Jean-François Viret ◽  
Beda M. Stadler

2008 ◽  
Author(s):  
Judith Andersen ◽  
Rebecca Silver ◽  
Todd Bishop ◽  
Vanessa Tirone ◽  
Paige Ouimette

2007 ◽  
Vol 37 (15) ◽  
pp. 38
Author(s):  
SARAH PRESSMAN LOVINGER

2020 ◽  
Vol 2020 (14) ◽  
pp. 378-1-378-7
Author(s):  
Tyler Nuanes ◽  
Matt Elsey ◽  
Radek Grzeszczuk ◽  
John Paul Shen

We present a high-quality sky segmentation model for depth refinement and investigate residual architecture performance to inform optimally shrinking the network. We describe a model that runs in near real-time on mobile device, present a new, highquality dataset, and detail a unique weighing to trade off false positives and false negatives in binary classifiers. We show how the optimizations improve bokeh rendering by correcting stereo depth misprediction in sky regions. We detail techniques used to preserve edges, reject false positives, and ensure generalization to the diversity of sky scenes. Finally, we present a compact model and compare performance of four popular residual architectures (ShuffleNet, MobileNetV2, Resnet-101, and Resnet-34-like) at constant computational cost.


2020 ◽  
Author(s):  
Stuart Yeates

A brief introduction to acronyms is given and motivation for extracting them in a digital library environment is discussed. A technique for extracting acronyms is given with an analysis of the results. The technique is found to have a low number of false negatives and a high number of false positives. Introduction Digital library research seeks to build tools to enable access of content, while making as few as possible assumptions about the content, since assumptions limit the range of applicability of the tools. Generally, the broader the assumptions the more widely applicable the tools. For example, keyword based indexing [5] is based on communications theory and applies to all natural human textual languages (allowances for differences in character sets and similar localisation issues not withstanding) . The algorithm described in this paper makes much stronger assumptions about the content. It assumes textual content that contains acronyms, an assumption which is known to hold for...


Pathology ◽  
1983 ◽  
Vol 15 (4) ◽  
pp. 369-372 ◽  
Author(s):  
Christine Johnson ◽  
R.S. Walls ◽  
A. Ruwoldt

Sign in / Sign up

Export Citation Format

Share Document