---
_id: '2188'
abstract:
- lang: eng
text: Although plant and animal cells use a similar core mechanism to deliver proteins
to the plasma membrane, their different lifestyle, body organization and specific
cell structures resulted in the acquisition of regulatory mechanisms that vary
in the two kingdoms. In particular, cell polarity regulators do not seem to be
conserved, because genes encoding key components are absent in plant genomes.
In plants, the broad knowledge on polarity derives from the study of auxin transporters,
the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals,
much information is provided from the study of polarity in epithelial cells that
exhibit basolateral and luminal apical polarities, separated by tight junctions.
In this review, we summarize the similarities and differences of the polarization
mechanisms between plants and animals and survey the main genetic approaches that
have been used to characterize new genes involved in polarity establishment in
plants, including the frequently used forward and reverse genetics screens as
well as a novel chemical genetics approach that is expected to overcome the limitation
of classical genetics methods.
acknowledgement: "This work was supported by a grant from the Research Foundation-Flanders
(Odysseus).\r\n\r\n"
article_number: '140017'
article_processing_charge: No
author:
- first_name: Urszula
full_name: Kania, Urszula
id: 4AE5C486-F248-11E8-B48F-1D18A9856A87
last_name: Kania
- first_name: Matyas
full_name: Fendrych, Matyas
last_name: Fendrych
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences
to animal epithelial cells. Open Biology. 2014;4(APRIL). doi:10.1098/rsob.140017
apa: Kania, U., Fendrych, M., & Friml, J. (2014). Polar delivery in plants;
commonalities and differences to animal epithelial cells. Open Biology.
Royal Society. https://doi.org/10.1098/rsob.140017
chicago: Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants;
Commonalities and Differences to Animal Epithelial Cells.” Open Biology.
Royal Society, 2014. https://doi.org/10.1098/rsob.140017.
ieee: U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities
and differences to animal epithelial cells,” Open Biology, vol. 4, no.
APRIL. Royal Society, 2014.
ista: Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities
and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.
mla: Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences
to Animal Epithelial Cells.” Open Biology, vol. 4, no. APRIL, 140017, Royal
Society, 2014, doi:10.1098/rsob.140017.
short: U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).
corr_author: '1'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-04-16T00:00:00Z
date_updated: 2025-09-29T11:32:17Z
day: '16'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1098/rsob.140017
external_id:
isi:
- '000335813800006'
file:
- access_level: open_access
checksum: 2020627feff36cf0799167c84149fa75
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:40Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5025'
file_name: IST-2016-441-v1+1_140017.full.pdf
file_size: 682570
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: APRIL
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Open Biology
publication_status: published
publisher: Royal Society
publist_id: '4786'
pubrep_id: '441'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Polar delivery in plants; commonalities and differences to animal epithelial
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4
year: '2014'
...
---
_id: '2189'
abstract:
- lang: fre
text: En apprentissage automatique, nous parlons d'adaptation de domaine lorsque
les données de test (cibles) et d'apprentissage (sources) sont générées selon
différentes distributions. Nous devons donc développer des algorithmes de classification
capables de s'adapter à une nouvelle distribution, pour laquelle aucune information
sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle
de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis
comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous
introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq.
PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux
points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté''
(justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage
non itératif qui se focalise dans les régions où les distributions marginales
source et cible sont les plus similaires. Dans un second temps, nous étudions
l'influence de notre auto-étiquetage pour en déduire une procédure de validation
des hyperparamètres. Finalement, notre approche montre des résultats empiriques
prometteurs.
article_processing_charge: No
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
citation:
ama: 'Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non
itératif. In: Vol 1. Elsevier; 2014:49-58.'
apa: 'Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone
sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne,
France: Elsevier.'
chicago: Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif,” 1:49–58. Elsevier, 2014.
ieee: 'E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage
Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014,
vol. 1, pp. 49–58.'
ista: 'Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage
non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine
Learning French Conference) vol. 1, 49–58.'
mla: Morvant, Emilie. Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage
Non Itératif. Vol. 1, Elsevier, 2014, pp. 49–58.
short: E. Morvant, in:, Elsevier, 2014, pp. 49–58.
conference:
location: Saint-Etienne, France
name: 'CAP: Conférence Francophone sur l''Apprentissage Automatique (Machine Learning
French Conference)'
corr_author: '1'
date_created: 2018-12-11T11:56:13Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2024-10-09T20:55:32Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01005776/
month: '07'
oa: 1
oa_version: Preprint
page: 49-58
publication_status: published
publisher: Elsevier
publist_id: '4785'
quality_controlled: '1'
status: public
title: Adaptation de domaine de vote de majorité par auto-étiquetage non itératif
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '2190'
abstract:
- lang: eng
text: We present a new algorithm to construct a (generalized) deterministic Rabin
automaton for an LTL formula φ. The automaton is the product of a master automaton
and an array of slave automata, one for each G-subformula of φ. The slave automaton
for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard
determinization procedures, the states of all our automata have a clear logical
structure, which allows for various optimizations. Our construction subsumes former
algorithms for fragments of LTL. Experimental results show improvement in the
sizes of the resulting automata compared to existing methods.
acknowledgement: The author is on leave from Faculty of Informatics, Masaryk University,
Czech Republic, and partially supported by the Czech Science Foundation, grant No.
P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Javier
full_name: Esparza, Javier
last_name: Esparza
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional
approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13'
apa: 'Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata:
A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the
CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13'
chicago: 'Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata:
A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13.'
ieee: 'J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless
compositional approach,” presented at the CAV: Computer Aided Verification, 2014,
vol. 8559, pp. 192–208.'
ista: 'Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless
compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.'
mla: 'Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata:
A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208,
doi:10.1007/978-3-319-08867-9_13.'
short: J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
conference:
name: 'CAV: Computer Aided Verification'
corr_author: '1'
date_created: 2018-12-11T11:56:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2025-06-11T08:01:04Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-08867-9_13
ec_funded: 1
external_id:
arxiv:
- '1402.3388'
intvolume: ' 8559'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.3388
month: '01'
oa: 1
oa_version: Submitted Version
page: 192 - 208
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_status: published
publisher: Springer
publist_id: '4784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'From LTL to deterministic automata: A safraless compositional approach'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8559
year: '2014'
...
---
_id: '1375'
abstract:
- lang: eng
text: 'We consider directed graphs where each edge is labeled with an integer weight
and study the fundamental algorithmic question of computing the value of a cycle
with minimum mean weight. Our contributions are twofold: (1) First we show that
the algorithmic question is reducible to the problem of a logarithmic number of
min-plus matrix multiplications of n×n-matrices, where n is the number of vertices
of the graph. (2) Second, when the weights are nonnegative, we present the first
(1+ε)-approximation algorithm for the problem and the running time of our algorithm
is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix
multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε))
factor in space a cycle with approximately optimal weight can be computed within
the same time bound.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Michael
full_name: Raskin, Michael
last_name: Raskin
citation:
ama: Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. Approximating
the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116.
doi:10.1016/j.tcs.2014.06.031
apa: Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., & Raskin,
M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031
chicago: Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, Veronika
Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.
ieee: K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin,
“Approximating the minimum cycle mean,” Theoretical Computer Science, vol.
547, no. C. Elsevier, pp. 104–116, 2014.
ista: Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating
the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
mla: Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical
Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.
short: K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical
Computer Science 547 (2014) 104–116.
date_created: 2018-12-11T11:51:40Z
date_published: 2014-08-28T00:00:00Z
date_updated: 2025-09-29T13:17:21Z
day: '28'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2014.06.031
ec_funded: 1
external_id:
arxiv:
- '1307.4473'
isi:
- '000340694000008'
intvolume: ' 547'
isi: 1
issue: C
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.4473
month: '08'
oa: 1
oa_version: Preprint
page: 104 - 116
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5836'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating the minimum cycle mean
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 547
year: '2014'
...
---
_id: '1392'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in ensuring the
reliability of many software applications. In this paper we consider distributed
algorithms whose computations are organized in rounds. To verify the correctness
of such algorithms, we reason about (i) properties (such as invariants) of the
state, (ii) the transitions controlled by the algorithm, and (iii) the communication
graph. We introduce a logic that addresses these points, and contains set comprehensions
with cardinality constraints, function symbols to describe the local states of
each process, and a limited form of quantifier alternation to express the verification
conditions. We show its use in automating the verification of consensus algorithms.
In particular, we give a semi-decision procedure for the unsatisfiability problem
of the logic and identify a decidable fragment. We successfully applied our framework
to verify the correctness of a variety of consensus algorithms tolerant to both
benign faults (message loss, process crashes) and value faults (message corruption).
acknowledgement: Supported by the Vienna Science and Technology Fund (WWTF) through
grant PROSEED.
alternative_title:
- LNCS
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Josef
full_name: Widder, Josef
last_name: Widder
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework
for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:10.1007/978-3-642-54013-4_10'
apa: 'Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., & Zufferey, D. (2014).
A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181).
Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
San Diego, USA: Springer. https://doi.org/10.1007/978-3-642-54013-4_10'
chicago: Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien
Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81.
Springer, 2014. https://doi.org/10.1007/978-3-642-54013-4_10.
ieee: 'C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based
framework for verifying consensus algorithms,” presented at the VMCAI: Verification,
Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp.
161–181.'
ista: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based
framework for verifying consensus algorithms. VMCAI: Verification, Model Checking
and Abstract Interpretation, LNCS, vol. 8318, 161–181.'
mla: Dragoi, Cezara, et al. A Logic-Based Framework for Verifying Consensus Algorithms.
Vol. 8318, Springer, 2014, pp. 161–81, doi:10.1007/978-3-642-54013-4_10.
short: C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer,
2014, pp. 161–181.
conference:
end_date: 2014-01-21
location: San Diego, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2018-12-11T11:51:45Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:22Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-54013-4_10
ec_funded: 1
file:
- access_level: open_access
checksum: bffa33d39be77df0da39defe97eabf84
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:06Z
date_updated: 2020-07-14T12:44:48Z
file_id: '4859'
file_name: IST-2014-179-v1+1_vmcai14.pdf
file_size: 444138
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 8318'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 161 - 181
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
publication_status: published
publisher: Springer
publist_id: '5817'
pubrep_id: '179'
quality_controlled: '1'
scopus_import: 1
status: public
title: A logic-based framework for verifying consensus algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '1393'
abstract:
- lang: eng
text: 'Probabilistic programs are usual functional or imperative programs with two
added constructs: (1) the ability to draw values at random from distributions,
and (2) the ability to condition values of variables in a program via observations.
Models from diverse application areas such as computer vision, coding theory,
cryptographic protocols, biology and reliability analysis can be written as probabilistic
programs. Probabilistic inference is the problem of computing an explicit representation
of the probability distribution implicitly specified by a probabilistic program.
Depending on the application, the desired output from inference may vary-we may
want to estimate the expected value of some function f with respect to the distribution,
or the mode of the distribution, or simply a set of samples drawn from the distribution.
In this paper, we describe connections this research area called \Probabilistic
Programming" has with programming languages and software engineering, and
this includes language design, and the static and dynamic analysis of programs.
We survey current state of the art and speculate on promising directions for future
research.'
article_processing_charge: No
author:
- first_name: Andrew
full_name: Gordon, Andrew
last_name: Gordon
- 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: Aditya
full_name: Nori, Aditya
last_name: Nori
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In:
Proceedings of the on Future of Software Engineering. ACM; 2014:167-181.
doi:10.1145/2593882.2593900'
apa: 'Gordon, A., Henzinger, T. A., Nori, A., & Rajamani, S. (2014). Probabilistic
programming. In Proceedings of the on Future of Software Engineering (pp.
167–181). Hyderabad, India: ACM. https://doi.org/10.1145/2593882.2593900'
chicago: Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic
Programming.” In Proceedings of the on Future of Software Engineering,
167–81. ACM, 2014. https://doi.org/10.1145/2593882.2593900.
ieee: A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,”
in Proceedings of the on Future of Software Engineering, Hyderabad, India,
2014, pp. 167–181.
ista: 'Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming.
Proceedings of the on Future of Software Engineering. FOSE: Future of Software
Engineering, 167–181.'
mla: Gordon, Andrew, et al. “Probabilistic Programming.” Proceedings of the on
Future of Software Engineering, ACM, 2014, pp. 167–81, doi:10.1145/2593882.2593900.
short: A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the
on Future of Software Engineering, ACM, 2014, pp. 167–181.
conference:
end_date: 2014-06-07
location: Hyderabad, India
name: 'FOSE: Future of Software Engineering'
start_date: 2014-05-31
date_created: 2018-12-11T11:51:45Z
date_published: 2014-05-31T00:00:00Z
date_updated: 2026-06-18T17:31:28Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/2593882.2593900
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/2593882.2593900
month: '05'
oa: 1
oa_version: Published Version
page: 167 - 181
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
publication: Proceedings of the on Future of Software Engineering
publication_status: published
publisher: ACM
publist_id: '5816'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Probabilistic programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
OA_place: publisher
_id: '1395'
abstract:
- lang: eng
text: In this thesis I studied various individual and social immune defences employed
by the invasive garden ant Lasius neglectus mostly against entomopathogenic fungi. The
first two chapters of this thesis address the phenomenon of 'social immunisation'.
Social immunisation, that is the immunological protection of group members due
to social contact to a pathogen-exposed nestmate, has been described in various
social insect species against different types of pathogens. However, in the case
of entomopathogenic fungi it has, so far, only been demonstrated that social immunisation
exists at all. Its underlying mechanisms r any other properties were, however,
unknown. In the first chapter of this thesis I identified the mechanistic basis
of social immunisation in L. neglectus against the entomopathogenous fungus Metarhizium.
I could show that nestmates of a pathogen-exposed individual contract low-level
infections due to social interactions. These low-level infections are, however,
non-lethal and cause an active stimulation of the immune system, which protects
the nestmates upon subsequent pathogen encounters. In the second chapter of this
thesis I investigated the specificity and colony level effects of social immunisation.
I demonstrated that the protection conferred by social immunisation is highly
specific, protecting ants only against the same pathogen strain. In addition,
depending on the respective context, social immunisation may even cause fitness
costs. I further showed that social immunisation crucially affects sanitary behaviour
and disease dynamics within ant groups. In the third chapter of this thesis I
studied the effects of the ectosymbiotic fungus Laboulbenia formicarum on its
host L. neglectus. Although Laboulbeniales are the largest order of insect-parasitic
fungi, research concerning host fitness consequence is sparse. I showed that highly
Laboulbenia-infected ants sustain fitness costs under resource limitation, however,
gain fitness benefits when exposed to an entomopathogenus fungus. These effects
are probably cause by a prophylactic upregulation of behavioural as well as physiological
immune defences in highly infected ants.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
citation:
ama: 'Konrad M. Immune defences in ants: Effects of social immunisation and a fungal
ectosymbiont in the ant Lasius neglectus. 2014.'
apa: 'Konrad, M. (2014). Immune defences in ants: Effects of social immunisation
and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science
and Technology Austria.'
chicago: 'Konrad, Matthias. “Immune Defences in Ants: Effects of Social Immunisation
and a Fungal Ectosymbiont in the Ant Lasius Neglectus.” Institute of Science and
Technology Austria, 2014.'
ieee: 'M. Konrad, “Immune defences in ants: Effects of social immunisation and a
fungal ectosymbiont in the ant Lasius neglectus,” Institute of Science and Technology
Austria, 2014.'
ista: 'Konrad M. 2014. Immune defences in ants: Effects of social immunisation and
a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology
Austria.'
mla: 'Konrad, Matthias. Immune Defences in Ants: Effects of Social Immunisation
and a Fungal Ectosymbiont in the Ant Lasius Neglectus. Institute of Science
and Technology Austria, 2014.'
short: 'M. Konrad, Immune Defences in Ants: Effects of Social Immunisation and a
Fungal Ectosymbiont in the Ant Lasius Neglectus, Institute of Science and Technology
Austria, 2014.'
corr_author: '1'
date_created: 2018-12-11T11:51:46Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2026-04-09T14:27:01Z
day: '01'
degree_awarded: PhD
department:
- _id: SyCr
language:
- iso: eng
month: '02'
oa_version: None
page: '131'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5814'
status: public
supervisor:
- first_name: Sylvia M
full_name: Cremer, Sylvia M
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
title: 'Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont
in the ant Lasius neglectus'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2014'
...
---
OA_place: publisher
_id: '1402'
abstract:
- lang: eng
text: Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated
into various lipid signaling molecules, designated polyphosphoinositides (PPIs).
The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol
is performed by a set of organelle-specific kinases and phosphatases, and the
characteristic head groups make these molecules ideal for regulating biological
processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2
play crucial roles in trafficking toward the lytic compartments, whereas the role
in plants is not yet fully understood. Here we identified the role of a land plant-specific
subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during
vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize
to the tonoplast along with Ptdlns3P, the presumable product of their activity.
in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates
and bisphosphates were changed, with opposite effects on the morphology of storage
and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover,
multiple sac knockout mutants had an increased number of smaller storage and lytic
vacuoles, whereas extralarge vacuoles were observed in the overexpression lines,
correlating with various growth and developmental defects. The fragmented vacuolar
phenotype of sac mutants could be mimicked by treating wild-type seedlings with
Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology.
Taken together, these results provide evidence that PPIs, together with their
metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar
morphology and function in plants.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Petra
full_name: Marhavá, Petra
id: 44E59624-F248-11E8-B48F-1D18A9856A87
last_name: Marhavá
citation:
ama: Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in
Arabidopsis thaliana. 2014.
apa: Marhavá, P. (2014). Molecular mechanisms of patterning and subcellular trafficking
in Arabidopsis thaliana. Institute of Science and Technology Austria.
chicago: Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking
in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014.
ieee: P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking
in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014.
ista: Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking
in Arabidopsis thaliana. Institute of Science and Technology Austria.
mla: Marhavá, Petra. Molecular Mechanisms of Patterning and Subcellular Trafficking
in Arabidopsis Thaliana. Institute of Science and Technology Austria, 2014.
short: P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking
in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014.
corr_author: '1'
date_created: 2018-12-11T11:51:49Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2026-04-09T14:27:28Z
day: '01'
degree_awarded: PhD
department:
- _id: JiFr
language:
- iso: eng
month: '12'
oa_version: None
page: '90'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5805'
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis
thaliana
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2014'
...
---
OA_place: repository
_id: '1403'
abstract:
- lang: eng
text: A variety of developmental and disease related processes depend on epithelial
cell sheet spreading. In order to gain insight into the biophysical mechanism(s)
underlying the tissue morphogenesis we studied the spreading of an epithelium
during the early development of the zebrafish embryo. In zebrafish epiboly the
enveloping cell layer (EVL), a simple squamous epithelium, spreads over the yolk
cell to completely engulf it at the end of gastrulation. Previous studies have
proposed that an actomyosin ring forming within the yolk syncytial layer (YSL)
acts as purse string that through constriction along its circumference pulls on
the margin of the EVL. Direct biophysical evidence for this hypothesis has however
been missing. The aim of the thesis was to understand how the actomyosin ring
may generate pulling forces onto the EVL and what cellular mechanism(s) may facilitate
the spreading of the epithelium. Using laser ablation to measure cortical tension
within the actomyosin ring we found an anisotropic tension distribution, which
was highest along the circumference of the ring. However the low degree of anisotropy
was incompatible with the actomyosin ring functioning as a purse string only.
Additionally, we observed retrograde cortical flow from vegetal parts of the ring
into the EVL margin. Interpreting the experimental data using a theoretical distribution
that models the tissues as active viscous gels led us to proposen that the actomyosin
ring has a twofold contribution to EVL epiboly. It not only acts as a purse string
through constriction along its circumference, but in addition constriction along
the width of the ring generates pulling forces through friction-resisted cortical
flow. Moreover, when rendering the purse string mechanism unproductive EVL epiboly
proceeded normally indicating that the flow-friction mechanism is sufficient to
drive the process. Aiming to understand what cellular mechanism(s) may facilitate
the spreading of the epithelium we found that tension-oriented EVL cell divisions
limit tissue anisotropy by releasing tension along the division axis and promote
epithelial spreading. Notably, EVL cells undergo ectopic cell fusion in conditions
in which oriented-cell division is impaired or the epithelium is mechanically
challenged. Taken together our study of EVL epiboly suggests a novel mechanism
of force generation for actomyosin rings through friction-resisted cortical flow
and highlights the importance of tension-oriented cell divisions in epithelial
morphogenesis.
acknowledged_ssus:
- _id: SSU
alternative_title:
- IST Austria Thesis
article_processing_charge: No
author:
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
citation:
ama: Behrndt M. Forces driving epithelial spreading in zebrafish epiboly. 2014.
apa: Behrndt, M. (2014). Forces driving epithelial spreading in zebrafish epiboly.
IST Austria.
chicago: Behrndt, Martin. “Forces Driving Epithelial Spreading in Zebrafish Epiboly.”
IST Austria, 2014.
ieee: M. Behrndt, “Forces driving epithelial spreading in zebrafish epiboly,” IST
Austria, 2014.
ista: Behrndt M. 2014. Forces driving epithelial spreading in zebrafish epiboly.
IST Austria.
mla: Behrndt, Martin. Forces Driving Epithelial Spreading in Zebrafish Epiboly.
IST Austria, 2014.
short: M. Behrndt, Forces Driving Epithelial Spreading in Zebrafish Epiboly, IST
Austria, 2014.
corr_author: '1'
date_created: 2018-12-11T11:51:49Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2026-06-18T18:45:01Z
day: '01'
ddc:
- '590'
degree_awarded: PhD
department:
- _id: CaHe
file:
- access_level: closed
checksum: 67df5501b1b5b313c3bf9a360d713693
content_type: application/pdf
creator: cchlebak
date_created: 2026-03-09T14:53:14Z
date_updated: 2026-03-09T14:53:14Z
file_id: '21421'
file_name: 2014 Behrnd final.pdf
file_size: 24842978
relation: main_file
file_date_updated: 2026-03-09T14:53:14Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: '91'
publication_status: published
publisher: IST Austria
publist_id: '5804'
related_material:
record:
- id: '2282'
relation: part_of_dissertation
status: public
- id: '2950'
relation: part_of_dissertation
status: public
- id: '3373'
relation: part_of_dissertation
status: public
status: public
supervisor:
- 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
title: Forces driving epithelial spreading in zebrafish epiboly
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2014'
...
---
OA_place: publisher
_id: '1404'
abstract:
- lang: eng
text: "The co-evolution of hosts and pathogens is characterized by continuous adaptations
of both parties. Pathogens of social insects need to adapt towards disease defences
at two levels: 1) individual immunity of each colony member consisting of behavioural
defence strategies as well as humoral and cellular immune responses and 2) social
immunity that is collectively performed by all group members comprising behavioural,
physiological and organisational defence strategies.\r\n\r\nTo disentangle the
selection pressure on pathogens by the collective versus individual level of disease
defence in social insects, we performed an evolution experiment using the Argentine
Ant, Linepithema humile, as a host and a mixture of the general insect pathogenic
fungus Metarhizium spp. (6 strains) as a pathogen. We allowed pathogen evolution
over 10 serial host passages to two different evolution host treatments: (1) only
individual host immunity in a single host treatment, and (2) simultaneously acting
individual and social immunity in a social host treatment, in which an exposed
ant was accompanied by two untreated nestmates.\r\n\r\nBefore starting the pathogen
evolution experiment, the 6 Metarhizium spp. strains were characterised concerning
conidiospore size killing rates in singly and socially reared ants, their competitiveness
under coinfecting conditions and their influence on ant behaviour. We analysed
how the ancestral atrain mixture changed in conidiospere size, killing rate and
strain composition dependent on host treatment (single or social hosts) during
10 passages and found that killing rate and conidiospere size of the pathogen
increased under both evolution regimes, but different depending on host treatment.\r\n\r\nTesting
the evolved strain mixtures that evolved under either the single or social host
treatment under both single and social current rearing conditions in a full factorial
design experiment revealed that the additional collective defences in insect societies
add new selection pressure for their coevolving pathogens that compromise their
ability to adapt to its host at the group level. To our knowledge, this is the
first study directly measuring the influence of social immunity on pathogen evolution."
acknowledgement: This work was funded by the DFG and the ERC.
alternative_title:
- IST Austria Thesis
article_processing_charge: No
author:
- first_name: Miriam
full_name: Stock, Miriam
id: 42462816-F248-11E8-B48F-1D18A9856A87
last_name: Stock
citation:
ama: Stock M. Evolution of a fungal pathogen towards individual versus social immunity
in ants. 2014.
apa: Stock, M. (2014). Evolution of a fungal pathogen towards individual versus
social immunity in ants. IST Austria.
chicago: Stock, Miriam. “Evolution of a Fungal Pathogen towards Individual versus
Social Immunity in Ants.” IST Austria, 2014.
ieee: M. Stock, “Evolution of a fungal pathogen towards individual versus social
immunity in ants,” IST Austria, 2014.
ista: Stock M. 2014. Evolution of a fungal pathogen towards individual versus social
immunity in ants. IST Austria.
mla: Stock, Miriam. Evolution of a Fungal Pathogen towards Individual versus
Social Immunity in Ants. IST Austria, 2014.
short: M. Stock, Evolution of a Fungal Pathogen towards Individual versus Social
Immunity in Ants, IST Austria, 2014.
corr_author: '1'
date_created: 2018-12-11T11:51:49Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2026-04-09T14:33:27Z
day: '01'
department:
- _id: SyCr
language:
- iso: eng
month: '04'
oa_version: None
page: '101'
publication_status: published
publisher: IST Austria
publist_id: '5803'
status: public
supervisor:
- first_name: Sylvia M
full_name: Cremer, Sylvia M
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
title: Evolution of a fungal pathogen towards individual versus social immunity in
ants
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2014'
...
---
_id: '1507'
abstract:
- lang: eng
text: The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue
statistics of large real and complex Hermitian matrices with independent, identically
distributed entries are universal in a sense that they depend only on the symmetry
class of the matrix and otherwise are independent of the details of the distribution.
We present the recent solution to this half-century old conjecture. We explain
how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as
De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also
show related results for log-gases that represent a universal model for strongly
correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss
the extensions of these universality results to more realistic physical systems
such as random band matrices.
acknowledgement: The author is partially supported by SFB-TR 12 Grant of the German
Research Council.
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: 'Erdös L. Random matrices, log-gases and Hölder regularity. In: Proceedings
of the International Congress of Mathematicians. Vol 3. International Congress
of Mathematicians; 2014:214-236.'
apa: 'Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In Proceedings
of the International Congress of Mathematicians (Vol. 3, pp. 214–236). Seoul,
Korea: International Congress of Mathematicians.'
chicago: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In Proceedings
of the International Congress of Mathematicians, 3:214–36. International Congress
of Mathematicians, 2014.
ieee: L. Erdös, “Random matrices, log-gases and Hölder regularity,” in Proceedings
of the International Congress of Mathematicians, Seoul, Korea, 2014, vol.
3, pp. 214–236.
ista: 'Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings
of the International Congress of Mathematicians. ICM: International Congress of
Mathematicians vol. 3, 214–236.'
mla: Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” Proceedings
of the International Congress of Mathematicians, vol. 3, International Congress
of Mathematicians, 2014, pp. 214–36.
short: L. Erdös, in:, Proceedings of the International Congress of Mathematicians,
International Congress of Mathematicians, 2014, pp. 214–236.
conference:
end_date: 2014-08-21
location: Seoul, Korea
name: 'ICM: International Congress of Mathematicians'
start_date: 2014-08-13
date_created: 2018-12-11T11:52:25Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2025-06-11T07:52:59Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
external_id:
arxiv:
- '1407.5752'
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.5752
month: '08'
oa: 1
oa_version: Submitted Version
page: 214 - 236
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Proceedings of the International Congress of Mathematicians
publication_status: published
publisher: International Congress of Mathematicians
publist_id: '5670'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Random matrices, log-gases and Hölder regularity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2014'
...
---
_id: '1516'
abstract:
- lang: eng
text: "We present a rigorous derivation of the BCS gap equation for superfluid fermionic
gases with point interactions. Our starting point is the BCS energy functional,
whose minimizer we investigate in the limit when the range of the interaction
potential goes to zero.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Gerhard
full_name: Bräunlich, Gerhard
last_name: Bräunlich
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid
fermionic gases. In: Proceedings of the QMath12 Conference. World Scientific
Publishing; 2014:127-137. doi:10.1142/9789814618144_0007'
apa: 'Bräunlich, G., Hainzl, C., & Seiringer, R. (2014). On the BCS gap equation
for superfluid fermionic gases. In Proceedings of the QMath12 Conference
(pp. 127–137). Berlin, Germany: World Scientific Publishing. https://doi.org/10.1142/9789814618144_0007'
chicago: Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS
Gap Equation for Superfluid Fermionic Gases.” In Proceedings of the QMath12
Conference, 127–37. World Scientific Publishing, 2014. https://doi.org/10.1142/9789814618144_0007.
ieee: G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid
fermionic gases,” in Proceedings of the QMath12 Conference, Berlin, Germany,
2014, pp. 127–137.
ista: 'Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid
fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results
in Quantum Physics, 127–137.'
mla: Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic
Gases.” Proceedings of the QMath12 Conference, World Scientific Publishing,
2014, pp. 127–37, doi:10.1142/9789814618144_0007.
short: G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference,
World Scientific Publishing, 2014, pp. 127–137.
conference:
end_date: 2013-09-13
location: Berlin, Germany
name: 'QMath: Mathematical Results in Quantum Physics'
start_date: 2013-09-10
date_created: 2018-12-11T11:52:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:19Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/9789814618144_0007
external_id:
arxiv:
- '1403.2563'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1403.2563
month: '01'
oa: 1
oa_version: Preprint
page: 127 - 137
publication: Proceedings of the QMath12 Conference
publication_status: published
publisher: World Scientific Publishing
publist_id: '5661'
quality_controlled: '1'
status: public
title: On the BCS gap equation for superfluid fermionic gases
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1629'
abstract:
- lang: eng
text: We propose a method for propagating edit operations in 2D vector graphics,
based on geometric relationship functions. These functions quantify the geometric
relationship of a point to a polygon, such as the distance to the boundary or
the direction to the closest corner vertex. The level sets of the relationship
functions describe points with the same relationship to a polygon. For a given
query point, we first determine a set of relationships to local features, construct
all level sets for these relationships, and accumulate them. The maxima of the
resulting distribution are points with similar geometric relationships. We show
extensions to handle mirror symmetries, and discuss the use of relationship functions
as local coordinate systems. Our method can be applied, for example, to interactive
floorplan editing, and it is especially useful for large layouts, where individual
edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds
of objects by propagating relatively few edit operations.
article_number: '15'
article_processing_charge: No
author:
- first_name: Paul
full_name: Guerrero, Paul
last_name: Guerrero
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Michael
full_name: Wimmer, Michael
last_name: Wimmer
- first_name: Peter
full_name: Wonka, Peter
last_name: Wonka
citation:
ama: Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2591010
apa: Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2014). Edit propagation
using geometric relationship functions. ACM Transactions on Graphics. ACM.
https://doi.org/10.1145/2591010
chicago: Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit
Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics.
ACM, 2014. https://doi.org/10.1145/2591010.
ieee: P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using
geometric relationship functions,” ACM Transactions on Graphics, vol. 33,
no. 2. ACM, 2014.
ista: Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 33(2), 15.
mla: Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.”
ACM Transactions on Graphics, vol. 33, no. 2, 15, ACM, 2014, doi:10.1145/2591010.
short: P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics
33 (2014).
date_created: 2018-12-11T11:53:08Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2025-09-29T13:16:25Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2591010
external_id:
isi:
- '000335009900003'
file:
- access_level: open_access
checksum: 7f91e588a4e888610313b98271e6418e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:22Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4876'
file_name: IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf
file_size: 9832561
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '5526'
pubrep_id: '577'
quality_controlled: '1'
status: public
title: Edit propagation using geometric relationship functions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2014'
...
---
_id: '1643'
abstract:
- lang: eng
text: We extend the notion of verifiable random functions (VRF) to constrained VRFs,
which generalize the concept of constrained pseudorandom functions, put forward
by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13)
and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs,
respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom
function at any point of its domain; in addition, it enables computation of a
non-interactive proof that the function value was computed correctly. In a constrained
VRF from the key sk one can derive constrained keys skS for subsets S of the domain,
which allow computation of function values and proofs only at points in S. After
formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based
constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for
any set that can be decided by a polynomial-size circuit. Our VRFs have the same
function values as the Boneh-Waters PRFs and are proved secure under the same
hardness assumption, showing that verifiability comes at no cost. Constrained
(functional) VRFs were stated as an open problem by Boyle et al.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De
Prisco R, eds. SCN 2014. Vol 8642. Springer; 2014:95-114. doi:10.1007/978-3-319-10879-7_7'
apa: 'Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla
& R. De Prisco (Eds.), SCN 2014 (Vol. 8642, pp. 95–114). Amalfi, Italy:
Springer. https://doi.org/10.1007/978-3-319-10879-7_7'
chicago: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In SCN
2014, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer,
2014. https://doi.org/10.1007/978-3-319-10879-7_7.
ieee: G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in SCN 2014,
Amalfi, Italy, 2014, vol. 8642, pp. 95–114.
ista: 'Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN:
Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.'
mla: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” SCN 2014,
edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp.
95–114, doi:10.1007/978-3-319-10879-7_7.
short: G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer,
2014, pp. 95–114.
conference:
end_date: 2014-09-05
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2014-09-03
corr_author: '1'
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2018-12-11T11:53:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-06-22T14:10:02Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-10879-7_7
ec_funded: 1
editor:
- first_name: Michel
full_name: Abdalla, Michel
last_name: Abdalla
- first_name: Roberto
full_name: De Prisco, Roberto
last_name: De Prisco
external_id:
cryptoeprintid:
- 2014/537
intvolume: ' 8642'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2014/537
month: '01'
oa: 1
oa_version: Submitted Version
page: 95 - 114
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: SCN 2014
publication_status: published
publisher: Springer
publist_id: '5509'
scopus_import: '1'
status: public
title: 'Constrained Verifiable Random Functions '
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8642
year: '2014'
...
---
_id: '1702'
abstract:
- lang: eng
text: In this paper we present INTERHORN, a solver for recursion-free Horn clauses.
The main application domain of INTERHORN lies in solving interpolation problems
arising in software verification. We show how a range of interpolation problems,
including path, transition, nested, state/transition and well-founded interpolation
can be handled directly by INTERHORN. By detailing these interpolation problems
and their Horn clause representations, we hope to encourage the emergence of a
common back-end interpolation interface useful for diverse verification tools.
alternative_title:
- EPTCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion
free-horn clauses. In: Electronic Proceedings in Theoretical Computer Science,
EPTCS. Vol 169. Open Publishing Association; 2014:31-38. doi:10.4204/EPTCS.169.5'
apa: 'Gupta, A., Popeea, C., & Rybalchenko, A. (2014). Generalised interpolation
by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical
Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing
Association. https://doi.org/10.4204/EPTCS.169.5'
chicago: Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised
Interpolation by Solving Recursion Free-Horn Clauses.” In Electronic Proceedings
in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing Association,
2014. https://doi.org/10.4204/EPTCS.169.5.
ieee: A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving
recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer
Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.
ista: 'Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving
recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science,
EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.'
mla: Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn
Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS,
vol. 169, Open Publishing Association, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.
short: A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical
Computer Science, EPTCS, Open Publishing Association, 2014, pp. 31–38.
conference:
end_date: 2014-07-17
location: Vienna, Austria
name: 'HCVS: Horn Clauses for Verification and Synthesis'
start_date: 2014-07-17
corr_author: '1'
date_created: 2018-12-11T11:53:33Z
date_published: 2014-12-02T00:00:00Z
date_updated: 2025-06-11T08:03:28Z
day: '02'
department:
- _id: ToHe
doi: 10.4204/EPTCS.169.5
external_id:
arxiv:
- '1303.7378'
intvolume: ' 169'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.7378
month: '12'
oa: 1
oa_version: Submitted Version
page: 31 - 38
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing Association
publist_id: '5435'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalised interpolation by solving recursion free-horn clauses
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 169
year: '2014'
...
---
_id: '1708'
abstract:
- lang: eng
text: It has been long argued that, because of inherent ambiguity and noise, the
brain needs to represent uncertainty in the form of probability distributions.
The neural encoding of such distributions remains however highly controversial.
Here we present a novel circuit model for representing multidimensional real-valued
distributions using a spike based spatio-temporal code. Our model combines the
computational advantages of the currently competing models for probabilistic codes
and exhibits realistic neural responses along a variety of classic measures. Furthermore,
the model highlights the challenges associated with interpreting neural activity
in relation to behavioral uncertainty and points to alternative population-level
approaches for the experimental validation of distributed representations.
article_processing_charge: No
author:
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
- first_name: Sophie
full_name: Denève, Sophie
last_name: Denève
citation:
ama: 'Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking
neural networks. In: Vol 27. Neural Information Processing Systems Foundation;
2014:2024-2032.'
apa: 'Savin, C., & Denève, S. (2014). Spatio-temporal representations of uncertainty
in spiking neural networks (Vol. 27, pp. 2024–2032). Presented at the NIPS: Neural
Information Processing Systems, Montreal, Canada: Neural Information Processing
Systems Foundation.'
chicago: Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of
Uncertainty in Spiking Neural Networks,” 27:2024–32. Neural Information Processing
Systems Foundation, 2014.
ieee: 'C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in
spiking neural networks,” presented at the NIPS: Neural Information Processing
Systems, Montreal, Canada, 2014, vol. 27, no. January, pp. 2024–2032.'
ista: 'Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in
spiking neural networks. NIPS: Neural Information Processing Systems vol. 27,
2024–2032.'
mla: Savin, Cristina, and Sophie Denève. Spatio-Temporal Representations of Uncertainty
in Spiking Neural Networks. Vol. 27, no. January, Neural Information Processing
Systems Foundation, 2014, pp. 2024–32.
short: C. Savin, S. Denève, in:, Neural Information Processing Systems Foundation,
2014, pp. 2024–2032.
conference:
end_date: 2014-12-13
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2014-12-08
corr_author: '1'
date_created: 2018-12-11T11:53:35Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2025-06-03T11:45:08Z
day: '01'
department:
- _id: GaTk
intvolume: ' 27'
issue: January
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf
month: '01'
oa: 1
oa_version: None
page: 2024 - 2032
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '5427'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spatio-temporal representations of uncertainty in spiking neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2014'
...
---
_id: '1852'
abstract:
- lang: eng
text: To control morphogenesis, molecular regulatory networks have to interfere
with the mechanical properties of the individual cells of developing organs and
tissues, but how this is achieved is not well known. We study this issue here
in the shoot meristem of higher plants, a group of undifferentiated cells where
complex changes in growth rates and directions lead to the continuous formation
of new organs [1, 2]. Here, we show that the plant hormone auxin plays an important
role in this process via a dual, local effect on the extracellular matrix, the
cell wall, which determines cell shape. Our study reveals that auxin not only
causes a limited reduction in wall stiffness but also directly interferes with
wall anisotropy via the regulation of cortical microtubule dynamics. We further
show that to induce growth isotropy and organ outgrowth, auxin somehow interferes
with the cortical microtubule-ordering activity of a network of proteins, including
AUXIN BINDING PROTEIN 1 and KATANIN 1. Numerical simulations further indicate
that the induced isotropy is sufficient to amplify the effects of the relatively
minor changes in wall stiffness to promote organogenesis and the establishment
of new growth axes in a robust manner.
acknowledgement: 'This work was funded by grants from EraSysBio+ (iSAM) and ERC (Morphodynamics). '
article_processing_charge: No
author:
- first_name: Massimiliano
full_name: Sassi, Massimiliano
last_name: Sassi
- first_name: Olivier
full_name: Ali, Olivier
last_name: Ali
- first_name: Frédéric
full_name: Boudon, Frédéric
last_name: Boudon
- first_name: Gladys
full_name: Cloarec, Gladys
last_name: Cloarec
- first_name: Ursula
full_name: Abad, Ursula
last_name: Abad
- first_name: Coralie
full_name: Cellier, Coralie
last_name: Cellier
- first_name: Xu
full_name: Chen, Xu
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Benjamin
full_name: Gilles, Benjamin
last_name: Gilles
- first_name: Pascale
full_name: Milani, Pascale
last_name: Milani
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Teva
full_name: Vernoux, Teva
last_name: Vernoux
- first_name: Christophe
full_name: Godin, Christophe
last_name: Godin
- first_name: Olivier
full_name: Hamant, Olivier
last_name: Hamant
- first_name: Jan
full_name: Traas, Jan
last_name: Traas
citation:
ama: Sassi M, Ali O, Boudon F, et al. An auxin-mediated shift toward growth isotropy
promotes organ formation at the shoot meristem in Arabidopsis. Current Biology.
2014;24(19):2335-2342. doi:10.1016/j.cub.2014.08.036
apa: Sassi, M., Ali, O., Boudon, F., Cloarec, G., Abad, U., Cellier, C., … Traas,
J. (2014). An auxin-mediated shift toward growth isotropy promotes organ formation
at the shoot meristem in Arabidopsis. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2014.08.036
chicago: Sassi, Massimiliano, Olivier Ali, Frédéric Boudon, Gladys Cloarec, Ursula
Abad, Coralie Cellier, Xu Chen, et al. “An Auxin-Mediated Shift toward Growth
Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” Current
Biology. Cell Press, 2014. https://doi.org/10.1016/j.cub.2014.08.036.
ieee: M. Sassi et al., “An auxin-mediated shift toward growth isotropy promotes
organ formation at the shoot meristem in Arabidopsis,” Current Biology,
vol. 24, no. 19. Cell Press, pp. 2335–2342, 2014.
ista: Sassi M, Ali O, Boudon F, Cloarec G, Abad U, Cellier C, Chen X, Gilles B,
Milani P, Friml J, Vernoux T, Godin C, Hamant O, Traas J. 2014. An auxin-mediated
shift toward growth isotropy promotes organ formation at the shoot meristem in
Arabidopsis. Current Biology. 24(19), 2335–2342.
mla: Sassi, Massimiliano, et al. “An Auxin-Mediated Shift toward Growth Isotropy
Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” Current Biology,
vol. 24, no. 19, Cell Press, 2014, pp. 2335–42, doi:10.1016/j.cub.2014.08.036.
short: M. Sassi, O. Ali, F. Boudon, G. Cloarec, U. Abad, C. Cellier, X. Chen, B.
Gilles, P. Milani, J. Friml, T. Vernoux, C. Godin, O. Hamant, J. Traas, Current
Biology 24 (2014) 2335–2342.
date_created: 2018-12-11T11:54:22Z
date_published: 2014-10-06T00:00:00Z
date_updated: 2025-09-29T13:10:45Z
day: '06'
department:
- _id: JiFr
doi: 10.1016/j.cub.2014.08.036
external_id:
isi:
- '000342747600031'
intvolume: ' 24'
isi: 1
issue: '19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01074821
month: '10'
oa: 1
oa_version: Submitted Version
page: 2335 - 2342
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '5248'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An auxin-mediated shift toward growth isotropy promotes organ formation at
the shoot meristem in Arabidopsis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 24
year: '2014'
...
---
_id: '1853'
abstract:
- lang: eng
text: Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes
are expected to form the backbone of future intelligent networks for a broad range
of civil, industrial and military applications. These sensor nodes are often deployed
through random spreading, and function in dynamic environments. Many applications
of WSNs such as pollution tracking, forest fire detection, and military surveillance
require knowledge of the location of constituent nodes. But the use of technologies
such as GPS on all nodes is prohibitive due to power and cost constraints. So,
the sensor nodes need to autonomously determine their locations. Most localization
techniques use anchor nodes with known locations to determine the position of
remaining nodes. Localization techniques have two conflicting requirements. On
one hand, an ideal localization technique should be computationally simple and
on the other hand, it must be resistant to attacks that compromise anchor nodes.
In this paper, we propose a computationally light-weight game theoretic secure
localization technique and demonstrate its effectiveness in comparison to existing
techniques.
author:
- first_name: Susmit
full_name: Jha, Susmit
last_name: Jha
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
- first_name: Sanjit
full_name: Seshia, Sanjit
last_name: Seshia
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Jha S, Tripakis S, Seshia S, Chatterjee K. Game theoretic secure localization
in wireless sensor networks. In: IEEE; 2014:85-90. doi:10.1109/IOT.2014.7030120'
apa: 'Jha, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic
secure localization in wireless sensor networks (pp. 85–90). Presented at the
IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120'
chicago: Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee.
“Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE,
2014. https://doi.org/10.1109/IOT.2014.7030120.
ieee: 'S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure
localization in wireless sensor networks,” presented at the IOT: Internet of Things,
Cambridge, USA, 2014, pp. 85–90.'
ista: 'Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization
in wireless sensor networks. IOT: Internet of Things, 85–90.'
mla: Jha, Susmit, et al. Game Theoretic Secure Localization in Wireless Sensor
Networks. IEEE, 2014, pp. 85–90, doi:10.1109/IOT.2014.7030120.
short: S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.
conference:
end_date: 2014-10-08
location: Cambridge, USA
name: 'IOT: Internet of Things'
start_date: 2014-10-06
date_created: 2018-12-11T11:54:22Z
date_published: 2014-02-03T00:00:00Z
date_updated: 2024-10-21T06:02:48Z
day: '03'
department:
- _id: KrCh
doi: 10.1109/IOT.2014.7030120
language:
- iso: eng
month: '02'
oa_version: None
page: 85 - 90
publication_status: published
publisher: IEEE
publist_id: '5247'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Game theoretic secure localization in wireless sensor networks
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1854'
abstract:
- lang: eng
text: In this paper, we present a method for non-rigid, partial shape matching in
vector graphics. Given a user-specified query region in a 2D shape, similar regions
are found, even if they are non-linearly distorted. Furthermore, a non-linear
mapping is established between the query regions and these matches, which allows
the automatic transfer of editing operations such as texturing. This is achieved
by a two-step approach. First, pointwise correspondences between the query region
and the whole shape are established. The transformation parameters of these correspondences
are registered in an appropriate transformation space. For transformations between
similar regions, these parameters form surfaces in transformation space, which
are extracted in the second step of our method. The extracted regions may be related
to the query region by a non-rigid transform, enabling non-rigid shape matching.
In this paper, we present a method for non-rigid, partial shape matching in vector
graphics. Given a user-specified query region in a 2D shape, similar regions are
found, even if they are non-linearly distorted. Furthermore, a non-linear mapping
is established between the query regions and these matches, which allows the automatic
transfer of editing operations such as texturing. This is achieved by a two-step
approach. First, pointwise correspondences between the query region and the whole
shape are established. The transformation parameters of these correspondences
are registered in an appropriate transformation space. For transformations between
similar regions, these parameters form surfaces in transformation space, which
are extracted in the second step of our method. The extracted regions may be related
to the query region by a non-rigid transform, enabling non-rigid shape matching.
article_processing_charge: No
author:
- first_name: Paul
full_name: Guerrero, Paul
last_name: Guerrero
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Michael
full_name: Wimmer, Michael
last_name: Wimmer
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
citation:
ama: Guerrero P, Auzinger T, Wimmer M, Jeschke S. Partial shape matching using transformation
parameter similarity. Computer Graphics Forum. 2014;34(1):239-252. doi:10.1111/cgf.12509
apa: Guerrero, P., Auzinger, T., Wimmer, M., & Jeschke, S. (2014). Partial shape
matching using transformation parameter similarity. Computer Graphics Forum.
Wiley. https://doi.org/10.1111/cgf.12509
chicago: Guerrero, Paul, Thomas Auzinger, Michael Wimmer, and Stefan Jeschke. “Partial
Shape Matching Using Transformation Parameter Similarity.” Computer Graphics
Forum. Wiley, 2014. https://doi.org/10.1111/cgf.12509.
ieee: P. Guerrero, T. Auzinger, M. Wimmer, and S. Jeschke, “Partial shape matching
using transformation parameter similarity,” Computer Graphics Forum, vol.
34, no. 1. Wiley, pp. 239–252, 2014.
ista: Guerrero P, Auzinger T, Wimmer M, Jeschke S. 2014. Partial shape matching
using transformation parameter similarity. Computer Graphics Forum. 34(1), 239–252.
mla: Guerrero, Paul, et al. “Partial Shape Matching Using Transformation Parameter
Similarity.” Computer Graphics Forum, vol. 34, no. 1, Wiley, 2014, pp.
239–52, doi:10.1111/cgf.12509.
short: P. Guerrero, T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum
34 (2014) 239–252.
date_created: 2018-12-11T11:54:22Z
date_published: 2014-11-05T00:00:00Z
date_updated: 2025-09-23T09:47:49Z
day: '05'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.12509
external_id:
isi:
- '000350145600019'
file:
- access_level: open_access
checksum: 91946bfc509c77f5fd3151a3ff2b2c8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:58Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5182'
file_name: IST-2016-574-v1+1_Guerrero-2014-TPS-paper.pdf
file_size: 24817484
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 34'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 239 - 252
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley
publist_id: '5246'
pubrep_id: '574'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial shape matching using transformation parameter similarity
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 34
year: '2014'
...
---
_id: '1862'
abstract:
- lang: eng
text: The prominent and evolutionarily ancient role of the plant hormone auxin is
the regulation of cell expansion. Cell expansion requires ordered arrangement
of the cytoskeleton but molecular mechanisms underlying its regulation by signalling
molecules including auxin are unknown. Here we show in the model plant Arabidopsis
thaliana that in elongating cells exogenous application of auxin or redistribution
of endogenous auxin induces very rapid microtubule re-orientation from transverse
to longitudinal, coherent with the inhibition of cell expansion. This fast auxin
effect requires auxin binding protein 1 (ABP1) and involves a contribution of
downstream signalling components such as ROP6 GTPase, ROP-interactive protein
RIC1 and the microtubule-severing protein katanin. These components are required
for rapid auxin-and ABP1-mediated re-orientation of microtubules to regulate cell
elongation in roots and dark-grown hypocotyls as well as asymmetric growth during
gravitropic responses.
acknowledgement: We thank R. Dixit for performing complementary experiments, D. W.
Ehrhardt and T. Hashimoto for providing the seeds of TUB6–RFP and EB1b–GFP respectively,
E. Zazimalova, J. Petrasek and M. Fendrych for discussing the manuscript and J.
Leung for text optimization. This work was supported by the European Research Council
(project ERC-2011-StG-20101109-PSDP, to J.F.), ANR blanc AuxiWall project (ANR-11-BSV5-0007,
to C.P.-R. and L.G.) and the Agency for Innovation by Science and Technology (IWT)
(to H.R.). This work benefited from the facilities and expertise of the Imagif Cell
Biology platform (http://www.imagif.cnrs.fr), which is supported by the Conseil
Général de l’Essonne.
article_processing_charge: No
article_type: original
author:
- first_name: Xu
full_name: Chen, Xu
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Laurie
full_name: Grandont, Laurie
last_name: Grandont
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Sébastien
full_name: Paque, Sébastien
last_name: Paque
- first_name: Anas
full_name: Abuzeineh, Anas
last_name: Abuzeineh
- first_name: Hana
full_name: Rakusova, Hana
id: 4CAAA450-78D2-11EA-8E57-B40A396E08BA
last_name: Rakusova
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Catherine
full_name: Perrot Rechenmann, Catherine
last_name: Perrot Rechenmann
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Chen X, Grandont L, Li H, et al. Inhibition of cell expansion by rapid ABP1-mediated
auxin effect on microtubules. Nature. 2014;516(729):90-93. doi:10.1038/nature13889
apa: Chen, X., Grandont, L., Li, H., Hauschild, R., Paque, S., Abuzeineh, A., …
Friml, J. (2014). Inhibition of cell expansion by rapid ABP1-mediated auxin effect
on microtubules. Nature. Nature Publishing Group. https://doi.org/10.1038/nature13889
chicago: Chen, Xu, Laurie Grandont, Hongjiang Li, Robert Hauschild, Sébastien Paque,
Anas Abuzeineh, Hana Rakusova, Eva Benková, Catherine Perrot Rechenmann, and Jiří
Friml. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin Effect on Microtubules.”
Nature. Nature Publishing Group, 2014. https://doi.org/10.1038/nature13889.
ieee: X. Chen et al., “Inhibition of cell expansion by rapid ABP1-mediated
auxin effect on microtubules,” Nature, vol. 516, no. 729. Nature Publishing
Group, pp. 90–93, 2014.
ista: Chen X, Grandont L, Li H, Hauschild R, Paque S, Abuzeineh A, Rakusova H, Benková
E, Perrot Rechenmann C, Friml J. 2014. Inhibition of cell expansion by rapid ABP1-mediated
auxin effect on microtubules. Nature. 516(729), 90–93.
mla: Chen, Xu, et al. “Inhibition of Cell Expansion by Rapid ABP1-Mediated Auxin
Effect on Microtubules.” Nature, vol. 516, no. 729, Nature Publishing Group,
2014, pp. 90–93, doi:10.1038/nature13889.
short: X. Chen, L. Grandont, H. Li, R. Hauschild, S. Paque, A. Abuzeineh, H. Rakusova,
E. Benková, C. Perrot Rechenmann, J. Friml, Nature 516 (2014) 90–93.
corr_author: '1'
date_created: 2018-12-11T11:54:25Z
date_published: 2014-12-04T00:00:00Z
date_updated: 2025-09-29T13:10:05Z
day: '04'
department:
- _id: JiFr
- _id: Bio
- _id: EvBe
doi: 10.1038/nature13889
ec_funded: 1
external_id:
isi:
- '000346310800045'
pmid:
- '25409144'
intvolume: ' 516'
isi: 1
issue: '729'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4257754/
month: '12'
oa: 1
oa_version: Submitted Version
page: 90 - 93
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '5237'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inhibition of cell expansion by rapid ABP1-mediated auxin effect on microtubules
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 516
year: '2014'
...