---
_id: '1068'
abstract:
- lang: eng
text: 'Games on graphs provide the appropriate framework to study several central
problems in computer science, such as verification and synthesis of reactive systems.
One of the most basic objectives for games on graphs is the liveness (or Büchi)
objective that given a target set of vertices requires that some vertex in the
target set is visited infinitely often. We study generalized Büchi objectives
(i.e., conjunction of liveness objectives), and implications between two generalized
Büchi objectives (known as GR(1) objectives), that arise in numerous applications
in computer-aided verification. We present improved algorithms and conditional
super-linear lower bounds based on widely believed assumptions about the complexity
of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider
graph games with n vertices, m edges, and generalized Büchi objectives with k
conjunctions. First, we present an algorithm with running time O(k*n^2), improving
the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm
is optimal for dense graphs under (A1). Second, we show that the basic algorithm
for the problem is optimal for sparse graphs when the target sets have constant
size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions
in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1
k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time
algorithm for m > n^{1.5}. '
acknowledgement: K. C., M. H., and W. D. are partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC
Start grant (279307
alternative_title:
- LIPIcs
article_number: '25'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal
algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016).
Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented
at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika
Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”
Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally
optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical
Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally
optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations
of Computer Science (SG), LIPIcs, vol. 58, 25.'
mla: Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized
Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.25.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow, Poland
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:58Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-06-02T08:53:50Z
day: '01'
ddc:
- '000'
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2016.25
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:02Z
date_updated: 2018-12-12T10:16:02Z
file_id: '5187'
file_name: IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf
file_size: 632786
relation: main_file
file_date_updated: 2018-12-12T10:16:02Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6317'
pubrep_id: '779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conditionally optimal algorithms for generalized Büchi Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1069'
abstract:
- lang: eng
text: "The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differen-\r\ntial equation has a zero in a given interval of real numbers.
This is a fundamental reachability\r\nproblem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-\r\ntime Markov chains.
Decidability of the problem is currently open – indeed decidability is open\r\neven
for the sub-problem in which a zero is sought in a bounded interval. In this paper
we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture,
a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse
the unbounded problem in terms of the\r\nfrequencies of the differential equation,
that is, the imaginary parts of the characteristic roots.\r\nWe show that the
unbounded problem can be reduced to the bounded problem if there is at most\r\none
rationally linearly independent frequency, or if there are two rationally linearly
independent\r\nfrequencies and all characteristic roots are simple. We complete
the picture by showing that de-\r\ncidability of the unbounded problem in the
case of two (or more) rationally linearly independent\r\nfrequencies would entail
a major new effectiveness result in Diophantine approximation, namely\r\ncomputability
of the Diophantine-approximation types of all real algebraic numbers."
acknowledgement: 'Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN
Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC
Advanced Grant (267989: QUAREM).'
alternative_title:
- LIPIcs
article_number: '100'
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 skolem problem for continuous linear
dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik;
2016. doi:10.4230/LIPIcs.ICALP.2016.100'
apa: 'Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem
for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata,
Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur
Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100'
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem
Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.
ieee: 'V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous
linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming,
Rome, Italy, 2016, vol. 55.'
ista: 'Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous
linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 55, 100.'
mla: Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear
Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.100.
short: V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.100
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:26Z
date_updated: 2018-12-12T10:16:26Z
file_id: '5213'
file_name: IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf
file_size: 521415
relation: main_file
file_date_updated: 2018-12-12T10:16:26Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6314'
pubrep_id: '778'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the skolem problem for continuous linear dynamical systems
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: 55
year: '2016'
...
---
_id: '1070'
abstract:
- lang: eng
text: 'We present a logic that extends CTL (Computation Tree Logic) with operators
that express synchronization properties. A property is synchronized in a system
if it holds in all paths of a certain length. The new logic is obtained by using
the same path quantifiers and temporal operators as in CTL, but allowing a different
order of the quantifiers. This small syntactic variation induces a logic that
can express non-regular properties for which known extensions of MSO with equality
of path length are undecidable. We show that our variant of CTL is decidable and
that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We
analogously consider quantifier exchange in extensions of CTL, and we present
operators defined using basic operators of CTL* that express the occurrence of
infinitely many synchronization points. We show that the model-checking problem
remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide
if the Next operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking. '
acknowledgement: "This research was partially supported by Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna
Science and Technology Fund (WWTF) through project ICT15-003, and European project
Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for
their insightful\r\ncomments and suggestions.\r\n"
alternative_title:
- LIPIcs
article_number: '98'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Computation tree logic for synchronization properties.
In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98'
apa: 'Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization
properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming,
Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for
Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
ieee: 'K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,”
presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016,
vol. 55.'
ista: 'Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties.
ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization
Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.98.
short: K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.98
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:52Z
date_updated: 2018-12-12T10:08:52Z
file_id: '4714'
file_name: IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf
file_size: 546133
relation: main_file
file_date_updated: 2018-12-12T10:08:52Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6313'
pubrep_id: '812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computation tree logic for synchronization properties
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: 55
year: '2016'
...
---
_id: '1071'
abstract:
- lang: eng
text: 'We consider data-structures for answering reachability and distance queries
on constant-treewidth graphs with n nodes, on the standard RAM computational model
with wordsize W=Theta(log n). Our first contribution is a data-structure that
after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time;
and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries. The data-structure uses at all times O(n) space. Our
second contribution is a space-time tradeoff data-structure for distance queries.
For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing
time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha
is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space.
The input graph G is not considered in the space complexity. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant
(279307: Graph Games).'
alternative_title:
- LIPIcs
article_number: '28'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space
time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss
Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs (Vol.
57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark:
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant
Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs,”
presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016,
vol. 57.'
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs. ESA:
European Symposium on Algorithms, LIPIcs, vol. 57, 28.'
mla: Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff
for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl-
Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-09-07T12:01:58Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ESA.2016.28
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2018-12-12T10:14:31Z
file_id: '5084'
file_name: IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf
file_size: 579225
relation: main_file
file_date_updated: 2018-12-12T10:14:31Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6312'
pubrep_id: '777'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Optimal reachability and a space time tradeoff for distance queries in constant
treewidth graphs
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: 57
year: '2016'
...
---
_id: '10746'
abstract:
- lang: eng
text: Vortex states in superconducting (SC) structures, their dynamics and ways
to manipulate them are topics of great interest. We report a new method of magnetic
force microscopy (MFM) that allows the study of vortex states in mesoscopic SC
samples. For the case of a SC ring, which is biased to a half-integer flux quantum,
the flux modulation through the ring caused by the motion of the magnetic tip
drives the ring between two consecutive fluxoid states. The corresponding current
switching in the ring produces strong position-dependent forces on the cantilever.
In the regime where the frequency of the thermally activated jumps between fluxoid
states is close to the frequency of the cantilever, large changes in the cantilever
frequency and dissipation are observed. This effect may be understood as a stochastic
resonance (SR) process. These changes in the cantilever’s mechanical properties
are used to “image” the barrier energies between fluxoid states. Additionally,
SR imaging of the barrier energies are used to study the effect of the locally
applied magnetic field from the MFM tip on the barrier heights. We report the
results of measurements for Al rings. Further, the same imaging technique can
be applied to more sophisticated SC structures such as arrays of Josephson junctions.
alternative_title:
- Bulletin of the American Physical Society
article_number: E25.00007
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: Tyler
full_name: Naibert, Tyler
last_name: Naibert
- first_name: Victor
full_name: Chua, Victor
last_name: Chua
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: 'Polshyn H, Naibert T, Chua V, Budakian R. Study of vortex states and dynamics
in mesoscopic superconducting samples with MFM. In: APS March Meeting 2016.
Vol 61. American Physical Society; 2016.'
apa: 'Polshyn, H., Naibert, T., Chua, V., & Budakian, R. (2016). Study of vortex
states and dynamics in mesoscopic superconducting samples with MFM. In APS
March Meeting 2016 (Vol. 61). Baltimore, MD, United States: American Physical
Society.'
chicago: Polshyn, Hryhoriy, Tyler Naibert, Victor Chua, and Raffi Budakian. “Study
of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.”
In APS March Meeting 2016, Vol. 61. American Physical Society, 2016.
ieee: H. Polshyn, T. Naibert, V. Chua, and R. Budakian, “Study of vortex states
and dynamics in mesoscopic superconducting samples with MFM,” in APS March
Meeting 2016, Baltimore, MD, United States, 2016, vol. 61, no. 2.
ista: 'Polshyn H, Naibert T, Chua V, Budakian R. 2016. Study of vortex states and
dynamics in mesoscopic superconducting samples with MFM. APS March Meeting 2016.
APS: American Physical Society, Bulletin of the American Physical Society, vol.
61, E25.00007.'
mla: Polshyn, Hryhoriy, et al. “Study of Vortex States and Dynamics in Mesoscopic
Superconducting Samples with MFM.” APS March Meeting 2016, vol. 61, no.
2, E25.00007, American Physical Society, 2016.
short: H. Polshyn, T. Naibert, V. Chua, R. Budakian, in:, APS March Meeting 2016,
American Physical Society, 2016.
conference:
end_date: 2016-03-18
location: Baltimore, MD, United States
name: 'APS: American Physical Society'
start_date: 2016-03-14
date_created: 2022-02-08T09:55:09Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-02-08T10:44:06Z
day: '01'
extern: '1'
intvolume: ' 61'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR16/Session/E25.7
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2016
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Study of vortex states and dynamics in mesoscopic superconducting samples with
MFM
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 61
year: '2016'
...
---
_id: '10747'
abstract:
- lang: eng
text: Vortex interactions are key to explaining the behavior of many two dimensional
superconducting systems. We report on the development of a technique to locally
probe vortex interactions in a 2D array of Josephson junctions. Scanning a magnetic
tip attached to an ultra-soft cantilever over the array produces changes in the
frequency of the cantilever along certain lines, forming geometric patterns in
the scans. Different tip-surface separations and external magnetic fields produce
a number of different patterns. These patterns correspond to tip locations in
which two configurations of vortices in the lattice have degenerate energies.
By imaging the locations of these degeneracies, information on the local vortex
interactions may be obtained.
alternative_title:
- Bulletin of the American Physical Society
article_number: H25.00006
article_processing_charge: No
author:
- first_name: Tyler
full_name: Naibert, Tyler
last_name: Naibert
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Brian
full_name: Wolin, Brian
last_name: Wolin
- first_name: Malcolm
full_name: Durkin, Malcolm
last_name: Durkin
- first_name: Rita
full_name: Garrido Menacho, Rita
last_name: Garrido Menacho
- first_name: Ian Mondragon
full_name: Shem, Ian Mondragon
last_name: Shem
- first_name: Victor
full_name: Chua, Victor
last_name: Chua
- first_name: Taylor
full_name: Hughes, Taylor
last_name: Hughes
- first_name: Nadya
full_name: Mason, Nadya
last_name: Mason
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: 'Naibert T, Polshyn H, Wolin B, et al. Stochastic resonance magnetic force
microscopy imaging of Josephson arrays. In: APS March Meeting 2016. Vol
61. American Physical Society; 2016.'
apa: 'Naibert, T., Polshyn, H., Wolin, B., Durkin, M., Garrido Menacho, R., Shem,
I. M., … Budakian, R. (2016). Stochastic resonance magnetic force microscopy imaging
of Josephson arrays. In APS March Meeting 2016 (Vol. 61). Baltimore, MD,
United States: American Physical Society.'
chicago: Naibert, Tyler, Hryhoriy Polshyn, Brian Wolin, Malcolm Durkin, Rita Garrido
Menacho, Ian Mondragon Shem, Victor Chua, Taylor Hughes, Nadya Mason, and Raffi
Budakian. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson
Arrays.” In APS March Meeting 2016, Vol. 61. American Physical Society,
2016.
ieee: T. Naibert et al., “Stochastic resonance magnetic force microscopy
imaging of Josephson arrays,” in APS March Meeting 2016, Baltimore, MD,
United States, 2016, vol. 61, no. 2.
ista: 'Naibert T, Polshyn H, Wolin B, Durkin M, Garrido Menacho R, Shem IM, Chua
V, Hughes T, Mason N, Budakian R. 2016. Stochastic resonance magnetic force microscopy
imaging of Josephson arrays. APS March Meeting 2016. APS: American Physical Society,
Bulletin of the American Physical Society, vol. 61, H25.00006.'
mla: Naibert, Tyler, et al. “Stochastic Resonance Magnetic Force Microscopy Imaging
of Josephson Arrays.” APS March Meeting 2016, vol. 61, no. 2, H25.00006,
American Physical Society, 2016.
short: T. Naibert, H. Polshyn, B. Wolin, M. Durkin, R. Garrido Menacho, I.M. Shem,
V. Chua, T. Hughes, N. Mason, R. Budakian, in:, APS March Meeting 2016, American
Physical Society, 2016.
conference:
end_date: 2016-03-18
location: Baltimore, MD, United States
name: 'APS: American Physical Society'
start_date: 2016-03-14
date_created: 2022-02-08T10:10:39Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-02-08T10:43:33Z
day: '01'
extern: '1'
intvolume: ' 61'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR16/Session/H25.6
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2016
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Stochastic resonance magnetic force microscopy imaging of Josephson arrays
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 61
year: '2016'
...
---
_id: '1081'
abstract:
- lang: eng
text: The asymmetric localization of proteins in the plasma membrane domains of
eukaryotic cells is a fundamental manifestation of cell polarity that is central
to multicellular organization and developmental patterning. In plants, the mechanisms
underlying the polar localization of cargo proteins are still largely unknown
and appear to be fundamentally distinct from those operating in mammals. Here,
we present a systematic, quantitative comparative analysis of the polar delivery
and subcellular localization of proteins that characterize distinct polar plasma
membrane domains in plant cells. The combination of microscopic analyses and computational
modeling revealed a mechanistic framework common to diverse polar cargos and underlying
the establishment and maintenance of apical, basal, and lateral polar domains
in plant cells. This mechanism depends on the polar secretion, constitutive endocytic
recycling, and restricted lateral diffusion of cargos within the plasma membrane.
Moreover, our observations suggest that polar cargo distribution involves the
individual protein potential to form clusters within the plasma membrane and interact
with the extracellular matrix. Our observations provide insights into the shared
cellular mechanisms of polar cargo delivery and polarity maintenance in plant
cells.
acknowledgement: "We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor
sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing
the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP);
Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute
of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research
Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety
for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the
Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN."
article_number: '16018'
author:
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery
and polarity maintenance at different polar domains in plant cells. Cell Discovery.
2016;2. doi:10.1038/celldisc.2016.18
apa: Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H.,
& Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance
at different polar domains in plant cells. Cell Discovery. Nature Publishing
Group. https://doi.org/10.1038/celldisc.2016.18
chicago: Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste,
Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo
Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.”
Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.
ieee: Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity
maintenance at different polar domains in plant cells,” Cell Discovery,
vol. 2. Nature Publishing Group, 2016.
ista: Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016.
Cellular mechanisms for cargo delivery and polarity maintenance at different polar
domains in plant cells. Cell Discovery. 2, 16018.
mla: Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity
Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery,
vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.
short: Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J.
Friml, Cell Discovery 2 (2016).
date_created: 2018-12-11T11:50:02Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2021-01-12T06:48:08Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/celldisc.2016.18
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:33Z
date_updated: 2018-12-12T10:13:33Z
file_id: '5017'
file_name: IST-2017-757-v1+1_celldisc201618.pdf
file_size: 5261671
relation: main_file
file_date_updated: 2018-12-12T10:13:33Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Cell Discovery
publication_status: published
publisher: Nature Publishing Group
publist_id: '6299'
pubrep_id: '757'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cellular mechanisms for cargo delivery and polarity maintenance at different
polar domains in plant cells
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: 2
year: '2016'
...
---
_id: '10810'
abstract:
- lang: eng
text: "The main goal of the SCP-ECG standard is to address ECG data and related
metadata structuring, semantics and syntax, with the objective of facilitating
interoperability and thus supporting and promoting the exchange of the relevant
information for unary and serial ECG diagnosis. Starting with version V3.0, the
standard now also provides support for the storage of continuous, long-term ECG
recordings and affords a repository for selected ECG sequences and the related
metadata to accommodate stress tests, drug trials and protocol-based ECG recordings.
The global and per-lead measurements sections have been extended and three new
sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand
annotations. The used terminology and the provided measurements and annotations
have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis
has also been put on harmonizing the Universal Statement Codes with the CDISC
and the categorized AHA statement codes and similarly the drug and implanted devices
codes with the ATC and NASPE/BPEG codes. "
acknowledgement: The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul
Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen
Wagner for their in depth review and constructive comments.
article_processing_charge: No
author:
- first_name: Paul
full_name: Rubel, Paul
last_name: Rubel
- first_name: Danilo
full_name: Pani, Danilo
last_name: Pani
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Jocelyne
full_name: Fayn, Jocelyne
last_name: Fayn
- first_name: Fabio
full_name: Badilini, Fabio
last_name: Badilini
- first_name: Peter
full_name: Macfarlane, Peter
last_name: Macfarlane
- first_name: Alpo
full_name: Varri, Alpo
last_name: Varri
citation:
ama: 'Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology
Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500'
apa: 'Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P.,
& Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol
for computer-assisted electrocardiography. In 2016 Computing in Cardiology
Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology.
https://doi.org/10.22489/cinc.2016.090-500'
chicago: 'Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini,
Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication
Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology
Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.'
ieee: 'P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology
Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312.'
ista: 'Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016.
SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing
in Cardiology vol. 43, 309–312.'
mla: 'Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol
for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference,
vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.'
short: P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri,
in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp.
309–312.
conference:
end_date: 2016-09-14
location: Vancouver, Canada
name: 'CinC: Computing in Cardiology'
start_date: 2016-09-11
date_created: 2022-03-03T10:43:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-03-04T07:34:45Z
day: '01'
department:
- _id: CampIT
doi: 10.22489/cinc.2016.090-500
intvolume: ' 43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.22489/cinc.2016.090-500
month: '03'
oa: 1
oa_version: Published Version
page: 309-312
publication: 2016 Computing in Cardiology Conference
publication_identifier:
issn:
- 2325-887X
publication_status: published
publisher: Computing in Cardiology
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2016'
...
---
_id: '1082'
abstract:
- lang: eng
text: In many applications, it is desirable to extract only the relevant aspects
of data. A principled way to do this is the information bottleneck (IB) method,
where one seeks a code that maximises information about a relevance variable,
Y, while constraining the information encoded about the original data, X. Unfortunately
however, the IB method is computationally demanding when data are high-dimensional
and/or non-gaussian. Here we propose an approximate variational scheme for maximising
a lower bound on the IB objective, analogous to variational EM. Using this method,
we derive an IB algorithm to recover features that are both relevant and sparse.
Finally, we demonstrate how kernelised versions of the algorithm can be used to
address a broad range of problems with non-linear relation between X and Y.
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: 'Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information
bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.'
apa: 'Chalk, M. J., Marre, O., & Tkačik, G. (2016). Relevant sparse codes with
variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the
NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information
Processing Systems.'
chicago: Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes
with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing
Systems, 2016.
ieee: 'M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational
information bottleneck,” presented at the NIPS: Neural Information Processing
Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.'
ista: 'Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational
information bottleneck. NIPS: Neural Information Processing Systems, Advances
in Neural Information Processing Systems, vol. 29, 1965–1973.'
mla: Chalk, Matthew J., et al. Relevant Sparse Codes with Variational Information
Bottleneck. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.
short: M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems,
2016, pp. 1965–1973.
conference:
end_date: 2016-12-10
location: Barcelona, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:03Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2021-01-12T06:48:09Z
day: '01'
department:
- _id: GaTk
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.07332
month: '12'
oa: 1
oa_version: Preprint
page: 1965-1973
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6298'
quality_controlled: '1'
related_material:
link:
- relation: other
url: https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck
scopus_import: 1
status: public
title: Relevant sparse codes with variational information bottleneck
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '1090'
abstract:
- lang: eng
text: ' While weighted automata provide a natural framework to express quantitative
properties, many basic properties like average response time cannot be expressed
with weighted automata. Nested weighted automata extend weighted automata and
consist of a master automaton and a set of slave automata that are invoked by
the master automaton. Nested weighted automata are strictly more expressive than
weighted automata (e.g., average response time can be expressed with nested weighted
automata), but the basic decision questions have higher complexity (e.g., for
deterministic automata, the emptiness question for nested weighted automata is
PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME).
We consider a natural subclass of nested weighted automata where at any point
at most a bounded number k of slave automata can be active. We focus on automata
whose master value function is the limit average. We show that these nested weighted
automata with bounded width are strictly more expressive than weighted automata
(e.g., average response time with no overlapping requests can be expressed with
bound k=1, but not with non-nested weighted automata). We show that the complexity
of the basic decision problems (i.e., emptiness and universality) for the subclass
with k constant matches the complexity for weighted automata. Moreover, when k
is part of the input given in unary we establish PSPACE-completeness.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award),
ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF)
through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under
grant 2014/15/D/ST6/04543."
alternative_title:
- LIPIcs
article_number: '24'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata
of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2016. doi:10.4230/LIPIcs.MFCS.2016.24'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average
automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations
of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.24.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average
automata of bounded width,” presented at the MFCS: Mathematical Foundations of
Computer Science (SG), Krakow; Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata
of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs,
vol. 58, 24.'
mla: Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of
Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.24.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow; Poland
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2016-08-22
date_created: 2018-12-11T11:50:05Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:12Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2016.24
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:31Z
date_updated: 2018-12-12T10:17:31Z
file_id: '5286'
file_name: IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf
file_size: 564560
relation: main_file
file_date_updated: 2018-12-12T10:17:31Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6286'
pubrep_id: '795'
quality_controlled: '1'
scopus_import: 1
status: public
title: Nested weighted limit-average automata of bounded width
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: 58
year: '2016'
...
---
_id: '1093'
abstract:
- lang: eng
text: 'We introduce a general class of distances (metrics) between Markov chains,
which are based on linear behaviour. This class encompasses distances given topologically
(such as the total variation distance or trace distance) as well as by temporal
logics or automata. We investigate which of the distances can be approximated
by observing the systems, i.e. by black-box testing or simulation, and we provide
both negative and positive results. '
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF)
under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award),
by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced
Postdoc. Mobility Fellowship – grant number P300P2_161067."
alternative_title:
- LIPIcs
article_number: '20'
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov
chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.20'
apa: 'Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear
distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency
Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2016.20'
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20.
ieee: 'P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances
between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City;
Canada, 2016, vol. 59.'
ista: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between
Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.'
mla: Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol.
59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Quebec City; Canada
name: 'CONCUR: Concurrency Theory'
start_date: 2016-08-23
date_created: 2018-12-11T11:50:06Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
- _id: CaGu
doi: 10.4230/LIPIcs.CONCUR.2016.20
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:39Z
date_updated: 2018-12-12T10:11:39Z
file_id: '4895'
file_name: IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf
file_size: 501827
relation: main_file
file_date_updated: 2018-12-12T10:11:39Z
has_accepted_license: '1'
intvolume: ' 59'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6283'
pubrep_id: '794'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Linear distances between Markov chains
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: 59
year: '2016'
...
---
_id: '1095'
abstract:
- lang: eng
text: ' The semantics of concurrent data structures is usually given by a sequential
specification and a consistency condition. Linearizability is the most popular
consistency condition due to its simplicity and general applicability. Nevertheless,
for applications that do not require all guarantees offered by linearizability,
recent research has focused on improving performance and scalability of concurrent
data structures by relaxing their semantics. In this paper, we present local linearizability,
a relaxed consistency condition that is applicable to container-type concurrent
data structures like pools, queues, and stacks. While linearizability requires
that the effect of each operation is observed by all threads at the same time,
local linearizability only requires that for each thread T, the effects of its
local insertion operations and the effects of those removal operations that remove
values inserted by T are observed by all threads at the same time. We investigate
theoretical and practical properties of local linearizability and its relationship
to many existing consistency conditions. We present a generic implementation method
for locally linearizable data structures that uses existing linearizable data
structures as building blocks. Our implementations show performance and scalability
improvements over the original building blocks and outperform the fastest existing
container-type implementations. '
acknowledgement: "This work has been supported by the National Research Network RiSE
on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23,
S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship
(Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1,
the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European
Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."
alternative_title:
- LIPIcs
article_number: '6'
author:
- first_name: Andreas
full_name: Haas, Andreas
last_name: Haas
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Andreas
full_name: Holzer, Andreas
last_name: Holzer
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Michael
full_name: Lippautz, Michael
last_name: Lippautz
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent
container-type data structures. In: Leibniz International Proceedings in Informatics.
Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.6'
apa: 'Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H.,
… Veith, H. (2016). Local linearizability for concurrent container-type data structures.
In Leibniz International Proceedings in Informatics (Vol. 59). Quebec City;
Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.6'
chicago: Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael
Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability
for Concurrent Container-Type Data Structures.” In Leibniz International Proceedings
in Informatics, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.6.
ieee: A. Haas et al., “Local linearizability for concurrent container-type
data structures,” in Leibniz International Proceedings in Informatics,
Quebec City; Canada, 2016, vol. 59.
ista: 'Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A,
Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type
data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency
Theory, LIPIcs, vol. 59, 6.'
mla: Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type
Data Structures.” Leibniz International Proceedings in Informatics, vol.
59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.6.
short: A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A.
Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Quebec City; Canada
name: 'CONCUR: Concurrency Theory'
start_date: 2016-08-23
date_created: 2018-12-11T11:50:07Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:14Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2016.6
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:10Z
date_updated: 2018-12-12T10:10:10Z
file_id: '4795'
file_name: IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf
file_size: 589747
relation: main_file
file_date_updated: 2018-12-12T10:10:10Z
has_accepted_license: '1'
intvolume: ' 59'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6280'
pubrep_id: '793'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local linearizability for concurrent container-type data structures
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: 59
year: '2016'
...
---
_id: '1097'
abstract:
- lang: eng
text: We present an interactive system for computational design, optimization, and
fabrication of multicopters. Our computational approach allows non-experts to
design, explore, and evaluate a wide range of different multicopters. We provide
users with an intuitive interface for assembling a multicopter from a collection
of components (e.g., propellers, motors, and carbon fiber rods). Our algorithm
interactively optimizes shape and controller parameters of the current design
to ensure its proper operation. In addition, we allow incorporating a variety
of other metrics (such as payload, battery usage, size, and cost) into the design
process and exploring tradeoffs between them. We show the efficacy of our method
and system by designing, optimizing, fabricating, and operating multicopters with
complex geometries and propeller configurations. We also demonstrate the ability
of our optimization algorithm to improve the multicopter performance under different
metrics.
acknowledgement: "We thank Nobuyuki Umetani for his insightful suggestions in our
discussions. We thank Alan Schultz and his colleagues at NRL for building the hexacopter
and for the valuable discussions. We thank Randall Davis, Boris Katz, and Howard
Shrobe at MIT for their advice. We are grateful to Nick Bandiera for preprocessing
mechanical parts and providing 3D printing technical support; Charles Blouin from
RCBenchmark for dynamometer hardware support; Brian Saavedra for the composition
UI; Yingzhe Yuan for data acquisition and video recording in the experiments; Michael
Foshey and David Kim for their comments on the draft of the paper. \r\n\r\n\r\nThis
work was partially supported by Air Force Research Laboratory’s sponsorship of Julia:
A Fresh Approach to Technical Computing and Data Processing (Sponsor Award ID FA8750-15-2-
0272, MIT Award ID 024831-00003), and NSF Expedition project (Sponsor Award ID CCF-1138967,
MIT Award ID 020610-00002). The views expressed herein are not endorsed by the sponsors.
This project has also received funding from the European Union’s Horizon 2020 research
and innovation program under grant agreement No 645599. "
alternative_title:
- ACM Transactions on Graphics
article_number: '227'
author:
- first_name: Tao
full_name: Du, Tao
last_name: Du
- first_name: Adriana
full_name: Schulz, Adriana
last_name: Schulz
- first_name: Bo
full_name: Zhu, Bo
last_name: Zhu
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Wojciech
full_name: Matusik, Wojciech
last_name: Matusik
citation:
ama: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. Computational multicopter design.
In: Vol 35. ACM; 2016. doi:10.1145/2980179.2982427'
apa: 'Du, T., Schulz, A., Zhu, B., Bickel, B., & Matusik, W. (2016). Computational
multicopter design (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition
on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. https://doi.org/10.1145/2980179.2982427'
chicago: Du, Tao, Adriana Schulz, Bo Zhu, Bernd Bickel, and Wojciech Matusik. “Computational
Multicopter Design,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2980179.2982427.
ieee: 'T. Du, A. Schulz, B. Zhu, B. Bickel, and W. Matusik, “Computational multicopter
design,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer
Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no.
6.'
ista: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. 2016. Computational multicopter
design. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
Techniques in Asia, ACM Transactions on Graphics, vol. 35, 227.'
mla: Du, Tao, et al. Computational Multicopter Design. Vol. 35, no. 6, 227,
ACM, 2016, doi:10.1145/2980179.2982427.
short: T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016.
conference:
end_date: 2016-12-08
location: Macao, China
name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
Techniques in Asia'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:07Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2021-01-12T06:48:15Z
day: '01'
ddc:
- '006'
department:
- _id: BeBi
doi: 10.1145/2980179.2982427
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:42Z
date_updated: 2018-12-12T10:17:42Z
file_id: '5298'
file_name: IST-2017-759-v1+1_copter.pdf
file_size: 33114420
relation: main_file
file_date_updated: 2018-12-12T10:17:42Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
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: '6278'
pubrep_id: '759'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computational multicopter design
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1098'
abstract:
- lang: eng
text: Better understanding of the potential benefits of information transfer and
representation learning is an important step towards the goal of building intelligent
systems that are able to persist in the world and learn over time. In this work,
we consider a setting where the learner encounters a stream of tasks but is able
to retain only limited information from each encountered task, such as a learned
predictor. In contrast to most previous works analyzing this scenario, we do not
make any distributional assumptions on the task generating process. Instead, we
formulate a complexity measure that captures the diversity of the observed tasks.
We provide a lifelong learning algorithm with error guarantees for every observed
task (rather than on average). We show sample complexity reductions in comparison
to solving every task in isolation in terms of our task complexity measure. Further,
our algorithmic framework can naturally be viewed as learning a representation
from encountered tasks with a neural network.
acknowledgement: "This work was in parts funded by the European Research Council under
the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement
no 308036.\r\n\r\n"
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Ruth
full_name: Urner, Ruth
last_name: Urner
citation:
ama: 'Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol
29. Neural Information Processing Systems; 2016:3619-3627.'
apa: 'Pentina, A., & Urner, R. (2016). Lifelong learning with weighted majority
votes (Vol. 29, pp. 3619–3627). Presented at the NIPS: Neural Information Processing
Systems, Barcelona, Spain: Neural Information Processing Systems.'
chicago: Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority
Votes,” 29:3619–27. Neural Information Processing Systems, 2016.
ieee: 'A. Pentina and R. Urner, “Lifelong learning with weighted majority votes,”
presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain,
2016, vol. 29, pp. 3619–3627.'
ista: 'Pentina A, Urner R. 2016. Lifelong learning with weighted majority votes.
NIPS: Neural Information Processing Systems, Advances in Neural Information Processing
Systems, vol. 29, 3619–3627.'
mla: Pentina, Anastasia, and Ruth Urner. Lifelong Learning with Weighted Majority
Votes. Vol. 29, Neural Information Processing Systems, 2016, pp. 3619–27.
short: A. Pentina, R. Urner, in:, Neural Information Processing Systems, 2016, pp.
3619–3627.
conference:
end_date: 2016-12-10
location: Barcelona, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:08Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2021-01-12T06:48:15Z
day: '01'
ddc:
- '006'
department:
- _id: ChLa
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:42Z
date_updated: 2018-12-12T10:12:42Z
file_id: '4961'
file_name: IST-2017-775-v1+1_main.pdf
file_size: 237111
relation: main_file
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:43Z
date_updated: 2018-12-12T10:12:43Z
file_id: '4962'
file_name: IST-2017-775-v1+2_supplementary.pdf
file_size: 185818
relation: main_file
file_date_updated: 2018-12-12T10:12:43Z
has_accepted_license: '1'
intvolume: ' 29'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 3619-3627
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6277'
pubrep_id: '775'
quality_controlled: '1'
scopus_import: 1
status: public
title: Lifelong learning with weighted majority votes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '1099'
abstract:
- lang: eng
text: We present FlexMolds, a novel computational approach to automatically design
flexible, reusable molds that, once 3D printed, allow us to physically fabricate,
by means of liquid casting, multiple copies of complex shapes with rich surface
details and complex topology. The approach to design such flexible molds is based
on a greedy bottom-up search of possible cuts over an object, evaluating for each
possible cut the feasibility of the resulting mold. We use a dynamic simulation
approach to evaluate candidate molds, providing a heuristic to generate forces
that are able to open, detach, and remove a complex mold from the object it surrounds.
We have tested the approach with a number of objects with nontrivial shapes and
topologies.
acknowledgement: "The armadillo, bunny and dragon models are courtesy of the Stanford
\ 3D Scanning Repository. The bimba, fertility and elephant models are courtesy
of the AIM@SHAPE Shape Repository. \r\nThis project has received funding from the
European Union’s Horizon 2020 research and innovation programme under grant
\ agreement\r\nNo. 645599."
alternative_title:
- ACM Transactions on Graphics
article_number: '223'
author:
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Paolo
full_name: Cignoni, Paolo
last_name: Cignoni
citation:
ama: 'Malomo L, Pietroni N, Bickel B, Cignoni P. FlexMolds: Automatic design of
flexible shells for molding. In: Vol 35. ACM; 2016. doi:10.1145/2980179.2982397'
apa: 'Malomo, L., Pietroni, N., Bickel, B., & Cignoni, P. (2016). FlexMolds:
Automatic design of flexible shells for molding (Vol. 35). Presented at the SIGGRAPH
Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques
in Asia, Macao, China: ACM. https://doi.org/10.1145/2980179.2982397'
chicago: 'Malomo, Luigi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “FlexMolds:
Automatic Design of Flexible Shells for Molding,” Vol. 35. ACM, 2016. https://doi.org/10.1145/2980179.2982397.'
ieee: 'L. Malomo, N. Pietroni, B. Bickel, and P. Cignoni, “FlexMolds: Automatic
design of flexible shells for molding,” presented at the SIGGRAPH Asia: Conference
and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao,
China, 2016, vol. 35, no. 6.'
ista: 'Malomo L, Pietroni N, Bickel B, Cignoni P. 2016. FlexMolds: Automatic design
of flexible shells for molding. SIGGRAPH Asia: Conference and Exhibition on Computer
Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol.
35, 223.'
mla: 'Malomo, Luigi, et al. FlexMolds: Automatic Design of Flexible Shells for
Molding. Vol. 35, no. 6, 223, ACM, 2016, doi:10.1145/2980179.2982397.'
short: L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.
conference:
end_date: 2016-12-08
location: Macao, China
name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
Techniques in Asia'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:08Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2021-01-12T06:48:16Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: BeBi
doi: 10.1145/2980179.2982397
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:01Z
date_updated: 2018-12-12T10:12:01Z
file_id: '4918'
file_name: IST-2017-760-v1+1_flexmolds.pdf
file_size: 11122029
relation: main_file
file_date_updated: 2018-12-12T10:12:01Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
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: '6276'
pubrep_id: '760'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'FlexMolds: Automatic design of flexible shells for molding'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2016'
...
---
_id: '1100'
abstract:
- lang: eng
text: During metazoan development, the temporal pattern of morphogen signaling is
critical for organizing cell fates in space and time. Yet, tools for temporally
controlling morphogen signaling within the embryo are still scarce. Here, we developed
a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal
signaling affects cell fate specification during zebrafish gastrulation. By using
this receptor to manipulate the duration of Nodal signaling in vivo by light,
we show that extended Nodal signaling within the organizer promotes prechordal
plate specification and suppresses endoderm differentiation. Endoderm differentiation
is suppressed by extended Nodal signaling inducing expression of the transcriptional
repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains
Nodal signaling from upregulating the endoderm differentiation gene sox17 within
these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical
role of Nodal signaling duration for organizer cell fate specification during
gastrulation.
acknowledged_ssus:
- _id: SSU
acknowledgement: 'We are grateful to members of the C.-P.H. and H.J. labs for discussions,
R. Hauschild and the different Scientific Service Units at IST Austria for technical
help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier
version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce,
and L. Solnica-Krezel for sending plasmids. This work was supported by grants from
the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H.,
and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon
Areces fellowship.'
author:
- first_name: Keisuke
full_name: Sako, Keisuke
id: 3BED66BE-F248-11E8-B48F-1D18A9856A87
last_name: Sako
orcid: 0000-0002-6453-8075
- first_name: Saurabh
full_name: Pradhan, Saurabh
last_name: Pradhan
- first_name: Vanessa
full_name: Barone, Vanessa
id: 419EECCC-F248-11E8-B48F-1D18A9856A87
last_name: Barone
orcid: 0000-0003-2676-3367
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Patrick
full_name: Mueller, Patrick
last_name: Mueller
- first_name: Verena
full_name: Ruprecht, Verena
id: 4D71A03A-F248-11E8-B48F-1D18A9856A87
last_name: Ruprecht
orcid: 0000-0003-4088-8633
- first_name: Daniel
full_name: Capek, Daniel
id: 31C42484-F248-11E8-B48F-1D18A9856A87
last_name: Capek
orcid: 0000-0001-5199-9940
- first_name: Sanjeev
full_name: Galande, Sanjeev
last_name: Galande
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling
reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 2016;16(3):866-877. doi:10.1016/j.celrep.2016.06.036
apa: Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht,
V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals
a temporal pattern of nodal signaling regulating cell fate specification during
gastrulation. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2016.06.036
chicago: Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick
Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and
Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports. Cell Press, 2016. https://doi.org/10.1016/j.celrep.2016.06.036.
ieee: K. Sako et al., “Optogenetic control of nodal signaling reveals a temporal
pattern of nodal signaling regulating cell fate specification during gastrulation,”
Cell Reports, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.
ista: Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek
D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal
signaling reveals a temporal pattern of nodal signaling regulating cell fate specification
during gastrulation. Cell Reports. 16(3), 866–877.
mla: Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal
Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.”
Cell Reports, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:10.1016/j.celrep.2016.06.036.
short: K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht,
D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016)
866–877.
date_created: 2018-12-11T11:50:08Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2024-03-25T23:30:13Z
day: '19'
ddc:
- '570'
- '576'
department:
- _id: CaHe
- _id: HaJa
doi: 10.1016/j.celrep.2016.06.036
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:04Z
date_updated: 2018-12-12T10:11:04Z
file_id: '4857'
file_name: IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf
file_size: 3921947
relation: main_file
file_date_updated: 2018-12-12T10:11:04Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 866 - 877
project:
- _id: 2529486C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T 560-B17
name: Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation
- _id: 2527D5CC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 812-B12
name: Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
publication: Cell Reports
publication_status: published
publisher: Cell Press
publist_id: '6275'
pubrep_id: '754'
quality_controlled: '1'
related_material:
record:
- id: '961'
relation: dissertation_contains
status: public
- id: '50'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Optogenetic control of nodal signaling reveals a temporal pattern of nodal
signaling regulating cell fate specification during gastrulation
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2016'
...
---
_id: '1102'
abstract:
- lang: eng
text: Weakly-supervised object localization methods tend to fail for object classes
that consistently co-occur with the same background elements, e.g. trains on tracks.
We propose a method to overcome these failures by adding a very small amount of
model-specific additional annotation. The main idea is to cluster a deep network\'s
mid-level representations and assign object or distractor labels to each cluster.
Experiments show substantially improved localization results on the challenging
ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for
semantic segmentation.
acknowledgement: "This work was funded in parts by the European Research Council\r\nunder
the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant\r\nagreement
no 308036. We gratefully acknowledge the support of NVIDIA Corporation with\r\nthe
donation of the GPUs used for this research."
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. Improving weakly-supervised object localization by
micro-annotation. In: Proceedings of the British Machine Vision Conference
2016. Vol 2016-September. BMVA Press; 2016:92.1-92.12. doi:10.5244/C.30.92'
apa: 'Kolesnikov, A., & Lampert, C. (2016). Improving weakly-supervised object
localization by micro-annotation. In Proceedings of the British Machine Vision
Conference 2016 (Vol. 2016–September, p. 92.1-92.12). York, United Kingdom:
BMVA Press. https://doi.org/10.5244/C.30.92'
chicago: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised
Object Localization by Micro-Annotation.” In Proceedings of the British Machine
Vision Conference 2016, 2016–September:92.1-92.12. BMVA Press, 2016. https://doi.org/10.5244/C.30.92.
ieee: A. Kolesnikov and C. Lampert, “Improving weakly-supervised object localization
by micro-annotation,” in Proceedings of the British Machine Vision Conference
2016, York, United Kingdom, 2016, vol. 2016–September, p. 92.1-92.12.
ista: 'Kolesnikov A, Lampert C. 2016. Improving weakly-supervised object localization
by micro-annotation. Proceedings of the British Machine Vision Conference 2016.
BMVC: British Machine Vision Conference vol. 2016–September, 92.1-92.12.'
mla: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised
Object Localization by Micro-Annotation.” Proceedings of the British Machine
Vision Conference 2016, vol. 2016–September, BMVA Press, 2016, p. 92.1-92.12,
doi:10.5244/C.30.92.
short: A. Kolesnikov, C. Lampert, in:, Proceedings of the British Machine Vision
Conference 2016, BMVA Press, 2016, p. 92.1-92.12.
conference:
end_date: 2016-09-22
location: York, United Kingdom
name: 'BMVC: British Machine Vision Conference'
start_date: 2016-09-19
date_created: 2018-12-11T11:50:09Z
date_published: 2016-09-01T00:00:00Z
date_updated: 2021-01-12T06:48:18Z
day: '01'
department:
- _id: ChLa
doi: 10.5244/C.30.92
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.bmva.org/bmvc/2016/papers/paper092/paper092.pdf
month: '09'
oa: 1
oa_version: Published Version
page: 92.1-92.12
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the British Machine Vision Conference 2016
publication_status: published
publisher: BMVA Press
publist_id: '6273'
quality_controlled: '1'
scopus_import: 1
status: public
title: Improving weakly-supervised object localization by micro-annotation
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2016-September
year: '2016'
...
---
_id: '1103'
abstract:
- lang: eng
text: We propose two parallel state-space-exploration algorithms for hybrid automaton
(HA), with the goal of enhancing performance on multi-core shared-memory systems.
The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN
model checker, when traversing the discrete modes of the HA, and enhances it with
a parallel exploration of the continuous states within each mode. We show that
this simple-minded extension of PBFS does not provide the desired load balancing
in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS),
which uses a cheap precomputation of the cost associated with the post operations
(both continuous and discrete) in order to improve load balancing. We illustrate
the TP-BFS and the cost precomputation of the post operators on a support-function-based
algorithm for state-space exploration. The performance comparison of the two algorithms
shows that, in general, TP-BFS provides a better utilization/load-balancing of
the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments
show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect
to SpaceEx LGG scenario. In order to make the comparison fair, we employed an
equal number of post operations in both tools. To the best of our knowledge, this
paper represents the first attempt to provide parallel, reachability-analysis
algorithms for HA.
acknowledgement: This work was supported in part by DST-SERB, GoI under Project No.
YSS/2014/000623 and by the European Research Council (ERC) under grant 267989 (QUAREM)
and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23
(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).
article_number: '7797741'
author:
- first_name: Amit
full_name: Gurung, Amit
last_name: Gurung
- first_name: Arup
full_name: Deka, Arup
last_name: Deka
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Rajarshi
full_name: Ray, Rajarshi
last_name: Ray
citation:
ama: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability
analysis for hybrid systems. In: IEEE; 2016. doi:10.1109/MEMCOD.2016.7797741'
apa: 'Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., & Ray, R.
(2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE:
International Conference on Formal Methods and Models for System Design, Kanpur,
India : IEEE. https://doi.org/10.1109/MEMCOD.2016.7797741'
chicago: Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and
Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016.
https://doi.org/10.1109/MEMCOD.2016.7797741.
ieee: 'A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel
reachability analysis for hybrid systems,” presented at the MEMOCODE: International
Conference on Formal Methods and Models for System Design, Kanpur, India , 2016.'
ista: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel
reachability analysis for hybrid systems. MEMOCODE: International Conference on
Formal Methods and Models for System Design, 7797741.'
mla: Gurung, Amit, et al. Parallel Reachability Analysis for Hybrid Systems.
7797741, IEEE, 2016, doi:10.1109/MEMCOD.2016.7797741.
short: A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE,
2016.
conference:
end_date: 2016-11-20
location: 'Kanpur, India '
name: 'MEMOCODE: International Conference on Formal Methods and Models for System
Design'
start_date: 2016-11-18
date_created: 2018-12-11T11:50:09Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2021-01-12T06:48:18Z
day: '27'
department:
- _id: ToHe
doi: 10.1109/MEMCOD.2016.7797741
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.05473
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '6272'
quality_controlled: '1'
scopus_import: 1
status: public
title: Parallel reachability analysis for hybrid systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '11069'
abstract:
- lang: eng
text: Repeated rounds of nuclear envelope (NE) rupture and repair have been observed
in laminopathy and cancer cells and result in intermittent loss of nucleus compartmentalization.
Currently, the causes of NE rupture are unclear. Here, we show that NE rupture
in cancer cells relies on the assembly of contractile actin bundles that interact
with the nucleus via the linker of nucleoskeleton and cytoskeleton (LINC) complex.
We found that the loss of actin bundles or the LINC complex did not rescue nuclear
lamina defects, a previously identified determinant of nuclear membrane stability,
but did decrease the number and size of chromatin hernias. Finally, NE rupture
inhibition could be rescued in cells treated with actin-depolymerizing drugs by
mechanically constraining nucleus height. These data suggest a model of NE rupture
where weak membrane areas, caused by defects in lamina organization, rupture because
of an increase in intranuclear pressure from actin-based nucleus confinement.
article_processing_charge: No
article_type: original
author:
- first_name: Emily M.
full_name: Hatch, Emily M.
last_name: Hatch
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Hatch EM, Hetzer M. Nuclear envelope rupture is induced by actin-based nucleus
confinement. Journal of Cell Biology. 2016;215(1):27-36. doi:10.1083/jcb.201603053
apa: Hatch, E. M., & Hetzer, M. (2016). Nuclear envelope rupture is induced
by actin-based nucleus confinement. Journal of Cell Biology. Rockefeller
University Press. https://doi.org/10.1083/jcb.201603053
chicago: Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced
by Actin-Based Nucleus Confinement.” Journal of Cell Biology. Rockefeller
University Press, 2016. https://doi.org/10.1083/jcb.201603053.
ieee: E. M. Hatch and M. Hetzer, “Nuclear envelope rupture is induced by actin-based
nucleus confinement,” Journal of Cell Biology, vol. 215, no. 1. Rockefeller
University Press, pp. 27–36, 2016.
ista: Hatch EM, Hetzer M. 2016. Nuclear envelope rupture is induced by actin-based
nucleus confinement. Journal of Cell Biology. 215(1), 27–36.
mla: Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by
Actin-Based Nucleus Confinement.” Journal of Cell Biology, vol. 215, no.
1, Rockefeller University Press, 2016, pp. 27–36, doi:10.1083/jcb.201603053.
short: E.M. Hatch, M. Hetzer, Journal of Cell Biology 215 (2016) 27–36.
date_created: 2022-04-07T07:47:42Z
date_published: 2016-10-03T00:00:00Z
date_updated: 2022-07-18T08:33:47Z
day: '03'
doi: 10.1083/jcb.201603053
extern: '1'
external_id:
pmid:
- '27697922'
intvolume: ' 215'
issue: '1'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1083/jcb.201603053
month: '10'
oa: 1
oa_version: Published Version
page: 27-36
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 0021-9525
- 1540-8140
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear envelope rupture is induced by actin-based nucleus confinement
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 215
year: '2016'
...
---
_id: '11070'
abstract:
- lang: eng
text: The organization of the genome in the three-dimensional space of the nucleus
is coupled with cell type-specific gene expression. However, how nuclear architecture
influences transcription that governs cell identity remains unknown. Here, we
show that nuclear pore complex (NPC) components Nup93 and Nup153 bind superenhancers
(SE), regulatory structures that drive the expression of key genes that specify
cell identity. We found that nucleoporin-associated SEs localize preferentially
to the nuclear periphery, and absence of Nup153 and Nup93 results in dramatic
transcriptional changes of SE-associated genes. Our results reveal a crucial role
of NPC components in the regulation of cell type-specifying genes and highlight
nuclear architecture as a regulatory layer of genome functions in cell fate.
article_processing_charge: No
article_type: original
author:
- first_name: Arkaitz
full_name: Ibarra, Arkaitz
last_name: Ibarra
- first_name: Chris
full_name: Benner, Chris
last_name: Benner
- first_name: Swati
full_name: Tyagi, Swati
last_name: Tyagi
- first_name: Jonah
full_name: Cool, Jonah
last_name: Cool
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. Nucleoporin-mediated regulation
of cell identity genes. Genes & Development. 2016;30(20):2253-2258.
doi:10.1101/gad.287417.116
apa: Ibarra, A., Benner, C., Tyagi, S., Cool, J., & Hetzer, M. (2016). Nucleoporin-mediated
regulation of cell identity genes. Genes & Development. Cold Spring
Harbor Laboratory. https://doi.org/10.1101/gad.287417.116
chicago: Ibarra, Arkaitz, Chris Benner, Swati Tyagi, Jonah Cool, and Martin Hetzer.
“Nucleoporin-Mediated Regulation of Cell Identity Genes.” Genes & Development.
Cold Spring Harbor Laboratory, 2016. https://doi.org/10.1101/gad.287417.116.
ieee: A. Ibarra, C. Benner, S. Tyagi, J. Cool, and M. Hetzer, “Nucleoporin-mediated
regulation of cell identity genes,” Genes & Development, vol. 30, no.
20. Cold Spring Harbor Laboratory, pp. 2253–2258, 2016.
ista: Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. 2016. Nucleoporin-mediated
regulation of cell identity genes. Genes & Development. 30(20), 2253–2258.
mla: Ibarra, Arkaitz, et al. “Nucleoporin-Mediated Regulation of Cell Identity Genes.”
Genes & Development, vol. 30, no. 20, Cold Spring Harbor Laboratory,
2016, pp. 2253–58, doi:10.1101/gad.287417.116.
short: A. Ibarra, C. Benner, S. Tyagi, J. Cool, M. Hetzer, Genes & Development
30 (2016) 2253–2258.
date_created: 2022-04-07T07:48:08Z
date_published: 2016-11-02T00:00:00Z
date_updated: 2022-07-18T08:33:49Z
day: '02'
doi: 10.1101/gad.287417.116
extern: '1'
external_id:
pmid:
- '27807035'
intvolume: ' 30'
issue: '20'
keyword:
- Developmental Biology
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/gad.287417.116
month: '11'
oa: 1
oa_version: Published Version
page: 2253-2258
pmid: 1
publication: Genes & Development
publication_identifier:
eissn:
- 1549-5477
issn:
- 0890-9369
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nucleoporin-mediated regulation of cell identity genes
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 30
year: '2016'
...