---
_id: '10668'
abstract:
- lang: eng
text: 'Robustness to variations in lighting conditions is a key objective for any
deep vision system. To this end, our paper extends the receptive field of convolutional
neural networks with two residual components, ubiquitous in the visual processing
system of vertebrates: On-center and off-center pathways, with an excitatory center
and inhibitory surround; OOCS for short. The On-center pathway is excited by the
presence of a light stimulus in its center, but not in its surround, whereas the
Off-center pathway is excited by the absence of a light stimulus in its center,
but not in its surround. We design OOCS pathways via a difference of Gaussians,
with their variance computed analytically from the size of the receptive fields.
OOCS pathways complement each other in their response to light stimuli, ensuring
this way a strong edge-detection capability, and as a result an accurate and robust
inference under challenging lighting conditions. We provide extensive empirical
evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness
from the novel edge representation, compared to other baselines.'
acknowledgement: Z.B. is supported by the Doctoral College Resilient Embedded Systems,
which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum
Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad,
and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported
by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF)
under grant Z211-N23 (Wittgenstein Award).
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Zahra
full_name: Babaiee, Zahra
last_name: Babaiee
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive
fields for accurate and robust image classification. In: Proceedings of the
38th International Conference on Machine Learning. Vol 139. ML Research Press;
2021:478-489.'
apa: 'Babaiee, Z., Hasani, R., Lechner, M., Rus, D., & Grosu, R. (2021). On-off
center-surround receptive fields for accurate and robust image classification.
In Proceedings of the 38th International Conference on Machine Learning
(Vol. 139, pp. 478–489). Virtual: ML Research Press.'
chicago: Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu.
“On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.”
In Proceedings of the 38th International Conference on Machine Learning,
139:478–89. ML Research Press, 2021.
ieee: Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround
receptive fields for accurate and robust image classification,” in Proceedings
of the 38th International Conference on Machine Learning, Virtual, 2021, vol.
139, pp. 478–489.
ista: 'Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround
receptive fields for accurate and robust image classification. Proceedings of
the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR,
vol. 139, 478–489.'
mla: Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate
and Robust Image Classification.” Proceedings of the 38th International Conference
on Machine Learning, vol. 139, ML Research Press, 2021, pp. 478–89.
short: Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of
the 38th International Conference on Machine Learning, ML Research Press, 2021,
pp. 478–489.
conference:
end_date: 2021-07-24
location: Virtual
name: 'ML: Machine Learning'
start_date: 2021-07-18
date_created: 2022-01-25T15:46:33Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2025-05-19T11:28:08Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2106.07091'
file:
- access_level: open_access
checksum: d30eae62561bb517d9f978437d7677db
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:38:32Z
date_updated: 2022-01-26T07:38:32Z
file_id: '10681'
file_name: babaiee21a.pdf
file_size: 4246561
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:38:32Z
has_accepted_license: '1'
intvolume: ' 139'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v139/babaiee21a
month: '07'
oa: 1
oa_version: Published Version
page: 478-489
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 38th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: On-off center-surround receptive fields for accurate and robust image classification
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2021'
...
---
_id: '10669'
abstract:
- lang: eng
text: "We show that Neural ODEs, an emerging class of timecontinuous neural networks,
can be verified by solving a set of global-optimization problems. For this purpose,
we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based
technique for constructing a tight Reachtube (an over-approximation of the set
of reachable states\r\nover a given time-horizon), and provide stochastic guarantees
in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids
the infamous wrapping effect (accumulation of over-approximation errors) by performing
local optimization steps to expand safe regions instead of repeatedly forward-propagating
them as is done by deterministic reachability methods. To enable fast local optimizations,
we introduce a novel forward-mode adjoint sensitivity method to compute gradients
without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic
convergence rates for SLR."
acknowledgement: "The authors would like to thank the reviewers for their insightful
comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant
No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin
part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).
SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish
Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599,
CCF-1918225, and CPS-1446832.\r\n"
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Sophie
full_name: Grunbacher, Sophie
last_name: Grunbacher
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Scott A
full_name: Smolka, Scott A
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification
of neural ODEs with stochastic guarantees. In: Proceedings of the AAAI Conference
on Artificial Intelligence. Vol 35. AAAI Press; 2021:11525-11535.'
apa: 'Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &
Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees.
In Proceedings of the AAAI Conference on Artificial Intelligence (Vol.
35, pp. 11525–11535). Virtual: AAAI Press.'
chicago: Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott
A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic
Guarantees.” In Proceedings of the AAAI Conference on Artificial Intelligence,
35:11525–35. AAAI Press, 2021.
ieee: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu,
“On the verification of neural ODEs with stochastic guarantees,” in Proceedings
of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35,
no. 13, pp. 11525–11535.
ista: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On
the verification of neural ODEs with stochastic guarantees. Proceedings of the
AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement
of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.'
mla: Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic
Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence,
vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.
short: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu,
in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press,
2021, pp. 11525–11535.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:47:20Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2012.08863'
file:
- access_level: open_access
checksum: 468d07041e282a1d46ffdae92f709630
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:38:08Z
date_updated: 2022-01-26T07:38:08Z
file_id: '10680'
file_name: 17372-Article Text-20866-1-2-20210518.pdf
file_size: 286906
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:38:08Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17372
month: '05'
oa: 1
oa_version: Published Version
page: 11525-11535
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: On the verification of neural ODEs with stochastic guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10670'
abstract:
- lang: eng
text: "Imitation learning enables high-fidelity, vision-based learning of policies
within rich, photorealistic environments. However, such techniques often rely
on traditional discrete-time neural models and face difficulties in generalizing
to domain shifts by failing to account for the causal relationships between the
agent and the environment. In this paper, we propose a theoretical and experimental
framework for learning causal representations using continuous-time neural networks,
specifically over their discrete-time counterparts. We evaluate our method in
the context of visual-control learning of drones over a series of complex tasks,
ranging from short- and long-term navigation, to chasing static and dynamic objects
through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep
models can perform robust navigation tasks, where advanced recurrent models fail.
These models learn complex causal control representations directly from raw visual
inputs and scale to solve a variety of tasks using imitation learning."
acknowledgement: "C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT.
A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship
Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant
Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force
Research Laboratory and the United States Air Force Artificial Intelligence Accelerator
and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views
and conclusions contained in this document are those of the authors\r\nand should
not be interpreted as representing the official policies, either expressed or implied,
of the United States Air Force or the U.S. Government. The U.S. Government is authorized
to reproduce and distribute reprints for Government purposes notwithstanding any
copyright notation herein.\r\n"
alternative_title:
- ' Advances in Neural Information Processing Systems'
article_processing_charge: No
arxiv: 1
author:
- first_name: Charles J
full_name: Vorbach, Charles J
last_name: Vorbach
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
citation:
ama: 'Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time
neural networks. In: 35th Conference on Neural Information Processing Systems.
; 2021.'
apa: Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., & Rus, D. (2021). Causal
navigation by continuous-time neural networks. In 35th Conference on Neural
Information Processing Systems. Virtual.
chicago: Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and
Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In 35th
Conference on Neural Information Processing Systems, 2021.
ieee: C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation
by continuous-time neural networks,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021.
ista: 'Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation
by continuous-time neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, .'
mla: Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.”
35th Conference on Neural Information Processing Systems, 2021.
short: C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference
on Neural Information Processing Systems, 2021.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2022-01-25T15:47:50Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2106.08314'
file:
- access_level: open_access
checksum: be81f0ade174a8c9b2d4fe09590b2021
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:37:24Z
date_updated: 2022-01-26T07:37:24Z
file_id: '10679'
file_name: NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf
file_size: 6841228
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:37:24Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
quality_controlled: '1'
status: public
title: Causal navigation by continuous-time neural networks
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10671'
abstract:
- lang: eng
text: We introduce a new class of time-continuous recurrent neural network models.
Instead of declaring a learning system’s dynamics by implicit nonlinearities,
we construct networks of linear first-order dynamical systems modulated via nonlinear
interlinked gates. The resulting models represent dynamical systems with varying
(i.e., liquid) time-constants coupled to their hidden state, with outputs being
computed by numerical differential equation solvers. These neural networks exhibit
stable and bounded behavior, yield superior expressivity within the family of
neural ordinary differential equations, and give rise to improved performance
on time-series prediction tasks. To demonstrate these properties, we first take
a theoretical approach to find bounds over their dynamics, and compute their expressive
power by the trajectory length measure in a latent trajectory space. We then conduct
a series of time-series prediction experiments to manifest the approximation capability
of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.
acknowledgement: "R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were
partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40).
M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
(Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF)
Graduate Research Fellowship Program. This research work is partially drawn from
the PhD dissertation of R.H."
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks.
In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol
35. AAAI Press; 2021:7657-7666.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2021). Liquid
time-constant networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.'
chicago: Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:7657–66. AAAI Press, 2021.
ieee: R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant
networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant
networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 7657–7666.'
mla: Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021,
pp. 7657–66.
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:48:36Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2006.04439'
file:
- access_level: open_access
checksum: 0f06995fba06dbcfa7ed965fc66027ff
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:36:03Z
date_updated: 2022-01-26T07:36:03Z
file_id: '10678'
file_name: 16936-Article Text-20430-1-2-20210518 (1).pdf
file_size: 4302669
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:36:03Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16936
month: '05'
oa: 1
oa_version: Published Version
page: 7657-7666
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: Liquid time-constant networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10674'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M
2369-N33 (Meitner fellowship).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
apa: Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games.” Logical Methods in Computer Science. International
Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021.
ieee: M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” Logical Methods in Computer Science, vol. 17,
no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
ista: Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
mla: Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration
Games.” Logical Methods in Computer Science, vol. 17, no. 1, International
Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.
short: M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science
17 (2021) 10:1-10:23.
corr_author: '1'
date_created: 2022-01-25T16:32:13Z
date_published: 2021-02-03T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '03'
ddc:
- '510'
department:
- _id: ToHe
doi: 10.23638/LMCS-17(1:10)2021
external_id:
arxiv:
- '1905.03588'
isi:
- '000658724600010'
file:
- access_level: open_access
checksum: b35586a50ed1ca8f44767de116d18d81
content_type: application/pdf
creator: alisjak
date_created: 2022-01-26T08:04:50Z
date_updated: 2022-01-26T08:04:50Z
file_id: '10690'
file_name: 2021_LMCS_AGHAJOHAR.pdf
file_size: 819878
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:50Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '1'
keyword:
- computer science
- computer science and game theory
- logic in computer science
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 10:1-10:23
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Logical Methods in Computer Science
publication_identifier:
eissn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 17
year: '2021'
...
---
_id: '10688'
abstract:
- lang: eng
text: "Civl is a static verifier for concurrent programs designed around the conceptual
framework of layered refinement,\r\nwhich views the task of verifying a program
as a sequence of program simplification steps each justified by its own invariant.
Civl verifies a layered concurrent program that compactly expresses all the programs
in this sequence and the supporting invariants. This paper presents the design
and implementation of the Civl verifier."
acknowledgement: This research was performed while Bernhard Kragl was at IST Austria,
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein
Award).
alternative_title:
- Conference Series
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design. Vol 2.
TU Wien Academic Press; 2021:143–152. doi:10.34727/2021/isbn.978-3-85448-046-4_23'
apa: 'Kragl, B., & Qadeer, S. (2021). The Civl verifier. In P. Ruzica &
M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in
Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23'
chicago: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design, edited
by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23.
ieee: B. Kragl and S. Qadeer, “The Civl verifier,” in Proceedings of the 21st
Conference on Formal Methods in Computer-Aided Design, Virtual, 2021, vol.
2, pp. 143–152.
ista: 'Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference
on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided
Design, Conference Series, vol. 2, 143–152.'
mla: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac
Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152,
doi:10.34727/2021/isbn.978-3-85448-046-4_23.
short: B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press,
2021, pp. 143–152.
conference:
end_date: 2021-10-22
location: Virtual
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2021-10-20
corr_author: '1'
date_created: 2022-01-26T08:01:30Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.34727/2021/isbn.978-3-85448-046-4_23
editor:
- first_name: Piskac
full_name: Ruzica, Piskac
last_name: Ruzica
- first_name: Michael W.
full_name: Whalen, Michael W.
last_name: Whalen
file:
- access_level: open_access
checksum: 35438ac9f9750340b7f8ae4ae3220d9f
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T08:04:29Z
date_updated: 2022-01-26T08:04:29Z
file_id: '10689'
file_name: 2021_FCAD2021_Kragl.pdf
file_size: 390555
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:29Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 143–152
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 21st Conference on Formal Methods in Computer-Aided
Design
publication_identifier:
isbn:
- 978-3-85448-046-4
publication_status: published
publisher: TU Wien Academic Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Civl verifier
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2021'
...
---
_id: '10692'
abstract:
- lang: eng
text: We experimentally investigate narrow and topologically nontrivial moiré minibands
hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally
faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons
per moiré unit cell within these bands, we observe quantized anomalous Hall effects
with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single
valley-projected band with Chern number C= 2. Remarkably, we also observe the
evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3
we find that the sign of the quantum anomalous Hall effect can be reversed via
field-effect control of the chemical potential. This curious effect arises from
the magnetization contribution due to topological edge states, which drive a reversal
of the total magnetization and thus a switch of the favored magnetic state. Remarkably,
we find that this switch is hysteretic, which we use to demonstrate non-volatile
electric-field-induced reversal of the magnetic state. Voltage control of magnetic
states can be used to electrically pattern nonvolatile magnetic domain structures
hosting chiral edge states, with applications ranging from reconfigurable microwave
circuit elements to ultra-low-power magnetic memory.
alternative_title:
- Bulletin of the American Physical Society
article_number: E42.00010
article_processing_charge: No
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Jihang
full_name: Zhu, Jihang
last_name: Zhu
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: Fangyuan
full_name: Yang, Fangyuan
last_name: Yang
- first_name: Charles
full_name: Tschirhart, Charles
last_name: Tschirhart
- first_name: Marec
full_name: Serlin, Marec
last_name: Serlin
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Takashi
full_name: Tanaguchi, Takashi
last_name: Tanaguchi
- first_name: Allan
full_name: MacDonald, Allan
last_name: MacDonald
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted
monolayer-bilayer graphene and electrical switching of topological and magnetic
order. In: APS March Meeting 2021. Vol 66. American Physical Society; 2021.'
apa: 'Polshyn, H., Zhu, J., Kumar, M., Zhang, Y., Yang, F., Tschirhart, C., … Young,
A. (2021). Orbital Chern insulator states in twisted monolayer-bilayer graphene
and electrical switching of topological and magnetic order. In APS March Meeting
2021 (Vol. 66). Virtual: American Physical Society.'
chicago: Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang,
Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted
Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic
Order.” In APS March Meeting 2021, Vol. 66. American Physical Society,
2021.
ieee: H. Polshyn et al., “Orbital Chern insulator states in twisted monolayer-bilayer
graphene and electrical switching of topological and magnetic order,” in APS
March Meeting 2021, Virtual, 2021, vol. 66, no. 1.
ista: 'Polshyn H, Zhu J, Kumar M, Zhang Y, Yang F, Tschirhart C, Serlin M, Watanabe
K, Tanaguchi T, MacDonald A, Young A. 2021. Orbital Chern insulator states in
twisted monolayer-bilayer graphene and electrical switching of topological and
magnetic order. APS March Meeting 2021. APS: American Physical Society, Bulletin
of the American Physical Society, vol. 66, E42.00010.'
mla: Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer
Graphene and Electrical Switching of Topological and Magnetic Order.” APS March
Meeting 2021, vol. 66, no. 1, E42.00010, American Physical Society, 2021.
short: H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin,
K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021,
American Physical Society, 2021.
conference:
end_date: 2021-03-19
location: Virtual
name: 'APS: American Physical Society'
start_date: 2021-03-15
date_created: 2022-01-27T09:49:48Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2022-01-27T10:46:23Z
day: '01'
extern: '1'
intvolume: ' 66'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR21/Session/E42.10
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2021
publication_identifier:
issn:
- 0003-0503
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical
switching of topological and magnetic order
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 66
year: '2021'
...
---
_id: '10694'
abstract:
- lang: eng
text: 'In a two-player zero-sum graph game the players move a token throughout a
graph to produce an infinite path, which determines the winner or payoff of the
game. Traditionally, the players alternate turns in moving the token. In bidding
games, however, the players have budgets, and in each turn, we hold an “auction”
(bidding) to determine which player moves the token: both players simultaneously
submit bids and the higher bidder moves the token. The bidding mechanisms differ
in their payment schemes. Bidding games were largely studied with variants of
first-price bidding in which only the higher bidder pays his bid. We focus on
all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding
games were studied and shown to be technically more challenging than their first-price
counterparts. We study for the first time, infinite-duration all-pay bidding games.
Our most interesting results are for mean-payoff objectives: we portray a complete
picture for games played on strongly-connected graphs. We study both pure (deterministic)
and mixed (probabilistic) strategies and completely characterize the optimal and
almost-sure (with probability 1) payoffs the players can respectively guarantee.
We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical
properties of their first-price counterparts; namely, an equivalence with random-turn
games in which in each turn, the player who moves is selected according to a (biased)
coin toss. The equivalences for all-pay bidding are more intricate and unexpected
than for first-price bidding.'
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
by the European Union's Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In:
Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38'
apa: 'Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay
bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium
on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and
Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38'
chicago: Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay
Bidding Games.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics,
2021. https://doi.org/10.1137/1.9781611976465.38.
ieee: G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding
games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
Virtual, 2021, pp. 617–636.
ista: 'Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 617–636.'
mla: Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings
of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx,
Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
short: G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the
2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2021, pp. 617–636.
conference:
end_date: 2021-01-13
location: Virtual
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
corr_author: '1'
date_created: 2022-01-27T12:11:23Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-04-15T06:26:15Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1137/1.9781611976465.38
ec_funded: 1
editor:
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
external_id:
arxiv:
- '2005.06636'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.06636
month: '01'
oa: 1
oa_version: Preprint
page: 617-636
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- 978-1-61197-646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Infinite-duration all-pay bidding games
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10711'
abstract:
- lang: eng
text: In this paper, we investigate the distribution of the maximum of partial sums
of families of m -periodic complex-valued functions satisfying certain conditions.
We obtain precise uniform estimates for the distribution function of this maximum
in a near-optimal range. Our results apply to partial sums of Kloosterman sums
and other families of ℓ -adic trace functions, and are as strong as those obtained
by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular,
we improve on the recent work of the third author for Birch sums. However, unlike
character sums, we are able to construct families of m -periodic complex-valued
functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality
is sharp.
acknowledgement: We would like to thank the anonymous referees for carefully reading
the paper and for their remarks and suggestions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pascal
full_name: Autissier, Pascal
last_name: Autissier
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
- first_name: Youness
full_name: Lamzouri, Youness
last_name: Lamzouri
citation:
ama: Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial
sums of Kloosterman sums and other trace functions. Compositio Mathematica.
2021;157(7):1610-1651. doi:10.1112/s0010437x21007351
apa: Autissier, P., Bonolis, D., & Lamzouri, Y. (2021). The distribution of
the maximum of partial sums of Kloosterman sums and other trace functions. Compositio
Mathematica. Cambridge University Press. https://doi.org/10.1112/s0010437x21007351
chicago: Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution
of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.”
Compositio Mathematica. Cambridge University Press, 2021. https://doi.org/10.1112/s0010437x21007351.
ieee: P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions,” Compositio
Mathematica, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.
ista: Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica.
157(7), 1610–1651.
mla: Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums
of Kloosterman Sums and Other Trace Functions.” Compositio Mathematica,
vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:10.1112/s0010437x21007351.
short: P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021)
1610–1651.
corr_author: '1'
date_created: 2022-02-01T08:10:43Z
date_published: 2021-06-28T00:00:00Z
date_updated: 2024-10-21T06:02:06Z
day: '28'
department:
- _id: TiBr
doi: 10.1112/s0010437x21007351
external_id:
arxiv:
- '1909.03266'
isi:
- '000667289300001'
intvolume: ' 157'
isi: 1
issue: '7'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.03266
month: '06'
oa: 1
oa_version: Preprint
page: 1610-1651
publication: Compositio Mathematica
publication_identifier:
eissn:
- 1570-5846
issn:
- 0010-437X
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The distribution of the maximum of partial sums of Kloosterman sums and other
trace functions
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 157
year: '2021'
...
---
_id: '10738'
abstract:
- lang: eng
text: We prove an adiabatic theorem for the Landau–Pekar equations. This allows
us to derive new results on the accuracy of their use as effective equations for
the time evolution generated by the Fröhlich Hamiltonian with large coupling constant
α. In particular, we show that the time evolution of Pekar product states with
coherent phonon field and the electron being trapped by the phonons is well approximated
by the Landau–Pekar equations until times short compared to α2.
acknowledgement: "N. L. and R. S. gratefully acknowledge financial support by the
European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support
from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR
SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for
interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for
stimulating discussions about the time-evolution of a polaron.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations:
Adiabatic theorem and accuracy. Analysis and PDE. 2021;14(7):2079-2100.
doi:10.2140/APDE.2021.14.2079'
apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., & Seiringer, R. (2021). The
Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE.
Mathematical Sciences Publishers. https://doi.org/10.2140/APDE.2021.14.2079'
chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
Analysis and PDE. Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/APDE.2021.14.2079.'
ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar
equations: Adiabatic theorem and accuracy,” Analysis and PDE, vol. 14,
no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.'
ista: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar
equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.'
mla: 'Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem
and Accuracy.” Analysis and PDE, vol. 14, no. 7, Mathematical Sciences
Publishers, 2021, pp. 2079–100, doi:10.2140/APDE.2021.14.2079.'
short: N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE
14 (2021) 2079–2100.
corr_author: '1'
date_created: 2022-02-06T23:01:33Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2025-04-14T07:26:53Z
day: '10'
department:
- _id: RoSe
doi: 10.2140/APDE.2021.14.2079
ec_funded: 1
external_id:
arxiv:
- '1904.12532'
isi:
- '000733976600004'
intvolume: ' 14'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.12532
month: '11'
oa: 1
oa_version: Preprint
page: 2079-2100
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Analysis and PDE
publication_identifier:
eissn:
- 1948-206X
issn:
- 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' The Landau–Pekar equations: Adiabatic theorem and accuracy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2021'
...
---
_id: '10762'
abstract:
- lang: eng
text: Methods inspired from machine learning have recently attracted great interest
in the computational study of quantum many-particle systems. So far, however,
it has proven challenging to deal with microscopic models in which the total number
of particles is not conserved. To address this issue, we propose a new variant
of neural network states, which we term neural coherent states. Taking the Fröhlich
impurity model as a case study, we show that neural coherent states can learn
the ground state of non-additive systems very well. In particular, we observe
substantial improvement over the standard coherent state estimates in the most
challenging intermediate coupling regime. Our approach is generic and does not
assume specific details of the system, suggesting wide applications.
acknowledgement: "We acknowledge fruitful discussions with Giacomo Bighin, Giammarco
Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages
of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy
of Sciences and has received funding from the EU Horizon 2020 programme under the
Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support
by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This
work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy
research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences,
FOM and STW."
article_processing_charge: No
arxiv: 1
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Johan H.
full_name: Mentink, Johan H.
last_name: Mentink
citation:
ama: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193
apa: Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural
network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193
chicago: Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial
Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.
ieee: W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network
states for non-additive systems,” arXiv. .
ista: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv, 10.48550/arXiv.2105.15193.
mla: Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive
Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.
short: W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-17T11:18:57Z
date_published: 2021-05-31T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '31'
department:
- _id: MiLe
doi: 10.48550/arXiv.2105.15193
ec_funded: 1
external_id:
arxiv:
- '2105.15193'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.15193
month: '05'
oa: 1
oa_version: Preprint
page: '2105.15193'
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
status: public
title: Artificial neural network states for non-additive systems
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10803'
abstract:
- lang: eng
text: Given the abundance of applications of ranking in recent years, addressing
fairness concerns around automated ranking systems becomes necessary for increasing
the trust among end-users. Previous work on fair ranking has mostly focused on
application-specific fairness notions, often tailored to online advertising, and
it rarely considers learning as part of the process. In this work, we show how
to transfer numerous fairness notions from binary classification to a learning
to rank setting. Our formalism allows us to design methods for incorporating fairness
objectives with provable generalization guarantees. An extensive experimental
evaluation shows that our method can improve ranking fairness substantially with
no or only little loss of model quality.
article_number: '2102.05996'
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0002-4561-241X
citation:
ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv. doi:10.48550/arXiv.2102.05996
apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization
for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.
ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning
to rank,” arXiv. .
ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv, 2102.05996.
mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.
short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-28T14:13:59Z
date_published: 2021-06-07T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '07'
department:
- _id: ChLa
doi: 10.48550/arXiv.2102.05996
external_id:
arxiv:
- '2102.05996'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05996
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
status: public
title: Fairness through regularization for learning to rank
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10806'
abstract:
- lang: eng
text: Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal
syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’
chemical reactivity and electronic structure. Surface chemistry is thus crucial
to understand nanocrystal properties and functionality. Here, we investigate the
synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate
precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals
are capped exclusively with a fatty acid instead of oleylamine. Analysis of the
reaction mixtures with nuclear magnetic resonance spectroscopy revealed several
reaction byproducts and intermediates that are common to the decomposition of
Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of
alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive
surface chemistry.
acknowledgement: 'This work was financially supported by IST Austria and the Werner
Siemens Foundation. M.C. has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385. The work was also financially supported by University of Basel, SNSF
NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project
number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia
program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Mariano
full_name: Calcabrini, Mariano
id: 45D7531A-F248-11E8-B48F-1D18A9856A87
last_name: Calcabrini
orcid: 0000-0003-4566-5877
- first_name: Dietger
full_name: Van den Eynden, Dietger
last_name: Van den Eynden
- first_name: Sergi
full_name: Sanchez Ribot, Sergi
id: ddae5a59-f6e0-11ea-865d-d9dc61e77a2a
last_name: Sanchez Ribot
- first_name: Rohan
full_name: Pokratath, Rohan
last_name: Pokratath
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Jonathan
full_name: De Roo, Jonathan
last_name: De Roo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion
in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate.
JACS Au. 2021;1(11):1898-1903. doi:10.1021/jacsau.1c00349'
apa: 'Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca,
J., De Roo, J., & Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate. JACS Au. American
Chemical Society. https://doi.org/10.1021/jacsau.1c00349'
chicago: 'Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan
Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion
in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.”
JACS Au. American Chemical Society, 2021. https://doi.org/10.1021/jacsau.1c00349.'
ieee: 'M. Calcabrini et al., “Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate,” JACS Au, vol.
1, no. 11. American Chemical Society, pp. 1898–1903, 2021.'
ista: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De
Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation
of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.'
mla: 'Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The
Oxidation of Alkylamines to Fatty Acids by Nitrate.” JACS Au, vol. 1, no.
11, American Chemical Society, 2021, pp. 1898–903, doi:10.1021/jacsau.1c00349.'
short: M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca,
J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.
corr_author: '1'
date_created: 2022-03-02T15:24:16Z
date_published: 2021-11-22T00:00:00Z
date_updated: 2026-04-07T13:26:13Z
day: '22'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/jacsau.1c00349
ec_funded: 1
file:
- access_level: open_access
checksum: 1c66a35369e911312a359111420318a9
content_type: application/pdf
creator: cchlebak
date_created: 2022-03-02T15:33:18Z
date_updated: 2022-03-02T15:33:18Z
file_id: '10807'
file_name: 2021_JACSAu_Calcabrini.pdf
file_size: 1257973
relation: main_file
success: 1
file_date_updated: 2022-03-02T15:33:18Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '11'
keyword:
- general medicine
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1898-1903
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: JACS Au
publication_identifier:
eissn:
- 2691-3704
issn:
- 2691-3704
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.26434/chemrxiv-2021-cn2fr
record:
- id: '12885'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to
fatty acids by nitrate'
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 1
year: '2021'
...
---
_id: '10809'
abstract:
- lang: eng
text: Thermoelectric materials are engines that convert heat into an electrical
current. Intuitively, the efficiency of this process depends on how many electrons
(charge carriers) can move and how easily they do so, how much energy those moving
electrons transport, and how easily the temperature gradient is maintained. In
terms of material properties, an excellent thermoelectric material requires a
high electrical conductivity σ, a high Seebeck coefficient S (a measure of the
induced thermoelectric voltage as a function of temperature gradient), and a low
thermal conductivity κ. The challenge is that these three properties are strongly
interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury
et al. (2) have found a way to partially break these ties in silver antimony telluride
(AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering
in this inherently disordered thermoelectric material.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Liu Y, Ibáñez M. Tidying up the mess. Science. 2021;371(6530):678-679.
doi:10.1126/science.abg0886
apa: Liu, Y., & Ibáñez, M. (2021). Tidying up the mess. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.abg0886
chicago: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science. American
Association for the Advancement of Science, 2021. https://doi.org/10.1126/science.abg0886.
ieee: Y. Liu and M. Ibáñez, “Tidying up the mess,” Science, vol. 371, no.
6530. American Association for the Advancement of Science, pp. 678–679, 2021.
ista: Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.
mla: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science, vol. 371,
no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79,
doi:10.1126/science.abg0886.
short: Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.
corr_author: '1'
date_created: 2022-03-03T09:51:48Z
date_published: 2021-02-12T00:00:00Z
date_updated: 2024-10-09T21:01:45Z
day: '12'
department:
- _id: MaIb
doi: 10.1126/science.abg0886
external_id:
isi:
- '000617551600027'
pmid:
- '33574201'
intvolume: ' 371'
isi: 1
issue: '6530'
keyword:
- multidisciplinary
language:
- iso: eng
month: '02'
oa_version: None
page: 678-679
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tidying up the mess
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2021'
...
---
_id: '17384'
abstract:
- lang: eng
text: Basket weaving is a traditional craft for creating curved surfaces as an interwoven
array of thin, flexible, and initially straight ribbons. The three-dimensional
shape of a woven structure emerges through a complex interplay of the elastic
bending behavior of the ribbons and the contact forces at their crossings. Curvature
can be injected by carefully placing topological singularities in the otherwise
regular weaving pattern. However, shape control through topology is highly non-trivial
and inherently discrete, which severely limits the range of attainable woven geometries.
Here, we demonstrate how to construct arbitrary smooth free-form surface geometries
by weaving carefully optimized curved ribbons. We present an optimization-based
approach to solving the inverse design problem for such woven structures. Our
algorithm computes the ribbons' planar geometry such that their interwoven assembly
closely approximates a given target design surface in equilibrium. We systematically
validate our approach through a series of physical prototypes to show a broad
range of new woven geometries that is not achievable by existing methods. We anticipate
our computational approach to significantly enhance the capabilities for the design
of new woven structures. Facilitated by modern digital fabrication technology,
we see potential applications in material science, bio- and mechanical engineering,
art, design, and architecture.
article_processing_charge: No
article_type: original
author:
- first_name: Yingying
full_name: Ren, Yingying
id: 93d68d10-3540-11ef-a265-f748a50dba3d
last_name: Ren
- first_name: Julian
full_name: Panetta, Julian
last_name: Panetta
- first_name: Tian
full_name: Chen, Tian
last_name: Chen
- first_name: Florin
full_name: Isvoranu, Florin
last_name: Isvoranu
- first_name: Samuel
full_name: Poincloux, Samuel
last_name: Poincloux
- first_name: Christopher
full_name: Brandt, Christopher
last_name: Brandt
- first_name: Alison
full_name: Martin, Alison
last_name: Martin
- first_name: Mark
full_name: Pauly, Mark
last_name: Pauly
citation:
ama: Ren Y, Panetta J, Chen T, et al. 3D weaving with curved ribbons. ACM Transactions
on Graphics. 2021;40(4):1-15. doi:10.1145/3450626.3459788
apa: Ren, Y., Panetta, J., Chen, T., Isvoranu, F., Poincloux, S., Brandt, C., …
Pauly, M. (2021). 3D weaving with curved ribbons. ACM Transactions on Graphics.
Association for Computing Machinery. https://doi.org/10.1145/3450626.3459788
chicago: Ren, Yingying, Julian Panetta, Tian Chen, Florin Isvoranu, Samuel Poincloux,
Christopher Brandt, Alison Martin, and Mark Pauly. “3D Weaving with Curved Ribbons.”
ACM Transactions on Graphics. Association for Computing Machinery, 2021.
https://doi.org/10.1145/3450626.3459788.
ieee: Y. Ren et al., “3D weaving with curved ribbons,” ACM Transactions
on Graphics, vol. 40, no. 4. Association for Computing Machinery, pp. 1–15,
2021.
ista: Ren Y, Panetta J, Chen T, Isvoranu F, Poincloux S, Brandt C, Martin A, Pauly
M. 2021. 3D weaving with curved ribbons. ACM Transactions on Graphics. 40(4),
1–15.
mla: Ren, Yingying, et al. “3D Weaving with Curved Ribbons.” ACM Transactions
on Graphics, vol. 40, no. 4, Association for Computing Machinery, 2021, pp.
1–15, doi:10.1145/3450626.3459788.
short: Y. Ren, J. Panetta, T. Chen, F. Isvoranu, S. Poincloux, C. Brandt, A. Martin,
M. Pauly, ACM Transactions on Graphics 40 (2021) 1–15.
date_created: 2024-08-05T06:30:27Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2024-08-12T09:38:19Z
day: '01'
doi: 10.1145/3450626.3459788
extern: '1'
intvolume: ' 40'
issue: '4'
language:
- iso: eng
month: '08'
oa_version: None
page: 1-15
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3D weaving with curved ribbons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2021'
...
---
_id: '17422'
abstract:
- lang: eng
text: Inspired by motion patterns of some commercially available mobile robots,
we investigate the power of robots that move forward in straight lines until colliding
with an environment boundary, at which point they can rotate in place and move
forward again; we visualize this as the robot “bouncing” off boundaries. We define
bounce rules governing how the robot should reorient after reaching a boundary,
such as reorienting relative to its heading prior to collision, or relative to
the normal of the boundary. We then generate plans as sequences of rules, using
the bounce visibility graph generated from a polygonal environment definition,
while assuming we have unavoidable non-determinism in our actuation. Our planner
can be queried to determine the feasibility of tasks such as reaching goal sets
and patrolling (repeatedly visiting a sequence of goals). If the task is found
feasible, the planner provides a sequence of non-deterministic interaction rules,
which also provide information on how precisely the robot must execute the plan
to succeed. We also show how to compute stable cyclic trajectories and use these
to limit uncertainty in the robot’s position.
article_processing_charge: No
article_type: original
author:
- first_name: Alexandra Q
full_name: Nilles, Alexandra Q
last_name: Nilles
- first_name: Yingying
full_name: Ren, Yingying
id: 93d68d10-3540-11ef-a265-f748a50dba3d
last_name: Ren
- first_name: Israel
full_name: Becerra, Israel
last_name: Becerra
- first_name: Steven M
full_name: LaValle, Steven M
last_name: LaValle
citation:
ama: Nilles AQ, Ren Y, Becerra I, LaValle SM. A visibility-based approach to computing
non-deterministic bouncing strategies. The International Journal of Robotics
Research. 2021;40(10-11):1196-1211. doi:10.1177/0278364921992788
apa: Nilles, A. Q., Ren, Y., Becerra, I., & LaValle, S. M. (2021). A visibility-based
approach to computing non-deterministic bouncing strategies. The International
Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364921992788
chicago: Nilles, Alexandra Q, Yingying Ren, Israel Becerra, and Steven M LaValle.
“A Visibility-Based Approach to Computing Non-Deterministic Bouncing Strategies.”
The International Journal of Robotics Research. SAGE Publications, 2021.
https://doi.org/10.1177/0278364921992788.
ieee: A. Q. Nilles, Y. Ren, I. Becerra, and S. M. LaValle, “A visibility-based approach
to computing non-deterministic bouncing strategies,” The International Journal
of Robotics Research, vol. 40, no. 10–11. SAGE Publications, pp. 1196–1211,
2021.
ista: Nilles AQ, Ren Y, Becerra I, LaValle SM. 2021. A visibility-based approach
to computing non-deterministic bouncing strategies. The International Journal
of Robotics Research. 40(10–11), 1196–1211.
mla: Nilles, Alexandra Q., et al. “A Visibility-Based Approach to Computing Non-Deterministic
Bouncing Strategies.” The International Journal of Robotics Research, vol.
40, no. 10–11, SAGE Publications, 2021, pp. 1196–211, doi:10.1177/0278364921992788.
short: A.Q. Nilles, Y. Ren, I. Becerra, S.M. LaValle, The International Journal
of Robotics Research 40 (2021) 1196–1211.
date_created: 2024-08-12T10:01:27Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-08-12T10:15:14Z
day: '01'
doi: 10.1177/0278364921992788
extern: '1'
intvolume: ' 40'
issue: 10-11
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1177/0278364921992788
month: '09'
oa: 1
oa_version: Published Version
page: 1196-1211
publication: The International Journal of Robotics Research
publication_identifier:
eissn:
- 1741-3176
issn:
- 0278-3649
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: A visibility-based approach to computing non-deterministic bouncing strategies
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2021'
...
---
_id: '17505'
abstract:
- lang: eng
text: "Given the central role that C continues to play in systems software, and
the difficulty of writing safe and correct C code, it remains a grand challenge
to develop effective formal methods for verifying C programs. In this paper, we
propose a new approach to this problem: a type system we call RefinedC, which
combines ownership types (for modular reasoning about shared state and concurrency)
with refinement types (for encoding precise invariants on C data types and Hoare-style
specifications for C functions).\r\nRefinedC is both automated (requiring minimal
user intervention) and foundational (producing a proof of program correctness
in Coq), while at the same time handling a range of low-level programming idioms
such as pointer arithmetic. In particular, following the approach of RustBelt,
the soundness of the RefinedC type system is justified semantically by interpretation
into the Coq-based Iris framework for higher-order concurrent separation logic.
However, the typing rules of RefinedC are also designed to be encodable in a new
“separation logic programming” language we call Lithium. By restricting to a carefully
chosen (yet expressive) fragment of separation logic, Lithium supports predictable,
automatic, goal-directed proof search without backtracking. We demonstrate the
effectiveness of RefinedC on a range of representative examples of C code."
article_processing_charge: No
author:
- first_name: Michael Joachim
full_name: Sammler, Michael Joachim
id: 510d3901-2a03-11ee-914d-d9ae9011f0a7
last_name: Sammler
- first_name: Rodolphe
full_name: Lepigre, Rodolphe
last_name: Lepigre
- first_name: Robbert
full_name: Krebbers, Robbert
last_name: Krebbers
- first_name: Kayvan
full_name: Memarian, Kayvan
last_name: Memarian
- first_name: Derek
full_name: Dreyer, Derek
last_name: Dreyer
- first_name: Deepak
full_name: Garg, Deepak
last_name: Garg
citation:
ama: 'Sammler MJ, Lepigre R, Krebbers R, Memarian K, Dreyer D, Garg D. RefinedC:
Automating the foundational verification of C code with refined ownership types.
In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation. Association for Computing Machinery; 2021:158-174.
doi:10.1145/3453483.3454036'
apa: 'Sammler, M. J., Lepigre, R., Krebbers, R., Memarian, K., Dreyer, D., &
Garg, D. (2021). RefinedC: Automating the foundational verification of C code
with refined ownership types. In Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation (pp. 158–174).
virtual: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454036'
chicago: 'Sammler, Michael Joachim, Rodolphe Lepigre, Robbert Krebbers, Kayvan Memarian,
Derek Dreyer, and Deepak Garg. “RefinedC: Automating the Foundational Verification
of C Code with Refined Ownership Types.” In Proceedings of the 42nd ACM SIGPLAN
International Conference on Programming Language Design and Implementation,
158–74. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454036.'
ieee: 'M. J. Sammler, R. Lepigre, R. Krebbers, K. Memarian, D. Dreyer, and D. Garg,
“RefinedC: Automating the foundational verification of C code with refined ownership
types,” in Proceedings of the 42nd ACM SIGPLAN International Conference on
Programming Language Design and Implementation, virtual, 2021, pp. 158–174.'
ista: 'Sammler MJ, Lepigre R, Krebbers R, Memarian K, Dreyer D, Garg D. 2021. RefinedC:
Automating the foundational verification of C code with refined ownership types.
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language
Design and Implementation. PLDI: Conference on Programming Language Design and
Implementation, 158–174.'
mla: 'Sammler, Michael Joachim, et al. “RefinedC: Automating the Foundational Verification
of C Code with Refined Ownership Types.” Proceedings of the 42nd ACM SIGPLAN
International Conference on Programming Language Design and Implementation,
Association for Computing Machinery, 2021, pp. 158–74, doi:10.1145/3453483.3454036.'
short: M.J. Sammler, R. Lepigre, R. Krebbers, K. Memarian, D. Dreyer, D. Garg, in:,
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language
Design and Implementation, Association for Computing Machinery, 2021, pp. 158–174.
conference:
end_date: 2021-06-25
location: virtual
name: 'PLDI: Conference on Programming Language Design and Implementation'
start_date: 2021-06-20
date_created: 2024-09-05T08:34:50Z
date_published: 2021-06-18T00:00:00Z
date_updated: 2024-09-10T11:54:22Z
day: '18'
doi: 10.1145/3453483.3454036
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3453483.3454036
month: '06'
oa: 1
oa_version: Published Version
page: 158-174
publication: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'RefinedC: Automating the foundational verification of C code with refined
ownership types'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2021'
...
---
_id: '17508'
abstract:
- lang: eng
text: "This paper presents the ESA Voyage 2050 White Paper for a concept of TeraHertz
Exploration and Zooming-in for Astrophysics (THEZA). It addresses the science
case and some implementation issues of a space-borne radio interferometric system
for ultra-sharp imaging of celestial radio sources at the level of angular resolution
down to (sub-) microarcseconds. THEZA focuses at millimetre and sub-millimetre
wavelengths (frequencies above \r\n300 GHz), but allows for science operations
at longer wavelengths too. The THEZA concept science rationale is focused on the
physics of spacetime in the vicinity of supermassive black holes as the leading
science driver. The main aim of the concept is to facilitate a major leap by providing
researchers with orders of magnitude improvements in the resolution and dynamic
range in direct imaging studies of the most exotic objects in the Universe, black
holes. The concept will open up a sizeable range of hitherto unreachable parameters
of observational astrophysics. It unifies two major lines of development of space-borne
radio astronomy of the past decades: Space VLBI (Very Long Baseline Interferometry)
and mm- and sub-mm astrophysical studies with “single dish” instruments. It also
builds upon the recent success of the Earth-based Event Horizon Telescope (EHT)
– the first-ever direct image of a shadow of the super-massive black hole in the
centre of the galaxy M87. As an amalgam of these three major areas of modern observational
astrophysics, THEZA aims at facilitating a breakthrough in high-resolution high
image quality studies in the millimetre and sub-millimetre domain of the electromagnetic
spectrum."
alternative_title:
- An ESA Voyage 2050 White Paper
article_processing_charge: No
article_type: original
author:
- first_name: Leonid I.
full_name: Gurvits, Leonid I.
last_name: Gurvits
- first_name: Zsolt
full_name: Paragi, Zsolt
last_name: Paragi
- first_name: Viviana
full_name: Casasola, Viviana
last_name: Casasola
- first_name: John
full_name: Conway, John
last_name: Conway
- first_name: Jordy
full_name: Davelaar, Jordy
last_name: Davelaar
- first_name: Heino
full_name: Falcke, Heino
last_name: Falcke
- first_name: Rob
full_name: Fender, Rob
last_name: Fender
- first_name: Sándor
full_name: Frey, Sándor
last_name: Frey
- first_name: Christian M.
full_name: Fromm, Christian M.
last_name: Fromm
- first_name: Cristina García
full_name: Miró, Cristina García
last_name: Miró
- first_name: Michael A.
full_name: Garrett, Michael A.
last_name: Garrett
- first_name: Marcello
full_name: Giroletti, Marcello
last_name: Giroletti
- first_name: Ciriaco
full_name: Goddi, Ciriaco
last_name: Goddi
- first_name: José-Luis
full_name: Gómez, José-Luis
last_name: Gómez
- first_name: Jeffrey
full_name: van der Gucht, Jeffrey
last_name: van der Gucht
- first_name: José Carlos
full_name: Guirado, José Carlos
last_name: Guirado
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Frank
full_name: Helmich, Frank
last_name: Helmich
- first_name: Elizabeth
full_name: Humphreys, Elizabeth
last_name: Humphreys
- first_name: Violette
full_name: Impellizzeri, Violette
last_name: Impellizzeri
- first_name: Michael
full_name: Kramer, Michael
last_name: Kramer
- first_name: Michael
full_name: Lindqvist, Michael
last_name: Lindqvist
- first_name: Hendrik
full_name: Linz, Hendrik
last_name: Linz
- first_name: Elisabetta
full_name: Liuzzo, Elisabetta
last_name: Liuzzo
- first_name: Andrei P.
full_name: Lobanov, Andrei P.
last_name: Lobanov
- first_name: Yosuke
full_name: Mizuno, Yosuke
last_name: Mizuno
- first_name: Luciano
full_name: Rezzolla, Luciano
last_name: Rezzolla
- first_name: Freek
full_name: Roelofs, Freek
last_name: Roelofs
- first_name: Eduardo
full_name: Ros, Eduardo
last_name: Ros
- first_name: Kazi L.J.
full_name: Rygl, Kazi L.J.
last_name: Rygl
- first_name: Tuomas
full_name: Savolainen, Tuomas
last_name: Savolainen
- first_name: Karl
full_name: Schuster, Karl
last_name: Schuster
- first_name: Tiziana
full_name: Venturi, Tiziana
last_name: Venturi
- first_name: Martina C.
full_name: Wiedner, Martina C.
last_name: Wiedner
- first_name: J. Anton
full_name: Zensus, J. Anton
last_name: Zensus
citation:
ama: 'Gurvits LI, Paragi Z, Casasola V, et al. THEZA: TeraHertz exploration and
zooming-in for astrophysics. Experimental Astronomy. 2021;51(3):559-594.
doi:10.1007/s10686-021-09714-y'
apa: 'Gurvits, L. I., Paragi, Z., Casasola, V., Conway, J., Davelaar, J., Falcke,
H., … Zensus, J. A. (2021). THEZA: TeraHertz exploration and zooming-in for astrophysics.
Experimental Astronomy. Springer Science and Business Media LLC. https://doi.org/10.1007/s10686-021-09714-y'
chicago: 'Gurvits, Leonid I., Zsolt Paragi, Viviana Casasola, John Conway, Jordy
Davelaar, Heino Falcke, Rob Fender, et al. “THEZA: TeraHertz Exploration and Zooming-in
for Astrophysics.” Experimental Astronomy. Springer Science and Business
Media LLC, 2021. https://doi.org/10.1007/s10686-021-09714-y.'
ieee: 'L. I. Gurvits et al., “THEZA: TeraHertz exploration and zooming-in
for astrophysics,” Experimental Astronomy, vol. 51, no. 3. Springer Science
and Business Media LLC, pp. 559–594, 2021.'
ista: 'Gurvits LI, Paragi Z, Casasola V, Conway J, Davelaar J, Falcke H, Fender
R, Frey S, Fromm CM, Miró CG, Garrett MA, Giroletti M, Goddi C, Gómez J-L, van
der Gucht J, Guirado JC, Haiman Z, Helmich F, Humphreys E, Impellizzeri V, Kramer
M, Lindqvist M, Linz H, Liuzzo E, Lobanov AP, Mizuno Y, Rezzolla L, Roelofs F,
Ros E, Rygl KLJ, Savolainen T, Schuster K, Venturi T, Wiedner MC, Zensus JA. 2021.
THEZA: TeraHertz exploration and zooming-in for astrophysics. Experimental Astronomy.
51(3), 559–594.'
mla: 'Gurvits, Leonid I., et al. “THEZA: TeraHertz Exploration and Zooming-in for
Astrophysics.” Experimental Astronomy, vol. 51, no. 3, Springer Science
and Business Media LLC, 2021, pp. 559–94, doi:10.1007/s10686-021-09714-y.'
short: L.I. Gurvits, Z. Paragi, V. Casasola, J. Conway, J. Davelaar, H. Falcke,
R. Fender, S. Frey, C.M. Fromm, C.G. Miró, M.A. Garrett, M. Giroletti, C. Goddi,
J.-L. Gómez, J. van der Gucht, J.C. Guirado, Z. Haiman, F. Helmich, E. Humphreys,
V. Impellizzeri, M. Kramer, M. Lindqvist, H. Linz, E. Liuzzo, A.P. Lobanov, Y.
Mizuno, L. Rezzolla, F. Roelofs, E. Ros, K.L.J. Rygl, T. Savolainen, K. Schuster,
T. Venturi, M.C. Wiedner, J.A. Zensus, Experimental Astronomy 51 (2021) 559–594.
date_created: 2024-09-05T08:46:17Z
date_published: 2021-05-27T00:00:00Z
date_updated: 2024-09-10T12:15:42Z
day: '27'
doi: 10.1007/s10686-021-09714-y
extern: '1'
intvolume: ' 51'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s10686-021-09714-y
month: '05'
oa: 1
oa_version: Published Version
page: 559-594
publication: Experimental Astronomy
publication_identifier:
issn:
- 0922-6435
- 1572-9508
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'THEZA: TeraHertz exploration and zooming-in for astrophysics'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 51
year: '2021'
...
---
_id: '17509'
abstract:
- lang: eng
text: The recently discovered gravitational wave sources GW190521 and GW190814 have
shown evidence of BH mergers with masses and spins outside of the range expected
from isolated stellar evolution. These merging objects could have undergone previous
mergers. Such hierarchical mergers are predicted to be frequent in active galactic
nuclei (AGNs) disks, where binaries form and evolve efficiently by dynamical interactions
and gaseous dissipation. Here we compare the properties of these observed events
to the theoretical models of mergers in AGN disks, which are obtained by performing
one-dimensional N-body simulations combined with semi-analytical prescriptions.
The high BH masses in GW190521 are consistent with mergers of high-generation
(high-g) BHs where the initial progenitor stars had high metallicity, 2g BHs if
the original progenitors were metal-poor, or 1g BHs that had gained mass via super-Eddington
accretion. Other measured properties related to spin parameters in GW190521 are
also consistent with mergers in AGN disks. Furthermore, mergers in the lower mass
gap or those with low mass ratio as found in GW190814 and GW190412 are also reproduced
by mergers of 2g–1g or 1g–1g objects with significant accretion in AGN disks.
Finally, due to gas accretion, the massive neutron star merger reported in GW190425
can be produced in an AGN disk.
article_number: '194'
article_processing_charge: No
article_type: original
author:
- first_name: Hiromichi
full_name: Tagawa, Hiromichi
last_name: Tagawa
- first_name: Bence
full_name: Kocsis, Bence
last_name: Kocsis
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Imre
full_name: Bartos, Imre
last_name: Bartos
- first_name: Kazuyuki
full_name: Omukai, Kazuyuki
last_name: Omukai
- first_name: Johan
full_name: Samsing, Johan
last_name: Samsing
citation:
ama: Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. Mass-gap mergers
in active galactic nuclei. The Astrophysical Journal. 2021;908(2). doi:10.3847/1538-4357/abd555
apa: Tagawa, H., Kocsis, B., Haiman, Z., Bartos, I., Omukai, K., & Samsing,
J. (2021). Mass-gap mergers in active galactic nuclei. The Astrophysical Journal.
American Astronomical Society. https://doi.org/10.3847/1538-4357/abd555
chicago: Tagawa, Hiromichi, Bence Kocsis, Zoltán Haiman, Imre Bartos, Kazuyuki Omukai,
and Johan Samsing. “Mass-Gap Mergers in Active Galactic Nuclei.” The Astrophysical
Journal. American Astronomical Society, 2021. https://doi.org/10.3847/1538-4357/abd555.
ieee: H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, and J. Samsing, “Mass-gap
mergers in active galactic nuclei,” The Astrophysical Journal, vol. 908,
no. 2. American Astronomical Society, 2021.
ista: Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. 2021. Mass-gap
mergers in active galactic nuclei. The Astrophysical Journal. 908(2), 194.
mla: Tagawa, Hiromichi, et al. “Mass-Gap Mergers in Active Galactic Nuclei.” The
Astrophysical Journal, vol. 908, no. 2, 194, American Astronomical Society,
2021, doi:10.3847/1538-4357/abd555.
short: H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, J. Samsing, The Astrophysical
Journal 908 (2021).
date_created: 2024-09-05T08:47:46Z
date_published: 2021-02-24T00:00:00Z
date_updated: 2024-09-10T12:36:17Z
day: '24'
doi: 10.3847/1538-4357/abd555
extern: '1'
intvolume: ' 908'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3847/1538-4357/abd555
month: '02'
oa: 1
oa_version: Published Version
publication: The Astrophysical Journal
publication_identifier:
issn:
- 0004-637X
- 1538-4357
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mass-gap mergers in active galactic nuclei
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 908
year: '2021'
...
---
_id: '17515'
abstract:
- lang: eng
text: 'The disks of active galactic nuclei (AGNs) have emerged as a rich environment
for the evolution of stars and their compact remnants. The very dense medium favors
rapid accretion, while torques and migration traps enhance binary formation and
mergers. Both long and short gamma-ray bursts are hence expected. We show that
AGN disks constitute an ideal environment for another interesting phenomenon:
the accretion-induced collapse (AIC) of neutron stars (NSs) to black holes (BHs).
Rapid accretion in the dense disks can cause NSs to grow to the point of exceeding
the maximum mass allowed by their equation of state. General relativistic magnetohydrodynamical
simulations have shown that electromagnetic signatures are expected if the NS
is surrounded by a minidisk prior to collapse, which then rapidly accretes onto
the BH, and/or if the NS is highly magnetized, from reconnection of the magnetosphere
during collapse. Here we compute the rates of AICs and their locations within
the disks for both isolated NSs and for (initially stable) NSs formed from NS-NS
mergers. We find that the global AIC rates are ∼0.07–20 Gpc−3 yr−1, and we discuss
their observable prospects and signatures as they emerge from the dense disk environments.'
article_number: '10'
article_processing_charge: No
article_type: original
author:
- first_name: Rosalba
full_name: Perna, Rosalba
last_name: Perna
- first_name: Hiromichi
full_name: Tagawa, Hiromichi
last_name: Tagawa
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Imre
full_name: Bartos, Imre
last_name: Bartos
citation:
ama: Perna R, Tagawa H, Haiman Z, Bartos I. Accretion-induced collapse of neutron
stars in the disks of active galactic nuclei. The Astrophysical Journal.
2021;915(1). doi:10.3847/1538-4357/abfdb4
apa: Perna, R., Tagawa, H., Haiman, Z., & Bartos, I. (2021). Accretion-induced
collapse of neutron stars in the disks of active galactic nuclei. The Astrophysical
Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/abfdb4
chicago: Perna, Rosalba, Hiromichi Tagawa, Zoltán Haiman, and Imre Bartos. “Accretion-Induced
Collapse of Neutron Stars in the Disks of Active Galactic Nuclei.” The Astrophysical
Journal. American Astronomical Society, 2021. https://doi.org/10.3847/1538-4357/abfdb4.
ieee: R. Perna, H. Tagawa, Z. Haiman, and I. Bartos, “Accretion-induced collapse
of neutron stars in the disks of active galactic nuclei,” The Astrophysical
Journal, vol. 915, no. 1. American Astronomical Society, 2021.
ista: Perna R, Tagawa H, Haiman Z, Bartos I. 2021. Accretion-induced collapse of
neutron stars in the disks of active galactic nuclei. The Astrophysical Journal.
915(1), 10.
mla: Perna, Rosalba, et al. “Accretion-Induced Collapse of Neutron Stars in the
Disks of Active Galactic Nuclei.” The Astrophysical Journal, vol. 915,
no. 1, 10, American Astronomical Society, 2021, doi:10.3847/1538-4357/abfdb4.
short: R. Perna, H. Tagawa, Z. Haiman, I. Bartos, The Astrophysical Journal 915
(2021).
date_created: 2024-09-05T08:55:06Z
date_published: 2021-06-28T00:00:00Z
date_updated: 2024-09-10T13:47:31Z
day: '28'
doi: 10.3847/1538-4357/abfdb4
extern: '1'
intvolume: ' 915'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3847/1538-4357/abfdb4
month: '06'
oa: 1
oa_version: Published Version
publication: The Astrophysical Journal
publication_identifier:
issn:
- 0004-637X
- 1538-4357
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Accretion-induced collapse of neutron stars in the disks of active galactic
nuclei
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 915
year: '2021'
...