---
_id: '14592'
abstract:
- lang: eng
text: Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights
into biological processes and structures within a native context. However, a major
challenge still lies in the efficient and reproducible preparation of adherent
cells for subsequent cryo-EM analysis. This is due to the sensitivity of many
cellular specimens to the varying seeding and culturing conditions required for
EM experiments, the often limited amount of cellular material and also the fragility
of EM grids and their substrate. Here, we present low-cost and reusable 3D printed
grid holders, designed to improve specimen preparation when culturing challenging
cellular samples directly on grids. The described grid holders increase cell culture
reproducibility and throughput, and reduce the resources required for cell culturing.
We show that grid holders can be integrated into various cryo-EM workflows, including
micro-patterning approaches to control cell seeding on grids, and for generating
samples for cryo-focused ion beam milling and cryo-electron tomography experiments.
Their adaptable design allows for the generation of specialized grid holders customized
to a large variety of applications.
article_processing_charge: No
author:
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Schur FK. STL-files for 3D-printed grid holders described in Fäßler F, Zens
B, et al.; 3D printed cell culture grid holders for improved cellular specimen
preparation in cryo-electron microscopy. 2020. doi:10.15479/AT:ISTA:14592
apa: Schur, F. K. (2020). STL-files for 3D-printed grid holders described in Fäßler
F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular
specimen preparation in cryo-electron microscopy. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:14592
chicago: Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in
Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular
Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology
Austria, 2020. https://doi.org/10.15479/AT:ISTA:14592.
ieee: F. K. Schur, “STL-files for 3D-printed grid holders described in Fäßler F,
Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen
preparation in cryo-electron microscopy.” Institute of Science and Technology
Austria, 2020.
ista: Schur FK. 2020. STL-files for 3D-printed grid holders described in Fäßler
F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular
specimen preparation in cryo-electron microscopy, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:14592.
mla: Schur, Florian KM. STL-Files for 3D-Printed Grid Holders Described in Fäßler
F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular
Specimen Preparation in Cryo-Electron Microscopy. Institute of Science and
Technology Austria, 2020, doi:10.15479/AT:ISTA:14592.
short: F.K. Schur, (2020).
contributor:
- contributor_type: researcher
first_name: Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- contributor_type: researcher
first_name: Bettina
id: 45FD126C-F248-11E8-B48F-1D18A9856A87
last_name: Zens
- contributor_type: researcher
first_name: Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
- contributor_type: researcher
first_name: Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
date_created: 2023-11-22T15:00:57Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2024-02-21T12:44:48Z
day: '01'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.15479/AT:ISTA:14592
file:
- access_level: open_access
checksum: 0108616e2a59e51879ea51299a29b091
content_type: application/zip
creator: fschur
date_created: 2023-11-22T14:58:44Z
date_updated: 2023-11-22T14:58:44Z
file_id: '14593'
file_name: 3Dprint-files_download_v2.zip
file_size: 49297
relation: main_file
success: 1
- access_level: open_access
checksum: 4c66ddedee4d01c1c4a7978208350cfc
content_type: text/plain
creator: cchlebak
date_created: 2023-12-01T10:39:59Z
date_updated: 2023-12-01T10:39:59Z
file_id: '14637'
file_name: readme.txt
file_size: 641
relation: main_file
success: 1
file_date_updated: 2023-12-01T10:39:59Z
has_accepted_license: '1'
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8586'
relation: research_data
status: public
status: public
title: STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.;
3D printed cell culture grid holders for improved cellular specimen preparation
in cryo-electron microscopy
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7213'
abstract:
- lang: eng
text: Persistent homology is a powerful tool in Topological Data Analysis (TDA)
to capture the topological properties of data succinctly at different spatial
resolutions. For graphical data, the shape, and structure of the neighborhood
of individual data items (nodes) are an essential means of characterizing their
properties. We propose the use of persistent homology methods to capture structural
and topological properties of graphs and use it to address the problem of link
prediction. We achieve encouraging results on nine different real-world datasets
that attest to the potential of persistent homology-based methods for network
analysis.
alternative_title:
- SCI
article_processing_charge: No
author:
- first_name: Sumit
full_name: Bhatia, Sumit
last_name: Bhatia
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Deepak
full_name: Nathani, Deepak
last_name: Nathani
- first_name: Manohar
full_name: Kaul, Manohar
last_name: Kaul
citation:
ama: 'Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective
to the link prediction problem. In: Complex Networks and Their Applications
VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3'
apa: 'Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2020). A persistent
homology perspective to the link prediction problem. In Complex Networks and
their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer
Nature. https://doi.org/10.1007/978-3-030-36687-2_3'
chicago: Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent
Homology Perspective to the Link Prediction Problem.” In Complex Networks and
Their Applications VIII, 881:27–39. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36687-2_3.
ieee: S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology
perspective to the link prediction problem,” in Complex Networks and their
applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
ista: 'Bhatia S, Chatterjee B, Nathani D, Kaul M. 2020. A persistent homology perspective
to the link prediction problem. Complex Networks and their applications VIII.
COMPLEX: International Conference on Complex Networks and their Applications,
SCI, vol. 881, 27–39.'
mla: Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction
Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer
Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.
short: S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and
Their Applications VIII, Springer Nature, 2020, pp. 27–39.
conference:
end_date: 2019-12-12
location: Lisbon, Portugal
name: 'COMPLEX: International Conference on Complex Networks and their Applications'
start_date: 2019-12-10
date_created: 2019-12-29T23:00:45Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-02-22T13:16:06Z
day: '01'
ddc:
- '004'
department:
- _id: DaAl
doi: 10.1007/978-3-030-36687-2_3
ec_funded: 1
external_id:
isi:
- '000843927300003'
file:
- access_level: open_access
checksum: 8951f094c8c7dae9ff8db885199bc296
content_type: application/pdf
creator: bchatter
date_created: 2020-10-08T08:16:48Z
date_updated: 2020-10-08T08:16:48Z
file_id: '8625'
file_name: main.pdf
file_size: 310598
relation: main_file
success: 1
file_date_updated: 2020-10-08T08:16:48Z
has_accepted_license: '1'
intvolume: ' 881'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 27-39
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Complex Networks and their applications VIII
publication_identifier:
eissn:
- '18609503'
isbn:
- '9783030366865'
issn:
- 1860949X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A persistent homology perspective to the link prediction problem
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 881
year: '2020'
...
---
_id: '10556'
abstract:
- lang: eng
text: In this paper, we present the first Asynchronous Distributed Key Generation
(ADKG) algorithm which is also the first distributed key generation algorithm
that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is
the number of faulty parties). As a result, using our ADKG we remove the trusted
setup assumption that the most scalable consensus algorithms make. In order to
create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative
the open question posed by Cachin et al. [7] on how to create an Asynchronous
Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364'
apa: 'Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous
distributed key generation for computationally-secure randomness, consensus, and
threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer
and Communications Security (pp. 1751–1767). Virtual, United States: Association
for Computing Machinery. https://doi.org/10.1145/3372297.3423364'
chicago: Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous
Distributed Key Generation for Computationally-Secure Randomness, Consensus, and
Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on
Computer and Communications Security, 1751–1767. Association for Computing
Machinery, 2020. https://doi.org/10.1145/3372297.3423364.
ieee: E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and
Communications Security, Virtual, United States, 2020, pp. 1751–1767.
ista: 'Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. CCS: Computer and Communications Security, 1751–1767.'
mla: Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation
for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings
of the 2020 ACM SIGSAC Conference on Computer and Communications Security,
Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.
short: E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020
ACM SIGSAC Conference on Computer and Communications Security, Association for
Computing Machinery, 2020, pp. 1751–1767.
conference:
end_date: 2020-11-13
location: Virtual, United States
name: 'CCS: Computer and Communications Security'
start_date: 2020-11-09
date_created: 2021-12-16T13:23:27Z
date_published: 2020-10-30T00:00:00Z
date_updated: 2024-02-22T13:10:45Z
day: '30'
department:
- _id: ElKo
doi: 10.1145/3372297.3423364
external_id:
isi:
- '000768470400104'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1015
month: '10'
oa: 1
oa_version: Preprint
page: 1751–1767
publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- 978-1-4503-7089-9
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous distributed key generation for computationally-secure randomness,
consensus, and threshold signatures
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '9202'
abstract:
- lang: eng
text: We propose a novel hybridization method for stability analysis that over-approximates
nonlinear dynamical systems by switched systems with linear inclusion dynamics.
We observe that existing hybridization techniques for safety analysis that over-approximate
nonlinear dynamical systems by switched affine inclusion dynamics and provide
fixed approximation error, do not suffice for stability analysis. Hence, we propose
a hybridization method that provides a state-dependent error which converges to
zero as the state tends to the equilibrium point. The crux of our hybridization
computation is an elegant recursive algorithm that uses partial derivatives of
a given function to obtain upper and lower bound matrices for the over-approximating
linear inclusion. We illustrate our method on some examples to demonstrate the
application of the theory for stability analysis. In particular, our method is
able to establish stability of a nonlinear system which does not admit a polynomial
Lyapunov function.
acknowledgement: Miriam Garc´ıa Soto was partially supported by the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially
supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award
No. N000141712577.
article_processing_charge: No
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000-0003-2936-5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
ama: 'Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear
switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256.
doi:10.1109/RTSS49844.2020.00031'
apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification
of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium
(pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031'
chicago: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability
Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems
Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.
ieee: M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification
of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium,
Houston, TX, USA , 2020, pp. 244–256.
ista: 'Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification
of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time
Systems Symposium, 244–256.'
mla: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification
of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.
short: M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–256.
conference:
end_date: 2020-12-04
location: 'Houston, TX, USA '
name: 'RTTS: Real-Time Systems Symposium'
start_date: 2020-12-01
date_created: 2021-02-26T16:38:24Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2024-02-22T13:25:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/RTSS49844.2020.00031
external_id:
isi:
- '000680435100021'
file:
- access_level: open_access
checksum: 8f97f229316c3b3a6f0cf99297aa0941
content_type: application/pdf
creator: mgarcias
date_created: 2021-02-26T16:38:14Z
date_updated: 2021-02-26T16:38:14Z
file_id: '9203'
file_name: main.pdf
file_size: 1125794
relation: main_file
file_date_updated: 2021-02-26T16:38:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 244-256
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 2020 IEEE Real-Time Systems Symposium
publication_identifier:
eisbn:
- '9781728183244'
eissn:
- 2576-3172
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Hybridization for stability verification of nonlinear switched systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '6906'
abstract:
- lang: eng
text: We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime.
We show that low-energy states exhibit complete Bose–Einstein condensation with
an optimal bound on the number of orthogonal excitations. This extends recent
results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing
the assumption of small interaction potential.
acknowledgement: "We would like to thank P. T. Nam and R. Seiringer for several useful
discussions and\r\nfor suggesting us to use the localization techniques from [9].
C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under
the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges
support from the NCCR SwissMAP and from the Swiss National Foundation of Science
(Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties
of Bose–Einstein condensates”."
article_processing_charge: No
article_type: original
author:
- first_name: Chiara
full_name: Boccato, Chiara
id: 342E7E22-F248-11E8-B48F-1D18A9856A87
last_name: Boccato
- first_name: Christian
full_name: Brennecke, Christian
last_name: Brennecke
- first_name: Serena
full_name: Cenatiempo, Serena
last_name: Cenatiempo
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
citation:
ama: Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical
Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9
apa: Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal
rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications
in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9
chicago: Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein.
“Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.”
Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.
ieee: C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for
Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications
in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.
ista: Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics.
376, 1311–1395.
mla: Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the
Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol.
376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.
short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical
Physics 376 (2020) 1311–1395.
date_created: 2019-09-24T17:30:59Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2024-02-22T13:33:02Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03555-9
ec_funded: 1
external_id:
arxiv:
- '1812.03086'
isi:
- '000536053300012'
intvolume: ' 376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.03086
month: '06'
oa: 1
oa_version: Preprint
page: 1311-1395
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 376
year: '2020'
...
---
_id: '7410'
abstract:
- lang: eng
text: 'Epiboly is a conserved gastrulation movement describing the thinning and
spreading of a sheet or multi-layer of cells. The zebrafish embryo has emerged
as a vital model system to address the cellular and molecular mechanisms that
drive epiboly. In the zebrafish embryo, the blastoderm, consisting of a simple
squamous epithelium (the enveloping layer) and an underlying mass of deep cells,
as well as a yolk nuclear syncytium (the yolk syncytial layer) undergo epiboly
to internalize the yolk cell during gastrulation. The major events during zebrafish
epiboly are: expansion of the enveloping layer and the internal yolk syncytial
layer, reduction and removal of the yolk membrane ahead of the advancing blastoderm
margin and deep cell rearrangements between the enveloping layer and yolk syncytial
layer to thin the blastoderm. Here, work addressing the cellular and molecular
mechanisms as well as the sources of the mechanical forces that underlie these
events is reviewed. The contribution of recent findings to the current model of
epiboly as well as open questions and future prospects are also discussed.'
article_processing_charge: No
author:
- first_name: Ashley E.E.
full_name: Bruce, Ashley E.E.
last_name: Bruce
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Bruce AEE, Heisenberg C-PJ. Mechanisms of zebrafish epiboly: A current view.
In: Solnica-Krezel L, ed. Gastrulation: From Embryonic Pattern to Form.
Vol 136. Current Topics in Developmental Biology. Elsevier; 2020:319-341. doi:10.1016/bs.ctdb.2019.07.001'
apa: 'Bruce, A. E. E., & Heisenberg, C.-P. J. (2020). Mechanisms of zebrafish
epiboly: A current view. In L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic
Pattern to Form (Vol. 136, pp. 319–341). Elsevier. https://doi.org/10.1016/bs.ctdb.2019.07.001'
chicago: 'Bruce, Ashley E.E., and Carl-Philipp J Heisenberg. “Mechanisms of Zebrafish
Epiboly: A Current View.” In Gastrulation: From Embryonic Pattern to Form,
edited by Lilianna Solnica-Krezel, 136:319–41. Current Topics in Developmental
Biology. Elsevier, 2020. https://doi.org/10.1016/bs.ctdb.2019.07.001.'
ieee: 'A. E. E. Bruce and C.-P. J. Heisenberg, “Mechanisms of zebrafish epiboly:
A current view,” in Gastrulation: From Embryonic Pattern to Form, vol.
136, L. Solnica-Krezel, Ed. Elsevier, 2020, pp. 319–341.'
ista: 'Bruce AEE, Heisenberg C-PJ. 2020.Mechanisms of zebrafish epiboly: A current
view. In: Gastrulation: From Embryonic Pattern to Form. vol. 136, 319–341.'
mla: 'Bruce, Ashley E. E., and Carl-Philipp J. Heisenberg. “Mechanisms of Zebrafish
Epiboly: A Current View.” Gastrulation: From Embryonic Pattern to Form,
edited by Lilianna Solnica-Krezel, vol. 136, Elsevier, 2020, pp. 319–41, doi:10.1016/bs.ctdb.2019.07.001.'
short: 'A.E.E. Bruce, C.-P.J. Heisenberg, in:, L. Solnica-Krezel (Ed.), Gastrulation:
From Embryonic Pattern to Form, Elsevier, 2020, pp. 319–341.'
date_created: 2020-01-30T09:24:06Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-02-22T13:23:09Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/bs.ctdb.2019.07.001
editor:
- first_name: 'Lilianna '
full_name: 'Solnica-Krezel, Lilianna '
last_name: Solnica-Krezel
external_id:
isi:
- '000611830600012'
intvolume: ' 136'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 319-341
publication: 'Gastrulation: From Embryonic Pattern to Form'
publication_identifier:
isbn:
- '9780128127988'
issn:
- 0070-2153
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
series_title: Current Topics in Developmental Biology
status: public
title: 'Mechanisms of zebrafish epiboly: A current view'
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 136
year: '2020'
...
---
_id: '6944'
abstract:
- lang: eng
text: 'We study the problem of automatically detecting if a given multi-class classifier
operates outside of its specifications (out-of-specs), i.e. on input data from
a different distribution than what it was trained for. This is an important problem
to solve on the road towards creating reliable computer vision systems for real-world
applications, because the quality of a classifier’s predictions cannot be guaranteed
if it operates out-of-specs. Previously proposed methods for out-of-specs detection
make decisions on the level of single inputs. This, however, is insufficient to
achieve low false positive rate and high false negative rates at the same time.
In this work, we describe a new procedure named KS(conf), based on statistical
reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied
to the set of predicted confidence values for batches of samples. Working with
batches instead of single samples allows increasing the true positive rate without
negatively affecting the false positive rate, thereby overcoming a crucial limitation
of single sample tests. We show by extensive experiments using a variety of convolutional
network architectures and datasets that KS(conf) reliably detects out-of-specs
situations even under conditions where other tests fail. It furthermore has a
number of properties that make it an excellent candidate for practical deployment:
it is easy to implement, adds almost no overhead to the system, works with any
classifier that outputs confidence scores, and requires no a priori knowledge
about how the data distribution could change.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Rémy
full_name: Sun, Rémy
last_name: Sun
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications. International Journal of Computer Vision.
2020;128(4):970-995. doi:10.1007/s11263-019-01232-x'
apa: 'Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass
classifier operates outside of its specifications. International Journal of
Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x'
chicago: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a
Multiclass Classifier Operates Outside of Its Specifications.” International
Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.'
ieee: 'R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications,” International Journal of Computer
Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.'
ista: 'Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications. International Journal of Computer Vision.
128(4), 970–995.'
mla: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass
Classifier Operates Outside of Its Specifications.” International Journal of
Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.'
short: R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.
date_created: 2019-10-14T09:14:28Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2024-02-22T14:57:30Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01232-x
ec_funded: 1
external_id:
isi:
- '000494406800001'
file:
- access_level: open_access
checksum: 155e63edf664dcacb3bdc1c2223e606f
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T10:30:02Z
date_updated: 2020-07-14T12:47:45Z
file_id: '7110'
file_name: 2019_IJCV_Sun.pdf
file_size: 1715072
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 128'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 970-995
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
eissn:
- 1573-1405
issn:
- 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s11263-019-01262-5
record:
- id: '6482'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'KS(conf): A light-weight test if a multiclass classifier operates outside
of its specifications'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 128
year: '2020'
...
---
_id: '8324'
abstract:
- lang: eng
text: The notion of program sensitivity (aka Lipschitz continuity) specifies that
changes in the program input result in proportional changes to the program output.
For probabilistic programs the notion is naturally extended to expected sensitivity.
A previous approach develops a relational program logic framework for proving
expected sensitivity of probabilistic while loops, where the number of iterations
is fixed and bounded. In this work, we consider probabilistic while loops where
the number of iterations is not fixed, but randomized and depends on the initial
input values. We present a sound approach for proving expected sensitivity of
such programs. Our sound approach is martingale-based and can be automated through
existing martingale-synthesis algorithms. Furthermore, our approach is compositional
for sequential composition of while loops under a mild side condition. We demonstrate
the effectiveness of our approach on several classical examples from Gambler's
Ruin, stochastic hybrid systems and stochastic gradient descent. We also present
experimental results showing that our automated approach can handle various probabilistic
programs in the literature.
acknowledgement: We thank anonymous reviewers for helpful comments, especially for
pointing to us a scenario of piecewise-linear approximation (Remark5). The research
was partially supported by the National Natural Science Foundation of China (NSFC)
under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science
Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu,
director of the BASICS Lab at Shanghai Jiao Tong University, for his support.
article_number: '25'
article_processing_charge: No
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yuxin
full_name: Deng, Yuxin
last_name: Deng
- first_name: Ming
full_name: Xu, Ming
last_name: Xu
citation:
ama: 'Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of
probabilistic programs with randomized variable-dependent termination time. In:
Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093'
apa: Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected
sensitivity of probabilistic programs with randomized variable-dependent termination
time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM.
https://doi.org/10.1145/3371093
chicago: Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu.
“Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent
Termination Time.” In Proceedings of the ACM on Programming Languages,
Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.
ieee: P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time,”
in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.
ista: Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time.
Proceedings of the ACM on Programming Languages. vol. 4, 25.
mla: Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs
with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM
on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.
short: P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM
on Programming Languages, ACM, 2020.
date_created: 2020-08-30T22:01:12Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-02-22T15:16:45Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3371093
external_id:
arxiv:
- '1902.04744'
file:
- access_level: open_access
checksum: c6193d109ff4ecb17e7a6513d8eb34c0
content_type: application/pdf
creator: cziletti
date_created: 2020-09-01T11:12:58Z
date_updated: 2020-09-01T11:12:58Z
file_id: '8328'
file_name: 2019_ACM_POPL_Wang.pdf
file_size: 564151
relation: main_file
success: 1
file_date_updated: 2020-09-01T11:12:58Z
has_accepted_license: '1'
intvolume: ' 4'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://doi.org/10.5281/zenodo.3533633
scopus_import: '1'
status: public
title: Proving expected sensitivity of probabilistic programs with randomized variable-dependent
termination time
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2020'
...
---
_id: '7160'
abstract:
- lang: eng
text: 'Nocturnal animals that rely on their visual system for foraging, mating,
and navigation usually exhibit specific traits associated with living in scotopic
conditions. Most nocturnal birds have several visual specializations, such as
enlarged eyes and an increased orbital convergence. However, the actual role of
binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae)
are predators that actively pursue and capture flying insects in crepuscular and
nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which
pursuit begins with an insect flying over the bird that sits on the ground. In
this study, we describe the visual system of the band-winged nightjar (Systellura
longirostris), with emphasis on anatomical features previously described as relevant
for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull,
was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an
area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes
showed a nocturnal-like normalized corneal aperture/axial length index. Retinal
ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band
pattern, with higher concentrations in the ventrotemporal quadrant. Together,
these results indicate that the band-winged nightjar exhibits a retinal specialization
associated with the binocular area of their dorsal visual field, a relevant area
for pursuit triggering and prey attacks. The RGC distribution observed is unusual
among birds, but similar to that of some visually dependent insectivorous bats,
suggesting that those features might be convergent in relation to feeding strategies.'
article_processing_charge: No
article_type: original
author:
- first_name: Juan Esteban
full_name: Salazar, Juan Esteban
last_name: Salazar
- first_name: Daniel
full_name: Severin, Daniel
last_name: Severin
- first_name: Tomas A
full_name: Vega Zuniga, Tomas A
id: 2E7C4E78-F248-11E8-B48F-1D18A9856A87
last_name: Vega Zuniga
- first_name: Pedro
full_name: Fernández-Aburto, Pedro
last_name: Fernández-Aburto
- first_name: Alfonso
full_name: Deichler, Alfonso
last_name: Deichler
- first_name: Michel
full_name: Sallaberry A., Michel
last_name: Sallaberry A.
- first_name: Jorge
full_name: Mpodozis, Jorge
last_name: Mpodozis
citation:
ama: 'Salazar JE, Severin D, Vega Zuniga TA, et al. Anatomical specializations related
to foraging in the visual system of a nocturnal insectivorous bird, the band-winged
nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 2020;94(1-4):27-36.
doi:10.1159/000504162'
apa: 'Salazar, J. E., Severin, D., Vega Zuniga, T. A., Fernández-Aburto, P., Deichler,
A., Sallaberry A., M., & Mpodozis, J. (2020). Anatomical specializations related
to foraging in the visual system of a nocturnal insectivorous bird, the band-winged
nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. Karger
Publishers. https://doi.org/10.1159/000504162'
chicago: 'Salazar, Juan Esteban, Daniel Severin, Tomas A Vega Zuniga, Pedro Fernández-Aburto,
Alfonso Deichler, Michel Sallaberry A., and Jorge Mpodozis. “Anatomical Specializations
Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the
Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution.
Karger Publishers, 2020. https://doi.org/10.1159/000504162.'
ieee: 'J. E. Salazar et al., “Anatomical specializations related to foraging
in the visual system of a nocturnal insectivorous bird, the band-winged nightjar
(Aves: Caprimulgiformes),” Brain, Behavior and Evolution, vol. 94, no.
1–4. Karger Publishers, pp. 27–36, 2020.'
ista: 'Salazar JE, Severin D, Vega Zuniga TA, Fernández-Aburto P, Deichler A, Sallaberry A.
M, Mpodozis J. 2020. Anatomical specializations related to foraging in the visual
system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes).
Brain, Behavior and Evolution. 94(1–4), 27–36.'
mla: 'Salazar, Juan Esteban, et al. “Anatomical Specializations Related to Foraging
in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar
(Aves: Caprimulgiformes).” Brain, Behavior and Evolution, vol. 94, no.
1–4, Karger Publishers, 2020, pp. 27–36, doi:10.1159/000504162.'
short: J.E. Salazar, D. Severin, T.A. Vega Zuniga, P. Fernández-Aburto, A. Deichler,
M. Sallaberry A., J. Mpodozis, Brain, Behavior and Evolution 94 (2020) 27–36.
date_created: 2019-12-09T09:04:13Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-02-22T15:18:34Z
day: '01'
department:
- _id: MaJö
doi: 10.1159/000504162
external_id:
isi:
- '000522856600004'
pmid:
- '31751995'
intvolume: ' 94'
isi: 1
issue: 1-4
language:
- iso: eng
month: '01'
oa_version: None
page: 27-36
pmid: 1
publication: Brain, Behavior and Evolution
publication_identifier:
eissn:
- 1421-9743
issn:
- 0006-8977
publication_status: published
publisher: Karger Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Anatomical specializations related to foraging in the visual system of a nocturnal
insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 94
year: '2020'
...
---
_id: '6184'
abstract:
- lang: eng
text: We prove edge universality for a general class of correlated real symmetric
or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also
applies to internal edges of the self-consistent density of states. In particular,
we establish a strong form of band rigidity which excludes mismatches between
location and label of eigenvalues close to internal edges in these general models.
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity
and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379'
apa: 'Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated
random matrices: Band rigidity and edge universality. Annals of Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379'
chicago: 'Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder.
“Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of
Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.'
ieee: 'J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices:
Band rigidity and edge universality,” Annals of Probability, vol. 48, no.
2. Institute of Mathematical Statistics, pp. 963–1001, 2020.'
ista: 'Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices:
Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.'
mla: 'Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge
Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical
Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.'
short: J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020)
963–1001.
date_created: 2019-03-28T09:20:08Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2024-02-22T14:34:33Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/19-AOP1379
ec_funded: 1
external_id:
arxiv:
- '1804.07744'
isi:
- '000528269100013'
intvolume: ' 48'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07744
month: '03'
oa: 1
oa_version: Preprint
page: 963-1001
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Annals of Probability
publication_identifier:
issn:
- 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Correlated random matrices: Band rigidity and edge universality'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...