---
_id: '1357'
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. Richard Hudson and Norman Kaplan on the coalescent process. Genetics.
2016;202(3):865-866. doi:10.1534/genetics.116.187542
apa: Barton, N. H. (2016). Richard Hudson and Norman Kaplan on the coalescent process.
Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.116.187542
chicago: Barton, Nicholas H. “Richard Hudson and Norman Kaplan on the Coalescent
Process.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.116.187542.
ieee: N. H. Barton, “Richard Hudson and Norman Kaplan on the coalescent process,”
Genetics, vol. 202, no. 3. Genetics Society of America, pp. 865–866, 2016.
ista: Barton NH. 2016. Richard Hudson and Norman Kaplan on the coalescent process.
Genetics. 202(3), 865–866.
mla: Barton, Nicholas H. “Richard Hudson and Norman Kaplan on the Coalescent Process.”
Genetics, vol. 202, no. 3, Genetics Society of America, 2016, pp. 865–66,
doi:10.1534/genetics.116.187542.
short: N.H. Barton, Genetics 202 (2016) 865–866.
date_created: 2018-12-11T11:51:33Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2021-01-12T06:50:07Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1534/genetics.116.187542
file:
- access_level: open_access
checksum: b2174bab2de1d1142900062a150f35c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:09Z
date_updated: 2020-07-14T12:44:46Z
file_id: '5127'
file_name: IST-2017-768-v1+1_Hudson-Kaplan-1988.pdf
file_size: 130779
relation: main_file
file_date_updated: 2020-07-14T12:44:46Z
has_accepted_license: '1'
intvolume: ' 202'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 865 - 866
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '5888'
pubrep_id: '768'
quality_controlled: '1'
scopus_import: 1
status: public
title: Richard Hudson and Norman Kaplan on the coalescent process
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2016'
...
---
_id: '1358'
abstract:
- lang: eng
text: 'Gene regulation relies on the specificity of transcription factor (TF)–DNA
interactions. Limited specificity may lead to crosstalk: a regulatory state in
which a gene is either incorrectly activated due to noncognate TF–DNA interactions
or remains erroneously inactive. As each TF can have numerous interactions with
noncognate cis-regulatory elements, crosstalk is inherently a global problem,
yet has previously not been studied as such. We construct a theoretical framework
to analyse the effects of global crosstalk on gene regulation. We find that crosstalk
presents a significant challenge for organisms with low-specificity TFs, such
as metazoans. Crosstalk is not easily mitigated by known regulatory schemes acting
at equilibrium, including variants of cooperativity and combinatorial regulation.
Our results suggest that crosstalk imposes a previously unexplored global constraint
on the functioning and evolution of regulatory networks, which is qualitatively
distinct from the known constraints that act at the level of individual gene regulatory
elements.'
article_number: '12307'
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Roshan
full_name: Prizak, Roshan
id: 4456104E-F248-11E8-B48F-1D18A9856A87
last_name: Prizak
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Friedlander T, Prizak R, Guet CC, Barton NH, Tkačik G. Intrinsic limits to
gene regulation by global crosstalk. Nature Communications. 2016;7. doi:10.1038/ncomms12307
apa: Friedlander, T., Prizak, R., Guet, C. C., Barton, N. H., & Tkačik, G. (2016).
Intrinsic limits to gene regulation by global crosstalk. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/ncomms12307
chicago: Friedlander, Tamar, Roshan Prizak, Calin C Guet, Nicholas H Barton, and
Gašper Tkačik. “Intrinsic Limits to Gene Regulation by Global Crosstalk.” Nature
Communications. Nature Publishing Group, 2016. https://doi.org/10.1038/ncomms12307.
ieee: T. Friedlander, R. Prizak, C. C. Guet, N. H. Barton, and G. Tkačik, “Intrinsic
limits to gene regulation by global crosstalk,” Nature Communications,
vol. 7. Nature Publishing Group, 2016.
ista: Friedlander T, Prizak R, Guet CC, Barton NH, Tkačik G. 2016. Intrinsic limits
to gene regulation by global crosstalk. Nature Communications. 7, 12307.
mla: Friedlander, Tamar, et al. “Intrinsic Limits to Gene Regulation by Global Crosstalk.”
Nature Communications, vol. 7, 12307, Nature Publishing Group, 2016, doi:10.1038/ncomms12307.
short: T. Friedlander, R. Prizak, C.C. Guet, N.H. Barton, G. Tkačik, Nature Communications
7 (2016).
date_created: 2018-12-11T11:51:34Z
date_published: 2016-08-04T00:00:00Z
date_updated: 2023-09-07T12:53:49Z
day: '04'
ddc:
- '576'
department:
- _id: GaTk
- _id: NiBa
- _id: CaGu
doi: 10.1038/ncomms12307
ec_funded: 1
file:
- access_level: open_access
checksum: fe3f3a1526d180b29fe691ab11435b78
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:01Z
date_updated: 2020-07-14T12:44:46Z
file_id: '4919'
file_name: IST-2016-627-v1+1_ncomms12307.pdf
file_size: 861805
relation: main_file
- access_level: open_access
checksum: 164864a1a675f3ad80e9917c27aba07f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:02Z
date_updated: 2020-07-14T12:44:46Z
file_id: '4920'
file_name: IST-2016-627-v1+2_ncomms12307-s1.pdf
file_size: 1084703
relation: main_file
file_date_updated: 2020-07-14T12:44:46Z
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '5887'
pubrep_id: '627'
quality_controlled: '1'
related_material:
record:
- id: '6071'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Intrinsic limits to gene regulation by global crosstalk
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2016'
...
---
_id: '1359'
abstract:
- lang: eng
text: "The role of gene interactions in the evolutionary process has long\r\nbeen
controversial. Although some argue that they are not of\r\nimportance, because
most variation is additive, others claim that\r\ntheir effect in the long term
can be substantial. Here, we focus on\r\nthe long-term effects of genetic interactions
under directional\r\nselection assuming no mutation or dominance, and that epistasis
is\r\nsymmetrical overall. We ask by how much the mean of a complex\r\ntrait can
be increased by selection and analyze two extreme\r\nregimes, in which either
drift or selection dominate the dynamics\r\nof allele frequencies. In both scenarios,
epistatic interactions affect\r\nthe long-term response to selection by modulating
the additive\r\ngenetic variance. When drift dominates, we extend Robertson\r\n’\r\ns\r\n[Robertson
A (1960)\r\nProc R Soc Lond B Biol Sci\r\n153(951):234\r\n−\r\n249]\r\nargument
to show that, for any form of epistasis, the total response\r\nof a haploid population
is proportional to the initial total genotypic\r\nvariance. In contrast, the total
response of a diploid population is\r\nincreased by epistasis, for a given initial
genotypic variance. When\r\nselection dominates, we show that the total selection
response can\r\nonly be increased by epistasis when s\r\nome initially deleterious
alleles\r\nbecome favored as the genetic background changes. We find a sim-\r\nple
approximation for this effect and show that, in this regime, it is\r\nthe structure
of the genotype - phenotype map that matters and not\r\nthe variance components
of the population."
article_processing_charge: No
article_type: original
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Paixao T, Barton NH. The effect of gene interactions on the long-term response
to selection. PNAS. 2016;113(16):4422-4427. doi:10.1073/pnas.1518830113
apa: Paixao, T., & Barton, N. H. (2016). The effect of gene interactions on
the long-term response to selection. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1518830113
chicago: Paixao, Tiago, and Nicholas H Barton. “The Effect of Gene Interactions
on the Long-Term Response to Selection.” PNAS. National Academy of Sciences,
2016. https://doi.org/10.1073/pnas.1518830113.
ieee: T. Paixao and N. H. Barton, “The effect of gene interactions on the long-term
response to selection,” PNAS, vol. 113, no. 16. National Academy of Sciences,
pp. 4422–4427, 2016.
ista: Paixao T, Barton NH. 2016. The effect of gene interactions on the long-term
response to selection. PNAS. 113(16), 4422–4427.
mla: Paixao, Tiago, and Nicholas H. Barton. “The Effect of Gene Interactions on
the Long-Term Response to Selection.” PNAS, vol. 113, no. 16, National
Academy of Sciences, 2016, pp. 4422–27, doi:10.1073/pnas.1518830113.
short: T. Paixao, N.H. Barton, PNAS 113 (2016) 4422–4427.
date_created: 2018-12-11T11:51:34Z
date_published: 2016-04-19T00:00:00Z
date_updated: 2021-01-12T06:50:08Z
day: '19'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1073/pnas.1518830113
ec_funded: 1
external_id:
pmid:
- '27044080'
intvolume: ' 113'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4843425/
month: '04'
oa: 1
oa_version: Published Version
page: 4422 - 4427
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5886'
quality_controlled: '1'
scopus_import: 1
status: public
title: The effect of gene interactions on the long-term response to selection
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...
---
_id: '1360'
abstract:
- lang: eng
text: 'We apply the technique of Károly Bezdek and Daniel Bezdek to study billiard
trajectories in convex bodies, when the length is measured with a (possibly asymmetric)
norm. We prove a lower bound for the length of the shortest closed billiard trajectory,
related to the non-symmetric Mahler problem. With this technique we are able to
give short and elementary proofs to some known results. '
acknowledgement: The first and third authors were supported by the Dynasty Foundation.
The first, second and third authors were supported by the Russian Foundation for
Basic Re- search grant 15-31-20403 (mol a ved).
article_processing_charge: No
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexey
full_name: Balitskiy, Alexey
last_name: Balitskiy
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
- first_name: Anastasia
full_name: Sharipova, Anastasia
last_name: Sharipova
citation:
ama: Akopyan A, Balitskiy A, Karasev R, Sharipova A. Elementary approach to closed
billiard trajectories in asymmetric normed spaces. Proceedings of the American
Mathematical Society. 2016;144(10):4501-4513. doi:10.1090/proc/13062
apa: Akopyan, A., Balitskiy, A., Karasev, R., & Sharipova, A. (2016). Elementary
approach to closed billiard trajectories in asymmetric normed spaces. Proceedings
of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/13062
chicago: Akopyan, Arseniy, Alexey Balitskiy, Roman Karasev, and Anastasia Sharipova.
“Elementary Approach to Closed Billiard Trajectories in Asymmetric Normed Spaces.”
Proceedings of the American Mathematical Society. American Mathematical
Society, 2016. https://doi.org/10.1090/proc/13062.
ieee: A. Akopyan, A. Balitskiy, R. Karasev, and A. Sharipova, “Elementary approach
to closed billiard trajectories in asymmetric normed spaces,” Proceedings of
the American Mathematical Society, vol. 144, no. 10. American Mathematical
Society, pp. 4501–4513, 2016.
ista: Akopyan A, Balitskiy A, Karasev R, Sharipova A. 2016. Elementary approach
to closed billiard trajectories in asymmetric normed spaces. Proceedings of the
American Mathematical Society. 144(10), 4501–4513.
mla: Akopyan, Arseniy, et al. “Elementary Approach to Closed Billiard Trajectories
in Asymmetric Normed Spaces.” Proceedings of the American Mathematical Society,
vol. 144, no. 10, American Mathematical Society, 2016, pp. 4501–13, doi:10.1090/proc/13062.
short: A. Akopyan, A. Balitskiy, R. Karasev, A. Sharipova, Proceedings of the American
Mathematical Society 144 (2016) 4501–4513.
date_created: 2018-12-11T11:51:34Z
date_published: 2016-10-01T00:00:00Z
date_updated: 2021-01-12T06:50:09Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/proc/13062
ec_funded: 1
intvolume: ' 144'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1401.0442
month: '10'
oa: 1
oa_version: Preprint
page: 4501 - 4513
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '5885'
quality_controlled: '1'
scopus_import: 1
status: public
title: Elementary approach to closed billiard trajectories in asymmetric normed spaces
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 144
year: '2016'
...
---
_id: '1361'
abstract:
- lang: eng
text: We propose a novel surface-only technique for simulating incompressible, inviscid
and uniform-density liquids with surface tension in three dimensions. The liquid
surface is captured by a triangle mesh on which a Lagrangian velocity field is
stored. Because advection of the velocity field may violate the incompressibility
condition, we devise an orthogonal projection technique to remove the divergence
while requiring the evaluation of only two boundary integrals. The forces of surface
tension, gravity, and solid contact are all treated by a boundary element solve,
allowing us to perform detailed simulations of a wide range of liquid phenomena,
including waterbells, droplet and jet collisions, fluid chains, and crown splashes.
alternative_title:
- ACM Transactions on Graphics
article_number: a78
author:
- first_name: Fang
full_name: Da, Fang
last_name: Da
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
- first_name: Christopher
full_name: Batty, Christopher
last_name: Batty
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Eitan
full_name: Grinspun, Eitan
last_name: Grinspun
citation:
ama: 'Da F, Hahn D, Batty C, Wojtan C, Grinspun E. Surface only liquids. In: Vol
35. ACM; 2016. doi:10.1145/2897824.2925899'
apa: 'Da, F., Hahn, D., Batty, C., Wojtan, C., & Grinspun, E. (2016). Surface
only liquids (Vol. 35). Presented at the ACM SIGGRAPH, Anaheim, CA, USA: ACM.
https://doi.org/10.1145/2897824.2925899'
chicago: Da, Fang, David Hahn, Christopher Batty, Chris Wojtan, and Eitan Grinspun.
“Surface Only Liquids,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2897824.2925899.
ieee: F. Da, D. Hahn, C. Batty, C. Wojtan, and E. Grinspun, “Surface only liquids,”
presented at the ACM SIGGRAPH, Anaheim, CA, USA, 2016, vol. 35, no. 4.
ista: Da F, Hahn D, Batty C, Wojtan C, Grinspun E. 2016. Surface only liquids. ACM
SIGGRAPH, ACM Transactions on Graphics, vol. 35, a78.
mla: Da, Fang, et al. Surface Only Liquids. Vol. 35, no. 4, a78, ACM, 2016,
doi:10.1145/2897824.2925899.
short: F. Da, D. Hahn, C. Batty, C. Wojtan, E. Grinspun, in:, ACM, 2016.
conference:
end_date: 2016-07-28
location: Anaheim, CA, USA
name: ACM SIGGRAPH
start_date: 2016-07-24
date_created: 2018-12-11T11:51:35Z
date_published: 2016-07-11T00:00:00Z
date_updated: 2023-02-21T10:36:07Z
day: '11'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2897824.2925899
ec_funded: 1
file:
- access_level: open_access
checksum: 6d662893bd447d4f575b4961a2247811
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:01Z
date_updated: 2020-07-14T12:44:46Z
file_id: '4660'
file_name: IST-2016-637-v1+1_2016_Da_SOL.pdf
file_size: 10561865
relation: main_file
file_date_updated: 2020-07-14T12:44:46Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_status: published
publisher: ACM
publist_id: '5881'
pubrep_id: '637'
quality_controlled: '1'
scopus_import: 1
status: public
title: Surface only liquids
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1362'
abstract:
- lang: eng
text: We present a boundary element based method for fast simulation of brittle
fracture. By introducing simplifying assumptions that allow us to quickly estimate
stress intensities and opening displacements during crack propagation, we build
a fracture algorithm where the cost of each time step scales linearly with the
length of the crackfront. The transition from a full boundary element method to
our faster variant is possible at the beginning of any time step. This allows
us to build a hybrid method, which uses the expensive but more accurate BEM while
the number of degrees of freedom is low, and uses the fast method once that number
exceeds a given threshold as the crack geometry becomes more complicated. Furthermore,
we integrate this fracture simulation with a standard rigid-body solver. Our rigid-body
coupling solves a Neumann boundary value problem by carefully separating translational,
rotational and deformational components of the collision forces and then applying
a Tikhonov regularizer to the resulting linear system. We show that our method
produces physically reasonable results in standard test cases and is capable of
dealing with complex scenes faster than previous finite- or boundary element approaches.
alternative_title:
- ACM Transactions on Graphics
article_number: '104'
author:
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: 'Hahn D, Wojtan C. Fast approximations for boundary element based brittle fracture
simulation. In: Vol 35. ACM; 2016. doi:10.1145/2897824.2925902'
apa: 'Hahn, D., & Wojtan, C. (2016). Fast approximations for boundary element
based brittle fracture simulation (Vol. 35). Presented at the ACM SIGGRAPH, Anaheim,
CA, USA: ACM. https://doi.org/10.1145/2897824.2925902'
chicago: Hahn, David, and Chris Wojtan. “Fast Approximations for Boundary Element
Based Brittle Fracture Simulation,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2897824.2925902.
ieee: D. Hahn and C. Wojtan, “Fast approximations for boundary element based brittle
fracture simulation,” presented at the ACM SIGGRAPH, Anaheim, CA, USA, 2016, vol.
35, no. 4.
ista: Hahn D, Wojtan C. 2016. Fast approximations for boundary element based brittle
fracture simulation. ACM SIGGRAPH, ACM Transactions on Graphics, vol. 35, 104.
mla: Hahn, David, and Chris Wojtan. Fast Approximations for Boundary Element
Based Brittle Fracture Simulation. Vol. 35, no. 4, 104, ACM, 2016, doi:10.1145/2897824.2925902.
short: D. Hahn, C. Wojtan, in:, ACM, 2016.
conference:
end_date: 2016-07-28
location: Anaheim, CA, USA
name: ACM SIGGRAPH
start_date: 2016-07-24
date_created: 2018-12-11T11:51:35Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2023-09-07T12:02:56Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2897824.2925902
ec_funded: 1
file:
- access_level: open_access
checksum: 943712d9c9dc8bb5048d4adc561d7d38
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:04Z
date_updated: 2020-07-14T12:44:46Z
file_id: '5121'
file_name: IST-2016-632-v1+2_a104-hahn.pdf
file_size: 12453704
relation: main_file
file_date_updated: 2020-07-14T12:44:46Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_status: published
publisher: ACM
publist_id: '5880'
pubrep_id: '632'
quality_controlled: '1'
related_material:
record:
- id: '839'
relation: dissertation_contains
status: public
status: public
title: Fast approximations for boundary element based brittle fracture simulation
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1363'
abstract:
- lang: eng
text: When aiming to seamlessly integrate a fluid simulation into a larger scenario
(like an open ocean), careful attention must be paid to boundary conditions. In
particular, one must implement special "non-reflecting" boundary conditions,
which dissipate out-going waves as they exit the simulation. Unfortunately, the
state of the art in non-reflecting boundary conditions (perfectly-matched layers,
or PMLs) only permits trivially simple inflow/outflow conditions, so there is
no reliable way to integrate a fluid simulation into a more complicated environment
like a stormy ocean or a turbulent river. This paper introduces the first method
for combining nonreflecting boundary conditions based on PMLs with inflow/outflow
boundary conditions that vary arbitrarily throughout space and time. Our algorithm
is a generalization of stateof- the-art mean-flow boundary conditions in the computational
fluid dynamics literature, and it allows for seamless integration of a fluid simulation
into much more complicated environments. Our method also opens the door for previously-unseen
postprocess effects like retroactively changing the location of solid obstacles,
and locally increasing the visual detail of a pre-existing simulation.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: 'We thank the IST Austria Visual Computing group for helpful feedback
throughout the project. '
alternative_title:
- ACM Transactions on Graphics
article_number: '96'
author:
- first_name: Morten
full_name: Bojsen-Hansen, Morten
id: 439F0C8C-F248-11E8-B48F-1D18A9856A87
last_name: Bojsen-Hansen
orcid: 0000-0002-4417-3224
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: 'Bojsen-Hansen M, Wojtan C. Generalized non-reflecting boundaries for fluid
re-simulation. In: Vol 35. ACM; 2016. doi:10.1145/2897824.2925963'
apa: 'Bojsen-Hansen, M., & Wojtan, C. (2016). Generalized non-reflecting boundaries
for fluid re-simulation (Vol. 35). Presented at the ACM SIGGRAPH, Anaheim, CA,
USA: ACM. https://doi.org/10.1145/2897824.2925963'
chicago: Bojsen-Hansen, Morten, and Chris Wojtan. “Generalized Non-Reflecting Boundaries
for Fluid Re-Simulation,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2897824.2925963.
ieee: M. Bojsen-Hansen and C. Wojtan, “Generalized non-reflecting boundaries for
fluid re-simulation,” presented at the ACM SIGGRAPH, Anaheim, CA, USA, 2016, vol.
35, no. 4.
ista: Bojsen-Hansen M, Wojtan C. 2016. Generalized non-reflecting boundaries for
fluid re-simulation. ACM SIGGRAPH, ACM Transactions on Graphics, vol. 35, 96.
mla: Bojsen-Hansen, Morten, and Chris Wojtan. Generalized Non-Reflecting Boundaries
for Fluid Re-Simulation. Vol. 35, no. 4, 96, ACM, 2016, doi:10.1145/2897824.2925963.
short: M. Bojsen-Hansen, C. Wojtan, in:, ACM, 2016.
conference:
end_date: 2016-07-28
location: Anaheim, CA, USA
name: ACM SIGGRAPH
start_date: 2016-07-24
date_created: 2018-12-11T11:51:35Z
date_published: 2016-07-11T00:00:00Z
date_updated: 2023-02-21T10:36:12Z
day: '11'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2897824.2925963
ec_funded: 1
file:
- access_level: open_access
checksum: 140b5532f0a2a006a0149cab7c73c17c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:00Z
date_updated: 2020-07-14T12:44:47Z
file_id: '4981'
file_name: IST-2016-631-v1+2_a96-bojsen-hansen.pdf
file_size: 12422760
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_status: published
publisher: ACM
publist_id: '5879'
pubrep_id: '631'
quality_controlled: '1'
status: public
title: Generalized non-reflecting boundaries for fluid re-simulation
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1364'
abstract:
- lang: eng
text: We present a computational method for designing wire sculptures consisting
of interlocking wires. Our method allows the computation of aesthetically pleasing
structures that are structurally stable, efficiently fabricatable with a 2D wire
bending machine, and assemblable without the need of additional connectors. Starting
from a set of planar contours provided by the user, our method automatically tests
for the feasibility of a design, determines a discrete ordering of wires at intersection
points, and optimizes for the rest shape of the individual wires to maximize structural
stability under frictional contact. In addition to their application to art, wire
sculptures present an extremely efficient and fast alternative for low-fidelity
rapid prototyping because manufacturing time and required material linearly scales
with the physical size of objects. We demonstrate the effectiveness of our approach
on a varied set of examples, all of which we fabricated.
acknowledgement: This project has received funding from the European Union’s Horizon
2020 research and innovation programme under grant agreement No 645599.
alternative_title:
- ACM Transactions on Graphics
article_number: '86'
author:
- first_name: Eder
full_name: Miguel Villalba, Eder
id: 3FB91342-F248-11E8-B48F-1D18A9856A87
last_name: Miguel Villalba
- first_name: Mathias
full_name: Lepoutre, Mathias
last_name: Lepoutre
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Miguel Villalba E, Lepoutre M, Bickel B. Computational design of stable planar-rod
structures. In: Vol 35. ACM; 2016. doi:10.1145/2897824.2925978'
apa: 'Miguel Villalba, E., Lepoutre, M., & Bickel, B. (2016). Computational
design of stable planar-rod structures (Vol. 35). Presented at the ACM SIGGRAPH,
Anaheim, CA, USA: ACM. https://doi.org/10.1145/2897824.2925978'
chicago: Miguel Villalba, Eder, Mathias Lepoutre, and Bernd Bickel. “Computational
Design of Stable Planar-Rod Structures,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2897824.2925978.
ieee: E. Miguel Villalba, M. Lepoutre, and B. Bickel, “Computational design of stable
planar-rod structures,” presented at the ACM SIGGRAPH, Anaheim, CA, USA, 2016,
vol. 35, no. 4.
ista: Miguel Villalba E, Lepoutre M, Bickel B. 2016. Computational design of stable
planar-rod structures. ACM SIGGRAPH, ACM Transactions on Graphics, vol. 35, 86.
mla: Miguel Villalba, Eder, et al. Computational Design of Stable Planar-Rod
Structures. Vol. 35, no. 4, 86, ACM, 2016, doi:10.1145/2897824.2925978.
short: E. Miguel Villalba, M. Lepoutre, B. Bickel, in:, ACM, 2016.
conference:
end_date: 2016-07-28
location: Anaheim, CA, USA
name: ACM SIGGRAPH
start_date: 2016-07-24
date_created: 2018-12-11T11:51:36Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2021-01-12T06:50:10Z
day: '01'
ddc:
- '006'
department:
- _id: BeBi
doi: 10.1145/2897824.2925978
ec_funded: 1
file:
- access_level: open_access
checksum: d00c2664a43d945df8876ea0193734e3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:01Z
date_updated: 2020-07-14T12:44:47Z
file_id: '4853'
file_name: IST-2017-763-v1+1_wirebending.pdf
file_size: 44766392
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25082902-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '645599'
name: Soft-bodied intelligence for Manipulation
publication_status: published
publisher: ACM
publist_id: '5878'
pubrep_id: '763'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computational design of stable planar-rod structures
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1365'
abstract:
- lang: eng
text: A memory-hard function (MHF) f is equipped with a space cost σ and time cost
τ parameter such that repeatedly computing fσ,τ on an application specific integrated
circuit (ASIC) is not economically advantageous relative to a general purpose
computer. Technically we would like that any (generalized) circuit for evaluating
an iMHF fσ,τ has area × time (AT) complexity at Θ(σ2 ∗ τ). A data-independent
MHF (iMHF) has the added property that it can be computed with almost optimal
memory and time complexity by an algorithm which accesses memory in a pattern
independent of the input value. Such functions can be specified by fixing a directed
acyclic graph (DAG) G on n = Θ(σ ∗ τ) nodes representing its computation graph.
In this work we develop new tools for analyzing iMHFs. First we define and motivate
a new complexity measure capturing the amount of energy (i.e. electricity) required
to compute a function. We argue that, in practice, this measure is at least as
important as the more traditional AT-complexity. Next we describe an algorithm
A for repeatedly evaluating an iMHF based on an arbitrary DAG G. We upperbound
both its energy and AT complexities per instance evaluated in terms of a certain
combinatorial property of G. Next we instantiate our attack for several general
classes of DAGs which include those underlying many of the most important iMHF
candidates in the literature. In particular, we obtain the following results which
hold for all choices of parameters σ and τ (and thread-count) such that n = σ
∗ τ. -The Catena-Dragonfly function of [FLW13] has AT and energy complexities
O(n1.67). -The Catena-Butterfly function of [FLW13] has complexities is O(n1.67).
-The Double-Buffer and the Linear functions of [CGBS16] both have complexities
in O(n1.67). -The Argon2i function of [BDK15] (winner of the Password Hashing
Competition [PHC]) has complexities O(n7/4 log(n)). -The Single-Buffer function
of [CGBS16] has complexities O(n7/4 log(n)). -Any iMHF can be computed by an algorithm
with complexities O(n2/ log1 −ε(n)) for all ε > 0. In particular when τ = 1
this shows that the goal of constructing an iMHF with AT-complexity Θ(σ2 ∗ τ )
is unachievable. Along the way we prove a lemma upper-bounding the depth-robustness
of any DAG which may prove to be of independent interest.
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
citation:
ama: 'Alwen JF, Blocki J. Efficiently computing data-independent memory-hard functions.
In: Vol 9815. Springer; 2016:241-271. doi:10.1007/978-3-662-53008-5_9'
apa: 'Alwen, J. F., & Blocki, J. (2016). Efficiently computing data-independent
memory-hard functions (Vol. 9815, pp. 241–271). Presented at the CRYPTO: International
Cryptology Conference, Santa Barbara, CA, USA: Springer. https://doi.org/10.1007/978-3-662-53008-5_9'
chicago: Alwen, Joel F, and Jeremiah Blocki. “Efficiently Computing Data-Independent
Memory-Hard Functions,” 9815:241–71. Springer, 2016. https://doi.org/10.1007/978-3-662-53008-5_9.
ieee: 'J. F. Alwen and J. Blocki, “Efficiently computing data-independent memory-hard
functions,” presented at the CRYPTO: International Cryptology Conference, Santa
Barbara, CA, USA, 2016, vol. 9815, pp. 241–271.'
ista: 'Alwen JF, Blocki J. 2016. Efficiently computing data-independent memory-hard
functions. CRYPTO: International Cryptology Conference, LNCS, vol. 9815, 241–271.'
mla: Alwen, Joel F., and Jeremiah Blocki. Efficiently Computing Data-Independent
Memory-Hard Functions. Vol. 9815, Springer, 2016, pp. 241–71, doi:10.1007/978-3-662-53008-5_9.
short: J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
conference:
end_date: 2016-08-18
location: Santa Barbara, CA, USA
name: 'CRYPTO: International Cryptology Conference'
start_date: 2016-08-14
date_created: 2018-12-11T11:51:36Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:50:11Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-662-53008-5_9
intvolume: ' 9815'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2016/115
month: '08'
oa: 1
oa_version: Preprint
page: 241 - 271
publication_status: published
publisher: Springer
publist_id: '5876'
quality_controlled: '1'
scopus_import: 1
status: public
title: Efficiently computing data-independent memory-hard functions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9815
year: '2016'
...
---
_id: '1366'
abstract:
- lang: eng
text: 'We study the problem of devising provably secure PRNGs with input based on
the sponge paradigm. Such constructions are very appealing, as efficient software/hardware
implementations of SHA-3 can easily be translated into a PRNG in a nearly black-box
way. The only existing sponge-based construction, proposed by Bertoni et al. (CHES
2010), fails to achieve the security notion of robustness recently considered
by Dodis et al. (CCS 2013), for two reasons: (1) The construction is deterministic,
and thus there are high-entropy input distributions on which the construction
fails to extract random bits, and (2) The construction is not forward secure,
and presented solutions aiming at restoring forward security have not been rigorously
analyzed. We propose a seeded variant of Bertoni et al.’s PRNG with input which
we prove secure in the sense of robustness, delivering in particular concrete
security bounds. On the way, we make what we believe to be an important conceptual
contribution, developing a variant of the security framework of Dodis et al. tailored
at the ideal permutation model that captures PRNG security in settings where the
weakly random inputs are provided from a large class of possible adversarial samplers
which are also allowed to query the random permutation. As a further application
of our techniques, we also present an efficient sponge-based key-derivation function
(which can be instantiated from SHA-3 in a black-box fashion), which we also prove
secure when fed with samples from permutation-dependent distributions.'
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Gazi P, Tessaro S. Provably robust sponge-based PRNGs and KDFs. In: Vol 9665.
Springer; 2016:87-116. doi:10.1007/978-3-662-49890-3_4'
apa: 'Gazi, P., & Tessaro, S. (2016). Provably robust sponge-based PRNGs and
KDFs (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49890-3_4'
chicago: Gazi, Peter, and Stefano Tessaro. “Provably Robust Sponge-Based PRNGs and
KDFs,” 9665:87–116. Springer, 2016. https://doi.org/10.1007/978-3-662-49890-3_4.
ieee: 'P. Gazi and S. Tessaro, “Provably robust sponge-based PRNGs and KDFs,” presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna,
Austria, 2016, vol. 9665, pp. 87–116.'
ista: 'Gazi P, Tessaro S. 2016. Provably robust sponge-based PRNGs and KDFs. EUROCRYPT:
Theory and Applications of Cryptographic Techniques, LNCS, vol. 9665, 87–116.'
mla: Gazi, Peter, and Stefano Tessaro. Provably Robust Sponge-Based PRNGs and
KDFs. Vol. 9665, Springer, 2016, pp. 87–116, doi:10.1007/978-3-662-49890-3_4.
short: P. Gazi, S. Tessaro, in:, Springer, 2016, pp. 87–116.
conference:
end_date: 2016-05-12
location: Vienna, Austria
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2016-05-08
date_created: 2018-12-11T11:51:36Z
date_published: 2016-05-01T00:00:00Z
date_updated: 2021-01-12T06:50:11Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-662-49890-3_4
ec_funded: 1
intvolume: ' 9665'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/169/20160219:201940
month: '05'
oa: 1
oa_version: Preprint
page: 87 - 116
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5872'
quality_controlled: '1'
scopus_import: 1
status: public
title: Provably robust sponge-based PRNGs and KDFs
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9665
year: '2016'
...
---
_id: '1368'
abstract:
- lang: eng
text: Superconductivity in heavy-fermion systems has an unconventional nature and
is considered to originate from the universal features of the electronic structure.
Here, the Anderson lattice model is studied by means of the full variational Gutzwiller
wave function incorporating nonlocal effects of the on-site interaction. We show
that the d-wave superconducting ground state can be driven solely by interelectronic
correlations. The proposed microscopic mechanism leads to a multigap superconductivity
with the dominant contribution due to f electrons and in the dx2−y2-wave channel.
Our results rationalize several important observations for CeCoIn5.
acknowledgement: "The work has been supported by the National Science Center
\ (NCN) under the Grant MAESTRO, No.\r\nDEC-2012/04/A/ST3/00342. "
article_number: '024517'
author:
- first_name: Marcin
full_name: Wysokiński, Marcin
last_name: Wysokiński
- first_name: Jan
full_name: Kaczmarczyk, Jan
id: 46C405DE-F248-11E8-B48F-1D18A9856A87
last_name: Kaczmarczyk
orcid: 0000-0002-1629-3675
- first_name: Jozef
full_name: Spałek, Jozef
last_name: Spałek
citation:
ama: 'Wysokiński M, Kaczmarczyk J, Spałek J. Correlation driven d wave superconductivity
in Anderson lattice model: Two gaps. Physical Review B - Condensed Matter and
Materials Physics. 2016;94(2). doi:10.1103/PhysRevB.94.024517'
apa: 'Wysokiński, M., Kaczmarczyk, J., & Spałek, J. (2016). Correlation driven
d wave superconductivity in Anderson lattice model: Two gaps. Physical Review
B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.94.024517'
chicago: 'Wysokiński, Marcin, Jan Kaczmarczyk, and Jozef Spałek. “Correlation Driven
d Wave Superconductivity in Anderson Lattice Model: Two Gaps.” Physical Review
B - Condensed Matter and Materials Physics. American Physical Society, 2016.
https://doi.org/10.1103/PhysRevB.94.024517.'
ieee: 'M. Wysokiński, J. Kaczmarczyk, and J. Spałek, “Correlation driven d wave
superconductivity in Anderson lattice model: Two gaps,” Physical Review B -
Condensed Matter and Materials Physics, vol. 94, no. 2. American Physical
Society, 2016.'
ista: 'Wysokiński M, Kaczmarczyk J, Spałek J. 2016. Correlation driven d wave superconductivity
in Anderson lattice model: Two gaps. Physical Review B - Condensed Matter and
Materials Physics. 94(2), 024517.'
mla: 'Wysokiński, Marcin, et al. “Correlation Driven d Wave Superconductivity in
Anderson Lattice Model: Two Gaps.” Physical Review B - Condensed Matter and
Materials Physics, vol. 94, no. 2, 024517, American Physical Society, 2016,
doi:10.1103/PhysRevB.94.024517.'
short: M. Wysokiński, J. Kaczmarczyk, J. Spałek, Physical Review B - Condensed Matter
and Materials Physics 94 (2016).
date_created: 2018-12-11T11:51:37Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2021-01-12T06:50:12Z
day: '01'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.94.024517
ec_funded: 1
intvolume: ' 94'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1510.00224
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
publist_id: '5844'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Correlation driven d wave superconductivity in Anderson lattice model: Two
gaps'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 94
year: '2016'
...
---
_id: '1369'
abstract:
- lang: eng
text: 'We introduce a new loss function for the weakly-supervised training of semantic
image segmentation models based on three guiding principles: to seed with weak
localization cues, to expand objects based on the information about which classes
can occur in an image, and to constrain the segmentations to coincide with object
boundaries. We show experimentally that training a deep convolutional neural network
using the proposed loss function leads to substantially better segmentations than
previous state-of-the-art methods on the challenging PASCAL VOC 2012 dataset.
We furthermore give insight into the working mechanism of our method by a detailed
experimental study that illustrates how the segmentation quality is affected by
each term of the proposed loss function as well as their combinations.'
alternative_title:
- LNCS
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Lampert C. Seed, expand and constrain: Three principles for
weakly-supervised image segmentation. In: Vol 9908. Springer; 2016:695-711. doi:10.1007/978-3-319-46493-0_42'
apa: 'Kolesnikov, A., & Lampert, C. (2016). Seed, expand and constrain: Three
principles for weakly-supervised image segmentation (Vol. 9908, pp. 695–711).
Presented at the ECCV: European Conference on Computer Vision, Amsterdam, The
Netherlands: Springer. https://doi.org/10.1007/978-3-319-46493-0_42'
chicago: 'Kolesnikov, Alexander, and Christoph Lampert. “Seed, Expand and Constrain:
Three Principles for Weakly-Supervised Image Segmentation,” 9908:695–711. Springer,
2016. https://doi.org/10.1007/978-3-319-46493-0_42.'
ieee: 'A. Kolesnikov and C. Lampert, “Seed, expand and constrain: Three principles
for weakly-supervised image segmentation,” presented at the ECCV: European Conference
on Computer Vision, Amsterdam, The Netherlands, 2016, vol. 9908, pp. 695–711.'
ista: 'Kolesnikov A, Lampert C. 2016. Seed, expand and constrain: Three principles
for weakly-supervised image segmentation. ECCV: European Conference on Computer
Vision, LNCS, vol. 9908, 695–711.'
mla: 'Kolesnikov, Alexander, and Christoph Lampert. Seed, Expand and Constrain:
Three Principles for Weakly-Supervised Image Segmentation. Vol. 9908, Springer,
2016, pp. 695–711, doi:10.1007/978-3-319-46493-0_42.'
short: A. Kolesnikov, C. Lampert, in:, Springer, 2016, pp. 695–711.
conference:
end_date: 2016-10-14
location: Amsterdam, The Netherlands
name: 'ECCV: European Conference on Computer Vision'
start_date: 2016-10-11
date_created: 2018-12-11T11:51:37Z
date_published: 2016-09-15T00:00:00Z
date_updated: 2021-01-12T06:50:12Z
day: '15'
department:
- _id: ChLa
doi: 10.1007/978-3-319-46493-0_42
ec_funded: 1
intvolume: ' 9908'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1603.06098
month: '09'
oa: 1
oa_version: Preprint
page: 695 - 711
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Springer
publist_id: '5842'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Seed, expand and constrain: Three principles for weakly-supervised image segmentation'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9908
year: '2016'
...
---
_id: '1370'
abstract:
- lang: eng
text: 'We study coherent phonon oscillations and tunneling between two coupled nonlinear
nanomechanical resonators. We show that the coupling between two nanomechanical
resonators creates an effective phonon Josephson junction, which exhibits two
different dynamical behaviors: Josephson oscillation (phonon-Rabi oscillation)
and macroscopic self-trapping (phonon blockade). Self-trapping originates from
mechanical nonlinearities, meaning that when the nonlinearity exceeds its critical
value, the energy exchange between the two resonators is suppressed, and phonon
Josephson oscillations between them are completely blocked. An effective classical
Hamiltonian for the phonon Josephson junction is derived and its mean-field dynamics
is studied in phase space. Finally, we study the phonon-phonon coherence quantified
by the mean fringe visibility, and show that the interaction between the two resonators
may lead to the loss of coherence in the phononic junction.'
acknowledgement: 'The work of S.B. has been supported by the European Commission (Belgium)
via the SCALEQIT program and by the Alexander von Humboldt Foundation. '
article_number: '033846'
author:
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: David
full_name: Vitali, David
last_name: Vitali
citation:
ama: Barzanjeh S, Vitali D. Phonon Josephson junction with nanomechanical resonators.
Physical Review A - Atomic, Molecular, and Optical Physics. 2016;93(3).
doi:10.1103/PhysRevA.93.033846
apa: Barzanjeh, S., & Vitali, D. (2016). Phonon Josephson junction with nanomechanical
resonators. Physical Review A - Atomic, Molecular, and Optical Physics.
American Physical Society. https://doi.org/10.1103/PhysRevA.93.033846
chicago: Barzanjeh, Shabir, and David Vitali. “Phonon Josephson Junction with Nanomechanical
Resonators.” Physical Review A - Atomic, Molecular, and Optical Physics.
American Physical Society, 2016. https://doi.org/10.1103/PhysRevA.93.033846.
ieee: S. Barzanjeh and D. Vitali, “Phonon Josephson junction with nanomechanical
resonators,” Physical Review A - Atomic, Molecular, and Optical Physics,
vol. 93, no. 3. American Physical Society, 2016.
ista: Barzanjeh S, Vitali D. 2016. Phonon Josephson junction with nanomechanical
resonators. Physical Review A - Atomic, Molecular, and Optical Physics. 93(3),
033846.
mla: Barzanjeh, Shabir, and David Vitali. “Phonon Josephson Junction with Nanomechanical
Resonators.” Physical Review A - Atomic, Molecular, and Optical Physics,
vol. 93, no. 3, 033846, American Physical Society, 2016, doi:10.1103/PhysRevA.93.033846.
short: S. Barzanjeh, D. Vitali, Physical Review A - Atomic, Molecular, and Optical
Physics 93 (2016).
date_created: 2018-12-11T11:51:38Z
date_published: 2016-03-28T00:00:00Z
date_updated: 2023-02-21T10:36:32Z
day: '28'
department:
- _id: JoFi
doi: 10.1103/PhysRevA.93.033846
intvolume: ' 93'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1601.01818
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '5841'
quality_controlled: '1'
scopus_import: 1
status: public
title: Phonon Josephson junction with nanomechanical resonators
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 93
year: '2016'
...
---
_id: '1371'
abstract:
- lang: eng
text: Living cells can maintain their internal states, react to changing environments,
grow, differentiate, divide, etc. All these processes are tightly controlled by
what can be called a regulatory program. The logic of the underlying control can
sometimes be guessed at by examining the network of influences amongst genetic
components. Some associated gene regulatory networks have been studied in prokaryotes
and eukaryotes, unveiling various structural features ranging from broad distributions
of out-degrees to recurrent "motifs", that is small subgraphs having
a specific pattern of interactions. To understand what factors may be driving
such structuring, a number of groups have introduced frameworks to model the dynamics
of gene regulatory networks. In that context, we review here such in silico approaches
and show how selection for phenotypes, i.e., network function, can shape network
structure.
acknowledgement: 'MZ has been supported by Polish National Science Centre Grant No.
DEC-2012/07/N/NZ2/00107 and by Foundation of Polish Science award START. '
author:
- first_name: Olivier
full_name: Martin, Olivier
last_name: Martin
- first_name: André
full_name: Krzywicki, André
last_name: Krzywicki
- first_name: Marcin P
full_name: Zagórski, Marcin P
id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
last_name: Zagórski
orcid: 0000-0001-7896-7762
citation:
ama: 'Martin O, Krzywicki A, Zagórski MP. Drivers of structural features in gene
regulatory networks: From biophysical constraints to biological function. Physics
of Life Reviews. 2016;17:124-158. doi:10.1016/j.plrev.2016.06.002'
apa: 'Martin, O., Krzywicki, A., & Zagórski, M. P. (2016). Drivers of structural
features in gene regulatory networks: From biophysical constraints to biological
function. Physics of Life Reviews. Elsevier. https://doi.org/10.1016/j.plrev.2016.06.002'
chicago: 'Martin, Olivier, André Krzywicki, and Marcin P Zagórski. “Drivers of Structural
Features in Gene Regulatory Networks: From Biophysical Constraints to Biological
Function.” Physics of Life Reviews. Elsevier, 2016. https://doi.org/10.1016/j.plrev.2016.06.002.'
ieee: 'O. Martin, A. Krzywicki, and M. P. Zagórski, “Drivers of structural features
in gene regulatory networks: From biophysical constraints to biological function,”
Physics of Life Reviews, vol. 17. Elsevier, pp. 124–158, 2016.'
ista: 'Martin O, Krzywicki A, Zagórski MP. 2016. Drivers of structural features
in gene regulatory networks: From biophysical constraints to biological function.
Physics of Life Reviews. 17, 124–158.'
mla: 'Martin, Olivier, et al. “Drivers of Structural Features in Gene Regulatory
Networks: From Biophysical Constraints to Biological Function.” Physics of
Life Reviews, vol. 17, Elsevier, 2016, pp. 124–58, doi:10.1016/j.plrev.2016.06.002.'
short: O. Martin, A. Krzywicki, M.P. Zagórski, Physics of Life Reviews 17 (2016)
124–158.
date_created: 2018-12-11T11:51:38Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2021-01-12T06:50:13Z
day: '01'
department:
- _id: AnKi
doi: 10.1016/j.plrev.2016.06.002
ec_funded: 1
intvolume: ' 17'
language:
- iso: eng
month: '07'
oa_version: None
page: 124 - 158
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physics of Life Reviews
publication_status: published
publisher: Elsevier
publist_id: '5840'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Drivers of structural features in gene regulatory networks: From biophysical
constraints to biological function'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2016'
...
---
_id: '1372'
abstract:
- lang: eng
text: Redirection of intercellular auxin fluxes via relocalization of the PIN-FORMED
3 (PIN3) and PIN7 auxin efflux carriers has been suggested to be necessary for
the root gravitropic response. Cytokinins have also been proposed to play a role
in controlling root gravitropism, but conclusive evidence is lacking. We present
a detailed study of the dynamics of root bending early after gravistimulation,
which revealed a delayed gravitropic response in transgenic lines with depleted
endogenous cytokinins (Pro35S:AtCKX) and cytokinin signaling mutants. Pro35S:AtCKX
lines, as well as a cytokinin receptor mutant ahk3, showed aberrations in the
auxin response distribution in columella cells consistent with defects in the
auxin transport machinery. Using in vivo real-time imaging of PIN3-GFP and PIN7-GFP
in AtCKX3 overexpression and ahk3 backgrounds, we observed wild-type-like relocalization
of PIN proteins in the columella early after gravistimulation, with gravity-induced
relocalization of PIN7 faster than that of PIN3. Nonetheless, the cellular distribution
of PIN3 and PIN7 and expression of PIN7 and the auxin influx carrier AUX1 was
affected in AtCKX overexpression lines. Based on the retained cytokinin sensitivity
in pin3 pin4 pin7 mutant, we propose the AUX1-mediated auxin transport rather
than columella-located PIN proteins as a target of endogenous cytokinins in the
control of root gravitropism.
acknowledgement: 'Funded by Ministry of Education, Youth and Sports Czech Republic.
Grant Numbers: CEITEC 2020, LQ1601, LO1204, LH14104 and The European Research Council.
Grant Number: ERC-2011-StG-20101109-PSDP and The Czech Science Foundation. Grant
Numbers: GAP501/11/1150, GA13-40637S, GP14-30004P'
author:
- first_name: Markéta
full_name: Pernisová, Markéta
last_name: Pernisová
- first_name: Tomas
full_name: Prat, Tomas
id: 3DA3BFEE-F248-11E8-B48F-1D18A9856A87
last_name: Prat
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Danka
full_name: Haruštiaková, Danka
last_name: Haruštiaková
- first_name: Martina
full_name: Matonohova, Martina
last_name: Matonohova
- first_name: Lukáš
full_name: Spíchal, Lukáš
last_name: Spíchal
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Jan
full_name: Hejátko, Jan
last_name: Hejátko
citation:
ama: Pernisová M, Prat T, Grones P, et al. Cytokinins influence root gravitropism
via differential regulation of auxin transporter expression and localization in
Arabidopsis. New Phytologist. 2016;212(2):497-509. doi:10.1111/nph.14049
apa: Pernisová, M., Prat, T., Grones, P., Haruštiaková, D., Matonohova, M., Spíchal,
L., … Hejátko, J. (2016). Cytokinins influence root gravitropism via differential
regulation of auxin transporter expression and localization in Arabidopsis. New
Phytologist. Wiley-Blackwell. https://doi.org/10.1111/nph.14049
chicago: Pernisová, Markéta, Tomas Prat, Peter Grones, Danka Haruštiaková, Martina
Matonohova, Lukáš Spíchal, Tomasz Nodzyński, Jiří Friml, and Jan Hejátko. “Cytokinins
Influence Root Gravitropism via Differential Regulation of Auxin Transporter Expression
and Localization in Arabidopsis.” New Phytologist. Wiley-Blackwell, 2016.
https://doi.org/10.1111/nph.14049.
ieee: M. Pernisová et al., “Cytokinins influence root gravitropism via differential
regulation of auxin transporter expression and localization in Arabidopsis,” New
Phytologist, vol. 212, no. 2. Wiley-Blackwell, pp. 497–509, 2016.
ista: Pernisová M, Prat T, Grones P, Haruštiaková D, Matonohova M, Spíchal L, Nodzyński
T, Friml J, Hejátko J. 2016. Cytokinins influence root gravitropism via differential
regulation of auxin transporter expression and localization in Arabidopsis. New
Phytologist. 212(2), 497–509.
mla: Pernisová, Markéta, et al. “Cytokinins Influence Root Gravitropism via Differential
Regulation of Auxin Transporter Expression and Localization in Arabidopsis.” New
Phytologist, vol. 212, no. 2, Wiley-Blackwell, 2016, pp. 497–509, doi:10.1111/nph.14049.
short: M. Pernisová, T. Prat, P. Grones, D. Haruštiaková, M. Matonohova, L. Spíchal,
T. Nodzyński, J. Friml, J. Hejátko, New Phytologist 212 (2016) 497–509.
date_created: 2018-12-11T11:51:38Z
date_published: 2016-10-01T00:00:00Z
date_updated: 2021-01-12T06:50:13Z
day: '01'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1111/nph.14049
file:
- access_level: open_access
checksum: 27fd841ceaf0403559d7048ef51500f9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:53Z
date_updated: 2020-07-14T12:44:47Z
file_id: '5108'
file_name: IST-2018-1006-v1+1_Pernisova_NewPhytol_2016_peer_review.pdf
file_size: 972763
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 212'
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 497 - 509
publication: New Phytologist
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5839'
pubrep_id: '1006'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cytokinins influence root gravitropism via differential regulation of auxin
transporter expression and localization in Arabidopsis
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 212
year: '2016'
...
---
_id: '1373'
article_processing_charge: No
author:
- first_name: Olivier
full_name: Martin, Olivier
last_name: Martin
- first_name: Marcin P
full_name: Zagórski, Marcin P
id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
last_name: Zagórski
orcid: 0000-0001-7896-7762
citation:
ama: 'Martin O, Zagórski MP. Network architectures and operating principles. Reply
to comments on "Drivers of structural features in gene regulatory networks:
From biophysical constraints to biological function" Physics of Life
Reviews. 2016;17:168-171. doi:10.1016/j.plrev.2016.06.006'
apa: 'Martin, O., & Zagórski, M. P. (2016). Network architectures and operating
principles. Reply to comments on "Drivers of structural features in gene
regulatory networks: From biophysical constraints to biological function"
Physics of Life Reviews. Elsevier. https://doi.org/10.1016/j.plrev.2016.06.006'
chicago: 'Martin, Olivier, and Marcin P Zagórski. “Network Architectures and Operating
Principles. Reply to Comments on "Drivers of Structural Features in Gene
Regulatory Networks: From Biophysical Constraints to Biological Function"”
Physics of Life Reviews. Elsevier, 2016. https://doi.org/10.1016/j.plrev.2016.06.006.'
ieee: 'O. Martin and M. P. Zagórski, “Network architectures and operating principles.
Reply to comments on "Drivers of structural features in gene regulatory
networks: From biophysical constraints to biological function",” Physics
of Life Reviews, vol. 17. Elsevier, pp. 168–171, 2016.'
ista: 'Martin O, Zagórski MP. 2016. Network architectures and operating principles.
Reply to comments on "Drivers of structural features in gene regulatory
networks: From biophysical constraints to biological function" Physics
of Life Reviews. 17, 168–171.'
mla: 'Martin, Olivier, and Marcin P. Zagórski. “Network Architectures and Operating
Principles. Reply to Comments on "Drivers of Structural Features in Gene
Regulatory Networks: From Biophysical Constraints to Biological Function"”
Physics of Life Reviews, vol. 17, Elsevier, 2016, pp. 168–71, doi:10.1016/j.plrev.2016.06.006.'
short: O. Martin, M.P. Zagórski, Physics of Life Reviews 17 (2016) 168–171.
date_created: 2018-12-11T11:51:39Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2022-08-26T09:39:27Z
day: '01'
department:
- _id: AnKi
doi: 10.1016/j.plrev.2016.06.006
intvolume: ' 17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01531698
month: '07'
oa: 1
oa_version: Preprint
page: 168 - 171
publication: Physics of Life Reviews
publication_status: published
publisher: Elsevier
publist_id: '5838'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Network architectures and operating principles. Reply to comments on "Drivers
of structural features in gene regulatory networks: From biophysical constraints
to biological function"'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2016'
...
---
_id: '1377'
abstract:
- lang: eng
text: We consider the problem of minimizing the continuous valued total variation
subject to different unary terms on trees and propose fast direct algorithms based
on dynamic programming to solve these problems. We treat both the convex and the
nonconvex case and derive worst-case complexities that are equal to or better
than existing methods. We show applications to total variation based two dimensional
image processing and computer vision problems based on a Lagrangian decomposition
approach. The resulting algorithms are very effcient, offer a high degree of parallelism,
and come along with memory requirements which are only in the order of the number
of image pixels.
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Pock, Thomas
last_name: Pock
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal
on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257
apa: Kolmogorov, V., Pock, T., & Rolinek, M. (2016). Total variation on a tree.
SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics
. https://doi.org/10.1137/15M1010257
chicago: Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation
on a Tree.” SIAM Journal on Imaging Sciences. Society for Industrial and
Applied Mathematics , 2016. https://doi.org/10.1137/15M1010257.
ieee: V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM
Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied
Mathematics , pp. 605–636, 2016.
ista: Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal
on Imaging Sciences. 9(2), 605–636.
mla: Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on
Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics
, 2016, pp. 605–36, doi:10.1137/15M1010257.
short: V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016)
605–636.
date_created: 2018-12-11T11:51:40Z
date_published: 2016-05-03T00:00:00Z
date_updated: 2021-01-12T06:50:15Z
day: '03'
department:
- _id: VlKo
doi: 10.1137/15M1010257
ec_funded: 1
intvolume: ' 9'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.07770
month: '05'
oa: 1
oa_version: Preprint
page: 605 - 636
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Imaging Sciences
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '5834'
quality_controlled: '1'
scopus_import: 1
status: public
title: Total variation on a tree
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2016'
...
---
_id: '1378'
abstract:
- lang: eng
text: 'We give a detailed and easily accessible proof of Gromov''s Topological Overlap
Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral
cell complex of dimension d. Informally, the theorem states that if X has sufficiently
strong higher-dimensional expansion properties (which generalize edge expansion
of graphs and are defined in terms of cellular cochains of X) then X has the following
topological overlap property: for every continuous map X → ℝd there exists a point
p ∈ ℝd whose preimage intersects a positive fraction μ > 0 of the d-cells of
X. More generally, the conclusion holds if ℝd is replaced by any d-dimensional
piecewise-linear (PL) manifold M, with a constant μ that depends only on d and
on the expansion properties of X, but not on M.'
alternative_title:
- LIPIcs
author:
- first_name: Dominic
full_name: Dotterrer, Dominic
last_name: Dotterrer
- first_name: Tali
full_name: Kaufman, Tali
last_name: Kaufman
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. In:
Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing;
2016:35.1-35.10. doi:10.4230/LIPIcs.SoCG.2016.35'
apa: 'Dotterrer, D., Kaufman, T., & Wagner, U. (2016). On expansion and topological
overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational
Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH,
Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.35'
chicago: Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological
Overlap,” 51:35.1-35.10. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH,
Dagstuhl Publishing, 2016. https://doi.org/10.4230/LIPIcs.SoCG.2016.35.
ieee: 'D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,”
presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA,
2016, vol. 51, p. 35.1-35.10.'
ista: 'Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.'
mla: Dotterrer, Dominic, et al. On Expansion and Topological Overlap. Vol.
51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing,
2016, p. 35.1-35.10, doi:10.4230/LIPIcs.SoCG.2016.35.
short: D. Dotterrer, T. Kaufman, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 35.1-35.10.
conference:
end_date: 2016-06-17
location: Medford, MA, USA
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2016-06-14
date_created: 2018-12-11T11:51:41Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2023-09-27T12:29:56Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2016.35
file:
- access_level: open_access
checksum: cee65b0e722d50f9d1cc70c90ec1d59b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:38Z
date_updated: 2020-07-14T12:44:47Z
file_id: '4699'
file_name: IST-2016-623-v1+1_LIPIcs-SoCG-2016-35.pdf
file_size: 536923
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 51'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 35.1 - 35.10
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
publist_id: '5833'
pubrep_id: '623'
quality_controlled: '1'
related_material:
record:
- id: '742'
relation: later_version
status: public
scopus_import: 1
status: public
title: On expansion and topological overlap
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2016'
...
---
_id: '1379'
abstract:
- lang: eng
text: We investigate the complexity of finding an embedded non-orientable surface
of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural
question in low-dimensional topology, and as a first non-trivial instance of embeddability
of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding
to the relatively few hardness results that are currently known in 3-manifold
topology. In addition, we show that the problem lies in NP when the Euler genus
g is odd, and we give an explicit algorithm in this case.
alternative_title:
- LIPIcs
author:
- first_name: Benjamin
full_name: Burton, Benjamin
last_name: Burton
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-manifolds.
In: Vol 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing;
2016:24.1-24.15. doi:10.4230/LIPIcs.SoCG.2016.24'
apa: 'Burton, B., de Mesmay, A. N., & Wagner, U. (2016). Finding non-orientable
surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium
on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.24'
chicago: Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable
Surfaces in 3-Manifolds,” 51:24.1-24.15. Schloss Dagstuhl- Leibniz-Zentrum fur
Informatik GmbH, Dagstuhl Publishing, 2016. https://doi.org/10.4230/LIPIcs.SoCG.2016.24.
ieee: 'B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces
in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford,
MA, USA, 2016, vol. 51, p. 24.1-24.15.'
ista: 'Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in
3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15.'
mla: Burton, Benjamin, et al. Finding Non-Orientable Surfaces in 3-Manifolds.
Vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing,
2016, p. 24.1-24.15, doi:10.4230/LIPIcs.SoCG.2016.24.
short: B. Burton, A.N. de Mesmay, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 24.1-24.15.
conference:
end_date: 2016-06-17
location: Medford, MA, USA
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2016-06-14
date_created: 2018-12-11T11:51:41Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2023-02-23T12:23:20Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2016.24
file:
- access_level: open_access
checksum: f04248a61c24297cfabd30c5f8e0deb9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:12Z
date_updated: 2020-07-14T12:44:47Z
file_id: '4930'
file_name: IST-2016-622-v1+1_LIPIcs-SoCG-2016-24.pdf
file_size: 574770
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 51'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 24.1 - 24.15
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
publist_id: '5832'
pubrep_id: '622'
quality_controlled: '1'
related_material:
record:
- id: '534'
relation: later_version
status: public
scopus_import: 1
status: public
title: Finding non-orientable surfaces in 3-manifolds
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2016'
...
---
_id: '1380'
abstract:
- lang: eng
text: We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem
- determining whether a target vector space V may be reached from a starting point
x under repeated applications of a linear transformation A. Answering two questions
posed by Kannan and Lipton in the 1980s, we show that when V has dimension one,
this problem is solvable in polynomial time, and when V has dimension two or three,
the problem is in NPRP.
article_number: '23'
author:
- first_name: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
- first_name: Joël
full_name: Ouaknine, Joël
last_name: Ouaknine
- first_name: James
full_name: Worrell, James
last_name: Worrell
citation:
ama: Chonev VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. Journal
of the ACM. 2016;63(3). doi:10.1145/2857050
apa: Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the complexity of
the orbit problem. Journal of the ACM. ACM. https://doi.org/10.1145/2857050
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity
of the Orbit Problem.” Journal of the ACM. ACM, 2016. https://doi.org/10.1145/2857050.
ieee: V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit
problem,” Journal of the ACM, vol. 63, no. 3. ACM, 2016.
ista: Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem.
Journal of the ACM. 63(3), 23.
mla: Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.” Journal
of the ACM, vol. 63, no. 3, 23, ACM, 2016, doi:10.1145/2857050.
short: V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).
date_created: 2018-12-11T11:51:41Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2021-01-12T06:50:17Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2857050
intvolume: ' 63'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.2981
month: '06'
oa: 1
oa_version: Preprint
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '5831'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the complexity of the orbit problem
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2016'
...